{"$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":"D24","name":"Comment Value","shortDescription":{"text":"Comment Value"},"helpUri":"https://codehealth.canine.dev/dimensions/D24"},{"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":"D31","name":"IaC \u0026 Container Security","shortDescription":{"text":"IaC \u0026 Container Security"},"helpUri":"https://codehealth.canine.dev/dimensions/D31","relationships":[{"target":{"id":"CWE-1032","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-16","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1032","CWE-732","CWE-16"],"owasp":"A02:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AC2","name":"Forms \u0026 labels","shortDescription":{"text":"Forms \u0026 labels"},"helpUri":"https://codehealth.canine.dev/dimensions/AC2"},{"id":"AC3","name":"Page structure","shortDescription":{"text":"Page structure"},"helpUri":"https://codehealth.canine.dev/dimensions/AC3"},{"id":"AC5","name":"ARIA correctness","shortDescription":{"text":"ARIA correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/AC5"},{"id":"AC6","name":"Visual \u0026 motion safety","shortDescription":{"text":"Visual \u0026 motion safety"},"helpUri":"https://codehealth.canine.dev/dimensions/AC6"},{"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":"DM1","name":"Aggregate boundaries","shortDescription":{"text":"Aggregate boundaries"},"helpUri":"https://codehealth.canine.dev/dimensions/DM1"},{"id":"DM2","name":"Strongly-typed ids","shortDescription":{"text":"Strongly-typed ids"},"helpUri":"https://codehealth.canine.dev/dimensions/DM2"},{"id":"DM4","name":"Rich vs anemic domain model","shortDescription":{"text":"Rich vs anemic domain model"},"helpUri":"https://codehealth.canine.dev/dimensions/DM4"},{"id":"DM5","name":"Encapsulated state","shortDescription":{"text":"Encapsulated state"},"helpUri":"https://codehealth.canine.dev/dimensions/DM5"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"ES1","name":"Fold determinism","shortDescription":{"text":"Fold determinism"},"helpUri":"https://codehealth.canine.dev/dimensions/ES1"},{"id":"ES2","name":"Immutable events","shortDescription":{"text":"Immutable events"},"helpUri":"https://codehealth.canine.dev/dimensions/ES2"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P5","name":"DR \u0026 Backup","shortDescription":{"text":"DR \u0026 Backup"},"helpUri":"https://codehealth.canine.dev/dimensions/P5"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"PF1","name":"Benchmark discipline","shortDescription":{"text":"Benchmark discipline"},"helpUri":"https://codehealth.canine.dev/dimensions/PF1"},{"id":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"id":"R1","name":"Type Safety","shortDescription":{"text":"Type Safety"},"helpUri":"https://codehealth.canine.dev/dimensions/R1"},{"id":"R10","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/R10"},{"id":"R11","name":"Import Boundaries","shortDescription":{"text":"Import Boundaries"},"helpUri":"https://codehealth.canine.dev/dimensions/R11"},{"id":"R2","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/R2"},{"id":"R3","name":"Large Files","shortDescription":{"text":"Large Files"},"helpUri":"https://codehealth.canine.dev/dimensions/R3"},{"id":"R4","name":"Test Coverage","shortDescription":{"text":"Test Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/R4"},{"id":"R5","name":"Dependency Freshness","shortDescription":{"text":"Dependency Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/R5"},{"id":"R6","name":"Tooling","shortDescription":{"text":"Tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/R6"},{"id":"R7","name":"Dead Code","shortDescription":{"text":"Dead Code"},"helpUri":"https://codehealth.canine.dev/dimensions/R7"},{"id":"R8","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/R8"},{"id":"R9","name":"Circular Imports","shortDescription":{"text":"Circular Imports"},"helpUri":"https://codehealth.canine.dev/dimensions/R9"},{"id":"S1","name":"Web-Security Posture","shortDescription":{"text":"Web-Security Posture"},"helpUri":"https://codehealth.canine.dev/dimensions/S1"},{"id":"SC1","name":"Supply-chain hygiene","shortDescription":{"text":"Supply-chain hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/SC1"},{"id":"X1","name":"Async correctness","shortDescription":{"text":"Async correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"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":"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":"X5","name":"Nullable reference types","shortDescription":{"text":"Nullable reference types"},"helpUri":"https://codehealth.canine.dev/dimensions/X5"},{"id":"X6","name":"Hand-rolled structured-format parsing","shortDescription":{"text":"Hand-rolled structured-format parsing"},"helpUri":"https://codehealth.canine.dev/dimensions/X6"},{"id":"X7","name":"Silent fallback defaults","shortDescription":{"text":"Silent fallback defaults"},"helpUri":"https://codehealth.canine.dev/dimensions/X7"},{"id":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"rustc_codegen_gcc::intrinsic::old_archs::old_archs (cyclomatic 1362): rustc_codegen_gcc::intrinsic::old_archs::old_archs has cyclomatic complexity 1362 (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":"compiler/rustc_codegen_gcc/src/intrinsic/old_archs.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8bd1664accbdc0dcb593beeb0f6d290709d51bef1c831bab85c76b31d8a974c"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_codegen_llvm::intrinsic::generic_simd_intrinsic (cyclomatic 241): rustc_codegen_llvm::intrinsic::generic_simd_intrinsic has cyclomatic complexity 241 (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":"compiler/rustc_codegen_llvm/src/intrinsic.rs"},"region":{"startLine":1979}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba8ada113c4e6905cbafb3c13a093bad776a42e4747e8a42ced1b096d5f6ae17"}},{"ruleId":"D1","level":"warning","message":{"text":"LangItem::from_u32 (cyclomatic 234): LangItem::from_u32 has cyclomatic complexity 234 (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":"compiler/rustc_attr_ir/src/lang_items.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"2afa137c10d3067ce965732ef3237dbf90ea455e95a72d360b40da27814d13f9"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_codegen_gcc::intrinsic::simd::generic_simd_intrinsic (cyclomatic 218): rustc_codegen_gcc::intrinsic::simd::generic_simd_intrinsic has cyclomatic complexity 218 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (rustc_codegen_gcc::intrinsic::simd::generic_simd_intrinsic::simd_simple_float_intrinsic) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_gcc/src/intrinsic/simd.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"48222e49045e4ecfb13d8a2982984c66d14c8bf76256f986e1ad19fdcfea40a4"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_codegen_cranelift::intrinsics::simd::codegen_simd_intrinsic_call (cyclomatic 202): rustc_codegen_cranelift::intrinsics::simd::codegen_simd_intrinsic_call has cyclomatic complexity 202 (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":"compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd4f445dd138ab86044c71bcdad34f0bfbfbdc70a68e20017ba82489e0006677"}},{"ruleId":"D1","level":"warning","message":{"text":"stdarch_gen_loongarch::gen_test_body (cyclomatic 198): stdarch_gen_loongarch::gen_test_body has cyclomatic complexity 198 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/stdarch-gen-loongarch/src/main.rs"},"region":{"startLine":859}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed7f5a68d8feabf7488e9c45cb75589576dfb07b37b01e33e11cd4d84c1660c7"}},{"ruleId":"D1","level":"warning","message":{"text":"Evaluator::exec_intrinsic (cyclomatic 197): Evaluator::exec_intrinsic has cyclomatic complexity 197 (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/tools/rust-analyzer/crates/hir-ty/src/mir/eval/shim.rs"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"b93c130fa81b3e0abc68ffc3075b287aa2bd9c19e93fc45a9d3ec19841f606f4"}},{"ruleId":"D1","level":"warning","message":{"text":"Methods::check_methods (cyclomatic 191): Methods::check_methods has cyclomatic complexity 191 (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/tools/clippy/clippy_lints/src/methods/mod.rs"},"region":{"startLine":5437}}}],"partialFingerprints":{"codehealthFindingId/v1":"819f82b60280082487ba62c8791f6c9868dc77f43e188fbab5a64d5084a35fc9"}},{"ruleId":"D1","level":"warning","message":{"text":"stringdex.loadDatabase (cyclomatic 172): stringdex.loadDatabase has cyclomatic complexity 172 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: 2 other methods here (stringdex.loadDatabase::makeSearchTreeFromBase64, stringdex.loadDatabase::makeSearchTreeFromBase64::makeBranchesFromBinaryData) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/stringdex.js"},"region":{"startLine":1089}}}],"partialFingerprints":{"codehealthFindingId/v1":"8701b303a38044075eb45b43b551c2c20ab71b8e90fe4ffb51f3dcd3f6665753"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_codegen_cranelift::intrinsics::codegen_regular_intrinsic_call (cyclomatic 167): rustc_codegen_cranelift::intrinsics::codegen_regular_intrinsic_call has cyclomatic complexity 167 (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":"compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"78a87a25c7663d9241c82478941d94d7dff4e251f28992f9310a543d035f68db"}},{"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/tools/miri/src/shims/unix/foreign_items.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1b7a3f9623bd14c8958c6e0a1288970046c3614e68ae566376953c0035430fe"}},{"ruleId":"D1","level":"warning","message":{"text":"ide_completion::context::analysis::classify_name_ref (cyclomatic 152): ide_completion::context::analysis::classify_name_ref has cyclomatic complexity 152 (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/tools/rust-analyzer/crates/ide-completion/src/context/analysis.rs"},"region":{"startLine":967}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb2dcafdbd49496ae64324a819248191387d074d4bfa37bcc4078856012f910e"}},{"ruleId":"D1","level":"warning","message":{"text":"search.initSearch (cyclomatic 146): search.initSearch has cyclomatic complexity 146 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: 12 other methods here (search.initSearch::getItemsBefore, search.initSearch::getNextElem, search.initSearch::createQueryElement, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 13 times rather than 13 independent problems. Splitting this body alone leaves the other 12 exactly as they are. Where these are variations on one operation, the change that clears all 13 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e4f5ae931b787a9e899f86c4340447586e16b5632e22ff8b4a000d773c5b37b"}},{"ruleId":"D1","level":"warning","message":{"text":"InterpCx::eval_simd_intrinsic (cyclomatic 139): InterpCx::eval_simd_intrinsic has cyclomatic complexity 139 (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":"compiler/rustc_const_eval/src/interpret/intrinsics/simd.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"cab21fe91547bcab79c1965053caff002e3b8139fdbecdc586932fef04653b18"}},{"ruleId":"D1","level":"warning","message":{"text":"MirLowerCtx::lower_expr_to_place_without_adjust (cyclomatic 131): MirLowerCtx::lower_expr_to_place_without_adjust has cyclomatic complexity 131 (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/tools/rust-analyzer/crates/hir-ty/src/mir/lower.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"d04aca49ca28943b701939ffd4fbbe9d28a7ef2d541e42fc7cd12e5a1ede48bf"}},{"ruleId":"D1","level":"warning","message":{"text":"Builder::codegen_intrinsic_call (cyclomatic 128): Builder::codegen_intrinsic_call has cyclomatic complexity 128 (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":"compiler/rustc_codegen_llvm/src/intrinsic.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"d63150a6d780bb712fcfd799553afba6f5952601d687ff6baeb673493fde7e38"}},{"ruleId":"D1","level":"warning","message":{"text":"stdarch_gen_loongarch::gen_bind_body (cyclomatic 128): stdarch_gen_loongarch::gen_bind_body has cyclomatic complexity 128 (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":"library/stdarch/crates/stdarch-gen-loongarch/src/main.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfedb8dbe1011f9e78c832199fef7d997dd405e7bf0e3641245af6a5fc803130"}},{"ruleId":"D1","level":"warning","message":{"text":"Config::parse_inner (cyclomatic 120): Config::parse_inner has cyclomatic complexity 120 (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/bootstrap/src/core/config/config.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"99cb5cab7ba8e9d94befbe1ebe7774e97a2ff9d6c178dd96da43ced50448bc47"}},{"ruleId":"D1","level":"warning","message":{"text":"Ty::hir_fmt (cyclomatic 117): Ty::hir_fmt has cyclomatic complexity 117 (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/tools/rust-analyzer/crates/hir-ide/src/display.rs"},"region":{"startLine":1281}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca3b7183673824ce864ba7aa6b97f68b385dde20edbb07ab0516764f0173cd77"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeChecker::visit_rvalue (cyclomatic 114): TypeChecker::visit_rvalue has cyclomatic complexity 114 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/validate.rs"},"region":{"startLine":1018}}}],"partialFingerprints":{"codehealthFindingId/v1":"96eb91214cbd04c6f4b7bfd852a80da78aafed7025c690ffcc36e2e801529e31"}},{"ruleId":"D1","level":"warning","message":{"text":"Builder::cargo (cyclomatic 113): Builder::cargo has cyclomatic complexity 113 (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/bootstrap/src/core/builder/cargo.rs"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b7e074cff1e9bab938797fa6227e75e14b70a184efe41f40bb19741b78b9396"}},{"ruleId":"D1","level":"warning","message":{"text":"ThirBuildCx::make_mirror_unadjusted (cyclomatic 112): ThirBuildCx::make_mirror_unadjusted has cyclomatic complexity 112 (threshold 15). Of this number, 110 points are the body\u0027s own statements and 2 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":"compiler/rustc_mir_build/src/thir/cx/expr.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dc950d83237d5ffac0b32d82a91af0c2952aa2e9eec5eca6775f5368ccb23f8"}},{"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/tools/miri/src/shims/windows/foreign_items.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7ada42fe3849a76e9d38024bffa3e51fa515ab8f9093dfc8cbcaabd1cab6879"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeErrCtxt::report_selection_error (cyclomatic 104): TypeErrCtxt::report_selection_error has cyclomatic complexity 104 (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":"compiler/rustc_trait_selection/src/error_reporting/traits/fulfillment_errors.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f52fc6059a8e314f816fcf0ee8a88d72f3689e91424f4c39ed902698dc6ec6a"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_codegen_cranelift::intrinsics::llvm_x86::codegen_x86_llvm_intrinsic_call (cyclomatic 101): rustc_codegen_cranelift::intrinsics::llvm_x86::codegen_x86_llvm_intrinsic_call has cyclomatic complexity 101 (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":"compiler/rustc_codegen_cranelift/src/intrinsics/llvm_x86.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"09852e885a6308b63a7771c6c865d0a093f171bc4393a29c269fd2a12eab6a3c"}},{"ruleId":"D1","level":"warning","message":{"text":"Evaluator::eval_rvalue (cyclomatic 100): Evaluator::eval_rvalue has cyclomatic complexity 100 (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/tools/rust-analyzer/crates/hir-ty/src/mir/eval.rs"},"region":{"startLine":1029}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb0ec77838feb0f2b30dee252ae778d020903ccda17fa54ac2c27e50a753db03"}},{"ruleId":"D1","level":"warning","message":{"text":"InterpCx::eval_intrinsic (cyclomatic 97): InterpCx::eval_intrinsic has cyclomatic complexity 97 (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":"compiler/rustc_const_eval/src/interpret/intrinsics.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"903dc1bb2ec97bc502565746b33a934e5383f6bec3b6bdeff33c64764b30f74a"}},{"ruleId":"D1","level":"warning","message":{"text":"ide_diagnostics::semantic_diagnostics (cyclomatic 95): ide_diagnostics::semantic_diagnostics has cyclomatic complexity 95 (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/tools/rust-analyzer/crates/ide-diagnostics/src/lib.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c2d4ba5a8716fa434e99d31b122d1e1f68abbd4b3e5baffa13f4feef14299e0"}},{"ruleId":"D1","level":"warning","message":{"text":"rust_analyzer::config::patch_old_style::patch_json_for_outdated_configs (cyclomatic 95): rust_analyzer::config::patch_old_style::patch_json_for_outdated_configs has cyclomatic complexity 95 (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/tools/rust-analyzer/crates/rust-analyzer/src/config/patch_old_style.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"772eccc58e51335c3d6c314314afaab7c771535699db6e917f93f751d7f6a5ea"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_codegen_llvm::asm::reg_to_llvm (cyclomatic 93): rustc_codegen_llvm::asm::reg_to_llvm has cyclomatic complexity 93 (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":"compiler/rustc_codegen_llvm/src/asm.rs"},"region":{"startLine":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"48eb348bdfd5040c02d7af3c1861a31845e9c7e2e2b814d470e601d2f71a5ef2"}},{"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/tools/miri/src/bin/miri.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"a91a19339ab00f9cb689803a80d06f45e9615516f180b7d7f7b4858d261d0039"}},{"ruleId":"D1","level":"warning","message":{"text":"tidy::style::check_file_style (cyclomatic 92): tidy::style::check_file_style has cyclomatic complexity 92 (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/tools/tidy/src/style.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c7c7b14c59095bc3906c7cc751a6e184f5395632b4d21250ae0a5e671eb2606"}},{"ruleId":"D1","level":"warning","message":{"text":"Target::from_rustc (cyclomatic 91): Target::from_rustc has cyclomatic complexity 91 (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":"library/compiler-builtins/crates/symcheck/src/main.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"a932ce75b89320c2a18c7a0ff0fbf1c53309bd4e470f18649798db03bcd90e27"}},{"ruleId":"D1","level":"warning","message":{"text":"ExprCollector::maybe_collect_expr (cyclomatic 90): ExprCollector::maybe_collect_expr has cyclomatic complexity 90 (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/tools/rust-analyzer/crates/hir-def/src/expr_store/lower.rs"},"region":{"startLine":1417}}}],"partialFingerprints":{"codehealthFindingId/v1":"29d6c41e71367e461d309b929e3f5ef4b1518163f00d6d28291cb66293ea79b7"}},{"ruleId":"D1","level":"warning","message":{"text":"Options::from_matches (cyclomatic 88): Options::from_matches has cyclomatic complexity 88 (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/librustdoc/config.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"6676eb76ce14fcb2b5b4e8fbdaf83c902984caf7e8fe528dd639507618892784"}},{"ruleId":"D1","level":"warning","message":{"text":"State::print_expr_outer_attr_style (cyclomatic 86): State::print_expr_outer_attr_style has cyclomatic complexity 86 (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":"compiler/rustc_ast_pretty/src/pprust/state/expr.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"1caff2d877f6a0da585d6e83d36660ca6974af8a17130da1bffe9fed885d66a2"}},{"ruleId":"D1","level":"warning","message":{"text":"Builder::codegen_intrinsic_call (cyclomatic 86): Builder::codegen_intrinsic_call has cyclomatic complexity 86 (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":"compiler/rustc_codegen_gcc/src/intrinsic/mod.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec7f0e2d32f359ff3d9f11570ec15828dc0c5d3391850e0aa3db92a4cdad8625"}},{"ruleId":"D1","level":"warning","message":{"text":"FnCtxt::suggest_traits_to_import (cyclomatic 84): FnCtxt::suggest_traits_to_import has cyclomatic complexity 84 (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":"compiler/rustc_hir_typeck/src/method/suggest.rs"},"region":{"startLine":4140}}}],"partialFingerprints":{"codehealthFindingId/v1":"770230553b05bba659871063517d380a835b3d2260c77d4d4c2769469acd1e13"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_ty_utils::layout::layout_of_uncached (cyclomatic 84): rustc_ty_utils::layout::layout_of_uncached has cyclomatic complexity 84 (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":"compiler/rustc_ty_utils/src/layout.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a499828414472d3e6d5af3e5c40de5878ca2b237c214efdd6e1f8594bae86cb"}},{"ruleId":"D1","level":"warning","message":{"text":"rustdoc::html::render::search_index::build_index (cyclomatic 84): rustdoc::html::render::search_index::build_index has cyclomatic complexity 84 (threshold 15). Of this number, 54 points are the body\u0027s own statements and 30 belong to 3 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":"src/librustdoc/html/render/search_index.rs"},"region":{"startLine":1267}}}],"partialFingerprints":{"codehealthFindingId/v1":"3470b1bbf1d0207e04139cc463187ed9bb13c5da08343e3077f0ef40c7cecf7f"}},{"ruleId":"D1","level":"warning","message":{"text":"InferenceContext::infer_expr_inner (cyclomatic 84): InferenceContext::infer_expr_inner has cyclomatic complexity 84 (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/tools/rust-analyzer/crates/hir-ty/src/infer/expr.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"342c181bace430d01b683d7680bf2db3c7540e2b2904c2079f429b4197beccc7"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_builtin_macros::format::make_format_args (cyclomatic 83): rustc_builtin_macros::format::make_format_args has cyclomatic complexity 83 (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":"compiler/rustc_builtin_macros/src/format.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0c3cd3a9d7e4e585e6857cdcd6d572d79040ed2a635447d4e4282c9c732c2bc"}},{"ruleId":"D1","level":"warning","message":{"text":"FunctionCx::codegen_intrinsic_call (cyclomatic 83): FunctionCx::codegen_intrinsic_call has cyclomatic complexity 83 (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":"compiler/rustc_codegen_ssa/src/mir/intrinsic.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d82e7de7a17ec4f474ddd93f5c3f0425e7889e8bb6d86cf4c26b150c60088c1"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_codegen_cranelift::intrinsics::llvm_aarch64::codegen_aarch64_llvm_intrinsic_call (cyclomatic 82): rustc_codegen_cranelift::intrinsics::llvm_aarch64::codegen_aarch64_llvm_intrinsic_call has cyclomatic complexity 82 (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":"compiler/rustc_codegen_cranelift/src/intrinsics/llvm_aarch64.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f10374526b702ac4276999fcf45d9bbbc0f2e25efa2cc72f5df276cac60e9e4"}},{"ruleId":"D1","level":"warning","message":{"text":"rust_analyzer::lsp::to_proto::semantic_token_type_and_modifiers (cyclomatic 82): rust_analyzer::lsp::to_proto::semantic_token_type_and_modifiers has cyclomatic complexity 82 (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/tools/rust-analyzer/crates/rust-analyzer/src/lsp/to_proto.rs"},"region":{"startLine":818}}}],"partialFingerprints":{"codehealthFindingId/v1":"86286f9eb8be09bb20890874a16eb486fbd7bee7a33860e9cbf21fc1766b8d39"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeErrCtxt::note_and_explain_type_err (cyclomatic 81): TypeErrCtxt::note_and_explain_type_err has cyclomatic complexity 81 (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":"compiler/rustc_trait_selection/src/error_reporting/infer/note_and_explain.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"190ef6a3b38130bcc12a5e6e4e24a430a5674a7c1a5e29ec06948c0dc05ad368"}},{"ruleId":"D1","level":"warning","message":{"text":"Printer::print_expr_in (cyclomatic 79): Printer::print_expr_in has cyclomatic complexity 79 (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/tools/rust-analyzer/crates/hir-def/src/expr_store/pretty.rs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"c74a8e8ffc2ef69404c7c996a055dcc638ca20a64e2a31558cb685094a657f0c"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeErrCtxt::note_type_err (cyclomatic 78): TypeErrCtxt::note_type_err has cyclomatic complexity 78 (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":"compiler/rustc_trait_selection/src/error_reporting/infer/mod.rs"},"region":{"startLine":1465}}}],"partialFingerprints":{"codehealthFindingId/v1":"726df3e4b07565257a4966c9f32b7103c5b48f92c501c8d517a5d61ab261513d"}},{"ruleId":"D1","level":"warning","message":{"text":"Resolver::into_struct_error (cyclomatic 76): Resolver::into_struct_error has cyclomatic complexity 76 (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":"compiler/rustc_resolve/src/diagnostics/impls.rs"},"region":{"startLine":799}}}],"partialFingerprints":{"codehealthFindingId/v1":"24e52e5debacf139f414c4a5c7aab39e63797fbc4fdc0fb5472209d824a11a36"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_codegen_ssa::debuginfo::type_names::push_debuginfo_type_name (cyclomatic 75): rustc_codegen_ssa::debuginfo::type_names::push_debuginfo_type_name has cyclomatic complexity 75 (threshold 15). Of this number, 73 points are the body\u0027s own statements and 2 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":"compiler/rustc_codegen_ssa/src/debuginfo/type_names.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f2515f43ffd4d4ed60e13e1c3645f59e0fd32b2fda277c2d73ffca874ce027e"}},{"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/tools/miri/src/shims/foreign_items.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"d48495b32c80fbbb8012c597ad0c21d1fe6321924b9778ae6037022382f4965a"}},{"ruleId":"D1","level":"warning","message":{"text":"ide_completion::completions::expr::complete_expr_path (cyclomatic 75): ide_completion::completions::expr::complete_expr_path 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/tools/rust-analyzer/crates/ide-completion/src/completions/expr.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"968380585b4e3134d4afd59ee8e3766c6a88893206d6cea662e52446024c81d9"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_ast_passes::feature_gate::check_crate (cyclomatic 74): rustc_ast_passes::feature_gate::check_crate has cyclomatic complexity 74 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ast_passes/src/feature_gate.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa43d24b63353c69cff3035df6640a7c3954c2ade79a1b38be5d237d4ac97fad"}},{"ruleId":"D1","level":"warning","message":{"text":"LateResolutionVisitor::smart_resolve_context_dependent_help (cyclomatic 74): LateResolutionVisitor::smart_resolve_context_dependent_help has cyclomatic complexity 74 (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":"compiler/rustc_resolve/src/late/diagnostics.rs"},"region":{"startLine":2488}}}],"partialFingerprints":{"codehealthFindingId/v1":"3abc324639babf1d9fc3a0c29df8b9bc1cd54f72f6c5782ad9a0c639ba76f59e"}},{"ruleId":"D1","level":"warning","message":{"text":"GlobalState::handle_event (cyclomatic 74): GlobalState::handle_event has cyclomatic complexity 74 (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/tools/rust-analyzer/crates/rust-analyzer/src/main_loop.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"1440762f69422747efe4ca922d11ca8f9379db59ea37c8a0f6f263bde3928398"}},{"ruleId":"D1","level":"warning","message":{"text":"CompileTimeMachine::call_intrinsic (cyclomatic 73): CompileTimeMachine::call_intrinsic has cyclomatic complexity 73 (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":"compiler/rustc_const_eval/src/const_eval/machine.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e0ae42dfba6645ad6a9cb339cafeed58366f36758dae0dfce0bb1dd2d4393ff"}},{"ruleId":"D1","level":"warning","message":{"text":"libm_test::precision::default_ulp (cyclomatic 73): libm_test::precision::default_ulp has cyclomatic complexity 73 (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":"library/compiler-builtins/libm-test/src/precision.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c6f2df7a049cc202184072c8268c1489fe7e22231930fd5f7faf8252cca1df7"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::doc::check_doc (cyclomatic 72): clippy_lints::doc::check_doc has cyclomatic complexity 72 (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/tools/clippy/clippy_lints/src/doc/mod.rs"},"region":{"startLine":1133}}}],"partialFingerprints":{"codehealthFindingId/v1":"b26b58de566a16a2429a65ef2e7c9911ab1f9459f4ef92edcb0bf3c119275e81"}},{"ruleId":"D1","level":"warning","message":{"text":"Lexer::next_token_from_cursor (cyclomatic 71): Lexer::next_token_from_cursor has cyclomatic complexity 71 (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":"compiler/rustc_parse/src/lexer/mod.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"e05c8349052507151d2ae7621a1fb1123437512f178cc438a759b03f054604ed"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeErrCtxt::report_similar_impl_candidates (cyclomatic 71): TypeErrCtxt::report_similar_impl_candidates has cyclomatic complexity 71 (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":"compiler/rustc_trait_selection/src/error_reporting/traits/fulfillment_errors.rs"},"region":{"startLine":2309}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5d9353f3717855ab4772f3fde5d3f97bc48036e78a10ec9f89ca1d16f2a079f"}},{"ruleId":"D1","level":"warning","message":{"text":"TestCx::make_compile_args (cyclomatic 71): TestCx::make_compile_args has cyclomatic complexity 71 (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/tools/compiletest/src/runtest.rs"},"region":{"startLine":1671}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6fe28cc458667209b0a4059ec1d1cc18e0f799fb4996a0327e9e210422e6466"}},{"ruleId":"D1","level":"warning","message":{"text":"hir_def::attrs::match_attr_flags (cyclomatic 71): hir_def::attrs::match_attr_flags has cyclomatic complexity 71 (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/tools/rust-analyzer/crates/hir-def/src/attrs.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"e26054669905bb9667a151c7bea488a04cc3c9895e8b3aba1273930281aa6327"}},{"ruleId":"D1","level":"warning","message":{"text":"FnCtxt::handle_unsatisfied_predicates (cyclomatic 70): FnCtxt::handle_unsatisfied_predicates has cyclomatic complexity 70 (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":"compiler/rustc_hir_typeck/src/method/suggest.rs"},"region":{"startLine":1705}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd1e38552727cd1d1c5bfd2a7b0977000723eaf5bef3e9cafecf6968f7bfffac"}},{"ruleId":"D1","level":"warning","message":{"text":"ConstEvalCtxt::binop (cyclomatic 70): ConstEvalCtxt::binop has cyclomatic complexity 70 (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/tools/clippy/clippy_utils/src/consts.rs"},"region":{"startLine":1026}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f42238848fe29577b9f2ab68e6c01bb54eceec0542d5de299f9bbbdcc930bd8"}},{"ruleId":"D1","level":"warning","message":{"text":"Builder::codegen_inline_asm (cyclomatic 69): Builder::codegen_inline_asm has cyclomatic complexity 69 (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":"compiler/rustc_codegen_llvm/src/asm.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d786a32a853dd960fb26e6fcd07c51cbbfbd48aedf44e84fe35d058cfa4fb46"}},{"ruleId":"D1","level":"warning","message":{"text":"HirEqInterExpr::eq_expr (cyclomatic 69): HirEqInterExpr::eq_expr has cyclomatic complexity 69 (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/tools/clippy/clippy_utils/src/hir_utils.rs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ec676940ab3ded4176c6b521d5d48cb7df3728798289ab40cf7599d8ae79468"}},{"ruleId":"D1","level":"warning","message":{"text":"MirBorrowckCtxt::report_mutability_error (cyclomatic 68): MirBorrowckCtxt::report_mutability_error has cyclomatic complexity 68 (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":"compiler/rustc_borrowck/src/diagnostics/mutability_errors.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ee4b1211110a257e7e3fd7b244e40b9828ae3f3d4e8c57e8b5406ac68e253cb"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeChecker::visit_rvalue (cyclomatic 68): TypeChecker::visit_rvalue has cyclomatic complexity 68 (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":"compiler/rustc_borrowck/src/type_check/mod.rs"},"region":{"startLine":992}}}],"partialFingerprints":{"codehealthFindingId/v1":"a042189aeb543305eca23b03ec1540f63a8baae65f1d7b93321eb81e2605d499"}},{"ruleId":"D1","level":"warning","message":{"text":"Builder::codegen_inline_asm (cyclomatic 68): Builder::codegen_inline_asm has cyclomatic complexity 68 (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":"compiler/rustc_codegen_gcc/src/asm.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e49ed3ff9780657ced7925384ad7a9419ddaf6df34ffad4c68d7b6924dc0b1a"}},{"ruleId":"D1","level":"warning","message":{"text":"SelectionContext::evaluate_predicate_recursively (cyclomatic 67): SelectionContext::evaluate_predicate_recursively has cyclomatic complexity 67 (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":"compiler/rustc_trait_selection/src/traits/select/mod.rs"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dce708ab2140f1d0877278081a03c1f707faddd5949990db33aa73476c24919"}},{"ruleId":"D1","level":"warning","message":{"text":"Extended::run (cyclomatic 67): Extended::run has cyclomatic complexity 67 (threshold 15). Of this number, 63 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/build_steps/dist.rs"},"region":{"startLine":1902}}}],"partialFingerprints":{"codehealthFindingId/v1":"13bd49b1fbeac00dae43a678f9a03382c6d1ee85dba95b9845f325cdd905367f"}},{"ruleId":"D1","level":"warning","message":{"text":"LoweringContext::lower_expr_mut (cyclomatic 66): LoweringContext::lower_expr_mut has cyclomatic complexity 66 (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":"compiler/rustc_ast_lowering/src/expr.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f97b3c811c7e7acf3503f7f84e77a963ed729c8768844e5c456442fab7af734"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_codegen_ssa::back::link::link_natively (cyclomatic 66): rustc_codegen_ssa::back::link::link_natively has cyclomatic complexity 66 (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":"compiler/rustc_codegen_ssa/src/back/link.rs"},"region":{"startLine":1232}}}],"partialFingerprints":{"codehealthFindingId/v1":"c100672b3290a208f8c02d07d6088ecddacbfb80244347b1f4e1944deda5982d"}},{"ruleId":"D1","level":"warning","message":{"text":"Builder::expr_into_dest (cyclomatic 66): Builder::expr_into_dest has cyclomatic complexity 66 (threshold 15). Of this number, 63 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. 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":"compiler/rustc_mir_build/src/builder/expr/into.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc69dd26a5334cdccf0a1df71e517421605396b2d68170c7e688aa5c34887be0"}},{"ruleId":"D1","level":"warning","message":{"text":"LateResolutionVisitor::add_missing_lifetime_specifiers_label (cyclomatic 66): LateResolutionVisitor::add_missing_lifetime_specifiers_label has cyclomatic complexity 66 (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":"compiler/rustc_resolve/src/late/diagnostics.rs"},"region":{"startLine":4540}}}],"partialFingerprints":{"codehealthFindingId/v1":"b54f10880189bd7f1eef63639d59ea70f0d0ccbeac0ec553a6d0156a0ba73433"}},{"ruleId":"D1","level":"warning","message":{"text":"AnyDiagnostic::inference_diagnostic (cyclomatic 66): AnyDiagnostic::inference_diagnostic has cyclomatic complexity 66 (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/tools/rust-analyzer/crates/hir/src/diagnostics.rs"},"region":{"startLine":1578}}}],"partialFingerprints":{"codehealthFindingId/v1":"dde40370a0eaf56adbd98d97d2d22fe510d89c6abeac53857c2b267e17f741c9"}},{"ruleId":"D1","level":"warning","message":{"text":"FnCtxt::suggest_deref_or_ref (cyclomatic 64): FnCtxt::suggest_deref_or_ref has cyclomatic complexity 64 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/fn_ctxt/suggestions.rs"},"region":{"startLine":2966}}}],"partialFingerprints":{"codehealthFindingId/v1":"56983e0e59120253f8f91142f76c017471b7df88a276ccd2c66d3f81583a57b2"}},{"ruleId":"D1","level":"warning","message":{"text":"ide::hover::render::definition (cyclomatic 64): ide::hover::render::definition has cyclomatic complexity 64 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/hover/render.rs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1859f298f5f2245f1f473b5c32d20873ba8733c8eb5cb8456a164b97c5ca092"}},{"ruleId":"D1","level":"warning","message":{"text":"LoweringContext::lower_inline_asm (cyclomatic 63): LoweringContext::lower_inline_asm has cyclomatic complexity 63 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ast_lowering/src/asm.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"b88aa9512b6dd0156d37a6bee39b60deaa85ba6fb75b82b16e57653ba5aad005"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_hir_analysis::check::check::check_item_type (cyclomatic 63): rustc_hir_analysis::check::check::check_item_type has cyclomatic complexity 63 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/check/check.rs"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"22e943b68ba8ddc1ba3257fc47982c0bf6817423087167b0c08e7f0051ec4d89"}},{"ruleId":"D1","level":"warning","message":{"text":"Resolver::resolve_path_with_ribs (cyclomatic 63): Resolver::resolve_path_with_ribs has cyclomatic complexity 63 (threshold 15). Of this number, 61 points are the body\u0027s own statements and 2 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":"compiler/rustc_resolve/src/ident.rs"},"region":{"startLine":1878}}}],"partialFingerprints":{"codehealthFindingId/v1":"129a5a38d4ceb9499c224d09ea708e42cc2df795d2ae5038ac4bb8fe1df81347"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeErrCtxt::maybe_report_ambiguity (cyclomatic 63): TypeErrCtxt::maybe_report_ambiguity has cyclomatic complexity 63 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/error_reporting/traits/ambiguity.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"11f1101d8994150044b53f6a8fc9121b5641bc11ff4b612c117c74796a8326cf"}},{"ruleId":"D1","level":"warning","message":{"text":"FulfillProcessor::process_obligation (cyclomatic 63): FulfillProcessor::process_obligation has cyclomatic complexity 63 (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":"compiler/rustc_trait_selection/src/traits/fulfill.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d0ecec70c697b40d0f9400526657e3e36547b3769db929ee31b0970a0da1c75"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_utils::ast_utils::eq_expr (cyclomatic 63): clippy_utils::ast_utils::eq_expr has cyclomatic complexity 63 (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/tools/clippy/clippy_utils/src/ast_utils/mod.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c904f4abb3a246b8a20a6c5c5e16822116addc8d1d4d5f2425ac66918e2727a"}},{"ruleId":"D1","level":"warning","message":{"text":"rustdoc::html::render::print_item::item_trait (cyclomatic 62): rustdoc::html::render::print_item::item_trait has cyclomatic complexity 62 (threshold 15). Of this number, 58 points are the body\u0027s own statements and 4 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/librustdoc/html/render/print_item.rs"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bc8fa714ae5bfa53dbbb8029525151cf077f47a33187552b37ceb9fd41ebe8b"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_codegen_ssa::codegen_attrs::process_builtin_attrs (cyclomatic 61): rustc_codegen_ssa::codegen_attrs::process_builtin_attrs has cyclomatic complexity 61 (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":"compiler/rustc_codegen_ssa/src/codegen_attrs.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d0661d35a80b6673523f2b104f791fb4b450eb7328425b1edd99367762c036e"}},{"ruleId":"D1","level":"warning","message":{"text":"bootstrap::core::sanity::check (cyclomatic 61): bootstrap::core::sanity::check has cyclomatic complexity 61 (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/bootstrap/src/core/sanity.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5e38ee80c01c60a963aa91f80848b098f79499122e02626babf55e877422913"}},{"ruleId":"D1","level":"warning","message":{"text":"ide::syntax_highlighting::highlight::highlight_def (cyclomatic 61): ide::syntax_highlighting::highlight::highlight_def has cyclomatic complexity 61 (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/tools/rust-analyzer/crates/ide/src/syntax_highlighting/highlight.rs"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"164773d7fc6d1d2e9557298f816e1cea56b19d32b9b6ea9c9af4e8a5caf07932"}},{"ruleId":"D1","level":"warning","message":{"text":"TokenStream::from_str (cyclomatic 61): TokenStream::from_str has cyclomatic complexity 61 (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/tools/rust-analyzer/crates/proc-macro-srv/src/token_stream.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ea5271f8ba106f5f0cd1f3e84253d73c9e863923b885523eec669ff2d405c54"}},{"ruleId":"D1","level":"warning","message":{"text":"InterpCx::binary_int_op (cyclomatic 60): InterpCx::binary_int_op has cyclomatic complexity 60 (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":"compiler/rustc_const_eval/src/interpret/operator.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"be0db8329253a2d532a303096f126b75d33615e890d9600abd020dd225503fe7"}},{"ruleId":"D1","level":"warning","message":{"text":"ThirPrinter::print_expr_kind (cyclomatic 60): ThirPrinter::print_expr_kind has cyclomatic complexity 60 (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":"compiler/rustc_mir_build/src/thir/print.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"55cebd75a6d1d8f3098a9705bdc28a5326378dd1868850f1f0d574fdd63cf2e2"}},{"ruleId":"D1","level":"warning","message":{"text":"Llvm::run (cyclomatic 60): Llvm::run has cyclomatic complexity 60 (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/bootstrap/src/core/build_steps/llvm.rs"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"e68fc08b92bfe85477a0720704733bc9ae2c0441e36d6077da34bf00b327b495"}},{"ruleId":"D1","level":"warning","message":{"text":"Dereferencing::check_expr (cyclomatic 60): Dereferencing::check_expr has cyclomatic complexity 60 (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/tools/clippy/clippy_lints/src/dereference.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e82e484acabf5e74b8844e23b006a1c5ddcc98e798efec324fc0e0f8a7a9f6e"}},{"ruleId":"D1","level":"warning","message":{"text":"FunctionCx::codegen_call_terminator (cyclomatic 59): FunctionCx::codegen_call_terminator has cyclomatic complexity 59 (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":"compiler/rustc_codegen_ssa/src/mir/block.rs"},"region":{"startLine":955}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cc94fca52c08aa2dcf93f6e55d1dfdbc3366fd7a1b57b1ee72796efe2a1b2c9"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::expected_one_of_not_found (cyclomatic 59): Parser::expected_one_of_not_found has cyclomatic complexity 59 (threshold 15). Of this number, 55 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/diagnostics.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"41c1e73bbe027b7adaddffcd4c358e8ced1cc716cec2c221ec514b5ff7627de9"}},{"ruleId":"D1","level":"warning","message":{"text":"DeepRejectCtxt::types_may_unify_inner (cyclomatic 59): DeepRejectCtxt::types_may_unify_inner has cyclomatic complexity 59 (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":"compiler/rustc_type_ir/src/fast_reject.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"13c654b69454e51f8d8bc714366bb38b34e60c17365e92718dc2ee4bcedde298"}},{"ruleId":"D1","level":"warning","message":{"text":"SpanlessHash::hash_expr (cyclomatic 59): SpanlessHash::hash_expr has cyclomatic complexity 59 (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/tools/clippy/clippy_utils/src/hir_utils.rs"},"region":{"startLine":1181}}}],"partialFingerprints":{"codehealthFindingId/v1":"7393f12254c84f7494b7c8d950d4023dd2fe403cc3a4f4fa39e748461db216db"}},{"ruleId":"D1","level":"warning","message":{"text":"hir_ty::layout::layout_of_ty_query (cyclomatic 59): hir_ty::layout::layout_of_ty_query has cyclomatic complexity 59 (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/tools/rust-analyzer/crates/hir-ty/src/layout.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"6193aa19730592c0d3e542750f01623f9f7e868b4bb03c896faf951c2d0f1d58"}},{"ruleId":"D1","level":"warning","message":{"text":"stringdex.loadDatabase::makeSearchTreeFromBase64 (cyclomatic 59): stringdex.loadDatabase::makeSearchTreeFromBase64 has cyclomatic complexity 59 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: 2 other methods here (stringdex.loadDatabase, stringdex.loadDatabase::makeSearchTreeFromBase64::makeBranchesFromBinaryData) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/stringdex.js"},"region":{"startLine":3009}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6d8c54e6c1ebe7e51835e7657e879491681a95e7f1744624c26f40c802d7ce8"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_codegen_gcc::asm::modifier_to_gcc (cyclomatic 58): rustc_codegen_gcc::asm::modifier_to_gcc has cyclomatic complexity 58 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: rustc_codegen_gcc::asm::reg_class_to_gcc (cyclomatic 66) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_gcc/src/asm.rs"},"region":{"startLine":1065}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cc1ba6ab7c8b802a49ed6671e4f2975702ae5545b51a5824b346ee3c3826c19"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_codegen_llvm::asm::modifier_to_llvm (cyclomatic 58): rustc_codegen_llvm::asm::modifier_to_llvm has cyclomatic complexity 58 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: rustc_codegen_llvm::asm::dummy_output_type (cyclomatic 69) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/asm.rs"},"region":{"startLine":915}}}],"partialFingerprints":{"codehealthFindingId/v1":"865a79df288c14723a0007dac0862678d66dba8f2e23baf51bf3141938862372"}},{"ruleId":"D1","level":"warning","message":{"text":"PrettyPrinter::pretty_print_type (cyclomatic 58): PrettyPrinter::pretty_print_type has cyclomatic complexity 58 (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":"compiler/rustc_middle/src/ty/print/pretty.rs"},"region":{"startLine":761}}}],"partialFingerprints":{"codehealthFindingId/v1":"49f7ad526f5d836af2d8d310744e547a067957df099a80d32c868bb20d24da8b"}},{"ruleId":"D1","level":"warning","message":{"text":"libm::math::pow::pow (cyclomatic 58): libm::math::pow::pow has cyclomatic complexity 58 (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":"library/compiler-builtins/libm/src/math/pow.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ba81fe94b9c5cb0275ae9de5b69e5d0a9b803e3bf2ad78b68e6bb8ff05cc4ec"}},{"ruleId":"D1","level":"warning","message":{"text":"rustfmt_nightly::expr::format_expr (cyclomatic 58): rustfmt_nightly::expr::format_expr has cyclomatic complexity 58 (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/tools/rustfmt/src/expr.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"e59a32e7a23ba5ea010bf27df71de2b5cd3e8140e1b561a9e00cef64234659d8"}},{"ruleId":"D1","level":"warning","message":{"text":"rustfmt_nightly::lists::write_list (cyclomatic 58): rustfmt_nightly::lists::write_list has cyclomatic complexity 58 (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/tools/rustfmt/src/lists.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"41bf0b7cfa00095b6370c87154e432f721bdba8149470268df39c45cadb0f265"}},{"ruleId":"D1","level":"warning","message":{"text":"Cursor::advance_token (cyclomatic 57): Cursor::advance_token has cyclomatic complexity 57 (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":"compiler/rustc_lexer/src/lib.rs"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"c82c62b1c2c24f90f6ee136437e586a01bf32736155204895e928411f9155327"}},{"ruleId":"D1","level":"warning","message":{"text":"EncodeContext::encode_def_ids (cyclomatic 57): EncodeContext::encode_def_ids has cyclomatic complexity 57 (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":"compiler/rustc_metadata/src/rmeta/encoder.rs"},"region":{"startLine":1486}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8a156bbbea14ba6c27a47874f3cee715c82c7c44a83a160976982aa29e23674"}},{"ruleId":"D1","level":"warning","message":{"text":"hir_expand::builtin::derive_macro::coerce_pointee_expand (cyclomatic 57): hir_expand::builtin::derive_macro::coerce_pointee_expand has cyclomatic complexity 57 (threshold 15). Of this number, 33 points are the body\u0027s own statements and 24 belong to 4 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":"src/tools/rust-analyzer/crates/hir-expand/src/builtin/derive_macro.rs"},"region":{"startLine":1128}}}],"partialFingerprints":{"codehealthFindingId/v1":"f590e2107439f987693e0fb0f4e8e609c81909953451ccf2894ce64df7a94bb0"}},{"ruleId":"D1","level":"warning","message":{"text":"hir_ide::display::render_const_scalar_inner (cyclomatic 57): hir_ide::display::render_const_scalar_inner has cyclomatic complexity 57 (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/tools/rust-analyzer/crates/hir-ide/src/display.rs"},"region":{"startLine":819}}}],"partialFingerprints":{"codehealthFindingId/v1":"f93b529f3f344ac54f2c422d11f775e3d94690dbd41e651bb731e25020c7990a"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_codegen_llvm::context::init_module (cyclomatic 56): rustc_codegen_llvm::context::init_module has cyclomatic complexity 56 (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":"compiler/rustc_codegen_llvm/src/context.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a312b7e80ae285e40b2e62965cbc6b2bba7d622e2b727636540793bf99b35b0"}},{"ruleId":"D1","level":"warning","message":{"text":"FnCtxt::suggest_cast (cyclomatic 56): FnCtxt::suggest_cast has cyclomatic complexity 56 (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":"compiler/rustc_hir_typeck/src/fn_ctxt/suggestions.rs"},"region":{"startLine":3420}}}],"partialFingerprints":{"codehealthFindingId/v1":"8420b1d14063745090e491390a538fa078df6d8a1dc7b2cbadbb1e31bd0fdd2a"}},{"ruleId":"D1","level":"warning","message":{"text":"UndefinedBehaviorInfo::fmt (cyclomatic 56): UndefinedBehaviorInfo::fmt has cyclomatic complexity 56 (threshold 15). Of this number, 52 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. 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":"compiler/rustc_middle/src/mir/interpret/error.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"93cfac8919f03b367bb1c5bcd71e3dc36481e52e6fd796affa54f51b87e47f94"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_middle::thir::visit::walk_expr (cyclomatic 56): rustc_middle::thir::visit::walk_expr has cyclomatic complexity 56 (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":"compiler/rustc_middle/src/thir/visit.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9e49b5d659e8d0a612e5bcf39e7ff68ec276377b7fa334df896b0d6ef021dbc"}},{"ruleId":"D1","level":"warning","message":{"text":"V0SymbolMangler::print_type (cyclomatic 56): V0SymbolMangler::print_type has cyclomatic complexity 56 (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":"compiler/rustc_symbol_mangling/src/v0.rs"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"b012c5fa02ce20130bb46fef31e4842eb6ffa04785779410fdbd2490c0f79fbe"}},{"ruleId":"D1","level":"warning","message":{"text":"CastCheck::report_cast_error (cyclomatic 55): CastCheck::report_cast_error has cyclomatic complexity 55 (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":"compiler/rustc_hir_typeck/src/cast.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"e374caceb0ecc4263026fe69f3f39195a657e10c0b5d9cc73a094e97c450575d"}},{"ruleId":"D1","level":"warning","message":{"text":"LowerIntrinsics::run_pass (cyclomatic 55): LowerIntrinsics::run_pass has cyclomatic complexity 55 (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":"compiler/rustc_mir_transform/src/lower_intrinsics.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"b418aa8c1654f435d312bb5bd1fe442e22ae115972174e951bb5eaa6d8e33798"}},{"ruleId":"D1","level":"warning","message":{"text":"BorrowExplanation::add_explanation_to_diagnostic (cyclomatic 54): BorrowExplanation::add_explanation_to_diagnostic has cyclomatic complexity 54 (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":"compiler/rustc_borrowck/src/diagnostics/explain_borrow.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"13f8dbcfb09b4499c416f6580dd2c9c99b65eb6252eca88f5591e54c371999db"}},{"ruleId":"D1","level":"warning","message":{"text":"SymbolCollector::collect_from_module (cyclomatic 53): SymbolCollector::collect_from_module has cyclomatic complexity 53 (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/tools/rust-analyzer/crates/hir/src/symbols.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"857caf7e1c815cbacce76c10d84d4475f2673dd8d37799a0e5bd079015f95ee3"}},{"ruleId":"D1","level":"warning","message":{"text":"ide::inlay_hints::adjustment::hints (cyclomatic 53): ide::inlay_hints::adjustment::hints has cyclomatic complexity 53 (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/tools/rust-analyzer/crates/ide/src/inlay_hints/adjustment.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"128023bc7be2dbbfb2cc5b57cd82fe2073eadd9c5c74b0a164c520f04ec1085c"}},{"ruleId":"D1","level":"warning","message":{"text":"Converter::extend_token (cyclomatic 53): Converter::extend_token has cyclomatic complexity 53 (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/tools/rust-analyzer/crates/parser/src/lexed_str.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"59282e71e7e62f2fddfa6a7b2c9496011c397ef7c6ce43a6a8390249f1fd44b9"}},{"ruleId":"D1","level":"warning","message":{"text":"FnCtxt::label_fn_like (cyclomatic 52): FnCtxt::label_fn_like has cyclomatic complexity 52 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/fn_ctxt/checks.rs"},"region":{"startLine":1665}}}],"partialFingerprints":{"codehealthFindingId/v1":"c68ab5a1b1c5004a7933f617d0c7e987430dbda18e203eb8a3a06571fd04f420"}},{"ruleId":"D1","level":"warning","message":{"text":"Resolver::visit_scopes (cyclomatic 52): Resolver::visit_scopes has cyclomatic complexity 52 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/ident.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d0a3dd011397a9706919a547d466e31bdb1feb1f0f4d0becc1055722784bc1d"}},{"ruleId":"D1","level":"warning","message":{"text":"LateResolutionVisitor::try_lookup_name_relaxed (cyclomatic 52): LateResolutionVisitor::try_lookup_name_relaxed has cyclomatic complexity 52 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/late/diagnostics.rs"},"region":{"startLine":1022}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a9df6a14ad8541f7707d0d5624ca3d61fc16f7acb823b2971348b5bb6353ddf"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_sanitizers::cfi::typeid::itanium_cxx_abi::encode::encode_ty (cyclomatic 52): rustc_sanitizers::cfi::typeid::itanium_cxx_abi::encode::encode_ty has cyclomatic complexity 52 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_sanitizers/src/cfi/typeid/itanium_cxx_abi/encode.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"c91d84dfdf5bca493ac8b366024e35c89866c8ab0e1749d3b544854de328303d"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_codegen_cranelift::base::codegen_stmt (cyclomatic 51): rustc_codegen_cranelift::base::codegen_stmt has cyclomatic complexity 51 (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":"compiler/rustc_codegen_cranelift/src/base.rs"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"08a97517315dce0965b3708ad71b47081b3a1eee9ca7925c5f4cf6e0d833a09f"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_codegen_ssa::back::link::raw_dylib::create_elf_raw_dylib_stub (cyclomatic 51): rustc_codegen_ssa::back::link::raw_dylib::create_elf_raw_dylib_stub has cyclomatic complexity 51 (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":"compiler/rustc_codegen_ssa/src/back/link/raw_dylib.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ffe07c99760b0d57ec5c2734c8029528217711cd6eeab9eeb86e5d79a90d710"}},{"ruleId":"D1","level":"warning","message":{"text":"Resolver::validate_res_from_ribs (cyclomatic 51): Resolver::validate_res_from_ribs has cyclomatic complexity 51 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/ident.rs"},"region":{"startLine":1476}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdd613c86b9ed41b56f31a1c8340c4314f299f53f35ac2d9f43ead5dbc28cd95"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_interface::interface::parse_check_cfg (cyclomatic 51): rustc_interface::interface::parse_check_cfg has cyclomatic complexity 51 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_interface/src/interface.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"118f1646a14a487cb8536d04c0c20528c1c23a5262bafeaccead9aa87b055632"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_parse::lexer::unescape_error_reporting::emit_unescape_error (cyclomatic 51): rustc_parse::lexer::unescape_error_reporting::emit_unescape_error has cyclomatic complexity 51 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/lexer/unescape_error_reporting.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8ad48b54760a866f95903f95bfe1be67ef7baab0b900f1b0e3c3125c7070b47"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::parse_expr_bottom (cyclomatic 51): Parser::parse_expr_bottom has cyclomatic complexity 51 (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":"compiler/rustc_parse/src/parser/expr.rs"},"region":{"startLine":1246}}}],"partialFingerprints":{"codehealthFindingId/v1":"69a715135d577ce6944b18432354578293e43781835b5ce664998bc3ff046633"}},{"ruleId":"D1","level":"warning","message":{"text":"Classifier::advance (cyclomatic 51): Classifier::advance has cyclomatic complexity 51 (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/librustdoc/html/highlight.rs"},"region":{"startLine":1060}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e048075eff3cdad743659f0cd17e5392a68405cf8db82fab5c546c21a012892"}},{"ruleId":"D1","level":"warning","message":{"text":"ide_assists::handlers::inline_call::inline (cyclomatic 51): ide_assists::handlers::inline_call::inline has cyclomatic complexity 51 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/inline_call.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"551af42221235792cf284b53e02393d3039ac129ac0484de53ce2f3c3dd7d0bf"}},{"ruleId":"D1","level":"warning","message":{"text":"MirBorrowckCtxt::explain_captures (cyclomatic 50): MirBorrowckCtxt::explain_captures has cyclomatic complexity 50 (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":"compiler/rustc_borrowck/src/diagnostics/mod.rs"},"region":{"startLine":1225}}}],"partialFingerprints":{"codehealthFindingId/v1":"5725dd3b05808a9b5756a788f62e2e186b2692b42a58584246c71193e89b619e"}},{"ruleId":"D1","level":"warning","message":{"text":"FnCtxt::instantiate_value_path (cyclomatic 50): FnCtxt::instantiate_value_path has cyclomatic complexity 50 (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":"compiler/rustc_hir_typeck/src/fn_ctxt/_impl.rs"},"region":{"startLine":1037}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2b5b11155fa86a8450c935005ea6cee2339b0005209849be828dd9db1e70c78"}},{"ruleId":"D1","level":"warning","message":{"text":"Install::merge (cyclomatic 50): Install::merge has cyclomatic complexity 50 (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/bootstrap/src/core/config/toml/install.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d3542e9f67e9037a49ee9eed9de18c5f6b66fc657be4666885b0e4ca4edf429"}},{"ruleId":"D1","level":"warning","message":{"text":"bootstrap::core::build_steps::llvm::configure_cmake (cyclomatic 50): bootstrap::core::build_steps::llvm::configure_cmake has cyclomatic complexity 50 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/build_steps/llvm.rs"},"region":{"startLine":883}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3f64f0bd9cc7f96ec22e1f5c263fa1b983e0bd65179f9721de96d1eb5ab6cce"}},{"ruleId":"D1","level":"warning","message":{"text":"ide_completion::context::analysis::expected_type_and_name (cyclomatic 50): ide_completion::context::analysis::expected_type_and_name has cyclomatic complexity 50 (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/tools/rust-analyzer/crates/ide-completion/src/context/analysis.rs"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea1bd32ee311770effde1d24bef969c8655f9dafa49fa19de50a5e0d9982ea3b"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_driver_impl::print_crate_info (cyclomatic 49): rustc_driver_impl::print_crate_info has cyclomatic complexity 49 (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":"compiler/rustc_driver_impl/src/lib.rs"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3776eca4888dfacbf99aed2173421492e910827457b775bf80771f6b75698ea"}},{"ruleId":"D1","level":"warning","message":{"text":"SelectionContext::winnow_candidates (cyclomatic 49): SelectionContext::winnow_candidates has cyclomatic complexity 49 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/traits/select/mod.rs"},"region":{"startLine":1721}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d7f9c5fa7b64426eb10fdeeed7355615c0e7b6048c244abf5705a2614ec7105"}},{"ruleId":"D1","level":"warning","message":{"text":"rustdoc::html::markdown::markdown_links (cyclomatic 49): rustdoc::html::markdown::markdown_links has cyclomatic complexity 49 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/markdown.rs"},"region":{"startLine":1819}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f5d6dbb34c6494ae49d36f559cb69784c5c86ec624a1c92e637d3eea8c91dd5"}},{"ruleId":"D1","level":"warning","message":{"text":"ExprCollector::lower_inline_asm (cyclomatic 49): ExprCollector::lower_inline_asm has cyclomatic complexity 49 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/expr_store/lower/asm.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"b610ec9613adf27c1d9c7986bbd084a6fcdc28cf70e39b98299a592e52dba28f"}},{"ruleId":"D1","level":"warning","message":{"text":"AnalysisStats::run_inference (cyclomatic 49): AnalysisStats::run_inference has cyclomatic complexity 49 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/cli/analysis_stats.rs"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"c00086ea3b9ea051b712d182b380f4c3e1d861598a2f4d17f72f2c03a489a31c"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_codegen_ssa::back::write::start_executing_work (cyclomatic 48): rustc_codegen_ssa::back::write::start_executing_work has cyclomatic complexity 48 (threshold 15). Of this number, 47 points are the body\u0027s own statements and 1 belongs 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":"compiler/rustc_codegen_ssa/src/back/write.rs"},"region":{"startLine":1204}}}],"partialFingerprints":{"codehealthFindingId/v1":"e77189db996b060c9abe76bf247e97fe438680f7083b71fe11e3ff08012d0a65"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_hir_analysis::collect::type_of::type_of (cyclomatic 48): rustc_hir_analysis::collect::type_of::type_of has cyclomatic complexity 48 (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":"compiler/rustc_hir_analysis/src/collect/type_of.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdc3527ed9bcf0979449ad3b6b458bddb786bf86a5e43d6c09c18e920064939d"}},{"ruleId":"D1","level":"warning","message":{"text":"InlineAsmCtxt::get_asm_ty (cyclomatic 48): InlineAsmCtxt::get_asm_ty has cyclomatic complexity 48 (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":"compiler/rustc_hir_typeck/src/inline_asm.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"71954984060f4e3fc103f355233d4846cb0b740fe767927c2388fdabb006459b"}},{"ruleId":"D1","level":"warning","message":{"text":"InferenceContext::resolve_variant (cyclomatic 48): InferenceContext::resolve_variant has cyclomatic complexity 48 (threshold 15). Of this number, 47 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. 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/tools/rust-analyzer/crates/hir-ty/src/infer.rs"},"region":{"startLine":2256}}}],"partialFingerprints":{"codehealthFindingId/v1":"999dfb3a0328cab53d5ab02f02eadc17ca81e07679914cb71e39f006e0f3feb9"}},{"ruleId":"D1","level":"warning","message":{"text":"Definition::search_scope (cyclomatic 48): Definition::search_scope has cyclomatic complexity 48 (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/tools/rust-analyzer/crates/ide-db/src/search.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"c278310cd9eb1e91abb0c127b88547b4c01af7130b5353c5ba1cff008ab2109e"}},{"ruleId":"D1","level":"warning","message":{"text":"AnalysisStats::run (cyclomatic 48): AnalysisStats::run has cyclomatic complexity 48 (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/tools/rust-analyzer/crates/rust-analyzer/src/cli/analysis_stats.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0ee789e1b8643265f7d224700227bb4218de96ffa00c97a9e6547411c895fd6"}},{"ruleId":"D1","level":"warning","message":{"text":"AstValidator::visit_item (cyclomatic 47): AstValidator::visit_item has cyclomatic complexity 47 (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":"compiler/rustc_ast_passes/src/ast_validation.rs"},"region":{"startLine":1417}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a13a6da00f752320855662ad48f7c8cd2340d2f17192ca11dfb3686a21d82ee"}},{"ruleId":"D1","level":"warning","message":{"text":"MirBorrowckCtxt::suggest_make_local_mut (cyclomatic 47): MirBorrowckCtxt::suggest_make_local_mut has cyclomatic complexity 47 (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":"compiler/rustc_borrowck/src/diagnostics/mutability_errors.rs"},"region":{"startLine":1399}}}],"partialFingerprints":{"codehealthFindingId/v1":"31ec59a69fd85c8b53fa35a315975a9b3f3c25d28e60a261ad293736d17ed2d4"}},{"ruleId":"D1","level":"warning","message":{"text":"ConstInt::fmt (cyclomatic 47): ConstInt::fmt has cyclomatic complexity 47 (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":"compiler/rustc_middle/src/ty/consts/int.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"236726e344d22856f2cc0879814a7a88277fc43eae7cf4c8337cb8505b870dcf"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeChecker::visit_projection_elem (cyclomatic 47): TypeChecker::visit_projection_elem has cyclomatic complexity 47 (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":"compiler/rustc_mir_transform/src/validate.rs"},"region":{"startLine":668}}}],"partialFingerprints":{"codehealthFindingId/v1":"7072ca19dfb831f038b62785024984505b0b283f45dddd4e797acec8fd8ace92"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_ty_utils::instance::resolve_associated_item (cyclomatic 47): rustc_ty_utils::instance::resolve_associated_item has cyclomatic complexity 47 (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":"compiler/rustc_ty_utils/src/instance.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"e14e68d91d1688307382b27df94c029b25ce5c0c67e5440a8a965a528f98749f"}},{"ruleId":"D1","level":"warning","message":{"text":"rustdoc::clean::clean_middle_ty (cyclomatic 47): rustdoc::clean::clean_middle_ty has cyclomatic complexity 47 (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/librustdoc/clean/mod.rs"},"region":{"startLine":2136}}}],"partialFingerprints":{"codehealthFindingId/v1":"01a1b6b0e0ae3ac36d74a205c30f604da3255a7af73b794e28e174f376e7f3a4"}},{"ruleId":"D1","level":"warning","message":{"text":"rustdoc::doctest::run_test (cyclomatic 47): rustdoc::doctest::run_test has cyclomatic complexity 47 (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/librustdoc/doctest.rs"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e6f54248851d1a2b8926e9626804f51d6440ccff61c3e10624d2d1d56f3d6a2"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::operators::op_ref::check (cyclomatic 47): clippy_lints::operators::op_ref::check 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/tools/clippy/clippy_lints/src/operators/op_ref.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4e38e5222be2b9203109d2e399c28578e8014499804305cd7aad36897782aa0"}},{"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/tools/miri/src/diagnostics.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba39520927bffa2869e7357357f43baab1b71a93305b8154f52c66b5f069ff49"}},{"ruleId":"D1","level":"warning","message":{"text":"ide::syntax_highlighting::traverse (cyclomatic 47): ide::syntax_highlighting::traverse has cyclomatic complexity 47 (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/tools/rust-analyzer/crates/ide/src/syntax_highlighting.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"218f7f11f04682b303d861a95782400bea17e1eba3165e4a133368bed38ad1b4"}},{"ruleId":"D1","level":"warning","message":{"text":"rustfmt_nightly::items::rewrite_fn_base (cyclomatic 47): rustfmt_nightly::items::rewrite_fn_base has cyclomatic complexity 47 (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/tools/rustfmt/src/items.rs"},"region":{"startLine":2483}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb2be320cdfd280e528722139d1a455fbd36e4f4042a1aec16dd0d69d3a1bae6"}},{"ruleId":"D1","level":"warning","message":{"text":"DocSearch.execQuery::unifyFunctionTypes (cyclomatic 47): DocSearch.execQuery::unifyFunctionTypes has cyclomatic complexity 47 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: 5 other methods here (DocSearch.execQuery::buildHrefAndPath, DocSearch.execQuery::formatDisplayTypeSignature::writeFn, DocSearch.execQuery::transformResults, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 6 times rather than 6 independent problems. Splitting this body alone leaves the other 5 exactly as they are. Where these are variations on one operation, the change that clears all 6 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":3020}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdc1e12eea2278590259c7541c3b14bb286f5cd5245dc5feb3da7e9d8c4ac63f"}},{"ruleId":"D1","level":"warning","message":{"text":"search.initSearch::unifyFunctionTypes (cyclomatic 47): search.initSearch::unifyFunctionTypes has cyclomatic complexity 47 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: 12 other methods here (search.initSearch, search.initSearch::getItemsBefore, search.initSearch::getNextElem, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 13 times rather than 13 independent problems. Splitting this body alone leaves the other 12 exactly as they are. Where these are variations on one operation, the change that clears all 13 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":3020}}}],"partialFingerprints":{"codehealthFindingId/v1":"9be500cb9d0e58a879a2bcdaf9b77023194b2e3bf8726bad251d041331ef30b0"}},{"ruleId":"D1","level":"warning","message":{"text":"initSearch::execQuery::unifyFunctionTypes (cyclomatic 47): initSearch::execQuery::unifyFunctionTypes has cyclomatic complexity 47 (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/librustdoc/html/static/js/search.js"},"region":{"startLine":3020}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddcd55abb18cf5a6ccce9848f43e7dff39f2d7383cd2c7eeacc3b62843221d0c"}},{"ruleId":"D1","level":"warning","message":{"text":"State::print_expr (cyclomatic 46): State::print_expr has cyclomatic complexity 46 (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":"compiler/rustc_hir_pretty/src/lib.rs"},"region":{"startLine":1572}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca31ace12e23b5fb504b03207b0118b1e87b369703ed87cc0637ac5ffbce9a34"}},{"ruleId":"D1","level":"warning","message":{"text":"FnCallDiagCtxt::labels_and_suggestion_text (cyclomatic 46): FnCallDiagCtxt::labels_and_suggestion_text has cyclomatic complexity 46 (threshold 15). Of this number, 45 points are the body\u0027s own statements and 1 belongs 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":"compiler/rustc_hir_typeck/src/fn_ctxt/checks.rs"},"region":{"startLine":2654}}}],"partialFingerprints":{"codehealthFindingId/v1":"46ba8abf1a9a1f70893af852c1d224437ef9311c7fc302a60ba9b7f34dfaabd9"}},{"ruleId":"D1","level":"warning","message":{"text":"FnCtxt::check_expr_struct_fields (cyclomatic 46): FnCtxt::check_expr_struct_fields has cyclomatic complexity 46 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/expr.rs"},"region":{"startLine":1920}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c09030e9d2ab975a24ec2763919c4091cb1fe4966d4a981d6fd06ef85d2f02c"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_resolve::diagnostics::impls::show_candidates (cyclomatic 46): rustc_resolve::diagnostics::impls::show_candidates has cyclomatic complexity 46 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/diagnostics/impls.rs"},"region":{"startLine":4142}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ded1522e01a44bdff7666c41cd09b3f456a2564776c9d2ad724e7502449d90e"}},{"ruleId":"D1","level":"warning","message":{"text":"bootstrap::core::config::toml::rust::check_incompatible_options_for_ci_rustc (cyclomatic 46): bootstrap::core::config::toml::rust::check_incompatible_options_for_ci_rustc has cyclomatic complexity 46 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/config/toml/rust.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca7a73f8c35e2834b544cb8c1b1e46839586bb55a4201705e4db0318a8bec2d7"}},{"ruleId":"D1","level":"warning","message":{"text":"PrintVisitor::expr (cyclomatic 46): PrintVisitor::expr has cyclomatic complexity 46 (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/tools/clippy/clippy_lints/src/utils/author.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e717f4adecfb01b3fc4b1e2936a0122504d8f0409e9d9faf306db5fa0bcfa82"}},{"ruleId":"D1","level":"warning","message":{"text":"MirLowerCtx::pattern_match_inner (cyclomatic 46): MirLowerCtx::pattern_match_inner has cyclomatic complexity 46 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/mir/lower/pattern_matching.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"7149230611d79822eec0aba95642e42b51e4f9ab1aedc087890bd647bc1414ea"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_codegen_cranelift::base::codegen_fn_body (cyclomatic 45): rustc_codegen_cranelift::base::codegen_fn_body has cyclomatic complexity 45 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/src/base.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1e518bd9a2e26493dc5ac9f416684a1c0a0d46beb06b289bbe5df9ff2911f13"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_codegen_gcc::intrinsic::llvm::adjust_intrinsic_arguments (cyclomatic 45): rustc_codegen_gcc::intrinsic::llvm::adjust_intrinsic_arguments 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. This is NOT this file\u0027s highest cyclomatic complexity: rustc_codegen_gcc::intrinsic::llvm::intrinsic (cyclomatic 630) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_gcc/src/intrinsic/llvm.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"a31549e42c17b701d0b0725b66758be2ff853ba9725f02a68df39698d2578792"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_codegen_llvm::va_arg::emit_va_arg (cyclomatic 45): rustc_codegen_llvm::va_arg::emit_va_arg 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":"compiler/rustc_codegen_llvm/src/va_arg.rs"},"region":{"startLine":1070}}}],"partialFingerprints":{"codehealthFindingId/v1":"07e387a95130502c9102324aa7e07301c70ca25d78ab406e6977bb0a75fe3422"}},{"ruleId":"D1","level":"warning","message":{"text":"AnnotateSnippetEmitter::emit_messages_default (cyclomatic 45): AnnotateSnippetEmitter::emit_messages_default has cyclomatic complexity 45 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_errors/src/annotate_snippet_emitter_writer.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ea09495b4d09fe110a27c585f4eb96cb51373e8e67f4425606ff7d81d8758bf"}},{"ruleId":"D1","level":"warning","message":{"text":"CfgChecker::visit_terminator (cyclomatic 45): CfgChecker::visit_terminator has cyclomatic complexity 45 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/validate.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b539451157f732ce5739918d9de05b65a9d3de1fa2884742faf3278c82a1e43"}},{"ruleId":"D1","level":"warning","message":{"text":"libm::math::powf::powf (cyclomatic 45): libm::math::powf::powf has cyclomatic complexity 45 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/compiler-builtins/libm/src/math/powf.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3b76085767039674e900fe8f9b4148653d282cd7ce0be76531c9a5152dadefa"}},{"ruleId":"D1","level":"warning","message":{"text":"AtHwcap::cache (cyclomatic 45): AtHwcap::cache has cyclomatic complexity 45 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std_detect/src/detect/os/linux/aarch64.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c52581309d6e0b735b53fb925f8d3a1b0d6f3d02e31c419a0502b9dd3dcff17"}},{"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/tools/miri/src/shims/unix/macos/foreign_items.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f1a644763a7e9632c64f7be132ca7c9d6074237f60602bd4af60d23cd73c643"}},{"ruleId":"D1","level":"warning","message":{"text":"SourceAnalyzer::resolve_path (cyclomatic 45): SourceAnalyzer::resolve_path has cyclomatic complexity 45 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir/src/source_analyzer.rs"},"region":{"startLine":1158}}}],"partialFingerprints":{"codehealthFindingId/v1":"41649099047393f14dd95cb458b1abf3d4f4ce86229f9641890299d32e1dd342"}},{"ruleId":"D1","level":"warning","message":{"text":"ide_completion::completions::postfix::complete_postfix (cyclomatic 45): ide_completion::completions::postfix::complete_postfix has cyclomatic complexity 45 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-completion/src/completions/postfix.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"77227d526b7094c1365249e963e400dd82267fb1e56077f03ff48dcf946869c4"}},{"ruleId":"D1","level":"warning","message":{"text":"mbe::expander::matcher::match_loop_inner (cyclomatic 45): mbe::expander::matcher::match_loop_inner has cyclomatic complexity 45 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/mbe/src/expander/matcher.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"deec35855a0a0a329976f6342d93566aa38d0e5656f7d764d86615fec9e2f7bb"}},{"ruleId":"D1","level":"warning","message":{"text":"ErasedFileAstId::kind_typed (cyclomatic 45): ErasedFileAstId::kind_typed has cyclomatic complexity 45 (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/tools/rust-analyzer/crates/span/src/ast_id.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"12b14690fc942d14424e98e69892946358c53d7269046db15af45656953f21bd"}},{"ruleId":"D1","level":"warning","message":{"text":"State::print_pat (cyclomatic 44): State::print_pat has cyclomatic complexity 44 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: PrintState::token_kind_to_string_ext (cyclomatic 60) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ast_pretty/src/pprust/state.rs"},"region":{"startLine":1923}}}],"partialFingerprints":{"codehealthFindingId/v1":"a67a114c221b985a74babd4c308c06b06edb6517887bf0564d60dedb33c3d2eb"}},{"ruleId":"D1","level":"warning","message":{"text":"DocParser::parse_single_doc_attr_item (cyclomatic 44): DocParser::parse_single_doc_attr_item 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":"compiler/rustc_attr_parsing/src/attributes/doc.rs"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cf05a6050e1b1eed2bb8a59d66d703271a9e5cf53ee552d9653176323c0fe45"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_codegen_ssa::mir::naked_asm::prefix_and_suffix (cyclomatic 44): rustc_codegen_ssa::mir::naked_asm::prefix_and_suffix 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":"compiler/rustc_codegen_ssa/src/mir/naked_asm.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc8c66d5db17ed4e9f73045e006eaf825839c9cfc1fc01e25f402cc7a01a31a7"}},{"ruleId":"D1","level":"warning","message":{"text":"State::print_pat (cyclomatic 44): State::print_pat has cyclomatic complexity 44 (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":"compiler/rustc_hir_pretty/src/lib.rs"},"region":{"startLine":2029}}}],"partialFingerprints":{"codehealthFindingId/v1":"a13d1b96a6b3ce46ba134afb6317c0092b698d4fdf1a2ca22a4d9363f0e20c3f"}},{"ruleId":"D1","level":"warning","message":{"text":"Resolver::resolve_ident_in_scope (cyclomatic 44): Resolver::resolve_ident_in_scope 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":"compiler/rustc_resolve/src/ident.rs"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"741c7b6670196695927dc9449562e2a459a20169f89b3bc5b4084b190375f53c"}},{"ruleId":"D1","level":"warning","message":{"text":"UnsafetyVisitor::visit_expr (cyclomatic 44): UnsafetyVisitor::visit_expr has cyclomatic complexity 44 (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":"compiler/rustc_mir_build/src/check_unsafety.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"f28d37fb584da5af4ed85c58b136f6bbdf79ab67b1cf393c7eb245900506fb84"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_ty_utils::consts::recurse_build (cyclomatic 44): rustc_ty_utils::consts::recurse_build 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":"compiler/rustc_ty_utils/src/consts.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3114d0546362cafa67c3331948699d5f0751b4db90b0459e2205258c6ad4eb6"}},{"ruleId":"D1","level":"warning","message":{"text":"libm::math::rem_pio2_large::rem_pio2_large (cyclomatic 44): libm::math::rem_pio2_large::rem_pio2_large has cyclomatic complexity 44 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/compiler-builtins/libm/src/math/rem_pio2_large.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9970f882add8a0aeb8bb8806ff008779234d04b21af395b8f7a6c64e2bbf3f0"}},{"ruleId":"D1","level":"warning","message":{"text":"bootstrap::core::config::toml::llvm::check_incompatible_options_for_ci_llvm (cyclomatic 44): bootstrap::core::config::toml::llvm::check_incompatible_options_for_ci_llvm has cyclomatic complexity 44 (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/bootstrap/src/core/config/toml/llvm.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a7fadedf53fe9fa923c882966457184299b26030cd78f74df685842ebb1699f"}},{"ruleId":"D1","level":"warning","message":{"text":"rustdoc::passes::collect_intra_doc_links::resolution_failure (cyclomatic 44): rustdoc::passes::collect_intra_doc_links::resolution_failure has cyclomatic complexity 44 (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/librustdoc/passes/collect_intra_doc_links.rs"},"region":{"startLine":2106}}}],"partialFingerprints":{"codehealthFindingId/v1":"f38e66c5fbdb27da24e5f7ca02614bf8e031a639611bd91fb9bd2382d2ede31a"}},{"ruleId":"D1","level":"warning","message":{"text":"UselessConversion::check_expr (cyclomatic 44): UselessConversion::check_expr has cyclomatic complexity 44 (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/tools/clippy/clippy_lints/src/useless_conversion.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"30568d8ef719f0e27ece013e089f2451e712c97a34cd14c291f02663e4eb8aae"}},{"ruleId":"D1","level":"warning","message":{"text":"TestCx::check_expected_errors (cyclomatic 44): TestCx::check_expected_errors has cyclomatic complexity 44 (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/tools/compiletest/src/runtest.rs"},"region":{"startLine":693}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf9e23c461e835cc443ba1446bd092130f5648c04d89ba771b06e4a5c556dc2a"}},{"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/tools/miri/src/shims/math.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d62e18674bf210a66576834dcea29f0c7fd82de5e3f3d034deed32be6956735"}},{"ruleId":"D1","level":"warning","message":{"text":"ide_completion::completions::type::complete_type_path (cyclomatic 44): ide_completion::completions::type::complete_type_path 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/tools/rust-analyzer/crates/ide-completion/src/completions/type.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f24088bf0f5a3fd79e56a7817a3ab5c59c4134f2dc9f537f0a05095e4799f96"}},{"ruleId":"D1","level":"warning","message":{"text":"CharClasses::next (cyclomatic 44): CharClasses::next 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/tools/rustfmt/src/comment.rs"},"region":{"startLine":1394}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fef8f7e8045230318809a1dacf149c1875e8a9a95a739826c8608d843472fa6"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutCalculator::layout_of_univariant_biased (cyclomatic 43): LayoutCalculator::layout_of_univariant_biased has cyclomatic complexity 43 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_abi/src/layout.rs"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"b81f1e806baab867b01c72a280bef0358bbfd508d7052d748204b2f58520fc74"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_builtin_macros::asm::validate_asm_args (cyclomatic 43): rustc_builtin_macros::asm::validate_asm_args has cyclomatic complexity 43 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_builtin_macros/src/asm.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e53144ee4acd931b9de8f0defa875bc7c50443a55601f0127bedce455f96d34"}},{"ruleId":"D1","level":"warning","message":{"text":"FunctionCx::codegen_rvalue_operand (cyclomatic 43): FunctionCx::codegen_rvalue_operand has cyclomatic complexity 43 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/mir/rvalue.rs"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfba27a13ab5a7ed8cd45da4de67e2f79feadb70a0c18e714d1a6e744d3d24ce"}},{"ruleId":"D1","level":"warning","message":{"text":"PrettyPrinter::pretty_print_opaque_impl_type (cyclomatic 43): PrettyPrinter::pretty_print_opaque_impl_type has cyclomatic complexity 43 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/ty/print/pretty.rs"},"region":{"startLine":1050}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5754d90477301522b13b8e50f82e878a4f9dec1d4ef30ff2e6d31a46110e421"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeErrCtxt::note_error_origin (cyclomatic 43): TypeErrCtxt::note_error_origin has cyclomatic complexity 43 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/error_reporting/infer/mod.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"d54cf5c3ac380f8610e4ddbfa38f9e4598595f54f76e0c6b84ea87da051ce3ad"}},{"ruleId":"D1","level":"warning","message":{"text":"Pgo::merge (cyclomatic 43): Pgo::merge has cyclomatic complexity 43 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/config/toml/pgo.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"b300589dd259b99c0df812f981b880005015f37510f1121a13d793ccea050b88"}},{"ruleId":"D1","level":"warning","message":{"text":"bootstrap::bin::rustc::main (cyclomatic 43): bootstrap::bin::rustc::main has cyclomatic complexity 43 (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/bootstrap/src/bin/rustc.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"bed18d49054d0cfe207bf3d33a0f5e108d9c8e5ab6fa6338e039c2e80a5d7ecb"}},{"ruleId":"D1","level":"warning","message":{"text":"Display::fmt (cyclomatic 43): Display::fmt has cyclomatic complexity 43 (threshold 15). Of this number, 42 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: rustdoc::clean::cfg::human_readable_target_os (cyclomatic 53) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/clean/cfg.rs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"407a21eb08265cd0318462dc7d3791bde211d62ca3fb0428dfebb5682712f4f0"}},{"ruleId":"D1","level":"warning","message":{"text":"rustdoc::doctest::make::parse_source (cyclomatic 43): rustdoc::doctest::make::parse_source has cyclomatic complexity 43 (threshold 15). Of this number, 30 points are the body\u0027s own statements and 13 belong to 3 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":"src/librustdoc/doctest/make.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"f468f6349ff46c5427e9d278120108f9fc73c142de11d26d8770291446c0d751"}},{"ruleId":"D1","level":"warning","message":{"text":"rustdoc::html::render::print_item::item_module (cyclomatic 43): rustdoc::html::render::print_item::item_module has cyclomatic complexity 43 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 18 belong to 3 function items inside it that branch. 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/librustdoc/html/render/print_item.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"0664abd9d4693ba51de45f643bdbfdef8b8ca7c914d09a3e13636f666c6e4d88"}},{"ruleId":"D1","level":"warning","message":{"text":"bootstrap.default_build_triple (cyclomatic 43): bootstrap.default_build_triple has cyclomatic complexity 43 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/bootstrap.py"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"5417052c91d01f4f7117cc2cf49435a336f67e1bf079fd54837da4229b1a6917"}},{"ruleId":"D1","level":"warning","message":{"text":"Ty::rewrite_result (cyclomatic 42): Ty::rewrite_result has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/types.rs"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"60352ee6674f7f17c8c7ddd0625352407dbacf00aaf9c60a87ada87ef2b56d51"}},{"ruleId":"D1","level":"warning","message":{"text":"MacroExpander::expand_invoc (cyclomatic 42): MacroExpander::expand_invoc has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_expand/src/expand.rs"},"region":{"startLine":699}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b5f9e746e6bd9cb32f14ec9fb11907a67170110fad9c1d87b379341099d42db"}},{"ruleId":"D1","level":"warning","message":{"text":"Resolver::lookup_import_candidates_from_module (cyclomatic 42): Resolver::lookup_import_candidates_from_module has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/diagnostics/impls.rs"},"region":{"startLine":1669}}}],"partialFingerprints":{"codehealthFindingId/v1":"e67e57a386e7ed19c07c635149b4f877c69f51556d0fe01297ed8ea649f26e26"}},{"ruleId":"D1","level":"warning","message":{"text":"Resolver::report_privacy_error (cyclomatic 42): Resolver::report_privacy_error has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/diagnostics/impls.rs"},"region":{"startLine":2724}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d7ba46811ab728e1055db80872fa32898c3ebf801502adba8c77b6965228c12"}},{"ruleId":"D1","level":"warning","message":{"text":"Resolver::report_path_resolution_error (cyclomatic 42): Resolver::report_path_resolution_error has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/diagnostics/impls.rs"},"region":{"startLine":3105}}}],"partialFingerprints":{"codehealthFindingId/v1":"91f6c96a6f2bfd2cae59cc2da5abafb82057910fc094a923b3b8dcb165bada20"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeLimits::check_expr (cyclomatic 42): TypeLimits::check_expr has cyclomatic complexity 42 (threshold 15). Most of this is not in the body itself: 9 of the 42 points are its own statements and the rest belongs to 4 function items inside it that branch (is_valid, diag_item_cmpop, check_limits, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_lint/src/types.rs"},"region":{"startLine":656}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d0b36c23bca29a6e988f4302b823e261d40a9140ca7cd9aa41f2a18da79659b"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::parse_ty_common (cyclomatic 42): Parser::parse_ty_common has cyclomatic complexity 42 (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":"compiler/rustc_parse/src/parser/ty.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccbb45b2e1a633be53f29af11994fde6781a5f9bc39bac45017689e71b00d481"}},{"ruleId":"D1","level":"warning","message":{"text":"rustdoc::html::render::print_item::print_item (cyclomatic 42): rustdoc::html::render::print_item::print_item has cyclomatic complexity 42 (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/librustdoc/html/render/print_item.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0a596491bcba24fab4c851aa143aa33279681d81c0113c5bf6fd97e70b760bf"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_utils::is_never_expr (cyclomatic 42): clippy_utils::is_never_expr has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_utils/src/lib.rs"},"region":{"startLine":3021}}}],"partialFingerprints":{"codehealthFindingId/v1":"a295c61b1ed6ac249c3ef50a80da7cc6b3680d9bb30d90f3558671a413fddb2f"}},{"ruleId":"D1","level":"warning","message":{"text":"hir_def::hir::format_args::parse (cyclomatic 42): hir_def::hir::format_args::parse has cyclomatic complexity 42 (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/tools/rust-analyzer/crates/hir-def/src/hir/format_args.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"fac9fe3e3c755c295eac17ea9976e05d56fed9666efbf1b5d8a75badce42f81e"}},{"ruleId":"D1","level":"warning","message":{"text":"ExprUseVisitor::walk_expr (cyclomatic 41): ExprUseVisitor::walk_expr 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":"compiler/rustc_hir_typeck/src/expr_use_visitor.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fac2b825fc477ff0086ae5fe4ea4d093b587aeea66ed620924e0ced25571f9b"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_metadata::dependency_format::calculate_type (cyclomatic 41): rustc_metadata::dependency_format::calculate_type 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":"compiler/rustc_metadata/src/dependency_format.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"09d49df120f3312f38eace2bd1a3ed4aff5f72763978a6aa092c1c75808dd706"}},{"ruleId":"D1","level":"warning","message":{"text":"InterPat::lower_thir_pat (cyclomatic 41): InterPat::lower_thir_pat has cyclomatic complexity 41 (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":"compiler/rustc_mir_build/src/builder/matches/match_pair.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7f26e2f285146a0fbeef8cc2f531ab5a2cf21310c81297e249f4ed499994ce6"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_ty_utils::layout::invariant::layout_sanity_check (cyclomatic 41): rustc_ty_utils::layout::invariant::layout_sanity_check has cyclomatic complexity 41 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 18 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":"compiler/rustc_ty_utils/src/layout/invariant.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e297e478ac96075ca264e7e34baefa32d3f477aaa76b2eca4af66be937496ca"}},{"ruleId":"D1","level":"warning","message":{"text":"TestCx::run_ui_test (cyclomatic 41): TestCx::run_ui_test 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/tools/compiletest/src/runtest/ui.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"9146d4a8da26b6cb5bafd9f525648696acb282b203eb0e402f265cb2e5a56b82"}},{"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/tools/miri/src/shims/unix/fs.rs"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"dce4bb25bebc34cf967cefd4391d2576d4c57fe373358dfd142ab89a89754fad"}},{"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/tools/miri/src/shims/unix/linux/foreign_items.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"9df28f0af75c7b0af8537d5fce6cd5c538bd988dc6930708422621c19a744527"}},{"ruleId":"D1","level":"warning","message":{"text":"Resolver::resolve_path_in_value_ns_with_prefix_info (cyclomatic 41): Resolver::resolve_path_in_value_ns_with_prefix_info 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/tools/rust-analyzer/crates/hir-def/src/resolver.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"c40217a123e3418154ba22e455d03bd3819cbcd4a5a2c50ebfae84908299abd1"}},{"ruleId":"D1","level":"warning","message":{"text":"hir_expand::fixup::fixup_syntax (cyclomatic 41): hir_expand::fixup::fixup_syntax 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/tools/rust-analyzer/crates/hir-expand/src/fixup.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"67a702a549d1562f6925578d808ac5b36b9f44e119d8c29d794c5d97ae476bbf"}},{"ruleId":"D1","level":"warning","message":{"text":"State::print_item (cyclomatic 40): State::print_item has cyclomatic complexity 40 (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":"compiler/rustc_ast_pretty/src/pprust/state/item.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d58702397d0d98a1d267b5adfb899bde085ccf683904bae977b682a079384ef"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_builtin_macros::asm::expand_preparsed_asm (cyclomatic 40): rustc_builtin_macros::asm::expand_preparsed_asm has cyclomatic complexity 40 (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":"compiler/rustc_builtin_macros/src/asm.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"010c51f08f0099f749c6d46cc3a17acb411c213faa68bbcc14c8a108089507da"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_codegen_ssa::back::metadata::elf_e_flags (cyclomatic 40): rustc_codegen_ssa::back::metadata::elf_e_flags has cyclomatic complexity 40 (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":"compiler/rustc_codegen_ssa/src/back/metadata.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"50a3112332d14a97e22f8f544b49eb7b5a2da07f1769242b24390a3bd6a15a59"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_hir_analysis::collect::generics_of::generics_of (cyclomatic 40): rustc_hir_analysis::collect::generics_of::generics_of has cyclomatic complexity 40 (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":"compiler/rustc_hir_analysis/src/collect/generics_of.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"8296ed6ce1d77883dcb202d32f7fb7b6cf0a517ca59900e6427fb223856dc18f"}},{"ruleId":"D1","level":"warning","message":{"text":"NiceRegionError::report_trait_placeholder_mismatch (cyclomatic 40): NiceRegionError::report_trait_placeholder_mismatch has cyclomatic complexity 40 (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":"compiler/rustc_trait_selection/src/error_reporting/infer/nice_region_error/placeholder_error.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"99a897a1e2445e5526a95d0f9d5f701da10f08ed4c085ce30b142902bf29aed2"}},{"ruleId":"D1","level":"warning","message":{"text":"Assemble::run (cyclomatic 40): Assemble::run has cyclomatic complexity 40 (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/bootstrap/src/core/build_steps/compile.rs"},"region":{"startLine":2122}}}],"partialFingerprints":{"codehealthFindingId/v1":"5720ea31e1e7d46bd86b9f2aec9493efde6700ac6d85adca6f90577fc7dfd96d"}},{"ruleId":"D1","level":"warning","message":{"text":"Dereferencing::report (cyclomatic 40): Dereferencing::report has cyclomatic complexity 40 (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/tools/clippy/clippy_lints/src/dereference.rs"},"region":{"startLine":1098}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d882cc66d6cb23f718b4bbc80e567664e9b606b0c51bfc2a782d6aadc7012da"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::methods::manual_inspect::check (cyclomatic 40): clippy_lints::methods::manual_inspect::check has cyclomatic complexity 40 (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/tools/clippy/clippy_lints/src/methods/manual_inspect.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d10d3e842c4413fbab8d609af63aaefa4de046503501e963fa40381bafbff08"}},{"ruleId":"D1","level":"warning","message":{"text":"ExprCollector::collect_pat (cyclomatic 40): ExprCollector::collect_pat has cyclomatic complexity 40 (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/tools/rust-analyzer/crates/hir-def/src/expr_store/lower.rs"},"region":{"startLine":2918}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccba941f75fe5e4d490352c90dd55ce39f02258b24e4ae59ad8c3a0e00b51129"}},{"ruleId":"D1","level":"warning","message":{"text":"Printer::print_pat (cyclomatic 40): Printer::print_pat has cyclomatic complexity 40 (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/tools/rust-analyzer/crates/hir-def/src/expr_store/pretty.rs"},"region":{"startLine":896}}}],"partialFingerprints":{"codehealthFindingId/v1":"9980f8297eb22159ebb1b91fd038ee722d543c76f133492067e2cf34ee8a6362"}},{"ruleId":"D1","level":"warning","message":{"text":"ExprUseVisitor::walk_expr (cyclomatic 40): ExprUseVisitor::walk_expr has cyclomatic complexity 40 (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/tools/rust-analyzer/crates/hir-ty/src/infer/closure/analysis/expr_use_visitor.rs"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b3b5b7d96d94dea96f3d09b5695cdb727dc126be1c8004db632b8fa5287cde0"}},{"ruleId":"D1","level":"warning","message":{"text":"InferenceContext::infer_mut_expr_without_adjust (cyclomatic 40): InferenceContext::infer_mut_expr_without_adjust has cyclomatic complexity 40 (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/tools/rust-analyzer/crates/hir-ty/src/infer/mutability.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"69a2c94fdb4ed18f9d067ce703e431a7a8858802ec96424e50c9552f2f752971"}},{"ruleId":"D1","level":"warning","message":{"text":"hir_ty::next_solver::consts::valtree::allocation_to_const (cyclomatic 40): hir_ty::next_solver::consts::valtree::allocation_to_const has cyclomatic complexity 40 (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/tools/rust-analyzer/crates/hir-ty/src/next_solver/consts/valtree.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"049b6ffd22e60eb45436130dd3051d1a5542994c020b34ea72e713749c995c88"}},{"ruleId":"D1","level":"warning","message":{"text":"ide::syntax_highlighting::highlight::punctuation (cyclomatic 40): ide::syntax_highlighting::highlight::punctuation has cyclomatic complexity 40 (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/tools/rust-analyzer/crates/ide/src/syntax_highlighting/highlight.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"d200f8b6423da06f6b18e35fac0b3ad39142da6afcf90998fdc3b58de81d6735"}},{"ruleId":"D1","level":"warning","message":{"text":"ide_db::syntax_helpers::format_string::lex_format_specifiers (cyclomatic 40): ide_db::syntax_helpers::format_string::lex_format_specifiers has cyclomatic complexity 40 (threshold 15). Of this number, 35 points are the body\u0027s own statements and 5 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":"src/tools/rust-analyzer/crates/ide-db/src/syntax_helpers/format_string.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"a38d28405080268f07ba10ba90542d219df48f090cd0fcfcbe0c6c02e88a5332"}},{"ruleId":"D1","level":"warning","message":{"text":"syntax_bridge::prettify_macro_expansion::prettify_macro_expansion (cyclomatic 40): syntax_bridge::prettify_macro_expansion::prettify_macro_expansion has cyclomatic complexity 40 (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/tools/rust-analyzer/crates/syntax-bridge/src/prettify_macro_expansion.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"17d6e95338579d28a073fe38ad5776cf7d5eae3cd0a211416a6042321c9d3c17"}},{"ruleId":"D1","level":"warning","message":{"text":"CommentRewrite::handle_line (cyclomatic 40): CommentRewrite::handle_line has cyclomatic complexity 40 (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/tools/rustfmt/src/comment.rs"},"region":{"startLine":713}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ffb8aa19eb3fd7847587ec526e6453e9528f1bb537a7a468737dee0bde7332b"}},{"ruleId":"D1","level":"warning","message":{"text":"FnCtxt::note_source_of_type_mismatch_constraint (cyclomatic 39): FnCtxt::note_source_of_type_mismatch_constraint has cyclomatic complexity 39 (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":"compiler/rustc_hir_typeck/src/demand.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"46cb8aa0a224c77a0e5de52c88848fe34e89a7116f219d3f415d5caf77d551f3"}},{"ruleId":"D1","level":"warning","message":{"text":"ImproperCTypesVisitor::visit_type (cyclomatic 39): ImproperCTypesVisitor::visit_type has cyclomatic complexity 39 (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":"compiler/rustc_lint/src/types/improper_ctypes.rs"},"region":{"startLine":784}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cba8a08f46c2a93c6a21d5957b445fab68c236c007b0d95e4229e382fda0bef"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_middle::ty::diagnostics::suggest_constraining_type_params (cyclomatic 39): rustc_middle::ty::diagnostics::suggest_constraining_type_params has cyclomatic complexity 39 (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":"compiler/rustc_middle/src/ty/diagnostics.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"d53df60c95cc881610f879c8e864015e781e8eb9c4bac9dcb2583466becf595e"}},{"ruleId":"D1","level":"warning","message":{"text":"VnState::eval_to_const_inner (cyclomatic 39): VnState::eval_to_const_inner has cyclomatic complexity 39 (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":"compiler/rustc_mir_transform/src/gvn.rs"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"194b8aa356a90f0a1820f11fc660698726670baf2d3e9d27f782fc5e538cdd3e"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::parse_pat_with_range_pat (cyclomatic 39): Parser::parse_pat_with_range_pat has cyclomatic complexity 39 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/pat.rs"},"region":{"startLine":721}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aa8867d42645c1a3ee517e4c5a16a5cf341ed5f3e135b18621b109ab5e4376c"}},{"ruleId":"D1","level":"warning","message":{"text":"ConstructorSet::split (cyclomatic 39): ConstructorSet::split has cyclomatic complexity 39 (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":"compiler/rustc_pattern_analysis/src/constructor.rs"},"region":{"startLine":1044}}}],"partialFingerprints":{"codehealthFindingId/v1":"0306564fce57aa6aa90ccb695769ff2d236e4c9a29479c9da38dd7f68b2e5841"}},{"ruleId":"D1","level":"warning","message":{"text":"FindUsages::search (cyclomatic 39): FindUsages::search has cyclomatic complexity 39 (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/tools/rust-analyzer/crates/ide-db/src/search.rs"},"region":{"startLine":929}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3dbd4f9d7f89bc2727d38ba7b5e9749d7dd58a4bacbce79b0e4546cd3d0765e"}},{"ruleId":"D1","level":"warning","message":{"text":"main.register_type_impls (cyclomatic 39): main.register_type_impls has cyclomatic complexity 39 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 22 belong to 5 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/main.js"},"region":{"startLine":941}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c0d80e97f0536e2814181a1356c048854e680f3a004c8be595e632542f38c1d"}},{"ruleId":"D1","level":"warning","message":{"text":"search.initSearch::getNextElem (cyclomatic 39): search.initSearch::getNextElem has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: 12 other methods here (search.initSearch, search.initSearch::getItemsBefore, search.initSearch::createQueryElement, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 13 times rather than 13 independent problems. Splitting this body alone leaves the other 12 exactly as they are. Where these are variations on one operation, the change that clears all 13 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"3875b29eb9e0b9d606b99c5bc59cc4c2b15c1074ea3001c3a6d1fb47ae221bb9"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_builtin_macros::autodiff::llvm_enzyme::gen_enzyme_decl (cyclomatic 38): rustc_builtin_macros::autodiff::llvm_enzyme::gen_enzyme_decl has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_builtin_macros/src/autodiff.rs"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fffa75781ed11f99fca99214a1516e1c2729810629df851769faead93569a3c"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_mir_build::thir::pattern::check_match::report_non_exhaustive_match (cyclomatic 38): rustc_mir_build::thir::pattern::check_match::report_non_exhaustive_match has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_build/src/thir/pattern/check_match.rs"},"region":{"startLine":1250}}}],"partialFingerprints":{"codehealthFindingId/v1":"276a1ac9615c054448e99286546a88ff98cad763e49ccd741c159454764c902c"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::parse_item_kind (cyclomatic 38): Parser::parse_item_kind has cyclomatic complexity 38 (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":"compiler/rustc_parse/src/parser/item.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed6db4c6844db783c9784a513a93fcbd8aed3f241b1c4c966cd65465eb3e6e80"}},{"ruleId":"D1","level":"warning","message":{"text":"LateResolutionVisitor::resolve_expr (cyclomatic 38): LateResolutionVisitor::resolve_expr has cyclomatic complexity 38 (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":"compiler/rustc_resolve/src/late.rs"},"region":{"startLine":5512}}}],"partialFingerprints":{"codehealthFindingId/v1":"7df96e28e1c6ce3811bedb75aafc606b8aa44672c7db932f23f01f6394d82b02"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeErrCtxt::construct_generic_bound_failure (cyclomatic 38): TypeErrCtxt::construct_generic_bound_failure has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/error_reporting/infer/region.rs"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"c55f823b13441e2f10c46fac05d67ddc5869d2c10d21d624288503522839ab53"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeErrCtxt::report_fulfillment_errors (cyclomatic 38): TypeErrCtxt::report_fulfillment_errors has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/error_reporting/traits/mod.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcf1e69c12d4c44e6ef2703711244633ec71755a09459a218500dee39e41fa54"}},{"ruleId":"D1","level":"warning","message":{"text":"WfPredicates::visit_ty (cyclomatic 38): WfPredicates::visit_ty has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/traits/wf.rs"},"region":{"startLine":775}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fce86af021206dda8877a02fa84ea0d7a25ce1fd313bc3b47c4a4856c33d3db"}},{"ruleId":"D1","level":"warning","message":{"text":"rustdoc::passes::lint::html_tags::visit_item (cyclomatic 38): rustdoc::passes::lint::html_tags::visit_item has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/passes/lint/html_tags.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"e21a7cb65d9d04bba09c86056f60cd6da516f1b650555bf330aef0f2472140f2"}},{"ruleId":"D1","level":"warning","message":{"text":"ModCollector::collect (cyclomatic 38): ModCollector::collect has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/nameres/collector.rs"},"region":{"startLine":1898}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ad72fbda4b7962db25ed61b056a87832e0e37e1e61d2d11ffd7966f725a0d7d"}},{"ruleId":"D1","level":"warning","message":{"text":"hir_def::expr_store::lower::path::lower_path (cyclomatic 38): hir_def::expr_store::lower::path::lower_path has cyclomatic complexity 38 (threshold 15). Of this number, 37 points are the body\u0027s own statements and 1 belongs 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/tools/rust-analyzer/crates/hir-def/src/expr_store/lower/path.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"74aec44f1ae44c0dbdbe00bb76ae02d4841a6fd3c5e9a129b726080bd7abaadc"}},{"ruleId":"D1","level":"warning","message":{"text":"parser::grammar::items::opt_item (cyclomatic 38): parser::grammar::items::opt_item has cyclomatic complexity 38 (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/tools/rust-analyzer/crates/parser/src/grammar/items.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"80d5be1924cfe5c2d083c170be80dcc70e865c2b78129ca83e8eae9e4ea24b26"}},{"ruleId":"D1","level":"warning","message":{"text":"rustfmt_nightly::macros::rewrite_macro_inner (cyclomatic 38): rustfmt_nightly::macros::rewrite_macro_inner has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/macros.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"03acd72957759f35f5a8f6f12fa0d314c845df91f793d5e19f5f06b34117a008"}},{"ruleId":"D1","level":"warning","message":{"text":"TargetDataLayout::parse_from_llvm_datalayout_string (cyclomatic 37): TargetDataLayout::parse_from_llvm_datalayout_string has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_abi/src/lib.rs"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fd36c6b600ccfa12acb90dc7c9e4dfd53ff6fdcf9922bd0946665afe65ed880"}},{"ruleId":"D1","level":"warning","message":{"text":"Pat::rewrite_result (cyclomatic 37): Pat::rewrite_result 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/tools/rustfmt/src/patterns.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"62df52bd9a94e4aa508caef64baf71657b76532a86c9495c88e5b53c067045a9"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_codegen_cranelift::abi::codegen_terminator_call (cyclomatic 37): rustc_codegen_cranelift::abi::codegen_terminator_call has cyclomatic complexity 37 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 11 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":"compiler/rustc_codegen_cranelift/src/abi/mod.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ff2a13b895f47f6b25dbc34a7151b252f41ae636a8460cdab0617cb7af40567"}},{"ruleId":"D1","level":"warning","message":{"text":"FnCtxt::suggest_deref_ref_or_into (cyclomatic 37): FnCtxt::suggest_deref_ref_or_into has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/fn_ctxt/suggestions.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"603902b9e38ccdafb518f81f5839df420146a86a5147e73feec8eb099a05a43a"}},{"ruleId":"D1","level":"warning","message":{"text":"FnCtxt::analyze_closure (cyclomatic 37): FnCtxt::analyze_closure has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/upvar.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe4013010d9c0212ddbbb91b2c967a03ada61780247e5c867517e5ab2b574abc"}},{"ruleId":"D1","level":"warning","message":{"text":"Rvalue::fmt (cyclomatic 37): Rvalue::fmt has cyclomatic complexity 37 (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":"compiler/rustc_middle/src/mir/pretty.rs"},"region":{"startLine":1148}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b218ccb1a8d61dfb1b36b9dc739c12debf68563c2f3008ed45a9801a38621c9"}},{"ruleId":"D1","level":"warning","message":{"text":"TransformTy::fold_ty (cyclomatic 37): TransformTy::fold_ty has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_sanitizers/src/cfi/typeid/itanium_cxx_abi/transform.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"8229d5495833c5564dcf60cc376b4bbbc7d08ad8e58f1ee9d58e5604a41764a9"}},{"ruleId":"D1","level":"warning","message":{"text":"Target::abi_required_features (cyclomatic 37): Target::abi_required_features 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":"compiler/rustc_target/src/target_features.rs"},"region":{"startLine":1333}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca91085995b3b5d54d318d3a1fd3b03b66249ff144e5fe7bdb6be3e8363409ba"}},{"ruleId":"D1","level":"warning","message":{"text":"NormalizedPat::from_pat (cyclomatic 37): NormalizedPat::from_pat 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/tools/clippy/clippy_lints/src/matches/match_same_arms.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"7833b08f1881ac84c76a3ef3e45896a48e33d9cf27b8a5a0f20cd95dc0a22fa0"}},{"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":"src/tools/miri/cargo-miri/src/phases.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"07cc93c8815fc77834b8febc49841834ceda0e78ba72d8d8e6529e334700d573"}},{"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/tools/miri/src/intrinsics/x86/sse2.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"50c34d7cbe9e2884fb75e5caf91b8135e111983db987bc04a522c89900201e26"}},{"ruleId":"D1","level":"warning","message":{"text":"parser::grammar::expressions::atom::atom_expr (cyclomatic 37): parser::grammar::expressions::atom::atom_expr 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/tools/rust-analyzer/crates/parser/src/grammar/expressions/atom.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bc4c03b50212e07e12ca0b91144bf6c0101b4a2f4fe5e72d6c0eea655bb7273"}},{"ruleId":"D1","level":"warning","message":{"text":"initSearch::execQuery::innerRunTypeQuery::unpackPostingsList (cyclomatic 37): initSearch::execQuery::innerRunTypeQuery::unpackPostingsList has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":4302}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a38365dae305e77d035e489d98effaf5a8a9fa6e4834b52ef33700bed63e664"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_builtin_macros::format::report_missing_placeholders (cyclomatic 36): rustc_builtin_macros::format::report_missing_placeholders 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":"compiler/rustc_builtin_macros/src/format.rs"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfcf3b901dffd5af051e1f08b65890591fd8a62cf56e5896bfbc700544fab500"}},{"ruleId":"D1","level":"warning","message":{"text":"y::main (cyclomatic 36): y::main has cyclomatic complexity 36 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/build_system/main.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"58218a0f07233e3b8b6aa5b635eb11f7d078d816342656594dd89152a184c290"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_codegen_llvm::llvm_util::to_llvm_features (cyclomatic 36): rustc_codegen_llvm::llvm_util::to_llvm_features has cyclomatic complexity 36 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/llvm_util.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"39d5e7b44eca99e3768f7d6dc2d5745f81c2bc815f93cbf362337f478a96b783"}},{"ruleId":"D1","level":"warning","message":{"text":"CheckLoopVisitor::visit_expr (cyclomatic 36): CheckLoopVisitor::visit_expr 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":"compiler/rustc_hir_typeck/src/loops.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"640589e17719183dde9f9ded739fde86c26e09521ed3c31686093fac948af3c6"}},{"ruleId":"D1","level":"warning","message":{"text":"Resolver::check_unused (cyclomatic 36): Resolver::check_unused has cyclomatic complexity 36 (threshold 15). Of this number, 32 points are the body\u0027s own statements and 4 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":"compiler/rustc_resolve/src/check_unused.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"3240dc692e291d06a391c300b018bd3b057a8a3734ad161a792d3a49f730c50d"}},{"ruleId":"D1","level":"warning","message":{"text":"ConstAnalysis::handle_assign (cyclomatic 36): ConstAnalysis::handle_assign 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":"compiler/rustc_mir_transform/src/dataflow_const_prop.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7714d0936e8c1946ecd9007c13b7870ea4a769412ae7bafb2440354a47d9982"}},{"ruleId":"D1","level":"warning","message":{"text":"LateResolutionVisitor::suggest_assoc_type_from_bounds (cyclomatic 36): LateResolutionVisitor::suggest_assoc_type_from_bounds 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":"compiler/rustc_resolve/src/late/diagnostics.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6c818bf4b573c7a5bfad6f86066a8b78f7afdc8e5131dbb39ca37344df15def"}},{"ruleId":"D1","level":"warning","message":{"text":"FnAbi::adjust_for_foreign_abi (cyclomatic 36): FnAbi::adjust_for_foreign_abi has cyclomatic complexity 36 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_target/src/callconv/mod.rs"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"8127b85fbd7bfc271938244e9106b92aa3998328c4ef6c16adf1b4f24e3dd5fb"}},{"ruleId":"D1","level":"warning","message":{"text":"CacheBuilder::fold_item (cyclomatic 36): CacheBuilder::fold_item has cyclomatic complexity 36 (threshold 15). Of this number, 35 points are the body\u0027s own statements and 1 belongs 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/librustdoc/formats/cache.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"17db7579b7c629bb5b289bba832e79f638f0d25b1c6d50b1f1c754c080a69aab"}},{"ruleId":"D1","level":"warning","message":{"text":"SerializedSearchIndex::union (cyclomatic 36): SerializedSearchIndex::union has cyclomatic complexity 36 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 10 belong to one function item inside it that branches. To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/render/search_index.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"e67e4913a9fa447308a8493cb282025d2159c5387b918193f90db2289bcb12ff"}},{"ruleId":"D1","level":"warning","message":{"text":"rustdoc::html::format::fmt_type (cyclomatic 36): rustdoc::html::format::fmt_type has cyclomatic complexity 36 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/format.rs"},"region":{"startLine":1116}}}],"partialFingerprints":{"codehealthFindingId/v1":"99eb4b3bdfac0f65017ef6b58ee328d580538cb8db73426e4e5eb5d896dbf1ee"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::casts::unnecessary_cast::check (cyclomatic 36): clippy_lints::casts::unnecessary_cast::check has cyclomatic complexity 36 (threshold 15). Of this number, 35 points are the body\u0027s own statements and 1 belongs 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/tools/clippy/clippy_lints/src/casts/unnecessary_cast.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"19f05e4884ed3d63b90fd792eb61b7951b96f314302d352ab429b5671d200e27"}},{"ruleId":"D1","level":"warning","message":{"text":"Directive::check (cyclomatic 36): Directive::check 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/tools/jsondocck/src/directive.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"e092abc55d85dddcc855c57ee7c89995509c3cc8535d64131287d77f747bb119"}},{"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/tools/miri/src/shims/windows/fs.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"86930997891f54cf201a838d9c6887ff977f42a7b8e5b5174df8e0dcff7d14a5"}},{"ruleId":"D1","level":"warning","message":{"text":"hir_ide::display::render_const_scalar_from_valtree_inner (cyclomatic 36): hir_ide::display::render_const_scalar_from_valtree_inner has cyclomatic complexity 36 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ide/src/display.rs"},"region":{"startLine":1094}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d297c25d1afc650b43477ca49379300b1e7e575466acc7ecb79343541a18ecd"}},{"ruleId":"D1","level":"warning","message":{"text":"hir_ide::display::write_bounds_like_dyn_trait (cyclomatic 36): hir_ide::display::write_bounds_like_dyn_trait 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/tools/rust-analyzer/crates/hir-ide/src/display.rs"},"region":{"startLine":2099}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6ca76f476b4d069fb47ab0f2eb2d0798bed5429e38f13e0b56b34f1db03d9a3"}},{"ruleId":"D1","level":"warning","message":{"text":"ide_assists::handlers::extract_variable::extract_variable (cyclomatic 36): ide_assists::handlers::extract_variable::extract_variable 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/tools/rust-analyzer/crates/ide-assists/src/handlers/extract_variable.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbb24ce039d89ea75e06593e1f5686f0553a66243983ea7fcb8605202ae49730"}},{"ruleId":"D1","level":"warning","message":{"text":"stringdex.loadDatabase::makeSearchTreeFromBase64::makeBranchesFromBinaryData (cyclomatic 36): stringdex.loadDatabase::makeSearchTreeFromBase64::makeBranchesFromBinaryData 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. This shape REPEATS in the file: 2 other methods here (stringdex.loadDatabase, stringdex.loadDatabase::makeSearchTreeFromBase64) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/stringdex.js"},"region":{"startLine":3045}}}],"partialFingerprints":{"codehealthFindingId/v1":"81c852fd01954751b2cdc3724d3ce6e646431256b4398e1b61b4deee02f45e82"}},{"ruleId":"D1","level":"warning","message":{"text":"Format::translate (cyclomatic 35): Format::translate 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":"compiler/rustc_builtin_macros/src/format_foreign/printf/mod.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a7d0b99db470588317f18734b97f8933c50ffd30a3e02999b5166fa6fa9a643"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_codegen_llvm::attributes::llfn_attrs_from_instance (cyclomatic 35): rustc_codegen_llvm::attributes::llfn_attrs_from_instance has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/attributes.rs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"673a60561648e2ff2bb504d8e23c7b6ab658140e53c4abfd10ef43f091dec14b"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_expand::mbe::macro_rules::is_in_follow (cyclomatic 35): rustc_expand::mbe::macro_rules::is_in_follow 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":"compiler/rustc_expand/src/mbe/macro_rules.rs"},"region":{"startLine":1729}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ee7363a2e45f2d56d60cf4c2a2273f2a6a898969450efb3a787897f4b300f01"}},{"ruleId":"D1","level":"warning","message":{"text":"ProbeContext::consider_probe (cyclomatic 35): ProbeContext::consider_probe has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/method/probe.rs"},"region":{"startLine":2000}}}],"partialFingerprints":{"codehealthFindingId/v1":"62c9a1994cebfde246ece87a287a73e2eac461c7696a89a5e206f8728cbe1961"}},{"ruleId":"D1","level":"warning","message":{"text":"Resolver::unresolved_macro_suggestions (cyclomatic 35): Resolver::unresolved_macro_suggestions has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/diagnostics/impls.rs"},"region":{"startLine":2019}}}],"partialFingerprints":{"codehealthFindingId/v1":"f82777df9272595a4fd394ff4f09ba76516c4e41e67f32b8ced62e310789870d"}},{"ruleId":"D1","level":"warning","message":{"text":"ConstToPat::valtree_to_pat (cyclomatic 35): ConstToPat::valtree_to_pat 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":"compiler/rustc_mir_build/src/thir/pattern/const_to_pat.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"df568817cf77208888612a446e28701224bee90b93970a5782beeee9c6dc7efe"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::parse_fn_front_matter (cyclomatic 35): Parser::parse_fn_front_matter has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/function.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"5389be78c2a26ddcbb11c4d709bf3a62ec9964500eb78045d7f40306b69d86c2"}},{"ruleId":"D1","level":"warning","message":{"text":"RustcPatCtxt::lower_pat (cyclomatic 35): RustcPatCtxt::lower_pat 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":"compiler/rustc_pattern_analysis/src/rustc.rs"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a8c9ef0d3c722c0aac135517fda59e696858b7b870d3b2294e176ff9fe52907"}},{"ruleId":"D1","level":"warning","message":{"text":"TyKind::fmt (cyclomatic 35): TyKind::fmt 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":"compiler/rustc_type_ir/src/ty_kind.rs"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5e963a0fd21782c8621c93d665dd81a99a145f02dee13d482b37d020322fdf0"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_type_ir::relate::structurally_relate_tys (cyclomatic 35): rustc_type_ir::relate::structurally_relate_tys 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":"compiler/rustc_type_ir/src/relate.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"aedd6b463dee6e06743a39ddca752b78721475c2fdaa9c7bc3207d719d9cc4f0"}},{"ruleId":"D1","level":"warning","message":{"text":"LangString::parse (cyclomatic 35): LangString::parse 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/librustdoc/html/markdown.rs"},"region":{"startLine":1264}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b52619d916dbcbfd076f3500d94795fc426ebae9ba0a165e0eed59ed5f3b30f"}},{"ruleId":"D1","level":"warning","message":{"text":"PkgType::is_preview (cyclomatic 35): PkgType::is_preview 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/tools/build-manifest/src/versions.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b51a4a662c5448946f018afcdf7282b151f24e3ee724c06d51a9d330f5e9bd0"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::eta_reduction::check_closure (cyclomatic 35): clippy_lints::eta_reduction::check_closure has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/eta_reduction.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a97db899da60f5c94431a641d2e192947336d081e0cf487f22276f1dee66bfd"}},{"ruleId":"D1","level":"warning","message":{"text":"compiletest::directives::make_test_description (cyclomatic 35): compiletest::directives::make_test_description 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/tools/compiletest/src/directives.rs"},"region":{"startLine":891}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a9ac704ead134460c780ccc3688e1537077e11efade6324c4b194654c3e7370"}},{"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/tools/miri/src/intrinsics/math.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ca78bc41d773ff4daa9b039fda834251d47551f81e2bcf93af319859a9659a0"}},{"ruleId":"D1","level":"warning","message":{"text":"hir_expand::cfg_process::macro_input_callback (cyclomatic 35): hir_expand::cfg_process::macro_input_callback has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-expand/src/cfg_process.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e4ed4dc1ec81d9296c78dc66cf15a44d30d5bf42805b9ad74dbaae356845764"}},{"ruleId":"D1","level":"warning","message":{"text":"initSearch::execQuery::innerRunNameQuery (cyclomatic 35): initSearch::execQuery::innerRunNameQuery has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":3982}}}],"partialFingerprints":{"codehealthFindingId/v1":"acb41126a4097ab2d130676df05e8f4df43a0619f86cd93b0d2f93b3afb5072d"}},{"ruleId":"D1","level":"warning","message":{"text":"LoweringContext::lower_ty (cyclomatic 34): LoweringContext::lower_ty 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":"compiler/rustc_ast_lowering/src/lib.rs"},"region":{"startLine":1534}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b6c734d0c3d16d629220cd75574d90f16322a03ae305635774a8bcb2ba4c03c"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_codegen_ssa::back::write::produce_final_output_artifacts (cyclomatic 34): rustc_codegen_ssa::back::write::produce_final_output_artifacts has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/back/write.rs"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"1976cab26ece15f1229fdf9e88e02d08f5c69c6fe449717b078e7c3f81de084f"}},{"ruleId":"D1","level":"warning","message":{"text":"Checker::visit_terminator (cyclomatic 34): Checker::visit_terminator has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_const_eval/src/check_consts/check.rs"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"30bc42d9f12433517b2de71587cf70a430669a8b8d79f983100e0b711119570b"}},{"ruleId":"D1","level":"warning","message":{"text":"Resolver::report_conflict (cyclomatic 34): Resolver::report_conflict 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":"compiler/rustc_resolve/src/diagnostics/impls.rs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"f400975de5dc67a8c90216106a43bfb44ac4100ca7fa9d457e3cd0382cd1b184"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_mir_transform::lint_tail_expr_drop_order::run_lint (cyclomatic 34): rustc_mir_transform::lint_tail_expr_drop_order::run_lint has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/lint_tail_expr_drop_order.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"37aec960d068ef3d7867833b88e9768551ecf85c0c99d1214e5a9e45b14ad5fa"}},{"ruleId":"D1","level":"warning","message":{"text":"LateResolutionVisitor::make_base_error (cyclomatic 34): LateResolutionVisitor::make_base_error has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/late/diagnostics.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"627feb43c0e30392c46a1c282d1a3ed1a566243c546ff1492bc0e4963860dd32"}},{"ruleId":"D1","level":"warning","message":{"text":"InlineAsmClobberAbi::parse (cyclomatic 34): InlineAsmClobberAbi::parse 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":"compiler/rustc_target/src/asm/mod.rs"},"region":{"startLine":1041}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbeaa64d4843c1396117e163ffc27daae65b3eb507f6f53809334927d9b94596"}},{"ruleId":"D1","level":"warning","message":{"text":"rustdoc::html::render::search_index::simplify_fn_type (cyclomatic 34): rustdoc::html::render::search_index::simplify_fn_type has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/render/search_index.rs"},"region":{"startLine":2119}}}],"partialFingerprints":{"codehealthFindingId/v1":"83bab10d9cd6a50f2b769eab20ca5f3fe414a187af8010f04c659904e11a05be"}},{"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/tools/miri/src/intrinsics/aarch64.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"446650b02426124dceaab8ee5f509753e4c32d97eadb4bd1db87e5cfbcbe420f"}},{"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/tools/miri/src/diagnostics.rs"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d1c45b2988b4f5106048d075b46de7b3e3bb574196e13df906a3c5691ecaae3"}},{"ruleId":"D1","level":"warning","message":{"text":"DiagnosticsCollector::collect_impl (cyclomatic 34): DiagnosticsCollector::collect_impl has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir/src/diagnostics.rs"},"region":{"startLine":953}}}],"partialFingerprints":{"codehealthFindingId/v1":"26555ba40e60d4450e61c76c5d264afff4787e41fd073417e128da70141c5a41"}},{"ruleId":"D1","level":"warning","message":{"text":"ide::inlay_hints::lifetime::hints_ (cyclomatic 34): ide::inlay_hints::lifetime::hints_ 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/tools/rust-analyzer/crates/ide/src/inlay_hints/lifetime.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a9fef3e371c069ebe683f4e722f1a748de2b8faaf5bd355fc3cb9bc06862ad1"}},{"ruleId":"D1","level":"warning","message":{"text":"InlineAssemblyGenerator::generate_asm_wrapper (cyclomatic 33): InlineAssemblyGenerator::generate_asm_wrapper has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/src/inline_asm.rs"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec99676566b11e9466d30acc6ff945a3a84d571a278e90968b59c3ba447ad744"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_codegen_llvm::asm::llvm_fixup_output (cyclomatic 33): rustc_codegen_llvm::asm::llvm_fixup_output has cyclomatic complexity 33 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: rustc_codegen_llvm::asm::dummy_output_type (cyclomatic 69) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/asm.rs"},"region":{"startLine":1374}}}],"partialFingerprints":{"codehealthFindingId/v1":"b52b5351c435310a380298f4875172d017e248d88f388ddf5de09f669166c677"}},{"ruleId":"D1","level":"warning","message":{"text":"ValidityVisitor::visit_value (cyclomatic 33): ValidityVisitor::visit_value has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_const_eval/src/interpret/validity.rs"},"region":{"startLine":1363}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbfa2772f37e0e1eefc1160dd16b0ad97cedc4b8c7ca69e9bb9b14a22b05d8ea"}},{"ruleId":"D1","level":"warning","message":{"text":"InlineAsmCtxt::check_asm (cyclomatic 33): InlineAsmCtxt::check_asm has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/inline_asm.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac2ea6bb167771698efa999cf2fd6ecc35bd29443d513df5ba6ff7cc9d42f179"}},{"ruleId":"D1","level":"warning","message":{"text":"SizeSkeleton::compute_inner (cyclomatic 33): SizeSkeleton::compute_inner has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/ty/layout.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc86646d8161dc2d45910c1202904daafb53db3b020299b689314d476380614e"}},{"ruleId":"D1","level":"warning","message":{"text":"EvalCtxt::assemble_builtin_impl_candidates (cyclomatic 33): EvalCtxt::assemble_builtin_impl_candidates has cyclomatic complexity 33 (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":"compiler/rustc_next_trait_solver/src/solve/assembly/mod.rs"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c10c72527ea25c63f21823a4e35c6253afaa389f579e8e191184dbb2cb71d32"}},{"ruleId":"D1","level":"warning","message":{"text":"std_detect::detect::os::riscv::imply_features (cyclomatic 33): std_detect::detect::os::riscv::imply_features has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std_detect/src/detect/os/riscv.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"00757827e02d61091e234f966081bbc01b35e217cb7b04af6973b50d7318b92f"}},{"ruleId":"D1","level":"warning","message":{"text":"Matches::check_expr (cyclomatic 33): Matches::check_expr has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/matches/mod.rs"},"region":{"startLine":1055}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5bd9333d9f53fa773531a260b65b881a50cb944699f5d78c5793b7a04738478"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::loops::never_loop::never_loop_expr (cyclomatic 33): clippy_lints::loops::never_loop::never_loop_expr has cyclomatic complexity 33 (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/tools/clippy/clippy_lints/src/loops/never_loop.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5e4b4b3b80fedc7296caf8db8336e1c469d3a6fe415f3c1eadcc5a189b59908"}},{"ruleId":"D1","level":"warning","message":{"text":"UnsafeVisitor::walk_expr (cyclomatic 33): UnsafeVisitor::walk_expr has cyclomatic complexity 33 (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/tools/rust-analyzer/crates/hir-ide/src/diagnostics/unsafe_check.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddf7df5380758c5504b3a4dcc7235be16481f09b51ed8aee079886c2cf171020"}},{"ruleId":"D1","level":"warning","message":{"text":"rustfmt_nightly::matches::rewrite_match_body (cyclomatic 33): rustfmt_nightly::matches::rewrite_match_body has cyclomatic complexity 33 (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/tools/rustfmt/src/matches.rs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"a22353fe24234293251232f236630659ff540bf6645bff58733b0fd9e6a55e2d"}},{"ruleId":"D1","level":"warning","message":{"text":"DocSearch.execQuery::unifyFunctionTypeIsMatchCandidate (cyclomatic 33): DocSearch.execQuery::unifyFunctionTypeIsMatchCandidate has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: 5 other methods here (DocSearch.execQuery::buildHrefAndPath, DocSearch.execQuery::formatDisplayTypeSignature::writeFn, DocSearch.execQuery::transformResults, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 6 times rather than 6 independent problems. Splitting this body alone leaves the other 5 exactly as they are. Where these are variations on one operation, the change that clears all 6 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":3565}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce923f903ec7720b0bf538ddc061af9821868ef86de7f046d9b906d494d0da14"}},{"ruleId":"D1","level":"warning","message":{"text":"search.initSearch::unifyFunctionTypeIsMatchCandidate (cyclomatic 33): search.initSearch::unifyFunctionTypeIsMatchCandidate has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: 12 other methods here (search.initSearch, search.initSearch::getItemsBefore, search.initSearch::getNextElem, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 13 times rather than 13 independent problems. Splitting this body alone leaves the other 12 exactly as they are. Where these are variations on one operation, the change that clears all 13 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":3565}}}],"partialFingerprints":{"codehealthFindingId/v1":"6286d81fc51999459ca47c730bafd27f5289d1805a5397657e096d0b6869bf99"}},{"ruleId":"D1","level":"warning","message":{"text":"client.createClient (cyclomatic 33): client.createClient has cyclomatic complexity 33 (threshold 15). Most of this is not in the body itself: 6 of the 33 points are its own statements and the rest belongs to 4 function items inside it that branch (a function literal at line 60, callback, a function literal at line 84, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/editors/code/src/client.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"72242056c09aacb2a43e838399d0e5ade5e53e49679754c88203740795027b0d"}},{"ruleId":"D1","level":"warning","message":{"text":"initSearch::execQuery::unifyFunctionTypeIsMatchCandidate (cyclomatic 33): initSearch::execQuery::unifyFunctionTypeIsMatchCandidate has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":3565}}}],"partialFingerprints":{"codehealthFindingId/v1":"743448d8c0386b8db33244cc30764434183ff6732b0dc4f312c0e7b053602199"}},{"ruleId":"D1","level":"warning","message":{"text":"LinkParser::extend (cyclomatic 32): LinkParser::extend has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_attr_parsing/src/attributes/link_attrs.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"71bca80b73d0d6a69efc7140753c8b70dcfa111305868bbe4523a51f31e66c98"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_codegen_llvm::asm::llvm_fixup_input (cyclomatic 32): rustc_codegen_llvm::asm::llvm_fixup_input has cyclomatic complexity 32 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: rustc_codegen_llvm::asm::dummy_output_type (cyclomatic 69) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/asm.rs"},"region":{"startLine":1171}}}],"partialFingerprints":{"codehealthFindingId/v1":"00c87c14740e40a79e65e4d9d0a715102a829a5619818312fd3962e54a35f705"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_codegen_ssa::back::link::link_binary (cyclomatic 32): rustc_codegen_ssa::back::link::link_binary has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/back/link.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc5a5a97ac1169d395ecde3e60093169bac99d86c28716407c2feabb5c2676df"}},{"ruleId":"D1","level":"warning","message":{"text":"FnCtxt::suggest_compatible_variants (cyclomatic 32): FnCtxt::suggest_compatible_variants has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/fn_ctxt/suggestions.rs"},"region":{"startLine":2621}}}],"partialFingerprints":{"codehealthFindingId/v1":"14ea85eef42ede5bb43220fe1c0524eafd71afad65e9cdd8264d9cef6f3881d2"}},{"ruleId":"D1","level":"warning","message":{"text":"FnCtxt::check_pat_inner (cyclomatic 32): FnCtxt::check_pat_inner has cyclomatic complexity 32 (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":"compiler/rustc_hir_typeck/src/pat.rs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"12187d558d81e112a59d33ab93d10125b8cb9ac2dcb892d63328f3b53d507f38"}},{"ruleId":"D1","level":"warning","message":{"text":"Constructor::is_covered_by (cyclomatic 32): Constructor::is_covered_by has cyclomatic complexity 32 (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":"compiler/rustc_pattern_analysis/src/constructor.rs"},"region":{"startLine":809}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd7b75a0b0b5fdcf66e4205043270410912b186d3c99e8f8c57a575a33ba71f1"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeErrCtxt::report_projection_error (cyclomatic 32): TypeErrCtxt::report_projection_error has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/error_reporting/traits/fulfillment_errors.rs"},"region":{"startLine":1777}}}],"partialFingerprints":{"codehealthFindingId/v1":"43b3f21f574a3f611a1feff5023f256df089b07c8237aa3691788866e46aedc9"}},{"ruleId":"D1","level":"warning","message":{"text":"SolverDelegate::compute_goal_fast_path (cyclomatic 32): SolverDelegate::compute_goal_fast_path has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/solve/delegate.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"036a9495190a4b4daaec8f6e3805b10439c31d0f8baa30f196083a3f0e194551"}},{"ruleId":"D1","level":"warning","message":{"text":"Cargo::configure_linker (cyclomatic 32): Cargo::configure_linker has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/builder/cargo.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2aacc7d5f87a908f107c3269aae345e48e6155d3107f0534128face6dbfbe79"}},{"ruleId":"D1","level":"warning","message":{"text":"rustdoc::clean::inline::build_impl (cyclomatic 32): rustdoc::clean::inline::build_impl has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/clean/inline.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"c23a1eb122f3bac43fb02ff584aa730b189706696426bfb4c0394b95c3688766"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_utils::ast_utils::eq_item_kind (cyclomatic 32): clippy_utils::ast_utils::eq_item_kind has cyclomatic complexity 32 (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/tools/clippy/clippy_utils/src/ast_utils/mod.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"b19bafbc9f47a4a59ed0fd8db41663216bfa9de0e2f401d0a2f3077d5378a4f1"}},{"ruleId":"D1","level":"warning","message":{"text":"opt_dist::execute_pipeline (cyclomatic 32): opt_dist::execute_pipeline has cyclomatic complexity 32 (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/tools/opt-dist/src/main.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"87c83ad0ff191da76df2749b036e3b5033a9cf1c872893a2d9be60cafe26b004"}},{"ruleId":"D1","level":"warning","message":{"text":"ExpressionStore::visit_expr_children (cyclomatic 32): ExpressionStore::visit_expr_children has cyclomatic complexity 32 (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/tools/rust-analyzer/crates/hir-def/src/expr_store.rs"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e8c00488ee8906f74718bff026c80aac89db94698f02989aef0b94cc6b59bfe"}},{"ruleId":"D1","level":"warning","message":{"text":"InferenceContext::infer_pat_inner (cyclomatic 32): InferenceContext::infer_pat_inner has cyclomatic complexity 32 (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/tools/rust-analyzer/crates/hir-ty/src/infer/pat.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"d247ab9ed9d6cac78b9284e2024c9ae9d66f13961c8862ac119cd9fc7e495827"}},{"ruleId":"D1","level":"warning","message":{"text":"ide_assists::handlers::convert_closure_to_fn::convert_closure_to_fn (cyclomatic 32): ide_assists::handlers::convert_closure_to_fn::convert_closure_to_fn has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_closure_to_fn.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"b416e030fd8a8108be92261173cca69fbcb1a0ff54c06eb1ec40a5bf7070d619"}},{"ruleId":"D1","level":"warning","message":{"text":"syntax_bridge::to_parser_input::to_parser_input (cyclomatic 32): syntax_bridge::to_parser_input::to_parser_input has cyclomatic complexity 32 (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/tools/rust-analyzer/crates/syntax-bridge/src/to_parser_input.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa540ecc5bc88bd448ebb59ebabe815551984696968f9cb7c522179087de9dea"}},{"ruleId":"D1","level":"warning","message":{"text":"unicode_table_generator::load_data (cyclomatic 32): unicode_table_generator::load_data has cyclomatic complexity 32 (threshold 15). Of this number, 30 points are the body\u0027s own statements and 2 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/tools/unicode-table-generator/src/main.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"19bead26f314a69e443ecb313d72fff47bc88c2509d8c858cccef30fe6e8bd36"}},{"ruleId":"D1","level":"warning","message":{"text":"DocSearch.buildItemSearchType (cyclomatic 32): DocSearch.buildItemSearchType has cyclomatic complexity 32 (threshold 15). Of this number, 31 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":2032}}}],"partialFingerprints":{"codehealthFindingId/v1":"97ad82b2bfa2e91cab8746dbc3e16eccebba07b5d2203e413b05fa9138685148"}},{"ruleId":"D1","level":"warning","message":{"text":"RoaringBitmap.constructor (cyclomatic 32): RoaringBitmap.constructor has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/stringdex.js"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"728c7d5d5941b5ccdf3f8a135c2fcdf3aa2630504488493c7dd2208785524b85"}},{"ruleId":"D1","level":"warning","message":{"text":"AttributeParser::parse_attribute_list (cyclomatic 31): AttributeParser::parse_attribute_list has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_attr_parsing/src/interface.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f89036af23084d74a326d61263fe5497979b81a5206947e7a522c5412b150da"}},{"ruleId":"D1","level":"warning","message":{"text":"MirBorrowckCtxt::point_at_dyn_trait_in_field_def (cyclomatic 31): MirBorrowckCtxt::point_at_dyn_trait_in_field_def has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/diagnostics/region_errors.rs"},"region":{"startLine":1002}}}],"partialFingerprints":{"codehealthFindingId/v1":"afc8c9fc16f5233f81d0937d6af95d6c1100616fcf2a83f950de9a2f03d2c45b"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_builtin_macros::autodiff::llvm_enzyme::expand_with_mode (cyclomatic 31): rustc_builtin_macros::autodiff::llvm_enzyme::expand_with_mode has cyclomatic complexity 31 (threshold 15). Of this number, 30 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. 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":"compiler/rustc_builtin_macros/src/autodiff.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"31776acb4e0dbcbb39ebec19b04543b8261ff072c3539de174691f055aa6446d"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_codegen_cranelift::value_and_place::assert_assignable (cyclomatic 31): rustc_codegen_cranelift::value_and_place::assert_assignable 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":"compiler/rustc_codegen_cranelift/src/value_and_place.rs"},"region":{"startLine":844}}}],"partialFingerprints":{"codehealthFindingId/v1":"53fbe1e73dc6548a3439a9f14fc21a2535efe8bdf3c7380535347a12553e8bf7"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_codegen_llvm::debuginfo::metadata::build_basic_type_di_node (cyclomatic 31): rustc_codegen_llvm::debuginfo::metadata::build_basic_type_di_node 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":"compiler/rustc_codegen_llvm/src/debuginfo/metadata.rs"},"region":{"startLine":753}}}],"partialFingerprints":{"codehealthFindingId/v1":"08b7c97b70f370354c731ec2acebbf259d1f2707798290217e1893d9c53ea4da"}},{"ruleId":"D1","level":"warning","message":{"text":"FunctionCx::codegen_scalar_binop (cyclomatic 31): FunctionCx::codegen_scalar_binop has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/mir/rvalue.rs"},"region":{"startLine":883}}}],"partialFingerprints":{"codehealthFindingId/v1":"ace3d28c1e4bb82828627cd8e41ac41d51e1cfcb97b4544e86258d17ea0b32e2"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_codegen_ssa::back::symbol_export::exported_generic_symbols_provider_local (cyclomatic 31): rustc_codegen_ssa::back::symbol_export::exported_generic_symbols_provider_local has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/back/symbol_export.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c2c9dad225ca35ad718a5ca937b8878f8aa38c33a736c756e5ddcf8d4bec383"}},{"ruleId":"D1","level":"warning","message":{"text":"ValidityVisitor::check_safe_pointer (cyclomatic 31): ValidityVisitor::check_safe_pointer has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_const_eval/src/interpret/validity.rs"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"96d2d2a6733ea177a7c5b0ccda579293af2dadde93e280414be1374b1444e184"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_const_eval::check_consts::ops::build_error_for_const_call (cyclomatic 31): rustc_const_eval::check_consts::ops::build_error_for_const_call has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_const_eval/src/check_consts/ops.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb97743c54a7c4ff3a61c6f2f6b9d89da10591bbd81d6f4a18055abf1f394db5"}},{"ruleId":"D1","level":"warning","message":{"text":"FnCtxt::report_invalid_callee (cyclomatic 31): FnCtxt::report_invalid_callee has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/callee.rs"},"region":{"startLine":927}}}],"partialFingerprints":{"codehealthFindingId/v1":"a17595e6c471f56537369e4015e2c411528faa6ebcdd737dadf1c2c00f5951e9"}},{"ruleId":"D1","level":"warning","message":{"text":"Resolver::maybe_push_ambiguity (cyclomatic 31): Resolver::maybe_push_ambiguity has cyclomatic complexity 31 (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":"compiler/rustc_resolve/src/ident.rs"},"region":{"startLine":829}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d1c954f0a9e9e2cb53c2441fa0176eb23485cbc9ad1f71416d6cab702f0f2a6"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_mir_transform::canonicalization::canonicalize_binary_operations (cyclomatic 31): rustc_mir_transform::canonicalization::canonicalize_binary_operations has cyclomatic complexity 31 (threshold 15). Most of this is not in the body itself: 10 of the 31 points are its own statements and the rest belongs to 3 function items inside it that branch (needs_swap_operands, projection_rank, needs_swap). 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":"compiler/rustc_mir_transform/src/canonicalization.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b6d3f7b34645cffc95e09d2d4560b325c46b506acf6ea86252253243a400ded"}},{"ruleId":"D1","level":"warning","message":{"text":"DefCollector::build_reduced_graph_for_use_tree (cyclomatic 31): DefCollector::build_reduced_graph_for_use_tree has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/build_reduced_graph.rs"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"32cac614c5d80e3f223741140954c727140d44981eb7a5fbd319a42e3314d4ee"}},{"ruleId":"D1","level":"warning","message":{"text":"LateResolutionVisitor::smart_resolve_path_fragment (cyclomatic 31): LateResolutionVisitor::smart_resolve_path_fragment has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/late.rs"},"region":{"startLine":4872}}}],"partialFingerprints":{"codehealthFindingId/v1":"94b9fd88e1fbac37f7fb701b2f2ef7d1b8c366c5b570c7890eb6f8e5208a8ae8"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_session::config::cfg::default_configuration (cyclomatic 31): rustc_session::config::cfg::default_configuration has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_session/src/config/cfg.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"817d82431df3e53f5917aba661259534f42f1b00c586d3e081afe0892ca13536"}},{"ruleId":"D1","level":"warning","message":{"text":"stdarch_test::assert (cyclomatic 31): stdarch_test::assert 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":"library/stdarch/crates/stdarch-test/src/lib.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d0acf94812d3ac3a6716198bf60f9a97ce093fc6f1ae3f4dc2efcd9671f402c"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::loops::explicit_iter_loop::is_ref_iterable (cyclomatic 31): clippy_lints::loops::explicit_iter_loop::is_ref_iterable has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/loops/explicit_iter_loop.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"411b0991d32ce64c7e872e94871b22d35e640adacabb529cd4f20b2761f82c77"}},{"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/tools/miri/src/intrinsics/x86/avx.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"c68c104c0a320b31677cdd8f2a6331798435d8ae74eacae8512b24a5c596a727"}},{"ruleId":"D1","level":"warning","message":{"text":"DefCollector::resolve_macros (cyclomatic 31): DefCollector::resolve_macros has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/nameres/collector.rs"},"region":{"startLine":1306}}}],"partialFingerprints":{"codehealthFindingId/v1":"1130e87f9f34da2514b8330e2c187b3e56390d48add4776c63d016c1423ec395"}},{"ruleId":"D1","level":"warning","message":{"text":"ide::folding_ranges::folding_ranges (cyclomatic 31): ide::folding_ranges::folding_ranges has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/folding_ranges.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cf1f962342c1a5f90fdff8fcc8b54b5c9d1d43d79b06674521cd645ed2911a8"}},{"ruleId":"D1","level":"warning","message":{"text":"ide::inlay_hints::closing_brace::hints (cyclomatic 31): ide::inlay_hints::closing_brace::hints has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/inlay_hints/closing_brace.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"541e0bf2b24d25abb2c1d9607c02b72c976ca515a49eaefd1addc1cc9be9a181"}},{"ruleId":"D1","level":"warning","message":{"text":"ide_completion::completions::pattern::complete_pattern (cyclomatic 31): ide_completion::completions::pattern::complete_pattern 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/tools/rust-analyzer/crates/ide-completion/src/completions/pattern.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"8da132e798e89e3c89b429c3c0d18b32741238d167310345eb3980757ab949d7"}},{"ruleId":"D1","level":"warning","message":{"text":"project_model::workspace::cargo_to_crate_graph (cyclomatic 31): project_model::workspace::cargo_to_crate_graph has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/project-model/src/workspace.rs"},"region":{"startLine":1264}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5fd138a6a60e5758133b816ca158119288168fa84426cfc466539f479923a73"}},{"ruleId":"D1","level":"warning","message":{"text":"AnalysisStats::run_body_lowering (cyclomatic 31): AnalysisStats::run_body_lowering has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/cli/analysis_stats.rs"},"region":{"startLine":1162}}}],"partialFingerprints":{"codehealthFindingId/v1":"802346ec4e6fb52127ab2b1180d17c3c50abfd5e773d96baa4e1c92adc2326fa"}},{"ruleId":"D1","level":"warning","message":{"text":"syntax_bridge::convert_tokens (cyclomatic 31): syntax_bridge::convert_tokens 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/tools/rust-analyzer/crates/syntax-bridge/src/lib.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"6650a40bc927d667238c8330a34402d763de93735593a6e81e8ec9d4bffa7ad8"}},{"ruleId":"D1","level":"warning","message":{"text":"PrefixTrie.prefixMatches (cyclomatic 31): PrefixTrie.prefixMatches has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/stringdex.js"},"region":{"startLine":2031}}}],"partialFingerprints":{"codehealthFindingId/v1":"08080e4c60b74783b5f423bee0ea438a07b2218fde966e6615f693c02b9aef0f"}},{"ruleId":"D1","level":"warning","message":{"text":"initSearch::buildItemSearchType (cyclomatic 31): initSearch::buildItemSearchType has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":2032}}}],"partialFingerprints":{"codehealthFindingId/v1":"7577b4bc9d081571b7fe3b2de7ea0980e371c623bc2191e86f24de274406004a"}},{"ruleId":"D1","level":"warning","message":{"text":"loadDatabase::prefixMatches (cyclomatic 31): loadDatabase::prefixMatches has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/stringdex.js"},"region":{"startLine":2031}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0811c0b6a957fea6c862922a0b1073778016c19ecf7dbe1e8804274027d98d0"}},{"ruleId":"D1","level":"warning","message":{"text":"DiagCtxtInner::emit_diagnostic (cyclomatic 30): DiagCtxtInner::emit_diagnostic 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":"compiler/rustc_errors/src/lib.rs"},"region":{"startLine":1145}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c576e13b31fd05cd6542271eafedef45d6b3b1bdffab3456a112cb51265c46d"}},{"ruleId":"D1","level":"warning","message":{"text":"FnCtxt::point_at_expr_if_possible (cyclomatic 30): FnCtxt::point_at_expr_if_possible 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":"compiler/rustc_hir_typeck/src/fn_ctxt/adjust_fulfillment_errors.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0f4e4fa0ceae359c553b5a715e4ba881a4906a6e11c94ac1e97dc374933b47a"}},{"ruleId":"D1","level":"warning","message":{"text":"FnCtxt::check_argument_types (cyclomatic 30): FnCtxt::check_argument_types 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":"compiler/rustc_hir_typeck/src/fn_ctxt/checks.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"11126032ab958fd8649f3a3977815b1da6347e8e88d9eb58792fc6f25ee6c7bf"}},{"ruleId":"D1","level":"warning","message":{"text":"Resolver::throw_unresolved_import_error (cyclomatic 30): Resolver::throw_unresolved_import_error 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":"compiler/rustc_resolve/src/diagnostics/impls.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f2f1a628216e1516db98d197d32ef5aca6e3e46c3f9464738168cd01b435d8d"}},{"ruleId":"D1","level":"warning","message":{"text":"Resolver::smart_resolve_macro_path (cyclomatic 30): Resolver::smart_resolve_macro_path 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":"compiler/rustc_resolve/src/macros.rs"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"50d8b6e4899d3b7dbc7cb4073a25f3a778d8257115785bbe72745e197bd2d45d"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_lint::foreign_modules::structurally_same_type_impl (cyclomatic 30): rustc_lint::foreign_modules::structurally_same_type_impl 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":"compiler/rustc_lint/src/foreign_modules.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"e077dece68657276e3e99cad9ab7a81e517d4a9b6941f130ea9a7029beaf4ff2"}},{"ruleId":"D1","level":"warning","message":{"text":"TerminatorKind::fmt_head (cyclomatic 30): TerminatorKind::fmt_head has cyclomatic complexity 30 (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":"compiler/rustc_middle/src/mir/pretty.rs"},"region":{"startLine":990}}}],"partialFingerprints":{"codehealthFindingId/v1":"b845edf96ca33eff0e5f465089013b1ed9194a3bcd6c3cc72a0420b1d2e55d5a"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_middle::lint::emit_lint_base::emit_lint_base_impl (cyclomatic 30): rustc_middle::lint::emit_lint_base::emit_lint_base_impl has cyclomatic complexity 30 (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":"compiler/rustc_middle/src/lint.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b1ef4aa8bb10bbbc47a3626d71382e8f1ea549ccefc93247b91463250e71e10"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeErrCtxt::cmp (cyclomatic 30): TypeErrCtxt::cmp has cyclomatic complexity 30 (threshold 15). Of this number, 27 points are the body\u0027s own statements and 3 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":"compiler/rustc_trait_selection/src/error_reporting/infer/mod.rs"},"region":{"startLine":1129}}}],"partialFingerprints":{"codehealthFindingId/v1":"dba7547b060b8f6f32e6ce13b3f4bb5ad8fd38aa49a7579bf9cd7a0341911b6a"}},{"ruleId":"D1","level":"warning","message":{"text":"libm_macros::validate (cyclomatic 30): libm_macros::validate 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":"library/compiler-builtins/crates/libm-macros/src/lib.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"051da7459504ec4ae1d8fb9d03702eda053d917b2d03adcc7ed2ef5ecd2dfa20"}},{"ruleId":"D1","level":"warning","message":{"text":"stdarch_gen_arm::fn_suffix::make_neon_suffix (cyclomatic 30): stdarch_gen_arm::fn_suffix::make_neon_suffix has cyclomatic complexity 30 (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":"library/stdarch/crates/stdarch-gen-arm/src/fn_suffix.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"67e95e8912ecd33f566ffceec2cb9d71904e3d8a2bd5a15005f0c6919c5ff125"}},{"ruleId":"D1","level":"warning","message":{"text":"bootstrap::core::build_steps::format::format (cyclomatic 30): bootstrap::core::build_steps::format::format 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/bootstrap/src/core/build_steps/format.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"900cb9ede2f2cbfdb32219c288d02c7a2df7dddec1e00f1187a4c742e9310094"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::matches::manual_utils::check_with (cyclomatic 30): clippy_lints::matches::manual_utils::check_with 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/tools/clippy/clippy_lints/src/matches/manual_utils.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"9041e1b1735f0e43a2f8f915608327d0958c33e9f7c62412b2d5ac07ba800600"}},{"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/tools/miri/src/intrinsics/x86/sse42.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c80a5e5f41adb0c1683abb27b0104e8c92cb4b7348edb90dd9dc82dac187423"}},{"ruleId":"D1","level":"warning","message":{"text":"ide::hover::hover_offset (cyclomatic 30): ide::hover::hover_offset 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/tools/rust-analyzer/crates/ide/src/hover.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac7b8bccb4f2c66d0ed77de8af14e3209e41294f0265ae9670c74942e5b739f2"}},{"ruleId":"D1","level":"warning","message":{"text":"ide::moniker::def_to_kind (cyclomatic 30): ide::moniker::def_to_kind has cyclomatic complexity 30 (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/tools/rust-analyzer/crates/ide/src/moniker.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ac5397a666b60ead5a849864a4be6304fe49fa5eebb75dbc0c6c714f1a87632"}},{"ruleId":"D1","level":"warning","message":{"text":"ide::syntax_highlighting::highlight::highlight_name_ref (cyclomatic 30): ide::syntax_highlighting::highlight::highlight_name_ref 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/tools/rust-analyzer/crates/ide/src/syntax_highlighting/highlight.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a22c603a60b2f1de2454d49516fdf85812f86cdd7587e1889175dea8c6f681a"}},{"ruleId":"D1","level":"warning","message":{"text":"ide_assists::handlers::add_missing_match_arms::add_missing_match_arms (cyclomatic 30): ide_assists::handlers::add_missing_match_arms::add_missing_match_arms 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/tools/rust-analyzer/crates/ide-assists/src/handlers/add_missing_match_arms.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a7c27828fab018ee0ead367f9021ab155ee430107de80ad134b31a1e02902be"}},{"ruleId":"D1","level":"warning","message":{"text":"mbe::expander::transcriber::expand_subtree (cyclomatic 30): mbe::expander::transcriber::expand_subtree 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/tools/rust-analyzer/crates/mbe/src/expander/transcriber.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"b74ff8e306c01f8f064a52798a8aef50f6633560a571fa76f2ced6572fc16030"}},{"ruleId":"D1","level":"warning","message":{"text":"GlobalState::handle_task (cyclomatic 30): GlobalState::handle_task has cyclomatic complexity 30 (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/tools/rust-analyzer/crates/rust-analyzer/src/main_loop.rs"},"region":{"startLine":850}}}],"partialFingerprints":{"codehealthFindingId/v1":"55b2e740db8affe30e1162a7d541d51fb68fffb74a9405fbc4b70995c2ffcdcd"}},{"ruleId":"D1","level":"warning","message":{"text":"GetOptsOptions::from_matches (cyclomatic 30): GetOptsOptions::from_matches 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/tools/rustfmt/src/bin/main.rs"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"898863fc097de646e2544b05393bf616c611d17043287c05f0260d56b72dd7f0"}},{"ruleId":"D1","level":"warning","message":{"text":"RustBuild.build_bootstrap_cmd (cyclomatic 30): RustBuild.build_bootstrap_cmd has cyclomatic complexity 30 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/bootstrap.py"},"region":{"startLine":1067}}}],"partialFingerprints":{"codehealthFindingId/v1":"9922b4d53bacf99467ff432dc9fe32d13125e5202f4dc975d54c7db269183d8d"}},{"ruleId":"D1","level":"warning","message":{"text":"htmldocck.check_command (cyclomatic 30): htmldocck.check_command 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/etc/htmldocck.py"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"965a071f9f4e15b62ce183f70ba3dd0eb6df64fa77245103ca5316cabd006448"}},{"ruleId":"D1","level":"warning","message":{"text":"RoaringBitmap.intersection (cyclomatic 30): RoaringBitmap.intersection 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/librustdoc/html/static/js/stringdex.js"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c72210c6b1b428a0a153557290f6b5c434aebb5ac5a941f72a3600c933354ee"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_ast::util::comments::beautify_doc_string (cyclomatic 29): rustc_ast::util::comments::beautify_doc_string has cyclomatic complexity 29 (threshold 15). Most of this is not in the body itself: 10 of the 29 points are its own statements and the rest belongs to 2 function items inside it that branch (get_horizontal_trim, get_vertical_trim). 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":"compiler/rustc_ast/src/util/comments.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ddfbd15c71c61416f172e848681628cc70e8b91255b042b68b07cd331a32ffe"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_ast_pretty::pprust::state::expr::reconstruct_format_args_template_string (cyclomatic 29): rustc_ast_pretty::pprust::state::expr::reconstruct_format_args_template_string 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":"compiler/rustc_ast_pretty/src/pprust/state/expr.rs"},"region":{"startLine":974}}}],"partialFingerprints":{"codehealthFindingId/v1":"98e2a55fe32ffa8093bf17e87f23479c16d85f740aab4b427e4da009083e7077"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_codegen_cranelift::codegen_f16_f128::codegen_cast (cyclomatic 29): rustc_codegen_cranelift::codegen_f16_f128::codegen_cast has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/src/codegen_f16_f128.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"7343a05c2b5ed0b2cb03d36dde08b2f9324298dae05d7fc0c9d6db831cad04d9"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_codegen_gcc::gcc_util::new_context (cyclomatic 29): rustc_codegen_gcc::gcc_util::new_context has cyclomatic complexity 29 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: rustc_codegen_gcc::gcc_util::to_gcc_aarch64_extension (cyclomatic 62) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_gcc/src/gcc_util.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"4119ebf8adf6f86ddb0c7285c9e4a935f550ed91ee5e3ab7ee100ea7bd402498"}},{"ruleId":"D1","level":"warning","message":{"text":"FnCtxt::check_expr_field (cyclomatic 29): FnCtxt::check_expr_field has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: FnCtxt::check_expr_kind (cyclomatic 35) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/expr.rs"},"region":{"startLine":2820}}}],"partialFingerprints":{"codehealthFindingId/v1":"51c1c736d12fa8a74ba79562fe8bb9d28cbabe010978a1c31e203f09b13d185b"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_lint::types::lint_nan (cyclomatic 29): rustc_lint::types::lint_nan has cyclomatic complexity 29 (threshold 15). Most of this is not in the body itself: 5 of the 29 points are its own statements and the rest belongs to 3 function items inside it that branch (eq_ne_suggestion, nan_ty, nan_method_path). 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":"compiler/rustc_lint/src/types.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"08845c25bb5134d3a739ea5c9549181f3f96f7a2f9fbb921679b529b2ebdb7c6"}},{"ruleId":"D1","level":"warning","message":{"text":"SubdiagnosticVariant::from_attr (cyclomatic 29): SubdiagnosticVariant::from_attr 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":"compiler/rustc_macros/src/diagnostics/utils.rs"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecf6f260f0ea7a95e1705f57af96e2e6ef2761671c2039e0f191e58f4360bb62"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_mir_build::thir::pattern::check_match::find_fallback_pattern_typo (cyclomatic 29): rustc_mir_build::thir::pattern::check_match::find_fallback_pattern_typo has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_build/src/thir/pattern/check_match.rs"},"region":{"startLine":1043}}}],"partialFingerprints":{"codehealthFindingId/v1":"c05e86657963e9a7da388e56e7dbfba0d77ad6793ca37e600032d4e5e7609861"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_monomorphize::collector::collect_items_rec (cyclomatic 29): rustc_monomorphize::collector::collect_items_rec has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_monomorphize/src/collector.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"371d9ab6bf8cdd5fcc69b3c2224add134489093633bf25dff9b548d4f41120c8"}},{"ruleId":"D1","level":"warning","message":{"text":"Lexer::cook_lexer_literal (cyclomatic 29): Lexer::cook_lexer_literal has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/lexer/mod.rs"},"region":{"startLine":820}}}],"partialFingerprints":{"codehealthFindingId/v1":"b61d08554e51a73485d112cf9b01294b292400872914fc7afc7299c07831cc0b"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::nonterminal_may_begin_with (cyclomatic 29): Parser::nonterminal_may_begin_with has cyclomatic complexity 29 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. 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":"compiler/rustc_parse/src/parser/nonterminal.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"24e8aefc4f94dded3180789381f069d8c8dca7947d4094980b0e98d23dd4fdec"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::parse_path_segment_with_path_span (cyclomatic 29): Parser::parse_path_segment_with_path_span has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/path.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e2131c785413c16eb91a95a156fda23a82dd2ab2aac66152cefb267e8b550db"}},{"ruleId":"D1","level":"warning","message":{"text":"LateResolutionVisitor::resolve_item (cyclomatic 29): LateResolutionVisitor::resolve_item 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":"compiler/rustc_resolve/src/late.rs"},"region":{"startLine":2981}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7e7340b016026bdba3c538792a3cfb421d6a510fa1f9c5bbdb1ceffb065ebdf"}},{"ruleId":"D1","level":"warning","message":{"text":"FnAbi::apply_attrs_llfn (cyclomatic 29): FnAbi::apply_attrs_llfn has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/abi.rs"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0642eaf135b2172a6a2ca80a9f19235f2378563c3a891a95cce74b130dd31db"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeErrCtxt::try_conversion_context (cyclomatic 29): TypeErrCtxt::try_conversion_context has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/error_reporting/traits/fulfillment_errors.rs"},"region":{"startLine":1273}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e6a725ecd69a8094e5e9e68be518a9b727e9a5db63efecb0120f48a4cf1f384"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_trait_selection::traits::project::assemble_candidates_from_impls (cyclomatic 29): rustc_trait_selection::traits::project::assemble_candidates_from_impls 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":"compiler/rustc_trait_selection/src/traits/project.rs"},"region":{"startLine":976}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9ddd555d360cb26e4d70a8bffeca83f6d375ec0ad4d34e1f0177f578ba96365"}},{"ruleId":"D1","level":"warning","message":{"text":"FlagComputation::add_kind (cyclomatic 29): FlagComputation::add_kind 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":"compiler/rustc_type_ir/src/flags.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0e6b3c589d91bdc99f171d97daac60a94e1549a582703343ffe46cc0e170d7d"}},{"ruleId":"D1","level":"warning","message":{"text":"rustdoc::passes::lint::unescaped_backticks::visit_item (cyclomatic 29): rustdoc::passes::lint::unescaped_backticks::visit_item has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/passes/lint/unescaped_backticks.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a7bc0eecb7f715a9a052408da4ab11a87380eb6e832e1b9d5b0bddc5bf4efc0"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::transmute::transmute_undefined_repr::check (cyclomatic 29): clippy_lints::transmute::transmute_undefined_repr::check has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/transmute/transmute_undefined_repr.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"004eeeac1a54e5b99f366272cc7837ba9364c888a1d89bf0a5d2524a1a0198d0"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::write::literal::check (cyclomatic 29): clippy_lints::write::literal::check has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/write/literal.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b63d7d4f4401cb608293f11d2bb24017260de54ef736eb92989fcdf75a8e299"}},{"ruleId":"D1","level":"warning","message":{"text":"ConstEvalCtxt::expr (cyclomatic 29): ConstEvalCtxt::expr 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/tools/clippy/clippy_utils/src/consts.rs"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d0c57483d08c0dd8f35ecc016e20d3b3961c3b62c5f754a37b1431075bd72d3"}},{"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/tools/miri/src/math.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"69c7a2634be67fb00bbe5a49692506b8d6c9033b55cd184a78f5a1da8881cabb"}},{"ruleId":"D1","level":"warning","message":{"text":"ExprCollector::maybe_collect_expr_as_pat (cyclomatic 29): ExprCollector::maybe_collect_expr_as_pat has cyclomatic complexity 29 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 9 belong to 3 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":"src/tools/rust-analyzer/crates/hir-def/src/expr_store/lower.rs"},"region":{"startLine":2086}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ae0bce86761bf6be2ede9a54f8221f12f840d6d1a7d13857edf49844d3b3e24"}},{"ruleId":"D1","level":"warning","message":{"text":"Path::hir_fmt (cyclomatic 29): Path::hir_fmt has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ide/src/display.rs"},"region":{"startLine":2681}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa4eb29c1f8cff2a3e5099054d7089d7da4e0e011c939a10fe39dc9d9b8a9282"}},{"ruleId":"D1","level":"warning","message":{"text":"ide_db::syntax_helpers::format_string_exprs::parse_format_exprs (cyclomatic 29): ide_db::syntax_helpers::format_string_exprs::parse_format_exprs has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-db/src/syntax_helpers/format_string_exprs.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"faf0fa64f19ed048695aba705ab62464d4c71ffa657a83da8515006765139ae6"}},{"ruleId":"D1","level":"warning","message":{"text":"GlobalState::switch_workspaces (cyclomatic 29): GlobalState::switch_workspaces has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/reload.rs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1a633941898dc26380209b6a66866964b78f2ff4bb9bf76dec4af8fb474df6a"}},{"ruleId":"D1","level":"warning","message":{"text":"tt::storage::encode (cyclomatic 29): tt::storage::encode 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/tools/rust-analyzer/crates/tt/src/storage.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c91b8d15206bf45f64de7da9e09ef7f00a381b2f0fdea56d1644f2f97e95c1b"}},{"ruleId":"D1","level":"warning","message":{"text":"FmtVisitor::visit_item (cyclomatic 29): FmtVisitor::visit_item 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/tools/rustfmt/src/visitor.rs"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc73f936b0fb56791e47ec3ac43d7927f0e8997726e10a21a7dce2b48baa1cae"}},{"ruleId":"D1","level":"warning","message":{"text":"DocSearch.getRow (cyclomatic 29): DocSearch.getRow has cyclomatic complexity 29 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":1930}}}],"partialFingerprints":{"codehealthFindingId/v1":"90bceb4cf2e10ea28f3c89cdd0a5943b6ddc1376fdf782153a9514750db077d2"}},{"ruleId":"D1","level":"warning","message":{"text":"search.initSearch::getItemsBefore (cyclomatic 29): search.initSearch::getItemsBefore has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: 12 other methods here (search.initSearch, search.initSearch::getNextElem, search.initSearch::createQueryElement, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 13 times rather than 13 independent problems. Splitting this body alone leaves the other 12 exactly as they are. Where these are variations on one operation, the change that clears all 13 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fa07c0296cadd96fa38ea2abba9f446a15d1d33257042a2ea3d59c9f5ce188c"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_ast_lowering::format::expand_format_args (cyclomatic 28): rustc_ast_lowering::format::expand_format_args has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ast_lowering/src/format.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c0ae0e8f568f8b2fdb93a5634d7dbaeabe1ead25dc1161da1a9bfb33bc349cf"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_codegen_llvm::asm::llvm_fixup_output_type (cyclomatic 28): rustc_codegen_llvm::asm::llvm_fixup_output_type 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. This is NOT this file\u0027s highest cyclomatic complexity: rustc_codegen_llvm::asm::dummy_output_type (cyclomatic 69) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/asm.rs"},"region":{"startLine":1558}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aa5352417cf4474edb7a249cb7eb74e96512b3ee6e71b00919c1768ea18be6c"}},{"ruleId":"D1","level":"warning","message":{"text":"FunctionCx::codegen_rvalue (cyclomatic 28): FunctionCx::codegen_rvalue has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/mir/rvalue.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"d520c51d48b25cff92d6fcfd0fef3519536a2baff2bb3a3363c000525f370999"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_expand::mbe::macro_rules::compile_declarative_macro (cyclomatic 28): rustc_expand::mbe::macro_rules::compile_declarative_macro has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_expand/src/mbe/macro_rules.rs"},"region":{"startLine":778}}}],"partialFingerprints":{"codehealthFindingId/v1":"366fdc5a0aee62551f86d01acdfbef0dbb8ec88fccc0bf581b6022de7db316f9"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_hir_analysis::check::check::check_transparent (cyclomatic 28): rustc_hir_analysis::check::check::check_transparent has cyclomatic complexity 28 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 9 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":"compiler/rustc_hir_analysis/src/check/check.rs"},"region":{"startLine":1782}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7042e3db989e390b76051e123dbe05cfbc4ec05f2d0431d964153c1dd5dfca7"}},{"ruleId":"D1","level":"warning","message":{"text":"ArgMatrix::find_issue (cyclomatic 28): ArgMatrix::find_issue has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/fn_ctxt/arg_matrix.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c00aa9bf336266b02ffc15e7e440e847d4ad39a473b79aec3cb000db067c96e"}},{"ruleId":"D1","level":"warning","message":{"text":"FnCtxt::annotate_loop_expected_due_to_inference (cyclomatic 28): FnCtxt::annotate_loop_expected_due_to_inference has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/demand.rs"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"771b36a191637b76231512dbf272c4e6d65cb231097550a03ded0b166da279cd"}},{"ruleId":"D1","level":"warning","message":{"text":"Builder::as_rvalue (cyclomatic 28): Builder::as_rvalue 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":"compiler/rustc_mir_build/src/builder/expr/as_rvalue.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3a3a662fce26a8764ab0cc8eb6be8b98fd9782355cbb9db589fd171b7ed84ad"}},{"ruleId":"D1","level":"warning","message":{"text":"Builder::choose_bucket_for_candidate (cyclomatic 28): Builder::choose_bucket_for_candidate has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_build/src/builder/matches/buckets.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bb08848a6440d4c636ab6b0a835de5cb9da3248c23256960cf502af2137bc10"}},{"ruleId":"D1","level":"warning","message":{"text":"MoveDataBuilder::move_path_for (cyclomatic 28): MoveDataBuilder::move_path_for has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_dataflow/src/move_paths/builder.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"588342192e3d1f51a51cad8861ae6c19ff9d3459887ee37b24d70e900fb7634a"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_mir_transform::ref_prop::compute_replacement (cyclomatic 28): rustc_mir_transform::ref_prop::compute_replacement has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/ref_prop.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"67f7b2d4970abea2d41dff72ab80706e43a7ab0ca07019e34747b7decf424ea2"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::parse_struct_fields (cyclomatic 28): Parser::parse_struct_fields has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/expr.rs"},"region":{"startLine":3569}}}],"partialFingerprints":{"codehealthFindingId/v1":"4740cbfa896709afca3a1550b1b146831325974b7b5184cbcad06d55f0db3932"}},{"ruleId":"D1","level":"warning","message":{"text":"LateResolutionVisitor::resolve_elided_lifetimes_in_path (cyclomatic 28): LateResolutionVisitor::resolve_elided_lifetimes_in_path has cyclomatic complexity 28 (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":"compiler/rustc_resolve/src/late.rs"},"region":{"startLine":2331}}}],"partialFingerprints":{"codehealthFindingId/v1":"097546032bae93761a602dd6b29244ab3aca7b14070a1ce231f57c8ccdfff93b"}},{"ruleId":"D1","level":"warning","message":{"text":"LateResolutionVisitor::with_const_and_generic_param_rib (cyclomatic 28): LateResolutionVisitor::with_const_and_generic_param_rib has cyclomatic complexity 28 (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":"compiler/rustc_resolve/src/late.rs"},"region":{"startLine":3267}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd2a7fbd4ee58bf216f8ec68bc340e8b3935f028ddb9a6e3e053d03fcb0df88a"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_resolve::rustdoc::source_span_for_markdown_range_inner (cyclomatic 28): rustc_resolve::rustdoc::source_span_for_markdown_range_inner has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/rustdoc.rs"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdd67e211380e4d623479f8748a153ce653e0b10f14e4aec238ff2984a8f4c78"}},{"ruleId":"D1","level":"warning","message":{"text":"libm::math::lgamma_r::lgamma_r (cyclomatic 28): libm::math::lgamma_r::lgamma_r has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/compiler-builtins/libm/src/math/lgamma_r.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4e5cf7fc1c1ad5e21d48d7b60da976c052d36850304239b7d9f67ca4d50898d"}},{"ruleId":"D1","level":"warning","message":{"text":"RustdocVisitor::maybe_inline_local (cyclomatic 28): RustdocVisitor::maybe_inline_local has cyclomatic complexity 28 (threshold 15). Of this number, 27 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. 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/librustdoc/visit_ast.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"580cfc0639e9bba4c52b80c7a0f6e85fbbef1bb01fe1328cd0a4ba8c0a938f3a"}},{"ruleId":"D1","level":"warning","message":{"text":"rustdoc::main_args (cyclomatic 28): rustdoc::main_args has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/lib.rs"},"region":{"startLine":826}}}],"partialFingerprints":{"codehealthFindingId/v1":"22c40f69dc54933f9dd61309c7f71c1227c2a292247304073ef2da690b53b57e"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::loops::needless_range_loop::check (cyclomatic 28): clippy_lints::loops::needless_range_loop::check has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/loops/needless_range_loop.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"394d289e27c051980599ced0c477bac054e19b7cde4a64cbf746362585444cd0"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::matches::match_wild_enum::check (cyclomatic 28): clippy_lints::matches::match_wild_enum::check 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/tools/clippy/clippy_lints/src/matches/match_wild_enum.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5977543a3bd8a30f47274f4adfbabe4fb0ba2dc66746bb21e3fc7bc521d69a3"}},{"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":"src/tools/miri/cargo-miri/src/phases.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"35f85b62729ea9cd5042704ebe2559b15ed3e7dacaeaf0ee198d4f72c8b8501f"}},{"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/tools/miri/src/intrinsics/x86/avx2.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb4511c591749226a525a98b112dfea1148ad208dfc2dd185eb937eb67acd8be"}},{"ruleId":"D1","level":"warning","message":{"text":"ide_assists::handlers::unwrap_return_type::unwrap_return_type (cyclomatic 28): ide_assists::handlers::unwrap_return_type::unwrap_return_type has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/unwrap_return_type.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c9b44d6dbd0b4e3741b571b1dfce983bf744d8797fb2b281a578dfa79c7b40e"}},{"ruleId":"D1","level":"warning","message":{"text":"Definition::label (cyclomatic 28): Definition::label 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/tools/rust-analyzer/crates/ide-db/src/defs.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a1f48ba2b8403fa8d97fd6e908290d70d4643a1c330ffa25681f93fbd5266fc"}},{"ruleId":"D1","level":"warning","message":{"text":"Reader::read_tokenstream (cyclomatic 28): Reader::read_tokenstream 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/tools/rust-analyzer/crates/proc-macro-api/src/legacy_protocol/msg/flat.rs"},"region":{"startLine":871}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf5a81a74ce07673ae506719fa1e28d6031c24376bf4fb814e2885eb43d8b82c"}},{"ruleId":"D1","level":"warning","message":{"text":"AnalysisStats::run_term_search (cyclomatic 28): AnalysisStats::run_term_search has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/cli/analysis_stats.rs"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"83b073139bf1d9829419f3388540bcd3f513cecb5e95fbf3ed466440957b5ae6"}},{"ruleId":"D1","level":"warning","message":{"text":"rust_analyzer::handlers::notification::run_flycheck (cyclomatic 28): rust_analyzer::handlers::notification::run_flycheck has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/handlers/notification.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfb789718c32bff1480dd9430e73acfe206f13e7e8a781114ce3bdc9af2166fc"}},{"ruleId":"D1","level":"warning","message":{"text":"rustfmt_nightly::types::join_bounds_inner (cyclomatic 28): rustfmt_nightly::types::join_bounds_inner 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":"src/tools/rustfmt/src/types.rs"},"region":{"startLine":1166}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dcb683f30f399fec22fbc4f498204c2ed58a19397c894dadc2e5dbf24cc0152"}},{"ruleId":"D1","level":"warning","message":{"text":"configure.apply_args (cyclomatic 28): configure.apply_args has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/configure.py"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e5cda44cafee903d4d5e9091efb87fc456bbd08447390e575721206f985c221"}},{"ruleId":"D1","level":"warning","message":{"text":"check_lldb.var_matches (cyclomatic 28): check_lldb.var_matches has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/etc/debugger_tester/lldb/check_lldb.py"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"912f27fe5fd4ffff9c810bcdbbf361e9a9e952c38d898325c8c79d5b92f11638"}},{"ruleId":"D1","level":"warning","message":{"text":"RoaringBitmap.union (cyclomatic 28): RoaringBitmap.union has cyclomatic complexity 28 (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/librustdoc/html/static/js/stringdex.js"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e97d82f43720927f8596323bb22a450d41d46e08f464fa7abc47a1ec1b7aac6"}},{"ruleId":"D1","level":"warning","message":{"text":"AttributeParser::check_attribute_stability (cyclomatic 27): AttributeParser::check_attribute_stability has cyclomatic complexity 27 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_attr_parsing/src/stability.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"3615e70b4efb6934f5f43d760e81d70046eb070d4284f1dbc5f8de191e3b6043"}},{"ruleId":"D1","level":"warning","message":{"text":"Context::manage_cond_expr (cyclomatic 27): Context::manage_cond_expr has cyclomatic complexity 27 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_builtin_macros/src/assert/context.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"94f735774b0423f5390aa28017f3d42f3b48c7a8bc1bfc201b0d0f7883ab2c9a"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_codegen_llvm::back::write::llvm_optimize (cyclomatic 27): rustc_codegen_llvm::back::write::llvm_optimize has cyclomatic complexity 27 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 5 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":"compiler/rustc_codegen_llvm/src/back/write.rs"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a9cc35fa2fb04d5c9f16b935b9903b883217d4a39fafdb0a9e86cf1e6309228"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_codegen_ssa::back::link::link_staticlib (cyclomatic 27): rustc_codegen_ssa::back::link::link_staticlib 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":"compiler/rustc_codegen_ssa/src/back/link.rs"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"31747edd0aae7e089330e483467550c5cb380203a24abce4d9825fc2c7ce07ed"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_codegen_ssa::back::link::add_native_libs_from_crate (cyclomatic 27): rustc_codegen_ssa::back::link::add_native_libs_from_crate 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":"compiler/rustc_codegen_ssa/src/back/link.rs"},"region":{"startLine":3404}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac523008973abe73f9aaf7e0950387633ca4f24160de1c37188c268fb04f68fb"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_codegen_ssa::back::linker::get_linker (cyclomatic 27): rustc_codegen_ssa::back::linker::get_linker has cyclomatic complexity 27 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/back/linker.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"6db5e2e190215f09d9577fc71dad4401a106c734daa4423e333eb4437b033fcf"}},{"ruleId":"D1","level":"warning","message":{"text":"Checker::visit_rvalue (cyclomatic 27): Checker::visit_rvalue has cyclomatic complexity 27 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_const_eval/src/check_consts/check.rs"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ec33bcfb502a4b7a40928b084446535bef951e39cc15b5f11766f0153051521"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_hir_analysis::check::check::check_impl_items_against_trait (cyclomatic 27): rustc_hir_analysis::check::check::check_impl_items_against_trait 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":"compiler/rustc_hir_analysis/src/check/check.rs"},"region":{"startLine":1300}}}],"partialFingerprints":{"codehealthFindingId/v1":"75452f44bd55bb0bf26b4d5de7aaf55408237dfde3fa8579daf8681389713fa7"}},{"ruleId":"D1","level":"warning","message":{"text":"State::print_item (cyclomatic 27): State::print_item has cyclomatic complexity 27 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: State::print_node (cyclomatic 39) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_pretty/src/lib.rs"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"a64cad4fb14bb2c622f79673a3fadfc6ec1171911a72da12a6a1010365339012"}},{"ruleId":"D1","level":"warning","message":{"text":"FnCtxt::note_type_is_not_clone (cyclomatic 27): FnCtxt::note_type_is_not_clone 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":"compiler/rustc_hir_typeck/src/fn_ctxt/suggestions.rs"},"region":{"startLine":2036}}}],"partialFingerprints":{"codehealthFindingId/v1":"04c91149c9c7cccb770e6aef005e1d79ab9d7c01073d55befac37fcdc4622f4e"}},{"ruleId":"D1","level":"warning","message":{"text":"InlineAsmCtxt::check_asm_operand_type (cyclomatic 27): InlineAsmCtxt::check_asm_operand_type has cyclomatic complexity 27 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 1 belongs 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":"compiler/rustc_hir_typeck/src/inline_asm.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"352975f7a4861f70eb25658c2f68b918f838363d162574f96b7f96222641e60f"}},{"ruleId":"D1","level":"warning","message":{"text":"LintLevelsBuilder::add_hir_inner (cyclomatic 27): LintLevelsBuilder::add_hir_inner 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":"compiler/rustc_lint/src/levels.rs"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cf3a8fe87422ad9a10faccc44c60aebec6d0d31204dc60b26dce0b6a51baf08"}},{"ruleId":"D1","level":"warning","message":{"text":"UnusedDelimLint::is_expr_delims_necessary (cyclomatic 27): UnusedDelimLint::is_expr_delims_necessary has cyclomatic complexity 27 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_lint/src/unused.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"43c00fd46ae1e3d3e65c7fc49bd7fe247a1589f90983c5bd911241d31fd64b5e"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_middle::ty::typetree::typetree_from_ty_impl_inner (cyclomatic 27): rustc_middle::ty::typetree::typetree_from_ty_impl_inner 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":"compiler/rustc_middle/src/ty/typetree.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"8576a91f55aab909093263ed9441bb7f10cd5fc40a38cdd3b2171db55858faa2"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_mir_build::thir::constant::lit_to_const (cyclomatic 27): rustc_mir_build::thir::constant::lit_to_const has cyclomatic complexity 27 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_build/src/thir/constant.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"1484a4deb035fa93199aafc8ecf6fdadf3823a0251e2e0ee22e145062d5dbff3"}},{"ruleId":"D1","level":"warning","message":{"text":"AssignmentResult::report_fully_unused (cyclomatic 27): AssignmentResult::report_fully_unused 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":"compiler/rustc_mir_transform/src/liveness.rs"},"region":{"startLine":961}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a53be4dff879b9612f9296f66b73d9b08d67568e267b057841625aafb2ef6f0"}},{"ruleId":"D1","level":"warning","message":{"text":"Validator::validate_rvalue (cyclomatic 27): Validator::validate_rvalue 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":"compiler/rustc_mir_transform/src/promote_consts.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"c79a9e99d8393147dc188d9542221a72372246587c01d6c72ef127133896ad47"}},{"ruleId":"D1","level":"warning","message":{"text":"LateResolutionVisitor::suggest_using_enum_variant (cyclomatic 27): LateResolutionVisitor::suggest_using_enum_variant 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":"compiler/rustc_resolve/src/late/diagnostics.rs"},"region":{"startLine":3603}}}],"partialFingerprints":{"codehealthFindingId/v1":"5203643a5c02a8b35baa9988d9ba289a272fa93470623912a0f5889a709f31c9"}},{"ruleId":"D1","level":"warning","message":{"text":"AutoTraitFinder::evaluate_nested_obligations (cyclomatic 27): AutoTraitFinder::evaluate_nested_obligations 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":"compiler/rustc_trait_selection/src/traits/auto_trait.rs"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"dab8fa6ac0fdf51a44578f26c48eac2fb490196588aefa372aa377bda73f1a2b"}},{"ruleId":"D1","level":"warning","message":{"text":"compiler_builtins::float::div::div (cyclomatic 27): compiler_builtins::float::div::div 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":"library/compiler-builtins/compiler-builtins/src/float/div.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"22aff2c24d9cbff3f7cf58e099731fed1af01f8958ec7b5db747c76798eaca5a"}},{"ruleId":"D1","level":"warning","message":{"text":"libm::math::lgammaf_r::lgammaf_r (cyclomatic 27): libm::math::lgammaf_r::lgammaf_r 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":"library/compiler-builtins/libm/src/math/lgammaf_r.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"42dfdac5068861293ef0ee63759438d0cf9349967cb8425fcb14003376e8e18a"}},{"ruleId":"D1","level":"warning","message":{"text":"X86IntrinsicType::from_param (cyclomatic 27): X86IntrinsicType::from_param 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":"library/stdarch/crates/intrinsic-test/src/x86/types.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"004d71a40da3d4483cd85eaab34c2bbd4f528cdf9e8d9353f1335a0252f13ad0"}},{"ruleId":"D1","level":"warning","message":{"text":"stdarch_gen_hexagon::hvx::parse_header (cyclomatic 27): stdarch_gen_hexagon::hvx::parse_header 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":"library/stdarch/crates/stdarch-gen-hexagon/src/hvx.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"11df1b3caacec94dd22ceb38f3a61b1bfc451200f3937692d2a1a200dd45aa18"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolBuild::run (cyclomatic 27): ToolBuild::run has cyclomatic complexity 27 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/build_steps/tool.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d5b5333b40e27fd4090b7a1fd50941d46cf834fe2738bdf7295441f114e1d3b"}},{"ruleId":"D1","level":"warning","message":{"text":"rustdoc::html::render::print_item::compare_names (cyclomatic 27): rustdoc::html::render::print_item::compare_names has cyclomatic complexity 27 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/render/print_item.rs"},"region":{"startLine":2226}}}],"partialFingerprints":{"codehealthFindingId/v1":"61e881ea1948b44d312b5c6ce9551a7c909036159b8fa0f165bfebb379c46bcb"}},{"ruleId":"D1","level":"warning","message":{"text":"IndexingSlicing::check_expr (cyclomatic 27): IndexingSlicing::check_expr 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/tools/clippy/clippy_lints/src/indexing_slicing.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"e687d3b415fb0a781326ca441331afe780f9f123b1e9b2e166c6523098dd675c"}},{"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/tools/miri/src/intrinsics/x86/sse42.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"de81a99e2a27bb0be4f202d4de2583daaa435286b3892f9a8bdcc73f86d320bc"}},{"ruleId":"D1","level":"warning","message":{"text":"Expr::gen_source_code (cyclomatic 27): Expr::gen_source_code has cyclomatic complexity 27 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir/src/term_search/expr.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"620519e3576f8ad388fe7ec85d10668941fbbd4dbc331cc18ca77d8b217c8545"}},{"ruleId":"D1","level":"warning","message":{"text":"ExprCollector::collect_format_args_impl (cyclomatic 27): ExprCollector::collect_format_args_impl 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/tools/rust-analyzer/crates/hir-def/src/expr_store/lower/format_args.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e7689a933b4fbfd50b39192d5bcf2361106121ceb379c23652825b72ed6d34b"}},{"ruleId":"D1","level":"warning","message":{"text":"Printer::print_path (cyclomatic 27): Printer::print_path has cyclomatic complexity 27 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/expr_store/pretty.rs"},"region":{"startLine":1111}}}],"partialFingerprints":{"codehealthFindingId/v1":"64b32b693c39d2722eede5af90525e5e4a7ee9c0bb8b03d02ceea6f504c0769a"}},{"ruleId":"D1","level":"warning","message":{"text":"ItemScope::push_res_with_import (cyclomatic 27): ItemScope::push_res_with_import 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/tools/rust-analyzer/crates/hir-def/src/item_scope.rs"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"969ed3f497f80cac5447b7afb0829e6b8365003ad7826ef357e09871dc69ba54"}},{"ruleId":"D1","level":"warning","message":{"text":"hir_def::attrs::parse_repr_tt (cyclomatic 27): hir_def::attrs::parse_repr_tt 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/tools/rust-analyzer/crates/hir-def/src/attrs.rs"},"region":{"startLine":1272}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f2f92cab541f29a53f2b179992e26d75279730fc5e4d15cecb6789d4761d8ed"}},{"ruleId":"D1","level":"warning","message":{"text":"InferenceContext::try_find_coercion_lub (cyclomatic 27): InferenceContext::try_find_coercion_lub has cyclomatic complexity 27 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/infer/coerce.rs"},"region":{"startLine":926}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad0ebae8d7678f72e8dffe76089e29c655daf192b9159a7d49b34cacb65573f0"}},{"ruleId":"D1","level":"warning","message":{"text":"TyLoweringContext::lower_dyn_trait (cyclomatic 27): TyLoweringContext::lower_dyn_trait 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/tools/rust-analyzer/crates/hir-ty/src/lower.rs"},"region":{"startLine":1034}}}],"partialFingerprints":{"codehealthFindingId/v1":"2110ab8d428be7c351ec96b366ce8c470a1a148e84a67477bfa9df33fcced323"}},{"ruleId":"D1","level":"warning","message":{"text":"Evaluator::exec_extern_c (cyclomatic 27): Evaluator::exec_extern_c 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/tools/rust-analyzer/crates/hir-ty/src/mir/eval/shim.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec53ea0ab6d521e827c56b3dce079fbba36c5604a12e033c4b3a78fc83fd2791"}},{"ruleId":"D1","level":"warning","message":{"text":"Module::process_def_in_sel (cyclomatic 27): Module::process_def_in_sel 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/tools/rust-analyzer/crates/ide-assists/src/handlers/extract_module.rs"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fd4238b16868a4935f879d96b775021dac83bde2edfe561e440a4089c7ba0ee"}},{"ruleId":"D1","level":"warning","message":{"text":"CompletionRelevance::score (cyclomatic 27): CompletionRelevance::score has cyclomatic complexity 27 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: CompletionItemKind::tag (cyclomatic 37) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-completion/src/item.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ef430627fc3c7fb984d4e8ae350c1cf21bb6717e9c59637534f24729a036cc5"}},{"ruleId":"D1","level":"warning","message":{"text":"ide_completion::context::analysis::expand (cyclomatic 27): ide_completion::context::analysis::expand 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/tools/rust-analyzer/crates/ide-completion/src/context/analysis.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6f019cbfca1532d3733ec2864124476b850c891b5e0ec3780177fb5e881c986"}},{"ruleId":"D1","level":"warning","message":{"text":"Definition::range_for_rename (cyclomatic 27): Definition::range_for_rename has cyclomatic complexity 27 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-db/src/rename.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0c2a63c68ec79ebc316bed1987b24e180be762508160d9f6a06cbb1b8f936a3"}},{"ruleId":"D1","level":"warning","message":{"text":"ide_db::prime_caches::parallel_prime_caches (cyclomatic 27): ide_db::prime_caches::parallel_prime_caches has cyclomatic complexity 27 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-db/src/prime_caches.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ade2846901b22f7b8aa47f4765d987d3c5cabcf6d900a7e40ff6ac29f067eac"}},{"ruleId":"D1","level":"warning","message":{"text":"DocSearch.execQuery::formatDisplayTypeSignature::writeFn (cyclomatic 27): DocSearch.execQuery::formatDisplayTypeSignature::writeFn 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. This shape REPEATS in the file: 5 other methods here (DocSearch.execQuery::buildHrefAndPath, DocSearch.execQuery::transformResults, DocSearch.execQuery::unifyFunctionTypes, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 6 times rather than 6 independent problems. Splitting this body alone leaves the other 5 exactly as they are. Where these are variations on one operation, the change that clears all 6 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":2538}}}],"partialFingerprints":{"codehealthFindingId/v1":"39586a0021c3405e0e211bc6d7912caeac28af10c254c57a9a702564d32a683a"}},{"ruleId":"D1","level":"warning","message":{"text":"search.initSearch::formatDisplayTypeSignature::writeFn (cyclomatic 27): search.initSearch::formatDisplayTypeSignature::writeFn 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. This shape REPEATS in the file: 12 other methods here (search.initSearch, search.initSearch::getItemsBefore, search.initSearch::getNextElem, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 13 times rather than 13 independent problems. Splitting this body alone leaves the other 12 exactly as they are. Where these are variations on one operation, the change that clears all 13 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":2538}}}],"partialFingerprints":{"codehealthFindingId/v1":"93c0c9d704044bb34a70d73b649d02c26ce4ae9a9343e26167e2ef359d7e6bd4"}},{"ruleId":"D1","level":"warning","message":{"text":"initSearch::execQuery::formatDisplayTypeSignature::writeFn (cyclomatic 27): initSearch::execQuery::formatDisplayTypeSignature::writeFn 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/librustdoc/html/static/js/search.js"},"region":{"startLine":2538}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9e495e79d239e4fe294df76fd1e36bc4f638d9e1f38d510f8549e0bca08c745"}},{"ruleId":"D1","level":"warning","message":{"text":"AstValidator::visit_assoc_item (cyclomatic 26): AstValidator::visit_assoc_item has cyclomatic complexity 26 (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":"compiler/rustc_ast_passes/src/ast_validation.rs"},"region":{"startLine":2059}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8abe8367a12de358d91b36e0614afff0ad6d4ace9de7af4705d05a52fe2b9f8"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeChecker::check_iscleanup (cyclomatic 26): TypeChecker::check_iscleanup has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/type_check/mod.rs"},"region":{"startLine":2081}}}],"partialFingerprints":{"codehealthFindingId/v1":"39835be7f1cfad4277533538e4a6948e06942971a3dc9f44bf2495f2dba5c3ec"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_borrowck::places_conflict::place_projection_conflict (cyclomatic 26): rustc_borrowck::places_conflict::place_projection_conflict has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/places_conflict.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"49ee6564a7a927618dfa11370a3c9186a2aba2067af64d704fd387c548ed0414"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_builtin_macros::format_foreign::printf::parse_next_substitution (cyclomatic 26): rustc_builtin_macros::format_foreign::printf::parse_next_substitution has cyclomatic complexity 26 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_builtin_macros/src/format_foreign/printf/mod.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"493d437d29c9bdf110947bd22839d68090d153cf195e0a8483bfb032c06956c3"}},{"ruleId":"D1","level":"warning","message":{"text":"ConfigInfo::setup (cyclomatic 26): ConfigInfo::setup has cyclomatic complexity 26 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_gcc/build_system/src/config.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb736833f27e687998e6c7cb69d073100aab7162ae59ed743eb6c223f737baec"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_codegen_cranelift::cast::clif_int_or_float_cast (cyclomatic 26): rustc_codegen_cranelift::cast::clif_int_or_float_cast has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/src/cast.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"5089b1a43ca1e1628880df939ca507d62f6720ced6b800da40f7980ba2cb7b34"}},{"ruleId":"D1","level":"warning","message":{"text":"FunctionCx::debug_introduce_local (cyclomatic 26): FunctionCx::debug_introduce_local has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/mir/debuginfo.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"762e57455f1e838a27e12197fb4f65f22c707dd3c7978e59f760f4dfe41dd138"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_codegen_ssa::back::link::report_linker_output (cyclomatic 26): rustc_codegen_ssa::back::link::report_linker_output has cyclomatic complexity 26 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 5 belong to 2 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/back/link.rs"},"region":{"startLine":1061}}}],"partialFingerprints":{"codehealthFindingId/v1":"2efb4f08dec2d38fbf0128b2be3303c1342931e9503513c9a448e8f780507cdf"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_codegen_ssa::mir::arg_local_refs (cyclomatic 26): rustc_codegen_ssa::mir::arg_local_refs has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/mir/mod.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"d765cdc04be7580c79b6f8e302c9a275a3d49114075c3bbebce5822d35d9fb11"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_driver_impl::compiler_entrypoint (cyclomatic 26): rustc_driver_impl::compiler_entrypoint has cyclomatic complexity 26 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_driver_impl/src/lib.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9c96cbf6f73e7ad47c8cee8ebf4d00e078ff8859a9dfa8b697d4631a35a4984"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_hir_analysis::hir_ty_lowering::errors::generics_args_err_extend (cyclomatic 26): rustc_hir_analysis::hir_ty_lowering::errors::generics_args_err_extend has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/hir_ty_lowering/errors.rs"},"region":{"startLine":1815}}}],"partialFingerprints":{"codehealthFindingId/v1":"09e671523b0d29be865ee3004f6288e2ba8a72aa5ecfe5857496a41b9a358fbf"}},{"ruleId":"D1","level":"warning","message":{"text":"CastCheck::do_check (cyclomatic 26): CastCheck::do_check has cyclomatic complexity 26 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/cast.rs"},"region":{"startLine":933}}}],"partialFingerprints":{"codehealthFindingId/v1":"766716ba5fa44b25e1639ed827611e7c51ef16d46f9eec9897139ae6d0fba381"}},{"ruleId":"D1","level":"warning","message":{"text":"FnCtxt::blame_specific_part_of_expr_corresponding_to_generic_param (cyclomatic 26): FnCtxt::blame_specific_part_of_expr_corresponding_to_generic_param has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/fn_ctxt/adjust_fulfillment_errors.rs"},"region":{"startLine":875}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e241a6295c54fe62c707c3aba07d8ab32b4ce50f650966186f3d27fcdd7e25b"}},{"ruleId":"D1","level":"warning","message":{"text":"FnCtxt::suggest_unwrapping_inner_self (cyclomatic 26): FnCtxt::suggest_unwrapping_inner_self has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/method/suggest.rs"},"region":{"startLine":3272}}}],"partialFingerprints":{"codehealthFindingId/v1":"db7c2ba641bb896d48d4dd05afaa1111710189262ca80251d06482c77de1a644"}},{"ruleId":"D1","level":"warning","message":{"text":"UnusedParens::check_ty (cyclomatic 26): UnusedParens::check_ty has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_lint/src/unused.rs"},"region":{"startLine":975}}}],"partialFingerprints":{"codehealthFindingId/v1":"228eac04733aeeb8120424395690f0cf82b6a138ebe45027f3ce26d4d69bfc2e"}},{"ruleId":"D1","level":"warning","message":{"text":"Ty::ty_and_layout_field::field_ty_or_layout (cyclomatic 26): Ty::ty_and_layout_field::field_ty_or_layout has cyclomatic complexity 26 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/ty/layout.rs"},"region":{"startLine":858}}}],"partialFingerprints":{"codehealthFindingId/v1":"1da0cfe378fb49b122141f2e8618344853b0f108a0eb101ef5fb2378680830db"}},{"ruleId":"D1","level":"warning","message":{"text":"PatCtxt::lower_pattern_unadjusted (cyclomatic 26): PatCtxt::lower_pattern_unadjusted has cyclomatic complexity 26 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_build/src/thir/pattern/mod.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"e282520137dca90b772c7612ed72eda1235f943c57711533f85721d7ec5fcc15"}},{"ruleId":"D1","level":"warning","message":{"text":"ThirPrinter::print_pat_kind (cyclomatic 26): ThirPrinter::print_pat_kind has cyclomatic complexity 26 (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":"compiler/rustc_mir_build/src/thir/print.rs"},"region":{"startLine":729}}}],"partialFingerprints":{"codehealthFindingId/v1":"e784f9d5a8d112aa4cf04e74c666570ae54b781d72f843c470c562ea6d10f1c3"}},{"ruleId":"D1","level":"warning","message":{"text":"AbortUnwindingCalls::run_pass (cyclomatic 26): AbortUnwindingCalls::run_pass has cyclomatic complexity 26 (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":"compiler/rustc_mir_transform/src/abort_unwinding_calls.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"3045e99b5a5d9c440ea87de9b1e87af2343b37d47eee59bf81ba78797a36104b"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::parse_pat_fields (cyclomatic 26): Parser::parse_pat_fields has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/pat.rs"},"region":{"startLine":1661}}}],"partialFingerprints":{"codehealthFindingId/v1":"638b2f37b553275a4ce63caf220d6f8c0f40114b203ec88878e7e29c94c71119"}},{"ruleId":"D1","level":"warning","message":{"text":"FnAbi::adjust_for_rust_abi (cyclomatic 26): FnAbi::adjust_for_rust_abi has cyclomatic complexity 26 (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":"compiler/rustc_target/src/callconv/mod.rs"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"be4871577aa2bdccf7776b487acdf155fdfb0177665efaf6126f5f9816fd6ec6"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_target::callconv::x86_64::classify_arg (cyclomatic 26): rustc_target::callconv::x86_64::classify_arg has cyclomatic complexity 26 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 12 belong to one function item inside it that branches. 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":"compiler/rustc_target/src/callconv/x86_64.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"52028d3e2899fae1d3108198046dd29781419130563b0f97efc029e73a728410"}},{"ruleId":"D1","level":"warning","message":{"text":"Command::posix_spawn (cyclomatic 26): Command::posix_spawn has cyclomatic complexity 26 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 4 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. This is NOT this file\u0027s highest cyclomatic complexity: std::sys::process::unix::unix::signal_string (cyclomatic 38) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/process/unix/unix.rs"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6c0e9c197177112bd607410fb3762ca502ed8945df7a5e3c4d1e04d346a387f"}},{"ruleId":"D1","level":"warning","message":{"text":"stdarch_verify::functions (cyclomatic 26): stdarch_verify::functions has cyclomatic complexity 26 (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. This is NOT this file\u0027s highest cyclomatic complexity: stdarch_verify::to_type (cyclomatic 225) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/stdarch-verify/src/lib.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cd9ae793ed37a93e189eacd0e9aff39f89bf78fcb1567656d94a3f8a4710383"}},{"ruleId":"D1","level":"warning","message":{"text":"Stripper::fold_item (cyclomatic 26): Stripper::fold_item has cyclomatic complexity 26 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/passes/stripper.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"6577ccfbfcef1f712e54f137f2ece24d4c71f18c04bfb695397f979c3b8e73e5"}},{"ruleId":"D1","level":"warning","message":{"text":"rustdoc::clean::clean_middle_assoc_item (cyclomatic 26): rustdoc::clean::clean_middle_assoc_item has cyclomatic complexity 26 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. 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/librustdoc/clean/mod.rs"},"region":{"startLine":1386}}}],"partialFingerprints":{"codehealthFindingId/v1":"201ec47107d4239a1e94ff5f3998cb4163c59c80517835e2610b2580da3b8840"}},{"ruleId":"D1","level":"warning","message":{"text":"rustdoc::html::render::render_impl::doc_impl_item (cyclomatic 26): rustdoc::html::render::render_impl::doc_impl_item has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (rustdoc::html::render::render_impl) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/render/mod.rs"},"region":{"startLine":1914}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eea66b56b1381369d9a8d3fd8b910aa4679cfbab4c9676f051277717528b52b"}},{"ruleId":"D1","level":"warning","message":{"text":"rustdoc::html::render::render_impl (cyclomatic 26): rustdoc::html::render::render_impl has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (rustdoc::html::render::render_impl::doc_impl_item) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/render/mod.rs"},"region":{"startLine":1893}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d4b5adbf6b00a5bdaa937432a89d0f1b548de4210afed9c1764ae93e8d04372"}},{"ruleId":"D1","level":"warning","message":{"text":"TupleArrayConversions::check_expr (cyclomatic 26): TupleArrayConversions::check_expr has cyclomatic complexity 26 (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/tools/clippy/clippy_lints/src/tuple_array_conversions.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"71f6d769bb0a1a8a76b034069cc68a2e01e4676c01a23dd344ceae6d7239131d"}},{"ruleId":"D1","level":"warning","message":{"text":"Types::check_ty (cyclomatic 26): Types::check_ty has cyclomatic complexity 26 (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/tools/clippy/clippy_lints/src/types/mod.rs"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"6abea94f761f15fa553dc4a6a21eec8ec1df28718ef08ef6a1962d735dbd77aa"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::casts::unnecessary_cast::walk_receiver_path_step (cyclomatic 26): clippy_lints::casts::unnecessary_cast::walk_receiver_path_step has cyclomatic complexity 26 (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/tools/clippy/clippy_lints/src/casts/unnecessary_cast.rs"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"851f05bf0cd56acfa85e408b00de8234fb19b668200ddccd557b5efc408d40b2"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::operators::invalid_upcast_comparisons::upcast_comparison_bounds_err (cyclomatic 26): clippy_lints::operators::invalid_upcast_comparisons::upcast_comparison_bounds_err has cyclomatic complexity 26 (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/tools/clippy/clippy_lints/src/operators/invalid_upcast_comparisons.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"e92cffff5c75a40968c2e092efe69d60e33507719ef91127a2f16e302645501f"}},{"ruleId":"D1","level":"warning","message":{"text":"TestCx::run_rmake_test (cyclomatic 26): TestCx::run_rmake_test has cyclomatic complexity 26 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/compiletest/src/runtest/run_make.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"c13c5dd72280758fb7720f0d54b6dfcd0a83decbee926980b97aa6c103551b72"}},{"ruleId":"D1","level":"warning","message":{"text":"Validator::check_item (cyclomatic 26): Validator::check_item has cyclomatic complexity 26 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/jsondoclint/src/validator.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfa7c555c66e8010ca19561d62dbaf31762106519e8260caaaa6ae849dc52ecc"}},{"ruleId":"D1","level":"warning","message":{"text":"SemanticsImpl::descend_into_macros_impl (cyclomatic 26): SemanticsImpl::descend_into_macros_impl has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir/src/semantics.rs"},"region":{"startLine":1237}}}],"partialFingerprints":{"codehealthFindingId/v1":"b452f10200374e42877d4c437532b922410ddb673fc0c0f217899811b9f37cf6"}},{"ruleId":"D1","level":"warning","message":{"text":"Printer::print_type_ref (cyclomatic 26): Printer::print_type_ref has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/expr_store/pretty.rs"},"region":{"startLine":1259}}}],"partialFingerprints":{"codehealthFindingId/v1":"67da6a026dd22580718cb8ab7ef3fd4d2387c752bb97d33497c81a100cb0db7b"}},{"ruleId":"D1","level":"warning","message":{"text":"InferenceContext::analyze_closure (cyclomatic 26): InferenceContext::analyze_closure has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/infer/closure/analysis.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c61a40ffd00d9958bfe36c6b7650b0bd9ec823822da9f1591ed3e64e521d9e0"}},{"ruleId":"D1","level":"warning","message":{"text":"Evaluator::exec_simd_intrinsic (cyclomatic 26): Evaluator::exec_simd_intrinsic has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/mir/eval/shim/simd.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"d97e474ca53ca1fbeb3cafd782756f151e2a2d1bc6039c8484518569db12e528"}},{"ruleId":"D1","level":"warning","message":{"text":"ide::file_structure::structure_node (cyclomatic 26): ide::file_structure::structure_node has cyclomatic complexity 26 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 3 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/tools/rust-analyzer/crates/ide/src/file_structure.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"105a19508241294c3bd276cb3c83437d61140eb798ad1dc7e24372ec9f119887"}},{"ruleId":"D1","level":"warning","message":{"text":"ide::hover::render::render_memory_layout (cyclomatic 26): ide::hover::render::render_memory_layout has cyclomatic complexity 26 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/hover/render.rs"},"region":{"startLine":1165}}}],"partialFingerprints":{"codehealthFindingId/v1":"15ed25e5956b28c625b54a1e3ea895a4e03a7979e2c960a43dbbe7e85c8606de"}},{"ruleId":"D1","level":"warning","message":{"text":"ide::inlay_hints::hints (cyclomatic 26): ide::inlay_hints::hints has cyclomatic complexity 26 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/inlay_hints.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"faa66e00db293384e51ad9eaeb6d53c04b350c1e01d9df1081b59896744d543f"}},{"ruleId":"D1","level":"warning","message":{"text":"ide_completion::render::render_resolution_path (cyclomatic 26): ide_completion::render::render_resolution_path has cyclomatic complexity 26 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-completion/src/render.rs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5b4048ef271bbad8a01bf5c90ffe01018359123e9f6b303b3f5f7c9284b2a02"}},{"ruleId":"D1","level":"warning","message":{"text":"Scip::run (cyclomatic 26): Scip::run has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/cli/scip.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"67d7dbc98abfd6c0fbdf6d458131a778be3e2dd184feea2967cc48b19679c207"}},{"ruleId":"D1","level":"warning","message":{"text":"tt::storage::decode (cyclomatic 26): tt::storage::decode has cyclomatic complexity 26 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/tt/src/storage.rs"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"36e857fc19912e66afad84eb40df692b3427dff56fc65b1f92cba382c72c1957"}},{"ruleId":"D1","level":"warning","message":{"text":"LoweringContext::lower_item_kind (cyclomatic 25): LoweringContext::lower_item_kind 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":"compiler/rustc_ast_lowering/src/item.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef5dc167831db2221fab9099d295262d70dd967461519765545117dd0f8e4fc5"}},{"ruleId":"D1","level":"warning","message":{"text":"RegionInferenceContextInner::best_blame_constraint (cyclomatic 25): RegionInferenceContextInner::best_blame_constraint has cyclomatic complexity 25 (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":"compiler/rustc_borrowck/src/region_infer/region_context.rs"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce43d5060c01a6d3306088e1d4f691427c7796d065bb07d92906d755181007cb"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_codegen_gcc::intrinsic::simd::generic_simd_intrinsic::simd_simple_float_intrinsic (cyclomatic 25): rustc_codegen_gcc::intrinsic::simd::generic_simd_intrinsic::simd_simple_float_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. This shape REPEATS in the file: one other method here (rustc_codegen_gcc::intrinsic::simd::generic_simd_intrinsic) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_gcc/src/intrinsic/simd.rs"},"region":{"startLine":851}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6ba485f322950abde184e6c02b398f56a732b418d119f8941436494e0eaa3c2"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_codegen_ssa::back::link::linker_with_args (cyclomatic 25): rustc_codegen_ssa::back::link::linker_with_args has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/back/link.rs"},"region":{"startLine":2910}}}],"partialFingerprints":{"codehealthFindingId/v1":"82fd334ed18b7852c8f2c5255f8801b47a22603d7ad8ff3e49d07f0beb63f1ca"}},{"ruleId":"D1","level":"warning","message":{"text":"InterpCx::cast (cyclomatic 25): InterpCx::cast 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":"compiler/rustc_const_eval/src/interpret/cast.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd88f30a0324f238af0e5736f21e9248d97192e5f0a6cfd92e61b07b52194bad"}},{"ruleId":"D1","level":"warning","message":{"text":"ValidityVisitor::try_visit_primitive (cyclomatic 25): ValidityVisitor::try_visit_primitive has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_const_eval/src/interpret/validity.rs"},"region":{"startLine":853}}}],"partialFingerprints":{"codehealthFindingId/v1":"0329e823bc3622bf8cea9ff86b01a5d2472c3bca631ff8930689ba7d71e6497b"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_expand::mbe::macro_rules::check_matcher_core (cyclomatic 25): rustc_expand::mbe::macro_rules::check_matcher_core has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_expand/src/mbe/macro_rules.rs"},"region":{"startLine":1451}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b7642cb4a104be3e982429fa88c80e5e1acab956ffb171aaace67b2346594d4"}},{"ruleId":"D1","level":"warning","message":{"text":"FnCtxt::report_method_error (cyclomatic 25): FnCtxt::report_method_error has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/method/suggest.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"10b64a05234773d75dc0c21dc7b0797ba1dcb0160891a2048308b7b96bff314e"}},{"ruleId":"D1","level":"warning","message":{"text":"FnCtxt::check_pat_ref (cyclomatic 25): FnCtxt::check_pat_ref has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/pat.rs"},"region":{"startLine":2792}}}],"partialFingerprints":{"codehealthFindingId/v1":"09b570d015041a70543a453b9bbf65ab46c42eeed81b80d27aebb586ac3407d0"}},{"ruleId":"D1","level":"warning","message":{"text":"VisitOpaqueTypes::visit_ty (cyclomatic 25): VisitOpaqueTypes::visit_ty has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_lint/src/impl_trait_overcaptures.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"55de48dd92a24d56faa71675567143cf27187893a13a0374bcfbd5fb8b60297e"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_lint::unused::must_use::is_ty_must_use (cyclomatic 25): rustc_lint::unused::must_use::is_ty_must_use has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_lint/src/unused/must_use.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2c55d1bb03cc00d12603e36f7c572049808ab5bd37402296e3a428fd5a999bb"}},{"ruleId":"D1","level":"warning","message":{"text":"CStore::report_target_modifiers_extended (cyclomatic 25): CStore::report_target_modifiers_extended has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_metadata/src/creader.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6b958ed4de8b8d33576f2a3a468b479e10ca90da2e531b15cf42a5aa75ff228"}},{"ruleId":"D1","level":"warning","message":{"text":"CrateError::report (cyclomatic 25): CrateError::report has cyclomatic complexity 25 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_metadata/src/locator.rs"},"region":{"startLine":1084}}}],"partialFingerprints":{"codehealthFindingId/v1":"adb016a58622a4edca75cdc6ea41e080c73c390905f2961efb53ac8c4a11e73b"}},{"ruleId":"D1","level":"warning","message":{"text":"Visitor::super_rvalue (cyclomatic 25): Visitor::super_rvalue 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. This shape REPEATS in the file: one other method here (MutVisitor::super_rvalue) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/mir/visit.rs"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"76f2bddc8b32210277459f108d42dd56e8126680057227fc0bdfdf3e005d4cad"}},{"ruleId":"D1","level":"warning","message":{"text":"MutVisitor::super_rvalue (cyclomatic 25): MutVisitor::super_rvalue 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. This shape REPEATS in the file: one other method here (Visitor::super_rvalue) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/mir/visit.rs"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce138e0ce423aca2c21865741c8bf690979bb66da14fb2ac7065fdca007858a3"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_mir_transform::cross_crate_inline::cross_crate_inlinable (cyclomatic 25): rustc_mir_transform::cross_crate_inline::cross_crate_inlinable has cyclomatic complexity 25 (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":"compiler/rustc_mir_transform/src/cross_crate_inline.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1dbc50fad930b81def3090052328a440f0395a0a24ce86fd81f46d78a7bd0e1"}},{"ruleId":"D1","level":"warning","message":{"text":"CondChecker::visit_expr (cyclomatic 25): CondChecker::visit_expr has cyclomatic complexity 25 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 4 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":"compiler/rustc_parse/src/parser/expr.rs"},"region":{"startLine":4064}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a292b276765cff306a5fcd7b83144b8c0596b56211f17498e7d331ddd05d8fc"}},{"ruleId":"D1","level":"warning","message":{"text":"ReachableContext::propagate_node (cyclomatic 25): ReachableContext::propagate_node 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":"compiler/rustc_passes/src/reachable.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"a97c6613ddcc4b457927c7f14e29a44e56de1293ec077f578eb580dc57c8964a"}},{"ruleId":"D1","level":"warning","message":{"text":"Checker::visit_item (cyclomatic 25): Checker::visit_item has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_passes/src/stability.rs"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecfe710a94e85b2f027304b3f792d80492099908acc9cd87ac841f87aec7cb60"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeErrCtxt::cmp_fn_sig (cyclomatic 25): TypeErrCtxt::cmp_fn_sig has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/error_reporting/infer/mod.rs"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"87e11878c2d56f04f4f806eeedc3f1652273bd1d455dd0aaba8f7916375f9595"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeErrCtxt::report_concrete_failure (cyclomatic 25): TypeErrCtxt::report_concrete_failure has cyclomatic complexity 25 (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":"compiler/rustc_trait_selection/src/error_reporting/infer/region.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"54e621715ab347ec5f62383a622c64c3a72be0ad7d2eabf9f401cdc61b794d7b"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_trait_selection::error_reporting::infer::region::suggest_precise_capturing (cyclomatic 25): rustc_trait_selection::error_reporting::infer::region::suggest_precise_capturing has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/error_reporting/infer/region.rs"},"region":{"startLine":1429}}}],"partialFingerprints":{"codehealthFindingId/v1":"911f65c9bb7e1c94a2e0c590503c5525e85300ea6c4bdbf7835357526d06993d"}},{"ruleId":"D1","level":"warning","message":{"text":"NeedsDropTypes::next (cyclomatic 25): NeedsDropTypes::next has cyclomatic complexity 25 (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":"compiler/rustc_ty_utils/src/needs_drop.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e3b410b089bb2f82e4abe4bc808942e23849c190cacffb9bb99d1c353866231"}},{"ruleId":"D1","level":"warning","message":{"text":"libm::math::atan2::atan2 (cyclomatic 25): libm::math::atan2::atan2 has cyclomatic complexity 25 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/compiler-builtins/libm/src/math/atan2.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd40a781a14ef4b01400ed6fd7cd71f19eedb9325960fbe0a1e92bd29ec5cac2"}},{"ruleId":"D1","level":"warning","message":{"text":"libm::math::atan2f::atan2f (cyclomatic 25): libm::math::atan2f::atan2f has cyclomatic complexity 25 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/compiler-builtins/libm/src/math/atan2f.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2b56cf47569e56e1b4ab5f5fcb19a0844e89b5b617444ac52e4cbd730b05978"}},{"ruleId":"D1","level":"warning","message":{"text":"bootstrap::core::build_steps::compile::run_cargo (cyclomatic 25): bootstrap::core::build_steps::compile::run_cargo has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/build_steps/compile.rs"},"region":{"startLine":2678}}}],"partialFingerprints":{"codehealthFindingId/v1":"15465a2d2b0a6ffa06a247d183c0157742a6858dc7146d59e26390e77af95b15"}},{"ruleId":"D1","level":"warning","message":{"text":"Disambiguator::from_str (cyclomatic 25): Disambiguator::from_str 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. This is NOT this file\u0027s highest cyclomatic complexity: rustdoc::passes::collect_intra_doc_links::resolve_primitive (cyclomatic 29) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/passes/collect_intra_doc_links.rs"},"region":{"startLine":1773}}}],"partialFingerprints":{"codehealthFindingId/v1":"881ec71503729f692b59ecd5e788a8a3294b9b162592ab1116026733815b6e86"}},{"ruleId":"D1","level":"warning","message":{"text":"rustdoc::clean::cfg::extract_cfg_from_attrs (cyclomatic 25): rustdoc::clean::cfg::extract_cfg_from_attrs has cyclomatic complexity 25 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 2 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. This is NOT this file\u0027s highest cyclomatic complexity: rustdoc::clean::cfg::human_readable_target_os (cyclomatic 53) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/clean/cfg.rs"},"region":{"startLine":838}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0b6ece3e7cd428ccbeacd94a3f86d2445b4c1332c284a5fa0da4eba9e2a1547"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_dev::main (cyclomatic 25): clippy_dev::main 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/tools/clippy/clippy_dev/src/main.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bf03586947bd768f9faeb72a8fa5b87bbaa56139438a6c40cac1f9bd7fe8e8a"}},{"ruleId":"D1","level":"warning","message":{"text":"IterFunctionVisitor::visit_expr (cyclomatic 25): IterFunctionVisitor::visit_expr has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/methods/needless_collect.rs"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9bdbd516657560cd4db325dfb37d28e594f58b199d85811d1d62b01e8d99d03"}},{"ruleId":"D1","level":"warning","message":{"text":"PrintVisitor::lit (cyclomatic 25): PrintVisitor::lit 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/tools/clippy/clippy_lints/src/utils/author.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc8eb6cc493100dc699b8a6f18b8bb5cea95d6e0b302558003f1d2e384257063"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::methods::unnecessary_sort_by::mirrored_exprs (cyclomatic 25): clippy_lints::methods::unnecessary_sort_by::mirrored_exprs 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/tools/clippy/clippy_lints/src/methods/unnecessary_sort_by.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"af89183b6572d975fc84962884c24bffa8a7312530cbcb9313ea5f410cf83ae9"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::methods::unwrap_expect_used::check (cyclomatic 25): clippy_lints::methods::unwrap_expect_used::check has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/methods/unwrap_expect_used.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6113fe4fe4b2b9fa8b06b5a057dc7b523f6411763089f839f030a5a358903ac"}},{"ruleId":"D1","level":"warning","message":{"text":"LintExtractor::lints_from_file (cyclomatic 25): LintExtractor::lints_from_file has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/lint-docs/src/lib.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"bee8b8e1c0510e054c2de537553084584311987599aa004be2b290de0987cc1c"}},{"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/tools/miri/src/intrinsics/x86/avx512.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1026c6771c4595e0803995ebb3dd91fcdfe3e202e6ecd0f3fc5133f4a66c9fb"}},{"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/tools/miri/src/intrinsics/x86/sse.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"686ab2967f61ad2cd90fc52041f3ea213197d7146b03eba2e817ac9b6819fe55"}},{"ruleId":"D1","level":"warning","message":{"text":"hir::source_analyzer::resolve_hir_path_ (cyclomatic 25): hir::source_analyzer::resolve_hir_path_ has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir/src/source_analyzer.rs"},"region":{"startLine":1873}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f469d83fdff0d62c283a31bdc02e6e4e1327477af8f00de0513332f0f459a92"}},{"ruleId":"D1","level":"warning","message":{"text":"DefCollector::seed_with_top_level (cyclomatic 25): DefCollector::seed_with_top_level has cyclomatic complexity 25 (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/tools/rust-analyzer/crates/hir-def/src/nameres/collector.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"8588eeabcf7dac7b1b88e62c5a01caf370e5856707ebeee81a69551d8763087f"}},{"ruleId":"D1","level":"warning","message":{"text":"MirLowerCtx::lower_expr_as_place_without_adjust (cyclomatic 25): MirLowerCtx::lower_expr_as_place_without_adjust has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/mir/lower/as_place.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"051951c651520e7dd2317aa20fac67f97ad8aee92454d006797a3595ec127ce5"}},{"ruleId":"D1","level":"warning","message":{"text":"ide::goto_type_definition::goto_type_definition (cyclomatic 25): ide::goto_type_definition::goto_type_definition 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/tools/rust-analyzer/crates/ide/src/goto_type_definition.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"76fe529d1a1919e155b64a3eb7dca95042d03b9766aa7e5fdfd57ded4f9e5b57"}},{"ruleId":"D1","level":"warning","message":{"text":"ide::signature_help::signature_help_for_call (cyclomatic 25): ide::signature_help::signature_help_for_call 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/tools/rust-analyzer/crates/ide/src/signature_help.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a59e869a73d201cf248e9d32d4b45e5b034f2d9fdfce245df2d4a417c456da1"}},{"ruleId":"D1","level":"warning","message":{"text":"ide_completion::completions::attribute::complete_attribute_path (cyclomatic 25): ide_completion::completions::attribute::complete_attribute_path has cyclomatic complexity 25 (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/tools/rust-analyzer/crates/ide-completion/src/completions/attribute.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aaf82a6f3f0cfdc5fcc007c52060a6660e0dd8d17707766d5279de7dc5261ce"}},{"ruleId":"D1","level":"warning","message":{"text":"ide_completion::completions::item_list::add_keywords (cyclomatic 25): ide_completion::completions::item_list::add_keywords has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-completion/src/completions/item_list.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"76a157a4e6847419d1e1c2e59031dc426a4ff2de34f47303628571bf2dfd0285"}},{"ruleId":"D1","level":"warning","message":{"text":"ide_completion::completions::pattern::complete_pattern_path (cyclomatic 25): ide_completion::completions::pattern::complete_pattern_path 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/tools/rust-analyzer/crates/ide-completion/src/completions/pattern.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d3130fac143ca5dcfd6fe81f65763f40a4d359b1b970e453ad12d73b2bc4ab1"}},{"ruleId":"D1","level":"warning","message":{"text":"NameRefClass::classify (cyclomatic 25): NameRefClass::classify 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. This is NOT this file\u0027s highest cyclomatic complexity: Definition::docs_with_rangemap (cyclomatic 26) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-db/src/defs.rs"},"region":{"startLine":745}}}],"partialFingerprints":{"codehealthFindingId/v1":"183b28f3e6ef1d3d9ccd9256de88f26c6fe58de5c339efcf1aaa12a1d3bfbf24"}},{"ruleId":"D1","level":"warning","message":{"text":"Ctx::transform_path_ (cyclomatic 25): Ctx::transform_path_ has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-db/src/path_transform.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"276f98dd79a14193c524e9eee57c5e759dcb07168e200926541886ab03165295"}},{"ruleId":"D1","level":"warning","message":{"text":"Converter::extend_literal (cyclomatic 25): Converter::extend_literal has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: parser::lexed_str::err_to_msg (cyclomatic 28) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/parser/src/lexed_str.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd22ac5beaa4e1fff6fc0b2e49d007d4c9bfa2fad195a2c84f20a2a0b3c06192"}},{"ruleId":"D1","level":"warning","message":{"text":"GlobalState::process_changes (cyclomatic 25): GlobalState::process_changes has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/global_state.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfdcfca5b61f653d839be0173074ef5e9de0e98e88698ecaccc798ab277615e4"}},{"ruleId":"D1","level":"warning","message":{"text":"rust_analyzer::lsp::to_proto::completion_item (cyclomatic 25): rust_analyzer::lsp::to_proto::completion_item has cyclomatic complexity 25 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: rust_analyzer::lsp::to_proto::completion_item_kind (cyclomatic 37) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/lsp/to_proto.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fa32144c412687523206fff0b4c19d66e480fa00a9b18b8e30609a60686a653"}},{"ruleId":"D1","level":"warning","message":{"text":"FmtVisitor::visit_impl_items (cyclomatic 25): FmtVisitor::visit_impl_items 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/tools/rustfmt/src/items.rs"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"507824dc4e6cd2bee42c12d28feb99c4ad827acba4d849b523ac37cfdf277880"}},{"ruleId":"D1","level":"warning","message":{"text":"tidy::features::collect_lang_features_in (cyclomatic 25): tidy::features::collect_lang_features_in has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/tidy/src/features.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"881782540426d920ad35620b623d9c7769f9fb2d950d323fa1776ea5cd8c24c8"}},{"ruleId":"D1","level":"warning","message":{"text":"Canonicalized::canonicalize (cyclomatic 25): Canonicalized::canonicalize has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/unicode-table-generator/src/raw_emitter.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"75c888a8bdd70046c7fef6d1b26b6c16cc076b84db087e30cedbecde4964c8f4"}},{"ruleId":"D1","level":"warning","message":{"text":"MSVCEnumSyntheticProvider.update (cyclomatic 25): MSVCEnumSyntheticProvider.update has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/etc/lldb_providers.py"},"region":{"startLine":863}}}],"partialFingerprints":{"codehealthFindingId/v1":"192a66072979630085110a971e19266626640562f53dbc66b6bed723f0ff3676"}},{"ruleId":"D1","level":"warning","message":{"text":"search.initSearch::getIdentEndPosition (cyclomatic 25): search.initSearch::getIdentEndPosition has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: 12 other methods here (search.initSearch, search.initSearch::getItemsBefore, search.initSearch::getNextElem, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 13 times rather than 13 independent problems. Splitting this body alone leaves the other 12 exactly as they are. Where these are variations on one operation, the change that clears all 13 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":972}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e117e94c9bf804a1c948bd0ee0ef417875096e28f44fcf798d6f1bd65ef7aeb"}},{"ruleId":"D1","level":"warning","message":{"text":"initSearch::getRow (cyclomatic 25): initSearch::getRow has cyclomatic complexity 25 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":1930}}}],"partialFingerprints":{"codehealthFindingId/v1":"51e59837dca1acb124e7762b7d2ee4aa70744fcd22093845b61e3095f7d018fe"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_attr_parsing::check_cfg::unexpected_cfg_name (cyclomatic 24): rustc_attr_parsing::check_cfg::unexpected_cfg_name has cyclomatic complexity 24 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 2 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":"compiler/rustc_attr_parsing/src/check_cfg.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bc18ffd9ea6a6ff59c4975e343c969e15550ef04c698a83e5df55b60ec14b66"}},{"ruleId":"D1","level":"warning","message":{"text":"MirBorrowckCtxt::add_move_hints (cyclomatic 24): MirBorrowckCtxt::add_move_hints has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/diagnostics/move_errors.rs"},"region":{"startLine":746}}}],"partialFingerprints":{"codehealthFindingId/v1":"54b865b203b07354d6d9ac2445938dc66042e6746b4031ad4f3bdca5b88852b7"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeChecker::visit_terminator (cyclomatic 24): TypeChecker::visit_terminator has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/type_check/mod.rs"},"region":{"startLine":739}}}],"partialFingerprints":{"codehealthFindingId/v1":"90e9d7dd21122e7b0d875574e689fab6d30d2c57c388c7c648b8839f90f9a59d"}},{"ruleId":"D1","level":"warning","message":{"text":"Builder::gcc_icmp (cyclomatic 24): Builder::gcc_icmp 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":"compiler/rustc_codegen_gcc/src/int.rs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2411fe20a98c939e08fca4f0378bf6094c3eb197643d7dd858b02a188d0ebc8"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_codegen_gcc::abi::conv_to_fn_attribute (cyclomatic 24): rustc_codegen_gcc::abi::conv_to_fn_attribute 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":"compiler/rustc_codegen_gcc/src/abi.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"e33768e53fa2aae2af7239733cbbb53f838b3e6a60e23fc09cae567c464e0c13"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_codegen_llvm::abi::to_llvm_calling_convention (cyclomatic 24): rustc_codegen_llvm::abi::to_llvm_calling_convention 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":"compiler/rustc_codegen_llvm/src/abi.rs"},"region":{"startLine":794}}}],"partialFingerprints":{"codehealthFindingId/v1":"dce84e56acf8cf7867e561914f5237d12a369a14e2f8f7de3b983ea4689159e6"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_codegen_llvm::back::write::codegen (cyclomatic 24): rustc_codegen_llvm::back::write::codegen has cyclomatic complexity 24 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 3 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":"compiler/rustc_codegen_llvm/src/back/write.rs"},"region":{"startLine":971}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3dc7a25a185189083012edc5dafd14069550eddb1e1c8479623d6e0d638570e"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_codegen_llvm::debuginfo::metadata::spanned_type_di_node (cyclomatic 24): rustc_codegen_llvm::debuginfo::metadata::spanned_type_di_node 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":"compiler/rustc_codegen_llvm/src/debuginfo/metadata.rs"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"33db5efb0fb1912afbc2a8b48a007549e4ad44ff78a0b5eae41672f54e73c567"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_codegen_llvm::type_of::uncached_llvm_type (cyclomatic 24): rustc_codegen_llvm::type_of::uncached_llvm_type 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":"compiler/rustc_codegen_llvm/src/type_of.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9b66a492f88d1084077da87575358476fcc56658661317ef5929ae478e50510"}},{"ruleId":"D1","level":"warning","message":{"text":"InterpCx::init_stack_frame (cyclomatic 24): InterpCx::init_stack_frame has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_const_eval/src/interpret/call.rs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd022e70e60342cb7e26442075cf90a32c485cc75ac5de617dcb049a716a5e32"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_expand::mbe::diagnostics::emit_frag_parse_err (cyclomatic 24): rustc_expand::mbe::diagnostics::emit_frag_parse_err has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_expand/src/mbe/diagnostics.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff5f2606293fb79ec78946484a693fb3aee71d7e9b4fbf87ee33acfbb1d3adb5"}},{"ruleId":"D1","level":"warning","message":{"text":"WrongNumberOfGenericArgs::suggest_removing_args_or_generics (cyclomatic 24): WrongNumberOfGenericArgs::suggest_removing_args_or_generics has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/diagnostics/wrong_number_of_generic_args.rs"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"047a81fa8ce650cdc7029b460c05a717f7dabcbea9624b2921fefd2c36718e75"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_hir_analysis::check::compare_impl_item::refine::check_refining_return_position_impl_trait_in_trait (cyclomatic 24): rustc_hir_analysis::check::compare_impl_item::refine::check_refining_return_position_impl_trait_in_trait has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/check/compare_impl_item/refine.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"00bbb3c2bf476a65292f9cfb7d4ebc450bedf642440f0dd91b14e8cb0f51e6bb"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_hir_analysis::coherence::orphan::orphan_check_impl (cyclomatic 24): rustc_hir_analysis::coherence::orphan::orphan_check_impl 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":"compiler/rustc_hir_analysis/src/coherence/orphan.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"63a61cd43d903e3da6147533c22bf5df058024084c9a9e3cd36219db4a55c2aa"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_hir_analysis::delegation::create_mapping (cyclomatic 24): rustc_hir_analysis::delegation::create_mapping has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/delegation.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"750aaf352b21645c5f64d25c194a042e280d523a3d65d4d752096ddbe1f14081"}},{"ruleId":"D1","level":"warning","message":{"text":"State::print_type (cyclomatic 24): State::print_type 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. This is NOT this file\u0027s highest cyclomatic complexity: State::print_node (cyclomatic 39) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_pretty/src/lib.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"7954a2ed04b43f950270902199a26012b1eb082da5da38f1101ea554ad4271bd"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_macros::query::parse_query_modifiers (cyclomatic 24): rustc_macros::query::parse_query_modifiers has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_macros/src/query.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1616eb2ad7af4c432b2cb3a4dae82357275f50ab21aab821ac4c6597b62bebe"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::parse_item_impl (cyclomatic 24): Parser::parse_item_impl 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":"compiler/rustc_parse/src/parser/item.rs"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"66caa1755db6bd616083577fe15cf3b6160ae7b2b0cb3ad71f9fe84ad4052282"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_passes::stability::check_unused_or_stable_features (cyclomatic 24): rustc_passes::stability::check_unused_or_stable_features has cyclomatic complexity 24 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 8 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":"compiler/rustc_passes/src/stability.rs"},"region":{"startLine":1159}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6ac174b9170ca16ef9b333e0286b292f21b29acd2886b0b760c23d9de2f02fd"}},{"ruleId":"D1","level":"warning","message":{"text":"LateResolutionVisitor::lookup_assoc_candidate (cyclomatic 24): LateResolutionVisitor::lookup_assoc_candidate has cyclomatic complexity 24 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. 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":"compiler/rustc_resolve/src/late/diagnostics.rs"},"region":{"startLine":3244}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2b7e3395dac42dada02f78e77c79472aa4b83e33a2db814ca71b27528b7447c"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_target::callconv::loongarch::classify_arg (cyclomatic 24): rustc_target::callconv::loongarch::classify_arg has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_target/src/callconv/loongarch.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"cade40a7a529b8a2a2d2c406503e76988ec909ca86154fe6881ae30c7eadde06"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_target::callconv::riscv::classify_arg (cyclomatic 24): rustc_target::callconv::riscv::classify_arg has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_target/src/callconv/riscv.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1df9f23dc278f51b73dd83512906d4aa34b6121c5836a01cfd434e91f456d4d"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_target::callconv::x86_64::compute_abi_info (cyclomatic 24): rustc_target::callconv::x86_64::compute_abi_info has cyclomatic complexity 24 (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":"compiler/rustc_target/src/callconv/x86_64.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4abfa1008bff31cae66f55663edcce4312fc16ad6987979c6423744da7faf5d"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_trait_selection::traits::dyn_compatibility::virtual_call_violations_for_method (cyclomatic 24): rustc_trait_selection::traits::dyn_compatibility::virtual_call_violations_for_method has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/traits/dyn_compatibility.rs"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"662aeed7ca375000620abf0361fcabfe52b39a2cac83ad60292a2611159c276e"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_ty_walk::walk_types (cyclomatic 24): rustc_ty_walk::walk_types has cyclomatic complexity 24 (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":"compiler/rustc_ty_walk/src/lib.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"df69ce953d36259942b9c4ccb751852f468c6a6b0d1f014281bb3c8d02cfa414"}},{"ruleId":"D1","level":"warning","message":{"text":"compiler_builtins::float::add::add (cyclomatic 24): compiler_builtins::float::add::add has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/compiler-builtins/compiler-builtins/src/float/add.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a8ccb70a438deaf74f27e468318bfa2e4dd8948d404a18c21a330099efd5eb2"}},{"ruleId":"D1","level":"warning","message":{"text":"libm::math::generic::fma::fma_round (cyclomatic 24): libm::math::generic::fma::fma_round has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/compiler-builtins/libm/src/math/generic/fma.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"c559d165f8e82cd4be1d79dd2fda0a19626e6c45a6ebfb7894f6e90f77520384"}},{"ruleId":"D1","level":"warning","message":{"text":"libm::math::jn::jn (cyclomatic 24): libm::math::jn::jn has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/compiler-builtins/libm/src/math/jn.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e3cb83c562d8ed662dbde15924f62ed223ed949c261a4ac5e645fb9a2f05315"}},{"ruleId":"D1","level":"warning","message":{"text":"libm::math::remquo::remquo (cyclomatic 24): libm::math::remquo::remquo 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":"library/compiler-builtins/libm/src/math/remquo.rs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"5202e98d0ef37fccaf6a833845dfeb6da51eb61bf3a4d3fb72637dbf29106504"}},{"ruleId":"D1","level":"warning","message":{"text":"libm::math::remquof::remquof (cyclomatic 24): libm::math::remquof::remquof 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":"library/compiler-builtins/libm/src/math/remquof.rs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2ed0cffecf36d740162a887f374f511ca4e6cd324e41d6c2fe9638311742e22"}},{"ruleId":"D1","level":"warning","message":{"text":"Install::deserialize (cyclomatic 24): Install::deserialize 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/bootstrap/src/core/config/toml/install.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"c43b5fed78fc9891a0e0629a996bf4655abb555697ef6f973b974064f03b9c9c"}},{"ruleId":"D1","level":"warning","message":{"text":"TagParser::extract_opening_tag (cyclomatic 24): TagParser::extract_opening_tag has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/passes/lint/html_tags.rs"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"369adeabf658cf8ea4d97d56888c79d644c5e6968916e44c68851db9e8493253"}},{"ruleId":"D1","level":"warning","message":{"text":"rustdoc::clean::clean_generics (cyclomatic 24): rustdoc::clean::clean_generics has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/clean/mod.rs"},"region":{"startLine":759}}}],"partialFingerprints":{"codehealthFindingId/v1":"310eb7bbe92ca5cda6bd0f9968774a7bdecd02733fbfcda6239661ffdd9dd784"}},{"ruleId":"D1","level":"warning","message":{"text":"rustdoc::clean::first_non_private (cyclomatic 24): rustdoc::clean::first_non_private has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/clean/mod.rs"},"region":{"startLine":1609}}}],"partialFingerprints":{"codehealthFindingId/v1":"22ccfc93ade7e6b02ab57f378b687fb9253825ac6242a8fe07bcc7f9efb65489"}},{"ruleId":"D1","level":"warning","message":{"text":"NonCopyConst::is_non_freeze_init_borrowed (cyclomatic 24): NonCopyConst::is_non_freeze_init_borrowed 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/tools/clippy/clippy_lints/src/non_copy_const.rs"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2deb8df8c5e4d3f3815609b8895a0263fd9202566f405c3b2aed4ce035542e5"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::lifetimes::could_use_elision (cyclomatic 24): clippy_lints::lifetimes::could_use_elision has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/lifetimes.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"25f1d0ec4c7f83d9b46b1d82440a592820b7a0ac79948195fac6552d5f686e4d"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::methods::unnecessary_literal_unwrap::check (cyclomatic 24): clippy_lints::methods::unnecessary_literal_unwrap::check has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/methods/unnecessary_literal_unwrap.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"f244852a94c6a27e6165b084eb6f1b75b997095bacf60c6ef1b4830d7ce91515"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::option_if_let_else::try_get_option_occurrence (cyclomatic 24): clippy_lints::option_if_let_else::try_get_option_occurrence has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/option_if_let_else.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bbb32812fb9313bb0fdc40b31c48a6eb0a9001e66bd3ea8aef511077e4401cb"}},{"ruleId":"D1","level":"warning","message":{"text":"SpanlessHash::hash_pat (cyclomatic 24): SpanlessHash::hash_pat has cyclomatic complexity 24 (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/tools/clippy/clippy_utils/src/hir_utils.rs"},"region":{"startLine":1461}}}],"partialFingerprints":{"codehealthFindingId/v1":"28e60e936f93be19ef544073910bf9f87c491a66ec9fa33a618a572a511b8877"}},{"ruleId":"D1","level":"warning","message":{"text":"DerefDelegate::borrow (cyclomatic 24): DerefDelegate::borrow has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_utils/src/sugg.rs"},"region":{"startLine":937}}}],"partialFingerprints":{"codehealthFindingId/v1":"795ed8598af5b8de66933d2a8b4905f8734a721f03967fd361e778af64421b74"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_utils::is_default_equivalent_call (cyclomatic 24): clippy_utils::is_default_equivalent_call 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":"src/tools/clippy/clippy_utils/src/lib.rs"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"4be834f4fe9ebdc6197feb9515008df812a7c32abb8bcc23cc927ecfe4784f3f"}},{"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":"src/tools/miri/cargo-miri/src/setup.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb5dea19b81655cf78ee723740cb18d58f323df069fbe9c778937fe781077378"}},{"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/tools/miri/src/intrinsics/x86/mod.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c8bd233195c17aac5757003be978f2bfccf1cae7e9eee1c1f1fbea8ae9d0918"}},{"ruleId":"D1","level":"warning","message":{"text":"ImportMap::collect_import_map (cyclomatic 24): ImportMap::collect_import_map has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/import_map.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"f67a369cc4c593423def24e01e488f789c618f5da2c554dd590665a4c260af4c"}},{"ruleId":"D1","level":"warning","message":{"text":"DefCollector::record_resolved_import (cyclomatic 24): DefCollector::record_resolved_import has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/nameres/collector.rs"},"region":{"startLine":882}}}],"partialFingerprints":{"codehealthFindingId/v1":"7035e55087a5f5bf76373dfd9dc24dd41b96f8fb534ad3cab08c23ad047f2d00"}},{"ruleId":"D1","level":"warning","message":{"text":"CastCheck::do_check (cyclomatic 24): CastCheck::do_check 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/tools/rust-analyzer/crates/hir-ty/src/infer/cast.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e7b842b03ba4df611300a4595cc17d20bc71c4c2f5db4a44f458ccfb420ed9d"}},{"ruleId":"D1","level":"warning","message":{"text":"InferenceContext::check_record_expr_fields (cyclomatic 24): InferenceContext::check_record_expr_fields has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/infer/expr.rs"},"region":{"startLine":968}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d094d28bcd81c06ac384b91e0dd4a51ca0c778f337306ba14507301de145721"}},{"ruleId":"D1","level":"warning","message":{"text":"Evaluator::interpret_mir (cyclomatic 24): Evaluator::interpret_mir has cyclomatic complexity 24 (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/tools/rust-analyzer/crates/hir-ty/src/mir/eval.rs"},"region":{"startLine":796}}}],"partialFingerprints":{"codehealthFindingId/v1":"4824d18eb61373873e7d4fb9a278123b446e860755843e6421a482454fc7dddf"}},{"ruleId":"D1","level":"warning","message":{"text":"hir_ty::consteval::literal_ty (cyclomatic 24): hir_ty::consteval::literal_ty 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/tools/rust-analyzer/crates/hir-ty/src/consteval.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"f512b49617e37b4266bfb572db9137fc776c6461d2bad42ad977b8e2087001b0"}},{"ruleId":"D1","level":"warning","message":{"text":"ide::annotations::annotations (cyclomatic 24): ide::annotations::annotations has cyclomatic complexity 24 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 4 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/tools/rust-analyzer/crates/ide/src/annotations.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d7c081ba087338c1f9ba612340f31426d0f98c44e69c2e51df1b186663a1fa6"}},{"ruleId":"D1","level":"warning","message":{"text":"ide::doc_links::filename_and_frag_for_def (cyclomatic 24): ide::doc_links::filename_and_frag_for_def 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/tools/rust-analyzer/crates/ide/src/doc_links.rs"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f035f3af65102b69c38427347474e3de0c633b7506baaa1768b0b6d73712df5"}},{"ruleId":"D1","level":"warning","message":{"text":"ide::rename::transform_method_call_into_assoc_fn (cyclomatic 24): ide::rename::transform_method_call_into_assoc_fn has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/rename.rs"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f12ae64e46ce0488f04fa0ccd1b1cd7e916e593cf6a06bba2b86616034913c1"}},{"ruleId":"D1","level":"warning","message":{"text":"FindUsages::short_associated_function_fast_search::collect_possible_aliases (cyclomatic 24): FindUsages::short_associated_function_fast_search::collect_possible_aliases has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-db/src/search.rs"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2027b2ea66a13aaff719f980e062ea88bedbab5d15acbf1b38781a28034aa2f"}},{"ruleId":"D1","level":"warning","message":{"text":"rust_analyzer::diagnostics::flycheck_to_proto::map_rust_diagnostic_to_lsp (cyclomatic 24): rust_analyzer::diagnostics::flycheck_to_proto::map_rust_diagnostic_to_lsp has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/diagnostics/flycheck_to_proto.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc21ccd0958a2f679270058f4cf7add7d3d3722c171e1b0e0f3a69a45e54f039"}},{"ruleId":"D1","level":"warning","message":{"text":"Expr::needs_parens_in_expr (cyclomatic 24): Expr::needs_parens_in_expr has cyclomatic complexity 24 (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/tools/rust-analyzer/crates/syntax/src/ast/prec.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d8d17939721f7364bfdc876d80f9a76331bff32a72f21cc8ebd7b3b36bc0b04"}},{"ruleId":"D1","level":"warning","message":{"text":"UseSegment::cmp (cyclomatic 24): UseSegment::cmp has cyclomatic complexity 24 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. 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/tools/rustfmt/src/imports.rs"},"region":{"startLine":921}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb437c045db9b18e525a72265194ae21ada2aa02d65a735e371fef84649e6c88"}},{"ruleId":"D1","level":"warning","message":{"text":"rustfmt_nightly::items::format_trait (cyclomatic 24): rustfmt_nightly::items::format_trait has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/items.rs"},"region":{"startLine":1173}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a15d526ae82359bef444f6a93e9e16262413416a81526a5ec5b3b92860029ce"}},{"ruleId":"D1","level":"warning","message":{"text":"check_gdb.var_matches (cyclomatic 24): check_gdb.var_matches 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":"src/etc/debugger_tester/gdb/check_gdb.py"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa046dea58a2ab1ea5f9075a0a27159a4ec53eaddf5f97e2556c620500b08fc3"}},{"ruleId":"D1","level":"warning","message":{"text":"MirBorrowckCtxt::was_captured_by_trait_object (cyclomatic 23): MirBorrowckCtxt::was_captured_by_trait_object has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/diagnostics/explain_borrow.rs"},"region":{"startLine":821}}}],"partialFingerprints":{"codehealthFindingId/v1":"415bed8465a55479ec24bf5f321b1a53b467b669b1b687f16f274caa67bdc229"}},{"ruleId":"D1","level":"warning","message":{"text":"LoanInvalidationsGenerator::visit_terminator (cyclomatic 23): LoanInvalidationsGenerator::visit_terminator has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/polonius/legacy/loan_invalidations.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"29b182046fc0878e525e06549a2a434e1a1fbb03b53b18406c6332a20eb44723"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_codegen_cranelift::common::clif_type_from_ty (cyclomatic 23): rustc_codegen_cranelift::common::clif_type_from_ty 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":"compiler/rustc_codegen_cranelift/src/common.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2ee4c4bf62ba6a072d68ed8e3c0755a4569cf757324974992aa06e484e1057e"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_codegen_cranelift::constant::mir_operand_get_const_val (cyclomatic 23): rustc_codegen_cranelift::constant::mir_operand_get_const_val 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":"compiler/rustc_codegen_cranelift/src/constant.rs"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7aca0862bc2b9b52dad1a7c1da32e797302b282ba02df9239a813b4ed0147ea"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_codegen_cranelift::inline_asm::codegen_inline_asm_terminator (cyclomatic 23): rustc_codegen_cranelift::inline_asm::codegen_inline_asm_terminator has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/src/inline_asm.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"08e31452054db1c91509b610ebe83d65f9220d4e280a41ddbaaf268d92883cf0"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_codegen_gcc::back::write::codegen (cyclomatic 23): rustc_codegen_gcc::back::write::codegen has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_gcc/src/back/write.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"069fab7b34a9cfef2677cb2a22577ed89d91f33f927fffefae1243a4f0004fd4"}},{"ruleId":"D1","level":"warning","message":{"text":"Builder::cfi_type_test (cyclomatic 23): Builder::cfi_type_test has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/builder.rs"},"region":{"startLine":1968}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a051b8b8b77dfcc5a4d4a62b980b0e38a2002a939c3f72f3aa165fffa3bd442"}},{"ruleId":"D1","level":"warning","message":{"text":"GccLinker::export_symbols (cyclomatic 23): GccLinker::export_symbols has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/back/linker.rs"},"region":{"startLine":789}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9dd1b70882ce79549b0e4fc8aa0c93da71cdfaf7af1d4b399eea3e94a227efa"}},{"ruleId":"D1","level":"warning","message":{"text":"TerminatorCodegenHelper::do_call (cyclomatic 23): TerminatorCodegenHelper::do_call has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/mir/block.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"26a84b934a9b5de266d0e7073565eb4be79a57d2dac5bee085b87a17ed304c7e"}},{"ruleId":"D1","level":"warning","message":{"text":"FunctionCx::codegen_statement (cyclomatic 23): FunctionCx::codegen_statement has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/mir/statement.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"371de11ed045e8168eefd6fd306ae57f00c7afa3bbdc9a9794a7155c8feb19db"}},{"ruleId":"D1","level":"warning","message":{"text":"InterpCx::eval_atomic_intrinsic (cyclomatic 23): InterpCx::eval_atomic_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":"compiler/rustc_const_eval/src/interpret/intrinsics/atomic.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"72f31204ee90a7e3d43843239e081852d58c97cf081f1b08e6f65b48e4682c91"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_expand::mbe::diagnostics::failed_to_match_macro (cyclomatic 23): rustc_expand::mbe::diagnostics::failed_to_match_macro has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_expand/src/mbe/diagnostics.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f92c5556827e66de1790e406e6406d6a45a1b9135dc278758c7ea0ee3f99f5a"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_hir_analysis::collect::clauses_of::const_conditions (cyclomatic 23): rustc_hir_analysis::collect::clauses_of::const_conditions 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":"compiler/rustc_hir_analysis/src/collect/clauses_of.rs"},"region":{"startLine":1030}}}],"partialFingerprints":{"codehealthFindingId/v1":"07c657d4a30ca13d6932a99575614af9df1694b500cbc691128411d975bb8ba2"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_hir_analysis::diagnostics::remove_or_use_generic::suggest_to_remove_or_use_generic (cyclomatic 23): rustc_hir_analysis::diagnostics::remove_or_use_generic::suggest_to_remove_or_use_generic has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/diagnostics/remove_or_use_generic.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3f01562e3d8921fa2f2ee6119c28f50bda0fd63fe116ac59d65055e18e91143"}},{"ruleId":"D1","level":"warning","message":{"text":"CoerceMany::coerce_inner (cyclomatic 23): CoerceMany::coerce_inner has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/coercion.rs"},"region":{"startLine":1703}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ddf153d64c061dc1c69999acbb6ec00f42effea84384298f685b6d003d8a4ab"}},{"ruleId":"D1","level":"warning","message":{"text":"FnCtxt::check_tupled_arguments (cyclomatic 23): FnCtxt::check_tupled_arguments has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/fn_ctxt/checks.rs"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbc1340e73fbedfea655e41ce8a72da1f42e67ed84506995accb4faa4909b636"}},{"ruleId":"D1","level":"warning","message":{"text":"FnCtxt::suggest_missing_break_or_return_expr (cyclomatic 23): FnCtxt::suggest_missing_break_or_return_expr has cyclomatic complexity 23 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 10 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":"compiler/rustc_hir_typeck/src/fn_ctxt/suggestions.rs"},"region":{"startLine":1303}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3b76ff2c1a84d971e7e6d569d58e0aae2bd7bf9c9b408f52f08966eefbd51eb"}},{"ruleId":"D1","level":"warning","message":{"text":"Ty::ty_and_layout_pointee_info_at (cyclomatic 23): Ty::ty_and_layout_pointee_info_at has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/ty/layout.rs"},"region":{"startLine":1057}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d9ac901080c7c4af33b8bc20fd85a5b95da0262ac366e89a27aef4fd07e1b9a"}},{"ruleId":"D1","level":"warning","message":{"text":"PrettyPrinter::pretty_print_const_valtree (cyclomatic 23): PrettyPrinter::pretty_print_const_valtree has cyclomatic complexity 23 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/ty/print/pretty.rs"},"region":{"startLine":1902}}}],"partialFingerprints":{"codehealthFindingId/v1":"77218317ba9c3dd47cc75dc83ed17f0146f579e02435221d08ba8278b16d1fda"}},{"ruleId":"D1","level":"warning","message":{"text":"TOFinder::process_assign (cyclomatic 23): TOFinder::process_assign has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/jump_threading.rs"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f4f2fdf8b5d8908eb1499d16b3e70ebcbc86c70eee0e036d9d8419b941ea692"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_mir_transform::pass_manager::run_passes_inner (cyclomatic 23): rustc_mir_transform::pass_manager::run_passes_inner has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/pass_manager.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cc8b1b18f830689a206d48b2925617ffb9305489b6c3a07037afb346092801b"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_monomorphize::collector::collect_roots (cyclomatic 23): rustc_monomorphize::collector::collect_roots has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_monomorphize/src/collector.rs"},"region":{"startLine":1485}}}],"partialFingerprints":{"codehealthFindingId/v1":"499c0c123d884bd1ffb9901ee67458491745624410f397a0ee331d5842dcc223"}},{"ruleId":"D1","level":"warning","message":{"text":"OrphanChecker::visit_ty (cyclomatic 23): OrphanChecker::visit_ty 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":"compiler/rustc_next_trait_solver/src/coherence.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cc20f7a0dbe23679ba2307f97c7fc7fa1b3fc23da7a7ccee97edb2f20fde95b"}},{"ruleId":"D1","level":"warning","message":{"text":"EvalCtxt::term_is_fully_unconstrained (cyclomatic 23): EvalCtxt::term_is_fully_unconstrained has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_next_trait_solver/src/solve/eval_ctxt/mod.rs"},"region":{"startLine":1226}}}],"partialFingerprints":{"codehealthFindingId/v1":"d54ec10d1232218aecd6704b4956201ac99849e7339c284d865c07f0d847f8e0"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::collect_tokens (cyclomatic 23): Parser::collect_tokens has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/attr_wrapper.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"a188c2e3a9ea6d4edc6c81420fccad5228e1fa5f07fd8b6bd18bea04dacd02dc"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::parse_arm (cyclomatic 23): Parser::parse_arm has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/expr.rs"},"region":{"startLine":3068}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d1d533f087da5993519272fb1dbcf335753e927aa917e135f8f93aa0cd1ea94"}},{"ruleId":"D1","level":"warning","message":{"text":"RustcPatCtxt::ctors_for_ty (cyclomatic 23): RustcPatCtxt::ctors_for_ty has cyclomatic complexity 23 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_pattern_analysis/src/rustc.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f12153e6be57fd07b8c8f40c4a504fd122460d7061f1845e7ae6399223bc14c"}},{"ruleId":"D1","level":"warning","message":{"text":"FnAbi::gcc_type (cyclomatic 23): FnAbi::gcc_type 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":"compiler/rustc_codegen_gcc/src/abi.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dd83af03941fc64e3e040ccac8f56bd44c653db19d56952380f1a465736ed65"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeErrCtxt::compare_generics (cyclomatic 23): TypeErrCtxt::compare_generics has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/error_reporting/infer/mod.rs"},"region":{"startLine":980}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc9bb577979e583c5b54a980447414578862dd9c61edf834d03c3ad896341123"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_trait_selection::error_reporting::traits::call_kind::call_kind (cyclomatic 23): rustc_trait_selection::error_reporting::traits::call_kind::call_kind has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/error_reporting/traits/call_kind.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdf422f71fbe6007535ff03e594ab6eff8fd4cc080ef46c6ae6da36b323ca199"}},{"ruleId":"D1","level":"warning","message":{"text":"std_detect::detect::os::x86::detect_features (cyclomatic 23): std_detect::detect::os::x86::detect_features has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std_detect/src/detect/os/x86.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"617fd166085671ca1835f4991b894faba3f055ee3ecdb04f44987e1c17900351"}},{"ruleId":"D1","level":"warning","message":{"text":"sembr::reformat (cyclomatic 23): sembr::reformat has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/doc/rustc-dev-guide/ci/sembr/src/main.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"939d69d60eecd7b2875c5cc876dbaf0be0a4ea67a7340f8d75b5fecbabb1dff8"}},{"ruleId":"D1","level":"warning","message":{"text":"rustdoc::html::render::print_item::render_struct_fields (cyclomatic 23): rustdoc::html::render::print_item::render_struct_fields has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/render/print_item.rs"},"region":{"startLine":2545}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8eeb462f84233939853dbe09221dd29de121f3375ab01e13f849deeebec6739"}},{"ruleId":"D1","level":"warning","message":{"text":"ArbitrarySourceItemOrdering::check_item (cyclomatic 23): ArbitrarySourceItemOrdering::check_item has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/arbitrary_source_item_ordering.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"f75c79359cb8a953becdc69f5fe92a8376f6ce6302cdf66edcccf8a744d3a459"}},{"ruleId":"D1","level":"warning","message":{"text":"VarVisitor::visit_expr (cyclomatic 23): VarVisitor::visit_expr has cyclomatic complexity 23 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/loops/needless_range_loop.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6788d8c6bc02f4359ca24ca457f173e9387d86ba88988966cebcb3b678ab910"}},{"ruleId":"D1","level":"warning","message":{"text":"MissingConstForFn::check_fn (cyclomatic 23): MissingConstForFn::check_fn has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/missing_const_for_fn.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"14434be4926025e7804623208a5c7dbb949e41dfc59fd6c2a39a73584a26b61e"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::matches::collapsible_match::check_arm (cyclomatic 23): clippy_lints::matches::collapsible_match::check_arm has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/matches/collapsible_match.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"cff90377cc498c794d7e75bed22242410104237f6a16e462334bbb035ae52645"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::methods::needless_collect::check (cyclomatic 23): clippy_lints::methods::needless_collect::check has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/methods/needless_collect.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"07c2ba29f98febc4bf47981fb48ac0cfa18641634c36a94efad2e843da03e852"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::operators::bit_mask::check (cyclomatic 23): clippy_lints::operators::bit_mask::check 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/tools/clippy/clippy_lints/src/operators/bit_mask.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"86e4f1ffd1c1374d4f866e179d72fa604be16ab9e27df5a68b59cf2c9c6c9e9c"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::time_subtraction::const_eval_duration (cyclomatic 23): clippy_lints::time_subtraction::const_eval_duration has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/time_subtraction.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"658fa861179f475c1a4b0f0d4d8ad4b3a483802e56cbdc92138f9dc9bba8108d"}},{"ruleId":"D1","level":"warning","message":{"text":"ExprEagernessVisitor::visit_expr (cyclomatic 23): ExprEagernessVisitor::visit_expr 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/tools/clippy/clippy_utils/src/eager_or_lazy.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"c014bc0b24527467c65c8edb7ee67e25e317628e0270dd5206965febe722544e"}},{"ruleId":"D1","level":"warning","message":{"text":"HirEqInterExpr::eq_block (cyclomatic 23): HirEqInterExpr::eq_block has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_utils/src/hir_utils.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"0372ee86bb49fee28b86fcf80ebe4002df9d224e7b78a6e1d5af3d92779a3422"}},{"ruleId":"D1","level":"warning","message":{"text":"Checker::check_url (cyclomatic 23): Checker::check_url 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/tools/linkchecker/main.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0b0e176b8846a78c117add5ac8e7fd0618026ecc8e8ffb1ef9dd70b96d6ffc2"}},{"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/tools/miri/src/intrinsics/simd.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5db4dd5d0ee3f08f5bf2143279d13358f9ed330e33a3fa57fb8b38febbafc3a"}},{"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/tools/miri/src/shims/unix/solarish/foreign_items.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ac86a36c72b803d750baf4d9363a3a0e46971edc6348fcbaaf85729e24ab8c6"}},{"ruleId":"D1","level":"warning","message":{"text":"hir::attrs::resolve_doc_path_on_ (cyclomatic 23): hir::attrs::resolve_doc_path_on_ 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/tools/rust-analyzer/crates/hir/src/attrs.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"00a1572302468303196e7896b37e6986d329c0bd0c393cd87f79d8fc512140d2"}},{"ruleId":"D1","level":"warning","message":{"text":"hir::display::write_function (cyclomatic 23): hir::display::write_function has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir/src/display.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcc1efc7ea3f840071c0754220c39188c195643c1f1f4fb8090030dd2d768c18"}},{"ruleId":"D1","level":"warning","message":{"text":"DefCollector::push_res_and_update_glob_vis (cyclomatic 23): DefCollector::push_res_and_update_glob_vis has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/nameres/collector.rs"},"region":{"startLine":1202}}}],"partialFingerprints":{"codehealthFindingId/v1":"e22114853d1a0ac943ddba08502810908ebb4a560b35374d9a033637a8c10302"}},{"ruleId":"D1","level":"warning","message":{"text":"Pat::hir_fmt (cyclomatic 23): Pat::hir_fmt has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ide/src/diagnostics/match_check.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"79373133f466705344c681466e3a93ca7f73d18cbd674ef0d0f79a5f308947c0"}},{"ruleId":"D1","level":"warning","message":{"text":"InferenceContext::check_call_arguments (cyclomatic 23): InferenceContext::check_call_arguments has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/infer/expr.rs"},"region":{"startLine":1920}}}],"partialFingerprints":{"codehealthFindingId/v1":"02aee6d058a0e0e7e5241bd3f7ba38ec1bfe8991d0bb64b9fb9535dca9c88580"}},{"ruleId":"D1","level":"warning","message":{"text":"hir_ty::drop::has_drop_glue_impl (cyclomatic 23): hir_ty::drop::has_drop_glue_impl 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/tools/rust-analyzer/crates/hir-ty/src/drop.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"41adfb9a2dfe980f3dd6f0458a6ddde7abf182d3bdce7ad4bafe501dee18e5c1"}},{"ruleId":"D1","level":"warning","message":{"text":"hir_ty::lower::resolve_type_param_assoc_type_shorthand (cyclomatic 23): hir_ty::lower::resolve_type_param_assoc_type_shorthand has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/lower.rs"},"region":{"startLine":2114}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fb51b5219e4b7495b959d9f4b37ebb8fbb311a0ec2ea17fe0febdec62de7fa2"}},{"ruleId":"D1","level":"warning","message":{"text":"hir_ty::lower::path::substs_from_args_and_bindings (cyclomatic 23): hir_ty::lower::path::substs_from_args_and_bindings has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/lower/path.rs"},"region":{"startLine":1156}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea95c45cb72fbd586af34e1c1ae719ffedbc680351cdf0a5b7caaa22bb730fd8"}},{"ruleId":"D1","level":"warning","message":{"text":"ide::highlight_related::highlight_references (cyclomatic 23): ide::highlight_related::highlight_references has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/highlight_related.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8330461e05cc0a296811941353b19c7b9eb543eda6e95e58b5e2c5548a0b346"}},{"ruleId":"D1","level":"warning","message":{"text":"FunctionBody::analyze_container (cyclomatic 23): FunctionBody::analyze_container 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/tools/rust-analyzer/crates/ide-assists/src/handlers/extract_function.rs"},"region":{"startLine":844}}}],"partialFingerprints":{"codehealthFindingId/v1":"b80c42bd7bf8b42b17c14b6beefc5655ed9ecd690acc13829c6a2de09fa9ab57"}},{"ruleId":"D1","level":"warning","message":{"text":"Module::get_usages_and_record_fields (cyclomatic 23): Module::get_usages_and_record_fields has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/extract_module.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"11bf8b4b1d93cd173e088db900a288c9e4e38d13bb43ec73fcda9ad4acc554a2"}},{"ruleId":"D1","level":"warning","message":{"text":"ide_db::imports::insert_use::guess_granularity_from_scope (cyclomatic 23): ide_db::imports::insert_use::guess_granularity_from_scope has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-db/src/imports/insert_use.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9f4afe0d748833c9caca823e8bb1890778efc5178d31efcd60d1965bee2b88c"}},{"ruleId":"D1","level":"warning","message":{"text":"ModResolver::find_external_module (cyclomatic 23): ModResolver::find_external_module has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/modules.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"63a514ea80c90fc058cce9f5bbe57e7328b27bdf1c950fb4ffda40fdd5cba77e"}},{"ruleId":"D1","level":"warning","message":{"text":"batchmode.main (cyclomatic 23): batchmode.main has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/etc/debugger_tester/lldb/batchmode.py"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"27337bfb9e50fa865301797443ccc5b705e79187e4cfa9b2a461fe78795941ea"}},{"ruleId":"D1","level":"warning","message":{"text":"DocSearch.execQuery::unifyGenericTypes (cyclomatic 23): DocSearch.execQuery::unifyGenericTypes has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: 5 other methods here (DocSearch.execQuery::buildHrefAndPath, DocSearch.execQuery::formatDisplayTypeSignature::writeFn, DocSearch.execQuery::transformResults, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 6 times rather than 6 independent problems. Splitting this body alone leaves the other 5 exactly as they are. Where these are variations on one operation, the change that clears all 6 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":3353}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a887604f85bd848bf989128647e1ac3529663d114c476e8b1a41814bfa99705"}},{"ruleId":"D1","level":"warning","message":{"text":"search.initSearch::unifyGenericTypes (cyclomatic 23): search.initSearch::unifyGenericTypes has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: 12 other methods here (search.initSearch, search.initSearch::getItemsBefore, search.initSearch::getNextElem, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 13 times rather than 13 independent problems. Splitting this body alone leaves the other 12 exactly as they are. Where these are variations on one operation, the change that clears all 13 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":3353}}}],"partialFingerprints":{"codehealthFindingId/v1":"631124cd9c98eba4e79af07417aed5f6e3bb9d5cadf5a91443a3b2ac4d005b1c"}},{"ruleId":"D1","level":"warning","message":{"text":"tester.valueCheck (cyclomatic 23): tester.valueCheck has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustdoc-js/tester.js"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ed368d71b8b5d4b5563919968eaf3ed6545c5197df991390315ef0337508fd4"}},{"ruleId":"D1","level":"warning","message":{"text":"initSearch::execQuery::unifyGenericTypes (cyclomatic 23): initSearch::execQuery::unifyGenericTypes has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":3353}}}],"partialFingerprints":{"codehealthFindingId/v1":"707c7d33cf7a757b4115adec4704f7b5ba5709c063806f550c8ca8e7d7414095"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_attr_parsing::attributes::doc::parse_notable_trait (cyclomatic 22): rustc_attr_parsing::attributes::doc::parse_notable_trait 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":"compiler/rustc_attr_parsing/src/attributes/doc.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"a51ef1476d37d0cb1a022ce94bade8b741ddeace342ba713b9211c99ca6415c0"}},{"ruleId":"D1","level":"warning","message":{"text":"MirBorrowckCtxt::describe_place_with_options (cyclomatic 22): MirBorrowckCtxt::describe_place_with_options has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/diagnostics/mod.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab249c2d9fbd725f9e698ae0bc7ec85f2bfd1d7862063a0bbb7c983511170044"}},{"ruleId":"D1","level":"warning","message":{"text":"MirBorrowckCtxt::explain_impl_static_obligation (cyclomatic 22): MirBorrowckCtxt::explain_impl_static_obligation 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":"compiler/rustc_borrowck/src/diagnostics/region_errors.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"394af3bf418bdb151b88305d16321c172d2a7a96ae0ddc12954e4c246313594d"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_codegen_cranelift::scripts::filter_profile::main (cyclomatic 22): rustc_codegen_cranelift::scripts::filter_profile::main 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":"compiler/rustc_codegen_cranelift/scripts/filter_profile.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cec5e8be6818fc4abcf011dfa72ecad700bd8bff8b5b7e9aa20e43672cc4d43"}},{"ruleId":"D1","level":"warning","message":{"text":"FunctionCx::codegen_argument (cyclomatic 22): FunctionCx::codegen_argument has cyclomatic complexity 22 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/mir/block.rs"},"region":{"startLine":1976}}}],"partialFingerprints":{"codehealthFindingId/v1":"0756a9726283bddfb7dd41f0944e28ac8f778b64dbfe7f5a6691d2914c3bbe72"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_codegen_ssa::back::link::link_rlib (cyclomatic 22): rustc_codegen_ssa::back::link::link_rlib 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":"compiler/rustc_codegen_ssa/src/back/link.rs"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"23065eaefa97afe4c9f4a7e104412b90c8c4928033b97450671e3afd6e33eb8a"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_codegen_ssa::back::link::add_order_independent_options (cyclomatic 22): rustc_codegen_ssa::back::link::add_order_independent_options has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/back/link.rs"},"region":{"startLine":3247}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e82b3b5bc48dee05caed50a97bfafe13080ed944c01145fc07661779623b536"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_codegen_ssa::back::link::get_apple_sdk_root (cyclomatic 22): rustc_codegen_ssa::back::link::get_apple_sdk_root has cyclomatic complexity 22 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/back/link.rs"},"region":{"startLine":4056}}}],"partialFingerprints":{"codehealthFindingId/v1":"a068c89f578ff133f8612bcf79b33deb7b05e5f92ecdccfa59852c97fcb209fd"}},{"ruleId":"D1","level":"warning","message":{"text":"InterpCx::eval_terminator (cyclomatic 22): InterpCx::eval_terminator 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":"compiler/rustc_const_eval/src/interpret/step.rs"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"8435e49bb119bee87e1bbf06afe5b9a56b5ae9479e3d7b6013fb209772b5b258"}},{"ruleId":"D1","level":"warning","message":{"text":"ConstraintContext::add_constraints_from_ty (cyclomatic 22): ConstraintContext::add_constraints_from_ty has cyclomatic complexity 22 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/variance/constraints.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"194d5cd93bb6bc9e10107579869608f6c5752438576afe75a0d41192ab4525bf"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_hir_analysis::check::bounds_from_generic_clauses (cyclomatic 22): rustc_hir_analysis::check::bounds_from_generic_clauses 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":"compiler/rustc_hir_analysis/src/check/mod.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"d61d6956d612da4372ffec0d26e24ae073d655524857056595b95e8180805028"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_hir_analysis::check::check::check_opaque_precise_captures (cyclomatic 22): rustc_hir_analysis::check::check::check_opaque_precise_captures 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":"compiler/rustc_hir_analysis/src/check/check.rs"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"60d197f25339a759857be9cff7cc1ffe374537d890880c7b61fa1732613741a7"}},{"ruleId":"D1","level":"warning","message":{"text":"ExprUseVisitor::cat_pattern (cyclomatic 22): ExprUseVisitor::cat_pattern has cyclomatic complexity 22 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/expr_use_visitor.rs"},"region":{"startLine":1590}}}],"partialFingerprints":{"codehealthFindingId/v1":"1392df860c64fb862835d41167cf75431cc94e2f40b1241b972393ca63f9b8da"}},{"ruleId":"D1","level":"warning","message":{"text":"FnCtxt::report_binop_fulfillment_errors (cyclomatic 22): FnCtxt::report_binop_fulfillment_errors has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: rustc_hir_typeck::op::lang_item_for_binop (cyclomatic 27) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/op.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3b185a35ca64b2119426f70b095cafbedd77a4483f068a2752ddb976da7070a"}},{"ruleId":"D1","level":"warning","message":{"text":"FnCtxt::emit_err_pat_wrong_number_of_fields (cyclomatic 22): FnCtxt::emit_err_pat_wrong_number_of_fields has cyclomatic complexity 22 (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":"compiler/rustc_hir_typeck/src/pat.rs"},"region":{"startLine":1895}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9cbba704b2f406c1733b108411a4ac21d9ea1ec5927a7d59d4887a03e3532c0"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_interface::passes::write_out_deps (cyclomatic 22): rustc_interface::passes::write_out_deps has cyclomatic complexity 22 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 1 belongs 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":"compiler/rustc_interface/src/passes.rs"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"d16caa56587cbaa976bb1686862cfe46f38cae1f85a1b361e8acffb76e6f6c6f"}},{"ruleId":"D1","level":"warning","message":{"text":"PrettyPrinter::pretty_print_const_expr (cyclomatic 22): PrettyPrinter::pretty_print_const_expr has cyclomatic complexity 22 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/ty/print/pretty.rs"},"region":{"startLine":1624}}}],"partialFingerprints":{"codehealthFindingId/v1":"c27f53cf44b040547c4541fa7cfc3a75e74a90f6e53a84b9cb193587893ad5ba"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_middle::mir::pretty::pretty_print_const_value_tcx (cyclomatic 22): rustc_middle::mir::pretty::pretty_print_const_value_tcx 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":"compiler/rustc_middle/src/mir/pretty.rs"},"region":{"startLine":1928}}}],"partialFingerprints":{"codehealthFindingId/v1":"409e76cca5640ffe0b6e6ea47f97f5a992ad4e7c586b2db4bcf4f9723334d80e"}},{"ruleId":"D1","level":"warning","message":{"text":"TailCallCkVisitor::check_tail_call (cyclomatic 22): TailCallCkVisitor::check_tail_call has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: rustc_mir_build::check_tail_calls::op_trait_as_method_name (cyclomatic 25) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_build/src/check_tail_calls.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb3cfbafee7a042e4349f0f2fbe6bd66ccb2c37e40c7041ed663566f03d9d9ee"}},{"ruleId":"D1","level":"warning","message":{"text":"CostChecker::visit_terminator (cyclomatic 22): CostChecker::visit_terminator 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":"compiler/rustc_mir_transform/src/cost_checker.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"925b5c901149c05c12f3935e3d415d3b038454fb65e583f0a49e7b8cd384df50"}},{"ruleId":"D1","level":"warning","message":{"text":"VnState::project (cyclomatic 22): VnState::project has cyclomatic complexity 22 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/gvn.rs"},"region":{"startLine":822}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f0c3e6c4d215914134d60cd2ae22d97426c56143c74b85097fc24308f648cde"}},{"ruleId":"D1","level":"warning","message":{"text":"VnState::simplify_cast (cyclomatic 22): VnState::simplify_cast 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":"compiler/rustc_mir_transform/src/gvn.rs"},"region":{"startLine":1565}}}],"partialFingerprints":{"codehealthFindingId/v1":"91c7d4a911c05c3c46b4cf5c9bbd817cc6a994b3de5883cf2e12baf9865afd7e"}},{"ruleId":"D1","level":"warning","message":{"text":"Integrator::visit_terminator (cyclomatic 22): Integrator::visit_terminator has cyclomatic complexity 22 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/inline.rs"},"region":{"startLine":1274}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae4656c2eecb841cdcf15c1a754ecf045d0e7912b33bc2a82459b09bab743384"}},{"ruleId":"D1","level":"warning","message":{"text":"MirUsedCollector::visit_terminator (cyclomatic 22): MirUsedCollector::visit_terminator has cyclomatic complexity 22 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_monomorphize/src/collector.rs"},"region":{"startLine":822}}}],"partialFingerprints":{"codehealthFindingId/v1":"a72847a75d73b6a9175227ed481086dc65e8ac8e620b1b3ab980f96d59747075"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::parse_param_general (cyclomatic 22): Parser::parse_param_general 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":"compiler/rustc_parse/src/parser/function.rs"},"region":{"startLine":737}}}],"partialFingerprints":{"codehealthFindingId/v1":"e969c7a16dd551f7794131ef8622803536ca458e8b2e84d4473553bb4abc4e38"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::format (cyclomatic 22): Parser::format has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse_format/src/lib.rs"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"236d9cc147eb7721d19a70df53c1b711a839a397e20b564d92c5e381087f9487"}},{"ruleId":"D1","level":"warning","message":{"text":"Constructor::fmt_fields (cyclomatic 22): Constructor::fmt_fields has cyclomatic complexity 22 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_pattern_analysis/src/constructor.rs"},"region":{"startLine":889}}}],"partialFingerprints":{"codehealthFindingId/v1":"64c6e45c9a7af1b7038d8f3c467fd8544de7f1d42d16d28eb9e639bef2b2ed66"}},{"ruleId":"D1","level":"warning","message":{"text":"LateResolutionVisitor::detect_missing_turbofish (cyclomatic 22): LateResolutionVisitor::detect_missing_turbofish 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":"compiler/rustc_resolve/src/late/diagnostics.rs"},"region":{"startLine":1830}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cc786ed6e4149634fe8b48962cb6c526b35fae35133298e7ce94d1eaa0aed27"}},{"ruleId":"D1","level":"warning","message":{"text":"V0SymbolMangler::print_const (cyclomatic 22): V0SymbolMangler::print_const has cyclomatic complexity 22 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_symbol_mangling/src/v0.rs"},"region":{"startLine":771}}}],"partialFingerprints":{"codehealthFindingId/v1":"02108a35e6b76f6c2a2f98c8cf5bada741299cd7cb0bec3d1d0923d54c2143cc"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_target::callconv::mips64::classify_arg (cyclomatic 22): rustc_target::callconv::mips64::classify_arg 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":"compiler/rustc_target/src/callconv/mips64.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"a91b8f4082abeb712950ee03d408f5736bf16936efe4dfe473a29e370dac14b8"}},{"ruleId":"D1","level":"warning","message":{"text":"AddLifetimeParamsSuggestion::add_to_diag (cyclomatic 22): AddLifetimeParamsSuggestion::add_to_diag 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":"compiler/rustc_trait_selection/src/diagnostics.rs"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b703315cad626459a83820861233b6b5e59fddb6d974e5622359bc9c0111f64"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_trait_selection::traits::const_evaluatable::is_const_evaluatable (cyclomatic 22): rustc_trait_selection::traits::const_evaluatable::is_const_evaluatable 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":"compiler/rustc_trait_selection/src/traits/const_evaluatable.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"acc9cf2f2341c4aa4aa9fc3bffdf6315ca4e84ea90bcd26f50e253c1062e7312"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_ty_utils::abi::arg_attrs_for_rust_scalar (cyclomatic 22): rustc_ty_utils::abi::arg_attrs_for_rust_scalar 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":"compiler/rustc_ty_utils/src/abi.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa911d02c13d1d36096402c6cafdfdcf4a1cace5012714cd86794d3c735661f3"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_type_ir::walk::push_inner (cyclomatic 22): rustc_type_ir::walk::push_inner has cyclomatic complexity 22 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_type_ir/src/walk.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc918db52af8405f547c5bfb4631a24f1b7da80fbc7a3463f42d087d1ed9ac1f"}},{"ruleId":"D1","level":"warning","message":{"text":"core::num::imp::dec2flt::decimal_seq::parse_decimal_seq (cyclomatic 22): core::num::imp::dec2flt::decimal_seq::parse_decimal_seq 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":"library/core/src/num/imp/dec2flt/decimal_seq.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7aaedf2b1ff93c9993fff24bd1c68ca2c5e285072e72adb644b7d9140807ac0"}},{"ruleId":"D1","level":"warning","message":{"text":"Mode::fmt (cyclomatic 22): Mode::fmt has cyclomatic complexity 22 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/fs/unix.rs"},"region":{"startLine":1819}}}],"partialFingerprints":{"codehealthFindingId/v1":"8562a86888dfd621c7eb676ae5cb551c97c5a940edcf14037d24ecb7e25ea30b"}},{"ruleId":"D1","level":"warning","message":{"text":"assert_instr_macro::assert_instr (cyclomatic 22): assert_instr_macro::assert_instr 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":"library/stdarch/crates/assert-instr-macro/src/lib.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb5d0e2b30d19c1763fc26f6f377234edf15ff85a6b9920af8283bf528f79ffb"}},{"ruleId":"D1","level":"warning","message":{"text":"stdarch_gen_hexagon::scalar::parse_header (cyclomatic 22): stdarch_gen_hexagon::scalar::parse_header 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":"library/stdarch/crates/stdarch-gen-hexagon/src/scalar.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c2c8b4eb253527db0af2380de758ee88bf6303d4a9efffa2c3c6f8c593c0642"}},{"ruleId":"D1","level":"warning","message":{"text":"RustdocVisitor::visit_item_inner (cyclomatic 22): RustdocVisitor::visit_item_inner has cyclomatic complexity 22 (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/librustdoc/visit_ast.rs"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3a0088266b20af190d69b07ac583ef8ac7649a815b435e59ab68bac8688481c"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_dev::fmt::fmt_conf (cyclomatic 22): clippy_dev::fmt::fmt_conf has cyclomatic complexity 22 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_dev/src/fmt.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"630db2989720727a44756ab13c9bdecfafc0872a00706ec053eb7b869469ca41"}},{"ruleId":"D1","level":"warning","message":{"text":"PatState::add_pat (cyclomatic 22): PatState::add_pat has cyclomatic complexity 22 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/matches/single_match.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"38cf17cc66875f131bcb823d6e24fc6d804c1ecc65a70b54986297143088d55f"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::functions::misnamed_getters::check_fn (cyclomatic 22): clippy_lints::functions::misnamed_getters::check_fn 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":"src/tools/clippy/clippy_lints/src/functions/misnamed_getters.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b100fe17e3a07c808840a6e6aa179332be051f6fae2f932bd6ce2287f5ce588"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::implicit_saturating_sub::check_with_condition (cyclomatic 22): clippy_lints::implicit_saturating_sub::check_with_condition 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":"src/tools/clippy/clippy_lints/src/implicit_saturating_sub.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"5264e0aa86f38880da49b33d0f8b61ed9ff9476b7e5f3e06aef4f03dce26e11f"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_utils::capture_local_usage (cyclomatic 22): clippy_utils::capture_local_usage has cyclomatic complexity 22 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. 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/tools/clippy/clippy_utils/src/lib.rs"},"region":{"startLine":859}}}],"partialFingerprints":{"codehealthFindingId/v1":"93604abc4bb2b7ebce4d47acf721467a7635257d60f3d59af2bded0a24dd6ae4"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_utils::visitors::for_each_unconsumed_temporary::helper (cyclomatic 22): clippy_utils::visitors::for_each_unconsumed_temporary::helper has cyclomatic complexity 22 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_utils/src/visitors.rs"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"d681fee9b291b5036b611832d13d1ec78aa7411d624475457e9d33bfa6889213"}},{"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":"src/tools/miri/priroda/src/debugger.rs"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"c76a1ad32aef65415ed427cb07f4658950ea3b5abe6f048c26927b458d1b62f2"}},{"ruleId":"D1","level":"warning","message":{"text":"SourceToDefCtx::container_to_def (cyclomatic 22): SourceToDefCtx::container_to_def 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":"src/tools/rust-analyzer/crates/hir/src/semantics/source_to_def.rs"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"79ed2b9af28a5f3865d99c5199120f6d03ced84fe585546363aadd480014cf6a"}},{"ruleId":"D1","level":"warning","message":{"text":"Resolver::resolve_path_in_type_ns_with_prefix_info (cyclomatic 22): Resolver::resolve_path_in_type_ns_with_prefix_info 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":"src/tools/rust-analyzer/crates/hir-def/src/resolver.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"313c57b5654c714f090a10d6e0caec35ad5eba1be9d62a43ccd780b73c23009e"}},{"ruleId":"D1","level":"warning","message":{"text":"hir_def::expr_store::lower::lower_body (cyclomatic 22): hir_def::expr_store::lower::lower_body 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":"src/tools/rust-analyzer/crates/hir-def/src/expr_store/lower.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"d36264f60ef97ca6e1b4a4597903b324d54801d9ac90cb3170e808ad716ec300"}},{"ruleId":"D1","level":"warning","message":{"text":"TyLoweringContext::lower_ty_ext (cyclomatic 22): TyLoweringContext::lower_ty_ext has cyclomatic complexity 22 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/lower.rs"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaa47ebcca99496b96ea7ce8d6d0aa5a9e7fdd708add92ddcba98e686991fb5c"}},{"ruleId":"D1","level":"warning","message":{"text":"Evaluator::create_memory_map::rec (cyclomatic 22): Evaluator::create_memory_map::rec has cyclomatic complexity 22 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/mir/eval.rs"},"region":{"startLine":2223}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fa1903a889d9443287d093c8b16fc57ad4b647d01385410a57ad4a64e9fe08a"}},{"ruleId":"D1","level":"warning","message":{"text":"ide::goto_definition::goto_definition (cyclomatic 22): ide::goto_definition::goto_definition 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":"src/tools/rust-analyzer/crates/ide/src/goto_definition.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"da7404555dc010c24bdfc05cc61f67718fed0c85685cec4f20b561535d59530a"}},{"ruleId":"D1","level":"warning","message":{"text":"ide::inlay_hints::bind_pat::hints (cyclomatic 22): ide::inlay_hints::bind_pat::hints 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":"src/tools/rust-analyzer/crates/ide/src/inlay_hints/bind_pat.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1a892b0a944da8a34594825e7ff5a89474f5e4bf2d5bb53d5305e7f8ae323e3"}},{"ruleId":"D1","level":"warning","message":{"text":"ide::join_lines::remove_newline (cyclomatic 22): ide::join_lines::remove_newline 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":"src/tools/rust-analyzer/crates/ide/src/join_lines.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f2cbe59d1642e99de6d15ddb3bc1e554066c1eb06b20110277a1c2935336545"}},{"ruleId":"D1","level":"warning","message":{"text":"ide_assists::handlers::add_turbo_fish::add_turbo_fish (cyclomatic 22): ide_assists::handlers::add_turbo_fish::add_turbo_fish 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":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/add_turbo_fish.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"c29c19a1f3468c5fc9d4d1fca19942e0fadb9ea5fa3691cdc11465d3e0a22dc1"}},{"ruleId":"D1","level":"warning","message":{"text":"ide_completion::completions::use_::complete_use_path (cyclomatic 22): ide_completion::completions::use_::complete_use_path 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":"src/tools/rust-analyzer/crates/ide-completion/src/completions/use_.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bcb693ce5470d6e0b886c1ba800c1d4014fe55728272273b09fa48f6bbf4f15"}},{"ruleId":"D1","level":"warning","message":{"text":"ide_completion::context::analysis::analyze (cyclomatic 22): ide_completion::context::analysis::analyze 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":"src/tools/rust-analyzer/crates/ide-completion/src/context/analysis.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"73e3eec753239bf09dc88af9536836ca61805d5ba3b70a0604b25bd74836f525"}},{"ruleId":"D1","level":"warning","message":{"text":"mbe::expander::matcher::match_loop (cyclomatic 22): mbe::expander::matcher::match_loop 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":"src/tools/rust-analyzer/crates/mbe/src/expander/matcher.rs"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"e59ca1bc5134893d5c800723eb5cdb2b6c9e4e404cbd726b33d0e66047a4b3d2"}},{"ruleId":"D1","level":"warning","message":{"text":"parser::grammar::expressions::atom::parse_asm_expr (cyclomatic 22): parser::grammar::expressions::atom::parse_asm_expr 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":"src/tools/rust-analyzer/crates/parser/src/grammar/expressions/atom.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2be0549cb50a49c155900275c319462083d831f3639a3ad4c18b7d3279ed868"}},{"ruleId":"D1","level":"warning","message":{"text":"Reader::read_subtree (cyclomatic 22): Reader::read_subtree 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":"src/tools/rust-analyzer/crates/proc-macro-api/src/legacy_protocol/msg/flat.rs"},"region":{"startLine":759}}}],"partialFingerprints":{"codehealthFindingId/v1":"23dc13eff9c3c196c3a756547aff1b35dddb57853c6860a8b931d26495daf4e5"}},{"ruleId":"D1","level":"warning","message":{"text":"GlobalState::current_status (cyclomatic 22): GlobalState::current_status 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":"src/tools/rust-analyzer/crates/rust-analyzer/src/reload.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"81d095474fab62493642e908e752e97c20b451ace5f283365f8de5054dd2d626"}},{"ruleId":"D1","level":"warning","message":{"text":"FmtVisitor::close_block (cyclomatic 22): FmtVisitor::close_block 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":"src/tools/rustfmt/src/visitor.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8b0278ec8230673ed9da4b3239b2f96eac5e4901b42b9852d9b86c765d7e5a7"}},{"ruleId":"D1","level":"warning","message":{"text":"DocSearch.execQuery::transformResults (cyclomatic 22): DocSearch.execQuery::transformResults has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: 5 other methods here (DocSearch.execQuery::buildHrefAndPath, DocSearch.execQuery::formatDisplayTypeSignature::writeFn, DocSearch.execQuery::unifyFunctionTypes, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 6 times rather than 6 independent problems. Splitting this body alone leaves the other 5 exactly as they are. Where these are variations on one operation, the change that clears all 6 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":2694}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fa768e71dc734b62f3201c8a5c605c50b03a7e275ec63b5d425472b1d69c85c"}},{"ruleId":"D1","level":"warning","message":{"text":"search.initSearch::transformResults (cyclomatic 22): search.initSearch::transformResults has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: 12 other methods here (search.initSearch, search.initSearch::getItemsBefore, search.initSearch::getNextElem, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 13 times rather than 13 independent problems. Splitting this body alone leaves the other 12 exactly as they are. Where these are variations on one operation, the change that clears all 13 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":2694}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd19fcaf6763f3b9bc2fb34b1d9a60406a849cba05825ce66975474e49e912b4"}},{"ruleId":"D1","level":"warning","message":{"text":"initSearch::execQuery::transformResults (cyclomatic 22): initSearch::execQuery::transformResults 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":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":2694}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb1c6bab838939e90e53127aabbc7241e6972c3e57c8ce944abd63ed5b2a5bc3"}},{"ruleId":"D1","level":"warning","message":{"text":"Reg::llvm_type (cyclomatic 21): Reg::llvm_type has cyclomatic complexity 21 (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":"compiler/rustc_codegen_llvm/src/abi.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"3373211c907424999ecd2f2955d0eabd12244c4149610e441dfceb1c7f1a7a4d"}},{"ruleId":"D1","level":"warning","message":{"text":"LoweringContext::lower_qpath (cyclomatic 21): LoweringContext::lower_qpath has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ast_lowering/src/path.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ca0541ae7c41e4ab86759ff3ffeb8a6de0b64eb2cf6a52f08b8c73b41652b66"}},{"ruleId":"D1","level":"warning","message":{"text":"SanitizeParser::convert (cyclomatic 21): SanitizeParser::convert has cyclomatic complexity 21 (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":"compiler/rustc_attr_parsing/src/attributes/codegen_attrs.rs"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdced4c610bfaedeff0bf50f7fe7400717ba3780c0f0053dbfc15f6c683f429b"}},{"ruleId":"D1","level":"warning","message":{"text":"DeprecatedParser::convert (cyclomatic 21): DeprecatedParser::convert has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_attr_parsing/src/attributes/deprecation.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"def65b5bede974ab595ed3f56a46a7bf4d0adac7e73bc18ac3363156d02b3659"}},{"ruleId":"D1","level":"warning","message":{"text":"MirBorrowckCtxt::suggest_map_index_mut_alternatives (cyclomatic 21): MirBorrowckCtxt::suggest_map_index_mut_alternatives has cyclomatic complexity 21 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 3 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":"compiler/rustc_borrowck/src/diagnostics/mutability_errors.rs"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a21a3bd6667b77a6a416da527db841a12be1d39f49d6d31b4fb7df05cefc624"}},{"ruleId":"D1","level":"warning","message":{"text":"MirBorrowckCtxt::consume_rvalue (cyclomatic 21): MirBorrowckCtxt::consume_rvalue has cyclomatic complexity 21 (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":"compiler/rustc_borrowck/src/lib.rs"},"region":{"startLine":1475}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a490ccea63ad5d0d7eb0d3b8d02a4f4de1abbc36cdf9bc008130c0cb64183d5"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_builtin_macros::concat::expand_concat (cyclomatic 21): rustc_builtin_macros::concat::expand_concat has cyclomatic complexity 21 (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":"compiler/rustc_builtin_macros/src/concat.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cf7cbb69045f453d8c3d9ef822dd4686ef925653b68ada27106c5bcaf409534"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_builtin_macros::format::report_invalid_references (cyclomatic 21): rustc_builtin_macros::format::report_invalid_references has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_builtin_macros/src/format.rs"},"region":{"startLine":984}}}],"partialFingerprints":{"codehealthFindingId/v1":"c10a7b78b69544ae2a37b2ab647eb8caa6a5436b1410f58bd67fc1fd7419cf75"}},{"ruleId":"D1","level":"warning","message":{"text":"ConfigInfo::parse_argument (cyclomatic 21): ConfigInfo::parse_argument has cyclomatic complexity 21 (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":"compiler/rustc_codegen_gcc/build_system/src/config.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d3630fbf7c318c97db3af5b7a6ebae6c291670709b7a02e368607048bbcd3b8"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_codegen_cranelift::constant::codegen_const_value (cyclomatic 21): rustc_codegen_cranelift::constant::codegen_const_value has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/src/constant.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c8d654e29487b87d869a21359b17b50c8a602d4000ff47e4673ff39b83a3a14"}},{"ruleId":"D1","level":"warning","message":{"text":"Builder::load_operand (cyclomatic 21): Builder::load_operand has cyclomatic complexity 21 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 8 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":"compiler/rustc_codegen_llvm/src/builder.rs"},"region":{"startLine":738}}}],"partialFingerprints":{"codehealthFindingId/v1":"4619d8bd99c8fda7a2d0292f4051829fe824086b5bceae17e988497e2cb6b5ca"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_codegen_llvm::builder::autodiff::match_args_from_caller_to_enzyme (cyclomatic 21): rustc_codegen_llvm::builder::autodiff::match_args_from_caller_to_enzyme has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/builder/autodiff.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dc2826808672fafaec3d8504354e53a79755ce8b591c14d1d03b3af95a39902"}},{"ruleId":"D1","level":"warning","message":{"text":"ArArchiveBuilder::build_inner (cyclomatic 21): ArArchiveBuilder::build_inner has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/back/archive.rs"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec1e6bb5854d82a7902d3f6209d7d46686db5bf398f5d76dc2651db9e4e98315"}},{"ruleId":"D1","level":"warning","message":{"text":"FunctionCx::codegen_switchint_terminator (cyclomatic 21): FunctionCx::codegen_switchint_terminator has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/mir/block.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"5521356e244fbd842e0e725fce0c7034a16209a4345307a1919756413c043710"}},{"ruleId":"D1","level":"warning","message":{"text":"OperandRef::codegen_get_discr (cyclomatic 21): OperandRef::codegen_get_discr has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/mir/operand.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ff060ba62667bdc863d8a00b49a901bc38acd0c49e878c61c88b814a8c182ea"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_codegen_ssa::target_features::from_target_feature_attr (cyclomatic 21): rustc_codegen_ssa::target_features::from_target_feature_attr has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/target_features.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"84d1ccc4482d5aa83d8f3ff89944d559364818d041f80be419a428e6eafe944f"}},{"ruleId":"D1","level":"warning","message":{"text":"InterpCx::eval_rvalue_into_place (cyclomatic 21): InterpCx::eval_rvalue_into_place has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_const_eval/src/interpret/step.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4f9468d47f710496be9de753a561921bf27210701546ddb3d7a634dad6d85a2"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_const_eval::const_eval::valtrees::const_to_valtree_inner (cyclomatic 21): rustc_const_eval::const_eval::valtrees::const_to_valtree_inner has cyclomatic complexity 21 (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":"compiler/rustc_const_eval/src/const_eval/valtrees.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c33e5b21aafff9cc10495e9ebcb208d3de9d91f7b7991e81cdfdbbabf804ef2"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_expand::expand::parse_ast_fragment (cyclomatic 21): rustc_expand::expand::parse_ast_fragment has cyclomatic complexity 21 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_expand/src/expand.rs"},"region":{"startLine":1077}}}],"partialFingerprints":{"codehealthFindingId/v1":"33036d5a53b07247cb4ede3c9a6b4ebd2eb8dda0452ff7f9e66ed4ee13bd4793"}},{"ruleId":"D1","level":"warning","message":{"text":"InherentOverlapChecker::check_item (cyclomatic 21): InherentOverlapChecker::check_item has cyclomatic complexity 21 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/coherence/inherent_impls_overlap.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"072d55a7f063c6cbe52267a20f99b98d43ebc45a722ac467c5a19e62e602c0cf"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_hir_analysis::check::check::opaque_type_cycle_error (cyclomatic 21): rustc_hir_analysis::check::check::opaque_type_cycle_error has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/check/check.rs"},"region":{"startLine":2190}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb70a00aba7f6ca8913df27c440464c69f7701e04b36a6fe1196a2bf46d274c2"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_hir_analysis::check::entry::check_main_fn_ty (cyclomatic 21): rustc_hir_analysis::check::entry::check_main_fn_ty has cyclomatic complexity 21 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 9 belong to 5 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/check/entry.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"904e437a3bb4bb6fc74760879fc6b44b0813f92f39ce5ebb064bfbe193369669"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_hir_analysis::hir_ty_lowering::errors::prohibit_assoc_item_constraint (cyclomatic 21): rustc_hir_analysis::hir_ty_lowering::errors::prohibit_assoc_item_constraint has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/hir_ty_lowering/errors.rs"},"region":{"startLine":1569}}}],"partialFingerprints":{"codehealthFindingId/v1":"17afcdeab4f436a506600aa33371700e24a0875554aed6fbb90276ebde4e5dc1"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_hir_analysis::hir_ty_lowering::generics::generic_arg_mismatch_err (cyclomatic 21): rustc_hir_analysis::hir_ty_lowering::generics::generic_arg_mismatch_err has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/hir_ty_lowering/generics.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5448a17417ad149a6087bfd255a3d0c1eeaa0d26e5a648035df1404b6c773f9"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_hir_analysis::hir_ty_lowering::generics::check_generic_arg_count (cyclomatic 21): rustc_hir_analysis::hir_ty_lowering::generics::check_generic_arg_count has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/hir_ty_lowering/generics.rs"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"68fa60eab5f79fe404e6f5715b45fc4296909e25db9d47a330a1444c583a3908"}},{"ruleId":"D1","level":"warning","message":{"text":"FnCtxt::try_find_coercion_lub (cyclomatic 21): FnCtxt::try_find_coercion_lub has cyclomatic complexity 21 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/coercion.rs"},"region":{"startLine":1380}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfb7b8ea6a3497e4d89c2a07feaede1e168d09647809954bc91d32f876b4e031"}},{"ruleId":"D1","level":"warning","message":{"text":"FnCtxt::probe_op (cyclomatic 21): FnCtxt::probe_op has cyclomatic complexity 21 (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":"compiler/rustc_hir_typeck/src/method/probe.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"9731dcb241f7ea45375b5d4d828ea02d0f306c3e0524d1e5d197207101ad5694"}},{"ruleId":"D1","level":"warning","message":{"text":"FnCtxt::suggest_method_not_found_because_of_unsatisfied_bounds (cyclomatic 21): FnCtxt::suggest_method_not_found_because_of_unsatisfied_bounds has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/method/suggest.rs"},"region":{"startLine":1132}}}],"partialFingerprints":{"codehealthFindingId/v1":"69dcf137a8bb54b532277c199198dd70f32fa7ec8cc19d961cf44044cfb6dc58"}},{"ruleId":"D1","level":"warning","message":{"text":"FnCtxt::borrow_pat_suggestion (cyclomatic 21): FnCtxt::borrow_pat_suggestion has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/pat.rs"},"region":{"startLine":1374}}}],"partialFingerprints":{"codehealthFindingId/v1":"fec03a1ae31608ef506d7c6e525b11aaeda537022dbc13c0e0ce7512f0df290b"}},{"ruleId":"D1","level":"warning","message":{"text":"FnCtxt::check_struct_pat_fields (cyclomatic 21): FnCtxt::check_struct_pat_fields has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/pat.rs"},"region":{"startLine":2088}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c872f765e400f0c0b9b6cb741534373fada9af5ccab53bea10241a15570e1e3"}},{"ruleId":"D1","level":"warning","message":{"text":"Resolver::finalize_macro_resolutions (cyclomatic 21): Resolver::finalize_macro_resolutions has cyclomatic complexity 21 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/macros.rs"},"region":{"startLine":907}}}],"partialFingerprints":{"codehealthFindingId/v1":"844f4e75cfe3b305652096d91b0c8e638723a0db1ea2e1790e60e9bfd72a56a1"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_metadata::rmeta::decoder::cstore_impl::provide (cyclomatic 21): rustc_metadata::rmeta::decoder::cstore_impl::provide has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_metadata/src/rmeta/decoder/cstore_impl.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ff3e3bfdeb7ae91ecda0687ef5514ce8d0bc0e0f0f983697d71281cc63e20a7"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_middle::mir::pretty::write_scope_tree (cyclomatic 21): rustc_middle::mir::pretty::write_scope_tree has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/mir/pretty.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"d73a577c866082b8423d934979dafdd7be5491ca3ce22ca83a94fd971e37ee96"}},{"ruleId":"D1","level":"warning","message":{"text":"ReplacementVisitor::visit_statement (cyclomatic 21): ReplacementVisitor::visit_statement has cyclomatic complexity 21 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/sroa.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c8097de6bf95a596d1a76b6214fdbf9cb3ab6b07d838048ebbe726bec2dd86d"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_mir_transform::liveness::find_self_assignments (cyclomatic 21): rustc_mir_transform::liveness::find_self_assignments has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/liveness.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"b718d39d4492434924e98a03a9b1dc5337e142b8f06e7a77d984ee8906856e94"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::parameter_without_type (cyclomatic 21): Parser::parameter_without_type has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/diagnostics.rs"},"region":{"startLine":2001}}}],"partialFingerprints":{"codehealthFindingId/v1":"49fc6732d559a076cfde6669861589e9ac88fd1cafe34cf719ff0afcc5575f47"}},{"ruleId":"D1","level":"warning","message":{"text":"CheckAttrVisitor::check_repr (cyclomatic 21): CheckAttrVisitor::check_repr has cyclomatic complexity 21 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions. This is NOT this file\u0027s highest cyclomatic complexity: CheckAttrVisitor::check_one_parsed_attribute (cyclomatic 195) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_passes/src/check_attr.rs"},"region":{"startLine":966}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb9d67359058823ae21d9952f2d8bdee6040bac2f98b9381c76b31a23058ea16"}},{"ruleId":"D1","level":"warning","message":{"text":"MarkSymbolVisitor::visit_node (cyclomatic 21): MarkSymbolVisitor::visit_node has cyclomatic complexity 21 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_passes/src/dead.rs"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"322bef7eafc1999845486b29c0afba64914ba45fd200ee7cf780341abe7e2fc4"}},{"ruleId":"D1","level":"warning","message":{"text":"PathSource::descr_expected (cyclomatic 21): PathSource::descr_expected has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: PathSource::is_expected (cyclomatic 22) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/late.rs"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd4a7c41d26fd33d390869558bd4b12f7e7dd20c9ea06ad6037e2da7325b2658"}},{"ruleId":"D1","level":"warning","message":{"text":"SelectionContext::assemble_candidates_from_auto_impls (cyclomatic 21): SelectionContext::assemble_candidates_from_auto_impls has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: SelectionContext::assemble_candidates (cyclomatic 26) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/traits/select/candidate_assembly.rs"},"region":{"startLine":749}}}],"partialFingerprints":{"codehealthFindingId/v1":"01ff1b4c090d8ce3df728bda52747887e175e468410387981148c1570f0c3dcf"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_trait_selection::error_reporting::infer::nice_region_error::static_impl_trait::suggest_new_region_bound (cyclomatic 21): rustc_trait_selection::error_reporting::infer::nice_region_error::static_impl_trait::suggest_new_region_bound has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/error_reporting/infer/nice_region_error/static_impl_trait.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc78d71a79e80e8c962e5e9f811d58a09a1d28f6cf121c5a088b047ed332aaa1"}},{"ruleId":"D1","level":"warning","message":{"text":"core::str::validations::run_utf8_validation (cyclomatic 21): core::str::validations::run_utf8_validation has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/str/validations.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3b5fce7c79900bcf4c1d1be3c59dcc53210330bc460b91dc5fd5ed784c038a2"}},{"ruleId":"D1","level":"warning","message":{"text":"Sysroot::run (cyclomatic 21): Sysroot::run has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/build_steps/compile.rs"},"region":{"startLine":1946}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fe9322eb4a608551fd6c6dcff693de2fa7962435b2dba64bccc2a574a3b0dbb"}},{"ruleId":"D1","level":"warning","message":{"text":"Pgo::deserialize (cyclomatic 21): Pgo::deserialize has cyclomatic complexity 21 (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/bootstrap/src/core/config/toml/pgo.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"60a5c2037ce8d3c78ed46e282e0812ac13e6e682556cac03695a4ef1b69d0ae2"}},{"ruleId":"D1","level":"warning","message":{"text":"Type::is_doc_subtype_of (cyclomatic 21): Type::is_doc_subtype_of has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: PrimitiveType::as_sym (cyclomatic 29) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/clean/types.rs"},"region":{"startLine":1458}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c4a19abb49f3240435b4777128b85b1a013943a93321b33fae1648ee7b5d026"}},{"ruleId":"D1","level":"warning","message":{"text":"SerializedSearchIndex::sort (cyclomatic 21): SerializedSearchIndex::sort has cyclomatic complexity 21 (threshold 15). Of this number, 11 points are the body\u0027s own statements and 10 belong to one function item inside it that branches. To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/render/search_index.rs"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b5621d607cbd52ee3c6727cd415d33605c7e96ebd0619f7f1fc5ef8c09767b8"}},{"ruleId":"D1","level":"warning","message":{"text":"rustdoc::clean::clean_ty (cyclomatic 21): rustdoc::clean::clean_ty has cyclomatic complexity 21 (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/librustdoc/clean/mod.rs"},"region":{"startLine":1876}}}],"partialFingerprints":{"codehealthFindingId/v1":"c389c4a3bfb150fac9a79ad5662818f38595ff866a2aaabefb9a8d7de69c796d"}},{"ruleId":"D1","level":"warning","message":{"text":"Hir2Qmm::run (cyclomatic 21): Hir2Qmm::run has cyclomatic complexity 21 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 6 belong to one function item inside it that branches. 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/tools/clippy/clippy_lints/src/booleans.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"dba81b93564ceaaa57ce14abd42b4ae2040a507f73258693a72272e24af35854"}},{"ruleId":"D1","level":"warning","message":{"text":"PeekableVisitor::visit_expr (cyclomatic 21): PeekableVisitor::visit_expr has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/unused_peekable.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"91d2eadf16e1403dd523c4054c3c8bd60664ed6dc4fdae88d12f7a733459326f"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::doc::doc_paragraphs_missing_punctuation::is_missing_punctuation (cyclomatic 21): clippy_lints::doc::doc_paragraphs_missing_punctuation::is_missing_punctuation has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/doc/doc_paragraphs_missing_punctuation.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"b48e0018eb9ea6e7de167de5e40fc01350f9da7647bb40da603463bdd611aa7c"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::lifetimes::check_fn_inner (cyclomatic 21): clippy_lints::lifetimes::check_fn_inner has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/lifetimes.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"904f151335a66e4722f878dbddd0cb033f5cf5fab8dd47e575de8f261ca1e915"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::loops::while_let_on_iterator::needs_mutable_borrow (cyclomatic 21): clippy_lints::loops::while_let_on_iterator::needs_mutable_borrow has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/loops/while_let_on_iterator.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"328c7910ea59d3c29a453636c9c36bff0357f50f071b20636558f0bfcf1dec70"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::methods::unnecessary_map_or::check (cyclomatic 21): clippy_lints::methods::unnecessary_map_or::check has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/methods/unnecessary_map_or.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"050ce2f3dd46b422d365a768f7819afccf110c55db1295ce3e34401d64675847"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::operators::assign_op_pattern::check (cyclomatic 21): clippy_lints::operators::assign_op_pattern::check has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/operators/assign_op_pattern.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e89bc25d5a82c22e1e8577fda2d2083e4207e1803cec688653abb8d6f1dc931"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::operators::manual_div_ceil::check (cyclomatic 21): clippy_lints::operators::manual_div_ceil::check has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/operators/manual_div_ceil.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9e818849eb3b4104703044f47d533db70eefbc85c7ea42a3232e56a18fe1a1c"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::ranges::check_possible_range_contains (cyclomatic 21): clippy_lints::ranges::check_possible_range_contains has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/ranges.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"77456c1db170f6cf01a3f1316d9d81d12b1301c57c6161c311432d209a95739f"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_utils::paths::local_item_child_by_name (cyclomatic 21): clippy_utils::paths::local_item_child_by_name has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: clippy_utils::paths::find_primitive_impls (cyclomatic 22) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_utils/src/paths.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d9c17123c8e9842f31c93dd8dfafc28bf4cb6101ddf2f6b192bf7ae89ef15c6"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy::driver::main (cyclomatic 21): clippy::driver::main has cyclomatic complexity 21 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. 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/tools/clippy/src/driver.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"44691d4e9a2b5d44845aed53c291c4755f85be8ab79b363ade5b6a536d28ade9"}},{"ruleId":"D1","level":"warning","message":{"text":"hir::attrs::resolve_assoc_or_field (cyclomatic 21): hir::attrs::resolve_assoc_or_field has cyclomatic complexity 21 (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/tools/rust-analyzer/crates/hir/src/attrs.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"a155dc5426bd7345ee8b29f8159639694eb84884209539b1c820403e2dea6fb9"}},{"ruleId":"D1","level":"warning","message":{"text":"Printer::print_mod_item (cyclomatic 21): Printer::print_mod_item has cyclomatic complexity 21 (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/tools/rust-analyzer/crates/hir-def/src/item_tree/pretty.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb00dd99142d7b4fec4883f0f3b6fc89a06cb4e11f31765b1932631335657eee"}},{"ruleId":"D1","level":"warning","message":{"text":"hir_expand::builtin::fn_macro::concat_expand (cyclomatic 21): hir_expand::builtin::fn_macro::concat_expand has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: BuiltinFnLikeExpander::find_by_name (cyclomatic 22) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-expand/src/builtin/fn_macro.rs"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ba481ca846b5527a65684167abee97ecac3989aa81305f1e129148b229cd297"}},{"ruleId":"D1","level":"warning","message":{"text":"Context::add_constraints_from_ty (cyclomatic 21): Context::add_constraints_from_ty has cyclomatic complexity 21 (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/tools/rust-analyzer/crates/hir-ty/src/variance.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"1de8f3d9c62ab9ea26afde1f82f094aee3c703ca493964896513bf78e6304412"}},{"ruleId":"D1","level":"warning","message":{"text":"ide::hover::render::literal (cyclomatic 21): ide::hover::render::literal has cyclomatic complexity 21 (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/tools/rust-analyzer/crates/ide/src/hover/render.rs"},"region":{"startLine":849}}}],"partialFingerprints":{"codehealthFindingId/v1":"862605f737967a8081a868b2dd335e41198bc76f648b72a75f7c282ab1a8b68d"}},{"ruleId":"D1","level":"warning","message":{"text":"mbe::expander::matcher::match_meta_var (cyclomatic 21): mbe::expander::matcher::match_meta_var has cyclomatic complexity 21 (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/tools/rust-analyzer/crates/mbe/src/expander/matcher.rs"},"region":{"startLine":775}}}],"partialFingerprints":{"codehealthFindingId/v1":"332e222adedef6369cf98ef1dc24a36ef8b959ae245704b56285935b16249f25"}},{"ruleId":"D1","level":"warning","message":{"text":"Config::apply_change_with_sink (cyclomatic 21): Config::apply_change_with_sink has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: rust_analyzer::config::field_props (cyclomatic 49) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/config.rs"},"region":{"startLine":1209}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa7efa70b03826554c5f1194061517244d3377330eb8990757d03708cb595989"}},{"ruleId":"D1","level":"warning","message":{"text":"FlycheckActor::run (cyclomatic 21): FlycheckActor::run has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/flycheck.rs"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"3274e8f43c5989d5f50510073b3e436d37458091f0e02bc7a139e72cadcf44cb"}},{"ruleId":"D1","level":"warning","message":{"text":"rust_analyzer::handlers::request::handle_runnables (cyclomatic 21): rust_analyzer::handlers::request::handle_runnables has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/handlers/request.rs"},"region":{"startLine":1016}}}],"partialFingerprints":{"codehealthFindingId/v1":"c973d271693986d632d593e1a196d8d0d9ff071f628319bed52a2de6c6285327"}},{"ruleId":"D1","level":"warning","message":{"text":"rust_analyzer::handlers::request::run_rustfmt (cyclomatic 21): rust_analyzer::handlers::request::run_rustfmt has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/handlers/request.rs"},"region":{"startLine":2405}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ff007adf4fc57be390dd8ca79761c04cad13a111a990a5ab331584f86822a19"}},{"ruleId":"D1","level":"warning","message":{"text":"NotifyActor::run (cyclomatic 21): NotifyActor::run has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/vfs-notify/src/lib.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"f11ee168c89542073df30564451dea44fd1cc6343e1875c8e6b2270b99f06649"}},{"ruleId":"D1","level":"warning","message":{"text":"ControlFlow::rewrite_cond (cyclomatic 21): ControlFlow::rewrite_cond has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/expr.rs"},"region":{"startLine":981}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab267b0145b0bf3818596d66aec615a724973ccafe348354ce96a52f16e91e6d"}},{"ruleId":"D1","level":"warning","message":{"text":"UseTree::normalize (cyclomatic 21): UseTree::normalize has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/imports.rs"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ef9f3610781751976bdf000fe8acccdc6e29e646b0ef27aee3ae528b1374c92"}},{"ruleId":"D1","level":"warning","message":{"text":"Context::try_overflow_last_item (cyclomatic 21): Context::try_overflow_last_item has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/overflow.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"db824414361523153dcf3a3fdd7c6980ef22a3cf3f4c6539561bff7db8bd518b"}},{"ruleId":"D1","level":"warning","message":{"text":"rustfmt_nightly::comment::identify_comment (cyclomatic 21): rustfmt_nightly::comment::identify_comment has cyclomatic complexity 21 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 6 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":"src/tools/rustfmt/src/comment.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"f33b948a91e92cf10c4885aff1ac0c75647c34ac0756b90cfba975d253b54178"}},{"ruleId":"D1","level":"warning","message":{"text":"rustfmt_nightly::items::format_impl (cyclomatic 21): rustfmt_nightly::items::format_impl has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/items.rs"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecd187a046d3dec6f35ef3b4efad6952cdae01e3553f16720404f1b67466e983"}},{"ruleId":"D1","level":"warning","message":{"text":"RustBuild.download_toolchain (cyclomatic 21): RustBuild.download_toolchain has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/bootstrap.py"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"d346a7d293a688ea1da95282c90b4161ded1adf611fdd6372cb54483293d59db"}},{"ruleId":"D1","level":"warning","message":{"text":"PrefixTrie.substringMatches (cyclomatic 21): PrefixTrie.substringMatches has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/stringdex.js"},"region":{"startLine":1947}}}],"partialFingerprints":{"codehealthFindingId/v1":"46cc9549a6db40640ff43db8472f789c22ae5493b32e0cb557910abaded0c26d"}},{"ruleId":"D1","level":"warning","message":{"text":"loadDatabase::substringMatches (cyclomatic 21): loadDatabase::substringMatches has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/stringdex.js"},"region":{"startLine":1947}}}],"partialFingerprints":{"codehealthFindingId/v1":"daed7b8328c31c57cf88479a33422937341093820985470b41c69a746632fb06"}},{"ruleId":"D1","level":"warning","message":{"text":"LoweringContext::lower_fn_decl (cyclomatic 20): LoweringContext::lower_fn_decl has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: ImplTraitPosition::fmt (cyclomatic 21) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ast_lowering/src/lib.rs"},"region":{"startLine":1935}}}],"partialFingerprints":{"codehealthFindingId/v1":"9792f79c1489d4f58d2ede6f7f0c07f10480d6c4a89b65c98605a9c7fb544f9b"}},{"ruleId":"D1","level":"warning","message":{"text":"AstValidator::visit_fn (cyclomatic 20): AstValidator::visit_fn 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":"compiler/rustc_ast_passes/src/ast_validation.rs"},"region":{"startLine":1937}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6d35034a20ec6622c93b7bbc388baccb3acc8ee8138a6872ce44b429c23ac9e"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_builtin_macros::concat_bytes::expand_concat_bytes (cyclomatic 20): rustc_builtin_macros::concat_bytes::expand_concat_bytes has cyclomatic complexity 20 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_builtin_macros/src/concat_bytes.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d09196fbb73dec1eaa554fe15bfd259bfa14f642593d9b7a00b8f5a5a6ad3d1"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_builtin_macros::deriving::coerce_pointee::expand_derive_coerce_pointee (cyclomatic 20): rustc_builtin_macros::deriving::coerce_pointee::expand_derive_coerce_pointee 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":"compiler/rustc_builtin_macros/src/deriving/coerce_pointee.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c653f5aa699e3ffbe353cd5d676fefcfae137dfe0c037dc109fcf81b942f7d3"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_codegen_cranelift::num::codegen_float_binop (cyclomatic 20): rustc_codegen_cranelift::num::codegen_float_binop has cyclomatic complexity 20 (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":"compiler/rustc_codegen_cranelift/src/num.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"4908368019c84d2492099fad2104ad2998433eaf52ce744883c8fa39d71f9454"}},{"ruleId":"D1","level":"warning","message":{"text":"CodegenCx::codegen_static_item (cyclomatic 20): CodegenCx::codegen_static_item has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/consts.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"232670fe3769b13a77b07cac8fe870ae3a356b032c10d061e6de1f30ef6275bc"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_codegen_llvm::base::compile_codegen_unit::module_codegen (cyclomatic 20): rustc_codegen_llvm::base::compile_codegen_unit::module_codegen has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/base.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"824c375ed9e59954e9efa89b2d1d1337c5ca8782f19ceaaa94947149ab855872"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_codegen_llvm::llvm_util::configure_llvm (cyclomatic 20): rustc_codegen_llvm::llvm_util::configure_llvm has cyclomatic complexity 20 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/llvm_util.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"d783c84882476c05e842498c696d1d4f84f25da45aa55ce105f2d898cb288fe4"}},{"ruleId":"D1","level":"warning","message":{"text":"CrateInfo::new (cyclomatic 20): CrateInfo::new has cyclomatic complexity 20 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/base.rs"},"region":{"startLine":1017}}}],"partialFingerprints":{"codehealthFindingId/v1":"5be1f81300fd01ec0e4520120b0afa9f9837217198e4c736d3df8073e74cf9ad"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_codegen_ssa::back::link::add_sanitizer_libraries (cyclomatic 20): rustc_codegen_ssa::back::link::add_sanitizer_libraries has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/back/link.rs"},"region":{"startLine":1743}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3a7c6abeee331d5da672e1dfeb76db5a467fd300d6ce205b9464909e71dfce1"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_const_eval::util::check_validity_requirement::check_validity_requirement_lax (cyclomatic 20): rustc_const_eval::util::check_validity_requirement::check_validity_requirement_lax has cyclomatic complexity 20 (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":"compiler/rustc_const_eval/src/util/check_validity_requirement.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"c969b48b65b2d9ebb99e2ec802ac707e00a926bd0f937c14f593b5dad7251bb5"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_expand::mbe::transcribe::transcribe_pnr (cyclomatic 20): rustc_expand::mbe::transcribe::transcribe_pnr has cyclomatic complexity 20 (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":"compiler/rustc_expand/src/mbe/transcribe.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"fada7f32aa8955abcd1f9a40bc755f04686cc14dc1b83a576358365bae5ea43c"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_hir_analysis::check::region::resolve_local::record_rvalue_scope_if_borrow_expr (cyclomatic 20): rustc_hir_analysis::check::region::resolve_local::record_rvalue_scope_if_borrow_expr has cyclomatic complexity 20 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/check/region.rs"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d402175aa76e6d0654013a17c323f9902795475b83d856d39915caf57304a54"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_hir_analysis::check::wfcheck::check_gat_where_clauses (cyclomatic 20): rustc_hir_analysis::check::wfcheck::check_gat_where_clauses 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":"compiler/rustc_hir_analysis/src/check/wfcheck.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"38748dcd9eb6b2fb573cfe4e5e5d9652243a08763d8ace8b5cb1dcd5179f65d3"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_hir_analysis::coherence::orphan::emit_orphan_check_error (cyclomatic 20): rustc_hir_analysis::coherence::orphan::emit_orphan_check_error 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":"compiler/rustc_hir_analysis/src/coherence/orphan.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f984b10b5cde92aa1ca6697ff595eb6eb564f1c8fabece204b48dad2eba4e25"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_hir_analysis::collect::clauses_of::gather_explicit_clauses_of (cyclomatic 20): rustc_hir_analysis::collect::clauses_of::gather_explicit_clauses_of has cyclomatic complexity 20 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/collect/clauses_of.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"91bfaf80f69cde16494e286d3c3e0936f66357787115fe174aef9bcba46d8a4b"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_hir_analysis::hir_ty_lowering::generics::lower_generic_args (cyclomatic 20): rustc_hir_analysis::hir_ty_lowering::generics::lower_generic_args 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":"compiler/rustc_hir_analysis/src/hir_ty_lowering/generics.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb9be750d59cc6654eca15d674d9cd2f27f0669405973a2082a058fe2da1d8b0"}},{"ruleId":"D1","level":"warning","message":{"text":"FnCtxt::annotate_expected_due_to_let_ty (cyclomatic 20): FnCtxt::annotate_expected_due_to_let_ty has cyclomatic complexity 20 (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":"compiler/rustc_hir_typeck/src/demand.rs"},"region":{"startLine":707}}}],"partialFingerprints":{"codehealthFindingId/v1":"59a0b0c92800b99df5885fcfbc8f00448b9a99b9f3275dbb76f475ddec6726d6"}},{"ruleId":"D1","level":"warning","message":{"text":"FnCtxt::suggest_use_shadowed_binding_with_method (cyclomatic 20): FnCtxt::suggest_use_shadowed_binding_with_method 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":"compiler/rustc_hir_typeck/src/method/suggest.rs"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"85375cef3b969994308b4ba477be745d877902de81ca158e08f68898948524f4"}},{"ruleId":"D1","level":"warning","message":{"text":"FnCtxt::suggest_unsatisfied_ty_or_trait (cyclomatic 20): FnCtxt::suggest_unsatisfied_ty_or_trait 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":"compiler/rustc_hir_typeck/src/method/suggest.rs"},"region":{"startLine":881}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8b0bf2f99bce89da62b4c0c6f4f94055605dfd2881ac75de9de26c9e0f44e4c"}},{"ruleId":"D1","level":"warning","message":{"text":"FnCtxt::note_candidates_on_method_error (cyclomatic 20): FnCtxt::note_candidates_on_method_error 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":"compiler/rustc_hir_typeck/src/method/suggest.rs"},"region":{"startLine":2442}}}],"partialFingerprints":{"codehealthFindingId/v1":"facdfb1dc7e9409dd2334443a37c12c1ef46c54ade73e1e55e1fb7d09773c32c"}},{"ruleId":"D1","level":"warning","message":{"text":"Resolver::resolve_ident_in_module (cyclomatic 20): Resolver::resolve_ident_in_module 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":"compiler/rustc_resolve/src/ident.rs"},"region":{"startLine":995}}}],"partialFingerprints":{"codehealthFindingId/v1":"6edc5eff8f309647246b5f60969197426adbb47749c1222b9591bbb47083f59d"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_interface::passes::configure_and_expand (cyclomatic 20): rustc_interface::passes::configure_and_expand has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_interface/src/passes.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"9caa20d3071769350d6c6cc4a9e5d14a693613914fb992ca235fd1c2278b7166"}},{"ruleId":"D1","level":"warning","message":{"text":"IfLetRescope::probe_if_cascade (cyclomatic 20): IfLetRescope::probe_if_cascade 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":"compiler/rustc_lint/src/if_let_rescope.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"768ce7baf2812209c148f2afa8d1ccbdb0bf4bf6dfc9c69c7f42bbb3fe452d22"}},{"ruleId":"D1","level":"warning","message":{"text":"UnusedDelimLint::check_expr (cyclomatic 20): UnusedDelimLint::check_expr has cyclomatic complexity 20 (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":"compiler/rustc_lint/src/unused.rs"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ffbe74a1ed5f425694b486c215cdd01d32cb322a17846827089eeb77c43468d"}},{"ruleId":"D1","level":"warning","message":{"text":"EncodeContext::encode_mir (cyclomatic 20): EncodeContext::encode_mir 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":"compiler/rustc_metadata/src/rmeta/encoder.rs"},"region":{"startLine":1935}}}],"partialFingerprints":{"codehealthFindingId/v1":"f000d2c84bf1e2f235b0ca61165e0fc51ccd2e4e9e8ac0878c492eaba205632c"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_metadata::dependency_format::verify_ok (cyclomatic 20): rustc_metadata::dependency_format::verify_ok 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":"compiler/rustc_metadata/src/dependency_format.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5fc800fc30fa4a4499487d5c9a6e1d8878136f93aacc1858d415c80a025a313"}},{"ruleId":"D1","level":"warning","message":{"text":"Builder::static_pattern_match_inner (cyclomatic 20): Builder::static_pattern_match_inner has cyclomatic complexity 20 (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":"compiler/rustc_mir_build/src/builder/matches/mod.rs"},"region":{"startLine":2921}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3098435b3ed6e788c41e1b56e3ba8d14c886dde7960af1cbb19fb6dcb3bcfd5"}},{"ruleId":"D1","level":"warning","message":{"text":"ConstToPat::alias_to_pat (cyclomatic 20): ConstToPat::alias_to_pat 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":"compiler/rustc_mir_build/src/thir/pattern/const_to_pat.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e870ad90aa12a6def9b966e99274bd59f91c69bbda9897882dd16f2055ff596"}},{"ruleId":"D1","level":"warning","message":{"text":"Map::propagate_assignments (cyclomatic 20): Map::propagate_assignments 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":"compiler/rustc_mir_dataflow/src/value_analysis.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e4da3261fede9e6d19696dfe0babaa1f6d5448a780586208341c5a7e761a20e"}},{"ruleId":"D1","level":"warning","message":{"text":"VnState::simplify_aggregate (cyclomatic 20): VnState::simplify_aggregate 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":"compiler/rustc_mir_transform/src/gvn.rs"},"region":{"startLine":1201}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f05c2126ca43d6589e880df402b56f1794b518baa71592d36efdb0f2cd8232d"}},{"ruleId":"D1","level":"warning","message":{"text":"ConstPropagator::eval_rvalue (cyclomatic 20): ConstPropagator::eval_rvalue has cyclomatic complexity 20 (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":"compiler/rustc_mir_transform/src/known_panics_lint.rs"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eb66167cfb0d226a8b4857dbedd845201c44100f0a368c498fc942b4554df6b"}},{"ruleId":"D1","level":"warning","message":{"text":"AssignmentResult::report_unused_assignments (cyclomatic 20): AssignmentResult::report_unused_assignments 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":"compiler/rustc_mir_transform/src/liveness.rs"},"region":{"startLine":1182}}}],"partialFingerprints":{"codehealthFindingId/v1":"9422b2619c703be1c8d191cf369d2d78512dd020e8567fd3580ceb37a1d18ef6"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_mir_transform::dataflow_const_prop::try_write_constant (cyclomatic 20): rustc_mir_transform::dataflow_const_prop::try_write_constant 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":"compiler/rustc_mir_transform/src/dataflow_const_prop.rs"},"region":{"startLine":777}}}],"partialFingerprints":{"codehealthFindingId/v1":"b39eb67a53c4497767344bee1e8dfe411f8c6d377087701f3b2939cbe52dbe7e"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_mir_transform::shim::build_call_shim (cyclomatic 20): rustc_mir_transform::shim::build_call_shim has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/shim.rs"},"region":{"startLine":781}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca4b629a5eacf4885abe25f4f07ca7167397ed2bb24b8987d7e62c1b40c33a67"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_monomorphize::partitioning::collect_and_partition_mono_items (cyclomatic 20): rustc_monomorphize::partitioning::collect_and_partition_mono_items has cyclomatic complexity 20 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_monomorphize/src/partitioning.rs"},"region":{"startLine":1169}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3a31cfc339f2f45d12ea791c0fcbd1f01fc24c12b3aabc9d8cb1e6bd81bf686"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::recover_missing_kw_before_item (cyclomatic 20): Parser::recover_missing_kw_before_item has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/item.rs"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dc2ac7ef33f7582a4072b4812c920603d89f444ca55f6eddcbbbafcf51cb47b"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::maybe_augment_stashed_expr_in_pats_with_suggestions (cyclomatic 20): Parser::maybe_augment_stashed_expr_in_pats_with_suggestions 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":"compiler/rustc_parse/src/parser/pat.rs"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"c216cab117d0e78a85e4028a6f2ecc76d965653ccc42328430cd06b8fdf83d4b"}},{"ruleId":"D1","level":"warning","message":{"text":"MissingStabilityAnnotations::check_compatible_stability (cyclomatic 20): MissingStabilityAnnotations::check_compatible_stability 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":"compiler/rustc_passes/src/stability.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f9f1f6c39f8f99dce4b94560822150cc61e437666bf34cf255b5794af544d4f"}},{"ruleId":"D1","level":"warning","message":{"text":"RustcPatCtxt::print_witness_pat (cyclomatic 20): RustcPatCtxt::print_witness_pat has cyclomatic complexity 20 (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":"compiler/rustc_pattern_analysis/src/rustc.rs"},"region":{"startLine":786}}}],"partialFingerprints":{"codehealthFindingId/v1":"68729bf2c9c2ee578a7a2b339406e4215a8db6eaf40c61b2da14963b39af2235"}},{"ruleId":"D1","level":"warning","message":{"text":"LateResolutionVisitor::suggest_introducing_lifetime_filtered (cyclomatic 20): LateResolutionVisitor::suggest_introducing_lifetime_filtered 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":"compiler/rustc_resolve/src/late/diagnostics.rs"},"region":{"startLine":4323}}}],"partialFingerprints":{"codehealthFindingId/v1":"148c648bbab172044339fdf2bd5dcbaa738c72eb42374b3644c7e855932bf0fb"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_sanitizers::cfi::typeid::itanium_cxx_abi::transform::transform_instance (cyclomatic 20): rustc_sanitizers::cfi::typeid::itanium_cxx_abi::transform::transform_instance 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":"compiler/rustc_sanitizers/src/cfi/typeid/itanium_cxx_abi/transform.rs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb47c9b500615eb441dd7c06c3f618f558b31837518f56a413ecc43a431540a7"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_session::diagnostics::create_lit_error (cyclomatic 20): rustc_session::diagnostics::create_lit_error has cyclomatic complexity 20 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 6 belong to 2 function items inside it that branch. 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":"compiler/rustc_session/src/diagnostics.rs"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"d398c3ff00e90b6e8654dcb2bf04a34cd763114818cca2218c246db439071108"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_target::callconv::s390x::classify_arg (cyclomatic 20): rustc_target::callconv::s390x::classify_arg has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_target/src/callconv/s390x.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"c854a09640fa675501dbaaf58888709bb4fbd9874d0c020e0ad23a119058e3b0"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_target::callconv::sparc64::classify (cyclomatic 20): rustc_target::callconv::sparc64::classify has cyclomatic complexity 20 (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":"compiler/rustc_target/src/callconv/sparc64.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"52a6fbd3815c0a2d69b1e08184e8dd72fcba95382b601676cae1aa08b1810317"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeErrCtxt::consider_returning_binding_diag (cyclomatic 20): TypeErrCtxt::consider_returning_binding_diag 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":"compiler/rustc_trait_selection/src/error_reporting/infer/suggest.rs"},"region":{"startLine":912}}}],"partialFingerprints":{"codehealthFindingId/v1":"884c065bfba88063ded114355a4f03b4269eb317d3679bc28979406d4ad8430b"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeErrCtxt::emit_specialized_closure_kind_error (cyclomatic 20): TypeErrCtxt::emit_specialized_closure_kind_error has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: TypeErrCtxt::fuzzy_match_tys::type_category (cyclomatic 26) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/error_reporting/traits/fulfillment_errors.rs"},"region":{"startLine":1099}}}],"partialFingerprints":{"codehealthFindingId/v1":"534d83283fa5389c4b04389b7122f7760c104a18ae886cb1ae9373552730ad77"}},{"ruleId":"D1","level":"warning","message":{"text":"SelectionContext::assemble_builtin_copy_clone_candidate (cyclomatic 20): SelectionContext::assemble_builtin_copy_clone_candidate 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. This is NOT this file\u0027s highest cyclomatic complexity: SelectionContext::assemble_candidates (cyclomatic 26) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/traits/select/candidate_assembly.rs"},"region":{"startLine":1159}}}],"partialFingerprints":{"codehealthFindingId/v1":"771bdae446adac3f4c5f2f203413b0f4406874e87fd6196858a301aaa884c15b"}},{"ruleId":"D1","level":"warning","message":{"text":"compiler_builtins::int::specialized_div_rem::delegate::u128_divide_sparc (cyclomatic 20): compiler_builtins::int::specialized_div_rem::delegate::u128_divide_sparc 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":"library/compiler-builtins/compiler-builtins/src/int/specialized_div_rem/delegate.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"943b1c1c2fc08d974f0a05a973979dd892ceea0eb06ffe078000ae5f0be362f0"}},{"ruleId":"D1","level":"warning","message":{"text":"libm::math::jnf::jnf (cyclomatic 20): libm::math::jnf::jnf 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":"library/compiler-builtins/libm/src/math/jnf.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff386cd22bbe4e37a26655246ba3057b131c942dc8f0a6dab7b74bdc1a9a7ef3"}},{"ruleId":"D1","level":"warning","message":{"text":"libm::math::rem_pio2::rem_pio2 (cyclomatic 20): libm::math::rem_pio2::rem_pio2 has cyclomatic complexity 20 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 2 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":"library/compiler-builtins/libm/src/math/rem_pio2.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc7e4dd46d8ab9442dde2ed1e731ee63ca966ccbf46c6cd103fcc0d797b17604"}},{"ruleId":"D1","level":"warning","message":{"text":"core::num::imp::flt2dec::strategy::dragon::format_exact (cyclomatic 20): core::num::imp::flt2dec::strategy::dragon::format_exact 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":"library/core/src/num/imp/flt2dec/strategy/dragon.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffaeea28cdb313b7f0b447ed7c3f74560c1856b0297ee447b3902a8082ef3803"}},{"ruleId":"D1","level":"warning","message":{"text":"core::num::imp::flt2dec::strategy::grisu::format_exact_opt (cyclomatic 20): core::num::imp::flt2dec::strategy::grisu::format_exact_opt has cyclomatic complexity 20 (threshold 15). Of this number, 11 points are the body\u0027s own statements and 9 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":"library/core/src/num/imp/flt2dec/strategy/grisu.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"20701331cb19dde0486ce651bb087e514bfa0add301c50f86c7664487d625904"}},{"ruleId":"D1","level":"warning","message":{"text":"Command::fmt (cyclomatic 20): Command::fmt 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":"library/std/src/sys/process/unix/common.rs"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"791aaced03d8d33d18654a55071f866aa36eb73a4563886fa3b48f847812b10f"}},{"ruleId":"D1","level":"warning","message":{"text":"std::sys::backtrace::_print_fmt (cyclomatic 20): std::sys::backtrace::_print_fmt 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":"library/std/src/sys/backtrace.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"7929b263c68749a375c2dd1101f64d9ea80bf93b4b3f7a4b76628b8d0692761a"}},{"ruleId":"D1","level":"warning","message":{"text":"Wildcard::from_str (cyclomatic 20): Wildcard::from_str 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. This is NOT this file\u0027s highest cyclomatic complexity: Wildcard::fmt (cyclomatic 34) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/stdarch-gen-arm/src/wildcards.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"0883abab09df3910826cacbdc32866d3c20ac598e3bbc1b81f1d55e9357f4381"}},{"ruleId":"D1","level":"warning","message":{"text":"stdarch_gen_arm::intrinsic::create_tokens (cyclomatic 20): stdarch_gen_arm::intrinsic::create_tokens 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":"library/stdarch/crates/stdarch-gen-arm/src/intrinsic.rs"},"region":{"startLine":1691}}}],"partialFingerprints":{"codehealthFindingId/v1":"5680615bbdd397df6d36bfe8ec53938ec8f6e617e6e8adebc6650e4a2c926a6b"}},{"ruleId":"D1","level":"warning","message":{"text":"Libunwind::run (cyclomatic 20): Libunwind::run 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. This is NOT this file\u0027s highest cyclomatic complexity: bootstrap::core::build_steps::llvm::supported_sanitizers (cyclomatic 27) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/build_steps/llvm.rs"},"region":{"startLine":2095}}}],"partialFingerprints":{"codehealthFindingId/v1":"489d28339594c7f614fc3fbfcde0fa40e0732e6eb8ef4c276bc521c7531ff405"}},{"ruleId":"D1","level":"warning","message":{"text":"bootstrap::core::build_steps::compile::rustc_cargo_env (cyclomatic 20): bootstrap::core::build_steps::compile::rustc_cargo_env has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/build_steps/compile.rs"},"region":{"startLine":1315}}}],"partialFingerprints":{"codehealthFindingId/v1":"1587ae9b4b6099be8e91c3ef0eb69bc8c5e5c2d0b4e683ab78ad0d26e1f72a99"}},{"ruleId":"D1","level":"warning","message":{"text":"HirCollector::visit_testable (cyclomatic 20): HirCollector::visit_testable 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/librustdoc/doctest/rust.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbb47660e3b3d6b1c786c7054258a387fd528a55c718edd08907c1461e657034"}},{"ruleId":"D1","level":"warning","message":{"text":"SelfTyHead::of (cyclomatic 20): SelfTyHead::of has cyclomatic complexity 20 (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/librustdoc/passes/collect_trait_impls.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"0698ec0c3c6120f906f0b7d4f13bfc65e95adb11316e940588267d2eceb383df"}},{"ruleId":"D1","level":"warning","message":{"text":"Stripper::fold_item (cyclomatic 20): Stripper::fold_item 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/librustdoc/passes/strip_hidden.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"7182b48dd3f459f0bf4d1cbea6a3681a45319197d5ad1562e340eea20bc31ba7"}},{"ruleId":"D1","level":"warning","message":{"text":"rustdoc::clean::auto_trait::clean_region_outlives_constraints (cyclomatic 20): rustdoc::clean::auto_trait::clean_region_outlives_constraints 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/librustdoc/clean/auto_trait.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0a61a09fa0b6fc5600ba1d849cf363de12f2c6939773c76f226e09df78a1377"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_dev::edit_lints::rename_update_fn (cyclomatic 20): clippy_dev::edit_lints::rename_update_fn 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/tools/clippy/clippy_dev/src/edit_lints.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ce440b4a8ef2f2823da3a332cabecac10fde741d455c362f546fc997ba2dd6a"}},{"ruleId":"D1","level":"warning","message":{"text":"NumericFallbackVisitor::visit_expr (cyclomatic 20): NumericFallbackVisitor::visit_expr 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/tools/clippy/clippy_lints/src/default_numeric_fallback.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab3e2dbe66f2c6e1e01892db4c93b95bbc6409e94b762bf87d7246a0b0afccd0"}},{"ruleId":"D1","level":"warning","message":{"text":"FloatLiteral::check_expr (cyclomatic 20): FloatLiteral::check_expr 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/tools/clippy/clippy_lints/src/float_literal.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"51a767be1dcc3d346e6e74e066a1f6e2591160a6ff06e180bad20230844c05dc"}},{"ruleId":"D1","level":"warning","message":{"text":"OnlyUsedInRecursion::check_expr (cyclomatic 20): OnlyUsedInRecursion::check_expr has cyclomatic complexity 20 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/only_used_in_recursion.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a7ea4406f9285135cd8393784f19cdb24968a01337e86c14832c4775d443ac2"}},{"ruleId":"D1","level":"warning","message":{"text":"PassByRefOrValue::check_poly_fn (cyclomatic 20): PassByRefOrValue::check_poly_fn 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/tools/clippy/clippy_lints/src/pass_by_ref_or_value.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"233b7763d4e1f0afbd97c3e762360a8035dde7516b7a6c428f353de2e41f0736"}},{"ruleId":"D1","level":"warning","message":{"text":"SingleComponentPathImports::track_uses (cyclomatic 20): SingleComponentPathImports::track_uses 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/tools/clippy/clippy_lints/src/single_component_path_imports.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"726ec610cb6d31fee85690914768e5ae049f7f4ebf445b5f8c5653fdde61b17a"}},{"ruleId":"D1","level":"warning","message":{"text":"VecPushSearcher::display_err (cyclomatic 20): VecPushSearcher::display_err has cyclomatic complexity 20 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/vec_init_then_push.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"c92e7b06962a7779a00af67031c74a12c395a834cecc67486b902aec05cdecd0"}},{"ruleId":"D1","level":"warning","message":{"text":"WaitFinder::visit_expr (cyclomatic 20): WaitFinder::visit_expr 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/tools/clippy/clippy_lints/src/zombie_processes.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"e74493b25ca93d3ba5cdf68c22d4b1609c2cf77cfc713f7384833f11444271a0"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::literals::decimal_literal_representation::check_text (cyclomatic 20): clippy_lints::literals::decimal_literal_representation::check_text has cyclomatic complexity 20 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/literals/decimal_literal_representation.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7eab66da41259a3658bba8f98513157fd74283fd24bd9487649a6370af45871"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::matches::match_same_arms::check (cyclomatic 20): clippy_lints::matches::match_same_arms::check 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. This is NOT this file\u0027s highest cyclomatic complexity: NormalizedPat::has_overlapping_values (cyclomatic 21) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/matches/match_same_arms.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac3d9c734b3228a255acbc20eca3ad34e1a0730723e2c9a97e6faf9a95a3c3c4"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::methods::manual_saturating_arithmetic::is_min_or_max (cyclomatic 20): clippy_lints::methods::manual_saturating_arithmetic::is_min_or_max 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/tools/clippy/clippy_lints/src/methods/manual_saturating_arithmetic.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"57ad30dc2c87a60a3e611f9b9642628e0a55cbed06d8f3d58170affef6bcc993"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::methods::map_clone::check (cyclomatic 20): clippy_lints::methods::map_clone::check 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/tools/clippy/clippy_lints/src/methods/map_clone.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"60f531f7b121eed5c078dea77e9b60930c235ca05b5303544b8b69c5cf35ec3b"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::methods::unnecessary_to_owned::check (cyclomatic 20): clippy_lints::methods::unnecessary_to_owned::check 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/tools/clippy/clippy_lints/src/methods/unnecessary_to_owned.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"71b3165cdaa9488baa7f87bed1ba7ad3f82b137a377ec0b55924a61a277982bf"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::needless_borrows_for_generic_args::needless_borrow_count (cyclomatic 20): clippy_lints::needless_borrows_for_generic_args::needless_borrow_count has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/needless_borrows_for_generic_args.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"42be9c59abf81dcf96deb699b9803d871724fb6163d88dbc0c8946a24ad9b959"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::no_effect::reduce_expression (cyclomatic 20): clippy_lints::no_effect::reduce_expression has cyclomatic complexity 20 (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/tools/clippy/clippy_lints/src/no_effect.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdd8add4bb4afaae42b15f3d317a9ee597258508971476c3c1eab501fd205615"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::ptr::ptr_arg::check_ptr_arg_usage (cyclomatic 20): clippy_lints::ptr::ptr_arg::check_ptr_arg_usage 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/tools/clippy/clippy_lints/src/ptr/ptr_arg.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"579be90a56d9e074b24193068eb7c3f450bc2c37db5fb27913081558cb0c0af1"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::string_patterns::check_manual_pattern_char_comparison (cyclomatic 20): clippy_lints::string_patterns::check_manual_pattern_char_comparison 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/tools/clippy/clippy_lints/src/string_patterns.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"da6c6d31e027068c08d455adfd68f3a8f6aaa09465832ae169b09baded94535b"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::unit_types::let_unit_value::check (cyclomatic 20): clippy_lints::unit_types::let_unit_value::check 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/tools/clippy/clippy_lints/src/unit_types/let_unit_value.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"55f9805b50220c712405ddec90660a35b65b18273e9a6e90f7f4ee247d1ff672"}},{"ruleId":"D1","level":"warning","message":{"text":"ExprEagernessVisitor::visit_binary (cyclomatic 20): ExprEagernessVisitor::visit_binary has cyclomatic complexity 20 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_utils/src/eager_or_lazy.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ba49d945e5d6d269f73939807ec6ebf9aae37335c942b708fd4f3afea382d9d"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_utils::ty::type_certainty::expr_type_certainty (cyclomatic 20): clippy_utils::ty::type_certainty::expr_type_certainty has cyclomatic complexity 20 (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/tools/clippy/clippy_utils/src/ty/type_certainty/mod.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"c05be42ee6e717dfcd0fc8ea90a7d4d87b3087b01554779d24c745fb31d8780b"}},{"ruleId":"D1","level":"warning","message":{"text":"TestCx::run_codegen_units_test (cyclomatic 20): TestCx::run_codegen_units_test has cyclomatic complexity 20 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 6 belong to 3 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/compiletest/src/runtest/codegen_units.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca964d02aab899b82285542d988fb50a6e3c89626e3b9ac49950950816220deb"}},{"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/tools/miri/src/bin/log/tracing_chrome.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc6e8d1c40af959ef538332d6f45bae220dfd5b0a8677f8de4e0cb8c30bea423"}},{"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/tools/miri/src/shims/unix/fd.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"679b39ec8cc371e6a901f9f793966791a5e0fc3239edb0a78ea3284805a02fee"}},{"ruleId":"D1","level":"warning","message":{"text":"AnyDiagnostic::body_validation_diagnostic (cyclomatic 20): AnyDiagnostic::body_validation_diagnostic has cyclomatic complexity 20 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir/src/diagnostics.rs"},"region":{"startLine":1446}}}],"partialFingerprints":{"codehealthFindingId/v1":"097a0f51194ab2bb55dd0b79da74068974b701ef1558efcc9f64bf7d646c1c51"}},{"ruleId":"D1","level":"warning","message":{"text":"ExprCollector::lower_type_ref (cyclomatic 20): ExprCollector::lower_type_ref has cyclomatic complexity 20 (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/tools/rust-analyzer/crates/hir-def/src/expr_store/lower.rs"},"region":{"startLine":746}}}],"partialFingerprints":{"codehealthFindingId/v1":"06155c4f293aaf5cd6173f3b0fc725ca6d6b65d8d4aed47baead93f355833417"}},{"ruleId":"D1","level":"warning","message":{"text":"ItemScope::dump (cyclomatic 20): ItemScope::dump has cyclomatic complexity 20 (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/tools/rust-analyzer/crates/hir-def/src/item_scope.rs"},"region":{"startLine":751}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0bff319b2f88c93dd4245ca630d00db2999e678a339dbaacea1c8a36436d5d1"}},{"ruleId":"D1","level":"warning","message":{"text":"hir_def::lang_item::crate_lang_items (cyclomatic 20): hir_def::lang_item::crate_lang_items has cyclomatic complexity 20 (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/tools/rust-analyzer/crates/hir-def/src/lang_item.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a6f86305ec88d4736b9deab2da8eabe88850aa48a75ad1ab55b8cfb90b5b724"}},{"ruleId":"D1","level":"warning","message":{"text":"ExprUseVisitor::cat_pattern (cyclomatic 20): ExprUseVisitor::cat_pattern has cyclomatic complexity 20 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/infer/closure/analysis/expr_use_visitor.rs"},"region":{"startLine":1496}}}],"partialFingerprints":{"codehealthFindingId/v1":"331b7c704cfad10dd31f0ed7fc87f30d1d5828b7c059e3917ed123e5b1fb9473"}},{"ruleId":"D1","level":"warning","message":{"text":"InferenceContext::infer_ref_pat (cyclomatic 20): InferenceContext::infer_ref_pat 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/tools/rust-analyzer/crates/hir-ty/src/infer/pat.rs"},"region":{"startLine":1356}}}],"partialFingerprints":{"codehealthFindingId/v1":"c39ac97586713a5f0b878e56c52059b572a41078a56da4ca020ee0ee5b0ef70b"}},{"ruleId":"D1","level":"warning","message":{"text":"SolverContext::compute_goal_fast_path (cyclomatic 20): SolverContext::compute_goal_fast_path 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/tools/rust-analyzer/crates/hir-ty/src/next_solver/solver.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"5af8b287d208249c3470f884c85a8fbce1f1d6ab9037b9e37af180171b3001b0"}},{"ruleId":"D1","level":"warning","message":{"text":"hir_ty::lower::remap_gat_vars_and_recurse_into_nested_projections (cyclomatic 20): hir_ty::lower::remap_gat_vars_and_recurse_into_nested_projections 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/tools/rust-analyzer/crates/hir-ty/src/lower.rs"},"region":{"startLine":2373}}}],"partialFingerprints":{"codehealthFindingId/v1":"429ce9b539bd281d575f52bf7ef8acb8a522c9b37c56963c79d06e75e0b5be80"}},{"ruleId":"D1","level":"warning","message":{"text":"ide::typing::on_eq_typed (cyclomatic 20): ide::typing::on_eq_typed has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 6 of the 20 points are its own statements and the rest belongs to 3 function items inside it that branch (assign_expr, let_stmt, assign_to_eq). 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/tools/rust-analyzer/crates/ide/src/typing.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca622c7e061a9082e53606faf936b04e7b46889091c7a80380c3816f38ec2137"}},{"ruleId":"D1","level":"warning","message":{"text":"ide_assists::handlers::extract_function::extract_function (cyclomatic 20): ide_assists::handlers::extract_function::extract_function 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/tools/rust-analyzer/crates/ide-assists/src/handlers/extract_function.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"644a0d1564509babe90438faf82033178a43e866d80bcbef9b0ded7cf1a79fb2"}},{"ruleId":"D1","level":"warning","message":{"text":"ide_assists::handlers::extract_type_alias::collect_used_generics (cyclomatic 20): ide_assists::handlers::extract_type_alias::collect_used_generics has cyclomatic complexity 20 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. 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/tools/rust-analyzer/crates/ide-assists/src/handlers/extract_type_alias.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7537c00527c5e47189a6fddfc5e73bcc4b83c8823ff31ace01095ff1b229ad4"}},{"ruleId":"D1","level":"warning","message":{"text":"ide_assists::handlers::inline_type_alias::create_replacement (cyclomatic 20): ide_assists::handlers::inline_type_alias::create_replacement 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/tools/rust-analyzer/crates/ide-assists/src/handlers/inline_type_alias.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"39e99a7d92d1f43fdc227e6f51c069d8ed3fd2ebebef92b0d635f34ec04a5cd3"}},{"ruleId":"D1","level":"warning","message":{"text":"ide_assists::handlers::remove_dbg::compute_dbg_replacement (cyclomatic 20): ide_assists::handlers::remove_dbg::compute_dbg_replacement has cyclomatic complexity 20 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/remove_dbg.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"21b6e7a800b61f618c7e3c3bf6e51b60d91bcde2e8aed969fcdb957122938f92"}},{"ruleId":"D1","level":"warning","message":{"text":"ide_assists::utils::gen_trait_fn_body::gen_partial_eq (cyclomatic 20): ide_assists::utils::gen_trait_fn_body::gen_partial_eq has cyclomatic complexity 20 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/utils/gen_trait_fn_body.rs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f8a42a4279263e5c011002cbbee851b9b59f22b7175bc2152ec129a6dd1183e"}},{"ruleId":"D1","level":"warning","message":{"text":"project_model::workspace::handle_rustc_crates (cyclomatic 20): project_model::workspace::handle_rustc_crates 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/tools/rust-analyzer/crates/project-model/src/workspace.rs"},"region":{"startLine":1536}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb85241b6f2c3e73b01ccf7a0c77d4441dede061b02f6f3fe2d30f75a9166632"}},{"ruleId":"D1","level":"warning","message":{"text":"Config::inlay_hints (cyclomatic 20): Config::inlay_hints has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: rust_analyzer::config::field_props (cyclomatic 49) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/config.rs"},"region":{"startLine":2087}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4075a2d066a7593dcbac9767187657a0f2ba2d24105310b0f41a8cda4c53962"}},{"ruleId":"D1","level":"warning","message":{"text":"syntax::validation::validate_literal (cyclomatic 20): syntax::validation::validate_literal 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. This is NOT this file\u0027s highest cyclomatic complexity: syntax::validation::rustc_unescape_error_to_string (cyclomatic 22) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/syntax/src/validation.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"918951967f0195f97579176761a0231965e65c590ccfad8743faea90b407c6a8"}},{"ruleId":"D1","level":"warning","message":{"text":"ChainFormatterShared::format_last_child (cyclomatic 20): ChainFormatterShared::format_last_child 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/tools/rustfmt/src/chains.rs"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"63044bcc141213b4f07952eeb5ecc6542e45dd58d20faff039f65bbcbc449ae1"}},{"ruleId":"D1","level":"warning","message":{"text":"rustfmt_nightly::string::break_string (cyclomatic 20): rustfmt_nightly::string::break_string 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/tools/rustfmt/src/string.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"75cb91f53e44a03555a3ac6427328f38b85ddc42d58671ea4285192940940bc7"}},{"ruleId":"D1","level":"warning","message":{"text":"search.initSearch::createQueryElement (cyclomatic 20): search.initSearch::createQueryElement 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. This shape REPEATS in the file: 12 other methods here (search.initSearch, search.initSearch::getItemsBefore, search.initSearch::getNextElem, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 13 times rather than 13 independent problems. Splitting this body alone leaves the other 12 exactly as they are. Where these are variations on one operation, the change that clears all 13 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":810}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae14313f854ad9a2816c7c8a294739013863d241da8e3374eb5568fed23c300a"}},{"ruleId":"D1","level":"warning","message":{"text":"debug.getDebugConfiguration (cyclomatic 20): debug.getDebugConfiguration 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/tools/rust-analyzer/editors/code/src/debug.ts"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b2e4427ea6a35f349440ddf834ace9a96ff8f61aec7ee6e163d4561c3462eb8"}},{"ruleId":"D1","level":"warning","message":{"text":"LitKind::from_token_lit (cyclomatic 19): LitKind::from_token_lit has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ast/src/util/literal.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"32a7a1423790311dff5101fd4ad3bf7707df8558ded2537494c6cbf080244035"}},{"ruleId":"D1","level":"warning","message":{"text":"LoweringContext::can_lower_expr_to_const_arg_direct (cyclomatic 19): LoweringContext::can_lower_expr_to_const_arg_direct has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: ImplTraitPosition::fmt (cyclomatic 21) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ast_lowering/src/lib.rs"},"region":{"startLine":2792}}}],"partialFingerprints":{"codehealthFindingId/v1":"cadc198c5de1caa95709c3d7ea655d720fa37bba73b68b8fe2f87cbea03fc61b"}},{"ruleId":"D1","level":"warning","message":{"text":"State::print_inline_asm (cyclomatic 19): State::print_inline_asm 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. This is NOT this file\u0027s highest cyclomatic complexity: PrintState::token_kind_to_string_ext (cyclomatic 60) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ast_pretty/src/pprust/state.rs"},"region":{"startLine":1768}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c7bfa3cb5b23e1b82a2d3ead6474897dd50ea38e45637fb2d179e841c5a6e2c"}},{"ruleId":"D1","level":"warning","message":{"text":"DocParser::parse_auto_cfg (cyclomatic 19): DocParser::parse_auto_cfg 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":"compiler/rustc_attr_parsing/src/attributes/doc.rs"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"0855b137b8ac293b636487a8eede5524f10243e31557edaf69251b8c25de3c65"}},{"ruleId":"D1","level":"warning","message":{"text":"MirBorrowckCtxt::add_move_error_suggestions (cyclomatic 19): MirBorrowckCtxt::add_move_error_suggestions 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":"compiler/rustc_borrowck/src/diagnostics/move_errors.rs"},"region":{"startLine":1075}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2d8f4673e7c4f1008af2a9bcba9c5d8c84a0869c7f597224eca60a010044323"}},{"ruleId":"D1","level":"warning","message":{"text":"InlineAssemblyGenerator::allocate_registers (cyclomatic 19): InlineAssemblyGenerator::allocate_registers 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":"compiler/rustc_codegen_cranelift/src/inline_asm.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f81dcdb3547a930e9d605fdee413fac108fb7d45bfc87ba0c0421aaabaa8543"}},{"ruleId":"D1","level":"warning","message":{"text":"Builder::dbg_scope_fn (cyclomatic 19): Builder::dbg_scope_fn has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 7 of the 19 points are its own statements and the rest belongs to 3 function items inside it that branch (get_function_signature, get_containing_scope, get_template_parameters). 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":"compiler/rustc_codegen_llvm/src/debuginfo/mod.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"c126285ad72ab466b58ca522043e8a2d3363ac1566175b2cece9d6f398d40ad0"}},{"ruleId":"D1","level":"warning","message":{"text":"FunctionCx::compute_per_local_var_debug_info (cyclomatic 19): FunctionCx::compute_per_local_var_debug_info 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":"compiler/rustc_codegen_ssa/src/mir/debuginfo.rs"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d9134fbdefc34990f282aee8affbec3a9b76df304233723332d083d429b4d3c"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_codegen_ssa::back::link::add_apple_link_args (cyclomatic 19): rustc_codegen_ssa::back::link::add_apple_link_args has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/back/link.rs"},"region":{"startLine":3843}}}],"partialFingerprints":{"codehealthFindingId/v1":"654f98812e155e5536e94dd9633311d2209b6a08fd0b8d603aa97f01ebc05979"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_expand::mbe::quoted::parse_tree (cyclomatic 19): rustc_expand::mbe::quoted::parse_tree has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_expand/src/mbe/quoted.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"74912b3b6a01f59b985d23279f069779231ba094997938a26eb2d1dc264a27a0"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_hir_analysis::coherence::builtin::visit_implementation_of_dispatch_from_dyn (cyclomatic 19): rustc_hir_analysis::coherence::builtin::visit_implementation_of_dispatch_from_dyn 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":"compiler/rustc_hir_analysis/src/coherence/builtin.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"27a387d763eed25236a7c2edb6b07c7ea77c1fbcd3b56a9b5b86e25e92075a83"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_hir_analysis::collect::item_bounds::remap_gat_vars_and_recurse_into_nested_projections (cyclomatic 19): rustc_hir_analysis::collect::item_bounds::remap_gat_vars_and_recurse_into_nested_projections 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":"compiler/rustc_hir_analysis/src/collect/item_bounds.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"41bb04f471268663e5fd3daf66bc73bfcc011d446a2d72ff80a38b8b941a72b8"}},{"ruleId":"D1","level":"warning","message":{"text":"Coerce::coerce (cyclomatic 19): Coerce::coerce has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/coercion.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"c88ba2a2302074fc00a3648408fa17b2ffa1540c2f991b4b9c7dd359d1a1ad46"}},{"ruleId":"D1","level":"warning","message":{"text":"FnCtxt::no_such_field_err (cyclomatic 19): FnCtxt::no_such_field_err 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. This is NOT this file\u0027s highest cyclomatic complexity: FnCtxt::check_expr_kind (cyclomatic 35) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/expr.rs"},"region":{"startLine":3269}}}],"partialFingerprints":{"codehealthFindingId/v1":"59d964b621fc4a3ea48bdb7d8ab54979b933faaf4604d59df08d7e3f94b0af5e"}},{"ruleId":"D1","level":"warning","message":{"text":"FnCtxt::adjust_fulfillment_error_for_expr_obligation (cyclomatic 19): FnCtxt::adjust_fulfillment_error_for_expr_obligation has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/fn_ctxt/adjust_fulfillment_errors.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf8b5212ac23e0899c349dde789d8a55f0ad8a631817e3ef582ac380d91cfe36"}},{"ruleId":"D1","level":"warning","message":{"text":"FnCtxt::suggest_missing_return_type (cyclomatic 19): FnCtxt::suggest_missing_return_type 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":"compiler/rustc_hir_typeck/src/fn_ctxt/suggestions.rs"},"region":{"startLine":975}}}],"partialFingerprints":{"codehealthFindingId/v1":"a63da04f28adb4a0950c1f6ebed7309e741a276748cd4cc86b7388466db77c74"}},{"ruleId":"D1","level":"warning","message":{"text":"FnCtxt::compute_definition_site_hidden_types (cyclomatic 19): FnCtxt::compute_definition_site_hidden_types 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":"compiler/rustc_hir_typeck/src/opaque_types.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"93e5dd0daac8b1a25cc98ed469e6f2a49547077d653394fa7412c963d54beb0e"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_incremental::persist::fs::garbage_collect_session_directories (cyclomatic 19): rustc_incremental::persist::fs::garbage_collect_session_directories 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":"compiler/rustc_incremental/src/persist/fs.rs"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"79c5c67a7628131186079acc7dc06b8df9b6062c9cdbf79f65792573a887d55d"}},{"ruleId":"D1","level":"warning","message":{"text":"Newtype::parse (cyclomatic 19): Newtype::parse 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":"compiler/rustc_index_macros/src/newtype.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9b843fe2bbbb550001ad4a417f305ec5d50b024592498ffce737d0d81f4b1ba"}},{"ruleId":"D1","level":"warning","message":{"text":"Collector::build_dll_import (cyclomatic 19): Collector::build_dll_import 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":"compiler/rustc_metadata/src/native_libs.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3114a1451cddf2340191ab20f1cdacc26c56fe3fb4d54b7ef748cf35f4bab1e"}},{"ruleId":"D1","level":"warning","message":{"text":"MirDumper::dump_path (cyclomatic 19): MirDumper::dump_path has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: TerminatorKind::fmt_successor_labels (cyclomatic 21) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/mir/pretty.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"687af15d523834b1dafc8a1b194fe35c97e399381b3ef131cd559caa917b589d"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_middle::mir::pretty::write_allocation_bytes (cyclomatic 19): rustc_middle::mir::pretty::write_allocation_bytes 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. This is NOT this file\u0027s highest cyclomatic complexity: TerminatorKind::fmt_successor_labels (cyclomatic 21) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/mir/pretty.rs"},"region":{"startLine":1764}}}],"partialFingerprints":{"codehealthFindingId/v1":"95a9d71ecd3ac7e5ec7d3cf151d5dc24482526fad9ddf93975d68ead84984b3a"}},{"ruleId":"D1","level":"warning","message":{"text":"Builder::visit_primary_bindings_special (cyclomatic 19): Builder::visit_primary_bindings_special has cyclomatic complexity 19 (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":"compiler/rustc_mir_build/src/builder/matches/mod.rs"},"region":{"startLine":819}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d8d019d71f31ee26668c8d0a23a9a7623b0f19505afd6c61650d7ec8602804f"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeChecker::visit_statement (cyclomatic 19): TypeChecker::visit_statement 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":"compiler/rustc_mir_transform/src/validate.rs"},"region":{"startLine":1482}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5c80b6880074cb64ec8d96c42d747bbddcdb628d0801cf028ec69f1074663d9"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_mir_transform::coroutine::layout::check_must_not_suspend_ty (cyclomatic 19): rustc_mir_transform::coroutine::layout::check_must_not_suspend_ty 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":"compiler/rustc_mir_transform/src/coroutine/layout.rs"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"dad309d04e2fd341de787d285fa529b59d051f4a2b965c58b505af87333b537e"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_mir_transform::ffi_unwind_calls::has_ffi_unwind_calls (cyclomatic 19): rustc_mir_transform::ffi_unwind_calls::has_ffi_unwind_calls 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":"compiler/rustc_mir_transform/src/ffi_unwind_calls.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f3d9fc11b83907c3295cf043f299f1593ffd20c7293c483fa566910455d5f83"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_mir_transform::shim::make_shim (cyclomatic 19): rustc_mir_transform::shim::make_shim has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/shim.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"51d8eab689770a047bad061539c052e452aeeaaec6bf8e65fa63d691c17b1961"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_monomorphize::partitioning::mono_item_visibility (cyclomatic 19): rustc_monomorphize::partitioning::mono_item_visibility 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":"compiler/rustc_monomorphize/src/partitioning.rs"},"region":{"startLine":803}}}],"partialFingerprints":{"codehealthFindingId/v1":"04d34dab0b5ef79bb9cf7ecc4b62e8600c56330dc12ec5619c3b1bd5ad11f880"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_next_trait_solver::solve::assembly::structural_traits::extract_tupled_inputs_and_output_from_callable (cyclomatic 19): rustc_next_trait_solver::solve::assembly::structural_traits::extract_tupled_inputs_and_output_from_callable 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":"compiler/rustc_next_trait_solver/src/solve/assembly/structural_traits.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"99ed9b8f8be002db0bdf32ea2794d06c338982092277da95df3229336d4d7e87"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_parse::parser::asm::parse_asm_operand (cyclomatic 19): rustc_parse::parser::asm::parse_asm_operand 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":"compiler/rustc_parse/src/parser/asm.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"b99ea9a86fbb7076665903c602497fd50c37cd2fbf3382973464dfc421cdd1c7"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::check_no_chained_comparison (cyclomatic 19): Parser::check_no_chained_comparison 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":"compiler/rustc_parse/src/parser/diagnostics.rs"},"region":{"startLine":1337}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5e314db80c9132add2c61e31e418bfcfb2dbb860acd316d4a010475db0424bb"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::parse_self_param (cyclomatic 19): Parser::parse_self_param has cyclomatic complexity 19 (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":"compiler/rustc_parse/src/parser/function.rs"},"region":{"startLine":880}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0a55719c5b1ea0e4cac01afa3acca4258d8f6d08dfaced91f3401eebb0601fa"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::parse_nonterminal (cyclomatic 19): Parser::parse_nonterminal has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/nonterminal.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bd2061bce4f6692270c4b487fd605813cfdfb31da175f5a4e4e5b846fbb33bb"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_pattern_analysis::usefulness::compute_exhaustiveness_and_usefulness (cyclomatic 19): rustc_pattern_analysis::usefulness::compute_exhaustiveness_and_usefulness 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":"compiler/rustc_pattern_analysis/src/usefulness.rs"},"region":{"startLine":1698}}}],"partialFingerprints":{"codehealthFindingId/v1":"616d665c7090c17050f222adcbb19845d73b64375cd1128864850e4abe7fc780"}},{"ruleId":"D1","level":"warning","message":{"text":"DefCollector::build_reduced_graph_for_item (cyclomatic 19): DefCollector::build_reduced_graph_for_item 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":"compiler/rustc_resolve/src/build_reduced_graph.rs"},"region":{"startLine":826}}}],"partialFingerprints":{"codehealthFindingId/v1":"b812e85ba14cb2246cf5145ba326341eb5bbe1a8be7042b902dd1d988c739c4b"}},{"ruleId":"D1","level":"warning","message":{"text":"LateResolutionVisitor::resolve_lifetime (cyclomatic 19): LateResolutionVisitor::resolve_lifetime 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. This is NOT this file\u0027s highest cyclomatic complexity: PathSource::is_expected (cyclomatic 22) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/late.rs"},"region":{"startLine":1925}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3a0c87bc634e7be7ab82ae743981de3a9e9d8018a4841899cb2266de3248309"}},{"ruleId":"D1","level":"warning","message":{"text":"LateResolutionVisitor::resolve_qpath (cyclomatic 19): LateResolutionVisitor::resolve_qpath 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. This is NOT this file\u0027s highest cyclomatic complexity: PathSource::is_expected (cyclomatic 22) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/late.rs"},"region":{"startLine":5226}}}],"partialFingerprints":{"codehealthFindingId/v1":"09d6e83e51fbb96d84a04009d3898512f8b817b667e20b2f090bb163313c9969"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_resolve::check_unused::calc_unused_spans (cyclomatic 19): rustc_resolve::check_unused::calc_unused_spans 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":"compiler/rustc_resolve/src/check_unused.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fbfaa4fea3507b68bd66823f8e77ebc30580a208dfa948a20df2beb6ea63c38"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_session::options::parse::parse_autodiff (cyclomatic 19): rustc_session::options::parse::parse_autodiff has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_session/src/options.rs"},"region":{"startLine":1597}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ecc41558ccb8e2901200e97256b79e91e5a6e70f3848a058b1086eee9a29f20"}},{"ruleId":"D1","level":"warning","message":{"text":"LegacySymbolMangler::write_str (cyclomatic 19): LegacySymbolMangler::write_str has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_symbol_mangling/src/legacy.rs"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a7fc90e8911723c9abb77b4d87d00eb5336331d3aae59c60e84b0b2649bca42"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_target::callconv::loongarch::should_use_fp_conv_helper (cyclomatic 19): rustc_target::callconv::loongarch::should_use_fp_conv_helper has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_target/src/callconv/loongarch.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6da297bb2909de597f3b7c0c1dadf10e0f97e3bde7da7c3a0300fe47b3756fe"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_target::callconv::x86_win64::compute_abi_info (cyclomatic 19): rustc_target::callconv::x86_win64::compute_abi_info 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":"compiler/rustc_target/src/callconv/x86_win64.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb295086cac0ca9ccf583dadd4a9409f7ed256f7065f40b6d2089570586ed515"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeErrCtxt::suggest_function_pointers_impl (cyclomatic 19): TypeErrCtxt::suggest_function_pointers_impl 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":"compiler/rustc_trait_selection/src/error_reporting/infer/suggest.rs"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"920ae711ce7ff23f11f53693afb1261b29a48c70e140cfce663699bf074496f2"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_trait_selection::traits::try_evaluate_const (cyclomatic 19): rustc_trait_selection::traits::try_evaluate_const 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":"compiler/rustc_trait_selection/src/traits/mod.rs"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f2f768844cebac52194568058e2aab9398da5107ff1b462130cdf141d6dd337"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_trait_selection::traits::query::dropck_outlives::dtorck_constraint_for_ty_inner (cyclomatic 19): rustc_trait_selection::traits::query::dropck_outlives::dtorck_constraint_for_ty_inner has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/traits/query/dropck_outlives.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2756ddc37275aafadfd7a1d4d5e7561375f8c244dc8aba4e8b5f40478f5d016"}},{"ruleId":"D1","level":"warning","message":{"text":"compiler_builtins::float::mul::mul (cyclomatic 19): compiler_builtins::float::mul::mul 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":"library/compiler-builtins/compiler-builtins/src/float/mul.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"97addd4e642c5b7d4d72d6df9f1573b5016e32c6cd56be7ac6e17db51e745b41"}},{"ruleId":"D1","level":"warning","message":{"text":"libm::math::exp2m1f::cr_exp2m1f (cyclomatic 19): libm::math::exp2m1f::cr_exp2m1f 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":"library/compiler-builtins/libm/src/math/exp2m1f.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cc9e09f223dad5ab260e4a99440d25b3a45888ed14ab2fcc24e9f3d32164b25"}},{"ruleId":"D1","level":"warning","message":{"text":"libm_test::run_cfg::arg_max_iterations (cyclomatic 19): libm_test::run_cfg::arg_max_iterations 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":"library/compiler-builtins/libm-test/src/run_cfg.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef138e26b64820d51b4103e823512cd2dc01a3fa5ecaf006a9c4583f5afffc7b"}},{"ruleId":"D1","level":"warning","message":{"text":"core::escape::escape_ascii (cyclomatic 19): core::escape::escape_ascii has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/escape.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"059e5157f421e6cca5fbb6c730fe65bc960e235e4a1068eaaa89963a4c9ff591"}},{"ruleId":"D1","level":"warning","message":{"text":"core::fmt::num::exp_u128 (cyclomatic 19): core::fmt::num::exp_u128 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. This shape REPEATS in the file: 3 other methods here (core::fmt::num::imp::exp_u64, core::fmt::num::imp::exp_u32, core::fmt::num::imp::exp_u64) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/fmt/num.rs"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"c35e5801df0292db18ab8b8300511a42d55283aea296b8da9cb556b2cc324a9e"}},{"ruleId":"D1","level":"warning","message":{"text":"core::fmt::num::imp::exp_u64 (cyclomatic 19): core::fmt::num::imp::exp_u64 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. This shape REPEATS in the file: 3 other methods here (core::fmt::num::imp::exp_u32, core::fmt::num::imp::exp_u64, core::fmt::num::exp_u128) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/fmt/num.rs"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fb40ee4f46a97aa327d2e04101d4a375d5245f1f61b9da5070b12e926d57fd5"}},{"ruleId":"D1","level":"warning","message":{"text":"core::fmt::num::imp::exp_u32 (cyclomatic 19): core::fmt::num::imp::exp_u32 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. This shape REPEATS in the file: 3 other methods here (core::fmt::num::imp::exp_u64, core::fmt::num::imp::exp_u64, core::fmt::num::exp_u128) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/fmt/num.rs"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b25eac5e84db3c909252eab57f0087711130439bdbca0e423d25ed262f39d19"}},{"ruleId":"D1","level":"warning","message":{"text":"core::fmt::num::imp::exp_u64 (cyclomatic 19): core::fmt::num::imp::exp_u64 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. This shape REPEATS in the file: 3 other methods here (core::fmt::num::imp::exp_u64, core::fmt::num::imp::exp_u32, core::fmt::num::exp_u128) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/fmt/num.rs"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"76c30cda7fec833021bc9d62a205f80a644bbea18381c7c90d7b9dc13ac438b6"}},{"ruleId":"D1","level":"warning","message":{"text":"proc_macro::quote::quote (cyclomatic 19): proc_macro::quote::quote has cyclomatic complexity 19 (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":"library/proc_macro/src/quote.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7d10fcc7b5b3fdec9b1c00e72b54d3bb163aed5f8b2a662e3afbe82720b93d4"}},{"ruleId":"D1","level":"warning","message":{"text":"Command::spawn (cyclomatic 19): Command::spawn has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/process/unix/vxworks.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"9999b04489502d2f33cf6769e71964f59ec5f10eb4ed7829e0d976f0d3d9bc7a"}},{"ruleId":"D1","level":"warning","message":{"text":"std::sys::io::error::sgx::decode_error_kind (cyclomatic 19): std::sys::io::error::sgx::decode_error_kind 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":"library/std/src/sys/io/error/sgx.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"0864e33e102a12379b274c4f8215536ae91a5c252c2d495e450ff0a69d10cf0d"}},{"ruleId":"D1","level":"warning","message":{"text":"Expression::build (cyclomatic 19): Expression::build 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. This is NOT this file\u0027s highest cyclomatic complexity: Expression::requires_unsafe_wrapper (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/stdarch-gen-arm/src/expression.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"6051b0d13ffb04354c5a790fc35580239187e55836f8158df918884cd9726151"}},{"ruleId":"D1","level":"warning","message":{"text":"Intrinsic::generate_big_endian (cyclomatic 19): Intrinsic::generate_big_endian 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":"library/stdarch/crates/stdarch-gen-arm/src/intrinsic.rs"},"region":{"startLine":1061}}}],"partialFingerprints":{"codehealthFindingId/v1":"563787f7b88d9bf6d29ff8e1611bfa211bc3f9cefcc65ca555f1c8e0a030502a"}},{"ruleId":"D1","level":"warning","message":{"text":"stdarch_test::disassembly::parse (cyclomatic 19): stdarch_test::disassembly::parse has cyclomatic complexity 19 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 3 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":"library/stdarch/crates/stdarch-test/src/disassembly.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"38dac1f7630d1e81b65a68122f0a451299ec0f0d323db2822738f8a9d251197a"}},{"ruleId":"D1","level":"warning","message":{"text":"bootstrap::cli_main::main (cyclomatic 19): bootstrap::cli_main::main 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/bootstrap/src/cli_main.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9e40b4cb733b45090467bc7b32f3e9651ccf3bf01efeec9fd725e2d084b6b3f"}},{"ruleId":"D1","level":"warning","message":{"text":"bootstrap::core::build_steps::compile::std_cargo (cyclomatic 19): bootstrap::core::build_steps::compile::std_cargo 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/bootstrap/src/core/build_steps/compile.rs"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"88ebf4f24fab6b8b372fe1b42a5b25841715960522979eb263160021b8675213"}},{"ruleId":"D1","level":"warning","message":{"text":"Context::render_item (cyclomatic 19): Context::render_item 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/librustdoc/html/render/context.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"583ca7844cf2eccd92ae2d37721228673e82aa716e7073031e4ff953265dff6a"}},{"ruleId":"D1","level":"warning","message":{"text":"LinkCollector::resolve_links (cyclomatic 19): LinkCollector::resolve_links 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. This is NOT this file\u0027s highest cyclomatic complexity: rustdoc::passes::collect_intra_doc_links::resolve_primitive (cyclomatic 29) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/passes/collect_intra_doc_links.rs"},"region":{"startLine":1079}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8bbd4592e79aa6b9b7b4e051691128c093796c0dcb95c9cc49d42ac22db6b49"}},{"ruleId":"D1","level":"warning","message":{"text":"rustdoc::clean::render_macro_matchers::print_tts (cyclomatic 19): rustdoc::clean::render_macro_matchers::print_tts has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/clean/render_macro_matchers.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"e76550fa000f3133288019733ed2a8b4a6afe2488c36ba7a2fba1633709e9858"}},{"ruleId":"D1","level":"warning","message":{"text":"rustdoc::html::format::generate_item_def_id_path (cyclomatic 19): rustdoc::html::format::generate_item_def_id_path 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/librustdoc/html/format.rs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"689ce81deda6772d8289d8375f15664d17c868f4820917087bbbf9b5679a441d"}},{"ruleId":"D1","level":"warning","message":{"text":"rustdoc::html::render::repr_attribute (cyclomatic 19): rustdoc::html::render::repr_attribute 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. This is NOT this file\u0027s highest cyclomatic complexity: ItemSection::id (cyclomatic 25) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/render/mod.rs"},"region":{"startLine":3051}}}],"partialFingerprints":{"codehealthFindingId/v1":"c71dabfc2279cf5592fe8099263e12b3ae4655c8dffe1d8c07adc623608122cd"}},{"ruleId":"D1","level":"warning","message":{"text":"rustdoc::passes::collect_intra_doc_links::preprocess_link (cyclomatic 19): rustdoc::passes::collect_intra_doc_links::preprocess_link has cyclomatic complexity 19 (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. This is NOT this file\u0027s highest cyclomatic complexity: rustdoc::passes::collect_intra_doc_links::resolve_primitive (cyclomatic 29) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/passes/collect_intra_doc_links.rs"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"f10d6a21449c029bb2e6aa2099e3741e7d7cbe9432733aaf31f4d2426c2e46ed"}},{"ruleId":"D1","level":"warning","message":{"text":"rustdoc::passes::collect_trait_impls::collect_trait_impls (cyclomatic 19): rustdoc::passes::collect_trait_impls::collect_trait_impls 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/librustdoc/passes/collect_trait_impls.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e76a35cfdf56d42779da84269033d03a0bdf478a9e7c1f86246e0b18377fdc0"}},{"ruleId":"D1","level":"warning","message":{"text":"NeedlessPassByRefMut::check_fn (cyclomatic 19): NeedlessPassByRefMut::check_fn 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/tools/clippy/clippy_lints/src/needless_pass_by_ref_mut.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e86f64c32391fd703575cf7a7f38e7ce070de6985bd541b283a0e114fe20ebe"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::floating_point_arithmetic::radians::check (cyclomatic 19): clippy_lints::floating_point_arithmetic::radians::check 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/tools/clippy/clippy_lints/src/floating_point_arithmetic/radians.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"76a31095cf9aeaa75ac0fd349ef1319d403307951a13b5dc45834d712aa88ed4"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::implicit_return::lint_implicit_returns (cyclomatic 19): clippy_lints::implicit_return::lint_implicit_returns 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/tools/clippy/clippy_lints/src/implicit_return.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"86d44f0a4eb032d0453a469cd386a04cde78d6339b5f0821936427fd0c4ba5b3"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::literals::mistyped_literal_suffix::check (cyclomatic 19): clippy_lints::literals::mistyped_literal_suffix::check 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/tools/clippy/clippy_lints/src/literals/mistyped_literal_suffix.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cf655da94c1b757054efeb5fb52c94fb6cf2ecd949efa1d28ef4c2bd5086f74"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::manual_let_else::replace_in_pattern (cyclomatic 19): clippy_lints::manual_let_else::replace_in_pattern 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/tools/clippy/clippy_lints/src/manual_let_else.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0f13e96cf42ebc50ee9dd2ea0191884138110c4eb2fdb09c5c46017871d278e"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::methods::iter_overeager_cloned::check (cyclomatic 19): clippy_lints::methods::iter_overeager_cloned::check 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/tools/clippy/clippy_lints/src/methods/iter_overeager_cloned.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cbff3606c10eea4a0c97f1386c816cfb4db0a0181f00a9534726ea3c938d40a"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::methods::option_as_ref_deref::check (cyclomatic 19): clippy_lints::methods::option_as_ref_deref::check 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/tools/clippy/clippy_lints/src/methods/option_as_ref_deref.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"61f49d7735a90c5ae553cdd9a0207e13318168cc2a7b4c7ba830b887d3a803e6"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::methods::or_fun_call::check_unwrap_or_default (cyclomatic 19): clippy_lints::methods::or_fun_call::check_unwrap_or_default 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/tools/clippy/clippy_lints/src/methods/or_fun_call.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"92454376e5793768e3822831e77d1026f3d4e42022bce3a8d508fa61319221a0"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::methods::unnecessary_to_owned::can_change_type (cyclomatic 19): clippy_lints::methods::unnecessary_to_owned::can_change_type 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/tools/clippy/clippy_lints/src/methods/unnecessary_to_owned.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"859c891b069f93986a70e857382264f5adebfd6603ab8bf041af0848fa3eb976"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::returns::needless_return::check_final_expr (cyclomatic 19): clippy_lints::returns::needless_return::check_final_expr 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/tools/clippy/clippy_lints/src/returns/needless_return.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5bec6e5c5c6a2576f154eeda6d1cd7655ef8a591d8a99451180fd4fcf9e5e00"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::transmute::transmute_undefined_repr::reduce_ty (cyclomatic 19): clippy_lints::transmute::transmute_undefined_repr::reduce_ty 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/tools/clippy/clippy_lints/src/transmute/transmute_undefined_repr.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a585fee9110750acc2d4159ebfb3de5c8b86f5841ea9790aba628716f71b16f"}},{"ruleId":"D1","level":"warning","message":{"text":"TestCx::compare_output (cyclomatic 19): TestCx::compare_output 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/tools/compiletest/src/runtest.rs"},"region":{"startLine":2859}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ccf5e6cb6579b40b0d04066bc48a2800800d16eb4889b65b8cfa4eacc81354b"}},{"ruleId":"D1","level":"warning","message":{"text":"compiletest::directives::ignore_llvm (cyclomatic 19): compiletest::directives::ignore_llvm 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/tools/compiletest/src/directives.rs"},"region":{"startLine":1249}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e314610754d7b91c7a8ce376b0da9cb30d023fc5368fc35c45fb194abacd15e"}},{"ruleId":"D1","level":"warning","message":{"text":"Node::trim_clone (cyclomatic 19): Node::trim_clone 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/tools/generate-copyright/src/main.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"78bfb9273a17d7bbf9184eba7baac70bb9667bebfc5c0bec6e6d8b9a17189e22"}},{"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":"src/tools/miri/priroda/src/debugger.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fe141c96e0f368b793a3dbdf25992b6412fe082fe348244e28ec3215b73ffe3"}},{"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/tools/miri/src/borrow_tracker/tree_borrows/mod.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"248ebd9a543ed2ddd0eeadb49f82fdae24877882bf6967cc803814f1c9facf8b"}},{"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/tools/miri/src/shims/unix/linux_like/sync.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"947ffac03835350766d8ffb719aea26d7b0baafe6eb84cac5155ca0d17bbd10d"}},{"ruleId":"D1","level":"warning","message":{"text":"BuiltinDeriveImplTrait::get_method (cyclomatic 19): BuiltinDeriveImplTrait::get_method has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/builtin_derive.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e930d3ddde56937132ecadc8ca57ea768e996226058c9d74aa421af38fbe92b"}},{"ruleId":"D1","level":"warning","message":{"text":"hir_expand::mod_path::convert_path (cyclomatic 19): hir_expand::mod_path::convert_path has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-expand/src/mod_path.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"c709c73b580b5bbd3f2b5bff8b566723f7d75bc545207ad2c0782ad7baebc1b4"}},{"ruleId":"D1","level":"warning","message":{"text":"ExprUseVisitor::walk_pat (cyclomatic 19): ExprUseVisitor::walk_pat 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/tools/rust-analyzer/crates/hir-ty/src/infer/closure/analysis/expr_use_visitor.rs"},"region":{"startLine":879}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce331d01301f43757870e627bbc0aa2182b4123f37a6ecb56a701f65d89d4b4d"}},{"ruleId":"D1","level":"warning","message":{"text":"ProbeContext::consider_probe (cyclomatic 19): ProbeContext::consider_probe 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/tools/rust-analyzer/crates/hir-ty/src/method_resolution/probe.rs"},"region":{"startLine":1567}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfd4b885bb821251e27ebca385b33470268cf51d9a26183fb47052f6a3f75757"}},{"ruleId":"D1","level":"warning","message":{"text":"Evaluator::exec_atomic_intrinsic (cyclomatic 19): Evaluator::exec_atomic_intrinsic 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/tools/rust-analyzer/crates/hir-ty/src/mir/eval/shim.rs"},"region":{"startLine":1511}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fe8caf1f19b765df4305fb3d067d7bcf06cef8ac6317745b72e645f5abbe80a"}},{"ruleId":"D1","level":"warning","message":{"text":"Evaluator::patch_addresses (cyclomatic 19): Evaluator::patch_addresses has cyclomatic complexity 19 (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/tools/rust-analyzer/crates/hir-ty/src/mir/eval.rs"},"region":{"startLine":2396}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dd69dbf38cc1ec36418cb9cfbefb2eafc097cde1e6775a1a20a29de4203139a"}},{"ruleId":"D1","level":"warning","message":{"text":"MirEvalError::pretty_print (cyclomatic 19): MirEvalError::pretty_print has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ide/src/mir_pretty/errors.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"1af5c6ab58349bf8fc4398024c87ee9ceaefac56eaf853fa3aa131df624c7caa"}},{"ruleId":"D1","level":"warning","message":{"text":"ide::inlay_hints::implicit_drop::hints (cyclomatic 19): ide::inlay_hints::implicit_drop::hints 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/tools/rust-analyzer/crates/ide/src/inlay_hints/implicit_drop.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"66a159048ebcb8fb92c64ab7690fc2c61d1c2c535e017748d5e374bbaa8cbf45"}},{"ruleId":"D1","level":"warning","message":{"text":"ide::inlay_hints::param_name::get_segment_representation (cyclomatic 19): ide::inlay_hints::param_name::get_segment_representation has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/inlay_hints/param_name.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6de37267a68ddbdd4f5171babe89f229a307e7e37fa3fc6ed0d736d96a6fe7b"}},{"ruleId":"D1","level":"warning","message":{"text":"ide_assists::handlers::convert_let_else_to_match::remove_mut_and_collect_idents (cyclomatic 19): ide_assists::handlers::convert_let_else_to_match::remove_mut_and_collect_idents 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/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_let_else_to_match.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"919b2a1be75ae614829c8321fb009a6ffd70d48c74c8ac82dcface0af44ccbff"}},{"ruleId":"D1","level":"warning","message":{"text":"ide_db::imports::import_assets::filter_by_definition_kind (cyclomatic 19): ide_db::imports::import_assets::filter_by_definition_kind has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-db/src/imports/import_assets.rs"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"dffe3b1439c3a40dcb02bb9f32d2c5eef44f256fe0ca2160e9f28efd599a856f"}},{"ruleId":"D1","level":"warning","message":{"text":"ide_db::imports::import_assets::validate_resolvable (cyclomatic 19): ide_db::imports::import_assets::validate_resolvable has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-db/src/imports/import_assets.rs"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"223c3f570de86bd10f6611b575c082d573ea9e7070fe871932be5932fc1d85cf"}},{"ruleId":"D1","level":"warning","message":{"text":"ide_db::imports::insert_use::insert_use_with_alias_option_with_editor (cyclomatic 19): ide_db::imports::insert_use::insert_use_with_alias_option_with_editor has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-db/src/imports/insert_use.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfecbebfc65256f1def089a39f27eedcf9b3e066d3a4895b21a31af28e204873"}},{"ruleId":"D1","level":"warning","message":{"text":"ide_db::syntax_helpers::node_ext::for_each_tail_expr (cyclomatic 19): ide_db::syntax_helpers::node_ext::for_each_tail_expr has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-db/src/syntax_helpers/node_ext.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"731acc1797f5cd1272f5537ebc7241db5cf5611abd3e788618c9cece782cbf7e"}},{"ruleId":"D1","level":"warning","message":{"text":"ide_db::traits::diff_assoc_items (cyclomatic 19): ide_db::traits::diff_assoc_items 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/tools/rust-analyzer/crates/ide-db/src/traits.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"1015c321afc38d63f93d816e32757f475ad1c17eb64345729fd2ae55889fadd2"}},{"ruleId":"D1","level":"warning","message":{"text":"ProjectFolders::new (cyclomatic 19): ProjectFolders::new has cyclomatic complexity 19 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/load-cargo/src/lib.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b4e2a1e6d304a135f1ec7c11bbe25f17aeeca4c639b9a36e966f2688e1d6c7e"}},{"ruleId":"D1","level":"warning","message":{"text":"mbe::parser::eat_fragment_kind (cyclomatic 19): mbe::parser::eat_fragment_kind has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/mbe/src/parser.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"23b460eba75a3b9aeb1710162864c5fb352077aac36bda76bb68d20e5ce18a36"}},{"ruleId":"D1","level":"warning","message":{"text":"Writer::subtree (cyclomatic 19): Writer::subtree 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/tools/rust-analyzer/crates/proc-macro-api/src/legacy_protocol/msg/flat.rs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"aea6382fc4318fa6ea97a12f640864b4b23d0b2bdacf5ac04889e702bc295788"}},{"ruleId":"D1","level":"warning","message":{"text":"Writer::group (cyclomatic 19): Writer::group has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/proc-macro-api/src/legacy_protocol/msg/flat.rs"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"b775d93975daace51fbbeb97facaa31e9ee55d945f9f0b16a1dbf06ef6dfe23a"}},{"ruleId":"D1","level":"warning","message":{"text":"Expr::binding_power (cyclomatic 19): Expr::binding_power has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: Expr::is_ordered_before_parent_in_place_of::order (cyclomatic 23) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/syntax/src/ast/prec.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa9521272507875a3e7467dc08c46091b5c5c3235b2cf0fc6b40107ccd5ea0dd"}},{"ruleId":"D1","level":"warning","message":{"text":"syntax::ast::prec::precedence (cyclomatic 19): syntax::ast::prec::precedence has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: Expr::is_ordered_before_parent_in_place_of::order (cyclomatic 23) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/syntax/src/ast/prec.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"473acb7a797a632ad7910bdc8ed5bd755fd29252d6c9fcd23eddacd6d7942498"}},{"ruleId":"D1","level":"warning","message":{"text":"TtTreeSink::token (cyclomatic 19): TtTreeSink::token has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/syntax-bridge/src/lib.rs"},"region":{"startLine":933}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bf0557279979593f1f58e444a92547825075eeb71c794b6ec17dcb4fce2ce51"}},{"ruleId":"D1","level":"warning","message":{"text":"rustfmt_nightly::comment::combine_strs_with_missing_comments (cyclomatic 19): rustfmt_nightly::comment::combine_strs_with_missing_comments 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/tools/rustfmt/src/comment.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"65518ef6314c8a039a18a23ba497a84ce4730c5a170ad2ccc3fde66315fda1cb"}},{"ruleId":"D1","level":"warning","message":{"text":"main.handleShortcut (cyclomatic 19): main.handleShortcut has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/main.js"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e876d9491ff2211461d79b8007ba66eaeb32b92046752593995a2553c047cfb"}},{"ruleId":"D1","level":"warning","message":{"text":"main.register_implementors (cyclomatic 19): main.register_implementors has cyclomatic complexity 19 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 5 belong to 3 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":"src/librustdoc/html/static/js/main.js"},"region":{"startLine":791}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ee8ca1f5a108e0597fcd43147bb48aa55febad96dedccc40519bc17eaac8fb3"}},{"ruleId":"D1","level":"warning","message":{"text":"SuffixTrie.substringMatches (cyclomatic 19): SuffixTrie.substringMatches 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/librustdoc/html/static/js/stringdex.js"},"region":{"startLine":2447}}}],"partialFingerprints":{"codehealthFindingId/v1":"8265a4af3fc94c1ece59e0bbd124f1b38d787e16223fe52c8037c6901eb3396f"}},{"ruleId":"D1","level":"warning","message":{"text":"loadDatabase::substringMatches (cyclomatic 19): loadDatabase::substringMatches 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/librustdoc/html/static/js/stringdex.js"},"region":{"startLine":2447}}}],"partialFingerprints":{"codehealthFindingId/v1":"b882c27470eeff3ea923a11d7aec3bd639ff13dd54295d0c3d5c6d5cb9f73870"}},{"ruleId":"D1","level":"warning","message":{"text":"TyAndLayout::homogeneous_aggregate (cyclomatic 18): TyAndLayout::homogeneous_aggregate 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":"compiler/rustc_abi/src/callconv.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"93d648c5e66adf6c21214b827d72bee48d43962e467b554906803a3c92bd4101"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutCalculator::layout_of_union (cyclomatic 18): LayoutCalculator::layout_of_union 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":"compiler/rustc_abi/src/layout.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecb997b0d4d4b5d4cd4156f2a25940964d1a40d8200d7808fa2f74f20c8f2f6f"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_attr_parsing::check_cfg::unexpected_cfg_value (cyclomatic 18): rustc_attr_parsing::check_cfg::unexpected_cfg_value has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_attr_parsing/src/check_cfg.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"c74e7d6d2734f968f74c5df40c662b89c068e08907b0688ca59f48f0dfa8c5a5"}},{"ruleId":"D1","level":"warning","message":{"text":"MirBorrowckCtxt::later_use_kind (cyclomatic 18): MirBorrowckCtxt::later_use_kind 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":"compiler/rustc_borrowck/src/diagnostics/explain_borrow.rs"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf2c7f66dd3007c409e73ab640898d7da130d6fc6ff76be9028253a7d61ef2c3"}},{"ruleId":"D1","level":"warning","message":{"text":"MirBorrowckCtxt::give_name_if_anonymous_region_appears_in_output (cyclomatic 18): MirBorrowckCtxt::give_name_if_anonymous_region_appears_in_output 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":"compiler/rustc_borrowck/src/diagnostics/region_name.rs"},"region":{"startLine":814}}}],"partialFingerprints":{"codehealthFindingId/v1":"41097332002b179ed33b10373dfe619d402c87eeb6ccfaee643c82a145c86995"}},{"ruleId":"D1","level":"warning","message":{"text":"MirBorrowckCtxt::visit_after_early_terminator_effect (cyclomatic 18): MirBorrowckCtxt::visit_after_early_terminator_effect 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":"compiler/rustc_borrowck/src/lib.rs"},"region":{"startLine":882}}}],"partialFingerprints":{"codehealthFindingId/v1":"233580e802312133d0af72e6f5c4575d13da8b1367d72156ae539cec1a4e27bf"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_borrowck::diagnostics::bound_region_errors::try_extract_error_from_region_constraints (cyclomatic 18): rustc_borrowck::diagnostics::bound_region_errors::try_extract_error_from_region_constraints 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":"compiler/rustc_borrowck/src/diagnostics/bound_region_errors.rs"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"27f27799b3b8103c053d6f70b8e0f90a0d2210813838394dfcceca63ccc76860"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_builtin_macros::deriving::debug::debug_body (cyclomatic 18): rustc_builtin_macros::deriving::debug::debug_body 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":"compiler/rustc_builtin_macros/src/deriving/debug.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"930b94cb9341a5c045e7e98f730e30d9da573dbe0cd244c58858621b2bbc6150"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_codegen_cranelift::num::codegen_int_binop (cyclomatic 18): rustc_codegen_cranelift::num::codegen_int_binop 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":"compiler/rustc_codegen_cranelift/src/num.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"179afa6eee614536421b8b180169ab1436dcc09911ac2480abed8cdf5f2bdfce"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_codegen_llvm::attributes::sanitize_attrs (cyclomatic 18): rustc_codegen_llvm::attributes::sanitize_attrs 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":"compiler/rustc_codegen_llvm/src/attributes.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"8319f85fdf0efc7ab9ec5c02fd4a4b5ba6201bfd51c123eae4b28ce5d581d9d2"}},{"ruleId":"D1","level":"warning","message":{"text":"LinkingFailed::into_diag (cyclomatic 18): LinkingFailed::into_diag 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. This is NOT this file\u0027s highest cyclomatic complexity: ThorinErrorWrapper::into_diag (cyclomatic 40) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/diagnostics.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"26b881e121b43db0c82aa248425ef50f0aa58484df1fcce69dba6ca2d3fd9c46"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_codegen_ssa::mir::codegen_mir (cyclomatic 18): rustc_codegen_ssa::mir::codegen_mir has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/mir/mod.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"072da9ae05fd0ad38a138fa22a09ff11b955a6209503f84cb9b6fb9acd3f9821"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_driver_impl::pretty::print (cyclomatic 18): rustc_driver_impl::pretty::print 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":"compiler/rustc_driver_impl/src/pretty.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"e84783addf16e18e7406ccf24494e0e21ffeb47ffcd122930ff9315b4cdeef6e"}},{"ruleId":"D1","level":"warning","message":{"text":"WrongNumberOfGenericArgs::get_lifetime_args_suggestions_from_param_names (cyclomatic 18): WrongNumberOfGenericArgs::get_lifetime_args_suggestions_from_param_names 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":"compiler/rustc_hir_analysis/src/diagnostics/wrong_number_of_generic_args.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"cff494632ac9ea2aaeed1fa65e0fd2060a59ab8a15b947314cdbf17de10f60d2"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_hir_analysis::check::wfcheck::check_where_clauses (cyclomatic 18): rustc_hir_analysis::check::wfcheck::check_where_clauses 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":"compiler/rustc_hir_analysis/src/check/wfcheck.rs"},"region":{"startLine":1447}}}],"partialFingerprints":{"codehealthFindingId/v1":"a90b340451cc861b90ee9ebf3b311e1c4b7f2c7d9667b5f3fe8c7518fb78d267"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_hir_analysis::variance::variance_of_opaque (cyclomatic 18): rustc_hir_analysis::variance::variance_of_opaque 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":"compiler/rustc_hir_analysis/src/variance/mod.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"c166a3e044448e3ae3f7b69cfee42b155f602cd29743c9467577e5552db0ce83"}},{"ruleId":"D1","level":"warning","message":{"text":"FnCtxt::check_expr_with_expectation_and_args (cyclomatic 18): FnCtxt::check_expr_with_expectation_and_args 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. This is NOT this file\u0027s highest cyclomatic complexity: FnCtxt::check_expr_kind (cyclomatic 35) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/expr.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddeabd2fee8e373b90a16eb3a4ab04a5511f2cc7d0f2e9d480fe78911751cd24"}},{"ruleId":"D1","level":"warning","message":{"text":"Resolver::add_scope_set_candidates (cyclomatic 18): Resolver::add_scope_set_candidates 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":"compiler/rustc_resolve/src/diagnostics/impls.rs"},"region":{"startLine":1531}}}],"partialFingerprints":{"codehealthFindingId/v1":"112d21814905581429256e57c8d825cf762c8e74433403a3555adaa581c70cd1"}},{"ruleId":"D1","level":"warning","message":{"text":"Resolver::ambiguity_diagnostic (cyclomatic 18): Resolver::ambiguity_diagnostic has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/diagnostics/impls.rs"},"region":{"startLine":2453}}}],"partialFingerprints":{"codehealthFindingId/v1":"23557c92fd00cd01c051ed1506b48cb44a4aa36fce34155226675d264e5d0178"}},{"ruleId":"D1","level":"warning","message":{"text":"Resolver::check_for_module_export_macro (cyclomatic 18): Resolver::check_for_module_export_macro 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":"compiler/rustc_resolve/src/diagnostics/impls.rs"},"region":{"startLine":3684}}}],"partialFingerprints":{"codehealthFindingId/v1":"0918bb8accc4e1a69158e70565a8f777f01bdba103db2630fa4e95ee8c274a31"}},{"ruleId":"D1","level":"warning","message":{"text":"Resolver::resolve_ident_in_module_globs_unadjusted (cyclomatic 18): Resolver::resolve_ident_in_module_globs_unadjusted 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":"compiler/rustc_resolve/src/ident.rs"},"region":{"startLine":1220}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5a204abc603ccb02303169f2723fcc878249879502099672c5bc5179ddb7acf"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_hir_typeck::extend_err_with_const_context (cyclomatic 18): rustc_hir_typeck::extend_err_with_const_context 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":"compiler/rustc_hir_typeck/src/lib.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"15f7b3296b2f7e97007e2a038304ea3070a71216e499b4b62a6972b95c21c174"}},{"ruleId":"D1","level":"warning","message":{"text":"LexicalResolver::expansion (cyclomatic 18): LexicalResolver::expansion 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":"compiler/rustc_infer/src/infer/lexical_region_resolve/mod.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"90e56d719800998c69510db9b0097596643ed037acd18bb105d56011f2c5ad88"}},{"ruleId":"D1","level":"warning","message":{"text":"NonLocalDefinitions::check_item (cyclomatic 18): NonLocalDefinitions::check_item 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":"compiler/rustc_lint/src/non_local_def.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"e34a514fc7035075191a919fb615f13351f3af97ae83d3cb848d30c7056d6506"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_lint::lifetime_syntax::emit_mismatch_diagnostic (cyclomatic 18): rustc_lint::lifetime_syntax::emit_mismatch_diagnostic 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":"compiler/rustc_lint/src/lifetime_syntax.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"589f9991227fd83edbdd06e552a2d5b31f8dbfcbdc1e50dfb7c36b39092828aa"}},{"ruleId":"D1","level":"warning","message":{"text":"CrateLocator::extract_one (cyclomatic 18): CrateLocator::extract_one 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":"compiler/rustc_metadata/src/locator.rs"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ced3b0a5044da47b9cce4d20462532c5ea07308c107691f6531357f3b934f06"}},{"ruleId":"D1","level":"warning","message":{"text":"TerminatorKind::successors_mut (cyclomatic 18): TerminatorKind::successors_mut 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. This is NOT this file\u0027s highest cyclomatic complexity: AssertKind::fmt_assert_args (cyclomatic 28) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/mir/terminator.rs"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc13253660bb4260152610de2dcf7f9a1194da6473648cb94f34688cc4c14847"}},{"ruleId":"D1","level":"warning","message":{"text":"PrettyPrinter::try_print_visible_def_path_recur (cyclomatic 18): PrettyPrinter::try_print_visible_def_path_recur 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":"compiler/rustc_middle/src/ty/print/pretty.rs"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ff85144aabdbbdfb7689e39ac2655741531583a4cb61fea63cb8ba97e1b30b3"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_middle::mir::pretty::write_allocations (cyclomatic 18): rustc_middle::mir::pretty::write_allocations has cyclomatic complexity 18 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: TerminatorKind::fmt_successor_labels (cyclomatic 21) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/mir/pretty.rs"},"region":{"startLine":1584}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b56fc5db2a0430becde820d796b9618a73dd1645c3b13cdc35c6b7c6287212a"}},{"ruleId":"D1","level":"warning","message":{"text":"Builder::as_temp (cyclomatic 18): Builder::as_temp has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_build/src/builder/expr/as_temp.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed48234ba57d26cb2c9946896000f035136ce921afe9f3e1c0123f76b3df9684"}},{"ruleId":"D1","level":"warning","message":{"text":"Builder::stmt_expr (cyclomatic 18): Builder::stmt_expr 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":"compiler/rustc_mir_build/src/builder/expr/stmt.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2c3c5bd963a6c7c4653b74a87b9a7d8d454f3814f42644752c94b07bd94d381"}},{"ruleId":"D1","level":"warning","message":{"text":"UnsafetyVisitor::visit_pat (cyclomatic 18): UnsafetyVisitor::visit_pat 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. This is NOT this file\u0027s highest cyclomatic complexity: UnsafeOpKind::emit_requires_unsafe_err (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_build/src/check_unsafety.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"f46a2a21624c860b243b5faa51115006fb610b6223eeaecc0fc267fb0e645d69"}},{"ruleId":"D1","level":"warning","message":{"text":"AddCallGuards::run_pass (cyclomatic 18): AddCallGuards::run_pass 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":"compiler/rustc_mir_transform/src/add_call_guards.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bfc8a1811ec0062b4eda910faa6e092234b2e2ea7e2538c26a0b33baee1003b"}},{"ruleId":"D1","level":"warning","message":{"text":"VnState::simplify_binary_inner (cyclomatic 18): VnState::simplify_binary_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":"compiler/rustc_mir_transform/src/gvn.rs"},"region":{"startLine":1442}}}],"partialFingerprints":{"codehealthFindingId/v1":"023e5b57789e17580f73fbfeba70e2c0de3ec4f6c544b86b09f8d13cb61e13e6"}},{"ruleId":"D1","level":"warning","message":{"text":"TOFinder::process_switch_int (cyclomatic 18): TOFinder::process_switch_int 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":"compiler/rustc_mir_transform/src/jump_threading.rs"},"region":{"startLine":680}}}],"partialFingerprints":{"codehealthFindingId/v1":"8db737d095f41e2af9c607db91fae8a938b7b97e933cbc7710ebd70d8e433f5c"}},{"ruleId":"D1","level":"warning","message":{"text":"AssignmentResult::find_dead_assignments (cyclomatic 18): AssignmentResult::find_dead_assignments 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":"compiler/rustc_mir_transform/src/liveness.rs"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc9ab4eb25a1b2b5fc4b2f1c34ddf789fd918dcf3cf4c4a47edbada594c2310d"}},{"ruleId":"D1","level":"warning","message":{"text":"SimplifyMatch::unify_by_copy (cyclomatic 18): SimplifyMatch::unify_by_copy 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":"compiler/rustc_mir_transform/src/match_branches.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"76590426dbd61396340b37b7494f5a581ecb45101caf9787fe7dfc3ee9a52e73"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_mir_transform::dest_prop::save_as_intervals (cyclomatic 18): rustc_mir_transform::dest_prop::save_as_intervals 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":"compiler/rustc_mir_transform/src/dest_prop.rs"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebe8f0c72c5edc7b15a538e436e889b845b04a581c8ae7560badf0b055c87c80"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::recover_stmt_ (cyclomatic 18): Parser::recover_stmt_ 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":"compiler/rustc_parse/src/parser/diagnostics.rs"},"region":{"startLine":1922}}}],"partialFingerprints":{"codehealthFindingId/v1":"6709b278a243ecd6722eb47e85d312d6fef274f1ba4088307df37f9d9f8c1ace"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::parse_pat_no_top_guard_inner (cyclomatic 18): Parser::parse_pat_no_top_guard_inner 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":"compiler/rustc_parse/src/parser/pat.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"c42dfcb622ffaae2f645076a419661a3e4c9330c70cc6ba66c610c26f542a531"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_passes::dead::lint_dead_codes (cyclomatic 18): rustc_passes::dead::lint_dead_codes 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":"compiler/rustc_passes/src/dead.rs"},"region":{"startLine":1611}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f820acb9c4115dc37d62d87d0b35a03e2a177ffd7052f566b0638fe80ea5924"}},{"ruleId":"D1","level":"warning","message":{"text":"LateResolutionVisitor::smart_resolve_report_errors (cyclomatic 18): LateResolutionVisitor::smart_resolve_report_errors has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/late/diagnostics.rs"},"region":{"startLine":671}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f85939192e052fdc617e19dae1346eef97bf1b80fabecfdc238925fb0b4ed14"}},{"ruleId":"D1","level":"warning","message":{"text":"LateResolutionVisitor::lookup_typo_candidate (cyclomatic 18): LateResolutionVisitor::lookup_typo_candidate 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":"compiler/rustc_resolve/src/late/diagnostics.rs"},"region":{"startLine":3362}}}],"partialFingerprints":{"codehealthFindingId/v1":"950f81fbc99996426f682d405c8c2e723990d8a76cd7836f2e5fffd60219729b"}},{"ruleId":"D1","level":"warning","message":{"text":"LateResolutionVisitor::suggest_adding_generic_parameter (cyclomatic 18): LateResolutionVisitor::suggest_adding_generic_parameter 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":"compiler/rustc_resolve/src/late/diagnostics.rs"},"region":{"startLine":3973}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d5df9fb54ce3bd0a4b017697e903c39e464fdd6bc1e52cebb63b64607075f3b"}},{"ruleId":"D1","level":"warning","message":{"text":"LateResolutionVisitor::resolve_anonymous_lifetime (cyclomatic 18): LateResolutionVisitor::resolve_anonymous_lifetime 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. This is NOT this file\u0027s highest cyclomatic complexity: PathSource::is_expected (cyclomatic 22) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/late.rs"},"region":{"startLine":2037}}}],"partialFingerprints":{"codehealthFindingId/v1":"35510addabd3d15a9352815df60a2a2b4c06577cc3f86f845ff9881040e99db9"}},{"ruleId":"D1","level":"warning","message":{"text":"LateResolutionVisitor::resolve_fn_params (cyclomatic 18): LateResolutionVisitor::resolve_fn_params 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. This is NOT this file\u0027s highest cyclomatic complexity: PathSource::is_expected (cyclomatic 22) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/late.rs"},"region":{"startLine":2645}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0c9f6134c424fb8b6009b77f999a36be8b1cd6f2c3a5675c781186d131252e7"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_sanitizers::cfi::typeid::itanium_cxx_abi::encode::encode_const_value (cyclomatic 18): rustc_sanitizers::cfi::typeid::itanium_cxx_abi::encode::encode_const_value 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":"compiler/rustc_sanitizers/src/cfi/typeid/itanium_cxx_abi/encode.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c437c3e12993675a92ba83c81da15f6e16142a6e986b6ae57181b79256d77d9"}},{"ruleId":"D1","level":"warning","message":{"text":"FnAbi::apply_attrs_callsite (cyclomatic 18): FnAbi::apply_attrs_callsite 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":"compiler/rustc_codegen_llvm/src/abi.rs"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"08dca1750dd47893ea711d95ddf7573e7a102d80145d0cc9c7f2a5611eff2512"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_target::callconv::powerpc64::classify (cyclomatic 18): rustc_target::callconv::powerpc64::classify has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_target/src/callconv/powerpc64.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a26a84a06319af6fad68a57abe161ba519d21f9b924d59985e3117bc872cee3"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_target::callconv::riscv::should_use_fp_conv_helper (cyclomatic 18): rustc_target::callconv::riscv::should_use_fp_conv_helper 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":"compiler/rustc_target/src/callconv/riscv.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9936ec90008ec65dfea46cd8446c0c098ea064b4c3ee1b7aa9ac81fda13654e"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_target::callconv::x86_win32::compute_abi_info (cyclomatic 18): rustc_target::callconv::x86_win32::compute_abi_info 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":"compiler/rustc_target/src/callconv/x86_win32.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aeb96974a2bc834161b8962f00a59230140dfffde97bd7bd2fa4a69a4d1c9b0"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeErrCtxt::type_error_additional_suggestions (cyclomatic 18): TypeErrCtxt::type_error_additional_suggestions 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":"compiler/rustc_trait_selection/src/error_reporting/infer/mod.rs"},"region":{"startLine":1996}}}],"partialFingerprints":{"codehealthFindingId/v1":"62ae6759f397975ee116dc133bed44e1f184adee0333d22e5fcd8c3d45e2ecc5"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeErrCtxt::annotate_source_of_ambiguity (cyclomatic 18): TypeErrCtxt::annotate_source_of_ambiguity 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":"compiler/rustc_trait_selection/src/error_reporting/traits/ambiguity.rs"},"region":{"startLine":822}}}],"partialFingerprints":{"codehealthFindingId/v1":"69c57bb8c4b0a31de945e28b8bc914b058d98d8249191d77c60f5252d3602fe6"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_trait_selection::traits::misc::type_allowed_to_implement_const_param_ty (cyclomatic 18): rustc_trait_selection::traits::misc::type_allowed_to_implement_const_param_ty 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":"compiler/rustc_trait_selection/src/traits/misc.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dfb9de36051fc40cc50f409ef1934a7bdfb639bbc6a409d0d835e4e20813652"}},{"ruleId":"D1","level":"warning","message":{"text":"NormalizesTo::consider_impl_candidate (cyclomatic 18): NormalizesTo::consider_impl_candidate 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":"compiler/rustc_next_trait_solver/src/solve/normalizes_to.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b36dce9394931b40e91646352ad6e49c80a3c73044f44eb905a00d50d20ff42"}},{"ruleId":"D1","level":"warning","message":{"text":"libm::math::expm1::expm1 (cyclomatic 18): libm::math::expm1::expm1 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":"library/compiler-builtins/libm/src/math/expm1.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"df947751872c707af99400e4844a6c59eedaf2bf3bac078a162ed4280ffabf02"}},{"ruleId":"D1","level":"warning","message":{"text":"libm::math::expm1f::expm1f (cyclomatic 18): libm::math::expm1f::expm1f 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":"library/compiler-builtins/libm/src/math/expm1f.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"5128128b1b1a78a2e89ff1ac17c38f66cef0bd0cdf8f1957eececb3aa5bc7efe"}},{"ruleId":"D1","level":"warning","message":{"text":"libm::math::sincosf::sincosf (cyclomatic 18): libm::math::sincosf::sincosf 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":"library/compiler-builtins/libm/src/math/sincosf.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cd0bf45682b042c9024330059981dd632814ce0f987f6bcf6e5ef492a8416eb"}},{"ruleId":"D1","level":"warning","message":{"text":"Utf8Chunks::next (cyclomatic 18): Utf8Chunks::next 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":"library/core/src/str/lossy.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"36b5fe9992b6e1a27b929f3fd0d2c2a70b90884578291cdef8945e83b36a12f6"}},{"ruleId":"D1","level":"warning","message":{"text":"core::num::imp::dec2flt::slow::parse_long_mantissa (cyclomatic 18): core::num::imp::dec2flt::slow::parse_long_mantissa 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":"library/core/src/num/imp/dec2flt/slow.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b54a7f7d3290e31c71031dace8d11b537af63997908060438a8159f91981f35"}},{"ruleId":"D1","level":"warning","message":{"text":"std::sys::args::windows::parse_lp_cmd_line (cyclomatic 18): std::sys::args::windows::parse_lp_cmd_line 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":"library/std/src/sys/args/windows.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb4c8a7d8a9aceeb5ad021ac1980475c964735d2b16f75ed6391865cd924518e"}},{"ruleId":"D1","level":"warning","message":{"text":"Intrinsic::defer_to_existing_llvm_link (cyclomatic 18): Intrinsic::defer_to_existing_llvm_link 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":"library/stdarch/crates/stdarch-gen-arm/src/intrinsic.rs"},"region":{"startLine":1549}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6549a194e989b42e49fbea55d5ced06ec590be6d198b9203c59539ed2f8d6b1"}},{"ruleId":"D1","level":"warning","message":{"text":"bootstrap::core::build_steps::dist::copy_src_dirs (cyclomatic 18): bootstrap::core::build_steps::dist::copy_src_dirs has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 4 of the 18 points are its own statements and the rest belongs to one function item inside it that branches (filter_fn). 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/bootstrap/src/core/build_steps/dist.rs"},"region":{"startLine":1072}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b7bbbbea8ecc1bf788684d4da500bbde342ecee985c3fe4726dad21b633cabc"}},{"ruleId":"D1","level":"warning","message":{"text":"bootstrap::core::build_steps::tool::prepare_tool_cargo (cyclomatic 18): bootstrap::core::build_steps::tool::prepare_tool_cargo has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/build_steps/tool.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba7784c7e5cfb4ef04ae42331a70914a442e907d7a1913d10d4d23e1354e810f"}},{"ruleId":"D1","level":"warning","message":{"text":"bootstrap::core::builder::cli_paths::match_paths_to_steps_and_run (cyclomatic 18): bootstrap::core::builder::cli_paths::match_paths_to_steps_and_run 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/bootstrap/src/core/builder/cli_paths.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"283a5a8b2dcf1064feb53056e1a4a3873476cb9a2a38b1709efdad582938aa43"}},{"ruleId":"D1","level":"warning","message":{"text":"bootstrap::utils::cc_detect::default_compiler (cyclomatic 18): bootstrap::utils::cc_detect::default_compiler 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/bootstrap/src/utils/cc_detect.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"6928de5acacfafad7b89333ad1ff2c401bf789d40cb8b560c89fcd3dc8fb94fd"}},{"ruleId":"D1","level":"warning","message":{"text":"DocTestBuilder::generate_unique_doctest (cyclomatic 18): DocTestBuilder::generate_unique_doctest 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/librustdoc/doctest/make.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b45c373dee7e3aa58377a2f3a37c89080f5c41e25a817b0f4cbe479c5dbea5e"}},{"ruleId":"D1","level":"warning","message":{"text":"LinkReplacerInner::handle_event (cyclomatic 18): LinkReplacerInner::handle_event 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/librustdoc/html/markdown.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"1361bb4c46af70349edbed745f99269b0bf764251598c442524a9a5409faf10b"}},{"ruleId":"D1","level":"warning","message":{"text":"TagParser::extract_html_tag (cyclomatic 18): TagParser::extract_html_tag 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. This is NOT this file\u0027s highest cyclomatic complexity: rustdoc::passes::lint::html_tags::markdown_tag_name (cyclomatic 19) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/passes/lint/html_tags.rs"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"fef66be2430484615dc6aa1ddb9b0611d989a5ebb8aa3c19973d6a56b1ace752"}},{"ruleId":"D1","level":"warning","message":{"text":"FindCalls::visit_expr (cyclomatic 18): FindCalls::visit_expr 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/librustdoc/scrape_examples.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f68b62085e0fb7d7b926da6cf319f22f6ccbf550579c4803959ecdd122790ee"}},{"ruleId":"D1","level":"warning","message":{"text":"rustdoc::clean::clean_ty_generics_inner (cyclomatic 18): rustdoc::clean::clean_ty_generics_inner has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/clean/mod.rs"},"region":{"startLine":885}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf7ab78a6eae4b461e5bbb711bfca0957fa7e8865eccf09e70fecb0502880ca0"}},{"ruleId":"D1","level":"warning","message":{"text":"rustdoc::clean::clean_maybe_renamed_item (cyclomatic 18): rustdoc::clean::clean_maybe_renamed_item 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/librustdoc/clean/mod.rs"},"region":{"startLine":2903}}}],"partialFingerprints":{"codehealthFindingId/v1":"424e330f3847d99b793a06ebd9d7c7d5e1d191a693a7992d22862ffe885dba25"}},{"ruleId":"D1","level":"warning","message":{"text":"rustdoc::html::highlight::write_code (cyclomatic 18): rustdoc::html::highlight::write_code 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. This is NOT this file\u0027s highest cyclomatic complexity: Class::as_html (cyclomatic 19) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/highlight.rs"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"95594bd0a365c31cf8b8827cf37ffa37707bee17a92cc643ea0e1f2d5347d529"}},{"ruleId":"D1","level":"warning","message":{"text":"ArbitrarySourceItemOrdering::check_mod (cyclomatic 18): ArbitrarySourceItemOrdering::check_mod 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/tools/clippy/clippy_lints/src/arbitrary_source_item_ordering.rs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"02358ef5a9909e06174ceec9bab73d40ffc8536191a8f6be2f2982c2c7347e0b"}},{"ruleId":"D1","level":"warning","message":{"text":"PostExpansionEarlyAttributes::check_attribute (cyclomatic 18): PostExpansionEarlyAttributes::check_attribute 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/tools/clippy/clippy_lints/src/attrs/mod.rs"},"region":{"startLine":663}}}],"partialFingerprints":{"codehealthFindingId/v1":"f96a3d844d4bc769a00ec1c9639f72f18ae021326405760709493c8034ebd3ce"}},{"ruleId":"D1","level":"warning","message":{"text":"Default::check_block (cyclomatic 18): Default::check_block 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/tools/clippy/clippy_lints/src/default.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"040d5f46fdaf86eb433b3818724077b7398be32cd11a53dee943f43161e9383e"}},{"ruleId":"D1","level":"warning","message":{"text":"InsertSearcher::visit_expr (cyclomatic 18): InsertSearcher::visit_expr 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/tools/clippy/clippy_lints/src/entry.rs"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"883cc26c1adbc8c26a05faa7ac216e46a75de6ce09b9bd673f2968e63d24bbd8"}},{"ruleId":"D1","level":"warning","message":{"text":"UselessFormat::check_expr (cyclomatic 18): UselessFormat::check_expr 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/tools/clippy/clippy_lints/src/format.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"3babe71b82a8cb3ab66e465da063ff19a60e43ab910af7ba2b5b891a76c7de7c"}},{"ruleId":"D1","level":"warning","message":{"text":"Loops::check_expr (cyclomatic 18): Loops::check_expr 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/tools/clippy/clippy_lints/src/loops/mod.rs"},"region":{"startLine":859}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf11aa0aeccd2c177688f71f9c61d766777f2a5347e680753e89ace70bd9ce62"}},{"ruleId":"D1","level":"warning","message":{"text":"InitializeVisitor::visit_expr (cyclomatic 18): InitializeVisitor::visit_expr 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/tools/clippy/clippy_lints/src/loops/utils.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9383898f07a95588bc2cb9788cacec48a9415136bdc9cba034614d262107d10"}},{"ruleId":"D1","level":"warning","message":{"text":"ManualOptionAsSlice::check_expr (cyclomatic 18): ManualOptionAsSlice::check_expr 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/tools/clippy/clippy_lints/src/manual_option_as_slice.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"a187b855a128bd16472ef11ccf43b08e23a3f3a95d53c16684abc26e35bb4e49"}},{"ruleId":"D1","level":"warning","message":{"text":"OffendingFilterExpr::check_map_call (cyclomatic 18): OffendingFilterExpr::check_map_call 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/tools/clippy/clippy_lints/src/methods/filter_map.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3b848e8dcd6d6cf0c79063f4da936fa15e34f4cca37d97ed0a313e9a0a355df"}},{"ruleId":"D1","level":"warning","message":{"text":"NewWithoutDefault::check_item (cyclomatic 18): NewWithoutDefault::check_item 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/tools/clippy/clippy_lints/src/new_without_default.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc5294bc346fcc62203a8b6dd4624c21fe9bbb28e7697c8e16076151615d6f9b"}},{"ruleId":"D1","level":"warning","message":{"text":"SimilarNamesNameVisitor::check_ident (cyclomatic 18): SimilarNamesNameVisitor::check_ident 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/tools/clippy/clippy_lints/src/non_expressive_names.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"62055c478ec70a74c0a5d0c15fc639547452308deeccae4abaeacd17e1886591"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::doc::markdown::check_word (cyclomatic 18): clippy_lints::doc::markdown::check_word has cyclomatic complexity 18 (threshold 15). Of this number, 10 points are the body\u0027s own statements and 8 belong to 3 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/doc/markdown.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc59d0112e1678374f57f1e89c253996b943d106cfd6319d03e80ff8cdf040c1"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::matches::single_match::report_single_pattern (cyclomatic 18): clippy_lints::matches::single_match::report_single_pattern 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/tools/clippy/clippy_lints/src/matches/single_match.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"3412a04a0b5b0ce7f2aa6cb1740a9c3c48215fcd54935d04aef6c58ebb2ecac5"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::methods::iter_on_single_or_empty_collections::check (cyclomatic 18): clippy_lints::methods::iter_on_single_or_empty_collections::check 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/tools/clippy/clippy_lints/src/methods/iter_on_single_or_empty_collections.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"d078a8744869b433c883c618d6fa131a6400a14ca643890f34cc9cbbb80b340a"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::methods::str_splitn::parse_iter_usage (cyclomatic 18): clippy_lints::methods::str_splitn::parse_iter_usage 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/tools/clippy/clippy_lints/src/methods/str_splitn.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"9986d898caff6e7b7fcebc1fb91b69a421601979c048a143dbaf0d16e50be5ab"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::methods::useless_asref::check (cyclomatic 18): clippy_lints::methods::useless_asref::check 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/tools/clippy/clippy_lints/src/methods/useless_asref.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6cb9c6255adf4dad853139c59f7d08350e39850c655a18142c9256a82f954c1"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::ranges::can_switch_ranges (cyclomatic 18): clippy_lints::ranges::can_switch_ranges has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/ranges.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bee52ad8c0e852269446e0f03a9130fb764e4c992b3dc5b45c7115f8f71f0de"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::suspicious_operation_groupings::check_binops (cyclomatic 18): clippy_lints::suspicious_operation_groupings::check_binops 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/tools/clippy/clippy_lints/src/suspicious_operation_groupings.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8a720fcfbfdf765ade203f0903f7b45bd502526e324a371bc9713affa423ec6"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::undocumented_unsafe_blocks::text_has_safety_comment (cyclomatic 18): clippy_lints::undocumented_unsafe_blocks::text_has_safety_comment 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/tools/clippy/clippy_lints/src/undocumented_unsafe_blocks.rs"},"region":{"startLine":801}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f7496d241f907f0cfd6a9ff83782713860a8131d0a4b9b423c659fcb811e505"}},{"ruleId":"D1","level":"warning","message":{"text":"HirEqInterExpr::eq_pat (cyclomatic 18): HirEqInterExpr::eq_pat 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. This is NOT this file\u0027s highest cyclomatic complexity: clippy_utils::hir_utils::has_ambiguous_literal_in_expr (cyclomatic 19) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_utils/src/hir_utils.rs"},"region":{"startLine":796}}}],"partialFingerprints":{"codehealthFindingId/v1":"11e3cc42e6466b9cc77ce2ff1653c59527854b67496e095464140e087549ef6b"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_utils::expr_use_sites (cyclomatic 18): clippy_utils::expr_use_sites 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/tools/clippy/clippy_utils/src/lib.rs"},"region":{"startLine":2698}}}],"partialFingerprints":{"codehealthFindingId/v1":"03f6303b8eac18186d5c295f44d2c13ca2b50d70b8d96a8c4d16ab06a83fc009"}},{"ruleId":"D1","level":"warning","message":{"text":"Args::parse (cyclomatic 18): Args::parse has cyclomatic complexity 18 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. 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/tools/clippy/src/main.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce302010f8283c9cdd2a06061a58aca14f69248fa5184ecbd8ebfb2354aa10f7"}},{"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/tools/miri/src/intrinsics/x86/sse41.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ec9c6cb640a88cb54e1e9ef3528b362fd223e248218069a2b1e88d706e126f6"}},{"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/tools/miri/src/shims/unix/freebsd/foreign_items.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ad9057c2ca52613425660f24fd75a6d274cc825a01bf876ea9832c876ebddb6"}},{"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/tools/miri/src/shims/unix/linux_like/epoll.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"521e9acbc77e5f08cce3b43074e8cbfeb181475b488d5e6c4d548e0a131cd96f"}},{"ruleId":"D1","level":"warning","message":{"text":"MacroCallId::expand_speculative (cyclomatic 18): MacroCallId::expand_speculative 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/tools/rust-analyzer/crates/hir-expand/src/lib.rs"},"region":{"startLine":783}}}],"partialFingerprints":{"codehealthFindingId/v1":"facf48d3eeb77a32642b5c9cebdf663241d9d02e8386f028011588fe865813ba"}},{"ruleId":"D1","level":"warning","message":{"text":"Evaluator::place_addr_and_ty_and_metadata (cyclomatic 18): Evaluator::place_addr_and_ty_and_metadata 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/tools/rust-analyzer/crates/hir-ty/src/mir/eval.rs"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"3325ae413362b4ca30062068b10d1abf507b9f9d610b10a44e07be002943e1b5"}},{"ruleId":"D1","level":"warning","message":{"text":"MirBody::walk_places (cyclomatic 18): MirBody::walk_places has cyclomatic complexity 18 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. 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/tools/rust-analyzer/crates/hir-ty/src/mir.rs"},"region":{"startLine":1033}}}],"partialFingerprints":{"codehealthFindingId/v1":"cef546ab3cc89a377996839fcb71a9df0c0fe55946c4b0e575459f557f6687ae"}},{"ruleId":"D1","level":"warning","message":{"text":"BestObligation::visit_goal (cyclomatic 18): BestObligation::visit_goal 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/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/errors.rs"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa072e00c66fe65ad07dad3ad9aef44373063413bd13de3736587dd0d0de7767"}},{"ruleId":"D1","level":"warning","message":{"text":"ide::hover::render::definition_owner_name (cyclomatic 18): ide::hover::render::definition_owner_name 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/tools/rust-analyzer/crates/ide/src/hover/render.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"78cdefa00ef9429b0a37ec1811f5bb732bb219b2305d299a25fc55312a697a71"}},{"ruleId":"D1","level":"warning","message":{"text":"ide::moniker::def_to_non_local_moniker (cyclomatic 18): ide::moniker::def_to_non_local_moniker 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. This is NOT this file\u0027s highest cyclomatic complexity: MonikerDescriptorKind::from (cyclomatic 22) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/moniker.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"28f04a1dd1436821331d8582a1309c4437ae51f0c2f54ef298f494382220f73e"}},{"ruleId":"D1","level":"warning","message":{"text":"ide::rename::transform_assoc_fn_into_method_call (cyclomatic 18): ide::rename::transform_assoc_fn_into_method_call 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/tools/rust-analyzer/crates/ide/src/rename.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"64ccb2ac0696d77aa2e5bbd07031b2d15fa71874b3dc1e6ab7b2903d72f1d2f9"}},{"ruleId":"D1","level":"warning","message":{"text":"ide::signature_help::signature_help (cyclomatic 18): ide::signature_help::signature_help 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/tools/rust-analyzer/crates/ide/src/signature_help.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"c11ca7e6de16000525af731fb9419952bfa7520fabea36c04b997f44299fac1c"}},{"ruleId":"D1","level":"warning","message":{"text":"ide::syntax_highlighting::highlight::highlight_name_ref_by_syntax (cyclomatic 18): ide::syntax_highlighting::highlight::highlight_name_ref_by_syntax 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. This is NOT this file\u0027s highest cyclomatic complexity: ide::syntax_highlighting::highlight::highlight_name_by_syntax (cyclomatic 22) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/syntax_highlighting/highlight.rs"},"region":{"startLine":792}}}],"partialFingerprints":{"codehealthFindingId/v1":"eff2c30dafae7708b6631370c7362eac8dab35185d9df06395f0d08fb0fbb060"}},{"ruleId":"D1","level":"warning","message":{"text":"ide::view_memory_layout::view_memory_layout (cyclomatic 18): ide::view_memory_layout::view_memory_layout has cyclomatic complexity 18 (threshold 15). Of this number, 11 points are the body\u0027s own statements and 7 belong to one function item inside it that branches. 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/tools/rust-analyzer/crates/ide/src/view_memory_layout.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"e92bc80b51f4bdbcb912958446508c8e7087617b99aadc98b164deeba507ead9"}},{"ruleId":"D1","level":"warning","message":{"text":"ide_assists::handlers::apply_demorgan::apply_demorgan (cyclomatic 18): ide_assists::handlers::apply_demorgan::apply_demorgan 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/tools/rust-analyzer/crates/ide-assists/src/handlers/apply_demorgan.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c39089e463bab51f66c52dd1b7653d09fbf8bb9f5ff0378ca2e2188f69cd0de"}},{"ruleId":"D1","level":"warning","message":{"text":"ide_assists::handlers::extract_module::extract_module (cyclomatic 18): ide_assists::handlers::extract_module::extract_module 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/tools/rust-analyzer/crates/ide-assists/src/handlers/extract_module.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"09699fd4416e285af526cf666273f0d3979fcf8e733f215eea0c46e538ba78b2"}},{"ruleId":"D1","level":"warning","message":{"text":"ide_assists::handlers::generate_new::generate_new (cyclomatic 18): ide_assists::handlers::generate_new::generate_new 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/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_new.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"35ba445afed9df6a4aef4f2406bcf3ef0bbcb7ea1cf3590727a607252c0639b3"}},{"ruleId":"D1","level":"warning","message":{"text":"ide_assists::handlers::unwrap_branch::unwrap_branch (cyclomatic 18): ide_assists::handlers::unwrap_branch::unwrap_branch 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/tools/rust-analyzer/crates/ide-assists/src/handlers/unwrap_branch.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"dde6487d4b307c538e3f97e1aa922766e70913e7d42f7b040a5e7f173c227c93"}},{"ruleId":"D1","level":"warning","message":{"text":"ide_assists::handlers::wrap_return_type::wrap_return_type (cyclomatic 18): ide_assists::handlers::wrap_return_type::wrap_return_type 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/tools/rust-analyzer/crates/ide-assists/src/handlers/wrap_return_type.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"d37fb1ec88f2f9def5691706ac258a7b3ecb0e0d63e2d587a5bcfcaed0977393"}},{"ruleId":"D1","level":"warning","message":{"text":"ide_completion::completions::complete_name_ref (cyclomatic 18): ide_completion::completions::complete_name_ref 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/tools/rust-analyzer/crates/ide-completion/src/completions.rs"},"region":{"startLine":722}}}],"partialFingerprints":{"codehealthFindingId/v1":"77336501f0fe51be90997d26c5554855847857b7cda9d37e7f5c9b97169b018b"}},{"ruleId":"D1","level":"warning","message":{"text":"ide_completion::render::function::render (cyclomatic 18): ide_completion::render::function::render 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/tools/rust-analyzer/crates/ide-completion/src/render/function.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"520d0c0daed4da1d7f20500cbc7ce09924373d641c950fb246774511a76d0141"}},{"ruleId":"D1","level":"warning","message":{"text":"ide_diagnostics::handlers::unlinked_file::fixes (cyclomatic 18): ide_diagnostics::handlers::unlinked_file::fixes 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/tools/rust-analyzer/crates/ide-diagnostics/src/handlers/unlinked_file.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e6aa0b049a68459b7f50856a8fafdf81760cdad1d7af4e06c3b27f5ee51ccff"}},{"ruleId":"D1","level":"warning","message":{"text":"parser::grammar::expressions::atom::builtin_expr (cyclomatic 18): parser::grammar::expressions::atom::builtin_expr 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/tools/rust-analyzer/crates/parser/src/grammar/expressions/atom.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"402ff59690d972fd562b81d1189e5efa5a7e753b4200ac1afededa0e8ea06bd1"}},{"ruleId":"D1","level":"warning","message":{"text":"ungrammar::lexer::advance (cyclomatic 18): ungrammar::lexer::advance 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/tools/rust-analyzer/lib/ungrammar/src/lexer.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"04ac02fffeb60a66f41d0e6e733c7eb707af93d9ad2555ccc425fa4e80ef32ca"}},{"ruleId":"D1","level":"warning","message":{"text":"UseTree::from_ast (cyclomatic 18): UseTree::from_ast 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/tools/rustfmt/src/imports.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"846785643bedb159dcf6ee707749b50c0577427786f07b7cf94b9eaef38363fb"}},{"ruleId":"D1","level":"warning","message":{"text":"rustfmt_nightly::expr::can_be_overflowed_expr (cyclomatic 18): rustfmt_nightly::expr::can_be_overflowed_expr 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/tools/rustfmt/src/expr.rs"},"region":{"startLine":1596}}}],"partialFingerprints":{"codehealthFindingId/v1":"5059c812cc8a6251b218061bb85ef44be6d61214bb88bb49cb097ad41012187b"}},{"ruleId":"D1","level":"warning","message":{"text":"tidy::extra_checks::check (cyclomatic 18): tidy::extra_checks::check has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/tidy/src/extra_checks/mod.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3fcf92c36a169575a6a78485d7ed444611fe2b60cf2f8b5133cfcc5288c2324"}},{"ruleId":"D1","level":"warning","message":{"text":"tidy::features::check (cyclomatic 18): tidy::features::check 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/tools/tidy/src/features.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"f26c611f001df260a0e5f35883bdb78aefdc39c0f897180956113e46e211a37d"}},{"ruleId":"D1","level":"warning","message":{"text":"configure.parse_example_config (cyclomatic 18): configure.parse_example_config 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/bootstrap/configure.py"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc53186c8bf7c336fe31b8373c95f533739a568f57dcf75d5aaabcd3ea6b16e2"}},{"ruleId":"D1","level":"warning","message":{"text":"check_lldb.children_match (cyclomatic 18): check_lldb.children_match 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/etc/debugger_tester/lldb/check_lldb.py"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"20a85d3457323fc363c2ab1eeaf08d3ed2ce809172f86573fcfab731f7ff4e7f"}},{"ruleId":"D1","level":"warning","message":{"text":"htmldocck.compare_tree (cyclomatic 18): htmldocck.compare_tree 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/etc/htmldocck.py"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"42ac8ae8b11ac4c0f22e5f20edd499e8da9761d537f3b0d35eb10dd80fcbe531"}},{"ruleId":"D1","level":"warning","message":{"text":"DocSearch.execQuery::buildHrefAndPath (cyclomatic 18): DocSearch.execQuery::buildHrefAndPath has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This shape REPEATS in the file: 5 other methods here (DocSearch.execQuery::formatDisplayTypeSignature::writeFn, DocSearch.execQuery::transformResults, DocSearch.execQuery::unifyFunctionTypes, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 6 times rather than 6 independent problems. Splitting this body alone leaves the other 5 exactly as they are. Where these are variations on one operation, the change that clears all 6 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":2199}}}],"partialFingerprints":{"codehealthFindingId/v1":"5693418854010e74fca70a8a37e6893dacd8d1dc74ad010b24b1a6077ae64782"}},{"ruleId":"D1","level":"warning","message":{"text":"search.initSearch::buildHrefAndPath (cyclomatic 18): search.initSearch::buildHrefAndPath has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This shape REPEATS in the file: 12 other methods here (search.initSearch, search.initSearch::getItemsBefore, search.initSearch::getNextElem, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 13 times rather than 13 independent problems. Splitting this body alone leaves the other 12 exactly as they are. Where these are variations on one operation, the change that clears all 13 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":2199}}}],"partialFingerprints":{"codehealthFindingId/v1":"b36e930028c56e42e5aff3a6cb8538390dfc31828dba5ef88e8b0dc75d8f8c9f"}},{"ruleId":"D1","level":"warning","message":{"text":"initSearch::execQuery::buildHrefAndPath (cyclomatic 18): initSearch::execQuery::buildHrefAndPath has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":2199}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a60ea6cff60e05e371fed62dffeb7be8ee4228e015b75cadf5aadbe88e1533c"}},{"ruleId":"D1","level":"warning","message":{"text":"PrintState::print_comment (cyclomatic 17): PrintState::print_comment has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: PrintState::token_kind_to_string_ext (cyclomatic 60) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ast_pretty/src/pprust/state.rs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfb1536f128658fdb155759b6a1f8587f3ac7ce8aa22bad6ac9a85d026ff70be"}},{"ruleId":"D1","level":"warning","message":{"text":"AttributeParser::check_target (cyclomatic 17): AttributeParser::check_target 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":"compiler/rustc_attr_parsing/src/target_checking.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"59eba1aab5c2d63a2cad00f70647a8064a650114840e23d622e3db0b143c4b2a"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_attr_parsing::attributes::diagnostic::parse_directive_items (cyclomatic 17): rustc_attr_parsing::attributes::diagnostic::parse_directive_items 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":"compiler/rustc_attr_parsing/src/attributes/diagnostic/mod.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbb7a287ff13bff90689daad69b2bb15493365bc4999672ead75af73e26ba1da"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_attr_parsing::attributes::proc_macro_attrs::parse_derive_like (cyclomatic 17): rustc_attr_parsing::attributes::proc_macro_attrs::parse_derive_like 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":"compiler/rustc_attr_parsing/src/attributes/proc_macro_attrs.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ae41a9038e76fcab38dd0dfb483d7c3e0cad1a6ff5064a944f08066f8b9e882"}},{"ruleId":"D1","level":"warning","message":{"text":"MirBorrowckCtxt::suggest_static_lifetime_for_gat_from_hrtb (cyclomatic 17): MirBorrowckCtxt::suggest_static_lifetime_for_gat_from_hrtb 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":"compiler/rustc_borrowck/src/diagnostics/region_errors.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"572841e5ac6ee6531a0d7c3281a9ad76121109059c75c0faff0d5d5ffde42086"}},{"ruleId":"D1","level":"warning","message":{"text":"MirBorrowckCtxt::suggest_deref_closure_return (cyclomatic 17): MirBorrowckCtxt::suggest_deref_closure_return 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":"compiler/rustc_borrowck/src/diagnostics/region_errors.rs"},"region":{"startLine":1390}}}],"partialFingerprints":{"codehealthFindingId/v1":"09d3c92d17a7f93369d7abc8e9d52e0fbfd2f8ea34b5335c07e6695365734db3"}},{"ruleId":"D1","level":"warning","message":{"text":"MirBorrowckCtxt::check_movable_place (cyclomatic 17): MirBorrowckCtxt::check_movable_place has cyclomatic complexity 17 (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":"compiler/rustc_borrowck/src/lib.rs"},"region":{"startLine":1899}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0458c08e79cbf79441360cbef299aa72cd07abcf56e984c07f7e9f92c249c81"}},{"ruleId":"D1","level":"warning","message":{"text":"MirBorrowckCtxt::is_mutable (cyclomatic 17): MirBorrowckCtxt::is_mutable has cyclomatic complexity 17 (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":"compiler/rustc_borrowck/src/lib.rs"},"region":{"startLine":2577}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe9ee16b751c8d67dccee7476095e5768759c7a83773b8394d534e62be067d91"}},{"ruleId":"D1","level":"warning","message":{"text":"LoanInvalidationsGenerator::consume_rvalue (cyclomatic 17): LoanInvalidationsGenerator::consume_rvalue has cyclomatic complexity 17 (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":"compiler/rustc_borrowck/src/polonius/legacy/loan_invalidations.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"111b156affe413d3989306131ec053c9d1fae769580bcb39a8c5b2dd10bf417e"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_codegen_cranelift::build_isa (cyclomatic 17): rustc_codegen_cranelift::build_isa 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":"compiler/rustc_codegen_cranelift/src/lib.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0f77f005c4da0906412885213e49999d3458605e2b828950c88f493a66c56de"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_codegen_cranelift::abi::codegen_fn_prelude (cyclomatic 17): rustc_codegen_cranelift::abi::codegen_fn_prelude 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":"compiler/rustc_codegen_cranelift/src/abi/mod.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc76017947863748a785462133ab3d831ab4a66c0c26bd74e950b4e8ccfa602a"}},{"ruleId":"D1","level":"warning","message":{"text":"Builder::gcc_checked_binop (cyclomatic 17): Builder::gcc_checked_binop has cyclomatic complexity 17 (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":"compiler/rustc_codegen_gcc/src/int.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"08e72cd2b5608caafc6337fbfc9c0760480f527eea2b1667f24dff0aca53df8c"}},{"ruleId":"D1","level":"warning","message":{"text":"CodegenCx::get_static_inner (cyclomatic 17): CodegenCx::get_static_inner 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":"compiler/rustc_codegen_llvm/src/consts.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b7e5731f295319fcbaabd4a92fc581ad3de527eb42dae30f5928196c9f56f7d"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_codegen_llvm::abi::get_attrs (cyclomatic 17): rustc_codegen_llvm::abi::get_attrs 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":"compiler/rustc_codegen_llvm/src/abi.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"443961754fe8c2061f677c8616eefa5a08350800b43327942cf9a432db2bc5bb"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_codegen_llvm::allocator::codegen (cyclomatic 17): rustc_codegen_llvm::allocator::codegen has cyclomatic complexity 17 (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":"compiler/rustc_codegen_llvm/src/allocator.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ee648945286ad83900246777cd0dcfb48efb5c99131f253f8349788d9c96f6c"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_codegen_llvm::attributes::instrument_function_attr (cyclomatic 17): rustc_codegen_llvm::attributes::instrument_function_attr 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":"compiler/rustc_codegen_llvm/src/attributes.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"097d9a71bdc405f8c1e377e2eb21f7fc8bbed39d253c7c78084957eaa848068b"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_codegen_llvm::va_arg::emit_x86_64_sysv64_va_arg (cyclomatic 17): rustc_codegen_llvm::va_arg::emit_x86_64_sysv64_va_arg has cyclomatic complexity 17 (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":"compiler/rustc_codegen_llvm/src/va_arg.rs"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7943abee8bec9097aef16c2b0402c79ef7f0823647ce7945435d473cef286d5"}},{"ruleId":"D1","level":"warning","message":{"text":"GccLinker::set_output_kind (cyclomatic 17): GccLinker::set_output_kind 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":"compiler/rustc_codegen_ssa/src/back/linker.rs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"013990be90d4f06fa5dc34411cac554cced50bf07d095d6ab28da972a233accf"}},{"ruleId":"D1","level":"warning","message":{"text":"FunctionCx::clear_variant_dependent_padding (cyclomatic 17): FunctionCx::clear_variant_dependent_padding 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":"compiler/rustc_codegen_ssa/src/mir/block.rs"},"region":{"startLine":1840}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a84384fd591fc480db39d122a17c1591994d9e664d6ab0e22510ad07ae2b1ad"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_codegen_ssa::back::link::linker_and_flavor (cyclomatic 17): rustc_codegen_ssa::back::link::linker_and_flavor has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 4 of the 17 points are its own statements and the rest belongs to 2 function items inside it that branch (infer_from, adjust_flavor_to_features). 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":"compiler/rustc_codegen_ssa/src/back/link.rs"},"region":{"startLine":1878}}}],"partialFingerprints":{"codehealthFindingId/v1":"a28f9b6d3e921825b4dfccfdfce11e012d5f56759a8a16303b9763d639077efc"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_codegen_ssa::back::link::exec_linker (cyclomatic 17): rustc_codegen_ssa::back::link::exec_linker has cyclomatic complexity 17 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. 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":"compiler/rustc_codegen_ssa/src/back/link.rs"},"region":{"startLine":2135}}}],"partialFingerprints":{"codehealthFindingId/v1":"af2bd1fc356d883635fd626a34a67dea7f1f610972bbf071ac323770eea8fa8e"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_codegen_ssa::back::link::add_linked_symbol_object (cyclomatic 17): rustc_codegen_ssa::back::link::add_linked_symbol_object has cyclomatic complexity 17 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/back/link.rs"},"region":{"startLine":2537}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e567bb1471a79fb42b2f414bc8c2b207d360c950870462c5cb309b5314d311f"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_codegen_ssa::back::symbol_edit::macho_edit_impl (cyclomatic 17): rustc_codegen_ssa::back::symbol_edit::macho_edit_impl 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":"compiler/rustc_codegen_ssa/src/back/symbol_edit.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"bca6c68111506ee60ea76bf80615faecaf1012fb79176150c5f8e41d40b66ffb"}},{"ruleId":"D1","level":"warning","message":{"text":"ValidityVisitor::aggregate_field_path_elem (cyclomatic 17): ValidityVisitor::aggregate_field_path_elem has cyclomatic complexity 17 (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":"compiler/rustc_const_eval/src/interpret/validity.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"d133547c19e444fe7703e8fc17ad18d3cb4abe4aacc6156c7be9c32f6b1dcd5f"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_const_eval::interpret::intern::intern_const_alloc_recursive (cyclomatic 17): rustc_const_eval::interpret::intern::intern_const_alloc_recursive 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":"compiler/rustc_const_eval/src/interpret/intern.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"527b36808480aef37c6987e8135d36f7ae68557e44d034ed53099b53b11c56b6"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_errors::emitter::detect_confusion_type (cyclomatic 17): rustc_errors::emitter::detect_confusion_type 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":"compiler/rustc_errors/src/emitter.rs"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cbcab5557b973baac645f02ae258f2bff4b5888ebee159a2f26c09bd5877593"}},{"ruleId":"D1","level":"warning","message":{"text":"TtParser::match_one (cyclomatic 17): TtParser::match_one 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":"compiler/rustc_expand/src/mbe/macro_parser.rs"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"c179cb2c0f5335aff917b224f826f1f36041059cec925c09a9b90d17f3a245c0"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_hir_analysis::check::compare_impl_item::report_trait_method_mismatch (cyclomatic 17): rustc_hir_analysis::check::compare_impl_item::report_trait_method_mismatch 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":"compiler/rustc_hir_analysis/src/check/compare_impl_item.rs"},"region":{"startLine":1001}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cea6837a0a466aa9df21c798e8fc4c7814a0a59b73f51069c3805cec9a75ecf"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_hir_analysis::check::wfcheck::check_param_wf (cyclomatic 17): rustc_hir_analysis::check::wfcheck::check_param_wf has cyclomatic complexity 17 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. 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":"compiler/rustc_hir_analysis/src/check/wfcheck.rs"},"region":{"startLine":795}}}],"partialFingerprints":{"codehealthFindingId/v1":"be7c7e62aace23121f78071f12872e3013d0e962811e9c0c30d0b7cfc15155fa"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_hir_analysis::collect::clauses_of::assert_only_contains_clauses_from (cyclomatic 17): rustc_hir_analysis::collect::clauses_of::assert_only_contains_clauses_from has cyclomatic complexity 17 (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":"compiler/rustc_hir_analysis/src/collect/clauses_of.rs"},"region":{"startLine":739}}}],"partialFingerprints":{"codehealthFindingId/v1":"63cd749615c7881898a627a514f548ae29876731950ff6288d66aaf216fa3f6c"}},{"ruleId":"D1","level":"warning","message":{"text":"CoerceMany::report_return_mismatched_types (cyclomatic 17): CoerceMany::report_return_mismatched_types 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":"compiler/rustc_hir_typeck/src/coercion.rs"},"region":{"startLine":2035}}}],"partialFingerprints":{"codehealthFindingId/v1":"a59f86ee4ca12fbcd600b7a927485bc1d02afa6c6a3f13465325180eede65bf6"}},{"ruleId":"D1","level":"warning","message":{"text":"ExprUseVisitor::walk_pat (cyclomatic 17): ExprUseVisitor::walk_pat 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":"compiler/rustc_hir_typeck/src/expr_use_visitor.rs"},"region":{"startLine":828}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1cf4d9d13ee4de8c242cd7bf89e6a69dbf46e166c72dbfb064b067e625ee574"}},{"ruleId":"D1","level":"warning","message":{"text":"FnCtxt::check_expr_path (cyclomatic 17): FnCtxt::check_expr_path has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: FnCtxt::check_expr_kind (cyclomatic 35) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/expr.rs"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceec799c7aa9ad26d62542098bff0d86a8c1c71a068eba98b4d028d53b6cfe94"}},{"ruleId":"D1","level":"warning","message":{"text":"FnCtxt::check_expr_asm (cyclomatic 17): FnCtxt::check_expr_asm has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: FnCtxt::check_expr_kind (cyclomatic 35) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/expr.rs"},"region":{"startLine":3773}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6139c9f9da54a109ae07b988cd8b5a38dbb0d2d3c05cb77b84c6efc60cd084e"}},{"ruleId":"D1","level":"warning","message":{"text":"FnCtxt::check_expr_offset_of (cyclomatic 17): FnCtxt::check_expr_offset_of has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: FnCtxt::check_expr_kind (cyclomatic 35) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/expr.rs"},"region":{"startLine":3857}}}],"partialFingerprints":{"codehealthFindingId/v1":"7806b0e9b859cb495851cca196808e93d599a4496a24af3658506f094f699e3a"}},{"ruleId":"D1","level":"warning","message":{"text":"FnCtxt::binop_accepts_types (cyclomatic 17): FnCtxt::binop_accepts_types has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/fn_ctxt/adjust_fulfillment_errors.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"b42acba9ec63caab9ea48ce17064f9f9ffcff64ad8632599fb9c1cf83acf19f2"}},{"ruleId":"D1","level":"warning","message":{"text":"FnCtxt::check_expr_block (cyclomatic 17): FnCtxt::check_expr_block has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: FnCtxt::check_expr_lit (cyclomatic 21) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/fn_ctxt/checks.rs"},"region":{"startLine":1322}}}],"partialFingerprints":{"codehealthFindingId/v1":"002de49c435de35b7cbd1f846572c090795ab878009caa4cf794e9b553829342"}},{"ruleId":"D1","level":"warning","message":{"text":"FnCtxt::suggest_calling_boxed_future_when_appropriate (cyclomatic 17): FnCtxt::suggest_calling_boxed_future_when_appropriate 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":"compiler/rustc_hir_typeck/src/fn_ctxt/suggestions.rs"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3c261be00e7c7f83b2820dba510011b24b793911b457dbb93102909bfc5c499"}},{"ruleId":"D1","level":"warning","message":{"text":"FnCtxt::check_pat_ident (cyclomatic 17): FnCtxt::check_pat_ident 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":"compiler/rustc_hir_typeck/src/pat.rs"},"region":{"startLine":1167}}}],"partialFingerprints":{"codehealthFindingId/v1":"92dbe56c96ddaa05207c100bfd4234f86c427ae8033c05974965e7685b95618e"}},{"ruleId":"D1","level":"warning","message":{"text":"FnCtxt::compute_min_captures (cyclomatic 17): FnCtxt::compute_min_captures has cyclomatic complexity 17 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. 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":"compiler/rustc_hir_typeck/src/upvar.rs"},"region":{"startLine":879}}}],"partialFingerprints":{"codehealthFindingId/v1":"7273a01f353bd8f91db1ce65608ca6f76386fddf95dc17c1ea9e8201d9ca6823"}},{"ruleId":"D1","level":"warning","message":{"text":"FnCtxt::perform_2229_migration_analysis (cyclomatic 17): FnCtxt::perform_2229_migration_analysis 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":"compiler/rustc_hir_typeck/src/upvar.rs"},"region":{"startLine":1073}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f0df9d1f6730bd19109918b8d2ea4ed90572c895db8fa4293c21b70308ca3b2"}},{"ruleId":"D1","level":"warning","message":{"text":"UnusedDelimLint::emit_unused_delims (cyclomatic 17): UnusedDelimLint::emit_unused_delims 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. This is NOT this file\u0027s highest cyclomatic complexity: UnusedDelimLint::expr_allows_remove_arg_block (cyclomatic 18) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_lint/src/unused.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"47bd141fd07a823cf36c07d2e16af6cda5249090f9f965098f9a2efeda0336d6"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_lint::types::lint_wide_pointer (cyclomatic 17): rustc_lint::types::lint_wide_pointer 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":"compiler/rustc_lint/src/types.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"362d679628dbd3dd094f137f9326e6aad2b3a05d188477be512913a0c0a2e09e"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_lint::unused::must_use::emit_must_use_untranslated (cyclomatic 17): rustc_lint::unused::must_use::emit_must_use_untranslated has cyclomatic complexity 17 (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":"compiler/rustc_lint/src/unused/must_use.rs"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f39a1de44a52f463ce5098adb1176f5f1d8a7c7ac888398127327b1f8c94b9e"}},{"ruleId":"D1","level":"warning","message":{"text":"Visitor::super_terminator (cyclomatic 17): Visitor::super_terminator has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This shape REPEATS in the file: one other method here (MutVisitor::super_terminator) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/mir/visit.rs"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"abdef94b177628a18958e5ce775de384caac73287111f80e816a9c89c0ff3808"}},{"ruleId":"D1","level":"warning","message":{"text":"MutVisitor::super_terminator (cyclomatic 17): MutVisitor::super_terminator has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This shape REPEATS in the file: one other method here (Visitor::super_terminator) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/mir/visit.rs"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"c048ee66fe25f8eebf1efa2ab8ba0e456f6f41427909bcee27236aca37bfdaa3"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_middle::ty::print::pretty::for_each_def (cyclomatic 17): rustc_middle::ty::print::pretty::for_each_def 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":"compiler/rustc_middle/src/ty/print/pretty.rs"},"region":{"startLine":3475}}}],"partialFingerprints":{"codehealthFindingId/v1":"7509093a46a6fff466e35efb40866abc57cfb3b68e7109ebb66c64e4c50f1222"}},{"ruleId":"D1","level":"warning","message":{"text":"MoveDataBuilder::gather_terminator (cyclomatic 17): MoveDataBuilder::gather_terminator has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_dataflow/src/move_paths/builder.rs"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"77af4a8f61a66c2af391ee883fffaf6288ab4c02b7f09000291cf558bf9d770f"}},{"ruleId":"D1","level":"warning","message":{"text":"NormalInliner::check_callee_mir_body (cyclomatic 17): NormalInliner::check_callee_mir_body 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":"compiler/rustc_mir_transform/src/inline.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8c9a4ea7f46c0b4f6d176d5d404b099fa4130fe99d7a87f71062563dfbdb6f4"}},{"ruleId":"D1","level":"warning","message":{"text":"CfgChecker::check_cleanup_control_flow (cyclomatic 17): CfgChecker::check_cleanup_control_flow 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":"compiler/rustc_mir_transform/src/validate.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"576352c4fbe5cfe36e61b67bd3c67a9bdcf11eccdb25caaa238b62761b962ac4"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::parse_assoc_op_cast (cyclomatic 17): Parser::parse_assoc_op_cast has cyclomatic complexity 17 (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":"compiler/rustc_parse/src/parser/expr.rs"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d6ffe1910b88c626be1b8887d459833e48f950ee101d6328438047cac71f13b"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::parse_trait_bound (cyclomatic 17): Parser::parse_trait_bound 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":"compiler/rustc_parse/src/parser/ty.rs"},"region":{"startLine":1412}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa4a40696d09820d44610c68e84e67b2b8293eeb811ee22b6b4f218838aeabe5"}},{"ruleId":"D1","level":"warning","message":{"text":"CheckAttrVisitor::check_proc_macro (cyclomatic 17): CheckAttrVisitor::check_proc_macro has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: CheckAttrVisitor::check_one_parsed_attribute (cyclomatic 195) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_passes/src/check_attr.rs"},"region":{"startLine":1084}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcaafdd41d82b7c16b43a461c9f7cdb10c4e81cff250d849c0cdb30feecf2442"}},{"ruleId":"D1","level":"warning","message":{"text":"LateResolutionVisitor::suggest_changing_type_to_const_param (cyclomatic 17): LateResolutionVisitor::suggest_changing_type_to_const_param 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":"compiler/rustc_resolve/src/late/diagnostics.rs"},"region":{"startLine":2161}}}],"partialFingerprints":{"codehealthFindingId/v1":"842a1a8422d008e805e2cc80f15e72e059b2de2f24c4685b73c4b640a90dcd6f"}},{"ruleId":"D1","level":"warning","message":{"text":"LateResolutionVisitor::resolve_doc_links (cyclomatic 17): LateResolutionVisitor::resolve_doc_links has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions. This is NOT this file\u0027s highest cyclomatic complexity: PathSource::is_expected (cyclomatic 22) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/late.rs"},"region":{"startLine":5799}}}],"partialFingerprints":{"codehealthFindingId/v1":"370dc75c46e5b2881344865facfafc0dfe6ee5e633f7cbaf11c39cf144d54ee2"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_sanitizers::cfi::typeid::itanium_cxx_abi::encode::encode_ty_name (cyclomatic 17): rustc_sanitizers::cfi::typeid::itanium_cxx_abi::encode::encode_ty_name has cyclomatic complexity 17 (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":"compiler/rustc_sanitizers/src/cfi/typeid/itanium_cxx_abi/encode.rs"},"region":{"startLine":765}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e91d658392aa34f5af22c5141cc12e89f75a943787f1a6c32a37193a06bde75"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_target::target_features::feature_to_arch_names (cyclomatic 17): rustc_target::target_features::feature_to_arch_names 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. This is NOT this file\u0027s highest cyclomatic complexity: Target::rust_target_features (cyclomatic 18) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_target/src/target_features.rs"},"region":{"startLine":1138}}}],"partialFingerprints":{"codehealthFindingId/v1":"93050e3acf1bea2739736a8d0aac39465d5d30e8926c62918339f3c476f884d8"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeErrCtxt::report_host_effect_error (cyclomatic 17): TypeErrCtxt::report_host_effect_error has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: TypeErrCtxt::fuzzy_match_tys::type_category (cyclomatic 26) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/error_reporting/traits/fulfillment_errors.rs"},"region":{"startLine":980}}}],"partialFingerprints":{"codehealthFindingId/v1":"884f5f439045a47cdae460dea6201a492b4ecbba9330e917b74881e600933bbd"}},{"ruleId":"D1","level":"warning","message":{"text":"BestObligation::visit_goal (cyclomatic 17): BestObligation::visit_goal has cyclomatic complexity 17 (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":"compiler/rustc_trait_selection/src/solve/fulfill/derive_errors.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"448e7ad74d3164ac3f45114027d36fcc02ce901f5c6574999ab7ee0fc1e3745c"}},{"ruleId":"D1","level":"warning","message":{"text":"SelectionContext::assemble_candidates_for_unsizing (cyclomatic 17): SelectionContext::assemble_candidates_for_unsizing has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: SelectionContext::assemble_candidates (cyclomatic 26) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/traits/select/candidate_assembly.rs"},"region":{"startLine":996}}}],"partialFingerprints":{"codehealthFindingId/v1":"47e9410304cca24efe7aa57b8e2d5f61b97f55bbfdedc2218876aca7d2219877"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_trait_selection::traits::dyn_compatibility::dyn_compatibility_violations_for_assoc_item (cyclomatic 17): rustc_trait_selection::traits::dyn_compatibility::dyn_compatibility_violations_for_assoc_item 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":"compiler/rustc_trait_selection/src/traits/dyn_compatibility.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab4527ce6402278152a2586b40ed8b0c8556a53e8c1bc133b635f526b6d4abd6"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_trait_selection::traits::project::confirm_async_closure_candidate (cyclomatic 17): rustc_trait_selection::traits::project::confirm_async_closure_candidate has cyclomatic complexity 17 (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":"compiler/rustc_trait_selection/src/traits/project.rs"},"region":{"startLine":1775}}}],"partialFingerprints":{"codehealthFindingId/v1":"0719ddf3a8dc324f24a4e0fb4aebec731b70f3101705752cbe9512af722036a9"}},{"ruleId":"D1","level":"warning","message":{"text":"MaybeTransmutableQuery::answer_impl (cyclomatic 17): MaybeTransmutableQuery::answer_impl 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":"compiler/rustc_transmute/src/maybe_transmutable/mod.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"588a95ca93e67fed97e58cef0daa9de8ff8eb8ad6c7c253f396468e3344cbccb"}},{"ruleId":"D1","level":"warning","message":{"text":"libm_macros::expand (cyclomatic 17): libm_macros::expand has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: libm_macros::ty_to_tokens (cyclomatic 19) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/compiler-builtins/crates/libm-macros/src/lib.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebbf0367f9976ed01a83508d68ce8304c8f526b7359fb2ecd5be78558f0acb3c"}},{"ruleId":"D1","level":"warning","message":{"text":"symcheck::check_elf_exe_stack (cyclomatic 17): symcheck::check_elf_exe_stack has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: symcheck::verify_expected_target (cyclomatic 19) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/compiler-builtins/crates/symcheck/src/main.rs"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"79b06f8559ee809616346954facc425d01ae0b83d1ab5660913de581f792c748"}},{"ruleId":"D1","level":"warning","message":{"text":"libm::math::cbrt::cbrt_round (cyclomatic 17): libm::math::cbrt::cbrt_round 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":"library/compiler-builtins/libm/src/math/cbrt.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"02beddde9ca3c4ec6ea5a735c80a9de256b942d16b840cf9f5184be7b0dc5a9c"}},{"ruleId":"D1","level":"warning","message":{"text":"libm::math::exp2m1::cr_exp2m1 (cyclomatic 17): libm::math::exp2m1::cr_exp2m1 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":"library/compiler-builtins/libm/src/math/exp2m1.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"82681e4d93f7ddb5aca1b8a9975adf00f1b8bc55c5a8dfffdd19ebc5d52acb6f"}},{"ruleId":"D1","level":"warning","message":{"text":"std::sys::pal::unix::init (cyclomatic 17): std::sys::pal::unix::init has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 2 of the 17 points are its own statements and the rest belongs to 2 function items inside it that branch (sanitize_standard_fds, reset_sigpipe). 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":"library/std/src/sys/pal/unix/mod.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d67dc1a543bf56057ef2cb1f20e2d0efa2ff09981601eab150e71639a83fdb9"}},{"ruleId":"D1","level":"warning","message":{"text":"stdarch_gen_hexagon::hvx::parse_compound_expr (cyclomatic 17): stdarch_gen_hexagon::hvx::parse_compound_expr 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":"library/stdarch/crates/stdarch-gen-hexagon/src/hvx.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"43161b544faea38ac8b8aecc41b1db60137e8c56820e8093d0f85eeaf1681300"}},{"ruleId":"D1","level":"warning","message":{"text":"Rustc::run (cyclomatic 17): Rustc::run has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 3 of the 17 points are its own statements and the rest belongs to one function item inside it that branches (prepare_image). 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/bootstrap/src/core/build_steps/dist.rs"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"89ded99e3cdce6483de54a8d24ad32b91a7c84ced2f5888a670ebe6a3be4f69c"}},{"ruleId":"D1","level":"warning","message":{"text":"DeferredCommand::finish_process (cyclomatic 17): DeferredCommand::finish_process 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/bootstrap/src/utils/exec.rs"},"region":{"startLine":840}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c83b4632fe33708a5f54626a550509fae2e8982d7a77c7c83fd0861e4da2db5"}},{"ruleId":"D1","level":"warning","message":{"text":"bootstrap::core::build_steps::compile::rustc_llvm_env (cyclomatic 17): bootstrap::core::build_steps::compile::rustc_llvm_env 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/bootstrap/src/core/build_steps/compile.rs"},"region":{"startLine":1439}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4e7556fabea76938921eb2237c8298c557e5f4df7b82244c50b76e87a67da6f"}},{"ruleId":"D1","level":"warning","message":{"text":"citool::analysis::report_test_diffs (cyclomatic 17): citool::analysis::report_test_diffs has cyclomatic complexity 17 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 5 belong to 2 function items inside it that branch. 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/ci/citool/src/analysis.rs"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ad7e3c630df731b59d1c17b297f552a4e3ceb77ff9f45ed4f2d4c468709df1f"}},{"ruleId":"D1","level":"warning","message":{"text":"CodeBlocks::next (cyclomatic 17): CodeBlocks::next 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/librustdoc/html/markdown.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"fefbd9199cfbb6219d152c4810b0e789f9cfdfca9b2b80c175a5baba6e5c4daf"}},{"ruleId":"D1","level":"warning","message":{"text":"TagIterator::parse_outside_attribute_block (cyclomatic 17): TagIterator::parse_outside_attribute_block 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/librustdoc/html/markdown.rs"},"region":{"startLine":1173}}}],"partialFingerprints":{"codehealthFindingId/v1":"56bd0f924c1c79263e7bbed05e4defe8830cab5a4ea89d6cabf531b5b2f8d294"}},{"ruleId":"D1","level":"warning","message":{"text":"rustdoc::clean::clean_use_statement_leaf (cyclomatic 17): rustdoc::clean::clean_use_statement_leaf 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/librustdoc/clean/mod.rs"},"region":{"startLine":3237}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d2e563d18cb4a713e20eab41f72b6c3996adf3601accf6d109e2203bad1301a"}},{"ruleId":"D1","level":"warning","message":{"text":"rustdoc::html::format::href_with_jump_to_def_path_depth (cyclomatic 17): rustdoc::html::format::href_with_jump_to_def_path_depth 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/librustdoc/html/format.rs"},"region":{"startLine":746}}}],"partialFingerprints":{"codehealthFindingId/v1":"98434b02d197d95143907b5f956154ef1ee643b818f8d8af1020be3124f52143"}},{"ruleId":"D1","level":"warning","message":{"text":"rustdoc::passes::lint::invalid_markdown_table::visit_item (cyclomatic 17): rustdoc::passes::lint::invalid_markdown_table::visit_item 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/librustdoc/passes/lint/invalid_markdown_table.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd9d5e2d65ac79378feed4ceae83b0ccd69e11a51d18cd5ad9a94d2806f9822a"}},{"ruleId":"D1","level":"warning","message":{"text":"NonminimalBoolVisitor::bool_expr (cyclomatic 17): NonminimalBoolVisitor::bool_expr 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/tools/clippy/clippy_lints/src/booleans.rs"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"10dd9d3a0a92733a8871ea7ac6e16c6302625a783523f3646febc6a8cf42dc95"}},{"ruleId":"D1","level":"warning","message":{"text":"Documentation::check_attributes (cyclomatic 17): Documentation::check_attributes has cyclomatic complexity 17 (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/tools/clippy/clippy_lints/src/doc/mod.rs"},"region":{"startLine":759}}}],"partialFingerprints":{"codehealthFindingId/v1":"3092ef7c50f60a706bf9853dd1db5180c2dd599cb663c5933b00c0c68d379cd8"}},{"ruleId":"D1","level":"warning","message":{"text":"LenZero::check_expr (cyclomatic 17): LenZero::check_expr has cyclomatic complexity 17 (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/tools/clippy/clippy_lints/src/len_zero.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"20d2ef3fedfe1d55b53eefd9dab087c8201d05b9941c1efbd27ad07f482882eb"}},{"ruleId":"D1","level":"warning","message":{"text":"NeedlessLateInit::check_if_or_match (cyclomatic 17): NeedlessLateInit::check_if_or_match 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/tools/clippy/clippy_lints/src/needless_late_init.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"8306e4186605c58c75ea07296a1b8a72838ea5a4841e11c3e1af3d73262bf27c"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::attrs::useless_attribute::check (cyclomatic 17): clippy_lints::attrs::useless_attribute::check 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/tools/clippy/clippy_lints/src/attrs/useless_attribute.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fe2953813e68a601450adedd4a473e38671e341f8a0dcaaa9906ad8bdbcb154"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::casts::cast_possible_truncation::apply_reductions (cyclomatic 17): clippy_lints::casts::cast_possible_truncation::apply_reductions 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/tools/clippy/clippy_lints/src/casts/cast_possible_truncation.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cf3356d3c5965dd3ff2f4d9cf4e6c63865abaab1496e87ee5bc76f569d0db75"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::casts::cast_possible_truncation::check (cyclomatic 17): clippy_lints::casts::cast_possible_truncation::check 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/tools/clippy/clippy_lints/src/casts/cast_possible_truncation.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9687e825069aff69b686761279dc0b932b2fd2766c4666f2ff5c972b694c10a"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::casts::needless_type_cast::has_generic_return_type (cyclomatic 17): clippy_lints::casts::needless_type_cast::has_generic_return_type 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/tools/clippy/clippy_lints/src/casts/needless_type_cast.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bc3ce4b18eac90104181222f70af1339bd94ee458fd5842ed656d38d407b23e"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::doc::markdown::check (cyclomatic 17): clippy_lints::doc::markdown::check 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/tools/clippy/clippy_lints/src/doc/markdown.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dd8cedf346ff10d555f91af799d4e8785172c8cfb4560293a6cf42c31811a43"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::doc::too_long_first_doc_paragraph::check (cyclomatic 17): clippy_lints::doc::too_long_first_doc_paragraph::check 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/tools/clippy/clippy_lints/src/doc/too_long_first_doc_paragraph.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ec0d56c218ee2c316bf6413f2074d0cca0d25cf222300c47dccde7d41142089"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::floating_point_arithmetic::mul_add::check (cyclomatic 17): clippy_lints::floating_point_arithmetic::mul_add::check 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/tools/clippy/clippy_lints/src/floating_point_arithmetic/mul_add.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"b61f4f371ee29501a6793818ee81193b04576c91fcbf76cdab4906b38b81a082"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::ifs::branches_sharing_code::scan_block_for_eq (cyclomatic 17): clippy_lints::ifs::branches_sharing_code::scan_block_for_eq 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/tools/clippy/clippy_lints/src/ifs/branches_sharing_code.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"9feee57c6978d1870dde3f53da21ded82b80bf7f3e77066b028869b9aeef993a"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::matches::redundant_guards::check (cyclomatic 17): clippy_lints::matches::redundant_guards::check has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/matches/redundant_guards.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"279383000e8ff11543242954e9a7b6e15e3340199d608fe7e2707fba8bf6db66"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::methods::open_options::get_open_options (cyclomatic 17): clippy_lints::methods::open_options::get_open_options 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/tools/clippy/clippy_lints/src/methods/open_options.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0e88ef0c46e18718f4224afbe609d260acabe58d621321b7bd3d8e1917a738e"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::methods::or_fun_call::check (cyclomatic 17): clippy_lints::methods::or_fun_call::check 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/tools/clippy/clippy_lints/src/methods/or_fun_call.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"d00fccfec47c6455f36f79e365e167446dd545d3b0d38ba8659202c892f77621"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::methods::search_is_some::check (cyclomatic 17): clippy_lints::methods::search_is_some::check 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/tools/clippy/clippy_lints/src/methods/search_is_some.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa4b7faf4954ca089b9875d9586301a0ebaf56f5c20efaddf693f739a38167b7"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::methods::unnecessary_sort_by::detect_lint (cyclomatic 17): clippy_lints::methods::unnecessary_sort_by::detect_lint 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/tools/clippy/clippy_lints/src/methods/unnecessary_sort_by.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"7150e2b5dcf61526f96703c390224f61f6d2bcf7b92676a9599d3d2d4919bc76"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::operators::cmp_owned::check_op (cyclomatic 17): clippy_lints::operators::cmp_owned::check_op 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/tools/clippy/clippy_lints/src/operators/cmp_owned.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ebd4f0b6611d9a11342dd441513a220661a9e4c07cf13f790f3d23ce9fd2c05"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::operators::float_cmp::check (cyclomatic 17): clippy_lints::operators::float_cmp::check 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/tools/clippy/clippy_lints/src/operators/float_cmp.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"d24f1a68dd3c18e22d941ca5ee1c2371d3c51356f23b7cb7e97bf09be784b17b"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::ptr::ptr_arg::check_fn_args (cyclomatic 17): clippy_lints::ptr::ptr_arg::check_fn_args has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/ptr/ptr_arg.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f1210e44201e893308d1b05f4b7bc9b07e813447a1037fb8352fcd77befd983"}},{"ruleId":"D1","level":"warning","message":{"text":"Constant::partial_cmp (cyclomatic 17): Constant::partial_cmp has cyclomatic complexity 17 (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/tools/clippy/clippy_utils/src/consts.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bb4a55a34f995cf3b0e3aeee2697757484b13b3d041a2aec487f769e8030113"}},{"ruleId":"D1","level":"warning","message":{"text":"HirEqInterExpr::check_ctxt (cyclomatic 17): HirEqInterExpr::check_ctxt has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: clippy_utils::hir_utils::has_ambiguous_literal_in_expr (cyclomatic 19) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_utils/src/hir_utils.rs"},"region":{"startLine":929}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7bd450be9d18b08deab827126616ee6d952be80042377401c610a9f64c1128b"}},{"ruleId":"D1","level":"warning","message":{"text":"SpanlessHash::hash_tykind (cyclomatic 17): SpanlessHash::hash_tykind has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: clippy_utils::hir_utils::has_ambiguous_literal_in_expr (cyclomatic 19) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_utils/src/hir_utils.rs"},"region":{"startLine":1601}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf8efafe40acb30b89b89a0c94eee5a0b0c66b336471f5eea89457059b95c488"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_utils::consts::mir_to_const (cyclomatic 17): clippy_utils::consts::mir_to_const has cyclomatic complexity 17 (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/tools/clippy/clippy_utils/src/consts.rs"},"region":{"startLine":1161}}}],"partialFingerprints":{"codehealthFindingId/v1":"385f3dfbf90011519416480c889a67887bb1b661e73cd04561ecf7b9975f40d6"}},{"ruleId":"D1","level":"warning","message":{"text":"compiletest::directives::needs::handle_needs (cyclomatic 17): compiletest::directives::needs::handle_needs 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/tools/compiletest/src/directives/needs.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dfc650c09389317d2050f662ef865c1c03cd22a9b39d8cd01c46380846b62da"}},{"ruleId":"D1","level":"warning","message":{"text":"compiletest::json::push_actual_errors (cyclomatic 17): compiletest::json::push_actual_errors has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/compiletest/src/json.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ceaa2d32801a9fd747a6897363c8c089701ccd2463f754a32e136b671ef159f"}},{"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/tools/miri/src/borrow_tracker/tree_borrows/diagnostics.rs"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"3df090a30ce5da313973662a65a3bd3dd7fed302de39a4c26b0bab6b27f382c0"}},{"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/tools/miri/src/borrow_tracker/tree_borrows/mod.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"30cc106c0dab8afab247bcc71ba367e5c83e2580d487e9a5c3509ffdbe1d9bba"}},{"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/tools/miri/src/shims/unix/fs.rs"},"region":{"startLine":2212}}}],"partialFingerprints":{"codehealthFindingId/v1":"2de7ecd9e9594839ecee952f85d67ed2bb21bb383fd80d58af48b1a4f7aecb79"}},{"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/tools/miri/src/shims/windows/foreign_items.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fd1ce37aff0bf1212ac2854f279d4ac5c89ae96cae2e5f8a8ca93d8cb70bb66"}},{"ruleId":"D1","level":"warning","message":{"text":"hir_def::find_path::find_path_for_module (cyclomatic 17): hir_def::find_path::find_path_for_module 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/tools/rust-analyzer/crates/hir-def/src/find_path.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0f8cd6c314b89c7057a84b51f218ab8e26201d2bf5edbfa62d54b5b114f9477"}},{"ruleId":"D1","level":"warning","message":{"text":"InferenceContext::compute_min_captures (cyclomatic 17): InferenceContext::compute_min_captures has cyclomatic complexity 17 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. 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/tools/rust-analyzer/crates/hir-ty/src/infer/closure/analysis.rs"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdcdf0abed69ed7e38ee96b515c182f3a3bc3aa42820169d65a7ac8c939a1b89"}},{"ruleId":"D1","level":"warning","message":{"text":"InferenceContext::deduce_closure_signature_from_predicates (cyclomatic 17): InferenceContext::deduce_closure_signature_from_predicates 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/tools/rust-analyzer/crates/hir-ty/src/infer/closure.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad05c2b7fd189cbc26319b85825c4476e63936071c4c315220b42a6292bccd6b"}},{"ruleId":"D1","level":"warning","message":{"text":"InferenceContext::resolve_all (cyclomatic 17): InferenceContext::resolve_all has cyclomatic complexity 17 (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/tools/rust-analyzer/crates/hir-ty/src/infer.rs"},"region":{"startLine":1644}}}],"partialFingerprints":{"codehealthFindingId/v1":"6489356235fe3d82434c342736d37baaa567fb737f1b78b24ce4a3ce1c9ecaa5"}},{"ruleId":"D1","level":"warning","message":{"text":"PathLoweringContext::substs_from_args_and_bindings (cyclomatic 17): PathLoweringContext::substs_from_args_and_bindings has cyclomatic complexity 17 (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/tools/rust-analyzer/crates/hir-ty/src/lower/path.rs"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"150f52e1493a5647c66cd5f3fdef34466af48d581172598d009963deb9f69681"}},{"ruleId":"D1","level":"warning","message":{"text":"hir_ty::lower::path::check_generic_args_len (cyclomatic 17): hir_ty::lower::path::check_generic_args_len has cyclomatic complexity 17 (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/tools/rust-analyzer/crates/hir-ty/src/lower/path.rs"},"region":{"startLine":1063}}}],"partialFingerprints":{"codehealthFindingId/v1":"49423a1ca3e573d3fb48df7529eae90a463af7cb2bf390068d4b76f59e7b8c86"}},{"ruleId":"D1","level":"warning","message":{"text":"hir_ty::mir::lower::mir_body_for_closure_query (cyclomatic 17): hir_ty::mir::lower::mir_body_for_closure_query 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/tools/rust-analyzer/crates/hir-ty/src/mir/lower.rs"},"region":{"startLine":1998}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8c1e81a9e4f14482ba7c92614bfe5acb42d13be34e938aab9cc710c87961e44"}},{"ruleId":"D1","level":"warning","message":{"text":"ide::inlay_hints::binding_mode::hints (cyclomatic 17): ide::inlay_hints::binding_mode::hints has cyclomatic complexity 17 (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/tools/rust-analyzer/crates/ide/src/inlay_hints/binding_mode.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"58018cf004cf7b540d8cf25cf58e3b7b77026806ce3e9ea0d85d222668d67bb9"}},{"ruleId":"D1","level":"warning","message":{"text":"ide::inlay_hints::generic_param::hints (cyclomatic 17): ide::inlay_hints::generic_param::hints has cyclomatic complexity 17 (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/tools/rust-analyzer/crates/ide/src/inlay_hints/generic_param.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"001c0e6499ff1127c0c9573913a6fb0596205e14f306a1df17e00678b61f349a"}},{"ruleId":"D1","level":"warning","message":{"text":"ide::signature_help::signature_help_for_generics (cyclomatic 17): ide::signature_help::signature_help_for_generics 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/tools/rust-analyzer/crates/ide/src/signature_help.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"3379884401d3f9ae255cccf0e8ca2b8f0822573104bb0a645912eed764b7f09e"}},{"ruleId":"D1","level":"warning","message":{"text":"ide_assists::handlers::auto_import::relevance_score (cyclomatic 17): ide_assists::handlers::auto_import::relevance_score has cyclomatic complexity 17 (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/tools/rust-analyzer/crates/ide-assists/src/handlers/auto_import.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"56c76920afb3107decaf8faa9b40b9712a39ddca2510c78ee5834a54718119b9"}},{"ruleId":"D1","level":"warning","message":{"text":"ide_assists::handlers::convert_bool_to_enum::replace_usages (cyclomatic 17): ide_assists::handlers::convert_bool_to_enum::replace_usages 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/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_bool_to_enum.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"a587c51b1303b56d570a28577d771ef943f309be29ad30873f825e31ddb2ddee"}},{"ruleId":"D1","level":"warning","message":{"text":"ide_assists::handlers::extract_function::make_body (cyclomatic 17): ide_assists::handlers::extract_function::make_body has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: FunctionBody::external_control_flow (cyclomatic 18) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/extract_function.rs"},"region":{"startLine":1800}}}],"partialFingerprints":{"codehealthFindingId/v1":"230c940c522846d25b486b189df89ffa10ace98a1288dd9ae0119d88d26704e9"}},{"ruleId":"D1","level":"warning","message":{"text":"ide_assists::handlers::toggle_macro_delimiter::toggle_macro_delimiter (cyclomatic 17): ide_assists::handlers::toggle_macro_delimiter::toggle_macro_delimiter has cyclomatic complexity 17 (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/tools/rust-analyzer/crates/ide-assists/src/handlers/toggle_macro_delimiter.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"53b468bb4da0fa543c4cd35f86293e442eb0f256716167310bc2c8afb46ba061"}},{"ruleId":"D1","level":"warning","message":{"text":"ide_db::imports::merge_imports::recursive_normalize (cyclomatic 17): ide_db::imports::merge_imports::recursive_normalize 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/tools/rust-analyzer/crates/ide-db/src/imports/merge_imports.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"43470d21ce15098e472a8f1d07d5b3837958596cca95667ea9616b1d02dec573"}},{"ruleId":"D1","level":"warning","message":{"text":"ide_db::imports::merge_imports::version_sort::version_sort (cyclomatic 17): ide_db::imports::merge_imports::version_sort::version_sort has cyclomatic complexity 17 (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/tools/rust-analyzer/crates/ide-db/src/imports/merge_imports.rs"},"region":{"startLine":978}}}],"partialFingerprints":{"codehealthFindingId/v1":"62c74e045c3fcca67f5559f15d0e2c3e8c8f85d9a10ac9a37a30cf08f0ad8279"}},{"ruleId":"D1","level":"warning","message":{"text":"ide_db::syntax_helpers::tree_diff::diff (cyclomatic 17): ide_db::syntax_helpers::tree_diff::diff has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 2 of the 17 points are its own statements and the rest belongs to 2 function items inside it that branch (go, syntax_element_eq). 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/tools/rust-analyzer/crates/ide-db/src/syntax_helpers/tree_diff.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c0db575e7fdf52424029d27440f0b12c2387da90d77b5e23042ec390eb536a6"}},{"ruleId":"D1","level":"warning","message":{"text":"CargoWorkspace::new (cyclomatic 17): CargoWorkspace::new has cyclomatic complexity 17 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. 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/tools/rust-analyzer/crates/project-model/src/cargo_workspace.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"15fd44e72c84521e87e86e6647b520c67feea378f60dea34875c5d429eae2de6"}},{"ruleId":"D1","level":"warning","message":{"text":"Sysroot::load_workspace (cyclomatic 17): Sysroot::load_workspace 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/tools/rust-analyzer/crates/project-model/src/sysroot.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"64c81424ffa480a5f1f7565e271e25cb1ef0db360dfa2bdca36143c7ae0cacf7"}},{"ruleId":"D1","level":"warning","message":{"text":"rust_analyzer::lsp::completion_item_hash (cyclomatic 17): rust_analyzer::lsp::completion_item_hash has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 8 of the 17 points are its own statements and the rest belongs to one function item inside it that branches (hash_completion_relevance). 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/tools/rust-analyzer/crates/rust-analyzer/src/lsp.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"5019fdab139deea202b34f03760f92cc726b04228c100018f1e6441325c61cec"}},{"ruleId":"D1","level":"warning","message":{"text":"rust_analyzer::lsp::to_proto::code_lens (cyclomatic 17): rust_analyzer::lsp::to_proto::code_lens has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: rust_analyzer::lsp::to_proto::completion_item_kind (cyclomatic 37) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/lsp/to_proto.rs"},"region":{"startLine":1759}}}],"partialFingerprints":{"codehealthFindingId/v1":"b922d589d37a64f391d56f8d8cd897d4ea2901b95195b668397defb97074346a"}},{"ruleId":"D1","level":"warning","message":{"text":"rustfmt_nightly::comment::comment_style (cyclomatic 17): rustfmt_nightly::comment::comment_style 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/tools/rustfmt/src/comment.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"33719fb237b35da457a47ffe422697d5ee5efc8a466cb1f7096fdb8d86352c36"}},{"ruleId":"D1","level":"warning","message":{"text":"rustfmt_nightly::parse::macros::parse_macro_arg (cyclomatic 17): rustfmt_nightly::parse::macros::parse_macro_arg 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/tools/rustfmt/src/parse/macros/mod.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"e35aefb289f47ef9470bf81effd72d736e96291caead6bc4dfc511181ca5bcad"}},{"ruleId":"D1","level":"warning","message":{"text":"rustfmt_nightly::sort::version_sort (cyclomatic 17): rustfmt_nightly::sort::version_sort has cyclomatic complexity 17 (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/tools/rustfmt/src/sort.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfac113d5b8baad407ef4606a8f41d70e2d5369ee9aaf49db5271c4bc92b229a"}},{"ruleId":"D1","level":"warning","message":{"text":"common.from_dict (cyclomatic 17): common.from_dict has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/etc/debugger_tester/common.py"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f8f259291f3c645e9883a3ff0c882865084166de649a1d03c705b89bece4f3a"}},{"ruleId":"D1","level":"warning","message":{"text":"DocSearch.parseQuery::parseInput (cyclomatic 17): DocSearch.parseQuery::parseInput 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/librustdoc/html/static/js/search.js"},"region":{"startLine":1442}}}],"partialFingerprints":{"codehealthFindingId/v1":"62f295ccdac51627ce6d91e860b95fd5c1df9c7f27809fde83b60fdec2de5801"}},{"ruleId":"D1","level":"warning","message":{"text":"search.initSearch::parseInput (cyclomatic 17): search.initSearch::parseInput has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: 12 other methods here (search.initSearch, search.initSearch::getItemsBefore, search.initSearch::getNextElem, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 13 times rather than 13 independent problems. Splitting this body alone leaves the other 12 exactly as they are. Where these are variations on one operation, the change that clears all 13 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":1442}}}],"partialFingerprints":{"codehealthFindingId/v1":"d951b58200f6121685ed06dfb14aa63cd08561c210bc0f54c140ca072e1e892a"}},{"ruleId":"D1","level":"warning","message":{"text":"settings.changeSetting (cyclomatic 17): settings.changeSetting 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/librustdoc/html/static/js/settings.js"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce086a2e5a6dc6f5b190e4eee6525a1ff0015fc433eb651960301a15090f2251"}},{"ruleId":"D1","level":"warning","message":{"text":"InlineNeighborsTree.decode (cyclomatic 17): InlineNeighborsTree.decode 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/librustdoc/html/static/js/stringdex.js"},"region":{"startLine":2597}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9e3cf04894c5e645a9a36b86955edd71de13f187ff72f159c683aebdf3b241c"}},{"ruleId":"D1","level":"warning","message":{"text":"initSearch::calculate (cyclomatic 17): initSearch::calculate 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/librustdoc/html/static/js/search.js"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"35996de3d43fb5c509a2218e6cbc91e515e376e113bd4c1d193fdf69b875b730"}},{"ruleId":"D1","level":"warning","message":{"text":"initSearch::parseQuery::parseInput (cyclomatic 17): initSearch::parseQuery::parseInput 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/librustdoc/html/static/js/search.js"},"region":{"startLine":1442}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d5923ed6dfa37381b2db74b526594e68e2e450a3e01a9e2583821777472a7cb"}},{"ruleId":"D1","level":"warning","message":{"text":"initSearch::execQuery::innerRunTypeQuery (cyclomatic 17): initSearch::execQuery::innerRunTypeQuery 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/librustdoc/html/static/js/search.js"},"region":{"startLine":4228}}}],"partialFingerprints":{"codehealthFindingId/v1":"60110ed96fcf010732c92bb51610b06079f6366221893f76e647ba9b08eae797"}},{"ruleId":"D1","level":"warning","message":{"text":"loadDatabase::decode (cyclomatic 17): loadDatabase::decode 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/librustdoc/html/static/js/stringdex.js"},"region":{"startLine":2597}}}],"partialFingerprints":{"codehealthFindingId/v1":"d240da0cd11b8bee937a20d9eba7040299cc1314300bd7ad433217215c6eefed"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_abi::layout::coroutine::coroutine_saved_local_eligibility (cyclomatic 16): rustc_abi::layout::coroutine::coroutine_saved_local_eligibility 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":"compiler/rustc_abi/src/layout/coroutine.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"e25b64f00db13b6edb322aca380d19c094c0db7d71d6590159303bf620c89335"}},{"ruleId":"D1","level":"warning","message":{"text":"LoweringContext::lower_path_segment (cyclomatic 16): LoweringContext::lower_path_segment 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":"compiler/rustc_ast_lowering/src/path.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"e347ece66e5ffb8bf984c6c40129d9bffc4f192084474dc9742fee1800216027"}},{"ruleId":"D1","level":"warning","message":{"text":"LinkParser::parse_link_kind (cyclomatic 16): LinkParser::parse_link_kind 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":"compiler/rustc_attr_parsing/src/attributes/link_attrs.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"17693e69b5f3cdbe657de594a9b50e27fe7b7bcc4b248270ab47991b9ce5b51f"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_attr_parsing::attributes::cfg::eval_config_entry (cyclomatic 16): rustc_attr_parsing::attributes::cfg::eval_config_entry 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":"compiler/rustc_attr_parsing/src/attributes/cfg.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"17f51934a899193836080a2f160fbd5c0f07b7e40d6982035c982ad1c5bff5f3"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_attr_parsing::attributes::cfg_select::lint_unreachable (cyclomatic 16): rustc_attr_parsing::attributes::cfg_select::lint_unreachable 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":"compiler/rustc_attr_parsing/src/attributes/cfg_select.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"75ae413a33cea025d375731c7b110ba5f262871ba7b15cdfd09b1d3fdd464f3c"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_attr_parsing::attributes::rustc_internal::parse_cgu_fields (cyclomatic 16): rustc_attr_parsing::attributes::rustc_internal::parse_cgu_fields 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":"compiler/rustc_attr_parsing/src/attributes/rustc_internal.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"df7175b26223a984a8201297b11e5994bfaca4aab9a863b590bf140d1b7024ee"}},{"ruleId":"D1","level":"warning","message":{"text":"RegionName::highlight_region_name (cyclomatic 16): RegionName::highlight_region_name 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":"compiler/rustc_borrowck/src/diagnostics/region_name.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"f12f0b2ab4f58d7b2cca0b846503493501e3f213942549d37328629ed32e044b"}},{"ruleId":"D1","level":"warning","message":{"text":"MirBorrowckCtxt::give_name_from_error_region (cyclomatic 16): MirBorrowckCtxt::give_name_from_error_region 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":"compiler/rustc_borrowck/src/diagnostics/region_name.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffeb9e55526d2228e1c53c4d4443808e829e3ffe11dbc8063d1ec6155f766c06"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_borrowck::places_conflict::place_components_conflict (cyclomatic 16): rustc_borrowck::places_conflict::place_components_conflict 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":"compiler/rustc_borrowck/src/places_conflict.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"17c5a5570225febf0e4f46cb5e09ae613a2920aada5a26c00400b47b0e814a49"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_builtin_macros::define_opaque::expand (cyclomatic 16): rustc_builtin_macros::define_opaque::expand 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":"compiler/rustc_builtin_macros/src/define_opaque.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"7751f6bb232f42fa514dacf2f18e77f08da355119db03fe59804c6181c9d3745"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_builtin_macros::eii::eii_ (cyclomatic 16): rustc_builtin_macros::eii::eii_ 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":"compiler/rustc_builtin_macros/src/eii.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"91f42e6b4221cfaa9a6620e928115948b7e8b1a210fd22cb19f22d410ac9411b"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_builtin_macros::env::expand_env (cyclomatic 16): rustc_builtin_macros::env::expand_env 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":"compiler/rustc_builtin_macros/src/env.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"59f0469899584d62b97741ae3977c8dd841e49545b6642d3abe788befe5996f6"}},{"ruleId":"D1","level":"warning","message":{"text":"UnwindContext::add_function (cyclomatic 16): UnwindContext::add_function has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/src/debuginfo/unwind.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7685b1faab85b68731de0be6c8d496c9d6cdfb4bf60c6e99249fbb91261ea1f"}},{"ruleId":"D1","level":"warning","message":{"text":"Builder::fptoint_sat (cyclomatic 16): Builder::fptoint_sat has cyclomatic complexity 16 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 2 belong to 2 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: Builder::fcmp (cyclomatic 17) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_gcc/src/builder.rs"},"region":{"startLine":1924}}}],"partialFingerprints":{"codehealthFindingId/v1":"f554d1b4599db22b440d26921237c01b05d57651e2ad172f0f61be5bec5ef52f"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_codegen_gcc::attributes::from_fn_attrs (cyclomatic 16): rustc_codegen_gcc::attributes::from_fn_attrs 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":"compiler/rustc_codegen_gcc/src/attributes.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c15418a27e48a3b3c1276e46079c7abe781fc87f91147fe8c038d66b03d956f"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_codegen_llvm::callee::get_fn (cyclomatic 16): rustc_codegen_llvm::callee::get_fn 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":"compiler/rustc_codegen_llvm/src/callee.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd76e2aaf2d4b2f71ca02c2838dabb12f13796b4c5ea0ac0a86ac13b7702abb0"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_codegen_llvm::intrinsic::autocast (cyclomatic 16): rustc_codegen_llvm::intrinsic::autocast 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. This is NOT this file\u0027s highest cyclomatic complexity: rustc_codegen_llvm::intrinsic::generic_simd_intrinsic::simd_simple_float_intrinsic (cyclomatic 18) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/intrinsic.rs"},"region":{"startLine":1119}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d33746791c65cc4a07d64cfc054299320185f73150ddbcd669214697c6c51bc"}},{"ruleId":"D1","level":"warning","message":{"text":"FunctionCx::codegen_place (cyclomatic 16): FunctionCx::codegen_place 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":"compiler/rustc_codegen_ssa/src/mir/place.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d16c299b5ed1546ab10fa9672cc9c354c15ff427a029057fbf4db8f35d3f39a"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_codegen_ssa::back::symbol_export::reachable_non_generics_helper (cyclomatic 16): rustc_codegen_ssa::back::symbol_export::reachable_non_generics_helper 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":"compiler/rustc_codegen_ssa/src/back/symbol_export.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f967bd7b4d85a5a2af13ef0c7c7d7ae5d3e5706bf0bc7c6c8f509879d383e68"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_codegen_ssa::back::write::do_thin_lto (cyclomatic 16): rustc_codegen_ssa::back::write::do_thin_lto has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/back/write.rs"},"region":{"startLine":981}}}],"partialFingerprints":{"codehealthFindingId/v1":"d63969c627d350c686670b6dda0d1379a556a645c631508b598ae06d4d6d5c9c"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_codegen_ssa::codegen_attrs::apply_overrides (cyclomatic 16): rustc_codegen_ssa::codegen_attrs::apply_overrides 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":"compiler/rustc_codegen_ssa/src/codegen_attrs.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"634033c9d5d348efcc34c1c1045c492deefb8c7d5b53374f5393a5344eb4dbe7"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_codegen_ssa::common::i686_decorated_name (cyclomatic 16): rustc_codegen_ssa::common::i686_decorated_name 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":"compiler/rustc_codegen_ssa/src/common.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"47b1ebd69d801d2aa05634cf1c6883cfcc55631173db3b389fff7e582982de22"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_codegen_ssa::mir::naked_asm::wasm_type (cyclomatic 16): rustc_codegen_ssa::mir::naked_asm::wasm_type 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":"compiler/rustc_codegen_ssa/src/mir/naked_asm.rs"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"11b956f5d865afcda9ed35f18f71aa6c67e4a5639f0a84a84f108a34e886c18d"}},{"ruleId":"D1","level":"warning","message":{"text":"InterpCx::layout_compat (cyclomatic 16): InterpCx::layout_compat 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":"compiler/rustc_const_eval/src/interpret/call.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"0af7e7a27225e04ea7d8d279bc4d5a70b8f165047ef5eebc5a4e568e3dc88926"}},{"ruleId":"D1","level":"warning","message":{"text":"InterpCx::init_fn_call (cyclomatic 16): InterpCx::init_fn_call 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":"compiler/rustc_const_eval/src/interpret/call.rs"},"region":{"startLine":758}}}],"partialFingerprints":{"codehealthFindingId/v1":"27cc0e662fba16c1411bbe438901716342174ceaa94a9a49d82e05da60d425eb"}},{"ruleId":"D1","level":"warning","message":{"text":"InterpCx::mem_copy_repeatedly (cyclomatic 16): InterpCx::mem_copy_repeatedly 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":"compiler/rustc_const_eval/src/interpret/memory.rs"},"region":{"startLine":1473}}}],"partialFingerprints":{"codehealthFindingId/v1":"644a038cdad40229a2abad3c08198a11d0d34cd0db3ce942edec0b808f4f0d12"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_expand::mbe::transcribe::transcribe (cyclomatic 16): rustc_expand::mbe::transcribe::transcribe 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":"compiler/rustc_expand/src/mbe/transcribe.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"b257a80f49118a9ce15fc0495e3b6b4ddde3176f1e710438be3afcecfda44824"}},{"ruleId":"D1","level":"warning","message":{"text":"Node::ty (cyclomatic 16): Node::ty 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. This is NOT this file\u0027s highest cyclomatic complexity: PrimTy::from_name (cyclomatic 20) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir/src/hir.rs"},"region":{"startLine":5196}}}],"partialFingerprints":{"codehealthFindingId/v1":"f86dee1d45260924f237debd0ae49a734143691889f0b8b47bc1c5c9fb14523c"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_hir_analysis::check::check::check_scalable_vector (cyclomatic 16): rustc_hir_analysis::check::check::check_scalable_vector 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":"compiler/rustc_hir_analysis/src/check/check.rs"},"region":{"startLine":1562}}}],"partialFingerprints":{"codehealthFindingId/v1":"024cb8620744565cf8bd7a491ccdfe7eee62b8d718f37a55dee04777cbb4d66a"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_hir_analysis::check::compare_impl_item::compare_number_of_generics (cyclomatic 16): rustc_hir_analysis::check::compare_impl_item::compare_number_of_generics 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":"compiler/rustc_hir_analysis/src/check/compare_impl_item.rs"},"region":{"startLine":1639}}}],"partialFingerprints":{"codehealthFindingId/v1":"39ce0da7cd9f3039ef57d00045d12ea57eb1d1d1bf5b13fbdb1483c2abf0104a"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_hir_analysis::check::wfcheck::check_type_defn (cyclomatic 16): rustc_hir_analysis::check::wfcheck::check_type_defn 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":"compiler/rustc_hir_analysis/src/check/wfcheck.rs"},"region":{"startLine":980}}}],"partialFingerprints":{"codehealthFindingId/v1":"941da3165c5d083cafc1b5bf0f54ba035937e38c321d7977965b0e3332bc9eeb"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_hir_analysis::coherence::builtin::coerce_unsized_info (cyclomatic 16): rustc_hir_analysis::coherence::builtin::coerce_unsized_info 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":"compiler/rustc_hir_analysis/src/coherence/builtin.rs"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"829edcd9d00b8e46ff8cdeca93aace30835a72ba55b8d1f3585b4cafa5296fd5"}},{"ruleId":"D1","level":"warning","message":{"text":"State::print_inline_asm (cyclomatic 16): State::print_inline_asm 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. This is NOT this file\u0027s highest cyclomatic complexity: State::print_node (cyclomatic 39) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_pretty/src/lib.rs"},"region":{"startLine":1481}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a4d10758c1b4c8241e87a8da311c4d9d131b7b8da918c954ef5a88df9708d4e"}},{"ruleId":"D1","level":"warning","message":{"text":"FnCtxt::annotate_alternative_method_deref (cyclomatic 16): FnCtxt::annotate_alternative_method_deref 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":"compiler/rustc_hir_typeck/src/demand.rs"},"region":{"startLine":952}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fff583f68f663a4a3e46827362cc57fad4d50d87ddf0b4860bc79e7ceead6fe"}},{"ruleId":"D1","level":"warning","message":{"text":"FnCtxt::lint_edition_dependent_dot_call (cyclomatic 16): FnCtxt::lint_edition_dependent_dot_call 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":"compiler/rustc_hir_typeck/src/method/prelude_edition_lints.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4dbb2e808f9c37118911fae3baee95d46ed7f3a1db8f7bbcbab793f1d597fd9"}},{"ruleId":"D1","level":"warning","message":{"text":"FnCtxt::impl_into_iterator_should_be_iterator (cyclomatic 16): FnCtxt::impl_into_iterator_should_be_iterator has cyclomatic complexity 16 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 4 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":"compiler/rustc_hir_typeck/src/method/suggest.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a1b6dd13e5eb89a4846b976b74dab6789d8396e97f566e93e5628dc42c10110"}},{"ruleId":"D1","level":"warning","message":{"text":"FnCtxt::report_no_match_method_error (cyclomatic 16): FnCtxt::report_no_match_method_error 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":"compiler/rustc_hir_typeck/src/method/suggest.rs"},"region":{"startLine":1233}}}],"partialFingerprints":{"codehealthFindingId/v1":"22d6ff6f978c776f3b5c117742d2395620c74c8626608cb8df2b9afde83a30e1"}},{"ruleId":"D1","level":"warning","message":{"text":"FnCtxt::set_not_found_span_label (cyclomatic 16): FnCtxt::set_not_found_span_label 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":"compiler/rustc_hir_typeck/src/method/suggest.rs"},"region":{"startLine":1443}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea50007f939847a44f21f5c5ddb37b5c663a7cdff507fb1422aac5e680f0deb8"}},{"ruleId":"D1","level":"warning","message":{"text":"FnCtxt::suggest_enum_variant_for_method_call (cyclomatic 16): FnCtxt::suggest_enum_variant_for_method_call 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":"compiler/rustc_hir_typeck/src/method/suggest.rs"},"region":{"startLine":1568}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a205b2a3f8650162c0e60e9c9d1cabb5780ec89bba6e2a5425e3b0c956a14c9"}},{"ruleId":"D1","level":"warning","message":{"text":"FnCtxt::note_unmet_impls_on_type (cyclomatic 16): FnCtxt::note_unmet_impls_on_type 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":"compiler/rustc_hir_typeck/src/method/suggest.rs"},"region":{"startLine":3463}}}],"partialFingerprints":{"codehealthFindingId/v1":"acfbf2d1fa9198235b9d11241a7bccafad6785ee8510059ccab7d34b7e121507"}},{"ruleId":"D1","level":"warning","message":{"text":"Resolver::single_import_can_define_name (cyclomatic 16): Resolver::single_import_can_define_name 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":"compiler/rustc_resolve/src/ident.rs"},"region":{"startLine":1406}}}],"partialFingerprints":{"codehealthFindingId/v1":"e31dbfe2c3df9db7ceccabc3a3d778736427d7582fe55fc19745d81d50ccda0f"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_hir_typeck::op::is_builtin_binop (cyclomatic 16): rustc_hir_typeck::op::is_builtin_binop has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This is NOT this file\u0027s highest cyclomatic complexity: rustc_hir_typeck::op::lang_item_for_binop (cyclomatic 27) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/op.rs"},"region":{"startLine":1325}}}],"partialFingerprints":{"codehealthFindingId/v1":"c22187390ddbb285b96f29316d1036b5d160259e474ccb93662f26905af54855"}},{"ruleId":"D1","level":"warning","message":{"text":"LintStore::check_lint_name (cyclomatic 16): LintStore::check_lint_name 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":"compiler/rustc_lint/src/context.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e37ddb2118ff634972677ddafa0335c3d0b2f02f7aa3d1d38aa1b67f3ad89c3"}},{"ruleId":"D1","level":"warning","message":{"text":"CStore::inject_allocator_crate (cyclomatic 16): CStore::inject_allocator_crate 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":"compiler/rustc_metadata/src/creader.rs"},"region":{"startLine":1174}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd1310610eb9088df976b0ad75757474c6196240648f69909e417c5e3d67ac57"}},{"ruleId":"D1","level":"warning","message":{"text":"Collector::process_command_line (cyclomatic 16): Collector::process_command_line 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":"compiler/rustc_metadata/src/native_libs.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"77d7f3c5ec412477610727cb6b30c2767ef86c37157596f41f3fd3df1415f96f"}},{"ruleId":"D1","level":"warning","message":{"text":"Ty::abi_stable_hash (cyclomatic 16): Ty::abi_stable_hash 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":"compiler/rustc_symbol_mangling/src/export.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"83d8b28e342d0abdeb3038e427c0efb1942253da7fd757a4d1ad89a0dd230061"}},{"ruleId":"D1","level":"warning","message":{"text":"Builder::expr_as_place (cyclomatic 16): Builder::expr_as_place 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":"compiler/rustc_mir_build/src/builder/expr/as_place.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"c72bc1b0de14836fa472123e80a3ecbe386b463926fcd832d78a62ec93fe2eb4"}},{"ruleId":"D1","level":"warning","message":{"text":"MatchVisitor::check_match (cyclomatic 16): MatchVisitor::check_match 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":"compiler/rustc_mir_build/src/thir/pattern/check_match.rs"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f867e4ff1a62fbfb1bde6b423a944e31da67dfb7a51d6af544dbf764deefd46"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_mir_build::thir::pattern::check_match::check_borrow_conflicts_in_at_patterns (cyclomatic 16): rustc_mir_build::thir::pattern::check_match::check_borrow_conflicts_in_at_patterns 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":"compiler/rustc_mir_build/src/thir/pattern/check_match.rs"},"region":{"startLine":770}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cd1808c4c34780d07d6622b6f68ff65d93440735d1e73b22292deb6e10d9a90"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_mir_dataflow::impls::precise_liveness::liveness_matrix (cyclomatic 16): rustc_mir_dataflow::impls::precise_liveness::liveness_matrix has cyclomatic complexity 16 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_dataflow/src/impls/precise_liveness.rs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"18ddee4d3cb1c88925ab13d036001c5b64f3f3e0d4fd6751271b1071be3e9d54"}},{"ruleId":"D1","level":"warning","message":{"text":"VnState::simplify_unary (cyclomatic 16): VnState::simplify_unary 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":"compiler/rustc_mir_transform/src/gvn.rs"},"region":{"startLine":1297}}}],"partialFingerprints":{"codehealthFindingId/v1":"2221c96e15e50d63683cb248dfe22fb44aee01db0777005b4d279e7c82c04d17"}},{"ruleId":"D1","level":"warning","message":{"text":"DropsReachable::visit (cyclomatic 16): DropsReachable::visit 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":"compiler/rustc_mir_transform/src/lint_tail_expr_drop_order.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"a51ed2ee778cad8be48f9b1a22bfb8375cfc59cc1cb4c760001ee3a27bbb05a3"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_mir_transform::dead_store_elimination::eliminate (cyclomatic 16): rustc_mir_transform::dead_store_elimination::eliminate 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":"compiler/rustc_mir_transform/src/dead_store_elimination.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fb59987bf6518f234fc99841a9ce27acdf22fc8df1dfdf63165e7c549b43bd1"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_mir_transform::inline::try_inlining (cyclomatic 16): rustc_mir_transform::inline::try_inlining 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":"compiler/rustc_mir_transform/src/inline.rs"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6aa89513605263d99464abe708fbc6361428407bf3f6744e9ed63eb2ff66bb3"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_mir_transform::inline::check_mir_is_available (cyclomatic 16): rustc_mir_transform::inline::check_mir_is_available 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":"compiler/rustc_mir_transform/src/inline.rs"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"2038a6c9a08fcac1b339dc798e3b782db95533944cd9289e163cd96f929bab1f"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_next_trait_solver::solve::assembly::structural_traits::extract_tupled_inputs_and_output_from_async_callable (cyclomatic 16): rustc_next_trait_solver::solve::assembly::structural_traits::extract_tupled_inputs_and_output_from_async_callable 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":"compiler/rustc_next_trait_solver/src/solve/assembly/structural_traits.rs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"88af429be9c6d84fc49740161e0037dd8b93ef41fcb2f752ab194b2423e8604c"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_next_trait_solver::solve::eval_ctxt::should_rerun_after_erased_canonicalization (cyclomatic 16): rustc_next_trait_solver::solve::eval_ctxt::should_rerun_after_erased_canonicalization 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":"compiler/rustc_next_trait_solver/src/solve/eval_ctxt/mod.rs"},"region":{"startLine":2058}}}],"partialFingerprints":{"codehealthFindingId/v1":"dab99b7a6da85ea728eaa11335807b8df6aa1ee21419b5f6e19824cbcbf8f447"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::expected_ident_found (cyclomatic 16): Parser::expected_ident_found 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":"compiler/rustc_parse/src/parser/diagnostics.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"b379782cd3d098173cce1413cf637ee5f2e51970575eed511bdb7ea973e86aa8"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::parse_expr_assoc_rest (cyclomatic 16): Parser::parse_expr_assoc_rest has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/expr.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d56a7614abb1a3d7bb3d4701ac04c79bfb48ac27a91f1754d48c98cfe4309b8"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::parse_floating_field_access (cyclomatic 16): Parser::parse_floating_field_access 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":"compiler/rustc_parse/src/parser/expr.rs"},"region":{"startLine":926}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a4b6ca1aaa4fade37ddf58ecda1f8b9dc779261a35596cf7e1ff328423c6b65"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::parse_expr_labeled (cyclomatic 16): Parser::parse_expr_labeled 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":"compiler/rustc_parse/src/parser/expr.rs"},"region":{"startLine":1544}}}],"partialFingerprints":{"codehealthFindingId/v1":"da1588258435c9d0f00791f10808662bcc19d6add8e7bc9253d8ec397de8df2e"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::check_fn_front_matter (cyclomatic 16): Parser::check_fn_front_matter has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/function.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"701b7219278e6233dcb959b35169b70b44d9083225be822fcc312b99e35e2c49"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::parse_generic_params (cyclomatic 16): Parser::parse_generic_params 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":"compiler/rustc_parse/src/parser/generics.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bf7467be8b231033d9704c1b4744bd3fdbea8dd43dfcb801a55239ba0243ea2"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::new (cyclomatic 16): Parser::new 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":"compiler/rustc_parse_format/src/lib.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e161d56726a454a0d83da2efb8a3b1b3ad74562389b648eb8aa08b76af16ad8"}},{"ruleId":"D1","level":"warning","message":{"text":"PlaceInfo::split_column_ctors (cyclomatic 16): PlaceInfo::split_column_ctors has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_pattern_analysis/src/usefulness.rs"},"region":{"startLine":924}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc0c1c874e3a5181251ade76b01de7e7dde4a133b33dd1cf487e8005d6b00c13"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_pattern_analysis::rustc::print::write_struct_like (cyclomatic 16): rustc_pattern_analysis::rustc::print::write_struct_like 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":"compiler/rustc_pattern_analysis/src/rustc/print.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf2d2462957de2879a73e3d2101a34981a93eb623b2af2bfec2a924af6b80e18"}},{"ruleId":"D1","level":"warning","message":{"text":"LateResolutionVisitor::restrict_assoc_type_in_where_clause (cyclomatic 16): LateResolutionVisitor::restrict_assoc_type_in_where_clause 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":"compiler/rustc_resolve/src/late/diagnostics.rs"},"region":{"startLine":2304}}}],"partialFingerprints":{"codehealthFindingId/v1":"2383380885b0c7a9536bf73f51bcc3f4e3d8feeacb772911a3e23207920ae7f9"}},{"ruleId":"D1","level":"warning","message":{"text":"LateResolutionVisitor::detect_and_suggest_const_parameter_error (cyclomatic 16): LateResolutionVisitor::detect_and_suggest_const_parameter_error 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":"compiler/rustc_resolve/src/late/diagnostics.rs"},"region":{"startLine":3811}}}],"partialFingerprints":{"codehealthFindingId/v1":"975460415408c6e3f2c0beeb1f02cc5cd98a9c858c788e2d360aaa8e44107670"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_session::options::parse::parse_instrument_xray (cyclomatic 16): rustc_session::options::parse::parse_instrument_xray has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions. This is NOT this file\u0027s highest cyclomatic complexity: rustc_session::options::parse::parse_sanitizers (cyclomatic 17) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_session/src/options.rs"},"region":{"startLine":1739}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ef6c6d9074d58dcd9eb93866bc85fbabf8dec5844157b66df3d716fb0de5cbb"}},{"ruleId":"D1","level":"warning","message":{"text":"FnAbi::llvm_type (cyclomatic 16): FnAbi::llvm_type 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":"compiler/rustc_codegen_llvm/src/abi.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff56b6f140af431b6a09013c32089b70b18ba181a55a1712fddce1ac5902a8b4"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_target::callconv::sparc64::classify_arg (cyclomatic 16): rustc_target::callconv::sparc64::classify_arg 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":"compiler/rustc_target/src/callconv/sparc64.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"c353a782a05b49033ff67c58b7f8ac9c3d910789e59975481945cf1a90752a30"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_target::callconv::x86::fill_inregs (cyclomatic 16): rustc_target::callconv::x86::fill_inregs 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":"compiler/rustc_target/src/callconv/x86.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c33a13a31dea37bce1cdac8a7aaad7fe489355aed4bf8a75a557fa1b5b29cec"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeErrCtxt::suggest_await_on_expect_found (cyclomatic 16): TypeErrCtxt::suggest_await_on_expect_found 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":"compiler/rustc_trait_selection/src/error_reporting/infer/suggest.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bd8a634051a2b987a2fa06b4a37ed13c2d7210ab14e80a25d0150da42fb0dba"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeErrCtxt::suggest_for_all_lifetime_closure (cyclomatic 16): TypeErrCtxt::suggest_for_all_lifetime_closure 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":"compiler/rustc_trait_selection/src/error_reporting/infer/suggest.rs"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"1919f268bdfcfce67d0bc7d5efc29b1d43ca3aa302d7b1eb4d0b4a43fe34e944"}},{"ruleId":"D1","level":"warning","message":{"text":"AutoTraitFinder::map_vid_to_region (cyclomatic 16): AutoTraitFinder::map_vid_to_region 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":"compiler/rustc_trait_selection/src/traits/auto_trait.rs"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"26cd8f5b3e6dc9f31109f85b26ba2c67728e6aba4973e885ecd1c1009d1eb839"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_ty_utils::abi::fn_sig_for_fn_abi (cyclomatic 16): rustc_ty_utils::abi::fn_sig_for_fn_abi 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":"compiler/rustc_ty_utils/src/abi.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"650d3b6f5aa8fd0912e78362aeb4012d58f6a5e19ce23580135ab23cc3696b3a"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_ty_utils::abi::fn_abi_sanity_check (cyclomatic 16): rustc_ty_utils::abi::fn_abi_sanity_check has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 2 of the 16 points are its own statements and the rest belongs to 2 function items inside it that branch (fn_arg_sanity_check, fn_arg_attrs_sanity_check). 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":"compiler/rustc_ty_utils/src/abi.rs"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"68e49c043661f4d262382a56318096a1534879a04296bb191dbf835e3edb7b4e"}},{"ruleId":"D1","level":"warning","message":{"text":"OutlivesCollector::visit_ty (cyclomatic 16): OutlivesCollector::visit_ty 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":"compiler/rustc_type_ir/src/outlives.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"28ee97d8dae9da3417ddf1c272e76a69533489a2c34fc74f4908a6e94808a446"}},{"ruleId":"D1","level":"warning","message":{"text":"libm::configure::emit (cyclomatic 16): libm::configure::emit has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/compiler-builtins/libm/configure.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"57ba79882ea6f9ecc969fe8b5d474d735b4c818befcb4686a68c9bf49646e480"}},{"ruleId":"D1","level":"warning","message":{"text":"libm::math::jn::yn (cyclomatic 16): libm::math::jn::yn 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":"library/compiler-builtins/libm/src/math/jn.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"03ffb6b4fb51dc3785c2267de6be92515a51e991257c8fb268d156cccd82c8bf"}},{"ruleId":"D1","level":"warning","message":{"text":"TwoWaySearcher::next (cyclomatic 16): TwoWaySearcher::next has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (TwoWaySearcher::next_back) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/str/pattern.rs"},"region":{"startLine":1588}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f2e09889d05e4d49d3289ab132c73f2436a259d5f284f19c702dba963be6955"}},{"ruleId":"D1","level":"warning","message":{"text":"TwoWaySearcher::next_back (cyclomatic 16): TwoWaySearcher::next_back has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (TwoWaySearcher::next) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/str/pattern.rs"},"region":{"startLine":1683}}}],"partialFingerprints":{"codehealthFindingId/v1":"7341f6e826bbb9713e7d8839f04e3c5d7837b83c3b7644daf6a9aaedfbb9a267"}},{"ruleId":"D1","level":"warning","message":{"text":"core::str::pattern::simd_contains (cyclomatic 16): core::str::pattern::simd_contains 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":"library/core/src/str/pattern.rs"},"region":{"startLine":1941}}}],"partialFingerprints":{"codehealthFindingId/v1":"629742577e1ed6bb24a0717720359445dd52e67894e2b41aa54dc373947ce221"}},{"ruleId":"D1","level":"warning","message":{"text":"Command::do_exec (cyclomatic 16): Command::do_exec has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: std::sys::process::unix::unix::signal_string (cyclomatic 38) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/process/unix/unix.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bf3a73860eb34c02fcd74da6056dab8a3cd89638c8a1b1fd2ec91cf4a0cedf1"}},{"ruleId":"D1","level":"warning","message":{"text":"Copier::copy (cyclomatic 16): Copier::copy 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":"library/std/src/sys/io/kernel_copy/linux.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"8016d7b5a12da23c6f4ac7b2b3716fb90343708685e849dea9b96dc8ebe9d8a0"}},{"ruleId":"D1","level":"warning","message":{"text":"Command::fmt (cyclomatic 16): Command::fmt 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":"library/std/src/sys/process/unsupported.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f3d702e9476aec67d0a00be6c5213d970bdc185a504e854b01c65baef3f284e"}},{"ruleId":"D1","level":"warning","message":{"text":"Command::spawn_with_attributes (cyclomatic 16): Command::spawn_with_attributes 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":"library/std/src/sys/process/windows.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa34a58ee96f8f9d33a9bd2c386676fe53e9ce8f11369b40f34a4d98e72bc373"}},{"ruleId":"D1","level":"warning","message":{"text":"std::sys::args::uefi::parse_lp_cmd_line (cyclomatic 16): std::sys::args::uefi::parse_lp_cmd_line has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/args/uefi.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea37ebbe6b6a9e44f509565f5f07fc44c3fe776b377c3e6de241e3435203f20c"}},{"ruleId":"D1","level":"warning","message":{"text":"std::sys::args::windows::append_bat_arg (cyclomatic 16): std::sys::args::windows::append_bat_arg 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":"library/std/src/sys/args/windows.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0de5fe7aa9f387968b16d5817a3040c7298ac4525835a58632754dd85729af3"}},{"ruleId":"D1","level":"warning","message":{"text":"std::sys::io::kernel_copy::linux::copy_regular_files (cyclomatic 16): std::sys::io::kernel_copy::linux::copy_regular_files has cyclomatic complexity 16 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. 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":"library/std/src/sys/io/kernel_copy/linux.rs"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a621a8b723c3aec2358ba1940a2385df8c208aeb943ab6464daefeae94207c6"}},{"ruleId":"D1","level":"warning","message":{"text":"std::sys::random::linux::getrandom (cyclomatic 16): std::sys::random::linux::getrandom 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":"library/std/src/sys/random/linux.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"8da19b46cc1ad898b965c61986bf6c40ebd03c1bbb8d3aeec4edfbf8fdb12c8f"}},{"ruleId":"D1","level":"warning","message":{"text":"ClassStack::push (cyclomatic 16): ClassStack::push has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: Class::as_html (cyclomatic 19) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/highlight.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea3d39146c89e888e8599a4c7c7b118ebe87f66c6701d62ae4e18ed6387bcf52"}},{"ruleId":"D1","level":"warning","message":{"text":"LinkCollector::resolve_with_disambiguator_cached (cyclomatic 16): LinkCollector::resolve_with_disambiguator_cached has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions. This is NOT this file\u0027s highest cyclomatic complexity: rustdoc::passes::collect_intra_doc_links::resolve_primitive (cyclomatic 29) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/passes/collect_intra_doc_links.rs"},"region":{"startLine":1552}}}],"partialFingerprints":{"codehealthFindingId/v1":"56fe2f424bd206256ce2ff839d692be028a6fe4128749def54f80b823d6aec89"}},{"ruleId":"D1","level":"warning","message":{"text":"ImplStripper::fold_item (cyclomatic 16): ImplStripper::fold_item 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/librustdoc/passes/stripper.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef5bd261d8fcd86f03c6546f9c198ffbcba5d54818889432de35332fade1ce4d"}},{"ruleId":"D1","level":"warning","message":{"text":"rustdoc::doctest::run (cyclomatic 16): rustdoc::doctest::run 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/librustdoc/doctest.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"b895d113e92daa4b17c0d418a8a1ed3d4c7e39910ca37bdb96982bb74251a466"}},{"ruleId":"D1","level":"warning","message":{"text":"rustdoc::formats::cache::add_item_to_search_index (cyclomatic 16): rustdoc::formats::cache::add_item_to_search_index 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/librustdoc/formats/cache.rs"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"909cd088f173d480513b19222f61b18ebb28bbe63c9ea5df4ba8c4d652062ea5"}},{"ruleId":"D1","level":"warning","message":{"text":"rustdoc::html::render::sidebar::print_sidebar (cyclomatic 16): rustdoc::html::render::sidebar::print_sidebar 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/librustdoc/html/render/sidebar.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"40870684149422bce68966cc8c43a36bbbb860e5edcc684d0de59bb1ac1f5a5c"}},{"ruleId":"D1","level":"warning","message":{"text":"LargeUnoptStackFrames::check_fn (cyclomatic 16): LargeUnoptStackFrames::check_fn 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/tools/clippy/clippy_lints/src/large_unopt_stack_frames.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"27aca17e332df6118dc716345399326e08ded23e20fb6852e2745cbaa7952d6b"}},{"ruleId":"D1","level":"warning","message":{"text":"VarVisitor::check (cyclomatic 16): VarVisitor::check 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/tools/clippy/clippy_lints/src/loops/needless_range_loop.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4fe43a8c8b6f78b002594c708e010342c1043662fc48c735f3c28895a754b74"}},{"ruleId":"D1","level":"warning","message":{"text":"NoEffect::check_no_effect (cyclomatic 16): NoEffect::check_no_effect 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/tools/clippy/clippy_lints/src/no_effect.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"7387a19881fe7c5b42a4c35aa48f59ad87927cc7cca3c51f0bd46fdaf24ae540"}},{"ruleId":"D1","level":"warning","message":{"text":"PanicUnimplemented::check_expr (cyclomatic 16): PanicUnimplemented::check_expr 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/tools/clippy/clippy_lints/src/panic_unimplemented.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"402ccf577411269f17fe8c3b39fd9ca00fe6b7b3d396e373c07a2188810a8fb6"}},{"ruleId":"D1","level":"warning","message":{"text":"QuestionMark::check_manual_let_else (cyclomatic 16): QuestionMark::check_manual_let_else 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/tools/clippy/clippy_lints/src/manual_let_else.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec30866a14dcf210c77ad528febda3ca340bee5fb46bfd7f9ec514cc2db5396a"}},{"ruleId":"D1","level":"warning","message":{"text":"UnnecessaryWraps::check_fn (cyclomatic 16): UnnecessaryWraps::check_fn 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/tools/clippy/clippy_lints/src/unnecessary_wraps.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ff5a0a0f6dc58d178e6145ba3794af232120569f8c08a20e1bf0168f6197f46"}},{"ruleId":"D1","level":"warning","message":{"text":"WildcardImports::check_use_tree (cyclomatic 16): WildcardImports::check_use_tree 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/tools/clippy/clippy_lints/src/wildcard_imports.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"806c724feaa1ec89452b6b0d9459374b254c477fcb590f0e8b87d525ab507e5d"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::booleans::simplify_not (cyclomatic 16): clippy_lints::booleans::simplify_not 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/tools/clippy/clippy_lints/src/booleans.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"a802b69ec3366864ba8c5fa650adeb777dd19ad3bba35bcfc75c25809d16ed70"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::casts::cast_possible_wrap::check (cyclomatic 16): clippy_lints::casts::cast_possible_wrap::check 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/tools/clippy/clippy_lints/src/casts/cast_possible_wrap.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"395a4492b0fe4264b1aa6ff817d6554d4a74b27fdab17c25d8b2fdf4149edae8"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::functions::too_many_lines::check_fn (cyclomatic 16): clippy_lints::functions::too_many_lines::check_fn 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/tools/clippy/clippy_lints/src/functions/too_many_lines.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cb4dd619cc8220b0802bb685d84661831cdaf44e734c7abe466e81a2d8920b8"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::manual_clamp::is_call_max_min_pattern (cyclomatic 16): clippy_lints::manual_clamp::is_call_max_min_pattern has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 2 of the 16 points are its own statements and the rest belongs to 2 function items inside it that branch (check, segment). 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/tools/clippy/clippy_lints/src/manual_clamp.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"deb8f15d360bd50669502efda8b2be958e83d7175fc426605213ea64c5afe4ff"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::methods::map_unwrap_or::check (cyclomatic 16): clippy_lints::methods::map_unwrap_or::check 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/tools/clippy/clippy_lints/src/methods/map_unwrap_or.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"be55090f874bbb68b85589b0e98584aa97362f54c1ca80f8d0e1711f5dd418f8"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::question_mark::check_if_let_some_or_err_and_early_return (cyclomatic 16): clippy_lints::question_mark::check_if_let_some_or_err_and_early_return 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/tools/clippy/clippy_lints/src/question_mark.rs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"222aaee8c44a44ca5c6f6f10c5492cbef76d2996bb488b2a68416928156da61d"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_utils::qualify_min_const_fn::check_rvalue (cyclomatic 16): clippy_utils::qualify_min_const_fn::check_rvalue 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/tools/clippy/clippy_utils/src/qualify_min_const_fn.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"03b0bb8b0660c9ea7b89d53e7d3ddff042a022397335ac7ac08ded5233eb665c"}},{"ruleId":"D1","level":"warning","message":{"text":"CrateWithSource::download_and_extract (cyclomatic 16): CrateWithSource::download_and_extract has cyclomatic complexity 16 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 4 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/tools/clippy/lintcheck/src/input.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4efdc55ff7fac8b29ba5f3e1c8693225a4b95ca38304d6244cbf71ee057b1c5"}},{"ruleId":"D1","level":"warning","message":{"text":"Crate::run_clippy_lints (cyclomatic 16): Crate::run_clippy_lints 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/tools/clippy/lintcheck/src/main.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c53f4177711a75a2cdb256bea4a6fe6c5281233536b741568129e01bfd3e076"}},{"ruleId":"D1","level":"warning","message":{"text":"TestCx::document_inner (cyclomatic 16): TestCx::document_inner 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/tools/compiletest/src/runtest.rs"},"region":{"startLine":1012}}}],"partialFingerprints":{"codehealthFindingId/v1":"da72aa008214edcddf6dd9bc0b8bcf9c97574d75d3807f82a32fed1c712457b3"}},{"ruleId":"D1","level":"warning","message":{"text":"TestCx::build_auxiliary (cyclomatic 16): TestCx::build_auxiliary 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/tools/compiletest/src/runtest.rs"},"region":{"startLine":1434}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3e9d6b3af046148814edd0a37c0b7afde378f6b0759fe5807533c369efdc5c2"}},{"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":"src/tools/miri/miri-script/src/commands.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6938ab42d767e491934f32d663328689ed57ffe461e9165b592b0c781362582"}},{"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/tools/miri/src/borrow_tracker/stacked_borrows/mod.rs"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"da49116f8453d30d9379087f5a6f44ac4fe50034bb3b20a42cb4c2ebbb9206b5"}},{"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/tools/miri/src/concurrency/data_race.rs"},"region":{"startLine":1111}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a95d8638c5b113a37a9a99369b881e2bdc4ed8ea5c0334ad70ddb78a3a7e46f"}},{"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/tools/miri/src/concurrency/scheduler.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"15db69cd21192048a3aeb975a402e85424a19eaaf5032d6f465e0fac4115217a"}},{"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/tools/miri/src/intrinsics/x86/bmi.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"36de9a43479d2896d5900ba4fe8d40a67e25488d4ffae73d790d2c558c6c1fed"}},{"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/tools/miri/src/machine.rs"},"region":{"startLine":1463}}}],"partialFingerprints":{"codehealthFindingId/v1":"62b3be418465b8c34d75e656f75d98ac9ba61448acfc5790594aac4a8101a4fe"}},{"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/tools/miri/src/shims/unix/freebsd/sync.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"0657179853581be5749572b47ccfcaf7eb620e3975657989f809c27463c8b31f"}},{"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/tools/miri/src/shims/unix/socket.rs"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a73294861f73be455b19273d29dfde37def41c0323f41142478341aec002fe7"}},{"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/tools/miri/src/shims/unix/socket.rs"},"region":{"startLine":1125}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5514768c60c3fbb0744d03aa7620235564b7d9f682ddee3e3a0d397690c58b6"}},{"ruleId":"D1","level":"warning","message":{"text":"UseTree::expand_impl (cyclomatic 16): UseTree::expand_impl has cyclomatic complexity 16 (threshold 15). Of this number, 10 points are the body\u0027s own statements and 6 belong to one function item inside it that branches. 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/tools/rust-analyzer/crates/hir-def/src/item_tree.rs"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"0897a5aa9bc8b0ecfb42264598c2dffcc3abe113ec4d104509f8ef0650e3c594"}},{"ruleId":"D1","level":"warning","message":{"text":"DefMap::resolve_path_fp_with_macro_single (cyclomatic 16): DefMap::resolve_path_fp_with_macro_single has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/nameres/path_resolution.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ca158f2fe6287129c0696b1764951fb11f826613fb0480fcfe1728376e96c17"}},{"ruleId":"D1","level":"warning","message":{"text":"FunctionSignature::with_source_map (cyclomatic 16): FunctionSignature::with_source_map 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/tools/rust-analyzer/crates/hir-def/src/signatures.rs"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"75a94f74ada86e2d30d16eed50889b4d003ff2479f472f0d1ad699c087aeb9b5"}},{"ruleId":"D1","level":"warning","message":{"text":"hir_def::find_path::find_local_import_locations (cyclomatic 16): hir_def::find_path::find_local_import_locations 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/tools/rust-analyzer/crates/hir-def/src/find_path.rs"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"c04c527de2b98df6c0ef64d5d4b80fb08e30e03efd161b35538a380121ef0785"}},{"ruleId":"D1","level":"warning","message":{"text":"PathLoweringContext::resolve_path_in_value_ns (cyclomatic 16): PathLoweringContext::resolve_path_in_value_ns 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/tools/rust-analyzer/crates/hir-ty/src/lower/path.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"92be390bd92e25231b974fb3b2440e2155069a6fc75bf87c3453907365883735"}},{"ruleId":"D1","level":"warning","message":{"text":"Filler::fill_body (cyclomatic 16): Filler::fill_body 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/tools/rust-analyzer/crates/hir-ty/src/mir/monomorphization.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"014949571fa50990fff23b61d89faee014eb21660cea36fbadaa24653c41418c"}},{"ruleId":"D1","level":"warning","message":{"text":"Generalizer::tys (cyclomatic 16): Generalizer::tys 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/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/relate/generalize.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"4289b4d26a05000192aaacdd2a2f2630e77ee229c2bc922af68bb90dc236364a"}},{"ruleId":"D1","level":"warning","message":{"text":"hir_ty::consteval::intern_const_ref (cyclomatic 16): hir_ty::consteval::intern_const_ref 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/tools/rust-analyzer/crates/hir-ty/src/consteval.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"475cbdc2c4528b21b85f46123e41964226a4f2e4933c3e390f5573b4d3f49528"}},{"ruleId":"D1","level":"warning","message":{"text":"hir_ty::infer::infer_query_with_inspect (cyclomatic 16): hir_ty::infer::infer_query_with_inspect has cyclomatic complexity 16 (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/tools/rust-analyzer/crates/hir-ty/src/infer.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"62ce1798598bf7ae714dceacc159405324bab1cac48cad6b5460be3f5da0f994"}},{"ruleId":"D1","level":"warning","message":{"text":"ide::highlight_related::highlight_break_points (cyclomatic 16): ide::highlight_related::highlight_break_points has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 7 of the 16 points are its own statements and the rest belongs to one function item inside it that branches (hl). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest. This is NOT this file\u0027s highest cyclomatic complexity: ide::highlight_related::highlight_related (cyclomatic 18) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/highlight_related.rs"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"962a3c88dd2311187e8658cad0bc6911e83253580524f88fa84b5a40c2b275f2"}},{"ruleId":"D1","level":"warning","message":{"text":"ide::hover::goto_type_action_for_def (cyclomatic 16): ide::hover::goto_type_action_for_def 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/tools/rust-analyzer/crates/ide/src/hover.rs"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"62b0685bbccf3402b72bf1d78730e6a687643634c0adf62f64d104a4408df682"}},{"ruleId":"D1","level":"warning","message":{"text":"ide::hover::render::try_expr (cyclomatic 16): ide::hover::render::try_expr 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/tools/rust-analyzer/crates/ide/src/hover/render.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"faae56208331b352a9963d25649d200cad747145f64e4101ff458463f3cc7dea"}},{"ruleId":"D1","level":"warning","message":{"text":"ide::rename::find_definitions (cyclomatic 16): ide::rename::find_definitions 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/tools/rust-analyzer/crates/ide/src/rename.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"15b55a814a47e4321ace0e3314a7ecfc644d8fa3714c4c6d676358f41147b138"}},{"ruleId":"D1","level":"warning","message":{"text":"ide_assists::handlers::convert_closure_to_fn::compute_closure_type_params (cyclomatic 16): ide_assists::handlers::convert_closure_to_fn::compute_closure_type_params 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/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_closure_to_fn.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7eccae3bb7cc63415fe235359105505553ddf6e5bd97f3f2c62146db9ec2ec6"}},{"ruleId":"D1","level":"warning","message":{"text":"ide_assists::handlers::extract_expressions_from_format_string::extract_expressions_from_format_string (cyclomatic 16): ide_assists::handlers::extract_expressions_from_format_string::extract_expressions_from_format_string 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/tools/rust-analyzer/crates/ide-assists/src/handlers/extract_expressions_from_format_string.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"203471c8e9549beae7775268aa756a8185e932ff2c286519d44c217de09bc99a"}},{"ruleId":"D1","level":"warning","message":{"text":"ide_assists::handlers::generate_delegate_methods::generate_delegate_methods (cyclomatic 16): ide_assists::handlers::generate_delegate_methods::generate_delegate_methods 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/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_delegate_methods.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a7eaf109ebe2d030b526891a336b8462adcfd78c17695128b6f23e20dc6746e"}},{"ruleId":"D1","level":"warning","message":{"text":"ide_assists::handlers::wrap_unwrap_cfg_attr::attempt_get_derive (cyclomatic 16): ide_assists::handlers::wrap_unwrap_cfg_attr::attempt_get_derive 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/tools/rust-analyzer/crates/ide-assists/src/handlers/wrap_unwrap_cfg_attr.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e4a5bc0556dc9cafc10da1cc91d40acd895d1e55eda670612892af40a3ae4ed"}},{"ruleId":"D1","level":"warning","message":{"text":"ide_assists::utils::invert_special_case (cyclomatic 16): ide_assists::utils::invert_special_case 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/tools/rust-analyzer/crates/ide-assists/src/utils.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"df38d91c384196a3eb7b891be72f1b5d9358ba52a767b728761acf7462753837"}},{"ruleId":"D1","level":"warning","message":{"text":"CompletionContext::new (cyclomatic 16): CompletionContext::new 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/tools/rust-analyzer/crates/ide-completion/src/context.rs"},"region":{"startLine":790}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0919446c8f2dda21e678820258c05ef7be3c844530d8090090de33ac3e35ae1"}},{"ruleId":"D1","level":"warning","message":{"text":"ide_completion::completions::attribute::cfg::complete_cfg (cyclomatic 16): ide_completion::completions::attribute::cfg::complete_cfg 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/tools/rust-analyzer/crates/ide-completion/src/completions/attribute/cfg.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"beb99fda060f9e813bdaa672de9816400387645864dad024f2868d1570f76dfb"}},{"ruleId":"D1","level":"warning","message":{"text":"ide_db::imports::merge_imports::use_tree_cmp (cyclomatic 16): ide_db::imports::merge_imports::use_tree_cmp 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/tools/rust-analyzer/crates/ide-db/src/imports/merge_imports.rs"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"debb08bb97b677abf936467b40c135c3627c72f311c0dc65215613460db4e4d2"}},{"ruleId":"D1","level":"warning","message":{"text":"parser::grammar::expressions::expr_bp (cyclomatic 16): parser::grammar::expressions::expr_bp has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: parser::grammar::expressions::current_op (cyclomatic 33) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/parser/src/grammar/expressions.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"079b258578f58c9eaef1a00e78e79f00eb3485530f37875d03410634f3ff4531"}},{"ruleId":"D1","level":"warning","message":{"text":"WorkspaceBuildScripts::run_command (cyclomatic 16): WorkspaceBuildScripts::run_command 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/tools/rust-analyzer/crates/project-model/src/build_dependencies.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"52d452bf5102d3f29c449ab3b43feedaa044a6755865e2a9aeab39e338c0d025"}},{"ruleId":"D1","level":"warning","message":{"text":"WorkspaceBuildScripts::build_command (cyclomatic 16): WorkspaceBuildScripts::build_command 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/tools/rust-analyzer/crates/project-model/src/build_dependencies.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"55fe35cb206eae07854452a60f2053963e1dfa03ac65df30a55b43ead7543467"}},{"ruleId":"D1","level":"warning","message":{"text":"ProjectWorkspace::load_cargo (cyclomatic 16): ProjectWorkspace::load_cargo 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/tools/rust-analyzer/crates/project-model/src/workspace.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"471e7937d98bdb777cf04fd8649c80b7463b9824e6f4a77dc2faae6a1e872017"}},{"ruleId":"D1","level":"warning","message":{"text":"project_model::workspace::project_json_to_crate_graph (cyclomatic 16): project_model::workspace::project_json_to_crate_graph 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/tools/rust-analyzer/crates/project-model/src/workspace.rs"},"region":{"startLine":1107}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a92ccebb7d6ee5c6729bb53955c37233ed83d74921e18da29d2c9b3ba38b99c"}},{"ruleId":"D1","level":"warning","message":{"text":"FlycheckActor::check_command (cyclomatic 16): FlycheckActor::check_command 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/tools/rust-analyzer/crates/rust-analyzer/src/flycheck.rs"},"region":{"startLine":884}}}],"partialFingerprints":{"codehealthFindingId/v1":"0942849de81ca332a288b36f3cd578f17b2137f867346ed31e13ee98d42e4a20"}},{"ruleId":"D1","level":"warning","message":{"text":"rust_analyzer::session::run_session (cyclomatic 16): rust_analyzer::session::run_session 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/tools/rust-analyzer/crates/rust-analyzer/src/session.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"88f5e8e0927b0e1a87f65612d1a28c25103fc9f9201e9ff3f0208a4009ee347a"}},{"ruleId":"D1","level":"warning","message":{"text":"AstIdMap::from_source (cyclomatic 16): AstIdMap::from_source has cyclomatic complexity 16 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 1 belongs 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. This is NOT this file\u0027s highest cyclomatic complexity: ErasedFileAstIdKind::syntax_kind (cyclomatic 20) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/span/src/ast_id.rs"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"372583f6a9ef38eb130da850a63035bfaf86dde3f3440238e50248c155ae3ebe"}},{"ruleId":"D1","level":"warning","message":{"text":"xtask::codegen::lints::generate_lint_descriptor (cyclomatic 16): xtask::codegen::lints::generate_lint_descriptor has cyclomatic complexity 16 (threshold 15). Of this number, 9 points are the body\u0027s own statements and 7 belong to one function item inside it that branches. To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/xtask/src/codegen/lints.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"95933f25f050fd78e6cbe2d523a2c57a498bb926a813a31e31c21adcce55884d"}},{"ruleId":"D1","level":"warning","message":{"text":"xtask::publish::notes::get_next_line_component (cyclomatic 16): xtask::publish::notes::get_next_line_component 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/tools/rust-analyzer/xtask/src/publish/notes.rs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0a1dd2b58c25072e37f1b3a5f35c5881f9398650967d3ae6c97999728c7da13"}},{"ruleId":"D1","level":"warning","message":{"text":"MacroBranch::rewrite (cyclomatic 16): MacroBranch::rewrite 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/tools/rustfmt/src/macros.rs"},"region":{"startLine":1310}}}],"partialFingerprints":{"codehealthFindingId/v1":"25084a690f226273d1a967ac5bcc08c0211aa91d445e8ea695eda63bda3e4c74"}},{"ruleId":"D1","level":"warning","message":{"text":"rustfmt_nightly::expr::rewrite_struct_lit (cyclomatic 16): rustfmt_nightly::expr::rewrite_struct_lit 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/tools/rustfmt/src/expr.rs"},"region":{"startLine":1827}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2f52c9b8a83107bf3d0b582969179eceaef886605a6bfffddf70201fde51b97"}},{"ruleId":"D1","level":"warning","message":{"text":"tidy::deps::check_permitted_dependencies (cyclomatic 16): tidy::deps::check_permitted_dependencies has cyclomatic complexity 16 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 3 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/tools/tidy/src/deps.rs"},"region":{"startLine":962}}}],"partialFingerprints":{"codehealthFindingId/v1":"54c1e430da1382c1dd38ce16a582a5c25b1968cfef835222c88f6827ddf86454"}},{"ruleId":"D1","level":"warning","message":{"text":"check_intrinsics_duplicates.check_duplicates (cyclomatic 16): check_intrinsics_duplicates.check_duplicates 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":"compiler/rustc_codegen_gcc/tools/check_intrinsics_duplicates.py"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff3464280c64e7eeaaa20669d7a0e0dff0f7b3574432567f2a697f63c6e714fb"}},{"ruleId":"D1","level":"warning","message":{"text":"bootstrap.bootstrap (cyclomatic 16): bootstrap.bootstrap 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/bootstrap/bootstrap.py"},"region":{"startLine":1332}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec42954c0f82350fcafa03954d5d3e3bfd2a10e3ebd41929f9758270942743ae"}},{"ruleId":"D1","level":"warning","message":{"text":"configure.parse_args (cyclomatic 16): configure.parse_args 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/bootstrap/configure.py"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d9c1ec83fee366399a6e97c474039cc8158f401ac5800db25c64a2253adcd3a"}},{"ruleId":"D1","level":"warning","message":{"text":"search.initSearch::showResults (cyclomatic 16): search.initSearch::showResults has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: 12 other methods here (search.initSearch, search.initSearch::getItemsBefore, search.initSearch::getNextElem, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 13 times rather than 13 independent problems. Splitting this body alone leaves the other 12 exactly as they are. Where these are variations on one operation, the change that clears all 13 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":5280}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ffffa3b038075dc47fec555a3544ba4a3fa91a8080829fa409a50e0e800fbe8"}},{"ruleId":"D1","level":"warning","message":{"text":"tester.runSearch (cyclomatic 16): tester.runSearch 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/tools/rustdoc-js/tester.js"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffc66a670f6704698e2c2fdb42917d1bdcd21cc9f864a94456527438c3dd030f"}},{"ruleId":"D2","level":"warning","message":{"text":"stringdex.loadDatabase (cognitive 397): stringdex.loadDatabase has cognitive complexity 397 (threshold 15). Drivers by points: if/else 221 (464 pts), loops 72 (159 pts), ternaries 17 (37 pts), boolean chains 26 (nesting depth added 350). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This shape REPEATS in the file: one other method here (stringdex.loadDatabase::loadColumnFromBytes) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/stringdex.js"},"region":{"startLine":1089}}}],"partialFingerprints":{"codehealthFindingId/v1":"0347bc376bc086faa0e19ecd36527357ddbaf40807d326723dfbb3df6da4c1ef"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_codegen_gcc::intrinsic::simd::generic_simd_intrinsic (cognitive 363): rustc_codegen_gcc::intrinsic::simd::generic_simd_intrinsic has cognitive complexity 363 (threshold 15). Drivers by points: if/else 151 (243 pts), match/switch 55 (89 pts), loops 12 (22 pts), boolean chains 9 (nesting depth added 136). Of this number, 342 points are the body\u0027s own statements and 21 belong to 5 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_gcc/src/intrinsic/simd.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"58f68e086151aa76ec11d51993784a806014d2bf39b3b6d711f6a759bbd164c5"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_codegen_llvm::intrinsic::generic_simd_intrinsic (cognitive 327): rustc_codegen_llvm::intrinsic::generic_simd_intrinsic has cognitive complexity 327 (threshold 15). Drivers by points: if/else 138 (215 pts), match/switch 58 (100 pts), boolean chains 8, loops 2 (4 pts) (nesting depth added 121). Of this number, 323 points are the body\u0027s own statements and 4 belong to 3 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/intrinsic.rs"},"region":{"startLine":1979}}}],"partialFingerprints":{"codehealthFindingId/v1":"df5d9afb288336d821b5da892f35168eafaabd76334cdf19e2667dc41c16f135"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeChecker::visit_rvalue (cognitive 240): TypeChecker::visit_rvalue has cognitive complexity 240 (threshold 15). Drivers by points: if/else 66 (196 pts), loops 10 (30 pts), match/switch 5 (9 pts), boolean chains 5 (nesting depth added 154). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/validate.rs"},"region":{"startLine":1018}}}],"partialFingerprints":{"codehealthFindingId/v1":"36257eb9a17571341ba00fa40af10f7f0cb5953af4d4c4f4fb7487694a78f346"}},{"ruleId":"D2","level":"warning","message":{"text":"LangItem::from_u32 (cognitive 233): LangItem::from_u32 has cognitive complexity 233 (threshold 15). Drivers by points: if/else 233. 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":"compiler/rustc_attr_ir/src/lang_items.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"051e879866c96ec04439cb74360137d0831ca1c905e3274456204c8a937ac2d9"}},{"ruleId":"D2","level":"warning","message":{"text":"stdarch_gen_loongarch::gen_test_body (cognitive 224): stdarch_gen_loongarch::gen_test_body has cognitive complexity 224 (threshold 15). Drivers by points: loops 72 (144 pts), if/else 44 (54 pts), boolean chains 14, match/switch 10 (12 pts) (nesting depth added 84). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/stdarch-gen-loongarch/src/main.rs"},"region":{"startLine":859}}}],"partialFingerprints":{"codehealthFindingId/v1":"88784674f1798e71786c491e4957df5c4ea9eaaede1f50d87e32b8b400844a0f"}},{"ruleId":"D2","level":"warning","message":{"text":"Evaluator::exec_intrinsic (cognitive 213): Evaluator::exec_intrinsic has cognitive complexity 213 (threshold 15). Drivers by points: if/else 86 (177 pts), match/switch 14 (27 pts), loops 3 (6 pts), boolean chains 3 (nesting depth added 107). To reduce it, split the body into named stages: move each independent step or branch into 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/tools/rust-analyzer/crates/hir-ty/src/mir/eval/shim.rs"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"c369128f5dd232cd7c6e57ac1ecef46f42cb1201965472b35f0fc932f605c4b9"}},{"ruleId":"D2","level":"warning","message":{"text":"MirLowerCtx::lower_expr_to_place_without_adjust (cognitive 208): MirLowerCtx::lower_expr_to_place_without_adjust has cognitive complexity 208 (threshold 15). Drivers by points: if/else 62 (140 pts), match/switch 23 (54 pts), loops 4 (9 pts), boolean chains 5 (nesting depth added 114). 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/tools/rust-analyzer/crates/hir-ty/src/mir/lower.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"40e0d5b34de570f073bd7a3197ad4f7a5e83ca10eac2cb59382b0e6772faa46a"}},{"ruleId":"D2","level":"warning","message":{"text":"loadDatabase::makeSearchTreeFromBase64 (cognitive 195): loadDatabase::makeSearchTreeFromBase64 has cognitive complexity 195 (threshold 15). Drivers by points: if/else 45 (108 pts), ternaries 15 (58 pts), loops 8 (26 pts), boolean chains 3 (nesting depth added 124). 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/librustdoc/html/static/js/stringdex.js"},"region":{"startLine":3009}}}],"partialFingerprints":{"codehealthFindingId/v1":"57cc298a8e6c4c68b9dcac12863c3ccff90b65c068930a7fd7e4f42527fd8e55"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::suggest_traits_to_import (cognitive 190): FnCtxt::suggest_traits_to_import has cognitive complexity 190 (threshold 15). Drivers by points: if/else 45 (112 pts), match/switch 13 (36 pts), loops 8 (23 pts), boolean chains 19 (nesting depth added 105). 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":"compiler/rustc_hir_typeck/src/method/suggest.rs"},"region":{"startLine":4140}}}],"partialFingerprints":{"codehealthFindingId/v1":"4391a9c2ba92df2cdfb11254cce4ad508dacd29d44c648a6d99d1485ce4de6a5"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeErrCtxt::report_selection_error (cognitive 188): TypeErrCtxt::report_selection_error has cognitive complexity 188 (threshold 15). Drivers by points: if/else 57 (135 pts), boolean chains 24, match/switch 9 (22 pts), loops 2 (7 pts) (nesting depth added 96). 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":"compiler/rustc_trait_selection/src/error_reporting/traits/fulfillment_errors.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"420a672b6e22e5a698f86776d58525fdbe8900fb5e8e09162ed54776471a7446"}},{"ruleId":"D2","level":"warning","message":{"text":"ThirBuildCx::make_mirror_unadjusted (cognitive 181): ThirBuildCx::make_mirror_unadjusted has cognitive complexity 181 (threshold 15). Drivers by points: if/else 52 (105 pts), match/switch 22 (68 pts), loops 2 (5 pts), boolean chains 3 (nesting depth added 102). Of this number, 177 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. 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":"compiler/rustc_mir_build/src/thir/cx/expr.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"b72ad2e4c1f5508228e2aaec100eb0aada2fa5bdb3f8cc11b850fcdfb781fb16"}},{"ruleId":"D2","level":"warning","message":{"text":"LateResolutionVisitor::add_missing_lifetime_specifiers_label (cognitive 180): LateResolutionVisitor::add_missing_lifetime_specifiers_label has cognitive complexity 180 (threshold 15). Drivers by points: if/else 45 (120 pts), match/switch 8 (35 pts), loops 6 (17 pts), boolean chains 8 (nesting depth added 113). 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":"compiler/rustc_resolve/src/late/diagnostics.rs"},"region":{"startLine":4540}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b3453362e8267aea8d42e018b0f5196bddd0b52e9bdd055dbdc0e4108daed91"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_codegen_cranelift::intrinsics::simd::codegen_simd_intrinsic_call (cognitive 176): rustc_codegen_cranelift::intrinsics::simd::codegen_simd_intrinsic_call has cognitive complexity 176 (threshold 15). Drivers by points: if/else 54 (101 pts), match/switch 24 (44 pts), loops 14 (28 pts), boolean chains 3 (nesting depth added 81). 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":"compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1ed92347fd3dadabc31e00cca63723fc67783f5b68f41f76a76cf3f6eb44ec0"}},{"ruleId":"D2","level":"warning","message":{"text":"rustdoc::html::render::search_index::build_index (cognitive 175): rustdoc::html::render::search_index::build_index has cognitive complexity 175 (threshold 15). Drivers by points: if/else 46 (109 pts), loops 15 (38 pts), boolean chains 15, match/switch 7 (13 pts) (nesting depth added 92). Of this number, 128 points are the body\u0027s own statements and 47 belong to 3 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/render/search_index.rs"},"region":{"startLine":1267}}}],"partialFingerprints":{"codehealthFindingId/v1":"522219549c2525cfc8156dd60bfa275a8ca92cf75dbbe3675df41902ccc00fc2"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_completion::context::analysis::classify_name_ref (cognitive 172): ide_completion::context::analysis::classify_name_ref has cognitive complexity 172 (threshold 15). Drivers by points: if/else 48 (80 pts), match/switch 32 (67 pts), boolean chains 16, loops 2 (9 pts) (nesting depth added 74). To reduce it, split the body into named stages: move each independent step or branch into 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/tools/rust-analyzer/crates/ide-completion/src/context/analysis.rs"},"region":{"startLine":967}}}],"partialFingerprints":{"codehealthFindingId/v1":"894ab9b1edf81a938c4c90ec6c2343f06c60a346b5a75becd79870f720b4ad84"}},{"ruleId":"D2","level":"warning","message":{"text":"search.initSearch (cognitive 170): search.initSearch has cognitive complexity 170 (threshold 15). Drivers by points: if/else 529 (927 pts), boolean chains 191, loops 92 (159 pts), ternaries 82 (129 pts), error handling 2 (3 pts) (nesting depth added 513). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 15 other methods here (search.initSearch::getItemsBefore, search.initSearch::getNextElem, search.initSearch::createQueryElement, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 16 times rather than 16 independent problems. Splitting this body alone leaves the other 15 exactly as they are. Where these are variations on one operation, the change that clears all 16 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"b62fb84e1497331814c3651ae2f774eb3acd3ac34498074545ededef23d5115a"}},{"ruleId":"D2","level":"warning","message":{"text":"Methods::check_methods (cognitive 166): Methods::check_methods has cognitive complexity 166 (threshold 15). Drivers by points: if/else 36 (101 pts), match/switch 19 (59 pts), boolean chains 6 (nesting depth added 105). To reduce it, split the body into named stages: move each independent step or branch into 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/tools/clippy/clippy_lints/src/methods/mod.rs"},"region":{"startLine":5437}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbce1e13519b3d4340ce2e470b070a8be01b83fa639ac1a8bccf0f700c688b60"}},{"ruleId":"D2","level":"warning","message":{"text":"InterpCx::eval_simd_intrinsic (cognitive 165): InterpCx::eval_simd_intrinsic has cognitive complexity 165 (threshold 15). Drivers by points: if/else 33 (76 pts), match/switch 20 (51 pts), loops 18 (36 pts), boolean chains 2 (nesting depth added 92). 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":"compiler/rustc_const_eval/src/interpret/intrinsics/simd.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bf90c5572d0228eedffc2880d0eff96f088848afb86c9e344dd330f0574f37e"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_ty_utils::layout::layout_of_uncached (cognitive 156): rustc_ty_utils::layout::layout_of_uncached has cognitive complexity 156 (threshold 15). Drivers by points: if/else 45 (120 pts), match/switch 10 (26 pts), boolean chains 7, loops 1 (3 pts) (nesting depth added 93). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ty_utils/src/layout.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a043b1a13a025f8818cb75ba3e35d6e36632ca10bf5faa782a1374e90594614"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_builtin_macros::format::make_format_args (cognitive 155): rustc_builtin_macros::format::make_format_args has cognitive complexity 155 (threshold 15). Drivers by points: if/else 42 (92 pts), match/switch 17 (48 pts), loops 4 (9 pts), boolean chains 6 (nesting depth added 86). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_builtin_macros/src/format.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"313226a620f4e7dc3c69ab0247ce523153a9637d9687b4ac83b59d6fe1fa0bfe"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_interface::interface::parse_check_cfg (cognitive 154): rustc_interface::interface::parse_check_cfg has cognitive complexity 154 (threshold 15). Drivers by points: if/else 45 (127 pts), loops 4 (10 pts), boolean chains 9, match/switch 3 (8 pts) (nesting depth added 93). 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":"compiler/rustc_interface/src/interface.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"adef042f263988b02f46d808c78ef98465816c360ab2ff685a35dd5ec1ce64d4"}},{"ruleId":"D2","level":"warning","message":{"text":"Config::parse_inner (cognitive 153): Config::parse_inner has cognitive complexity 153 (threshold 15). Drivers by points: if/else 70 (104 pts), boolean chains 24, match/switch 14 (22 pts), loops 2 (3 pts) (nesting depth added 43). To reduce it, split the body into named stages: move each independent step or branch into 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/bootstrap/src/core/config/config.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c599b4934a667585573c0c5b6edca22b24810ba761df00c69c49166bac6ca70"}},{"ruleId":"D2","level":"warning","message":{"text":"MirBorrowckCtxt::report_mutability_error (cognitive 151): MirBorrowckCtxt::report_mutability_error has cognitive complexity 151 (threshold 15). Drivers by points: if/else 47 (110 pts), match/switch 10 (27 pts), loops 2 (10 pts), boolean chains 4 (nesting depth added 88). 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":"compiler/rustc_borrowck/src/diagnostics/mutability_errors.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b7706cdad1cdb2fedfc5375e97e590c0fa964845d83d6fc7161a1566bdd3088"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeErrCtxt::note_and_explain_type_err (cognitive 151): TypeErrCtxt::note_and_explain_type_err has cognitive complexity 151 (threshold 15). Drivers by points: if/else 32 (105 pts), match/switch 9 (20 pts), boolean chains 14, loops 3 (12 pts) (nesting depth added 93). 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":"compiler/rustc_trait_selection/src/error_reporting/infer/note_and_explain.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"455333ec3882be71da303c9b61033a93f47b3ec73bec28ce2fda63f29972576f"}},{"ruleId":"D2","level":"warning","message":{"text":"LateResolutionVisitor::smart_resolve_context_dependent_help (cognitive 150): LateResolutionVisitor::smart_resolve_context_dependent_help has cognitive complexity 150 (threshold 15). Drivers by points: if/else 43 (114 pts), boolean chains 16, match/switch 8 (14 pts), loops 1 (6 pts) (nesting depth added 82). 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":"compiler/rustc_resolve/src/late/diagnostics.rs"},"region":{"startLine":2488}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dc89c507435d6a0e370b6addb739bd5bb65f4c0496b676da4cf7292428dcec2"}},{"ruleId":"D2","level":"warning","message":{"text":"Ty::hir_fmt (cognitive 149): Ty::hir_fmt has cognitive complexity 149 (threshold 15). Drivers by points: if/else 46 (102 pts), match/switch 21 (42 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 78). To reduce it, split the body into named stages: move each independent step or branch into 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/tools/rust-analyzer/crates/hir-ide/src/display.rs"},"region":{"startLine":1281}}}],"partialFingerprints":{"codehealthFindingId/v1":"945b418160f5472552e88dd08c55896e98e228ad9c862e30674cc923af89413f"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeErrCtxt::report_similar_impl_candidates (cognitive 146): TypeErrCtxt::report_similar_impl_candidates has cognitive complexity 146 (threshold 15). Drivers by points: if/else 69 (117 pts), boolean chains 15, loops 4 (12 pts), match/switch 1 (2 pts) (nesting depth added 57). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/error_reporting/traits/fulfillment_errors.rs"},"region":{"startLine":2309}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7a4af98190132b32dd50e0c3a81f3822030c6cb973361404570840ce051bae1"}},{"ruleId":"D2","level":"warning","message":{"text":"Evaluator::eval_rvalue (cognitive 146): Evaluator::eval_rvalue has cognitive complexity 146 (threshold 15). Drivers by points: match/switch 25 (68 pts), if/else 24 (66 pts), loops 4 (12 pts) (nesting depth added 93). 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/tools/rust-analyzer/crates/hir-ty/src/mir/eval.rs"},"region":{"startLine":1029}}}],"partialFingerprints":{"codehealthFindingId/v1":"28ad773a4675c98cf9bc284fb086d637d89c08f79befd0336d141c6bf0977adf"}},{"ruleId":"D2","level":"warning","message":{"text":"MirBorrowckCtxt::explain_captures (cognitive 145): MirBorrowckCtxt::explain_captures has cognitive complexity 145 (threshold 15). Drivers by points: if/else 33 (96 pts), match/switch 7 (26 pts), boolean chains 12, loops 2 (11 pts) (nesting depth added 91). 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":"compiler/rustc_borrowck/src/diagnostics/mod.rs"},"region":{"startLine":1225}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1d09d65d1ea4e3f80e50069e195530640b18331beaac525f9d183895980811e"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::suggest_deref_or_ref (cognitive 145): FnCtxt::suggest_deref_or_ref has cognitive complexity 145 (threshold 15). Drivers by points: if/else 43 (114 pts), boolean chains 15, match/switch 6 (13 pts), loops 1 (3 pts) (nesting depth added 80). 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":"compiler/rustc_hir_typeck/src/fn_ctxt/suggestions.rs"},"region":{"startLine":2966}}}],"partialFingerprints":{"codehealthFindingId/v1":"129adf9d422bbad925fe86624c3505a8cee0bfc92038b063469135f3f8bcc9a4"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_codegen_ssa::debuginfo::type_names::push_debuginfo_type_name (cognitive 142): rustc_codegen_ssa::debuginfo::type_names::push_debuginfo_type_name has cognitive complexity 142 (threshold 15). Drivers by points: if/else 64 (113 pts), match/switch 7 (13 pts), loops 4 (12 pts), boolean chains 4 (nesting depth added 63). Of this number, 138 points are the body\u0027s own statements and 4 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/debuginfo/type_names.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"32df240853c3c366f0fa80750a1bd0d304a287dc43b692ca01288ca48ad2638f"}},{"ruleId":"D2","level":"warning","message":{"text":"Resolver::resolve_path_with_ribs (cognitive 142): Resolver::resolve_path_with_ribs has cognitive complexity 142 (threshold 15). Drivers by points: if/else 42 (104 pts), boolean chains 18, match/switch 5 (15 pts), loops 2 (5 pts) (nesting depth added 75). Of this number, 140 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/ident.rs"},"region":{"startLine":1878}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bdb6a3eee64b0f350016f557c54e8f26d17aaa764868d3afded584e0f8853de"}},{"ruleId":"D2","level":"warning","message":{"text":"LoweringContext::lower_inline_asm (cognitive 139): LoweringContext::lower_inline_asm has cognitive complexity 139 (threshold 15). Drivers by points: if/else 37 (93 pts), match/switch 9 (27 pts), loops 6 (11 pts), boolean chains 8 (nesting depth added 79). 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":"compiler/rustc_ast_lowering/src/asm.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"e91ef36371d9f27aec23f858c6a04231e3ef922765629a4cd409ba023f523d6c"}},{"ruleId":"D2","level":"warning","message":{"text":"tidy::style::check_file_style (cognitive 137): tidy::style::check_file_style has cognitive complexity 137 (threshold 15). Drivers by points: if/else 47 (85 pts), boolean chains 46, match/switch 2 (5 pts), loops 1 (nesting depth added 41). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/tidy/src/style.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd08d5719c7028af55b5a9ff325d13ea54cfcaf14b77d5c2f6415f747aafc920"}},{"ruleId":"D2","level":"warning","message":{"text":"Builder::cargo (cognitive 136): Builder::cargo has cognitive complexity 136 (threshold 15). Drivers by points: if/else 80 (100 pts), boolean chains 19, match/switch 13 (14 pts), loops 3 (nesting depth added 21). 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/bootstrap/src/core/builder/cargo.rs"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"b57472cf59217d4c73b0ff6e1a08409f616f021b451d0838a782497bd49cab0f"}},{"ruleId":"D2","level":"warning","message":{"text":"rust_analyzer::config::patch_old_style::patch_json_for_outdated_configs (cognitive 135): rust_analyzer::config::patch_old_style::patch_json_for_outdated_configs has cognitive complexity 135 (threshold 15). Drivers by points: loops 41 (82 pts), match/switch 43 (44 pts), if/else 6 (7 pts), boolean chains 2 (nesting depth added 43). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/config/patch_old_style.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"3921887d6498f7e522021da765818cf635c7d856f1828aace469bc5cccafd357"}},{"ruleId":"D2","level":"warning","message":{"text":"AnalysisStats::run_inference (cognitive 134): AnalysisStats::run_inference has cognitive complexity 134 (threshold 15). Drivers by points: if/else 43 (115 pts), match/switch 4 (8 pts), boolean chains 6, loops 3 (5 pts) (nesting depth added 78). To reduce it, split the body into named stages: move each independent step or branch into 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/tools/rust-analyzer/crates/rust-analyzer/src/cli/analysis_stats.rs"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"074aa8ca9f1fedaabf13dbb4da48293620dd98296c703d4940292e8b96ef0dfb"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::label_fn_like (cognitive 133): FnCtxt::label_fn_like has cognitive complexity 133 (threshold 15). Drivers by points: if/else 30 (78 pts), loops 7 (28 pts), match/switch 6 (17 pts), boolean chains 10 (nesting depth added 80). 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":"compiler/rustc_hir_typeck/src/fn_ctxt/checks.rs"},"region":{"startLine":1665}}}],"partialFingerprints":{"codehealthFindingId/v1":"85b7c216b82e5baa794bd3020cd72d6be9b76009fb002b88cc04b1788e0bdf7a"}},{"ruleId":"D2","level":"warning","message":{"text":"mbe::expander::matcher::match_loop_inner (cognitive 133): mbe::expander::matcher::match_loop_inner has cognitive complexity 133 (threshold 15). Drivers by points: if/else 44 (115 pts), match/switch 4 (11 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 79). 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/tools/rust-analyzer/crates/mbe/src/expander/matcher.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"1631ee4dabcc9cce8d4696229f22abb7878c848587d86af86cfce60db0c11e6f"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_completion::completions::expr::complete_expr_path (cognitive 131): ide_completion::completions::expr::complete_expr_path has cognitive complexity 131 (threshold 15). Drivers by points: if/else 38 (87 pts), match/switch 13 (32 pts), boolean chains 6, loops 2 (6 pts) (nesting depth added 72). To reduce it, split the body into named stages: move each independent step or branch into 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/tools/rust-analyzer/crates/ide-completion/src/completions/expr.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"c27deeb8f21a004d091d21fb2d4b26310b6b6bd5d18e16c4c49bb2e0df61ba17"}},{"ruleId":"D2","level":"warning","message":{"text":"Resolver::validate_res_from_ribs (cognitive 130): Resolver::validate_res_from_ribs has cognitive complexity 130 (threshold 15). Drivers by points: if/else 28 (90 pts), match/switch 8 (28 pts), boolean chains 6, loops 3 (6 pts) (nesting depth added 85). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/ident.rs"},"region":{"startLine":1476}}}],"partialFingerprints":{"codehealthFindingId/v1":"e84442eb317d24964a800784e48b484235314a00d30d66a0cc99782e4b9a9e4a"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeErrCtxt::maybe_report_ambiguity (cognitive 127): TypeErrCtxt::maybe_report_ambiguity has cognitive complexity 127 (threshold 15). Drivers by points: if/else 49 (105 pts), match/switch 5 (13 pts), boolean chains 7, loops 2 (nesting depth added 64). 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":"compiler/rustc_trait_selection/src/error_reporting/traits/ambiguity.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbcb72cd5c903305a5beb863d17799d83a85f4682cd1cc44767e7c332e142ea8"}},{"ruleId":"D2","level":"warning","message":{"text":"libm::math::pow::pow (cognitive 127): libm::math::pow::pow has cognitive complexity 127 (threshold 15). Drivers by points: if/else 63 (122 pts), boolean chains 5 (nesting depth added 59). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/compiler-builtins/libm/src/math/pow.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"055cc836698918fa595b15c528f820a31d5a7992824ee1a0b8dc344e9f1ca5c5"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::doc::check_doc (cognitive 127): clippy_lints::doc::check_doc has cognitive complexity 127 (threshold 15). Drivers by points: if/else 33 (85 pts), boolean chains 22, match/switch 4 (14 pts), loops 2 (6 pts) (nesting depth added 66). 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/tools/clippy/clippy_lints/src/doc/mod.rs"},"region":{"startLine":1133}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbe1e3f9d3bbb2375f8a3dd10172aa0ff5a6b987b37fa1720d6508b32fe52bf4"}},{"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/tools/miri/src/bin/miri.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"176de429d5f341bb84437755088f805b16202549836482b227ab51f8a58e1de6"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeErrCtxt::note_type_err (cognitive 126): TypeErrCtxt::note_type_err has cognitive complexity 126 (threshold 15). Drivers by points: if/else 43 (77 pts), match/switch 10 (21 pts), boolean chains 20, loops 4 (8 pts) (nesting depth added 49). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/error_reporting/infer/mod.rs"},"region":{"startLine":1465}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a85cb102b31fb717d77d93207ebdd9477453e76df061d9786e77b5bfdd8258f"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_resolve::diagnostics::impls::show_candidates (cognitive 125): rustc_resolve::diagnostics::impls::show_candidates has cognitive complexity 125 (threshold 15). Drivers by points: if/else 51 (96 pts), loops 8 (19 pts), match/switch 2 (6 pts), boolean chains 4 (nesting depth added 60). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/diagnostics/impls.rs"},"region":{"startLine":4142}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee5eb193b9e9f21ed3be6c18be0a0c3cd751c44286794b0bf530ae8fe9384dde"}},{"ruleId":"D2","level":"warning","message":{"text":"rustdoc::passes::collect_intra_doc_links::resolution_failure (cognitive 125): rustdoc::passes::collect_intra_doc_links::resolution_failure has cognitive complexity 125 (threshold 15). Drivers by points: if/else 33 (98 pts), match/switch 4 (12 pts), loops 3 (8 pts), boolean chains 7 (nesting depth added 78). 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/librustdoc/passes/collect_intra_doc_links.rs"},"region":{"startLine":2106}}}],"partialFingerprints":{"codehealthFindingId/v1":"5063e37ad595dab4440471bb38644d24cdfaeda7e69b4c6a6bc39bdd8e968619"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::handle_unsatisfied_predicates (cognitive 124): FnCtxt::handle_unsatisfied_predicates has cognitive complexity 124 (threshold 15). Drivers by points: if/else 34 (69 pts), match/switch 12 (27 pts), loops 10 (17 pts), boolean chains 11 (nesting depth added 57). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/method/suggest.rs"},"region":{"startLine":1705}}}],"partialFingerprints":{"codehealthFindingId/v1":"b004c6bed00bc90b7c393ac6d28cd12f7ed4f2c54628fc8931c3e3b52c59d214"}},{"ruleId":"D2","level":"warning","message":{"text":"Builder::codegen_inline_asm (cognitive 122): Builder::codegen_inline_asm has cognitive complexity 122 (threshold 15). Drivers by points: if/else 34 (76 pts), match/switch 10 (30 pts), loops 9 (11 pts), boolean chains 5 (nesting depth added 64). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_gcc/src/asm.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e5109cc4808863cd64242b1b975854b723d9bb06a1a913f8097fa932450010c"}},{"ruleId":"D2","level":"warning","message":{"text":"rustfmt_nightly::lists::write_list (cognitive 122): rustfmt_nightly::lists::write_list has cognitive complexity 122 (threshold 15). Drivers by points: if/else 41 (93 pts), boolean chains 19, loops 2 (6 pts), match/switch 2 (4 pts) (nesting depth added 58). 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/tools/rustfmt/src/lists.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"698e19bc6be5c4fc95bf54d1f58f1943ff903dc79888db58074d079e0935adc1"}},{"ruleId":"D2","level":"warning","message":{"text":"Builder::codegen_intrinsic_call (cognitive 121): Builder::codegen_intrinsic_call has cognitive complexity 121 (threshold 15). Drivers by points: if/else 47 (85 pts), match/switch 13 (27 pts), boolean chains 7, loops 1 (2 pts) (nesting depth added 53). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/intrinsic.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"03b8c342e17a7eb7f5bed35675fa9b5b13ba3b28d02faf8a8e89273122847d0a"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_codegen_ssa::back::link::link_natively (cognitive 121): rustc_codegen_ssa::back::link::link_natively has cognitive complexity 121 (threshold 15). Drivers by points: if/else 39 (85 pts), loops 8 (16 pts), boolean chains 11, match/switch 6 (9 pts) (nesting depth added 57). 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":"compiler/rustc_codegen_ssa/src/back/link.rs"},"region":{"startLine":1232}}}],"partialFingerprints":{"codehealthFindingId/v1":"3417fbfe0ef95a6de7aa87eaaf2f0c7f02402ffaca6a8b66dd0cf0d62aea690a"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCallDiagCtxt::labels_and_suggestion_text (cognitive 120): FnCallDiagCtxt::labels_and_suggestion_text has cognitive complexity 120 (threshold 15). Drivers by points: if/else 30 (77 pts), match/switch 11 (31 pts), loops 3 (7 pts), boolean chains 5 (nesting depth added 71). Of this number, 119 points are the body\u0027s own statements and 1 belongs 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":"compiler/rustc_hir_typeck/src/fn_ctxt/checks.rs"},"region":{"startLine":2654}}}],"partialFingerprints":{"codehealthFindingId/v1":"2282ed7e6e09a1493f2db0e166d751911f9a79549e763fecf4e5416bc57b61ac"}},{"ruleId":"D2","level":"warning","message":{"text":"ExprCollector::maybe_collect_expr (cognitive 119): ExprCollector::maybe_collect_expr has cognitive complexity 119 (threshold 15). Drivers by points: if/else 51 (93 pts), match/switch 9 (19 pts), loops 2 (6 pts), boolean chains 1 (nesting depth added 56). To reduce it, split the body into named stages: move each independent step or branch into 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/tools/rust-analyzer/crates/hir-def/src/expr_store/lower.rs"},"region":{"startLine":1417}}}],"partialFingerprints":{"codehealthFindingId/v1":"32b556d830ace2aab7faf60d7e4530d5b88ed4136ac8652f0d8a8c16b81c7cce"}},{"ruleId":"D2","level":"warning","message":{"text":"Builder::codegen_inline_asm (cognitive 117): Builder::codegen_inline_asm has cognitive complexity 117 (threshold 15). Drivers by points: if/else 36 (77 pts), match/switch 9 (20 pts), loops 8 (18 pts), boolean chains 2 (nesting depth added 62). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/asm.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"86c8ee41c33ac90e5c7b4d72f6b2b32522576bac7a8915fcca4bd23a92bb7d5e"}},{"ruleId":"D2","level":"warning","message":{"text":"rustdoc::html::render::print_item::item_trait (cognitive 117): rustdoc::html::render::print_item::item_trait has cognitive complexity 117 (threshold 15). Drivers by points: if/else 40 (66 pts), loops 17 (39 pts), boolean chains 9, match/switch 1 (3 pts) (nesting depth added 50). Of this number, 110 points are the body\u0027s own statements and 7 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/librustdoc/html/render/print_item.rs"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"9361a54af9e388ea28c2112d7e07b096e15bc115bf7ec6074422fdd92cdfdbc9"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeChecker::visit_rvalue (cognitive 116): TypeChecker::visit_rvalue has cognitive complexity 116 (threshold 15). Drivers by points: if/else 22 (61 pts), match/switch 17 (49 pts), boolean chains 6 (nesting depth added 71). 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":"compiler/rustc_borrowck/src/type_check/mod.rs"},"region":{"startLine":992}}}],"partialFingerprints":{"codehealthFindingId/v1":"837e000d3c88d657b3cad22b1ac1f2cd7327bdafae712254b28378f41671fe2d"}},{"ruleId":"D2","level":"warning","message":{"text":"Options::from_matches (cognitive 116): Options::from_matches has cognitive complexity 116 (threshold 15). Drivers by points: if/else 41 (65 pts), match/switch 20 (34 pts), boolean chains 10, loops 4 (7 pts) (nesting depth added 41). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/config.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"c17c6f6637b84ad1c34d620e9e5062fbecb85317cb738f1469bc61706d49b406"}},{"ruleId":"D2","level":"warning","message":{"text":"LateResolutionVisitor::try_lookup_name_relaxed (cognitive 114): LateResolutionVisitor::try_lookup_name_relaxed has cognitive complexity 114 (threshold 15). Drivers by points: if/else 33 (84 pts), match/switch 6 (16 pts), boolean chains 12, loops 1 (2 pts) (nesting depth added 62). 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":"compiler/rustc_resolve/src/late/diagnostics.rs"},"region":{"startLine":1022}}}],"partialFingerprints":{"codehealthFindingId/v1":"89704d4ed0940661474ec69af517eb23429aeb9d275a200ee036099135118963"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionCx::codegen_call_terminator (cognitive 113): FunctionCx::codegen_call_terminator has cognitive complexity 113 (threshold 15). Drivers by points: if/else 33 (71 pts), match/switch 12 (29 pts), loops 3 (7 pts), boolean chains 6 (nesting depth added 59). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/mir/block.rs"},"region":{"startLine":955}}}],"partialFingerprints":{"codehealthFindingId/v1":"08be42da0f36d1a179056b79d9b0bdd8f05b013cf18838550cfbea387951adc8"}},{"ruleId":"D2","level":"warning","message":{"text":"Resolver::into_struct_error (cognitive 112): Resolver::into_struct_error has cognitive complexity 112 (threshold 15). Drivers by points: if/else 20 (55 pts), match/switch 13 (30 pts), loops 6 (18 pts), boolean chains 9 (nesting depth added 64). 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":"compiler/rustc_resolve/src/diagnostics/impls.rs"},"region":{"startLine":799}}}],"partialFingerprints":{"codehealthFindingId/v1":"496d73a7faf64ad45b95f1be67dc5b1fcfbd096d4299fee737071e33d6c6938a"}},{"ruleId":"D2","level":"warning","message":{"text":"Install::merge (cognitive 112): Install::merge has cognitive complexity 112 (threshold 15). Drivers by points: if/else 49 (105 pts), match/switch 7 (nesting depth added 56). 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/bootstrap/src/core/config/toml/install.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"846b537ee9b33c420451ed0fef1731415ec2b83142c4aa2438a3805a2a1c3278"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_builtin_macros::asm::expand_preparsed_asm (cognitive 109): rustc_builtin_macros::asm::expand_preparsed_asm has cognitive complexity 109 (threshold 15). Drivers by points: if/else 28 (73 pts), match/switch 8 (26 pts), loops 6 (9 pts), boolean chains 1 (nesting depth added 66). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_builtin_macros/src/asm.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cb7f1a3c22b961a4579c2990deaf79fb31019352586a85eac2cc766a05d07aa"}},{"ruleId":"D2","level":"warning","message":{"text":"GlobalState::handle_event (cognitive 109): GlobalState::handle_event has cognitive complexity 109 (threshold 15). Drivers by points: if/else 31 (60 pts), boolean chains 19, loops 8 (16 pts), match/switch 6 (14 pts) (nesting depth added 45). To reduce it, split the body into named stages: move each independent step or branch into 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/tools/rust-analyzer/crates/rust-analyzer/src/main_loop.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ebce23fdf059e26da6c14dcdf6ae698be940aecfca108479ca36ea71986aea3"}},{"ruleId":"D2","level":"warning","message":{"text":"AnnotateSnippetEmitter::emit_messages_default (cognitive 107): AnnotateSnippetEmitter::emit_messages_default has cognitive complexity 107 (threshold 15). Drivers by points: if/else 40 (92 pts), loops 5 (9 pts), boolean chains 4, match/switch 1 (2 pts) (nesting depth added 57). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_errors/src/annotate_snippet_emitter_writer.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"26b70812735f1d9a93e5c962fa210239377f537f7f304b0301f495039a65a25c"}},{"ruleId":"D2","level":"warning","message":{"text":"EncodeContext::encode_def_ids (cognitive 107): EncodeContext::encode_def_ids has cognitive complexity 107 (threshold 15). Drivers by points: if/else 40 (79 pts), match/switch 3 (12 pts), loops 6 (10 pts), boolean chains 6 (nesting depth added 52). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_metadata/src/rmeta/encoder.rs"},"region":{"startLine":1486}}}],"partialFingerprints":{"codehealthFindingId/v1":"1202f1a22ff0d008ba33505f2867948c335b04265121feb01994d0f49c8fed75"}},{"ruleId":"D2","level":"warning","message":{"text":"bootstrap::core::sanity::check (cognitive 107): bootstrap::core::sanity::check has cognitive complexity 107 (threshold 15). Drivers by points: if/else 32 (68 pts), boolean chains 20, loops 5 (13 pts), match/switch 3 (6 pts) (nesting depth added 47). 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/bootstrap/src/core/sanity.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6c21cc7d651fef9b8fc7e22884a39332061643076e45a6562e00e2abf179f3b"}},{"ruleId":"D2","level":"warning","message":{"text":"BorrowExplanation::add_explanation_to_diagnostic (cognitive 105): BorrowExplanation::add_explanation_to_diagnostic has cognitive complexity 105 (threshold 15). Drivers by points: if/else 34 (83 pts), match/switch 6 (10 pts), boolean chains 8, loops 1 (4 pts) (nesting depth added 56). 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":"compiler/rustc_borrowck/src/diagnostics/explain_borrow.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"b08df04ba61c5c719ffe26dcacf802136f05647d173c307a0e9dd579c6afdf64"}},{"ruleId":"D2","level":"warning","message":{"text":"TestCx::check_expected_errors (cognitive 105): TestCx::check_expected_errors has cognitive complexity 105 (threshold 15). Drivers by points: if/else 30 (72 pts), loops 8 (21 pts), boolean chains 8, match/switch 2 (4 pts) (nesting depth added 57). 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/tools/compiletest/src/runtest.rs"},"region":{"startLine":693}}}],"partialFingerprints":{"codehealthFindingId/v1":"da6c085d763f8c585fb0b2e2e1d86c8e96f61aaa47ef4593c4ba8c836eb1f427"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::check_expr_struct_fields (cognitive 103): FnCtxt::check_expr_struct_fields has cognitive complexity 103 (threshold 15). Drivers by points: if/else 43 (87 pts), boolean chains 7, match/switch 3 (6 pts), loops 2 (3 pts) (nesting depth added 48). 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":"compiler/rustc_hir_typeck/src/expr.rs"},"region":{"startLine":1920}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c3bf75455975e83e6eb8d6372ef27799534c88692225da0b9d004453ac4c168"}},{"ruleId":"D2","level":"warning","message":{"text":"ide::syntax_highlighting::traverse (cognitive 103): ide::syntax_highlighting::traverse has cognitive complexity 103 (threshold 15). Drivers by points: if/else 17 (50 pts), match/switch 16 (49 pts), boolean chains 3, loops 1 (nesting depth added 66). To reduce it, split the body into named stages: move each independent step or branch into 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/tools/rust-analyzer/crates/ide/src/syntax_highlighting.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"7445ded8167b52217b6251a39f4076ea87a572ce42bb4f69b07ee730704ccdc9"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_db::syntax_helpers::format_string::lex_format_specifiers (cognitive 101): ide_db::syntax_helpers::format_string::lex_format_specifiers has cognitive complexity 101 (threshold 15). Drivers by points: if/else 18 (62 pts), match/switch 7 (29 pts), boolean chains 7, loops 3 (nesting depth added 66). Of this number, 92 points are the body\u0027s own statements and 9 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":"src/tools/rust-analyzer/crates/ide-db/src/syntax_helpers/format_string.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b094e2cbf40db2c839e1e1d8582bae882e11d3546611dff7ece74d47c0f231f"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_codegen_cranelift::intrinsics::codegen_regular_intrinsic_call (cognitive 100): rustc_codegen_cranelift::intrinsics::codegen_regular_intrinsic_call has cognitive complexity 100 (threshold 15). Drivers by points: if/else 36 (61 pts), match/switch 24 (38 pts), boolean chains 1 (nesting depth added 39). 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":"compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"d948e278b9ff8c6d10f0e8ec7ecce621e1dc6110a7f4e79b0f9b64718c21fbb9"}},{"ruleId":"D2","level":"warning","message":{"text":"ExprCollector::lower_inline_asm (cognitive 100): ExprCollector::lower_inline_asm has cognitive complexity 100 (threshold 15). Drivers by points: if/else 27 (65 pts), match/switch 10 (28 pts), loops 3 (5 pts), boolean chains 2 (nesting depth added 58). To reduce it, split the body into named stages: move each independent step or branch into 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/tools/rust-analyzer/crates/hir-def/src/expr_store/lower/asm.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b39e06f0fa9c42f1420d26ad8c7ec98cff37d9ccacc64d539a927a19d02948a"}},{"ruleId":"D2","level":"warning","message":{"text":"SourceAnalyzer::resolve_path (cognitive 99): SourceAnalyzer::resolve_path has cognitive complexity 99 (threshold 15). Drivers by points: if/else 30 (67 pts), match/switch 8 (23 pts), loops 1 (6 pts), boolean chains 3 (nesting depth added 57). 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/tools/rust-analyzer/crates/hir/src/source_analyzer.rs"},"region":{"startLine":1158}}}],"partialFingerprints":{"codehealthFindingId/v1":"a166171ef4dafa65c93065bea510486da3c256c8ed25b577cdc36646bf07917d"}},{"ruleId":"D2","level":"warning","message":{"text":"FindUsages::search (cognitive 98): FindUsages::search has cognitive complexity 98 (threshold 15). Drivers by points: if/else 16 (44 pts), loops 12 (36 pts), match/switch 8 (17 pts), boolean chains 1 (nesting depth added 61). To reduce it, split the body into named stages: move each independent step or branch into 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/tools/rust-analyzer/crates/ide-db/src/search.rs"},"region":{"startLine":929}}}],"partialFingerprints":{"codehealthFindingId/v1":"181be9f0abf07e06c105039e5a4b59ccef0fb1fc19f9a8e6514f02296307eec4"}},{"ruleId":"D2","level":"warning","message":{"text":"FindUsages::short_associated_function_fast_search::collect_possible_aliases (cognitive 97): FindUsages::short_associated_function_fast_search::collect_possible_aliases has cognitive complexity 97 (threshold 15). Drivers by points: if/else 15 (73 pts), loops 6 (20 pts), boolean chains 4 (nesting depth added 72). To reduce it, split the body into named stages: move each independent step or branch into 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/tools/rust-analyzer/crates/ide-db/src/search.rs"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec388c293763ea61e30c6dcf656da692ccdd91c25be993c6d5d816665c91925a"}},{"ruleId":"D2","level":"warning","message":{"text":"rustfmt_nightly::items::rewrite_fn_base (cognitive 97): rustfmt_nightly::items::rewrite_fn_base has cognitive complexity 97 (threshold 15). Drivers by points: if/else 41 (77 pts), boolean chains 13, match/switch 4 (7 pts) (nesting depth added 39). To reduce it, split the body into named stages: move each independent step or branch into 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/tools/rustfmt/src/items.rs"},"region":{"startLine":2483}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c7b581cdaf1e03c2c47c1e3fc7615d362462e098574dfb9a300fe6e92b9bd7c"}},{"ruleId":"D2","level":"warning","message":{"text":"main.register_type_impls (cognitive 97): main.register_type_impls has cognitive complexity 97 (threshold 15). Drivers by points: if/else 21 (43 pts), ternaries 13 (42 pts), loops 4 (8 pts), boolean chains 4 (nesting depth added 55). Of this number, 35 points are the body\u0027s own statements and 62 belong to 5 function literals 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":"src/librustdoc/html/static/js/main.js"},"region":{"startLine":941}}}],"partialFingerprints":{"codehealthFindingId/v1":"302cd97e23ac8b2df10c8b7a4481b467664dd8dba136d0cbf25b494ee8959d18"}},{"ruleId":"D2","level":"warning","message":{"text":"Pgo::merge (cognitive 96): Pgo::merge has cognitive complexity 96 (threshold 15). Drivers by points: if/else 42 (90 pts), match/switch 6 (nesting depth added 48). 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/bootstrap/src/core/config/toml/pgo.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"08a82f5ba6e0bc9c000c406244fa692a243e737e32e0cb5d3ef3dc93c49a525c"}},{"ruleId":"D2","level":"warning","message":{"text":"InferenceContext::infer_expr_inner (cognitive 96): InferenceContext::infer_expr_inner has cognitive complexity 96 (threshold 15). Drivers by points: if/else 27 (50 pts), match/switch 15 (33 pts), loops 4 (10 pts), boolean chains 3 (nesting depth added 47). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/infer/expr.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"218c022d2f34776f8da887668cb38bd8780bfb0c7106c7b233dfc0ddc9ba1b41"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_codegen_ssa::back::write::start_executing_work (cognitive 94): rustc_codegen_ssa::back::write::start_executing_work has cognitive complexity 94 (threshold 15). Drivers by points: if/else 33 (64 pts), match/switch 7 (17 pts), loops 4 (8 pts), boolean chains 5 (nesting depth added 45). Of this number, 93 points are the body\u0027s own statements and 1 belongs 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":"compiler/rustc_codegen_ssa/src/back/write.rs"},"region":{"startLine":1204}}}],"partialFingerprints":{"codehealthFindingId/v1":"6427634fcbda861217465704b1d0520564c8065c27862f61ec9361174f86f997"}},{"ruleId":"D2","level":"warning","message":{"text":"loadDatabase::makeSearchTreeFromBase64::makeBranchesFromBinaryData (cognitive 93): loadDatabase::makeSearchTreeFromBase64::makeBranchesFromBinaryData has cognitive complexity 93 (threshold 15). Drivers by points: if/else 32 (55 pts), loops 6 (22 pts), boolean chains 8, ternaries 4 (8 pts) (nesting depth added 43). To reduce it, split the body into named stages: move each independent step or branch into 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/librustdoc/html/static/js/stringdex.js"},"region":{"startLine":3045}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cb1bc4083d14754b59a3237f8b67f23f6ff99b8c054ed8716fd154f142c500d"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_codegen_cranelift::base::codegen_fn_body (cognitive 92): rustc_codegen_cranelift::base::codegen_fn_body has cognitive complexity 92 (threshold 15). Drivers by points: if/else 27 (69 pts), loops 4 (11 pts), match/switch 3 (9 pts), boolean chains 3 (nesting depth added 55). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/src/base.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"57cc99ff66eab50500bc7f71e9e50aede46e16cb8ef2a57d0bcd27efb5637d20"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::instantiate_value_path (cognitive 92): FnCtxt::instantiate_value_path has cognitive complexity 92 (threshold 15). Drivers by points: if/else 33 (65 pts), match/switch 9 (18 pts), loops 2 (5 pts), boolean chains 4 (nesting depth added 44). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/fn_ctxt/_impl.rs"},"region":{"startLine":1037}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c0983b2cc932d11c58edd181969e08e01ecca99927f44d886e8ba6ec5c15a83"}},{"ruleId":"D2","level":"warning","message":{"text":"stdarch_gen_hexagon::hvx::parse_header (cognitive 92): stdarch_gen_hexagon::hvx::parse_header has cognitive complexity 92 (threshold 15). Drivers by points: if/else 18 (68 pts), loops 4 (12 pts), match/switch 1 (9 pts), boolean chains 3 (nesting depth added 66). 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":"library/stdarch/crates/stdarch-gen-hexagon/src/hvx.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a14727fe837b5998e8dfc18eac4a9ad111b5d55cd96051fd7163d1c48b0cf56"}},{"ruleId":"D2","level":"warning","message":{"text":"ide::hover::render::definition (cognitive 92): ide::hover::render::definition has cognitive complexity 92 (threshold 15). Drivers by points: if/else 34 (64 pts), match/switch 16 (28 pts) (nesting depth added 42). To reduce it, split the body into named stages: move each independent step or branch into 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/tools/rust-analyzer/crates/ide/src/hover/render.rs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"f72c2faf75d8eccb89b4182f35abc01f51f54e624968f41fcdc87b8ecb15efe8"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutCalculator::layout_of_univariant_biased (cognitive 91): LayoutCalculator::layout_of_univariant_biased has cognitive complexity 91 (threshold 15). Drivers by points: if/else 31 (54 pts), match/switch 10 (29 pts), boolean chains 7, loops 1 (nesting depth added 42). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_abi/src/layout.rs"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdcd67672bc2cbf913fb8ba2926e780abd149ef427833644d0c674bc4903df8d"}},{"ruleId":"D2","level":"warning","message":{"text":"libm::math::rem_pio2_large::rem_pio2_large (cognitive 91): libm::math::rem_pio2_large::rem_pio2_large has cognitive complexity 91 (threshold 15). Drivers by points: loops 20 (44 pts), if/else 20 (41 pts), match/switch 2 (5 pts), boolean chains 1 (nesting depth added 48). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/compiler-builtins/libm/src/math/rem_pio2_large.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"52cc867a1afa75c448200797175e04b9d02b44fd4cd8c5aee49ad67285611c05"}},{"ruleId":"D2","level":"warning","message":{"text":"SerializedSearchIndex::union (cognitive 91): SerializedSearchIndex::union has cognitive complexity 91 (threshold 15). Drivers by points: loops 19 (62 pts), if/else 10 (16 pts), match/switch 4 (13 pts) (nesting depth added 58). Of this number, 71 points are the body\u0027s own statements and 20 belong to one function item inside it that branches. To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/render/search_index.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"97c4a68fa7108d9bc3345a15d3cb8bee5d5dab144debd41e5a90b1bf74f2a7f5"}},{"ruleId":"D2","level":"warning","message":{"text":"Dereferencing::check_expr (cognitive 91): Dereferencing::check_expr has cognitive complexity 91 (threshold 15). Drivers by points: if/else 32 (61 pts), boolean chains 17, match/switch 4 (10 pts), loops 1 (3 pts) (nesting depth added 37). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/dereference.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d88c8be80da8150666ef7df38807da027ec6cbca9a67c3cada010e950fb1675"}},{"ruleId":"D2","level":"warning","message":{"text":"MacroExpander::expand_invoc (cognitive 89): MacroExpander::expand_invoc has cognitive complexity 89 (threshold 15). Drivers by points: if/else 21 (51 pts), match/switch 14 (36 pts), boolean chains 2 (nesting depth added 52). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_expand/src/expand.rs"},"region":{"startLine":699}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e4ae89de98fc489606578818a2f74eb84c769faaf79013e152b9c6adb6453f4"}},{"ruleId":"D2","level":"warning","message":{"text":"stdarch_gen_loongarch::gen_bind_body (cognitive 89): stdarch_gen_loongarch::gen_bind_body has cognitive complexity 89 (threshold 15). Drivers by points: if/else 40 (47 pts), match/switch 16 (22 pts), boolean chains 20 (nesting depth added 13). 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":"library/stdarch/crates/stdarch-gen-loongarch/src/main.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"66895fd8273fd856c2b1261d4b085555e5bc473652e7e5ebc659ee595e949442"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_ast_passes::feature_gate::check_crate (cognitive 88): rustc_ast_passes::feature_gate::check_crate has cognitive complexity 88 (threshold 15). Drivers by points: loops 52 (54 pts), if/else 13 (25 pts), boolean chains 9 (nesting depth added 14). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ast_passes/src/feature_gate.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"7be141450291be63ac6b4d46835a64b2daaaaf5ad4fbce9f29a38d74af941764"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_hir_analysis::check::check::check_item_type (cognitive 88): rustc_hir_analysis::check::check::check_item_type has cognitive complexity 88 (threshold 15). Drivers by points: if/else 21 (52 pts), match/switch 12 (28 pts), loops 4 (7 pts), boolean chains 1 (nesting depth added 50). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/check/check.rs"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"695f54dff7898ef1a3284785aea20d4523b161c654640d2d67c968e36f6ad8fa"}},{"ruleId":"D2","level":"warning","message":{"text":"FulfillProcessor::process_obligation (cognitive 88): FulfillProcessor::process_obligation has cognitive complexity 88 (threshold 15). Drivers by points: if/else 19 (44 pts), match/switch 14 (41 pts), boolean chains 3 (nesting depth added 52). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/traits/fulfill.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa2eeed8ec018bccb0f97c9fc5fe0c393c77ad3864c8a8af112b6e0d22d4a57e"}},{"ruleId":"D2","level":"warning","message":{"text":"Extended::run (cognitive 88): Extended::run has cognitive complexity 88 (threshold 15). Drivers by points: if/else 56 (74 pts), boolean chains 7, loops 5 (7 pts) (nesting depth added 20). Of this number, 83 points are the body\u0027s own statements and 5 belong to one function item inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/build_steps/dist.rs"},"region":{"startLine":1902}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2be19fadec2226372e7a87aecdc1d558f172fb7eb02df3fd569e194899db19d"}},{"ruleId":"D2","level":"warning","message":{"text":"Printer::print_expr_in (cognitive 88): Printer::print_expr_in has cognitive complexity 88 (threshold 15). Drivers by points: if/else 23 (50 pts), loops 7 (19 pts), match/switch 10 (19 pts) (nesting depth added 48). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/expr_store/pretty.rs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0f36b554afbc59c1329db515b22c45733ed75a75afd619dfce3aa89874d8e8f"}},{"ruleId":"D2","level":"warning","message":{"text":"CompileTimeMachine::call_intrinsic (cognitive 87): CompileTimeMachine::call_intrinsic has cognitive complexity 87 (threshold 15). Drivers by points: if/else 40 (68 pts), match/switch 8 (15 pts), boolean chains 4 (nesting depth added 35). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_const_eval/src/const_eval/machine.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"c44edb731a0b914193725412ed79cfeba665b810a4017ab8befaeee1c95eb59c"}},{"ruleId":"D2","level":"warning","message":{"text":"CastCheck::report_cast_error (cognitive 87): CastCheck::report_cast_error has cognitive complexity 87 (threshold 15). Drivers by points: if/else 33 (69 pts), match/switch 5 (10 pts), boolean chains 8 (nesting depth added 41). 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":"compiler/rustc_hir_typeck/src/cast.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8cad3f507b5a0eda9fdacf59916c6731ac806ee232bc623b00d243a7af782bf"}},{"ruleId":"D2","level":"warning","message":{"text":"LowerIntrinsics::run_pass (cognitive 87): LowerIntrinsics::run_pass has cognitive complexity 87 (threshold 15). Drivers by points: if/else 18 (61 pts), match/switch 6 (23 pts), boolean chains 2, loops 1 (nesting depth added 60). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/lower_intrinsics.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dff373ec761c9fa646da3e5ea1048d87b78247bb5b681008669d9c95f1d1682"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeErrCtxt::note_error_origin (cognitive 87): TypeErrCtxt::note_error_origin has cognitive complexity 87 (threshold 15). Drivers by points: if/else 31 (63 pts), match/switch 5 (13 pts), boolean chains 7, loops 1 (4 pts) (nesting depth added 43). 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":"compiler/rustc_trait_selection/src/error_reporting/infer/mod.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"feaa288bb0d76680af498731d7d13bf0f07c072110f1793ba2aad3f897bd91a9"}},{"ruleId":"D2","level":"warning","message":{"text":"hir_ide::display::render_const_scalar_inner (cognitive 87): hir_ide::display::render_const_scalar_inner has cognitive complexity 87 (threshold 15). Drivers by points: if/else 27 (67 pts), match/switch 6 (13 pts), loops 3 (7 pts) (nesting depth added 51). 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/tools/rust-analyzer/crates/hir-ide/src/display.rs"},"region":{"startLine":819}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c59b22483a443891a4cd81d8f5335feeeb99d294a70d15638056c234bd3aa37"}},{"ruleId":"D2","level":"warning","message":{"text":"initSearch::execQuery::unifyFunctionTypes (cognitive 87): initSearch::execQuery::unifyFunctionTypes has cognitive complexity 87 (threshold 15). Drivers by points: if/else 22 (50 pts), ternaries 7 (19 pts), boolean chains 12, loops 4 (6 pts) (nesting depth added 42). To reduce it, split the body into named stages: move each independent step or branch into 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/librustdoc/html/static/js/search.js"},"region":{"startLine":3020}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2a2524a117eb21c017f1d3de99c166891028b86d1e0e4a6fcba0785b4c331e1"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::note_type_is_not_clone (cognitive 86): FnCtxt::note_type_is_not_clone has cognitive complexity 86 (threshold 15). Drivers by points: if/else 18 (55 pts), match/switch 3 (15 pts), loops 2 (10 pts), boolean chains 6 (nesting depth added 57). 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":"compiler/rustc_hir_typeck/src/fn_ctxt/suggestions.rs"},"region":{"startLine":2036}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e4704de61546d96af9e73543499acdfa6424aea53127da421947489b17092a2"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeChecker::visit_projection_elem (cognitive 86): TypeChecker::visit_projection_elem has cognitive complexity 86 (threshold 15). Drivers by points: if/else 29 (73 pts), match/switch 6 (11 pts), boolean chains 2 (nesting depth added 49). 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":"compiler/rustc_mir_transform/src/validate.rs"},"region":{"startLine":668}}}],"partialFingerprints":{"codehealthFindingId/v1":"25aa68fcad647a64876e89ad2e27c8582cfc5d80b18186001ee0f62f76994979"}},{"ruleId":"D2","level":"warning","message":{"text":"Lexer::next_token_from_cursor (cognitive 86): Lexer::next_token_from_cursor has cognitive complexity 86 (threshold 15). Drivers by points: if/else 28 (77 pts), match/switch 2 (5 pts), boolean chains 3, loops 1 (nesting depth added 52). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/lexer/mod.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"9584272d91e832e34e5bb4ea64b565f6259b6e9497cf15bb07bd215eebf8fdbf"}},{"ruleId":"D2","level":"warning","message":{"text":"SelectionContext::winnow_candidates (cognitive 86): SelectionContext::winnow_candidates has cognitive complexity 86 (threshold 15). Drivers by points: if/else 45 (68 pts), loops 5 (8 pts), match/switch 5 (7 pts), boolean chains 3 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/traits/select/mod.rs"},"region":{"startLine":1721}}}],"partialFingerprints":{"codehealthFindingId/v1":"2858ed313bc0cc1a071a3f9127f745e2c456756b9db7a2d0e0b810466f5b5edf"}},{"ruleId":"D2","level":"warning","message":{"text":"hir_expand::cfg_process::macro_input_callback (cognitive 86): hir_expand::cfg_process::macro_input_callback has cognitive complexity 86 (threshold 15). Drivers by points: if/else 23 (61 pts), match/switch 4 (11 pts), loops 3 (10 pts), boolean chains 4 (nesting depth added 52). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-expand/src/cfg_process.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"79dc6cc36b2baf5f4c982bbd818506ddf64b92d6803ea43595560533078678f7"}},{"ruleId":"D2","level":"warning","message":{"text":"MSVCEnumSyntheticProvider.update (cognitive 86): MSVCEnumSyntheticProvider.update has cognitive complexity 86 (threshold 15). Drivers by points: if/else 23 (80 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 59). 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/etc/lldb_providers.py"},"region":{"startLine":863}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c921a4b0b2bbca5fb6ba20b86b567e3ce9adb48020f0c1f04932d7681762967"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeErrCtxt::report_fulfillment_errors (cognitive 85): TypeErrCtxt::report_fulfillment_errors has cognitive complexity 85 (threshold 15). Drivers by points: if/else 11 (44 pts), loops 7 (17 pts), match/switch 6 (17 pts), boolean chains 7 (nesting depth added 54). 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":"compiler/rustc_trait_selection/src/error_reporting/traits/mod.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"57d2e14771f4d89a359f297024c5271f13aae886443275ee6b9972d6666096a5"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_ty_utils::instance::resolve_associated_item (cognitive 85): rustc_ty_utils::instance::resolve_associated_item has cognitive complexity 85 (threshold 15). Drivers by points: if/else 28 (53 pts), match/switch 10 (27 pts), boolean chains 5 (nesting depth added 42). 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":"compiler/rustc_ty_utils/src/instance.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"684a105d914cbaf465bd814b3ef6592d7714bde6384e9e59ee2561f0b3c030e4"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_builtin_macros::format::report_missing_placeholders (cognitive 83): rustc_builtin_macros::format::report_missing_placeholders has cognitive complexity 83 (threshold 15). Drivers by points: if/else 33 (68 pts), match/switch 3 (7 pts), loops 2 (5 pts), boolean chains 3 (nesting depth added 42). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_builtin_macros/src/format.rs"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"8caaa491ca67ccbd28877c7e798306437151cdc8014e734a09f4f04ac1877912"}},{"ruleId":"D2","level":"warning","message":{"text":"UselessConversion::check_expr (cognitive 83): UselessConversion::check_expr has cognitive complexity 83 (threshold 15). Drivers by points: if/else 25 (63 pts), boolean chains 15, match/switch 2 (5 pts) (nesting depth added 41). 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/tools/clippy/clippy_lints/src/useless_conversion.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0463de57fe9a2b914f55d18fa60478bddbbc1b2910c69cd414535b6b2885db9"}},{"ruleId":"D2","level":"warning","message":{"text":"PrefixTrie.prefixMatches (cognitive 83): PrefixTrie.prefixMatches has cognitive complexity 83 (threshold 15). Drivers by points: if/else 16 (50 pts), loops 9 (21 pts), boolean chains 6, ternaries 2 (6 pts) (nesting depth added 50). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/stringdex.js"},"region":{"startLine":2031}}}],"partialFingerprints":{"codehealthFindingId/v1":"c85e3bf3218ec80b098cc0e5a5b0df076eb5e2d0a58491a8198fadfab33a09c0"}},{"ruleId":"D2","level":"warning","message":{"text":"loadDatabase::prefixMatches (cognitive 83): loadDatabase::prefixMatches has cognitive complexity 83 (threshold 15). Drivers by points: if/else 16 (50 pts), loops 9 (21 pts), boolean chains 6, ternaries 2 (6 pts) (nesting depth added 50). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/stringdex.js"},"region":{"startLine":2031}}}],"partialFingerprints":{"codehealthFindingId/v1":"c703d428c9ee55d674a6f8fab77cedca253045e58b148721c4289225c8431f4f"}},{"ruleId":"D2","level":"warning","message":{"text":"PrettyPrinter::pretty_print_opaque_impl_type (cognitive 82): PrettyPrinter::pretty_print_opaque_impl_type has cognitive complexity 82 (threshold 15). Drivers by points: if/else 22 (46 pts), loops 7 (14 pts), match/switch 4 (13 pts), boolean chains 9 (nesting depth added 40). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/ty/print/pretty.rs"},"region":{"startLine":1050}}}],"partialFingerprints":{"codehealthFindingId/v1":"7db540733c630000086ae1b76a56dc058a43b344ae8a4426e6f1edacb6c18a81"}},{"ruleId":"D2","level":"warning","message":{"text":"SelectionContext::evaluate_predicate_recursively (cognitive 82): SelectionContext::evaluate_predicate_recursively has cognitive complexity 82 (threshold 15). Drivers by points: if/else 21 (45 pts), match/switch 13 (25 pts), boolean chains 7, loops 2 (5 pts) (nesting depth added 39). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/traits/select/mod.rs"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdebc435c6e46aa792a4668705e64514f1a64d1baacdac3d193bd367049c6426"}},{"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/tools/miri/src/shims/foreign_items.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"46cec3ebcc0d961a266acd769befbfcf7d19f9b75374371281976103f20ac5c6"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::suggest_deref_ref_or_into (cognitive 81): FnCtxt::suggest_deref_ref_or_into has cognitive complexity 81 (threshold 15). Drivers by points: if/else 27 (48 pts), match/switch 3 (14 pts), loops 3 (12 pts), boolean chains 7 (nesting depth added 41). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/fn_ctxt/suggestions.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffdb3cade2329b409a32683827c9aad0e4e086820d696c33cec5bbd5d2c1db02"}},{"ruleId":"D2","level":"warning","message":{"text":"AnalysisStats::run (cognitive 81): AnalysisStats::run has cognitive complexity 81 (threshold 15). Drivers by points: if/else 25 (35 pts), match/switch 6 (22 pts), loops 8 (21 pts), boolean chains 3 (nesting depth added 39). To reduce it, split the body into named stages: move each independent step or branch into 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/tools/rust-analyzer/crates/rust-analyzer/src/cli/analysis_stats.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a7b341103a9c33945eed1c2491ec3617d50789cccd78932d3f4c2513c842b98"}},{"ruleId":"D2","level":"warning","message":{"text":"MirBorrowckCtxt::was_captured_by_trait_object (cognitive 80): MirBorrowckCtxt::was_captured_by_trait_object has cognitive complexity 80 (threshold 15). Drivers by points: if/else 16 (56 pts), match/switch 4 (22 pts), boolean chains 1, loops 1 (nesting depth added 58). 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":"compiler/rustc_borrowck/src/diagnostics/explain_borrow.rs"},"region":{"startLine":821}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa1aedbf18429b02ff9936b8e4a776103cf12f4a11ef26901d618c711af74c92"}},{"ruleId":"D2","level":"warning","message":{"text":"ValidityVisitor::check_safe_pointer (cognitive 80): ValidityVisitor::check_safe_pointer has cognitive complexity 80 (threshold 15). Drivers by points: if/else 24 (59 pts), match/switch 4 (17 pts), boolean chains 4 (nesting depth added 48). 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":"compiler/rustc_const_eval/src/interpret/validity.rs"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"1069cce96a326d4a3390c7b3fdd98a5f2911e63c07e673e6920ff898a4be4ba6"}},{"ruleId":"D2","level":"warning","message":{"text":"Builder::expr_into_dest (cognitive 80): Builder::expr_into_dest has cognitive complexity 80 (threshold 15). Drivers by points: if/else 26 (47 pts), match/switch 13 (30 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 39). Of this number, 75 points are the body\u0027s own statements and 5 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":"compiler/rustc_mir_build/src/builder/expr/into.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"5637f16b8f11b66f654aa2e113c4731dbbc1dcd03e8cc818db3b51fd3af803d8"}},{"ruleId":"D2","level":"warning","message":{"text":"libm::math::exp2m1f::cr_exp2m1f (cognitive 80): libm::math::exp2m1f::cr_exp2m1f has cognitive complexity 80 (threshold 15). Drivers by points: if/else 27 (79 pts), boolean chains 1 (nesting depth added 52). 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":"library/compiler-builtins/libm/src/math/exp2m1f.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ce61b9451f8bbc34fda8d04ed9b0d7080ad7ada42182cde6e7c7bdb3de080f7"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_assists::handlers::inline_call::inline (cognitive 80): ide_assists::handlers::inline_call::inline has cognitive complexity 80 (threshold 15). Drivers by points: if/else 25 (46 pts), match/switch 8 (15 pts), boolean chains 10, loops 6 (9 pts) (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/inline_call.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1bba3e57c9bccba56fef572770b7e2143e75f0b67eeed2b601aa9b795bf3982"}},{"ruleId":"D2","level":"warning","message":{"text":"initSearch::execQuery::innerRunTypeQuery::unpackPostingsList (cognitive 80): initSearch::execQuery::innerRunTypeQuery::unpackPostingsList has cognitive complexity 80 (threshold 15). Drivers by points: if/else 15 (42 pts), loops 7 (19 pts), boolean chains 12, ternaries 1 (7 pts) (nesting depth added 45). 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/librustdoc/html/static/js/search.js"},"region":{"startLine":4302}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5fd6fc4ae968ceae67f6d71222f7b3d0f8452dcf2900a4a316650958c57b946"}},{"ruleId":"D2","level":"warning","message":{"text":"Resolver::lookup_import_candidates_from_module (cognitive 79): Resolver::lookup_import_candidates_from_module has cognitive complexity 79 (threshold 15). Drivers by points: if/else 23 (54 pts), boolean chains 20, match/switch 2 (4 pts), loops 1 (nesting depth added 33). 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":"compiler/rustc_resolve/src/diagnostics/impls.rs"},"region":{"startLine":1669}}}],"partialFingerprints":{"codehealthFindingId/v1":"db1e5ec04a5b2f7c53271f7182b7f781b1ea9977faa5fb08390556142fede191"}},{"ruleId":"D2","level":"warning","message":{"text":"Assemble::run (cognitive 79): Assemble::run has cognitive complexity 79 (threshold 15). Drivers by points: if/else 30 (56 pts), loops 6 (14 pts), boolean chains 7, match/switch 1 (2 pts) (nesting depth added 35). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/build_steps/compile.rs"},"region":{"startLine":2122}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe1f23a8df248d930458f23c322264a9b74714a3023026d93a848a3c4228b386"}},{"ruleId":"D2","level":"warning","message":{"text":"InferenceContext::resolve_variant (cognitive 79): InferenceContext::resolve_variant has cognitive complexity 79 (threshold 15). Drivers by points: if/else 28 (60 pts), match/switch 7 (13 pts), boolean chains 4, loops 1 (2 pts) (nesting depth added 39). Of this number, 77 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. 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/tools/rust-analyzer/crates/hir-ty/src/infer.rs"},"region":{"startLine":2256}}}],"partialFingerprints":{"codehealthFindingId/v1":"9be547a725b84401b275e51c8b1a71a8b766f22b289ff30af43cf564d6b9a960"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionCx::codegen_intrinsic_call (cognitive 78): FunctionCx::codegen_intrinsic_call has cognitive complexity 78 (threshold 15). Drivers by points: if/else 31 (49 pts), match/switch 10 (20 pts), boolean chains 9 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/mir/intrinsic.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"21d1a15ea89753ef69d6f15ac55cab54ba50bd421e2a8d1c16d49e469ea640df"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_expand::mbe::macro_rules::check_matcher_core (cognitive 78): rustc_expand::mbe::macro_rules::check_matcher_core has cognitive complexity 78 (threshold 15). Drivers by points: if/else 15 (47 pts), loops 4 (14 pts), match/switch 3 (13 pts), boolean chains 4 (nesting depth added 52). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_expand/src/mbe/macro_rules.rs"},"region":{"startLine":1451}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddf18156668e7fd9b4d4e43e3df314b1a4260c6009e0d4efcda861d5fd50d9cb"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::annotate_loop_expected_due_to_inference (cognitive 78): FnCtxt::annotate_loop_expected_due_to_inference has cognitive complexity 78 (threshold 15). Drivers by points: if/else 13 (49 pts), match/switch 3 (16 pts), loops 3 (8 pts), boolean chains 5 (nesting depth added 54). 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":"compiler/rustc_hir_typeck/src/demand.rs"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3c4708572e5db912a175f8055b21e1872ae44c8af7dc744e021156d1908fd35"}},{"ruleId":"D2","level":"warning","message":{"text":"Resolver::report_path_resolution_error (cognitive 78): Resolver::report_path_resolution_error has cognitive complexity 78 (threshold 15). Drivers by points: if/else 43 (63 pts), match/switch 5 (10 pts), boolean chains 5 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/diagnostics/impls.rs"},"region":{"startLine":3105}}}],"partialFingerprints":{"codehealthFindingId/v1":"449fa2311df80417a7a45aafa985e3f06af7b73cc070838827517a725c499b16"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_mir_transform::lint_tail_expr_drop_order::run_lint (cognitive 78): rustc_mir_transform::lint_tail_expr_drop_order::run_lint has cognitive complexity 78 (threshold 15). Drivers by points: if/else 26 (60 pts), loops 8 (15 pts), boolean chains 3 (nesting depth added 41). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/lint_tail_expr_drop_order.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"96ae1b105f7ea01dc656890a5f2c990ad612eb7afaecc0c6a8ba3f9f2972e1c8"}},{"ruleId":"D2","level":"warning","message":{"text":"SemanticsImpl::descend_into_macros_impl (cognitive 78): SemanticsImpl::descend_into_macros_impl has cognitive complexity 78 (threshold 15). Drivers by points: if/else 10 (41 pts), match/switch 6 (20 pts), loops 5 (16 pts), boolean chains 1 (nesting depth added 56). To reduce it, split the body into named stages: move each independent step or branch into 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/tools/rust-analyzer/crates/hir/src/semantics.rs"},"region":{"startLine":1237}}}],"partialFingerprints":{"codehealthFindingId/v1":"1af1791cdb38ecce6742d8ba2badbebed6fad43c0821b36f1ddfcd94ce1a9f80"}},{"ruleId":"D2","level":"warning","message":{"text":"MirLowerCtx::pattern_match_inner (cognitive 78): MirLowerCtx::pattern_match_inner has cognitive complexity 78 (threshold 15). Drivers by points: if/else 26 (60 pts), match/switch 5 (10 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 42). 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/tools/rust-analyzer/crates/hir-ty/src/mir/lower/pattern_matching.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"198b5d96ece4c70efd1788381e0a6dd05c29493d555306e55a5df441ac4db548"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_driver_impl::print_crate_info (cognitive 77): rustc_driver_impl::print_crate_info has cognitive complexity 77 (threshold 15). Drivers by points: if/else 16 (40 pts), loops 9 (25 pts), match/switch 3 (8 pts), boolean chains 4 (nesting depth added 45). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_driver_impl/src/lib.rs"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a553d31d81923bc64379971feb303566c8cf208da0f37d7728a5c75a53e212e"}},{"ruleId":"D2","level":"warning","message":{"text":"Llvm::run (cognitive 77): Llvm::run has cognitive complexity 77 (threshold 15). Drivers by points: if/else 51 (58 pts), boolean chains 12, match/switch 5 (6 pts), loops 1 (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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/bootstrap/src/core/build_steps/llvm.rs"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf5f53cdbd7cd632c6be17abe11302ebcad2489cdde20117651263f6c1b13c2f"}},{"ruleId":"D2","level":"warning","message":{"text":"rustdoc::doctest::make::parse_source (cognitive 77): rustdoc::doctest::make::parse_source has cognitive complexity 77 (threshold 15). Drivers by points: if/else 20 (47 pts), boolean chains 11, match/switch 6 (10 pts), loops 3 (9 pts) (nesting depth added 37). Of this number, 61 points are the body\u0027s own statements and 16 belong to 3 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/doctest/make.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fba2e00a4a0d5c43ea780618f4f92b83ebaf1b21e76b689aba36541b1040586"}},{"ruleId":"D2","level":"warning","message":{"text":"hir_ide::display::write_bounds_like_dyn_trait (cognitive 77): hir_ide::display::write_bounds_like_dyn_trait has cognitive complexity 77 (threshold 15). Drivers by points: if/else 26 (69 pts), boolean chains 5, match/switch 1 (2 pts), loops 1 (nesting depth added 44). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ide/src/display.rs"},"region":{"startLine":2099}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a33ffce2f099b88a6f26627853d28ccd03507fdcf64da771fd9bf7725c46df8"}},{"ruleId":"D2","level":"warning","message":{"text":"DocSearch.execQuery::unifyFunctionTypes (cognitive 77): DocSearch.execQuery::unifyFunctionTypes has cognitive complexity 77 (threshold 15). Drivers by points: if/else 22 (50 pts), ternaries 5 (11 pts), boolean chains 10, loops 4 (6 pts) (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 7 other methods here (DocSearch.execQuery::buildHrefAndPath, DocSearch.execQuery::formatDisplayTypeSignature::writeFn, DocSearch.execQuery::transformResults, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":3020}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd0c9917a42059d9f94ccb851a1cde978f1b45ca65dbd3ed5c72820885c0cdb4"}},{"ruleId":"D2","level":"warning","message":{"text":"search.initSearch::unifyFunctionTypes (cognitive 77): search.initSearch::unifyFunctionTypes has cognitive complexity 77 (threshold 15). Drivers by points: if/else 22 (50 pts), ternaries 5 (11 pts), boolean chains 10, loops 4 (6 pts) (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 15 other methods here (search.initSearch, search.initSearch::getItemsBefore, search.initSearch::getNextElem, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 16 times rather than 16 independent problems. Splitting this body alone leaves the other 15 exactly as they are. Where these are variations on one operation, the change that clears all 16 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":3020}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d6b25c74b98d34dc38670704c11d39daefba17ae8e53c8b6af1bb75a217ee1e"}},{"ruleId":"D2","level":"warning","message":{"text":"Resolver::report_privacy_error (cognitive 76): Resolver::report_privacy_error has cognitive complexity 76 (threshold 15). Drivers by points: if/else 30 (53 pts), boolean chains 11, loops 4 (7 pts), match/switch 2 (5 pts) (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/diagnostics/impls.rs"},"region":{"startLine":2724}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae567d0f45908b029915faaae6143318f475c63e56191d1439fad6d49c1a37b2"}},{"ruleId":"D2","level":"warning","message":{"text":"libm::math::powf::powf (cognitive 76): libm::math::powf::powf has cognitive complexity 76 (threshold 15). Drivers by points: if/else 46 (70 pts), boolean chains 4, match/switch 1 (2 pts) (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/compiler-builtins/libm/src/math/powf.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"bed0a93883b2fdb93d03ef8a8191ed4aa087c3e235c425abcfd461ccd5acc029"}},{"ruleId":"D2","level":"warning","message":{"text":"TestCx::make_compile_args (cognitive 76): TestCx::make_compile_args has cognitive complexity 76 (threshold 15). Drivers by points: if/else 37 (54 pts), boolean chains 12, match/switch 7 (10 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/compiletest/src/runtest.rs"},"region":{"startLine":1671}}}],"partialFingerprints":{"codehealthFindingId/v1":"209210a775ddf4c5f19cb92a93f19994b689ae7932bba8232310aca290bb7781"}},{"ruleId":"D2","level":"warning","message":{"text":"ide::folding_ranges::folding_ranges (cognitive 76): ide::folding_ranges::folding_ranges has cognitive complexity 76 (threshold 15). Drivers by points: if/else 18 (65 pts), match/switch 3 (8 pts), boolean chains 2, loops 1 (nesting depth added 52). 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/tools/rust-analyzer/crates/ide/src/folding_ranges.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"02ebcfbda61924f3af2c7272399345b5fe4ce3a0870da6c735c4598dd0ed468f"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_codegen_cranelift::base::codegen_stmt (cognitive 75): rustc_codegen_cranelift::base::codegen_stmt has cognitive complexity 75 (threshold 15). Drivers by points: if/else 19 (42 pts), match/switch 11 (30 pts), loops 1 (3 pts) (nesting depth added 44). 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":"compiler/rustc_codegen_cranelift/src/base.rs"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"c55dc66a3771487c406ae5b4bfdf1e3345dca936925a8fe1267832a0ea2296a6"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_codegen_ssa::codegen_attrs::process_builtin_attrs (cognitive 75): rustc_codegen_ssa::codegen_attrs::process_builtin_attrs has cognitive complexity 75 (threshold 15). Drivers by points: if/else 25 (62 pts), match/switch 3 (8 pts), boolean chains 4, loops 1 (nesting depth added 42). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/codegen_attrs.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"64d96629b0f42e0352b90d368894599d36a12dc2832667eb6c39d7f53e1da9fa"}},{"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":"src/tools/miri/cargo-miri/src/phases.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ceae778947fa2888c28c8791bfc3431d5110ca3e7d16949264fe999bf109548"}},{"ruleId":"D2","level":"warning","message":{"text":"DiagnosticsCollector::collect_impl (cognitive 75): DiagnosticsCollector::collect_impl has cognitive complexity 75 (threshold 15). Drivers by points: if/else 16 (45 pts), match/switch 4 (12 pts), loops 3 (11 pts), boolean chains 7 (nesting depth added 45). 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/tools/rust-analyzer/crates/hir/src/diagnostics.rs"},"region":{"startLine":953}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9b043f7b85b4db9aabbdd2ff1d47a6fce323d08327cff08a799c486e7a94ce9"}},{"ruleId":"D2","level":"warning","message":{"text":"DefCollector::resolve_macros (cognitive 75): DefCollector::resolve_macros has cognitive complexity 75 (threshold 15). Drivers by points: if/else 18 (56 pts), match/switch 6 (11 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 46). 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/tools/rust-analyzer/crates/hir-def/src/nameres/collector.rs"},"region":{"startLine":1306}}}],"partialFingerprints":{"codehealthFindingId/v1":"a683c9e95f3131607bc83c9c75f1dd27f0f69238d2fe58452b9e97a7b34de2e6"}},{"ruleId":"D2","level":"warning","message":{"text":"hir_ty::layout::layout_of_ty_query (cognitive 75): hir_ty::layout::layout_of_ty_query has cognitive complexity 75 (threshold 15). Drivers by points: if/else 20 (54 pts), match/switch 9 (21 pts) (nesting depth added 46). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/layout.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"e50d2e6079de526091dce5905a43d0ab0b68f24ca6c4d7d1f682d3cdcf7a713b"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_ast_lowering::format::expand_format_args (cognitive 74): rustc_ast_lowering::format::expand_format_args has cognitive complexity 74 (threshold 15). Drivers by points: if/else 25 (59 pts), match/switch 3 (8 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 41). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ast_lowering/src/format.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"44c19bec678d0b41b23d9002c1d4d59156839c6055e82bc354c9fab87becdfd0"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_hir_analysis::check::check::opaque_type_cycle_error (cognitive 74): rustc_hir_analysis::check::check::opaque_type_cycle_error has cognitive complexity 74 (threshold 15). Drivers by points: if/else 12 (37 pts), loops 7 (31 pts), match/switch 1 (4 pts), boolean chains 2 (nesting depth added 52). 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":"compiler/rustc_hir_analysis/src/check/check.rs"},"region":{"startLine":2190}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5bc1545b7e5d14177cfe5e2e7404bf98ce476e99445810e6fa53761b3f44b24"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::suggest_compatible_variants (cognitive 74): FnCtxt::suggest_compatible_variants has cognitive complexity 74 (threshold 15). Drivers by points: if/else 18 (49 pts), match/switch 4 (13 pts), boolean chains 7, loops 2 (5 pts) (nesting depth added 43). 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":"compiler/rustc_hir_typeck/src/fn_ctxt/suggestions.rs"},"region":{"startLine":2621}}}],"partialFingerprints":{"codehealthFindingId/v1":"621792909774b86c3d102f41dcd1f2d86075c445cfc49b8464e8788a5e136f80"}},{"ruleId":"D2","level":"warning","message":{"text":"InlineAsmCtxt::check_asm (cognitive 74): InlineAsmCtxt::check_asm has cognitive complexity 74 (threshold 15). Drivers by points: if/else 15 (47 pts), match/switch 6 (22 pts), loops 2 (5 pts) (nesting depth added 51). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/inline_asm.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"6407091d3a1f4042a1e21809a4f681e474e085b327af6ce70aa32a637e904d71"}},{"ruleId":"D2","level":"warning","message":{"text":"bootstrap::core::config::toml::rust::check_incompatible_options_for_ci_rustc (cognitive 74): bootstrap::core::config::toml::rust::check_incompatible_options_for_ci_rustc has cognitive complexity 74 (threshold 15). Drivers by points: if/else 44 (73 pts), boolean chains 1 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/config/toml/rust.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d2598e8748be17c94aa44d7a482720a701cfedddc6b020e50355077af92850c"}},{"ruleId":"D2","level":"warning","message":{"text":"hir_expand::fixup::fixup_syntax (cognitive 74): hir_expand::fixup::fixup_syntax has cognitive complexity 74 (threshold 15). Drivers by points: if/else 18 (50 pts), match/switch 5 (17 pts), boolean chains 6, loops 1 (nesting depth added 44). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-expand/src/fixup.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"61f6fb7949f2d14b6b9fadf4e1e85fd9df621ddccf57f39acbec7eda52495830"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_middle::ty::diagnostics::suggest_constraining_type_params (cognitive 73): rustc_middle::ty::diagnostics::suggest_constraining_type_params has cognitive complexity 73 (threshold 15). Drivers by points: if/else 34 (58 pts), match/switch 6 (12 pts), boolean chains 2, loops 1 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/ty/diagnostics.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"f47290aaf676ba3ee28d2f4cd1b485f8af323f0f3d7eeb8387e7979f9f8e18bf"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_fn_front_matter (cognitive 73): Parser::parse_fn_front_matter has cognitive complexity 73 (threshold 15). Drivers by points: if/else 20 (39 pts), match/switch 8 (29 pts), boolean chains 5 (nesting depth added 40). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/function.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7bef57ad2eb515f800a22f654e0ce7d0eb906d11ef6374cc446205326b48076"}},{"ruleId":"D2","level":"warning","message":{"text":"rustdoc::doctest::run_test (cognitive 73): rustdoc::doctest::run_test has cognitive complexity 73 (threshold 15). Drivers by points: if/else 37 (55 pts), match/switch 6 (9 pts), boolean chains 7, loops 1 (2 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/doctest.rs"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"bed6812059002e2d912050baa64e41708f60318eea7d3839fbe6b6d5f630c289"}},{"ruleId":"D2","level":"warning","message":{"text":"rustdoc::html::markdown::markdown_links (cognitive 73): rustdoc::html::markdown::markdown_links has cognitive complexity 73 (threshold 15). Drivers by points: if/else 22 (40 pts), loops 11 (15 pts), match/switch 5 (12 pts), boolean chains 6 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/markdown.rs"},"region":{"startLine":1819}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cabbdb368671905ed68d465f9c66a2b0cd286ee2e718c313ac903362923b49b"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::loops::needless_range_loop::check (cognitive 73): clippy_lints::loops::needless_range_loop::check has cognitive complexity 73 (threshold 15). Drivers by points: if/else 26 (61 pts), boolean chains 7, match/switch 1 (5 pts) (nesting depth added 39). 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/tools/clippy/clippy_lints/src/loops/needless_range_loop.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"65a05debfb58aec9b3572aac82963546fcd7bc745493ccb86ed72f9493d9869c"}},{"ruleId":"D2","level":"warning","message":{"text":"Path::hir_fmt (cognitive 73): Path::hir_fmt has cognitive complexity 73 (threshold 15). Drivers by points: if/else 14 (42 pts), match/switch 5 (18 pts), loops 4 (11 pts), boolean chains 2 (nesting depth added 48). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ide/src/display.rs"},"region":{"startLine":2681}}}],"partialFingerprints":{"codehealthFindingId/v1":"2237bb4eff05fb0c5c6ba60383eed4511ffba0f93475a14c97ba229de507fa04"}},{"ruleId":"D2","level":"warning","message":{"text":"State::print_pat (cognitive 72): State::print_pat has cognitive complexity 72 (threshold 15). Drivers by points: if/else 30 (68 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 39). 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":"compiler/rustc_hir_pretty/src/lib.rs"},"region":{"startLine":2029}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddc5bd8ea1bf0f8c26e4e16c1ae061f125e8feb2bd3a80f5e1c3c79decc7197d"}},{"ruleId":"D2","level":"warning","message":{"text":"PrettyPrinter::pretty_print_type (cognitive 72): PrettyPrinter::pretty_print_type has cognitive complexity 72 (threshold 15). Drivers by points: if/else 30 (57 pts), match/switch 6 (14 pts), boolean chains 1 (nesting depth added 35). 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":"compiler/rustc_middle/src/ty/print/pretty.rs"},"region":{"startLine":761}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d8665b3186ebfd3d44282b0e3e2f7b8ec2378e27285a378f64cae2d273ef71d"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::expected_one_of_not_found (cognitive 72): Parser::expected_one_of_not_found has cognitive complexity 72 (threshold 15). Drivers by points: if/else 36 (43 pts), boolean chains 28, loops 1 (nesting depth added 7). Of this number, 67 points are the body\u0027s own statements and 5 belong to one function item inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/diagnostics.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7c969f0cf841a38fedc6b58d8bb24841d2d3ddca2b83c9e67df0db3cf443d46"}},{"ruleId":"D2","level":"warning","message":{"text":"hir_def::expr_store::lower::path::lower_path (cognitive 72): hir_def::expr_store::lower::path::lower_path has cognitive complexity 72 (threshold 15). Drivers by points: if/else 25 (47 pts), match/switch 7 (19 pts), boolean chains 5, loops 1 (nesting depth added 34). Of this number, 71 points are the body\u0027s own statements and 1 belongs 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/tools/rust-analyzer/crates/hir-def/src/expr_store/lower/path.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0ce7106e6355f5e2c469d4af0afb440112b5ba620acfe94056c9e13d2775f83"}},{"ruleId":"D2","level":"warning","message":{"text":"project_model::workspace::cargo_to_crate_graph (cognitive 72): project_model::workspace::cargo_to_crate_graph has cognitive complexity 72 (threshold 15). Drivers by points: if/else 22 (55 pts), loops 7 (12 pts), boolean chains 5 (nesting depth added 38). To reduce it, split the body into named stages: move each independent step or branch into 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/tools/rust-analyzer/crates/project-model/src/workspace.rs"},"region":{"startLine":1264}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7caae7359d35161761699b56079f85815b296f2b7a89b1eef5097f44e4621f6"}},{"ruleId":"D2","level":"warning","message":{"text":"initSearch::execQuery::innerRunNameQuery (cognitive 72): initSearch::execQuery::innerRunNameQuery has cognitive complexity 72 (threshold 15). Drivers by points: if/else 19 (49 pts), loops 8 (17 pts), boolean chains 6 (nesting depth added 39). To reduce it, split the body into named stages: move each independent step or branch into 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/librustdoc/html/static/js/search.js"},"region":{"startLine":3982}}}],"partialFingerprints":{"codehealthFindingId/v1":"f283d2eb0f9b586e84db5cb71de59b4902391921df9459cdb43d34e3ec7a781a"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_mir_build::thir::pattern::check_match::find_fallback_pattern_typo (cognitive 71): rustc_mir_build::thir::pattern::check_match::find_fallback_pattern_typo has cognitive complexity 71 (threshold 15). Drivers by points: if/else 19 (51 pts), loops 4 (13 pts), match/switch 1 (4 pts), boolean chains 3 (nesting depth added 44). 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":"compiler/rustc_mir_build/src/thir/pattern/check_match.rs"},"region":{"startLine":1043}}}],"partialFingerprints":{"codehealthFindingId/v1":"31f279c9bf94b3d71906b89bc13d99d032180b7ec79c0e5ab5bc28c0c9c3bfac"}},{"ruleId":"D2","level":"warning","message":{"text":"ExprCollector::collect_format_args_impl (cognitive 71): ExprCollector::collect_format_args_impl has cognitive complexity 71 (threshold 15). Drivers by points: if/else 23 (56 pts), match/switch 3 (8 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 40). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/expr_store/lower/format_args.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"80ca5481bfa7f6aecdb1fcd812513a6279fa2a7e085662f1074ac1785164e526"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_builtin_macros::asm::validate_asm_args (cognitive 70): rustc_builtin_macros::asm::validate_asm_args has cognitive complexity 70 (threshold 15). Drivers by points: if/else 21 (43 pts), match/switch 5 (13 pts), boolean chains 7, loops 4 (7 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":"compiler/rustc_builtin_macros/src/asm.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"61d212855fd8307068a13d12841f9236ec6add05ea8eda1e619057988c73ba52"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_builtin_macros::autodiff::llvm_enzyme::gen_enzyme_decl (cognitive 70): rustc_builtin_macros::autodiff::llvm_enzyme::gen_enzyme_decl has cognitive complexity 70 (threshold 15). Drivers by points: if/else 30 (50 pts), match/switch 5 (10 pts), loops 4 (8 pts), boolean chains 2 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_builtin_macros/src/autodiff.rs"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"4406da09fbf7e4d39bd34fbb316bc856512c1dc1f48928895f77c23855563a8b"}},{"ruleId":"D2","level":"warning","message":{"text":"CfgChecker::visit_terminator (cognitive 70): CfgChecker::visit_terminator has cognitive complexity 70 (threshold 15). Drivers by points: if/else 23 (58 pts), loops 3 (6 pts), boolean chains 5, match/switch 1 (nesting depth added 38). 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":"compiler/rustc_mir_transform/src/validate.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"35865a4bf0d837fc8932b4e3de087d5efac5341a6bb183aa15ff45a8fcad5e29"}},{"ruleId":"D2","level":"warning","message":{"text":"search.initSearch::getNextElem (cognitive 70): search.initSearch::getNextElem has cognitive complexity 70 (threshold 15). Drivers by points: if/else 32 (61 pts), boolean chains 7, loops 1 (2 pts) (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 15 other methods here (search.initSearch, search.initSearch::getItemsBefore, search.initSearch::createQueryElement, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 16 times rather than 16 independent problems. Splitting this body alone leaves the other 15 exactly as they are. Where these are variations on one operation, the change that clears all 16 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"61c3367a5fb03fbf7e509721f3be75aa4f96ce43203641cf2e246ee322c33a5f"}},{"ruleId":"D2","level":"warning","message":{"text":"PrefixTrie.substringMatches (cognitive 70): PrefixTrie.substringMatches has cognitive complexity 70 (threshold 15). Drivers by points: if/else 14 (45 pts), loops 8 (21 pts), ternaries 1 (3 pts), boolean chains 1 (nesting depth added 46). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/stringdex.js"},"region":{"startLine":1947}}}],"partialFingerprints":{"codehealthFindingId/v1":"1999ae5a6521f4f20e91245b41aefc4fa1c0df731a72b6a366c124d0c754870c"}},{"ruleId":"D2","level":"warning","message":{"text":"loadDatabase::substringMatches (cognitive 70): loadDatabase::substringMatches has cognitive complexity 70 (threshold 15). Drivers by points: if/else 14 (45 pts), loops 8 (21 pts), ternaries 1 (3 pts), boolean chains 1 (nesting depth added 46). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/stringdex.js"},"region":{"startLine":1947}}}],"partialFingerprints":{"codehealthFindingId/v1":"49c531cdf73f90726a604c76ea02e61ed146093ce4ddd3239cd35eea5f68d655"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::note_source_of_type_mismatch_constraint (cognitive 69): FnCtxt::note_source_of_type_mismatch_constraint has cognitive complexity 69 (threshold 15). Drivers by points: if/else 30 (58 pts), loops 2 (4 pts), match/switch 3 (4 pts), boolean chains 3 (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/demand.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"3395ab18f3fd0004889a9cf55a860da6d0df4f39ec010322a5fd831e6ece5f59"}},{"ruleId":"D2","level":"warning","message":{"text":"ProbeContext::consider_probe (cognitive 69): ProbeContext::consider_probe has cognitive complexity 69 (threshold 15). Drivers by points: if/else 20 (45 pts), match/switch 6 (11 pts), loops 3 (7 pts), boolean chains 6 (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/method/probe.rs"},"region":{"startLine":2000}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ddfc42d0b8019f6d164bdd469f01e69708decec4cfc27a531636f160ad19211"}},{"ruleId":"D2","level":"warning","message":{"text":"ide::syntax_highlighting::highlight::highlight_def (cognitive 69): ide::syntax_highlighting::highlight::highlight_def has cognitive complexity 69 (threshold 15). Drivers by points: if/else 22 (42 pts), match/switch 9 (22 pts), boolean chains 5 (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/tools/rust-analyzer/crates/ide/src/syntax_highlighting/highlight.rs"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"54ebf2eaf18a528efb7cb6734e601e7a72652fc4563df681bbdef2ab3b66ab06"}},{"ruleId":"D2","level":"warning","message":{"text":"rust_analyzer::handlers::notification::run_flycheck (cognitive 69): rust_analyzer::handlers::notification::run_flycheck has cognitive complexity 69 (threshold 15). Drivers by points: if/else 11 (36 pts), match/switch 6 (19 pts), loops 3 (11 pts), boolean chains 3 (nesting depth added 46). 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/tools/rust-analyzer/crates/rust-analyzer/src/handlers/notification.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2aee3f47b5b39ffc5ad6acd83c60637b23db72bfa608cff1aa774295b9162fc"}},{"ruleId":"D2","level":"warning","message":{"text":"CommentRewrite::handle_line (cognitive 69): CommentRewrite::handle_line has cognitive complexity 69 (threshold 15). Drivers by points: if/else 29 (48 pts), boolean chains 11, match/switch 4 (10 pts) (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/comment.rs"},"region":{"startLine":713}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c3dd5d316d5164f0d008dc01586dbaa5496fbccd8042e48bd74e795510be8a1"}},{"ruleId":"D2","level":"warning","message":{"text":"MirBorrowckCtxt::point_at_dyn_trait_in_field_def (cognitive 68): MirBorrowckCtxt::point_at_dyn_trait_in_field_def has cognitive complexity 68 (threshold 15). Drivers by points: if/else 23 (50 pts), loops 4 (9 pts), match/switch 4 (9 pts) (nesting depth added 37). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/diagnostics/region_errors.rs"},"region":{"startLine":1002}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee7ab6cfcff6f9ba8b7ed9f38055ff6c3b3dbda81da480e1c44d51f996e3a2d5"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_codegen_cranelift::intrinsics::llvm_x86::codegen_x86_llvm_intrinsic_call (cognitive 68): rustc_codegen_cranelift::intrinsics::llvm_x86::codegen_x86_llvm_intrinsic_call has cognitive complexity 68 (threshold 15). Drivers by points: if/else 16 (26 pts), loops 11 (24 pts), match/switch 9 (18 pts) (nesting depth added 32). 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":"compiler/rustc_codegen_cranelift/src/intrinsics/llvm_x86.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"99cae50d00b393738f003f6cfd6ac106729fb319d00330684a24d077b7bf0fc0"}},{"ruleId":"D2","level":"warning","message":{"text":"UnsafetyVisitor::visit_expr (cognitive 68): UnsafetyVisitor::visit_expr has cognitive complexity 68 (threshold 15). Drivers by points: if/else 21 (48 pts), match/switch 5 (11 pts), boolean chains 5, loops 2 (4 pts) (nesting depth added 35). 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":"compiler/rustc_mir_build/src/check_unsafety.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3992f2891611bb5bf336cef836c571e5c0b82f5fb388ec559808d68f9c93565"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_pat_fields (cognitive 68): Parser::parse_pat_fields has cognitive complexity 68 (threshold 15). Drivers by points: if/else 25 (61 pts), match/switch 2 (4 pts), boolean chains 2, loops 1 (nesting depth added 38). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/pat.rs"},"region":{"startLine":1661}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e7a80c069777c5a3fb42ec623795d15aa9481ad85edc79d61d5bfdfa7c8db57"}},{"ruleId":"D2","level":"warning","message":{"text":"IndexingSlicing::check_expr (cognitive 68): IndexingSlicing::check_expr has cognitive complexity 68 (threshold 15). Drivers by points: if/else 18 (58 pts), boolean chains 7, match/switch 1 (3 pts) (nesting depth added 42). 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/tools/clippy/clippy_lints/src/indexing_slicing.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"eea8e0b560bd65d3c70f81beea02d411669e0872e3c6684223c6eea54537c459"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::methods::manual_inspect::check (cognitive 68): clippy_lints::methods::manual_inspect::check has cognitive complexity 68 (threshold 15). Drivers by points: if/else 15 (34 pts), match/switch 5 (19 pts), boolean chains 9, loops 2 (6 pts) (nesting depth added 37). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/methods/manual_inspect.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"15fb385db4b5c7a455313c589275f35c8f5bd4d52a4dcee577281c80dfe87368"}},{"ruleId":"D2","level":"warning","message":{"text":"MirBorrowckCtxt::suggest_make_local_mut (cognitive 67): MirBorrowckCtxt::suggest_make_local_mut has cognitive complexity 67 (threshold 15). Drivers by points: if/else 31 (48 pts), boolean chains 10, match/switch 5 (6 pts), loops 1 (3 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/diagnostics/mutability_errors.rs"},"region":{"startLine":1399}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0a6640e3e13f1f35ca575159afb3680e27b7ddb3a0f9db577b6b569e4e2f404"}},{"ruleId":"D2","level":"warning","message":{"text":"ConstructorSet::split (cognitive 67): ConstructorSet::split has cognitive complexity 67 (threshold 15). Drivers by points: if/else 21 (38 pts), loops 7 (14 pts), match/switch 6 (14 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":"compiler/rustc_pattern_analysis/src/constructor.rs"},"region":{"startLine":1044}}}],"partialFingerprints":{"codehealthFindingId/v1":"0db7f28319212d4c9d3a9a032ebc6f0e575c174ae34449dce3e6b7f0a630a078"}},{"ruleId":"D2","level":"warning","message":{"text":"DerefDelegate::borrow (cognitive 67): DerefDelegate::borrow has cognitive complexity 67 (threshold 15). Drivers by points: if/else 15 (47 pts), match/switch 3 (11 pts), loops 1 (5 pts), boolean chains 4 (nesting depth added 44). 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/tools/clippy/clippy_utils/src/sugg.rs"},"region":{"startLine":937}}}],"partialFingerprints":{"codehealthFindingId/v1":"66a5fe60848f783550e129363de304cd5a72b4e188380c7e287eefdc58b12f77"}},{"ruleId":"D2","level":"warning","message":{"text":"TestCx::run_ui_test (cognitive 67): TestCx::run_ui_test has cognitive complexity 67 (threshold 15). Drivers by points: if/else 35 (57 pts), boolean chains 8, match/switch 1 (2 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/compiletest/src/runtest/ui.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"3913b450369859933f4fb54d09bc778b03f7c1b51cc46c5a3410b4fb137486fd"}},{"ruleId":"D2","level":"warning","message":{"text":"AnalysisStats::run_term_search (cognitive 67): AnalysisStats::run_term_search has cognitive complexity 67 (threshold 15). Drivers by points: if/else 10 (31 pts), match/switch 9 (26 pts), loops 4 (8 pts), boolean chains 2 (nesting depth added 42). To reduce it, split the body into named stages: move each independent step or branch into 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/tools/rust-analyzer/crates/rust-analyzer/src/cli/analysis_stats.rs"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"be479788cf18a784a49b413e6a1fad5969ad0d6f784dbd4251a97ae26b559a77"}},{"ruleId":"D2","level":"warning","message":{"text":"LateResolutionVisitor::make_base_error (cognitive 66): LateResolutionVisitor::make_base_error has cognitive complexity 66 (threshold 15). Drivers by points: if/else 21 (39 pts), match/switch 5 (17 pts), boolean chains 10 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/late/diagnostics.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaf10c93a2effb1e6d9325aae9b8b62c3bd11b629a1034b1e73d62c0cb96c4ac"}},{"ruleId":"D2","level":"warning","message":{"text":"rustdoc::html::render::search_index::simplify_fn_type (cognitive 66): rustdoc::html::render::search_index::simplify_fn_type has cognitive complexity 66 (threshold 15). Drivers by points: if/else 24 (49 pts), boolean chains 7, loops 2 (6 pts), match/switch 2 (4 pts) (nesting depth added 31). 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/librustdoc/html/render/search_index.rs"},"region":{"startLine":2119}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d360a0a1251d31ec863be9cb6d62071c63cb8b11e4d3b20c5f0d381e3eb2f3e"}},{"ruleId":"D2","level":"warning","message":{"text":"Dereferencing::report (cognitive 66): Dereferencing::report has cognitive complexity 66 (threshold 15). Drivers by points: if/else 23 (40 pts), boolean chains 13, match/switch 6 (13 pts) (nesting depth added 24). 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/tools/clippy/clippy_lints/src/dereference.rs"},"region":{"startLine":1098}}}],"partialFingerprints":{"codehealthFindingId/v1":"f400fb52d1d5b8c4bd137174cf2bd46d71fbcd228938683aabca717e18a1bedf"}},{"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/tools/miri/src/shims/unix/fs.rs"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f156d46db304905376b5fe4d1555244876af9309a465d37c6b2fd83f4105555"}},{"ruleId":"D2","level":"warning","message":{"text":"Checker::visit_item (cognitive 65): Checker::visit_item has cognitive complexity 65 (threshold 15). Drivers by points: if/else 15 (49 pts), loops 2 (6 pts), boolean chains 5, match/switch 2 (5 pts) (nesting depth added 41). 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":"compiler/rustc_passes/src/stability.rs"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"27ec3d4194fcfa0699f3c2c37af13f0e9712535e225712d6b2fb2fa811ea8213"}},{"ruleId":"D2","level":"warning","message":{"text":"rustdoc::clean::clean_generics (cognitive 65): rustdoc::clean::clean_generics has cognitive complexity 65 (threshold 15). Drivers by points: if/else 7 (31 pts), loops 7 (22 pts), match/switch 5 (11 pts), boolean chains 1 (nesting depth added 45). To reduce it, split the body into named stages: move each independent step or branch into 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/librustdoc/clean/mod.rs"},"region":{"startLine":759}}}],"partialFingerprints":{"codehealthFindingId/v1":"284cc1d8b75a0e8ff54c4a32ac11a39fb75f5159b9487caf5a2f21fb595d6f59"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::eta_reduction::check_closure (cognitive 65): clippy_lints::eta_reduction::check_closure has cognitive complexity 65 (threshold 15). Drivers by points: if/else 19 (38 pts), match/switch 6 (19 pts), boolean chains 8 (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/tools/clippy/clippy_lints/src/eta_reduction.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"974b9b004c977d7a2840eaa4c0011be5d431c6c4f515c08acceb5c7f75cff6e4"}},{"ruleId":"D2","level":"warning","message":{"text":"AstValidator::visit_item (cognitive 64): AstValidator::visit_item has cognitive complexity 64 (threshold 15). Drivers by points: if/else 25 (50 pts), boolean chains 5, loops 2 (5 pts), match/switch 2 (4 pts) (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ast_passes/src/ast_validation.rs"},"region":{"startLine":1417}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8caf15335e0694f10f8299017a77cf27ca881802f23cebcc2d735491b31929f"}},{"ruleId":"D2","level":"warning","message":{"text":"AttributeParser::parse_attribute_list (cognitive 64): AttributeParser::parse_attribute_list has cognitive complexity 64 (threshold 15). Drivers by points: if/else 18 (45 pts), match/switch 3 (10 pts), boolean chains 5, loops 3 (4 pts) (nesting depth added 35). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_attr_parsing/src/interface.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"8802c241358da7c9b071400440f935be8855ad2c8e240f02fcfa0bca029919e0"}},{"ruleId":"D2","level":"warning","message":{"text":"InherentOverlapChecker::check_item (cognitive 64): InherentOverlapChecker::check_item has cognitive complexity 64 (threshold 15). Drivers by points: loops 11 (37 pts), if/else 9 (24 pts), match/switch 1 (3 pts) (nesting depth added 43). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/coherence/inherent_impls_overlap.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"408a45fa1840ba506f0cff28bae9937139dde93b6c43e64da4ff9326cedb6f27"}},{"ruleId":"D2","level":"warning","message":{"text":"Resolver::resolve_ident_in_scope (cognitive 64): Resolver::resolve_ident_in_scope has cognitive complexity 64 (threshold 15). Drivers by points: if/else 18 (36 pts), match/switch 11 (22 pts), boolean chains 4, loops 1 (2 pts) (nesting depth added 30). 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":"compiler/rustc_resolve/src/ident.rs"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"15d418ded725ffbc9c900ec3caa95214b3aeeed1885bdcd46d0b842a7188e1b0"}},{"ruleId":"D2","level":"warning","message":{"text":"bootstrap::core::config::toml::llvm::check_incompatible_options_for_ci_llvm (cognitive 64): bootstrap::core::config::toml::llvm::check_incompatible_options_for_ci_llvm has cognitive complexity 64 (threshold 15). Drivers by points: if/else 43 (64 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/config/toml/llvm.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fe4edda25580d149a68c1649f60e20bf050f70967d603afbdca9b9b5730e89c"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_utils::is_never_expr (cognitive 64): clippy_utils::is_never_expr has cognitive complexity 64 (threshold 15). Drivers by points: if/else 25 (44 pts), loops 4 (11 pts), boolean chains 5, match/switch 2 (4 pts) (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_utils/src/lib.rs"},"region":{"startLine":3021}}}],"partialFingerprints":{"codehealthFindingId/v1":"b74b5936e78912db3bd589801f4c68540c089b236211bb841610a6642eeea570"}},{"ruleId":"D2","level":"warning","message":{"text":"hir_expand::builtin::derive_macro::coerce_pointee_expand (cognitive 64): hir_expand::builtin::derive_macro::coerce_pointee_expand has cognitive complexity 64 (threshold 15). Drivers by points: if/else 31 (46 pts), match/switch 8 (10 pts), boolean chains 4, loops 3 (4 pts) (nesting depth added 18). Of this number, 46 points are the body\u0027s own statements and 18 belong to 4 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-expand/src/builtin/derive_macro.rs"},"region":{"startLine":1128}}}],"partialFingerprints":{"codehealthFindingId/v1":"df69d6f9a58010c5a5dea706ecec29f517a25bc356a0738febf3ee44154837ef"}},{"ruleId":"D2","level":"warning","message":{"text":"mbe::expander::transcriber::expand_subtree (cognitive 64): mbe::expander::transcriber::expand_subtree has cognitive complexity 64 (threshold 15). Drivers by points: if/else 8 (29 pts), match/switch 7 (28 pts), loops 3 (7 pts) (nesting depth added 46). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/mbe/src/expander/transcriber.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec61e716578ba7c4d6f248b4f6af9dada5a6535219d1ea18f311810ccefee939"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::analyze_closure (cognitive 63): FnCtxt::analyze_closure has cognitive complexity 63 (threshold 15). Drivers by points: if/else 25 (49 pts), loops 5 (9 pts), match/switch 3 (4 pts), boolean chains 1 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/upvar.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"8def1cf51c9a805cdbabb8c4e5f0c24e3dad5aebf7ad3f0efa0b0e48ff98ab9a"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_metadata::dependency_format::calculate_type (cognitive 63): rustc_metadata::dependency_format::calculate_type has cognitive complexity 63 (threshold 15). Drivers by points: if/else 16 (34 pts), loops 8 (14 pts), boolean chains 8, match/switch 4 (7 pts) (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":"compiler/rustc_metadata/src/dependency_format.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"66a8a7d3c7e36c4e4cd4dbb64406ee076165dc8c54761f8c7c2b48df40d4c445"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_mir_build::thir::pattern::check_match::report_non_exhaustive_match (cognitive 63): rustc_mir_build::thir::pattern::check_match::report_non_exhaustive_match has cognitive complexity 63 (threshold 15). Drivers by points: if/else 31 (49 pts), boolean chains 7, loops 3 (5 pts), match/switch 2 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_build/src/thir/pattern/check_match.rs"},"region":{"startLine":1250}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d2b6c6ba2e12466edd6802608df06458ee3cf59d0b632e237f9c889796e6330"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_mir_transform::liveness::find_self_assignments (cognitive 63): rustc_mir_transform::liveness::find_self_assignments has cognitive complexity 63 (threshold 15). Drivers by points: if/else 14 (55 pts), loops 2 (3 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 44). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/liveness.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"40a2a792d59fad090d68c64c72dc51fd93df35e847b2fd2818d2dfca14862fad"}},{"ruleId":"D2","level":"warning","message":{"text":"rustdoc::html::render::print_item::item_module (cognitive 63): rustdoc::html::render::print_item::item_module has cognitive complexity 63 (threshold 15). Drivers by points: match/switch 10 (28 pts), if/else 14 (26 pts), loops 6 (9 pts) (nesting depth added 33). Of this number, 58 points are the body\u0027s own statements and 5 belong to 3 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/render/print_item.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"395981a779290288672dcb1c1e756ee957004b2621187b23f2ce7ec953ac521e"}},{"ruleId":"D2","level":"warning","message":{"text":"Matches::check_expr (cognitive 63): Matches::check_expr has cognitive complexity 63 (threshold 15). Drivers by points: if/else 22 (51 pts), boolean chains 8, loops 1 (2 pts), match/switch 1 (2 pts) (nesting depth added 31). 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/tools/clippy/clippy_lints/src/matches/mod.rs"},"region":{"startLine":1055}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbde7a8760127e4ac9de345b71caaeefa7a9c78a18b1ffed7f73c6e8a5c1af7e"}},{"ruleId":"D2","level":"warning","message":{"text":"Directive::check (cognitive 63): Directive::check has cognitive complexity 63 (threshold 15). Drivers by points: if/else 18 (52 pts), loops 2 (6 pts), match/switch 3 (5 pts) (nesting depth added 40). 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/tools/jsondocck/src/directive.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"00cdebbf7fe197f46e57d64f5bbe1a24f4bed09b3675214ddad933179c8ff04f"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_completion::context::analysis::expected_type_and_name (cognitive 63): ide_completion::context::analysis::expected_type_and_name has cognitive complexity 63 (threshold 15). Drivers by points: if/else 14 (28 pts), match/switch 11 (23 pts), boolean chains 7, loops 3 (5 pts) (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-completion/src/context/analysis.rs"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"725ef3c600398b0c0ef4fe6efb018e72a5cbb4822d176daf2359909d855cd0c5"}},{"ruleId":"D2","level":"warning","message":{"text":"NotifyActor::run (cognitive 63): NotifyActor::run has cognitive complexity 63 (threshold 15). Drivers by points: if/else 9 (36 pts), loops 4 (13 pts), match/switch 3 (10 pts), boolean chains 4 (nesting depth added 43). To reduce it, split the body into named stages: move each independent step or branch into 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/tools/rust-analyzer/crates/vfs-notify/src/lib.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eed605b2c6b9774b05d6c37981a16fc2374b908bca2e4a96cd2da6e4a9a48dd"}},{"ruleId":"D2","level":"warning","message":{"text":"State::print_expr_outer_attr_style (cognitive 62): State::print_expr_outer_attr_style has cognitive complexity 62 (threshold 15). Drivers by points: if/else 22 (41 pts), boolean chains 7, loops 3 (7 pts), match/switch 4 (7 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ast_pretty/src/pprust/state/expr.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cda666b8f39f487c2d43e283b97d734cd247e650fc753e07fbbc35664cdc187"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_codegen_llvm::context::init_module (cognitive 62): rustc_codegen_llvm::context::init_module has cognitive complexity 62 (threshold 15). Drivers by points: if/else 35 (45 pts), match/switch 5 (9 pts), boolean chains 7, loops 1 (nesting depth added 14). 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":"compiler/rustc_codegen_llvm/src/context.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"41f68a7d41629545619b6476cada4694f7125c928858c194c7f147c1372fe158"}},{"ruleId":"D2","level":"warning","message":{"text":"InterpCx::eval_intrinsic (cognitive 62): InterpCx::eval_intrinsic has cognitive complexity 62 (threshold 15). Drivers by points: if/else 25 (45 pts), match/switch 8 (15 pts), boolean chains 2 (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":"compiler/rustc_const_eval/src/interpret/intrinsics.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"280a195ac5e7ff91521611c4a93788aea3d323fd4dacc70bbeecb1a172b11242"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::check_expr_field (cognitive 62): FnCtxt::check_expr_field has cognitive complexity 62 (threshold 15). Drivers by points: if/else 21 (49 pts), boolean chains 5, loops 2 (4 pts), match/switch 2 (4 pts) (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/expr.rs"},"region":{"startLine":2820}}}],"partialFingerprints":{"codehealthFindingId/v1":"c402ff1cc2ed50e850cf99a14f86c53e73cde2e07d6e02e1c9b7bd6b4808cc06"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_struct_fields (cognitive 62): Parser::parse_struct_fields has cognitive complexity 62 (threshold 15). Drivers by points: if/else 19 (49 pts), match/switch 3 (7 pts), boolean chains 5, loops 1 (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/expr.rs"},"region":{"startLine":3569}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c182be52ac45d351224b74dddab3ea3114b6708b75f3cb4b3448ac8670b8abb"}},{"ruleId":"D2","level":"warning","message":{"text":"rustdoc::passes::lint::unescaped_backticks::visit_item (cognitive 62): rustdoc::passes::lint::unescaped_backticks::visit_item has cognitive complexity 62 (threshold 15). Drivers by points: if/else 14 (45 pts), boolean chains 8, match/switch 3 (8 pts), loops 1 (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into 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/librustdoc/passes/lint/unescaped_backticks.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a04b60fc31e2a162df3b68e60f6da97ed2eb0d8b529d4855ba6f1b28106b602"}},{"ruleId":"D2","level":"warning","message":{"text":"ide::rename::transform_method_call_into_assoc_fn (cognitive 62): ide::rename::transform_method_call_into_assoc_fn has cognitive complexity 62 (threshold 15). Drivers by points: if/else 12 (41 pts), match/switch 4 (14 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 42). To reduce it, split the body into named stages: move each independent step or branch into 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/tools/rust-analyzer/crates/ide/src/rename.rs"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0eb2a965ba246d1badf0ccf34811e97b9fa41ca971d811c11c1e28f60ec3f78"}},{"ruleId":"D2","level":"warning","message":{"text":"GlobalState::switch_workspaces (cognitive 62): GlobalState::switch_workspaces has cognitive complexity 62 (threshold 15). Drivers by points: if/else 20 (41 pts), match/switch 5 (10 pts), loops 2 (6 pts), boolean chains 5 (nesting depth added 30). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/reload.rs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"c274c58b9768ff11a390067144180895855144b3b53faf78fb8811bfeed21587"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_codegen_ssa::mir::naked_asm::prefix_and_suffix (cognitive 61): rustc_codegen_ssa::mir::naked_asm::prefix_and_suffix has cognitive complexity 61 (threshold 15). Drivers by points: if/else 20 (32 pts), match/switch 14 (27 pts), boolean chains 2 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/mir/naked_asm.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f7d4ff25dcda640c9936d5b2d73398fa979ed7d1f369d2deff85dcc7cae662a"}},{"ruleId":"D2","level":"warning","message":{"text":"InterpCx::binary_int_op (cognitive 61): InterpCx::binary_int_op has cognitive complexity 61 (threshold 15). Drivers by points: if/else 22 (43 pts), match/switch 7 (12 pts), boolean chains 6 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_const_eval/src/interpret/operator.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"a797adceee8a38bb1736a8e4917c5e9ff5f46614b5216aacc82e4be805e32374"}},{"ruleId":"D2","level":"warning","message":{"text":"CheckLoopVisitor::visit_expr (cognitive 61): CheckLoopVisitor::visit_expr has cognitive complexity 61 (threshold 15). Drivers by points: if/else 19 (38 pts), match/switch 9 (21 pts), boolean chains 2 (nesting depth added 31). 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":"compiler/rustc_hir_typeck/src/loops.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"efc65eb1c347f074745d5fb28f380f54ffe52ccf1257179e89e725441a3a64f8"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_trait_selection::error_reporting::infer::nice_region_error::static_impl_trait::suggest_new_region_bound (cognitive 61): rustc_trait_selection::error_reporting::infer::nice_region_error::static_impl_trait::suggest_new_region_bound has cognitive complexity 61 (threshold 15). Drivers by points: if/else 20 (53 pts), match/switch 2 (5 pts), boolean chains 2, loops 1 (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/error_reporting/infer/nice_region_error/static_impl_trait.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3a019b2c94f161e123f24cf372c9a49048a85c6614b7aacaa28a01e49bd8858"}},{"ruleId":"D2","level":"warning","message":{"text":"bootstrap::core::build_steps::llvm::configure_cmake (cognitive 61): bootstrap::core::build_steps::llvm::configure_cmake has cognitive complexity 61 (threshold 15). Drivers by points: if/else 43 (51 pts), boolean chains 7, loops 2, match/switch 1 (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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/bootstrap/src/core/build_steps/llvm.rs"},"region":{"startLine":883}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8efb4b952b0cfab37ce8c369dea63bfb889baf2c351b0d4755b79f774f0b5ba"}},{"ruleId":"D2","level":"warning","message":{"text":"CacheBuilder::fold_item (cognitive 61): CacheBuilder::fold_item has cognitive complexity 61 (threshold 15). Drivers by points: if/else 21 (38 pts), match/switch 6 (9 pts), boolean chains 8, loops 2 (6 pts) (nesting depth added 24). Of this number, 60 points are the body\u0027s own statements and 1 belongs 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/librustdoc/formats/cache.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"787f20f3d59016598fa55112fc2294cf811ea63f627620612e4ebd30c2c3570a"}},{"ruleId":"D2","level":"warning","message":{"text":"Resolver::resolve_path_in_value_ns_with_prefix_info (cognitive 61): Resolver::resolve_path_in_value_ns_with_prefix_info has cognitive complexity 61 (threshold 15). Drivers by points: if/else 16 (41 pts), match/switch 5 (11 pts), boolean chains 5, loops 2 (4 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/tools/rust-analyzer/crates/hir-def/src/resolver.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b1bc9733ae836990bdcb4b5bc31d6043e7374d45d1c9511540b0b45d0ca723d"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_completion::completions::postfix::complete_postfix (cognitive 61): ide_completion::completions::postfix::complete_postfix has cognitive complexity 61 (threshold 15). Drivers by points: if/else 27 (36 pts), match/switch 10 (15 pts), boolean chains 10 (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/tools/rust-analyzer/crates/ide-completion/src/completions/postfix.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"255968e2373e0c36254cf6094557d51a6910df2faad0389544733f707d4a2236"}},{"ruleId":"D2","level":"warning","message":{"text":"SuffixTrie.substringMatches (cognitive 61): SuffixTrie.substringMatches has cognitive complexity 61 (threshold 15). Drivers by points: if/else 12 (36 pts), loops 8 (21 pts), ternaries 1 (3 pts), boolean chains 1 (nesting depth added 39). To reduce it, split the body into named stages: move each independent step or branch into 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/librustdoc/html/static/js/stringdex.js"},"region":{"startLine":2447}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f1279554ce4ac1e248bfe0a36610534eeac0bad20bc22999ac8ba11b78d9f30"}},{"ruleId":"D2","level":"warning","message":{"text":"loadDatabase::substringMatches (cognitive 61): loadDatabase::substringMatches has cognitive complexity 61 (threshold 15). Drivers by points: if/else 12 (36 pts), loops 8 (21 pts), ternaries 1 (3 pts), boolean chains 1 (nesting depth added 39). To reduce it, split the body into named stages: move each independent step or branch into 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/librustdoc/html/static/js/stringdex.js"},"region":{"startLine":2447}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a422a2fce7af2e3b165a018ec796e482bec709a6296b36f8fb36f97c8f8d18d"}},{"ruleId":"D2","level":"warning","message":{"text":"InlineAssemblyGenerator::generate_asm_wrapper (cognitive 60): InlineAssemblyGenerator::generate_asm_wrapper has cognitive complexity 60 (threshold 15). Drivers by points: if/else 15 (30 pts), match/switch 6 (16 pts), loops 7 (12 pts), boolean chains 2 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/src/inline_asm.rs"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"77fa4cbe4895ce12ba4b7e58a9843f7450932ebca197531836464121abef9a3c"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::suggest_cast (cognitive 60): FnCtxt::suggest_cast has cognitive complexity 60 (threshold 15). Drivers by points: if/else 38 (44 pts), match/switch 6 (12 pts), boolean chains 4 (nesting depth added 12). 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":"compiler/rustc_hir_typeck/src/fn_ctxt/suggestions.rs"},"region":{"startLine":3420}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1aeb63d04c3b6c1827c346a4e90287fedbe373e5463042fd54ca6fb2a6881ba"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_resolve::rustdoc::source_span_for_markdown_range_inner (cognitive 60): rustc_resolve::rustdoc::source_span_for_markdown_range_inner has cognitive complexity 60 (threshold 15). Drivers by points: if/else 20 (47 pts), boolean chains 8, loops 3 (5 pts) (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/rustdoc.rs"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"d813be87a07d8690583b6523c2311b0a4c7d28167e196a715f2632b2256b8607"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_trait_selection::error_reporting::infer::region::suggest_precise_capturing (cognitive 60): rustc_trait_selection::error_reporting::infer::region::suggest_precise_capturing has cognitive complexity 60 (threshold 15). Drivers by points: if/else 23 (44 pts), match/switch 4 (9 pts), loops 3 (7 pts) (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/error_reporting/infer/region.rs"},"region":{"startLine":1429}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3d227245bc7066091ed34ce46cfc84cb4b7e678b844049429d07994b52d9f3e"}},{"ruleId":"D2","level":"warning","message":{"text":"TagParser::extract_html_tag (cognitive 60): TagParser::extract_html_tag has cognitive complexity 60 (threshold 15). Drivers by points: if/else 13 (49 pts), loops 2 (7 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 42). 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/librustdoc/passes/lint/html_tags.rs"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"179d0109ff0a1a05ce9f9bf590a9af0bd4f27bfdd8ea4ccd47448553e9777ebb"}},{"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/tools/miri/src/shims/windows/fs.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"b53addd44ebe4a9cb1330a50fcea24c99973d0b6f1c2a6343f73ce7f9a4a381d"}},{"ruleId":"D2","level":"warning","message":{"text":"ide::highlight_related::highlight_references (cognitive 60): ide::highlight_related::highlight_references has cognitive complexity 60 (threshold 15). Drivers by points: if/else 17 (40 pts), match/switch 5 (14 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/highlight_related.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"781a180a7ffcec745198bdb3314541a5f10469e5023781d4778ee30ae24f5a35"}},{"ruleId":"D2","level":"warning","message":{"text":"project_model::workspace::handle_rustc_crates (cognitive 60): project_model::workspace::handle_rustc_crates has cognitive complexity 60 (threshold 15). Drivers by points: if/else 11 (37 pts), loops 9 (23 pts) (nesting depth added 40). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/project-model/src/workspace.rs"},"region":{"startLine":1536}}}],"partialFingerprints":{"codehealthFindingId/v1":"32a91f0ccee18a32a79204f8de872e6013343a4a36be1262c9ae835ae8166c80"}},{"ruleId":"D2","level":"warning","message":{"text":"Canonicalized::canonicalize (cognitive 60): Canonicalized::canonicalize has cognitive complexity 60 (threshold 15). Drivers by points: if/else 9 (29 pts), loops 13 (29 pts), match/switch 2 (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into 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/tools/unicode-table-generator/src/raw_emitter.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f5df4cee4af50ea87a06230fdedcc1670269116f5f8eb0628b393d6f4513af5"}},{"ruleId":"D2","level":"warning","message":{"text":"intersection (cognitive 60): intersection has cognitive complexity 60 (threshold 15). Drivers by points: if/else 14 (29 pts), loops 4 (14 pts), boolean chains 12, ternaries 2 (5 pts) (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/stringdex.js"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f3bdb52e2eccd64596f6b02cfd907984c3407a67c61abc4925caebb22696073"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionCx::codegen_rvalue_operand (cognitive 59): FunctionCx::codegen_rvalue_operand has cognitive complexity 59 (threshold 15). Drivers by points: if/else 18 (39 pts), match/switch 8 (17 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 31). 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":"compiler/rustc_codegen_ssa/src/mir/rvalue.rs"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"f48d353121e69edff6a07016ea150e11390a5d456be13c7fd600bd02c9d157a8"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_expr_bottom (cognitive 59): Parser::parse_expr_bottom has cognitive complexity 59 (threshold 15). Drivers by points: if/else 48 (54 pts), boolean chains 5 (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":"compiler/rustc_parse/src/parser/expr.rs"},"region":{"startLine":1246}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb57a00aa93e0f1a431aef0b88bcaf8c940e69918595f762f28fc351d3e928d5"}},{"ruleId":"D2","level":"warning","message":{"text":"LateResolutionVisitor::with_const_and_generic_param_rib (cognitive 59): LateResolutionVisitor::with_const_and_generic_param_rib has cognitive complexity 59 (threshold 15). Drivers by points: if/else 10 (24 pts), match/switch 6 (19 pts), loops 6 (13 pts), boolean chains 3 (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/late.rs"},"region":{"startLine":3267}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a9c1e504a463c6661f1d1e797885cb20c1bb0fede3075575b1bcf383222896f"}},{"ruleId":"D2","level":"warning","message":{"text":"stdarch_gen_hexagon::scalar::parse_header (cognitive 59): stdarch_gen_hexagon::scalar::parse_header has cognitive complexity 59 (threshold 15). Drivers by points: if/else 16 (49 pts), loops 3 (7 pts), boolean chains 3 (nesting depth added 37). 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":"library/stdarch/crates/stdarch-gen-hexagon/src/scalar.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"002f6a80c41a202ee36a262beaa005f55982260b6a2fb3bc38463547840fbbb7"}},{"ruleId":"D2","level":"warning","message":{"text":"bootstrap::bin::rustc::main (cognitive 59): bootstrap::bin::rustc::main has cognitive complexity 59 (threshold 15). Drivers by points: if/else 31 (39 pts), boolean chains 10, loops 3 (6 pts), match/switch 3 (4 pts) (nesting depth added 12). 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/bootstrap/src/bin/rustc.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cbefa46125f74dca81afb40482496dcfb095e86f010b5ee86c21af1a45fd468"}},{"ruleId":"D2","level":"warning","message":{"text":"LintExtractor::lints_from_file (cognitive 59): LintExtractor::lints_from_file has cognitive complexity 59 (threshold 15). Drivers by points: if/else 15 (39 pts), match/switch 4 (13 pts), loops 4 (7 pts) (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into 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/tools/lint-docs/src/lib.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3604a2332a9ec3416e4eda5c10c536b9285dbf8af434187310f1d4c3ec2645d"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_assists::handlers::convert_closure_to_fn::convert_closure_to_fn (cognitive 59): ide_assists::handlers::convert_closure_to_fn::convert_closure_to_fn has cognitive complexity 59 (threshold 15). Drivers by points: if/else 23 (43 pts), match/switch 5 (8 pts), boolean chains 4, loops 3 (4 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_closure_to_fn.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a869f958f04b059018b8a91da150a0fcf26b2e2e66d1c6d2f2676114b125d43"}},{"ruleId":"D2","level":"warning","message":{"text":"Ty::rewrite_result (cognitive 58): Ty::rewrite_result has cognitive complexity 58 (threshold 15). Drivers by points: if/else 27 (51 pts), match/switch 3 (5 pts), boolean chains 2 (nesting depth added 26). 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/tools/rustfmt/src/types.rs"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbb889bb9fce9238f82de3b40f35b58d99294d12eeadd668d6b29ca174aecd33"}},{"ruleId":"D2","level":"warning","message":{"text":"VisitOpaqueTypes::visit_ty (cognitive 58): VisitOpaqueTypes::visit_ty has cognitive complexity 58 (threshold 15). Drivers by points: if/else 14 (33 pts), loops 4 (12 pts), match/switch 3 (9 pts), boolean chains 4 (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":"compiler/rustc_lint/src/impl_trait_overcaptures.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"16ff75cd5c9b52ac8d206c90be92ed53d2596c104f96fd6dcc15cc8abca7b60f"}},{"ruleId":"D2","level":"warning","message":{"text":"CStore::report_target_modifiers_extended (cognitive 58): CStore::report_target_modifiers_extended has cognitive complexity 58 (threshold 15). Drivers by points: if/else 17 (46 pts), match/switch 4 (8 pts), loops 2 (4 pts) (nesting depth added 35). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_metadata/src/creader.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"54ca5c0596afac0433c72e05c93fa72c8bb80e42216950cc6229f2832d8970b3"}},{"ruleId":"D2","level":"warning","message":{"text":"NiceRegionError::report_trait_placeholder_mismatch (cognitive 58): NiceRegionError::report_trait_placeholder_mismatch has cognitive complexity 58 (threshold 15). Drivers by points: if/else 24 (42 pts), boolean chains 10, match/switch 2 (4 pts), loops 2 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/error_reporting/infer/nice_region_error/placeholder_error.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed0a7fc95b3494bea790c0d097c5eaad50984bf56157e687bb1c752bbac3589b"}},{"ruleId":"D2","level":"warning","message":{"text":"rustdoc::passes::lint::invalid_markdown_table::visit_item (cognitive 58): rustdoc::passes::lint::invalid_markdown_table::visit_item has cognitive complexity 58 (threshold 15). Drivers by points: if/else 9 (42 pts), loops 3 (10 pts), match/switch 1 (4 pts), boolean chains 2 (nesting depth added 43). 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/librustdoc/passes/lint/invalid_markdown_table.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ed2a8ee29c27b006cc6d019ae8cbc09b2b4a4d17a0d9fc05cd3f6bc5aec15d2"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::loops::explicit_iter_loop::is_ref_iterable (cognitive 58): clippy_lints::loops::explicit_iter_loop::is_ref_iterable has cognitive complexity 58 (threshold 15). Drivers by points: if/else 21 (45 pts), boolean chains 11, match/switch 1 (2 pts) (nesting depth added 25). 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/tools/clippy/clippy_lints/src/loops/explicit_iter_loop.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"1149fb7053d34a3222f34a1bf0a05e5780fbd82126c513229c058bb0784ddf2f"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_completion::context::analysis::expand (cognitive 58): ide_completion::context::analysis::expand has cognitive complexity 58 (threshold 15). Drivers by points: if/else 14 (45 pts), match/switch 4 (6 pts), loops 2 (5 pts), boolean chains 2 (nesting depth added 36). 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/tools/rust-analyzer/crates/ide-completion/src/context/analysis.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"beb7af91f2ebbb2fbb0b0d7a23e078e7141ce97298fbb6971c86d7b117065e0f"}},{"ruleId":"D2","level":"warning","message":{"text":"rustfmt_nightly::macros::rewrite_macro_inner (cognitive 58): rustfmt_nightly::macros::rewrite_macro_inner has cognitive complexity 58 (threshold 15). Drivers by points: if/else 18 (30 pts), match/switch 10 (20 pts), boolean chains 8 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/macros.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"8790abe81644f7ce889ff99ae667f9b63299cfc520b19e3fc2913a456ca1f56f"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_codegen_ssa::back::symbol_export::exported_generic_symbols_provider_local (cognitive 57): rustc_codegen_ssa::back::symbol_export::exported_generic_symbols_provider_local has cognitive complexity 57 (threshold 15). Drivers by points: if/else 16 (40 pts), match/switch 3 (9 pts), boolean chains 6, loops 1 (2 pts) (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/back/symbol_export.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bc54139dd520caee0d16386d23a2650a977a98931ddc12f39ffadaf2d107230"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_expand::mbe::macro_rules::compile_declarative_macro (cognitive 57): rustc_expand::mbe::macro_rules::compile_declarative_macro has cognitive complexity 57 (threshold 15). Drivers by points: if/else 27 (54 pts), boolean chains 2, 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":"compiler/rustc_expand/src/mbe/macro_rules.rs"},"region":{"startLine":778}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a9c22b5f1a62a1d7c74440403300b8a73da17b99b2fdfc80c07419b5a72eee7"}},{"ruleId":"D2","level":"warning","message":{"text":"ArgMatrix::find_issue (cognitive 57): ArgMatrix::find_issue has cognitive complexity 57 (threshold 15). Drivers by points: if/else 19 (43 pts), loops 5 (9 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/fn_ctxt/arg_matrix.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"28db3c243f456af0a3183f2986b576c3d291b816315351383c08058683ba3f3d"}},{"ruleId":"D2","level":"warning","message":{"text":"SizeSkeleton::compute_inner (cognitive 57): SizeSkeleton::compute_inner has cognitive complexity 57 (threshold 15). Drivers by points: if/else 15 (32 pts), match/switch 10 (20 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/ty/layout.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"1810fae986b375f2da7b65100ce0ca4b8922193c62a6dea2ef7d8ed28b227bda"}},{"ruleId":"D2","level":"warning","message":{"text":"AssignmentResult::report_fully_unused (cognitive 57): AssignmentResult::report_fully_unused has cognitive complexity 57 (threshold 15). Drivers by points: if/else 26 (52 pts), boolean chains 4, loops 1 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/liveness.rs"},"region":{"startLine":961}}}],"partialFingerprints":{"codehealthFindingId/v1":"df151e0c2580bfcd448877b9e8594025cfd6f45661af7b3e8f231211098de93d"}},{"ruleId":"D2","level":"warning","message":{"text":"SolverDelegate::compute_goal_fast_path (cognitive 57): SolverDelegate::compute_goal_fast_path has cognitive complexity 57 (threshold 15). Drivers by points: if/else 24 (47 pts), match/switch 3 (6 pts), boolean chains 4 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/solve/delegate.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6165c22d8bf942a6d84a299fc1da7e4f1a6c850aa247327881047395037ae80"}},{"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/tools/miri/src/diagnostics.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd92fbb0b9dc105410bf2b4bfb9391cae15cc9304d1e91328276b5df69bb2a69"}},{"ruleId":"D2","level":"warning","message":{"text":"InferenceContext::check_record_expr_fields (cognitive 57): InferenceContext::check_record_expr_fields has cognitive complexity 57 (threshold 15). Drivers by points: if/else 20 (41 pts), loops 3 (7 pts), match/switch 2 (7 pts), boolean chains 2 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/infer/expr.rs"},"region":{"startLine":968}}}],"partialFingerprints":{"codehealthFindingId/v1":"32cdd2fb8223dd943e17fc6f13de0bb38b9c37c0ad52f32f42d049043e8c9444"}},{"ruleId":"D2","level":"warning","message":{"text":"Scip::run (cognitive 57): Scip::run has cognitive complexity 57 (threshold 15). Drivers by points: if/else 20 (40 pts), match/switch 3 (9 pts), loops 4 (6 pts), boolean chains 2 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/cli/scip.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3541981878843aa2210cd26a0b25e480425dfe4a879de6272be000ec33f1dd3"}},{"ruleId":"D2","level":"warning","message":{"text":"GlobalState::process_changes (cognitive 57): GlobalState::process_changes has cognitive complexity 57 (threshold 15). Drivers by points: if/else 22 (45 pts), match/switch 2 (7 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 29). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/global_state.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"676ecb91a224927b015e208290ce83d9243266386c1a5af47f32c3c77f54ce2e"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_codegen_llvm::attributes::llfn_attrs_from_instance (cognitive 56): rustc_codegen_llvm::attributes::llfn_attrs_from_instance has cognitive complexity 56 (threshold 15). Drivers by points: if/else 30 (49 pts), boolean chains 3, loops 1 (2 pts), match/switch 2 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/attributes.rs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"f76b92074c899bd770afd2b15d237072e8545f1d3049d4fe3704b176e50ade79"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_codegen_ssa::back::write::produce_final_output_artifacts (cognitive 56): rustc_codegen_ssa::back::write::produce_final_output_artifacts has cognitive complexity 56 (threshold 15). Drivers by points: if/else 21 (41 pts), boolean chains 6, loops 3 (6 pts), match/switch 2 (3 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/back/write.rs"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f257c8f75e5339685a243ca213c889126d8c2a34546cc06df701cb267630461"}},{"ruleId":"D2","level":"warning","message":{"text":"Rvalue::fmt (cognitive 56): Rvalue::fmt has cognitive complexity 56 (threshold 15). Drivers by points: if/else 11 (22 pts), loops 6 (22 pts), match/switch 5 (11 pts), boolean chains 1 (nesting depth added 33). 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":"compiler/rustc_middle/src/mir/pretty.rs"},"region":{"startLine":1148}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cf65274f2ca2cb3260c643a82eb77432de3287e9ab5e011cbb9fc2a70cddb94"}},{"ruleId":"D2","level":"warning","message":{"text":"ConstAnalysis::handle_assign (cognitive 56): ConstAnalysis::handle_assign has cognitive complexity 56 (threshold 15). Drivers by points: if/else 19 (43 pts), match/switch 3 (6 pts), boolean chains 4, loops 1 (3 pts) (nesting depth added 29). 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":"compiler/rustc_mir_transform/src/dataflow_const_prop.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b1c8aa87de34aabf6f89d4c07231148af4949b798bae4d193d880aadc1efe86"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_ty_common (cognitive 56): Parser::parse_ty_common has cognitive complexity 56 (threshold 15). Drivers by points: if/else 32 (39 pts), boolean chains 10, match/switch 3 (7 pts) (nesting depth added 11). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"compiler/rustc_parse/src/parser/ty.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf8cdf411fb0513cc45e18dc7c71876e5f78f4bff6ccdabe81ab311d84707da1"}},{"ruleId":"D2","level":"warning","message":{"text":"LateResolutionVisitor::suggest_assoc_type_from_bounds (cognitive 56): LateResolutionVisitor::suggest_assoc_type_from_bounds has cognitive complexity 56 (threshold 15). Drivers by points: if/else 25 (37 pts), loops 7 (14 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/late/diagnostics.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"edb48569a0e9e0fef0510f44b40f77ee8f626b99627094296724852138f53b46"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeErrCtxt::construct_generic_bound_failure (cognitive 56): TypeErrCtxt::construct_generic_bound_failure has cognitive complexity 56 (threshold 15). Drivers by points: if/else 19 (31 pts), match/switch 11 (18 pts), boolean chains 6, 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":"compiler/rustc_trait_selection/src/error_reporting/infer/region.rs"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"f716e3492e85fded5b67205a3a7b09766c546b7f9f3ab28f57e74cd4f0782f95"}},{"ruleId":"D2","level":"warning","message":{"text":"bootstrap::core::build_steps::format::format (cognitive 56): bootstrap::core::build_steps::format::format has cognitive complexity 56 (threshold 15). Drivers by points: if/else 18 (28 pts), loops 6 (13 pts), match/switch 4 (12 pts), boolean chains 3 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/build_steps/format.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"a449b9b15ab2df531da286c57c00129f8cbd0ddcd2a08b7efd72c6ad0297da06"}},{"ruleId":"D2","level":"warning","message":{"text":"ide::inlay_hints::adjustment::hints (cognitive 56): ide::inlay_hints::adjustment::hints has cognitive complexity 56 (threshold 15). Drivers by points: if/else 26 (36 pts), boolean chains 10, match/switch 3 (7 pts), loops 2 (3 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/inlay_hints/adjustment.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7a7e7ce960c83328d143bf66b5038b3c4fa265e6a4602dc75b874803e3f7fc7"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_assists::handlers::extract_variable::extract_variable (cognitive 56): ide_assists::handlers::extract_variable::extract_variable has cognitive complexity 56 (threshold 15). Drivers by points: if/else 20 (36 pts), match/switch 10 (16 pts), boolean chains 3, loops 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/extract_variable.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"38ed6cfbe570a63bc1f5262b3075f40e1e703693fbdf829eb62b1c187a0f7dac"}},{"ruleId":"D2","level":"warning","message":{"text":"FlycheckActor::run (cognitive 56): FlycheckActor::run has cognitive complexity 56 (threshold 15). Drivers by points: if/else 9 (28 pts), match/switch 6 (19 pts), loops 3 (9 pts) (nesting depth added 38). To reduce it, split the body into named stages: move each independent step or branch into 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/tools/rust-analyzer/crates/rust-analyzer/src/flycheck.rs"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"061cacda940725031672d9bc69b3cbd005a804bd8e85d9201a301b11d7fed063"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_hir_analysis::check::check::check_impl_items_against_trait (cognitive 55): rustc_hir_analysis::check::check::check_impl_items_against_trait has cognitive complexity 55 (threshold 15). Drivers by points: if/else 15 (38 pts), match/switch 4 (10 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 30). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/check/check.rs"},"region":{"startLine":1300}}}],"partialFingerprints":{"codehealthFindingId/v1":"8633e51d1b44df53824972a88fa8d04efb26b2d35c6efbdb6fd62b3ab1ea843a"}},{"ruleId":"D2","level":"warning","message":{"text":"Resolver::check_unused (cognitive 55): Resolver::check_unused has cognitive complexity 55 (threshold 15). Drivers by points: if/else 13 (29 pts), boolean chains 11, loops 7 (8 pts), match/switch 3 (7 pts) (nesting depth added 21). Of this number, 51 points are the body\u0027s own statements and 4 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/check_unused.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"933dd6bff0340453476e9319d2df77f88408cc200c621643c75f9733b12d3592"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeErrCtxt::report_projection_error (cognitive 55): TypeErrCtxt::report_projection_error has cognitive complexity 55 (threshold 15). Drivers by points: if/else 20 (30 pts), match/switch 7 (18 pts), boolean chains 4, loops 1 (3 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/error_reporting/traits/fulfillment_errors.rs"},"region":{"startLine":1777}}}],"partialFingerprints":{"codehealthFindingId/v1":"650777c1a45febe1427abf434cb792eb8f2f59e82f82b75593fad9378b79bbb0"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_ty_utils::layout::invariant::layout_sanity_check (cognitive 55): rustc_ty_utils::layout::invariant::layout_sanity_check has cognitive complexity 55 (threshold 15). Drivers by points: if/else 21 (35 pts), match/switch 6 (10 pts), boolean chains 5, loops 2 (5 pts) (nesting depth added 21). Of this number, 36 points are the body\u0027s own statements and 19 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ty_utils/src/layout/invariant.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc6069c078b55dc5a1b8446a1b6f2ea0762c094b124848bec2d91c00d187a395"}},{"ruleId":"D2","level":"warning","message":{"text":"core::str::validations::run_utf8_validation (cognitive 55): core::str::validations::run_utf8_validation has cognitive complexity 55 (threshold 15). Drivers by points: if/else 12 (32 pts), match/switch 3 (11 pts), loops 3 (9 pts), boolean chains 3 (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/str/validations.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"383a703462cd09cb5db8c716d0d530a2ccc9dd65e4ee8e5cd605f829fedfaa66"}},{"ruleId":"D2","level":"warning","message":{"text":"Cargo::configure_linker (cognitive 55): Cargo::configure_linker has cognitive complexity 55 (threshold 15). Drivers by points: if/else 22 (39 pts), match/switch 4 (8 pts), boolean chains 5, loops 3 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/builder/cargo.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfab29dc563f239038f16e6b943106bb3e9cd2e72e45386118a36f6d500baed3"}},{"ruleId":"D2","level":"warning","message":{"text":"rustdoc::clean::first_non_private (cognitive 55): rustdoc::clean::first_non_private has cognitive complexity 55 (threshold 15). Drivers by points: if/else 9 (30 pts), loops 4 (14 pts), match/switch 2 (7 pts), boolean chains 4 (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into 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/librustdoc/clean/mod.rs"},"region":{"startLine":1609}}}],"partialFingerprints":{"codehealthFindingId/v1":"263f98972c470bc1192cb4a721c60d9f3183f3baef0e96d94eb4ec9a008279c8"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_codegen_ssa::back::link::link_binary (cognitive 54): rustc_codegen_ssa::back::link::link_binary has cognitive complexity 54 (threshold 15). Drivers by points: if/else 19 (40 pts), boolean chains 6, loops 4 (5 pts), match/switch 1 (3 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/back/link.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3e92694545a521f263fa0d4514688bebeee211b43cce41fe4a454a3368a9b8b"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_hir_analysis::check::check::check_opaque_precise_captures (cognitive 54): rustc_hir_analysis::check::check::check_opaque_precise_captures has cognitive complexity 54 (threshold 15). Drivers by points: if/else 14 (40 pts), match/switch 4 (8 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/check/check.rs"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"6023d5cd78940aa2e45a5e402dd7b93de3ba3bc3bb8354124cdba09c50206cc8"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_hir_analysis::collect::type_of::type_of (cognitive 54): rustc_hir_analysis::collect::type_of::type_of has cognitive complexity 54 (threshold 15). Drivers by points: match/switch 17 (31 pts), if/else 11 (21 pts), boolean chains 2 (nesting depth added 24). 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":"compiler/rustc_hir_analysis/src/collect/type_of.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"b41858c44bf56370e6fd4e43a29d09744ba37aa1b8d7f4f0066a921ed25d5526"}},{"ruleId":"D2","level":"warning","message":{"text":"IfLetRescope::probe_if_cascade (cognitive 54): IfLetRescope::probe_if_cascade has cognitive complexity 54 (threshold 15). Drivers by points: if/else 19 (50 pts), boolean chains 2, loops 1, match/switch 1 (nesting depth added 31). 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":"compiler/rustc_lint/src/if_let_rescope.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bc3d6e4e35edc037b062c1731d4e1f08f3142119a08464b9b5d1935c32cc381"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_monomorphize::collector::collect_items_rec (cognitive 54): rustc_monomorphize::collector::collect_items_rec has cognitive complexity 54 (threshold 15). Drivers by points: if/else 15 (30 pts), match/switch 4 (12 pts), loops 4 (10 pts), boolean chains 2 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_monomorphize/src/collector.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff5937c4490d6f487afa26243fdc3b586625d96b4b4faaba131126aebdf290d3"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_target::callconv::mips64::classify_arg (cognitive 54): rustc_target::callconv::mips64::classify_arg has cognitive complexity 54 (threshold 15). Drivers by points: if/else 11 (39 pts), loops 2 (10 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 38). 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":"compiler/rustc_target/src/callconv/mips64.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dd8a947f204ad01a7b0aa41120a052f9d4c25c47f83efd97b645b311fe541cb"}},{"ruleId":"D2","level":"warning","message":{"text":"NeedsDropTypes::next (cognitive 54): NeedsDropTypes::next has cognitive complexity 54 (threshold 15). Drivers by points: loops 7 (26 pts), if/else 7 (19 pts), match/switch 3 (9 pts) (nesting depth added 37). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ty_utils/src/needs_drop.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0f20e3a5b2e6e968da16962aa3a79a2d772fd3220947cb25e6377fdff326fd4"}},{"ruleId":"D2","level":"warning","message":{"text":"libm_macros::validate (cognitive 54): libm_macros::validate has cognitive complexity 54 (threshold 15). Drivers by points: if/else 18 (36 pts), loops 8 (15 pts), boolean chains 3 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/compiler-builtins/crates/libm-macros/src/lib.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"074f162a00ab42cc23b1189487e3abe9ac1f2f6f4fbbc609468d6cbcd81a7b1a"}},{"ruleId":"D2","level":"warning","message":{"text":"rustdoc::passes::lint::html_tags::visit_item (cognitive 54): rustdoc::passes::lint::html_tags::visit_item has cognitive complexity 54 (threshold 15). Drivers by points: if/else 18 (31 pts), match/switch 6 (11 pts), boolean chains 7, loops 3 (5 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/passes/lint/html_tags.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"df4d00cc494bd046e86683d4c1b93570c58c2ef47817da93cfdc129c35a003de"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::write::literal::check (cognitive 54): clippy_lints::write::literal::check has cognitive complexity 54 (threshold 15). Drivers by points: if/else 12 (24 pts), match/switch 6 (23 pts), loops 3 (4 pts), boolean chains 3 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/write/literal.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f461c687de7eb8dfd6f8440e58c5291fa82dcfa00809e71d53ed9ade6d882bf"}},{"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/tools/miri/src/intrinsics/x86/sse42.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"771e28f89d39eef64e71c67639634875c4ab636b0e8213524943afc38848bc4e"}},{"ruleId":"D2","level":"warning","message":{"text":"Printer::print_pat (cognitive 54): Printer::print_pat has cognitive complexity 54 (threshold 15). Drivers by points: if/else 15 (37 pts), loops 6 (12 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 29). 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/tools/rust-analyzer/crates/hir-def/src/expr_store/pretty.rs"},"region":{"startLine":896}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0eea1692a70d5c75b7480928fbb91d22b1c6e553d74533502283a6bec60e64d"}},{"ruleId":"D2","level":"warning","message":{"text":"hir_def::hir::format_args::parse (cognitive 54): hir_def::hir::format_args::parse has cognitive complexity 54 (threshold 15). Drivers by points: if/else 16 (27 pts), match/switch 10 (25 pts), loops 2 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/hir/format_args.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"24a0d8dbc66bf4bb27ce41027cc66b54ac0df92548982314450cc6a5e3b28564"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_assists::handlers::unwrap_return_type::unwrap_return_type (cognitive 54): ide_assists::handlers::unwrap_return_type::unwrap_return_type has cognitive complexity 54 (threshold 15). Drivers by points: if/else 16 (37 pts), match/switch 5 (12 pts), boolean chains 4, loops 1 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/unwrap_return_type.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e878880445fab4df07ae7906dbf43f455ade0218d2ff21e626d18ec77ba9205"}},{"ruleId":"D2","level":"warning","message":{"text":"State::print_pat (cognitive 53): State::print_pat has cognitive complexity 53 (threshold 15). Drivers by points: if/else 24 (49 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 26). 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":"compiler/rustc_ast_pretty/src/pprust/state.rs"},"region":{"startLine":1923}}}],"partialFingerprints":{"codehealthFindingId/v1":"992c8cfa8862ea000f7b361874e64bfe3c136735f8c7e50add5f07c3feaefb38"}},{"ruleId":"D2","level":"warning","message":{"text":"Checker::visit_terminator (cognitive 53): Checker::visit_terminator has cognitive complexity 53 (threshold 15). Drivers by points: if/else 15 (35 pts), match/switch 5 (11 pts), boolean chains 7 (nesting depth added 26). 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":"compiler/rustc_const_eval/src/check_consts/check.rs"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"7472c417d00263aee4f616c31a2f0256e84b35e4a71280f418925070748fdd6c"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_expand::mbe::macro_rules::is_in_follow (cognitive 53): rustc_expand::mbe::macro_rules::is_in_follow has cognitive complexity 53 (threshold 15). Drivers by points: match/switch 13 (44 pts), if/else 4 (8 pts), boolean chains 1 (nesting depth added 35). 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":"compiler/rustc_expand/src/mbe/macro_rules.rs"},"region":{"startLine":1729}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f10c3cf8ac3acd29a0dbc1c5fc68c56f960c809b1faabf0dc9b2c5d848229fd"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::point_at_expr_if_possible (cognitive 53): FnCtxt::point_at_expr_if_possible has cognitive complexity 53 (threshold 15). Drivers by points: if/else 13 (30 pts), loops 6 (13 pts), boolean chains 5, match/switch 2 (5 pts) (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":"compiler/rustc_hir_typeck/src/fn_ctxt/adjust_fulfillment_errors.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"41f9c6c16963398c27e28c514c476e007d70741bf6d3c30343f71621a37261e4"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::new (cognitive 53): Parser::new has cognitive complexity 53 (threshold 15). Drivers by points: if/else 23 (47 pts), match/switch 1 (4 pts), boolean chains 2 (nesting depth added 27). 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":"compiler/rustc_parse_format/src/lib.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"89ab3d255db18aa67408e28bb9b3eded651c45e71290ce38a21327f678a1f74b"}},{"ruleId":"D2","level":"warning","message":{"text":"rustdoc::clean::cfg::extract_cfg_from_attrs (cognitive 53): rustdoc::clean::cfg::extract_cfg_from_attrs has cognitive complexity 53 (threshold 15). Drivers by points: if/else 17 (29 pts), loops 7 (19 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 25). Of this number, 49 points are the body\u0027s own statements and 4 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/librustdoc/clean/cfg.rs"},"region":{"startLine":838}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a296b17082c4853ba2597062e4ab4a4ba76fa1318925644f61cc2ed2d714bb1"}},{"ruleId":"D2","level":"warning","message":{"text":"DefCollector::record_resolved_import (cognitive 53): DefCollector::record_resolved_import has cognitive complexity 53 (threshold 15). Drivers by points: if/else 15 (36 pts), match/switch 6 (16 pts), boolean chains 1 (nesting depth added 31). 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/tools/rust-analyzer/crates/hir-def/src/nameres/collector.rs"},"region":{"startLine":882}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1fb937add401d2262410f21efa5555bad73e1ce5880452ed02d196ee02d8407"}},{"ruleId":"D2","level":"warning","message":{"text":"mbe::expander::matcher::match_loop (cognitive 53): mbe::expander::matcher::match_loop has cognitive complexity 53 (threshold 15). Drivers by points: if/else 16 (37 pts), match/switch 2 (8 pts), loops 2 (5 pts), boolean chains 3 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/mbe/src/expander/matcher.rs"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"e33b8c9b5f475f24c4c4d4f0ddd7183a5af4670c19c21d236084b8ee0354c319"}},{"ruleId":"D2","level":"warning","message":{"text":"DocSearch.execQuery::transformResults (cognitive 53): DocSearch.execQuery::transformResults has cognitive complexity 53 (threshold 15). Drivers by points: if/else 13 (38 pts), ternaries 3 (9 pts), boolean chains 5, loops 1 (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 7 other methods here (DocSearch.execQuery::buildHrefAndPath, DocSearch.execQuery::formatDisplayTypeSignature::writeFn, DocSearch.execQuery::unifyFunctionTypes, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":2694}}}],"partialFingerprints":{"codehealthFindingId/v1":"88d91065ee97fe4b5689a7d0647360e607c253ff1e5411e94dcd531168b8a6ff"}},{"ruleId":"D2","level":"warning","message":{"text":"search.initSearch::transformResults (cognitive 53): search.initSearch::transformResults has cognitive complexity 53 (threshold 15). Drivers by points: if/else 13 (38 pts), ternaries 3 (9 pts), boolean chains 5, loops 1 (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 15 other methods here (search.initSearch, search.initSearch::getItemsBefore, search.initSearch::getNextElem, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 16 times rather than 16 independent problems. Splitting this body alone leaves the other 15 exactly as they are. Where these are variations on one operation, the change that clears all 16 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":2694}}}],"partialFingerprints":{"codehealthFindingId/v1":"6056a91befb8f3e593015d285970fc59333cc47618247138f66a1028ab8f245a"}},{"ruleId":"D2","level":"warning","message":{"text":"initSearch::execQuery::transformResults (cognitive 53): initSearch::execQuery::transformResults has cognitive complexity 53 (threshold 15). Drivers by points: if/else 13 (38 pts), ternaries 3 (9 pts), boolean chains 5, loops 1 (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":2694}}}],"partialFingerprints":{"codehealthFindingId/v1":"958d5b1e3cfa79a49c36138396c18401c355dfa272f6933127f70e8899f732a6"}},{"ruleId":"D2","level":"warning","message":{"text":"TargetDataLayout::parse_from_llvm_datalayout_string (cognitive 52): TargetDataLayout::parse_from_llvm_datalayout_string has cognitive complexity 52 (threshold 15). Drivers by points: if/else 17 (39 pts), match/switch 4 (10 pts), boolean chains 2, loops 1 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_abi/src/lib.rs"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d72691efcb2619a760c6afd43225e0ec4ce6e634b12430a712cc0489533df9a"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_codegen_ssa::back::link::add_native_libs_from_crate (cognitive 52): rustc_codegen_ssa::back::link::add_native_libs_from_crate has cognitive complexity 52 (threshold 15). Drivers by points: if/else 19 (45 pts), boolean chains 3, match/switch 2 (3 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":"compiler/rustc_codegen_ssa/src/back/link.rs"},"region":{"startLine":3404}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f4c8ba7c72dc28fd95d71540134d97199428a55ee9425494ee13bdadbc20015"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_codegen_ssa::target_features::from_target_feature_attr (cognitive 52): rustc_codegen_ssa::target_features::from_target_feature_attr has cognitive complexity 52 (threshold 15). Drivers by points: if/else 17 (41 pts), boolean chains 4, loops 2 (4 pts), match/switch 1 (3 pts) (nesting depth added 28). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/target_features.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6b884a4bdcf07dd2075e1616d2b8157be8a8418c279f3c6f6ac56bfbcabdc07"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_const_eval::check_consts::ops::build_error_for_const_call (cognitive 52): rustc_const_eval::check_consts::ops::build_error_for_const_call has cognitive complexity 52 (threshold 15). Drivers by points: if/else 13 (33 pts), match/switch 4 (9 pts), boolean chains 5, loops 1 (5 pts) (nesting depth added 29). 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":"compiler/rustc_const_eval/src/check_consts/ops.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"c473897819d6e52ecace331dc5ae165a7c7bc05f5092ff2f54113e16e5ef741c"}},{"ruleId":"D2","level":"warning","message":{"text":"Map::propagate_assignments (cognitive 52): Map::propagate_assignments has cognitive complexity 52 (threshold 15). Drivers by points: if/else 7 (28 pts), loops 7 (16 pts), match/switch 2 (7 pts), boolean chains 1 (nesting depth added 35). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_dataflow/src/value_analysis.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ff0a5c140bded326ee72e8fd3f5fc1ef10fdc5e1c4e9dd9be092e9b1fb6f05c"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_parse::lexer::unescape_error_reporting::emit_unescape_error (cognitive 52): rustc_parse::lexer::unescape_error_reporting::emit_unescape_error has cognitive complexity 52 (threshold 15). Drivers by points: if/else 20 (34 pts), boolean chains 8, match/switch 3 (6 pts), loops 2 (4 pts) (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":"compiler/rustc_parse/src/lexer/unescape_error_reporting.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9dfeb9e391ce72d600ea0373eee4146650a709e9519b6f112a5ddeafd837989"}},{"ruleId":"D2","level":"warning","message":{"text":"TransformTy::fold_ty (cognitive 52): TransformTy::fold_ty has cognitive complexity 52 (threshold 15). Drivers by points: if/else 23 (41 pts), match/switch 4 (9 pts), boolean chains 2 (nesting depth added 23). 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":"compiler/rustc_sanitizers/src/cfi/typeid/itanium_cxx_abi/transform.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"28c4ea84f998340e2b88ab8a896a854ac85fd58a7d7447f3b0a8bb8ab2b172e8"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::lifetimes::check_fn_inner (cognitive 52): clippy_lints::lifetimes::check_fn_inner has cognitive complexity 52 (threshold 15). Drivers by points: if/else 10 (29 pts), loops 4 (12 pts), match/switch 1 (6 pts), boolean chains 5 (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/tools/clippy/clippy_lints/src/lifetimes.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ac223d5251b34dd82ebb617788e7f1de07c1bd927e300027a4c5236006f309d"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_assists::handlers::inline_type_alias::create_replacement (cognitive 52): ide_assists::handlers::inline_type_alias::create_replacement has cognitive complexity 52 (threshold 15). Drivers by points: if/else 16 (44 pts), loops 4, boolean chains 2, match/switch 1 (2 pts) (nesting depth added 29). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/inline_type_alias.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f9343fdcf0a57fd8e7b38bbd6bd0a76ffdad3d8cec8c42dbc62c53dff36855a"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_expand::mbe::diagnostics::emit_frag_parse_err (cognitive 51): rustc_expand::mbe::diagnostics::emit_frag_parse_err has cognitive complexity 51 (threshold 15). Drivers by points: if/else 17 (36 pts), loops 3 (10 pts), match/switch 2 (3 pts), boolean chains 2 (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":"compiler/rustc_expand/src/mbe/diagnostics.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"74f0ab0fd06a3ca24b179d0f69cf00cb80c81a1e3d0159e366d6a8f69b4dda60"}},{"ruleId":"D2","level":"warning","message":{"text":"MoveDataBuilder::move_path_for (cognitive 51): MoveDataBuilder::move_path_for has cognitive complexity 51 (threshold 15). Drivers by points: if/else 10 (27 pts), match/switch 6 (20 pts), loops 2 (4 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":"compiler/rustc_mir_dataflow/src/move_paths/builder.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d75a0b9e16c70fb9daa37fc19c63086e7212bedf21b5d707f97ea4a690ea2f2"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_pat_with_range_pat (cognitive 51): Parser::parse_pat_with_range_pat has cognitive complexity 51 (threshold 15). Drivers by points: if/else 31 (35 pts), boolean chains 8, match/switch 3 (8 pts) (nesting depth added 9). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/pat.rs"},"region":{"startLine":721}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3100f0fb765cc46d39a8fd1210a8369134abb09d667f28f76754368dfc8a039"}},{"ruleId":"D2","level":"warning","message":{"text":"LateResolutionVisitor::smart_resolve_path_fragment (cognitive 51): LateResolutionVisitor::smart_resolve_path_fragment has cognitive complexity 51 (threshold 15). Drivers by points: if/else 24 (39 pts), boolean chains 6, match/switch 5 (6 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/late.rs"},"region":{"startLine":4872}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ec037e4917a4bbf491f583c249d0ffa06a8c204ca57362f082fda73055d90a5"}},{"ruleId":"D2","level":"warning","message":{"text":"HirCollector::visit_testable (cognitive 51): HirCollector::visit_testable has cognitive complexity 51 (threshold 15). Drivers by points: if/else 12 (30 pts), loops 4 (12 pts), match/switch 1 (7 pts), boolean chains 2 (nesting depth added 32). 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/librustdoc/doctest/rust.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7af0d6cae11bd09d08604a16c4a919cd5c3a1d10755b32e11072e27fef7293e"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::operators::op_ref::check (cognitive 51): clippy_lints::operators::op_ref::check has cognitive complexity 51 (threshold 15). Drivers by points: if/else 11 (29 pts), boolean chains 19, match/switch 2 (3 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/operators/op_ref.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaa8e6cec50656a00a1793cd4c5878231ea8a8153bdd18b9ea87faf9149d01c6"}},{"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/tools/miri/src/shims/windows/foreign_items.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"08597a2c5055660ca78a94a8d6f8a7c9393afec8964d68110e2bdbb68922bb7c"}},{"ruleId":"D2","level":"warning","message":{"text":"ItemScope::push_res_with_import (cognitive 51): ItemScope::push_res_with_import has cognitive complexity 51 (threshold 15). Drivers by points: if/else 12 (32 pts), match/switch 7 (14 pts), boolean chains 5 (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/tools/rust-analyzer/crates/hir-def/src/item_scope.rs"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"57dec0689de95ed5c024c142a8e391298d7834cc7eaf95687ec0534cc4c49902"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_completion::completions::type::complete_type_path (cognitive 51): ide_completion::completions::type::complete_type_path has cognitive complexity 51 (threshold 15). Drivers by points: if/else 9 (28 pts), match/switch 8 (16 pts), loops 2 (6 pts), boolean chains 1 (nesting depth added 31). 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/tools/rust-analyzer/crates/ide-completion/src/completions/type.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dec92087f21eed2f70182ab73298ff947edfa2a3ebc382175f5c0196b0ecb80"}},{"ruleId":"D2","level":"warning","message":{"text":"syntax_bridge::convert_tokens (cognitive 51): syntax_bridge::convert_tokens has cognitive complexity 51 (threshold 15). Drivers by points: match/switch 8 (24 pts), if/else 4 (15 pts), loops 4 (11 pts), boolean chains 1 (nesting depth added 34). 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/tools/rust-analyzer/crates/syntax-bridge/src/lib.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"19795e67780a297f9a58f60860e30ae76a868b943b698618f01854e78138aa48"}},{"ruleId":"D2","level":"warning","message":{"text":"MirBorrowckCtxt::add_move_hints (cognitive 50): MirBorrowckCtxt::add_move_hints has cognitive complexity 50 (threshold 15). Drivers by points: if/else 14 (33 pts), match/switch 5 (13 pts), boolean chains 4 (nesting depth added 27). 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":"compiler/rustc_borrowck/src/diagnostics/move_errors.rs"},"region":{"startLine":746}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1d30ec5053c78e46308fdc81060725b2e68ea46ed1a9db468bc7ea669478cd2"}},{"ruleId":"D2","level":"warning","message":{"text":"LocalizedConstraintGraph::traverse (cognitive 50): LocalizedConstraintGraph::traverse has cognitive complexity 50 (threshold 15). Drivers by points: if/else 9 (30 pts), loops 6 (19 pts), boolean chains 1 (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/polonius/constraints.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"5caa2ed3246c2485220ef096752d61a5ce2569eb05bd1f3781fdd33285e6e53e"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_codegen_cranelift::constant::mir_operand_get_const_val (cognitive 50): rustc_codegen_cranelift::constant::mir_operand_get_const_val has cognitive complexity 50 (threshold 15). Drivers by points: match/switch 7 (31 pts), if/else 3 (14 pts), loops 2 (5 pts) (nesting depth added 38). 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":"compiler/rustc_codegen_cranelift/src/constant.rs"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"fef3faf23fe1c47e109bfb8e5e5ac8220a803edd83d80f66be620e19db27c43c"}},{"ruleId":"D2","level":"warning","message":{"text":"LinkingFailed::into_diag (cognitive 50): LinkingFailed::into_diag has cognitive complexity 50 (threshold 15). Drivers by points: if/else 17 (40 pts), loops 2 (5 pts), match/switch 2 (5 pts) (nesting depth added 29). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/diagnostics.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"e42791ca40815a9957aa85a7e1050545322a081ba9e7d82d5f8949b661a93b06"}},{"ruleId":"D2","level":"warning","message":{"text":"ValidityVisitor::visit_value (cognitive 50): ValidityVisitor::visit_value has cognitive complexity 50 (threshold 15). Drivers by points: if/else 16 (33 pts), match/switch 7 (14 pts), boolean chains 3 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_const_eval/src/interpret/validity.rs"},"region":{"startLine":1363}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1b461004efc94c88125f7414df285c0fd69c51c89f462f942406101267bf7d8"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_hir_analysis::check::wfcheck::check_gat_where_clauses (cognitive 50): rustc_hir_analysis::check::wfcheck::check_gat_where_clauses has cognitive complexity 50 (threshold 15). Drivers by points: if/else 13 (37 pts), loops 4 (7 pts), match/switch 2 (6 pts) (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/check/wfcheck.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"38e3ae76f6a9f765834f9b442b2fa7a011c940f5018f085905d4297f31b5acd9"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::check_pat_ref (cognitive 50): FnCtxt::check_pat_ref has cognitive complexity 50 (threshold 15). Drivers by points: if/else 14 (35 pts), match/switch 4 (8 pts), boolean chains 7 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/pat.rs"},"region":{"startLine":2792}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0241e23e1a78cc758d5c6c5374c9df8fe147f1f0473833c71c4e9cd3ed39f91"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_arm (cognitive 50): Parser::parse_arm has cognitive complexity 50 (threshold 15). Drivers by points: if/else 19 (42 pts), boolean chains 8 (nesting depth added 23). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/expr.rs"},"region":{"startLine":3068}}}],"partialFingerprints":{"codehealthFindingId/v1":"211adb8b21033ff8c3c732667b5c99016e4e1c7ecc8f85edb18d5d8d44d02f54"}},{"ruleId":"D2","level":"warning","message":{"text":"LateResolutionVisitor::detect_missing_turbofish (cognitive 50): LateResolutionVisitor::detect_missing_turbofish has cognitive complexity 50 (threshold 15). Drivers by points: if/else 15 (36 pts), loops 3 (7 pts), boolean chains 4, match/switch 1 (3 pts) (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":"compiler/rustc_resolve/src/late/diagnostics.rs"},"region":{"startLine":1830}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a6e002e6445b36f5841bd980631009c3a28f0abc7c8189f256fb7e04a1cf287"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeErrCtxt::compare_generics (cognitive 50): TypeErrCtxt::compare_generics has cognitive complexity 50 (threshold 15). Drivers by points: if/else 16 (33 pts), loops 3 (7 pts), match/switch 2 (7 pts), boolean chains 3 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/error_reporting/infer/mod.rs"},"region":{"startLine":980}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b8526d7426deeb59c1929cbaef911405ca791df96a3d875a108bddc1610201a"}},{"ruleId":"D2","level":"warning","message":{"text":"AutoTraitFinder::evaluate_nested_obligations (cognitive 50): AutoTraitFinder::evaluate_nested_obligations has cognitive complexity 50 (threshold 15). Drivers by points: if/else 10 (32 pts), match/switch 5 (15 pts), boolean chains 2, loops 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":"compiler/rustc_trait_selection/src/traits/auto_trait.rs"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"b515b770887681191ad5c638e5ad6be0986bc3b09c5200bf1786fbf6edf0538a"}},{"ruleId":"D2","level":"warning","message":{"text":"compiler_builtins::int::specialized_div_rem::delegate::u128_divide_sparc (cognitive 50): compiler_builtins::int::specialized_div_rem::delegate::u128_divide_sparc has cognitive complexity 50 (threshold 15). Drivers by points: if/else 14 (41 pts), loops 3 (8 pts), match/switch 1 (nesting depth added 32). 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":"library/compiler-builtins/compiler-builtins/src/int/specialized_div_rem/delegate.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"efe1dba1a59dedd64c47f9b8eba8688c52c1cbc804e24a8428ea46e5a856e3f3"}},{"ruleId":"D2","level":"warning","message":{"text":"libm::math::generic::fma::fma_round (cognitive 50): libm::math::generic::fma::fma_round has cognitive complexity 50 (threshold 15). Drivers by points: if/else 30 (49 pts), boolean chains 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":"library/compiler-builtins/libm/src/math/generic/fma.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc26f83a552603e7230dc9bd2bb7436f01e4b2b1caa4e5b643e71874597fc5f6"}},{"ruleId":"D2","level":"warning","message":{"text":"TyLoweringContext::lower_dyn_trait (cognitive 50): TyLoweringContext::lower_dyn_trait has cognitive complexity 50 (threshold 15). Drivers by points: if/else 16 (31 pts), match/switch 5 (13 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/lower.rs"},"region":{"startLine":1034}}}],"partialFingerprints":{"codehealthFindingId/v1":"70869d6f5d669488052e6ddecc30618e95d7ced9ee106ece1e39edb34eebc4d9"}},{"ruleId":"D2","level":"warning","message":{"text":"hir_ty::lower::path::substs_from_args_and_bindings (cognitive 50): hir_ty::lower::path::substs_from_args_and_bindings has cognitive complexity 50 (threshold 15). Drivers by points: if/else 12 (31 pts), loops 3 (10 pts), match/switch 3 (9 pts) (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/lower/path.rs"},"region":{"startLine":1156}}}],"partialFingerprints":{"codehealthFindingId/v1":"87e6b257c3f0563965f2454063d19533565c9c615ef209cbd4bd5e237df36196"}},{"ruleId":"D2","level":"warning","message":{"text":"AnalysisStats::run_body_lowering (cognitive 50): AnalysisStats::run_body_lowering has cognitive complexity 50 (threshold 15). Drivers by points: if/else 20 (37 pts), match/switch 4 (10 pts), loops 3 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/cli/analysis_stats.rs"},"region":{"startLine":1162}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebab29824a740433cc8a5c62d0557f2ca3ccf54f0b6c9b14b6e0ec1b79e2ea90"}},{"ruleId":"D2","level":"warning","message":{"text":"syntax_bridge::to_parser_input::to_parser_input (cognitive 50): syntax_bridge::to_parser_input::to_parser_input has cognitive complexity 50 (threshold 15). Drivers by points: match/switch 9 (31 pts), if/else 5 (16 pts), boolean chains 2, loops 1 (nesting depth added 33). 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/tools/rust-analyzer/crates/syntax-bridge/src/to_parser_input.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"a47a54fcb613d722ed69ce38bb2411699cc750166be542f87e3f29c8168d023f"}},{"ruleId":"D2","level":"warning","message":{"text":"GetOptsOptions::from_matches (cognitive 50): GetOptsOptions::from_matches has cognitive complexity 50 (threshold 15). Drivers by points: if/else 29 (46 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/bin/main.rs"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"a866dadd4fe4e8caf493adf0b68e6563ffbbdee976e94332f052f2c03153163e"}},{"ruleId":"D2","level":"warning","message":{"text":"valueCheck (cognitive 50): valueCheck has cognitive complexity 50 (threshold 15). Drivers by points: if/else 15 (33 pts), loops 5 (10 pts), boolean chains 4, ternaries 1 (3 pts) (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustdoc-js/tester.js"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce6e1471cc1133e05612bb637c6bddfe9697ed97aea233f33c8601dd50ffb866"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_ast_pretty::pprust::state::expr::reconstruct_format_args_template_string (cognitive 49): rustc_ast_pretty::pprust::state::expr::reconstruct_format_args_template_string has cognitive complexity 49 (threshold 15). Drivers by points: if/else 7 (22 pts), match/switch 7 (22 pts), loops 2 (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":"compiler/rustc_ast_pretty/src/pprust/state/expr.rs"},"region":{"startLine":974}}}],"partialFingerprints":{"codehealthFindingId/v1":"0122d768fde065d56bd1fe50660662304844d607be70c40f3bb11a8e20c7f7b4"}},{"ruleId":"D2","level":"warning","message":{"text":"MirBorrowckCtxt::later_use_kind (cognitive 49): MirBorrowckCtxt::later_use_kind has cognitive complexity 49 (threshold 15). Drivers by points: if/else 18 (40 pts), match/switch 3 (8 pts), boolean chains 1 (nesting depth added 27). 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":"compiler/rustc_borrowck/src/diagnostics/explain_borrow.rs"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0d7196496c15d18572c4048d57d6abcdaec749b8879f16f3f70c577bbdcc21d"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::check_argument_types (cognitive 49): FnCtxt::check_argument_types has cognitive complexity 49 (threshold 15). Drivers by points: if/else 21 (37 pts), loops 5 (6 pts), match/switch 2 (4 pts), boolean chains 2 (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":"compiler/rustc_hir_typeck/src/fn_ctxt/checks.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b5bbefccfba52cb75c6ff4ffdfca07d6bc675e85bd174bbc8045498e0d54c60"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::check_expr_block (cognitive 49): FnCtxt::check_expr_block has cognitive complexity 49 (threshold 15). Drivers by points: if/else 14 (46 pts), boolean chains 2, loops 1 (nesting depth added 32). 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":"compiler/rustc_hir_typeck/src/fn_ctxt/checks.rs"},"region":{"startLine":1322}}}],"partialFingerprints":{"codehealthFindingId/v1":"50e114b1051baadbf3f8985b69bb828cd73353fdf8aefa380fc45877dbd3102a"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_middle::ty::typetree::typetree_from_ty_impl_inner (cognitive 49): rustc_middle::ty::typetree::typetree_from_ty_impl_inner has cognitive complexity 49 (threshold 15). Drivers by points: if/else 16 (29 pts), loops 5 (17 pts), match/switch 2 (3 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/ty/typetree.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"a675da7ef5d00658cfd9f740543cd10ca1d077fdea5ded8b3db1441b8ea6e951"}},{"ruleId":"D2","level":"warning","message":{"text":"InterPat::lower_thir_pat (cognitive 49): InterPat::lower_thir_pat has cognitive complexity 49 (threshold 15). Drivers by points: if/else 19 (27 pts), loops 4 (9 pts), match/switch 5 (8 pts), boolean chains 5 (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":"compiler/rustc_mir_build/src/builder/matches/match_pair.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec4d054b6d814da00b1bc76c1ac85ac4fe24d90a9bffffe4d646b331bfd51cd7"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::check_no_chained_comparison (cognitive 49): Parser::check_no_chained_comparison has cognitive complexity 49 (threshold 15). Drivers by points: if/else 14 (35 pts), match/switch 3 (9 pts), boolean chains 5 (nesting depth added 27). 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":"compiler/rustc_parse/src/parser/diagnostics.rs"},"region":{"startLine":1337}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b563c41d2971301677540225fb5f43587ed7cee24f9c1b44cbf51339b120dff"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_session::config::cfg::default_configuration (cognitive 49): rustc_session::config::cfg::default_configuration has cognitive complexity 49 (threshold 15). Drivers by points: if/else 24 (43 pts), loops 3, match/switch 1 (2 pts), boolean chains 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_session/src/config/cfg.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"16d6d28de26a3ffee1b20713273281d3604a4a647a65a476e0a109515c1a3d06"}},{"ruleId":"D2","level":"warning","message":{"text":"std_detect::detect::os::riscv::imply_features (cognitive 49): std_detect::detect::os::riscv::imply_features has cognitive complexity 49 (threshold 15). Drivers by points: if/else 31 (48 pts), loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std_detect/src/detect/os/riscv.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"18bfc99ae30c26e73e35510074031b8da3be462c335b725f4e0e3291a5876592"}},{"ruleId":"D2","level":"warning","message":{"text":"std_detect::detect::os::x86::detect_features (cognitive 49): std_detect::detect::os::x86::detect_features has cognitive complexity 49 (threshold 15). Drivers by points: if/else 20 (45 pts), boolean chains 4 (nesting depth added 25). 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":"library/std_detect/src/detect/os/x86.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"be0d53c751f092ad77e94c3e5dfed018952510de5b865e79810b33417d6e5294"}},{"ruleId":"D2","level":"warning","message":{"text":"rustdoc::clean::clean_middle_assoc_item (cognitive 49): rustdoc::clean::clean_middle_assoc_item has cognitive complexity 49 (threshold 15). Drivers by points: match/switch 9 (25 pts), if/else 10 (22 pts), boolean chains 2 (nesting depth added 28). Of this number, 44 points are the body\u0027s own statements and 5 belong to one function item inside it that branches. 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/librustdoc/clean/mod.rs"},"region":{"startLine":1386}}}],"partialFingerprints":{"codehealthFindingId/v1":"10a4ccd4250b1b8e2e048e949bf321dc530f5c4adf0d2398c12370df2e8d8b68"}},{"ruleId":"D2","level":"warning","message":{"text":"SingleComponentPathImports::track_uses (cognitive 49): SingleComponentPathImports::track_uses has cognitive complexity 49 (threshold 15). Drivers by points: if/else 12 (38 pts), loops 2 (8 pts), boolean chains 2, match/switch 1 (nesting depth added 32). 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/tools/clippy/clippy_lints/src/single_component_path_imports.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c12a2db86e1961292de546b04f6ede4fef71ae793e325dd8e2210d76071c9d4"}},{"ruleId":"D2","level":"warning","message":{"text":"unicode_table_generator::load_data (cognitive 49): unicode_table_generator::load_data has cognitive complexity 49 (threshold 15). Drivers by points: if/else 21 (35 pts), loops 8, boolean chains 3, match/switch 1 (3 pts) (nesting depth added 16). Of this number, 46 points are the body\u0027s own statements and 3 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/tools/unicode-table-generator/src/main.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"572636774671faa92326de2bd2d8013eedbb48c82205c29d465834bc6bf52161"}},{"ruleId":"D2","level":"warning","message":{"text":"bootstrap.default_build_triple (cognitive 49): bootstrap.default_build_triple has cognitive complexity 49 (threshold 15). Drivers by points: if/else 28 (44 pts), boolean chains 3, error handling 1 (2 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/bootstrap.py"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"0109018b2b9644688310b81d4150c8e4ca841546499e222917b2ee950adb11a7"}},{"ruleId":"D2","level":"warning","message":{"text":"RoaringBitmap.union (cognitive 49): RoaringBitmap.union has cognitive complexity 49 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 14, loops 4 (13 pts), ternaries 1 (4 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/stringdex.js"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd10ea1a9e310e386f0651b643c97b24e11d66bcb4e28007ee2105ee2e3e8d52"}},{"ruleId":"D2","level":"warning","message":{"text":"initSearch::execQuery::unifyFunctionTypeIsMatchCandidate (cognitive 49): initSearch::execQuery::unifyFunctionTypeIsMatchCandidate has cognitive complexity 49 (threshold 15). Drivers by points: if/else 15 (31 pts), boolean chains 12, loops 1 (3 pts), ternaries 1 (3 pts) (nesting depth added 20). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":3565}}}],"partialFingerprints":{"codehealthFindingId/v1":"3845b7c4a98941df69644f001f6c2c69e53d8fe2f8101d6a99e09585b94e923a"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionCx::compute_per_local_var_debug_info (cognitive 48): FunctionCx::compute_per_local_var_debug_info has cognitive complexity 48 (threshold 15). Drivers by points: if/else 20 (37 pts), match/switch 3 (8 pts), boolean chains 2, loops 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/mir/debuginfo.rs"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"bad040928262d50331620e9c9b3b2817b60f7c1275ee52fa06443af0edcd38f9"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_codegen_ssa::back::link::linker_with_args (cognitive 48): rustc_codegen_ssa::back::link::linker_with_args has cognitive complexity 48 (threshold 15). Drivers by points: if/else 19 (29 pts), loops 6 (13 pts), match/switch 1 (4 pts), boolean chains 2 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/back/link.rs"},"region":{"startLine":2910}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5fa79c488f7ab7396942beae031041c3ecec89e1fbc0b0617ed0237638a03bf"}},{"ruleId":"D2","level":"warning","message":{"text":"Resolver::visit_scopes (cognitive 48): Resolver::visit_scopes has cognitive complexity 48 (threshold 15). Drivers by points: match/switch 11 (24 pts), if/else 6 (14 pts), boolean chains 6, loops 2 (4 pts) (nesting depth added 23). 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":"compiler/rustc_resolve/src/ident.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"da194b8ebd85c40c8fe8545ee7a3d26f9fa0e2843133cb4b8d9e5d08162f09b2"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_path_segment_with_path_span (cognitive 48): Parser::parse_path_segment_with_path_span has cognitive complexity 48 (threshold 15). Drivers by points: if/else 16 (32 pts), boolean chains 11, match/switch 2 (5 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/path.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b10dea18cec5ed8652bb754b3e57cce7303d9f5b771a6005b3405414298a231"}},{"ruleId":"D2","level":"warning","message":{"text":"LateResolutionVisitor::suggest_introducing_lifetime_filtered (cognitive 48): LateResolutionVisitor::suggest_introducing_lifetime_filtered has cognitive complexity 48 (threshold 15). Drivers by points: if/else 13 (35 pts), loops 2 (6 pts), boolean chains 5, match/switch 1 (2 pts) (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":"compiler/rustc_resolve/src/late/diagnostics.rs"},"region":{"startLine":4323}}}],"partialFingerprints":{"codehealthFindingId/v1":"733528a69adc6dcc4d26428070ddc506284f5b01720fedd196a82e49fcdc5ec2"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeErrCtxt::cmp (cognitive 48): TypeErrCtxt::cmp has cognitive complexity 48 (threshold 15). Drivers by points: if/else 23 (40 pts), boolean chains 3, match/switch 2 (3 pts), loops 1 (2 pts) (nesting depth added 19). Of this number, 42 points are the body\u0027s own statements and 6 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/error_reporting/infer/mod.rs"},"region":{"startLine":1129}}}],"partialFingerprints":{"codehealthFindingId/v1":"29058aed08fc43219ed10ad3faa5ba6ea56459cffc73ee27c7d265e66ab8d96a"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepRejectCtxt::types_may_unify_inner (cognitive 48): DeepRejectCtxt::types_may_unify_inner has cognitive complexity 48 (threshold 15). Drivers by points: match/switch 16 (30 pts), boolean chains 14, if/else 3 (4 pts) (nesting depth added 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. 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":"compiler/rustc_type_ir/src/fast_reject.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"9565d399351ccb46ddacf4722b141a1a21791eb4055b847d385c0751970287e6"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::methods::map_clone::check (cognitive 48): clippy_lints::methods::map_clone::check has cognitive complexity 48 (threshold 15). Drivers by points: if/else 8 (34 pts), match/switch 3 (9 pts), boolean chains 5 (nesting depth added 32). 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/tools/clippy/clippy_lints/src/methods/map_clone.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3c4150549d331d5e1c4130dc6f3e6d0e1c5d90ffffedba484f8ff04d8c1e2fd"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::methods::unnecessary_to_owned::can_change_type (cognitive 48): clippy_lints::methods::unnecessary_to_owned::can_change_type has cognitive complexity 48 (threshold 15). Drivers by points: if/else 11 (42 pts), boolean chains 3, match/switch 1 (2 pts), loops 1 (nesting depth added 32). 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/tools/clippy/clippy_lints/src/methods/unnecessary_to_owned.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fc079b8d81df8e8b53af511b9d9b21c9d8b30e917dc3255163f10e0b8ee1d04"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::methods::unwrap_expect_used::check (cognitive 48): clippy_lints::methods::unwrap_expect_used::check has cognitive complexity 48 (threshold 15). Drivers by points: if/else 16 (37 pts), boolean chains 6, loops 2 (4 pts), match/switch 1 (nesting depth added 23). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/methods/unwrap_expect_used.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"bee6557b93c53ce69086923ead7e0af131a30a25f83d3f9c2214eb85aff3dcb8"}},{"ruleId":"D2","level":"warning","message":{"text":"SymbolCollector::collect_from_module (cognitive 48): SymbolCollector::collect_from_module has cognitive complexity 48 (threshold 15). Drivers by points: if/else 12 (17 pts), match/switch 9 (16 pts), loops 8 (10 pts), boolean chains 5 (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/tools/rust-analyzer/crates/hir/src/symbols.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"242ce229383f06afabd4cc981498adc35c9a1f48bffc1cd33a682afc962cbd40"}},{"ruleId":"D2","level":"warning","message":{"text":"ImportMap::collect_import_map (cognitive 48): ImportMap::collect_import_map has cognitive complexity 48 (threshold 15). Drivers by points: if/else 10 (22 pts), match/switch 4 (20 pts), loops 3 (6 pts) (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/import_map.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9dea0baf577f03f3b62382a2bd1dbd2c29820aa8f5c9c1146a3cb5e4cab049d"}},{"ruleId":"D2","level":"warning","message":{"text":"InferenceContext::check_call_arguments (cognitive 48): InferenceContext::check_call_arguments has cognitive complexity 48 (threshold 15). Drivers by points: if/else 17 (28 pts), match/switch 5 (15 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/infer/expr.rs"},"region":{"startLine":1920}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fc7dc3187a523d720d06b90279a49444aa6858d468634e6dc60a427a41c0e17"}},{"ruleId":"D2","level":"warning","message":{"text":"hir_ty::lower::resolve_type_param_assoc_type_shorthand (cognitive 48): hir_ty::lower::resolve_type_param_assoc_type_shorthand has cognitive complexity 48 (threshold 15). Drivers by points: if/else 15 (36 pts), match/switch 2 (7 pts), loops 2 (3 pts), boolean chains 2 (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/tools/rust-analyzer/crates/hir-ty/src/lower.rs"},"region":{"startLine":2114}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebb260c91bbd0a80a8d385de2e980f7743b2ae652fa8b2b6edbaad3afdfdbb6d"}},{"ruleId":"D2","level":"warning","message":{"text":"CharClasses::next (cognitive 48): CharClasses::next has cognitive complexity 48 (threshold 15). Drivers by points: match/switch 13 (29 pts), if/else 10 (16 pts), boolean chains 3 (nesting depth added 22). 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/tools/rustfmt/src/comment.rs"},"region":{"startLine":1394}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc9c3b723fce22d803cabf028313d494c9cd78cf8783fdeb5857568935ddcd3e"}},{"ruleId":"D2","level":"warning","message":{"text":"FmtVisitor::close_block (cognitive 48): FmtVisitor::close_block has cognitive complexity 48 (threshold 15). Drivers by points: if/else 10 (24 pts), match/switch 5 (17 pts), boolean chains 6, loops 1 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/visitor.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"651a4e06858c57c6981b004df00b39af6e422c8da84e7717426db49353f8f02c"}},{"ruleId":"D2","level":"warning","message":{"text":"check_intrinsics_duplicates.check_duplicates (cognitive 48): check_intrinsics_duplicates.check_duplicates has cognitive complexity 48 (threshold 15). Drivers by points: if/else 10 (30 pts), loops 4 (10 pts), ternaries 2 (8 pts) (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_gcc/tools/check_intrinsics_duplicates.py"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ce50905fcf9006a41e834f21416efdd67297772a9fb70813da1d949ef88fd75"}},{"ruleId":"D2","level":"warning","message":{"text":"check_lldb.var_matches (cognitive 48): check_lldb.var_matches has cognitive complexity 48 (threshold 15). Drivers by points: if/else 20 (33 pts), boolean chains 6, error handling 2 (6 pts), loops 2 (3 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/etc/debugger_tester/lldb/check_lldb.py"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f942b4dd50b66579f34d05f42619893998122c93cd90bd03e06d9e2d4649ebd"}},{"ruleId":"D2","level":"warning","message":{"text":"DocSearch.execQuery::unifyFunctionTypeIsMatchCandidate (cognitive 48): DocSearch.execQuery::unifyFunctionTypeIsMatchCandidate has cognitive complexity 48 (threshold 15). Drivers by points: if/else 15 (31 pts), boolean chains 11, loops 1 (3 pts), ternaries 1 (3 pts) (nesting depth added 20). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This shape REPEATS in the file: 7 other methods here (DocSearch.execQuery::buildHrefAndPath, DocSearch.execQuery::formatDisplayTypeSignature::writeFn, DocSearch.execQuery::transformResults, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":3565}}}],"partialFingerprints":{"codehealthFindingId/v1":"be57fa4cbc30959b35c6161254ee2ed22b0d62a2542e36365fb744b090ee6e79"}},{"ruleId":"D2","level":"warning","message":{"text":"search.initSearch::getIdentEndPosition (cognitive 48): search.initSearch::getIdentEndPosition has cognitive complexity 48 (threshold 15). Drivers by points: if/else 18 (41 pts), loops 2 (5 pts), boolean chains 2 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 15 other methods here (search.initSearch, search.initSearch::getItemsBefore, search.initSearch::getNextElem, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 16 times rather than 16 independent problems. Splitting this body alone leaves the other 15 exactly as they are. Where these are variations on one operation, the change that clears all 16 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":972}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b7435b2f6cdc6c9f9d34e3f38dec33764038045ca1d332994d2db9ccf406b55"}},{"ruleId":"D2","level":"warning","message":{"text":"search.initSearch::unifyFunctionTypeIsMatchCandidate (cognitive 48): search.initSearch::unifyFunctionTypeIsMatchCandidate has cognitive complexity 48 (threshold 15). Drivers by points: if/else 15 (31 pts), boolean chains 11, loops 1 (3 pts), ternaries 1 (3 pts) (nesting depth added 20). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This shape REPEATS in the file: 15 other methods here (search.initSearch, search.initSearch::getItemsBefore, search.initSearch::getNextElem, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 16 times rather than 16 independent problems. Splitting this body alone leaves the other 15 exactly as they are. Where these are variations on one operation, the change that clears all 16 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":3565}}}],"partialFingerprints":{"codehealthFindingId/v1":"f81bb5e3e217aab713985e75d96a095c3b766466ffe7a97303b3cb463001014d"}},{"ruleId":"D2","level":"warning","message":{"text":"DocParser::parse_auto_cfg (cognitive 47): DocParser::parse_auto_cfg has cognitive complexity 47 (threshold 15). Drivers by points: if/else 7 (27 pts), match/switch 4 (12 pts), loops 3 (8 pts) (nesting depth added 33). 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":"compiler/rustc_attr_parsing/src/attributes/doc.rs"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff0fd8f4493e59a650e2522b39dfd60bfff28ae3c1ae31a07d6101eb0b81a233"}},{"ruleId":"D2","level":"warning","message":{"text":"MirBorrowckCtxt::describe_place_with_options (cognitive 47): MirBorrowckCtxt::describe_place_with_options has cognitive complexity 47 (threshold 15). Drivers by points: if/else 13 (39 pts), match/switch 2 (7 pts), loops 1 (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/diagnostics/mod.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f5111633c0ea3b309f25d3c775bacdf4197f094550007505299c5d6fe47c97e"}},{"ruleId":"D2","level":"warning","message":{"text":"Builder::cfi_type_test (cognitive 47): Builder::cfi_type_test has cognitive complexity 47 (threshold 15). Drivers by points: if/else 20 (38 pts), boolean chains 3, loops 1 (3 pts), match/switch 1 (3 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/builder.rs"},"region":{"startLine":1968}}}],"partialFingerprints":{"codehealthFindingId/v1":"05b8ad3b39fbba1e0cb8f674a4586c02fbe2562e60c128cecf2100a3d77e3737"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionCx::codegen_rvalue (cognitive 47): FunctionCx::codegen_rvalue has cognitive complexity 47 (threshold 15). Drivers by points: if/else 17 (37 pts), match/switch 3 (5 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 23). 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":"compiler/rustc_codegen_ssa/src/mir/rvalue.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"52b0e0f0f453d750efe285ac7c4012faed67e680f6a99e580025d8ae500e74af"}},{"ruleId":"D2","level":"warning","message":{"text":"DiagCtxtInner::emit_diagnostic (cognitive 47): DiagCtxtInner::emit_diagnostic has cognitive complexity 47 (threshold 15). Drivers by points: if/else 22 (39 pts), match/switch 3 (5 pts), boolean chains 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":"compiler/rustc_errors/src/lib.rs"},"region":{"startLine":1145}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4b04301548af5a522706124884dd71e841103661352d63b49365ba67a625f2e"}},{"ruleId":"D2","level":"warning","message":{"text":"LateResolutionVisitor::resolve_elided_lifetimes_in_path (cognitive 47): LateResolutionVisitor::resolve_elided_lifetimes_in_path has cognitive complexity 47 (threshold 15). Drivers by points: loops 7 (22 pts), if/else 9 (16 pts), match/switch 3 (7 pts), boolean chains 2 (nesting depth added 26). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/late.rs"},"region":{"startLine":2331}}}],"partialFingerprints":{"codehealthFindingId/v1":"91f2fd41764a046ed76d9d268c66c7a873ce400ebcd49e98b598f4e2afe4d4f3"}},{"ruleId":"D2","level":"warning","message":{"text":"libm::math::jn::jn (cognitive 47): libm::math::jn::jn has cognitive complexity 47 (threshold 15). Drivers by points: if/else 20 (27 pts), loops 6 (16 pts), match/switch 1 (3 pts), boolean chains 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":"library/compiler-builtins/libm/src/math/jn.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"8550b15f4e74f5c11e63e1821f200d7b6f09d27ae9c0bd91043200ef7e2fd90e"}},{"ruleId":"D2","level":"warning","message":{"text":"rustdoc::clean::inline::build_impl (cognitive 47): rustdoc::clean::inline::build_impl has cognitive complexity 47 (threshold 15). Drivers by points: if/else 19 (28 pts), boolean chains 9, match/switch 5 (8 pts), loops 1 (2 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/clean/inline.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"43d31195f24d5c370000c4ee61b1b3359bbe6e7bbb6e5fd0adbccc2f43c1f844"}},{"ruleId":"D2","level":"warning","message":{"text":"NewWithoutDefault::check_item (cognitive 47): NewWithoutDefault::check_item has cognitive complexity 47 (threshold 15). Drivers by points: if/else 11 (32 pts), loops 4 (12 pts), boolean chains 3 (nesting depth added 29). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/new_without_default.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"32db64e6b0aa4b124197500366fa98aa911997888cd8546aba5fdcb4d3df14a8"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::operators::assign_op_pattern::check (cognitive 47): clippy_lints::operators::assign_op_pattern::check has cognitive complexity 47 (threshold 15). Drivers by points: if/else 13 (37 pts), boolean chains 6, match/switch 1 (4 pts) (nesting depth added 27). 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/tools/clippy/clippy_lints/src/operators/assign_op_pattern.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a09d24d1c61bcbdab5de61c4427135f289c6069d1a26fa57da99d0af0a6cb3a"}},{"ruleId":"D2","level":"warning","message":{"text":"SpanlessHash::hash_expr (cognitive 47): SpanlessHash::hash_expr has cognitive complexity 47 (threshold 15). Drivers by points: if/else 13 (30 pts), loops 5 (10 pts), match/switch 3 (7 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_utils/src/hir_utils.rs"},"region":{"startLine":1181}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f0933bbedca85747ed72530fc1ca4f3f6d49b0e52d4ac76af05a82c7942b4b8"}},{"ruleId":"D2","level":"warning","message":{"text":"ide::inlay_hints::implicit_drop::hints (cognitive 47): ide::inlay_hints::implicit_drop::hints has cognitive complexity 47 (threshold 15). Drivers by points: match/switch 6 (24 pts), if/else 8 (22 pts), loops 1 (nesting depth added 32). 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/tools/rust-analyzer/crates/ide/src/inlay_hints/implicit_drop.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"b48a5ed8de34641088db1907d1d0dfb7716a17e2904372ae65df56a5b5ead522"}},{"ruleId":"D2","level":"warning","message":{"text":"Module::get_usages_and_record_fields (cognitive 47): Module::get_usages_and_record_fields has cognitive complexity 47 (threshold 15). Drivers by points: if/else 10 (34 pts), match/switch 3 (12 pts), loops 1 (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/tools/rust-analyzer/crates/ide-assists/src/handlers/extract_module.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9a51d6a79cf14bdbda7c93630236ab9e114ef59f0c2ebdb0969202fad3734ae"}},{"ruleId":"D2","level":"warning","message":{"text":"htmldocck.check_command (cognitive 47): htmldocck.check_command has cognitive complexity 47 (threshold 15). Drivers by points: if/else 17 (30 pts), error handling 5 (12 pts), boolean chains 3, ternaries 1 (2 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/etc/htmldocck.py"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fb21c21b6ddad77c9d76842153b5d84147c92e6837601f71f1b1f554eba1fc8"}},{"ruleId":"D2","level":"warning","message":{"text":"DocSearch.execQuery::formatDisplayTypeSignature::writeFn (cognitive 47): DocSearch.execQuery::formatDisplayTypeSignature::writeFn has cognitive complexity 47 (threshold 15). Drivers by points: if/else 15 (30 pts), loops 2 (6 pts), ternaries 2 (6 pts), boolean chains 5 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 7 other methods here (DocSearch.execQuery::buildHrefAndPath, DocSearch.execQuery::transformResults, DocSearch.execQuery::unifyFunctionTypes, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":2538}}}],"partialFingerprints":{"codehealthFindingId/v1":"d002749a1d50d9bf00e23ef2ef850a8f7aa1c272a89cf35ec5ae63516af60f78"}},{"ruleId":"D2","level":"warning","message":{"text":"search.initSearch::formatDisplayTypeSignature::writeFn (cognitive 47): search.initSearch::formatDisplayTypeSignature::writeFn has cognitive complexity 47 (threshold 15). Drivers by points: if/else 15 (30 pts), loops 2 (6 pts), ternaries 2 (6 pts), boolean chains 5 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 15 other methods here (search.initSearch, search.initSearch::getItemsBefore, search.initSearch::getNextElem, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 16 times rather than 16 independent problems. Splitting this body alone leaves the other 15 exactly as they are. Where these are variations on one operation, the change that clears all 16 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":2538}}}],"partialFingerprints":{"codehealthFindingId/v1":"93a0bfc7840cf29865d638fc6883e65731913463d834d6a0c2e6a0c4a8ee50ee"}},{"ruleId":"D2","level":"warning","message":{"text":"initSearch::execQuery::formatDisplayTypeSignature::writeFn (cognitive 47): initSearch::execQuery::formatDisplayTypeSignature::writeFn has cognitive complexity 47 (threshold 15). Drivers by points: if/else 15 (30 pts), loops 2 (6 pts), ternaries 2 (6 pts), boolean chains 5 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":2538}}}],"partialFingerprints":{"codehealthFindingId/v1":"095d26fc131f73f5b33eb35ceb156deb925516b1e66a7e9b6168ad967f478afa"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 47): constructor has cognitive complexity 47 (threshold 15). Drivers by points: if/else 18 (25 pts), loops 6 (11 pts), ternaries 4 (6 pts), boolean chains 5 (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/librustdoc/html/static/js/stringdex.js"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"80b662f76a1c67de822b4e93f11b1368bf90ad90801515e8b9bd438d8024e1e8"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_attr_parsing::check_cfg::unexpected_cfg_name (cognitive 46): rustc_attr_parsing::check_cfg::unexpected_cfg_name has cognitive complexity 46 (threshold 15). Drivers by points: if/else 28 (39 pts), boolean chains 5, match/switch 1 (2 pts) (nesting depth added 12). Of this number, 43 points are the body\u0027s own statements and 3 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":"compiler/rustc_attr_parsing/src/check_cfg.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dc85606886b37b43036660b1ce02928bff04fb70e1f9564fa01037a9bf21369"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_hir_analysis::hir_ty_lowering::generics::lower_generic_args (cognitive 46): rustc_hir_analysis::hir_ty_lowering::generics::lower_generic_args has cognitive complexity 46 (threshold 15). Drivers by points: if/else 8 (27 pts), loops 5 (11 pts), match/switch 2 (7 pts), boolean chains 1 (nesting depth added 30). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/hir_ty_lowering/generics.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"13da0f12593806a5529de405186cff93f5556903387152c19642c921f42c71d7"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::check_expr_offset_of (cognitive 46): FnCtxt::check_expr_offset_of has cognitive complexity 46 (threshold 15). Drivers by points: if/else 15 (42 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/expr.rs"},"region":{"startLine":3857}}}],"partialFingerprints":{"codehealthFindingId/v1":"c80ae4f97e8fd3b561c91aa7b48b0cce60803ada8e73d48182a2507ec2cc6330"}},{"ruleId":"D2","level":"warning","message":{"text":"Resolver::throw_unresolved_import_error (cognitive 46): Resolver::throw_unresolved_import_error has cognitive complexity 46 (threshold 15). Drivers by points: if/else 21 (31 pts), loops 4 (6 pts), match/switch 3 (6 pts), boolean chains 3 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/diagnostics/impls.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2ad2d457d42a00dc8701a8f2f5342ef0192f218b61c427c6d1a5244230eafee"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_macros::query::parse_query_modifiers (cognitive 46): rustc_macros::query::parse_query_modifiers has cognitive complexity 46 (threshold 15). Drivers by points: if/else 23 (45 pts), loops 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_macros/src/query.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f4308027e073caef4f92d8ad18aed79df7373645ce9c8e50ca1efd649754c66"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_middle::mir::pretty::write_scope_tree (cognitive 46): rustc_middle::mir::pretty::write_scope_tree has cognitive complexity 46 (threshold 15). Drivers by points: if/else 21 (37 pts), loops 5 (8 pts), boolean chains 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":"compiler/rustc_middle/src/mir/pretty.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"9634e8142f885cc683485a9f00c5b369e62041b93f1974cdd04e003128b69b2b"}},{"ruleId":"D2","level":"warning","message":{"text":"VnState::eval_to_const_inner (cognitive 46): VnState::eval_to_const_inner has cognitive complexity 46 (threshold 15). Drivers by points: if/else 17 (30 pts), match/switch 4 (9 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/gvn.rs"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca9d8917cb7de7146747449dc452a64b2b8ea542f821d213de60b262ea8c30fe"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_mir_transform::ref_prop::compute_replacement (cognitive 46): rustc_mir_transform::ref_prop::compute_replacement has cognitive complexity 46 (threshold 15). Drivers by points: if/else 19 (35 pts), boolean chains 6, loops 3, match/switch 1 (2 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/ref_prop.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"c67a031be3f56928fbe43a64c3d5814a4f5b5392da8ede5bb1bbb0165dedcc2d"}},{"ruleId":"D2","level":"warning","message":{"text":"compiler_builtins::float::div::div (cognitive 46): compiler_builtins::float::div::div has cognitive complexity 46 (threshold 15). Drivers by points: if/else 24 (37 pts), boolean chains 5, loops 2 (4 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/compiler-builtins/compiler-builtins/src/float/div.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"37f01bcbab935d0b105b95cc4f81af05d7cad33959aeec3848fefda83603d673"}},{"ruleId":"D2","level":"warning","message":{"text":"TagParser::extract_opening_tag (cognitive 46): TagParser::extract_opening_tag has cognitive complexity 46 (threshold 15). Drivers by points: if/else 16 (36 pts), boolean chains 6, loops 1 (2 pts), match/switch 1 (2 pts) (nesting depth added 22). 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/librustdoc/passes/lint/html_tags.rs"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"3704f57d310b157c90a784d47ebf8ce986a985d0030a3cf8ce23b869051c30ac"}},{"ruleId":"D2","level":"warning","message":{"text":"rustdoc::html::render::print_item::compare_names (cognitive 46): rustdoc::html::render::print_item::compare_names has cognitive complexity 46 (threshold 15). Drivers by points: match/switch 6 (20 pts), if/else 5 (16 pts), loops 3 (9 pts), boolean chains 1 (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/render/print_item.rs"},"region":{"startLine":2226}}}],"partialFingerprints":{"codehealthFindingId/v1":"adfe05506cd3a3c327bf0cb75b5685b06b5ddf698e0e5e60524a2664278ef8fb"}},{"ruleId":"D2","level":"warning","message":{"text":"rustdoc::html::render::print_item::render_struct_fields (cognitive 46): rustdoc::html::render::print_item::render_struct_fields has cognitive complexity 46 (threshold 15). Drivers by points: if/else 17 (34 pts), loops 2 (5 pts), match/switch 2 (5 pts), boolean chains 2 (nesting depth added 23). 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/librustdoc/html/render/print_item.rs"},"region":{"startLine":2545}}}],"partialFingerprints":{"codehealthFindingId/v1":"010ef0d1773e7b94a7dbabb78a0148ea105028a7dbfac55eb8a78957ea6d710a"}},{"ruleId":"D2","level":"warning","message":{"text":"hir_def::attrs::match_attr_flags (cognitive 46): hir_def::attrs::match_attr_flags has cognitive complexity 46 (threshold 15). Drivers by points: match/switch 11 (31 pts), if/else 6 (13 pts), boolean chains 2 (nesting depth added 27). 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/tools/rust-analyzer/crates/hir-def/src/attrs.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5cc1b6aa0dc7f6cdca470b9956e368471971a69082a22787f1d7ccebeaf647c"}},{"ruleId":"D2","level":"warning","message":{"text":"hir_ty::next_solver::consts::valtree::allocation_to_const (cognitive 46): hir_ty::next_solver::consts::valtree::allocation_to_const has cognitive complexity 46 (threshold 15). Drivers by points: if/else 15 (38 pts), match/switch 4 (8 pts) (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/tools/rust-analyzer/crates/hir-ty/src/next_solver/consts/valtree.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"82dc8c160cb87fb708434f0905886f86e185bca90adf7162a9fbd85ee6efb344"}},{"ruleId":"D2","level":"warning","message":{"text":"Ctx::transform_path_ (cognitive 46): Ctx::transform_path_ has cognitive complexity 46 (threshold 15). Drivers by points: if/else 18 (36 pts), boolean chains 5, match/switch 2 (5 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-db/src/path_transform.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0e9ed60eb09381313a3867e5db392c26cc4509202e6c76c29ffb4571025aef7"}},{"ruleId":"D2","level":"warning","message":{"text":"rustfmt_nightly::expr::format_expr (cognitive 46): rustfmt_nightly::expr::format_expr has cognitive complexity 46 (threshold 15). Drivers by points: if/else 24 (37 pts), match/switch 5 (8 pts), boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/expr.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ed43b8d1ce409d83dd88238f79c8f499c92ce189ec3abc2d9622af61be54027"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_ast_lowering::delegation::resolution::resolve_type_relative_delegations (cognitive 45): rustc_ast_lowering::delegation::resolution::resolve_type_relative_delegations has cognitive complexity 45 (threshold 15). Drivers by points: match/switch 5 (20 pts), if/else 4 (12 pts), loops 3 (12 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":"compiler/rustc_ast_lowering/src/delegation/resolution.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"467a9ee31ead8954beda9549c0d669568914455fa21fab1f60db35be4b258b3e"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_codegen_cranelift::global_asm::codegen_global_asm_inner (cognitive 45): rustc_codegen_cranelift::global_asm::codegen_global_asm_inner has cognitive complexity 45 (threshold 15). Drivers by points: if/else 11 (30 pts), match/switch 4 (14 pts), loops 1 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/src/global_asm.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf8ce2db229e0717648ed5d3d30552ed484dde9522492f3fb350e862e0d59414"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::blame_specific_part_of_expr_corresponding_to_generic_param (cognitive 45): FnCtxt::blame_specific_part_of_expr_corresponding_to_generic_param has cognitive complexity 45 (threshold 15). Drivers by points: if/else 22 (41 pts), match/switch 2 (4 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/fn_ctxt/adjust_fulfillment_errors.rs"},"region":{"startLine":875}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4d587605bf806663248744798c76e7741cc05827496eec9656b2151828fa67a"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::check_tupled_arguments (cognitive 45): FnCtxt::check_tupled_arguments has cognitive complexity 45 (threshold 15). Drivers by points: if/else 27 (41 pts), boolean chains 4 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/fn_ctxt/checks.rs"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"213c2fdd77f3f23815187eb5ebed3f9dcc2a2c98e2c136f8e831b677fd61db4b"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::ranges::check_possible_range_contains (cognitive 45): clippy_lints::ranges::check_possible_range_contains has cognitive complexity 45 (threshold 15). Drivers by points: if/else 20 (40 pts), boolean chains 4, match/switch 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/ranges.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"50938b84503090ae7f5b1a84c16911d870c63cca7ad35dbaf3ec7a479c509981"}},{"ruleId":"D2","level":"warning","message":{"text":"Evaluator::exec_simd_intrinsic (cognitive 45): Evaluator::exec_simd_intrinsic has cognitive complexity 45 (threshold 15). Drivers by points: if/else 10 (24 pts), match/switch 5 (11 pts), loops 4 (9 pts), boolean chains 1 (nesting depth added 25). 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/tools/rust-analyzer/crates/hir-ty/src/mir/eval/shim/simd.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ad9c14d726720b0fbce79d2dbfa398024ab72b27e4b7f2353eb598dab621f8c"}},{"ruleId":"D2","level":"warning","message":{"text":"TokenStream::from_str (cognitive 45): TokenStream::from_str has cognitive complexity 45 (threshold 15). Drivers by points: if/else 20 (41 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/proc-macro-srv/src/token_stream.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"a439b19167afed4fdc062aa5353d5170666b000a5109aca134a9621e8bf4e0a9"}},{"ruleId":"D2","level":"warning","message":{"text":"Config::apply_change_with_sink (cognitive 45): Config::apply_change_with_sink has cognitive complexity 45 (threshold 15). Drivers by points: if/else 10 (21 pts), match/switch 5 (17 pts), loops 2 (5 pts), boolean chains 2 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/config.rs"},"region":{"startLine":1209}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf25077f95cc8261ff5f543eaa8895761df1f59e0dce268ef5f8aec12dc4cc57"}},{"ruleId":"D2","level":"warning","message":{"text":"rust_analyzer::lsp::to_proto::completion_item (cognitive 45): rust_analyzer::lsp::to_proto::completion_item has cognitive complexity 45 (threshold 15). Drivers by points: if/else 30 (38 pts), boolean chains 5, loops 1 (2 pts) (nesting depth added 9). Of this number, 43 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/lsp/to_proto.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"63edc2786cdc7ed329e29e16a206aee04c619ce8953cd239cc82e4bcfffd618c"}},{"ruleId":"D2","level":"warning","message":{"text":"MirBorrowckCtxt::suggest_map_index_mut_alternatives (cognitive 44): MirBorrowckCtxt::suggest_map_index_mut_alternatives has cognitive complexity 44 (threshold 15). Drivers by points: if/else 15 (31 pts), match/switch 2 (5 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 21). Of this number, 37 points are the body\u0027s own statements and 7 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":"compiler/rustc_borrowck/src/diagnostics/mutability_errors.rs"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"520d30a9ae71908b299bd64f832c71965e6d3896bc6cedcf1f7fac369f495c33"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_codegen_llvm::back::write::llvm_optimize (cognitive 44): rustc_codegen_llvm::back::write::llvm_optimize has cognitive complexity 44 (threshold 15). Drivers by points: if/else 22 (30 pts), match/switch 3 (6 pts), boolean chains 4, loops 3 (4 pts) (nesting depth added 12). Of this number, 38 points are the body\u0027s own statements and 6 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":"compiler/rustc_codegen_llvm/src/back/write.rs"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"73a1fb000fa6a9e92ef95a220b080b8158d8e70aae0f13580d26a2122839519c"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_hir_analysis::coherence::orphan::emit_orphan_check_error (cognitive 44): rustc_hir_analysis::coherence::orphan::emit_orphan_check_error has cognitive complexity 44 (threshold 15). Drivers by points: if/else 13 (33 pts), match/switch 3 (6 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 25). 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":"compiler/rustc_hir_analysis/src/coherence/orphan.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"9019bc7ffd50e8918ee0403d7334648376b93f839ed1185e7069eebb7d205395"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::report_invalid_callee (cognitive 44): FnCtxt::report_invalid_callee has cognitive complexity 44 (threshold 15). Drivers by points: if/else 15 (23 pts), match/switch 6 (12 pts), boolean chains 7, loops 1 (2 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/callee.rs"},"region":{"startLine":927}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c97439f004f9b7d90b2fc6fdb64cacc2f4ce9c6ba1c23c1ac44028e301a5062"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::report_failed_method_call_on_range_end (cognitive 44): FnCtxt::report_failed_method_call_on_range_end has cognitive complexity 44 (threshold 15). Drivers by points: if/else 7 (24 pts), match/switch 4 (18 pts), loops 1 (2 pts) (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/method/suggest.rs"},"region":{"startLine":2889}}}],"partialFingerprints":{"codehealthFindingId/v1":"28ea3930fd8689e5c1537b0a92ca62d1c076f97696c7b5d8b4e10ef3727a1536"}},{"ruleId":"D2","level":"warning","message":{"text":"Resolver::smart_resolve_macro_path (cognitive 44): Resolver::smart_resolve_macro_path has cognitive complexity 44 (threshold 15). Drivers by points: if/else 19 (32 pts), match/switch 4 (6 pts), boolean chains 5, loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/macros.rs"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac74ae928224c2034d59d0751cca15a7d23c1126c8383ed9abd584cc85d3f691"}},{"ruleId":"D2","level":"warning","message":{"text":"Ty::ty_and_layout_pointee_info_at (cognitive 44): Ty::ty_and_layout_pointee_info_at has cognitive complexity 44 (threshold 15). Drivers by points: if/else 11 (29 pts), boolean chains 7, match/switch 3 (5 pts), loops 1 (3 pts) (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":"compiler/rustc_middle/src/ty/layout.rs"},"region":{"startLine":1057}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eaa83f51cb75d9891c3bd599c948b7b6da84861718ff1eaedfc3dda9345d3ac"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_middle::mir::pretty::write_allocation_bytes (cognitive 44): rustc_middle::mir::pretty::write_allocation_bytes has cognitive complexity 44 (threshold 15). Drivers by points: if/else 16 (28 pts), loops 4 (13 pts), boolean chains 3 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/mir/pretty.rs"},"region":{"startLine":1764}}}],"partialFingerprints":{"codehealthFindingId/v1":"397b2f8fd0b01a2d233e38da40daefd299762f214aa64de0c98ffd8e874c5cca"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_monomorphize::collector::collect_roots (cognitive 44): rustc_monomorphize::collector::collect_roots has cognitive complexity 44 (threshold 15). Drivers by points: if/else 11 (26 pts), loops 7 (12 pts), boolean chains 4, match/switch 1 (2 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_monomorphize/src/collector.rs"},"region":{"startLine":1485}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0246e669e6b459e958987f5f27de25ac93dc4ca010c58a2eafa915cfcf6e81e"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_item_kind (cognitive 44): Parser::parse_item_kind has cognitive complexity 44 (threshold 15). Drivers by points: if/else 28 (33 pts), boolean chains 11 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/item.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dc36daeca45e7d5059e398ccac34c4da158df44011d589f46e6e7bee7de718f"}},{"ruleId":"D2","level":"warning","message":{"text":"AtHwcap::cache (cognitive 44): AtHwcap::cache has cognitive complexity 44 (threshold 15). Drivers by points: boolean chains 42, if/else 2. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std_detect/src/detect/os/linux/aarch64.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"84ba74584681da5f40932dee225f8c7cf712b55dbecf639e20030e6adc47c4c8"}},{"ruleId":"D2","level":"warning","message":{"text":"rustdoc::html::render::render_impl::doc_impl_item (cognitive 44): rustdoc::html::render::render_impl::doc_impl_item has cognitive complexity 44 (threshold 15). Drivers by points: if/else 22 (39 pts), boolean chains 3, match/switch 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (rustdoc::html::render::render_impl) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/render/mod.rs"},"region":{"startLine":1914}}}],"partialFingerprints":{"codehealthFindingId/v1":"434f0bd0a515edae7811cf75d523d4b4f5481913926000922fe2dfd549c89e9f"}},{"ruleId":"D2","level":"warning","message":{"text":"rustdoc::html::render::render_impl (cognitive 44): rustdoc::html::render::render_impl has cognitive complexity 44 (threshold 15). Drivers by points: if/else 40 (71 pts), boolean chains 10, loops 5 (8 pts), match/switch 3 (5 pts) (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (rustdoc::html::render::render_impl::doc_impl_item) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/render/mod.rs"},"region":{"startLine":1893}}}],"partialFingerprints":{"codehealthFindingId/v1":"568f465ca60f2307aa9f7768f1cece8017da6bfc403fbf1808c840232db41566"}},{"ruleId":"D2","level":"warning","message":{"text":"Default::check_block (cognitive 44): Default::check_block has cognitive complexity 44 (threshold 15). Drivers by points: if/else 15 (35 pts), boolean chains 5, loops 2 (3 pts), match/switch 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/default.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2cc843239bfb8c6c47c4e1a4d7f715dfabba8aeb8fd2c773ea74fe9110daf79"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::casts::unnecessary_cast::check (cognitive 44): clippy_lints::casts::unnecessary_cast::check has cognitive complexity 44 (threshold 15). Drivers by points: if/else 15 (23 pts), boolean chains 15, match/switch 3 (6 pts) (nesting depth added 11). Of this number, 43 points are the body\u0027s own statements and 1 belongs 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/tools/clippy/clippy_lints/src/casts/unnecessary_cast.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6e4d486186f7e3e5f4f98156beba2f4c2d6e1110fc20579a114604f70edd6f1"}},{"ruleId":"D2","level":"warning","message":{"text":"Evaluator::interpret_mir (cognitive 44): Evaluator::interpret_mir has cognitive complexity 44 (threshold 15). Drivers by points: if/else 9 (20 pts), match/switch 5 (15 pts), loops 4 (9 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/mir/eval.rs"},"region":{"startLine":796}}}],"partialFingerprints":{"codehealthFindingId/v1":"67376975e8171572e1bd4496d4c5a6f31662f871b8d48ff7cd929d7396717626"}},{"ruleId":"D2","level":"warning","message":{"text":"ide::rename::transform_assoc_fn_into_method_call (cognitive 44): ide::rename::transform_assoc_fn_into_method_call has cognitive complexity 44 (threshold 15). Drivers by points: if/else 9 (27 pts), match/switch 3 (11 pts), loops 3 (6 pts) (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/rename.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"26eea40f996df777ae336e9395372dba5678269ce575ce5197127fe1d0237fdb"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_assists::handlers::add_missing_match_arms::add_missing_match_arms (cognitive 44): ide_assists::handlers::add_missing_match_arms::add_missing_match_arms has cognitive complexity 44 (threshold 15). Drivers by points: if/else 23 (32 pts), boolean chains 6, match/switch 3 (4 pts), loops 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/add_missing_match_arms.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e6f450392cd2687ac9cb79424c91bc290a2f80c5647781742621ed0134cbfcc"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_assists::utils::gen_trait_fn_body::gen_partial_eq (cognitive 44): ide_assists::utils::gen_trait_fn_body::gen_partial_eq has cognitive complexity 44 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 5 (16 pts), match/switch 5 (9 pts) (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/tools/rust-analyzer/crates/ide-assists/src/utils/gen_trait_fn_body.rs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa2fdb700ad6b81b7ce134b3311b6672af0080f4bd86ee5e3a6d4eb96f62353a"}},{"ruleId":"D2","level":"warning","message":{"text":"tidy::features::collect_lang_features_in (cognitive 44): tidy::features::collect_lang_features_in has cognitive complexity 44 (threshold 15). Drivers by points: if/else 14 (29 pts), match/switch 5 (12 pts), boolean chains 2, loops 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/tidy/src/features.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce32cf7d1bbfe05cf9a68f13cbf473e2dcb47d0f0f8899e0a2f345bb11221e03"}},{"ruleId":"D2","level":"warning","message":{"text":"client.createClient (cognitive 44): client.createClient has cognitive complexity 44 (threshold 15). Drivers by points: if/else 17 (29 pts), boolean chains 6, match/switch 1 (5 pts), loops 2, ternaries 2 (nesting depth added 16). Most of this is not in the body itself: 4 of the 44 points are its own statements and the rest belongs to 4 function items inside it that branch (a function literal at line 60, callback, a function literal at line 169, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/editors/code/src/client.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fe36a6b75f439f427c85d98dfa786b432e14e3812c1ac79a9a02a94b9428bf8"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_codegen_llvm::asm::reg_to_llvm (cognitive 43): rustc_codegen_llvm::asm::reg_to_llvm has cognitive complexity 43 (threshold 15). Drivers by points: if/else 15 (22 pts), match/switch 6 (18 pts), boolean chains 3 (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":"compiler/rustc_codegen_llvm/src/asm.rs"},"region":{"startLine":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f7637c771aa80907b1ded2e7ac83a9e8f77ed3742c87c69f179fce15328b4fb"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_expand::mbe::quoted::parse_tree (cognitive 43): rustc_expand::mbe::quoted::parse_tree has cognitive complexity 43 (threshold 15). Drivers by points: if/else 12 (28 pts), match/switch 5 (14 pts), boolean chains 1 (nesting depth added 25). 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":"compiler/rustc_expand/src/mbe/quoted.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"afe9150cfcdbf44d060afeead1204e6f8d55051906b3ed440231c2ee55557c56"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_hir_analysis::delegation::create_mapping (cognitive 43): rustc_hir_analysis::delegation::create_mapping has cognitive complexity 43 (threshold 15). Drivers by points: if/else 11 (24 pts), match/switch 6 (13 pts), loops 4 (6 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/delegation.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eb4abb113bdf369ddd05a438280f476f084f74162ab65684eb7a39dfc0d29b5"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::report_method_error (cognitive 43): FnCtxt::report_method_error has cognitive complexity 43 (threshold 15). Drivers by points: if/else 17 (33 pts), loops 2 (5 pts), match/switch 3 (4 pts), boolean chains 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/method/suggest.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8c84617b84accb284751ffbc2c4ff5b2d4aecb6ddc9ad3f7a73ec6603a62388"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::note_candidates_on_method_error (cognitive 43): FnCtxt::note_candidates_on_method_error has cognitive complexity 43 (threshold 15). Drivers by points: if/else 17 (33 pts), match/switch 3 (6 pts), boolean chains 3, 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":"compiler/rustc_hir_typeck/src/method/suggest.rs"},"region":{"startLine":2442}}}],"partialFingerprints":{"codehealthFindingId/v1":"62ff56982288a6d7430893722398023e5c4aabcd21d98c341777462fbc41aac5"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::suggest_unwrapping_inner_self (cognitive 43): FnCtxt::suggest_unwrapping_inner_self has cognitive complexity 43 (threshold 15). Drivers by points: if/else 22 (34 pts), match/switch 4 (7 pts), boolean chains 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/method/suggest.rs"},"region":{"startLine":3272}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8fbd597a6627c2266323506538945e64da00262c7dfb8ef36e504f5dcaeddda"}},{"ruleId":"D2","level":"warning","message":{"text":"Resolver::unresolved_macro_suggestions (cognitive 43): Resolver::unresolved_macro_suggestions has cognitive complexity 43 (threshold 15). Drivers by points: if/else 16 (26 pts), boolean chains 8, match/switch 3 (6 pts), loops 2 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/diagnostics/impls.rs"},"region":{"startLine":2019}}}],"partialFingerprints":{"codehealthFindingId/v1":"402e2fb967176628f16b251507f9a15c2a2862c0508ad29b363a964229add63b"}},{"ruleId":"D2","level":"warning","message":{"text":"UnusedParens::check_ty (cognitive 43): UnusedParens::check_ty has cognitive complexity 43 (threshold 15). Drivers by points: if/else 9 (26 pts), match/switch 4 (8 pts), boolean chains 7, loops 1 (2 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_lint/src/unused.rs"},"region":{"startLine":975}}}],"partialFingerprints":{"codehealthFindingId/v1":"234956fa8dbd658b69cbebb5a4027933e8a528bdee2d448af90f8e6f7e26943f"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_passes::stability::check_unused_or_stable_features (cognitive 43): rustc_passes::stability::check_unused_or_stable_features has cognitive complexity 43 (threshold 15). Drivers by points: if/else 13 (27 pts), loops 7 (11 pts), boolean chains 5 (nesting depth added 18). Of this number, 29 points are the body\u0027s own statements and 14 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":"compiler/rustc_passes/src/stability.rs"},"region":{"startLine":1159}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a7c200777447e6df9c153c8e981da5096d76a893adae81538feaa2732ce93a5"}},{"ruleId":"D2","level":"warning","message":{"text":"DefCollector::build_reduced_graph_for_use_tree (cognitive 43): DefCollector::build_reduced_graph_for_use_tree has cognitive complexity 43 (threshold 15). Drivers by points: if/else 13 (26 pts), boolean chains 11, match/switch 3 (4 pts), loops 1 (2 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/build_reduced_graph.rs"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"7398187818f90faee161c0088c93f0d75fe6638441997b1cec84250b3d155ea2"}},{"ruleId":"D2","level":"warning","message":{"text":"std::sys::backtrace::_print_fmt (cognitive 43): std::sys::backtrace::_print_fmt has cognitive complexity 43 (threshold 15). Drivers by points: if/else 17 (39 pts), boolean chains 4 (nesting depth added 22). 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":"library/std/src/sys/backtrace.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"1331425561e13c246d1af03fc81d99ed2acf3796d5b4471fd3cc050e5d8b0202"}},{"ruleId":"D2","level":"warning","message":{"text":"stdarch_verify::functions (cognitive 43): stdarch_verify::functions has cognitive complexity 43 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 8 (13 pts), match/switch 4 (8 pts), boolean chains 4 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/stdarch-verify/src/lib.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"b58e3b048b42a1958683a8e7d4a45e4c90e1525bde6f11ed933520643a238423"}},{"ruleId":"D2","level":"warning","message":{"text":"rustdoc::clean::auto_trait::clean_region_outlives_constraints (cognitive 43): rustdoc::clean::auto_trait::clean_region_outlives_constraints has cognitive complexity 43 (threshold 15). Drivers by points: if/else 7 (29 pts), loops 4 (7 pts), match/switch 3 (7 pts) (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/clean/auto_trait.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeee7ae59e8e12dd01bcc4815ccb48181f0d065854ee1ba47b3095353005d788"}},{"ruleId":"D2","level":"warning","message":{"text":"IterFunctionVisitor::visit_expr (cognitive 43): IterFunctionVisitor::visit_expr has cognitive complexity 43 (threshold 15). Drivers by points: if/else 12 (29 pts), match/switch 2 (9 pts), boolean chains 5 (nesting depth added 24). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/methods/needless_collect.rs"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"7735f3c78de2579fa370d76bf6549e8095abfdc0f84df15f3cfa316c19d3ac38"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::attrs::useless_attribute::check (cognitive 43): clippy_lints::attrs::useless_attribute::check has cognitive complexity 43 (threshold 15). Drivers by points: if/else 7 (30 pts), boolean chains 5, loops 2 (4 pts), match/switch 1 (4 pts) (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/attrs/useless_attribute.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"b325d1a0cad796ad2aa22bb0e21d4c1136e7df954460477760991b4bf7c1d674"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::methods::iter_overeager_cloned::check (cognitive 43): clippy_lints::methods::iter_overeager_cloned::check has cognitive complexity 43 (threshold 15). Drivers by points: if/else 13 (34 pts), match/switch 3 (7 pts), boolean chains 2 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/methods/iter_overeager_cloned.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c642d2a573817ca4a01a1b0afd996687f74725d6bb06bfa7718d26f3ec7d336"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::methods::needless_collect::check (cognitive 43): clippy_lints::methods::needless_collect::check has cognitive complexity 43 (threshold 15). Drivers by points: if/else 14 (30 pts), boolean chains 6, match/switch 2 (4 pts), loops 1 (3 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/methods/needless_collect.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c743b69ed7ec44a753a2d7dab32e9e9b63aecb70bc37a310174d0c534db7033"}},{"ruleId":"D2","level":"warning","message":{"text":"compiletest::directives::make_test_description (cognitive 43): compiletest::directives::make_test_description has cognitive complexity 43 (threshold 15). Drivers by points: match/switch 12 (24 pts), if/else 9 (17 pts), boolean chains 2 (nesting depth added 20). 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/tools/compiletest/src/directives.rs"},"region":{"startLine":891}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5a8d9e452ab7119872a53ee68e127ca1627cd4b71c86f196733097588892b6f"}},{"ruleId":"D2","level":"warning","message":{"text":"opt_dist::execute_pipeline (cognitive 43): opt_dist::execute_pipeline has cognitive complexity 43 (threshold 15). Drivers by points: if/else 32 (35 pts), boolean chains 4, loops 2 (3 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/tools/opt-dist/src/main.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"193f26a450bdad641828291108ae9322f833fa4c82895fd62185f188cde5bdd2"}},{"ruleId":"D2","level":"warning","message":{"text":"InlineAssemblyGenerator::allocate_registers (cognitive 42): InlineAssemblyGenerator::allocate_registers has cognitive complexity 42 (threshold 15). Drivers by points: if/else 6 (24 pts), loops 6 (12 pts), match/switch 3 (6 pts) (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":"compiler/rustc_codegen_cranelift/src/inline_asm.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"2796e375843c9555eb26708c9db41e6b7e520468759939a7b0fcbd36b75629be"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_codegen_gcc::back::write::codegen (cognitive 42): rustc_codegen_gcc::back::write::codegen has cognitive complexity 42 (threshold 15). Drivers by points: if/else 18 (37 pts), boolean chains 4, match/switch 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_gcc/src/back/write.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa2dc5888dbeb50316e79f36a4dfe1c95eaa3ed2ffbbcb501fc3ab05d934cf25"}},{"ruleId":"D2","level":"warning","message":{"text":"OperandRef::codegen_get_discr (cognitive 42): OperandRef::codegen_get_discr has cognitive complexity 42 (threshold 15). Drivers by points: if/else 17 (33 pts), match/switch 5 (7 pts), boolean chains 2 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/mir/operand.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddb824c5539965ad76465555a298ce06da7059bfe675a030bbe3bd175c2f8ff3"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_hir_analysis::check::compare_impl_item::check_number_of_early_bound_regions (cognitive 42): rustc_hir_analysis::check::compare_impl_item::check_number_of_early_bound_regions has cognitive complexity 42 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 4 (14 pts), match/switch 2 (7 pts), boolean chains 2 (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":"compiler/rustc_hir_analysis/src/check/compare_impl_item.rs"},"region":{"startLine":1198}}}],"partialFingerprints":{"codehealthFindingId/v1":"a446f56e6bc4d1139d14c4f955103d932d5b65eb8ca9b54d01c2ca2ea01e43ff"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_hir_analysis::hir_ty_lowering::errors::prohibit_assoc_item_constraint (cognitive 42): rustc_hir_analysis::hir_ty_lowering::errors::prohibit_assoc_item_constraint has cognitive complexity 42 (threshold 15). Drivers by points: if/else 16 (33 pts), match/switch 2 (5 pts), boolean chains 4 (nesting depth added 20). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/hir_ty_lowering/errors.rs"},"region":{"startLine":1569}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b48c42bfe55d985dab11f507e46aa82a3032a9b8064a29f6d1487e8a40816a1"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_hir_analysis::hir_ty_lowering::errors::generics_args_err_extend (cognitive 42): rustc_hir_analysis::hir_ty_lowering::errors::generics_args_err_extend has cognitive complexity 42 (threshold 15). Drivers by points: if/else 14 (30 pts), match/switch 3 (6 pts), loops 2 (4 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":"compiler/rustc_hir_analysis/src/hir_ty_lowering/errors.rs"},"region":{"startLine":1815}}}],"partialFingerprints":{"codehealthFindingId/v1":"759eac8977377cf6b04fd91e321a2bb68e02287a67b13d17db2c1f60728d03ce"}},{"ruleId":"D2","level":"warning","message":{"text":"CoerceMany::coerce_inner (cognitive 42): CoerceMany::coerce_inner has cognitive complexity 42 (threshold 15). Drivers by points: if/else 18 (37 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/coercion.rs"},"region":{"startLine":1703}}}],"partialFingerprints":{"codehealthFindingId/v1":"35e4a7eadaa5f997f8a90ca2bb30c8e23a64b096cf757cb6aa352ceb644eb328"}},{"ruleId":"D2","level":"warning","message":{"text":"Lexer::lex_token_tree_open_delim (cognitive 42): Lexer::lex_token_tree_open_delim has cognitive complexity 42 (threshold 15). Drivers by points: if/else 14 (35 pts), loops 1 (4 pts), boolean chains 3 (nesting depth added 24). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/lexer/tokentrees.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"1641ddbf93e7113b48b2d0657731e7bff64dd2788bcd120191175557c8f882e1"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeErrCtxt::expected_found_str_term (cognitive 42): TypeErrCtxt::expected_found_str_term has cognitive complexity 42 (threshold 15). Drivers by points: if/else 11 (39 pts), boolean chains 2, match/switch 1 (nesting depth added 28). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/error_reporting/infer/mod.rs"},"region":{"startLine":2380}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f3bb362ad0ee347db013c2c765d707110b20784014528f5dc26efcb035e0e90"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeErrCtxt::suggest_for_all_lifetime_closure (cognitive 42): TypeErrCtxt::suggest_for_all_lifetime_closure has cognitive complexity 42 (threshold 15). Drivers by points: if/else 15 (38 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 24). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/error_reporting/infer/suggest.rs"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"8049ec42bb19d06cee5b3dbfa03ecf5e07ab256285982c9dcf23bd0d4cb4df22"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeErrCtxt::report_host_effect_error (cognitive 42): TypeErrCtxt::report_host_effect_error has cognitive complexity 42 (threshold 15). Drivers by points: if/else 10 (24 pts), loops 2 (9 pts), match/switch 1 (6 pts), boolean chains 3 (nesting depth added 26). 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":"compiler/rustc_trait_selection/src/error_reporting/traits/fulfillment_errors.rs"},"region":{"startLine":980}}}],"partialFingerprints":{"codehealthFindingId/v1":"6da19b2cd48ac645a5211dc828857e8a015b6fb37af9944df6fef2624c144e16"}},{"ruleId":"D2","level":"warning","message":{"text":"WfPredicates::visit_ty (cognitive 42): WfPredicates::visit_ty has cognitive complexity 42 (threshold 15). Drivers by points: if/else 11 (29 pts), loops 2 (6 pts), match/switch 2 (4 pts), boolean chains 3 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/traits/wf.rs"},"region":{"startLine":775}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a7c3046da6e839b484dedb4ed274de221527b107398513953debc0a60db8385"}},{"ruleId":"D2","level":"warning","message":{"text":"core::num::imp::dec2flt::decimal_seq::parse_decimal_seq (cognitive 42): core::num::imp::dec2flt::decimal_seq::parse_decimal_seq has cognitive complexity 42 (threshold 15). Drivers by points: if/else 14 (30 pts), loops 5 (9 pts), boolean chains 3 (nesting depth added 20). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/num/imp/dec2flt/decimal_seq.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aff981d3cc9df84821c200cb7b9c9fa5ea839a02806f2c1dfaffd3a1c294ac3"}},{"ruleId":"D2","level":"warning","message":{"text":"assert_instr_macro::assert_instr (cognitive 42): assert_instr_macro::assert_instr has cognitive complexity 42 (threshold 15). Drivers by points: if/else 16 (29 pts), match/switch 6 (9 pts), boolean chains 2, loops 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/assert-instr-macro/src/lib.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"f17f6838bbafffeef3a59802679745df177a56e35849bbb7e3ab1ad70a1c13ce"}},{"ruleId":"D2","level":"warning","message":{"text":"ModCollector::collect (cognitive 42): ModCollector::collect has cognitive complexity 42 (threshold 15). Drivers by points: if/else 14 (28 pts), match/switch 5 (8 pts), loops 2 (4 pts), boolean chains 2 (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/tools/rust-analyzer/crates/hir-def/src/nameres/collector.rs"},"region":{"startLine":1898}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f4bc0d9dd81bf5ab2e943808a3871dc0ea13cdd12173b132d3cfc16212bc701"}},{"ruleId":"D2","level":"warning","message":{"text":"hir_def::attrs::parse_repr_tt (cognitive 42): hir_def::attrs::parse_repr_tt has cognitive complexity 42 (threshold 15). Drivers by points: if/else 9 (23 pts), match/switch 4 (16 pts), boolean chains 2, loops 1 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/attrs.rs"},"region":{"startLine":1272}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9ff72edc550d720d7350095384b02fa0a1f5c425718a598538bddadf7456cb1"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_completion::completions::use_::complete_use_path (cognitive 42): ide_completion::completions::use_::complete_use_path has cognitive complexity 42 (threshold 15). Drivers by points: if/else 7 (23 pts), match/switch 4 (9 pts), loops 2 (7 pts), boolean chains 3 (nesting depth added 26). 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/tools/rust-analyzer/crates/ide-completion/src/completions/use_.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bec9b22ea843735ad8a3fb258380e436167897b271ea783748ff347880f1f21"}},{"ruleId":"D2","level":"warning","message":{"text":"search.initSearch::getItemsBefore (cognitive 42): search.initSearch::getItemsBefore has cognitive complexity 42 (threshold 15). Drivers by points: if/else 23 (36 pts), boolean chains 5, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 15 other methods here (search.initSearch, search.initSearch::getNextElem, search.initSearch::createQueryElement, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 16 times rather than 16 independent problems. Splitting this body alone leaves the other 15 exactly as they are. Where these are variations on one operation, the change that clears all 16 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f43d5eda7f4cd83d38fbb9da1bf8d5b8aa61a2b6ef88987288a743d98c6c490"}},{"ruleId":"D2","level":"warning","message":{"text":"UnwindContext::add_function (cognitive 41): UnwindContext::add_function has cognitive complexity 41 (threshold 15). Drivers by points: match/switch 4 (16 pts), if/else 6 (14 pts), loops 3 (10 pts), boolean chains 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":"compiler/rustc_codegen_cranelift/src/debuginfo/unwind.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"8582e6e9b4b1d814fd663a88afaf566841c901cf25c23cc7d90806dc13be51e9"}},{"ruleId":"D2","level":"warning","message":{"text":"GccLinker::export_symbols (cognitive 41): GccLinker::export_symbols has cognitive complexity 41 (threshold 15). Drivers by points: if/else 19 (28 pts), loops 5 (11 pts), boolean chains 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/back/linker.rs"},"region":{"startLine":789}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ba4d2ad73c869ae93c512284ffd7e9eb93df5ded68383eb0137908d92a32f52"}},{"ruleId":"D2","level":"warning","message":{"text":"WrongNumberOfGenericArgs::suggest_removing_args_or_generics (cognitive 41): WrongNumberOfGenericArgs::suggest_removing_args_or_generics has cognitive complexity 41 (threshold 15). Drivers by points: if/else 20 (32 pts), match/switch 2 (5 pts), boolean chains 2, loops 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/diagnostics/wrong_number_of_generic_args.rs"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9858beb294f879d4cdc24ea184b51105dcf68e8dc46e278d12bae046fd5c48a"}},{"ruleId":"D2","level":"warning","message":{"text":"LintLevelsBuilder::add_hir_inner (cognitive 41): LintLevelsBuilder::add_hir_inner has cognitive complexity 41 (threshold 15). Drivers by points: if/else 10 (25 pts), match/switch 4 (10 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_lint/src/levels.rs"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"05905cbbbacc1d68741cd0754012599babdd96a11292aeda268cc81f8cfa343c"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_metadata::dependency_format::verify_ok (cognitive 41): rustc_metadata::dependency_format::verify_ok has cognitive complexity 41 (threshold 15). Drivers by points: if/else 14 (32 pts), loops 4 (7 pts), boolean chains 2 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_metadata/src/dependency_format.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4c70dff11994e84319fcba4771a2c15d38ecf5950a8d4e9fb4201485274f690"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_mir_transform::pass_manager::run_passes_inner (cognitive 41): rustc_mir_transform::pass_manager::run_passes_inner has cognitive complexity 41 (threshold 15). Drivers by points: if/else 17 (32 pts), loops 3 (5 pts), boolean chains 4 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/pass_manager.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"1df9e0550346b762d08be044e6756c6376d4c0e0b213670a7a2c0afb44370d6b"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_passes::dead::lint_dead_codes (cognitive 41): rustc_passes::dead::lint_dead_codes has cognitive complexity 41 (threshold 15). Drivers by points: if/else 11 (29 pts), loops 4 (8 pts), boolean chains 4 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_passes/src/dead.rs"},"region":{"startLine":1611}}}],"partialFingerprints":{"codehealthFindingId/v1":"617f04a6cfd82753336f5c63e1bb72d24b10d833a64a238fc6e0d1bb9330348a"}},{"ruleId":"D2","level":"warning","message":{"text":"LateResolutionVisitor::resolve_lifetime (cognitive 41): LateResolutionVisitor::resolve_lifetime has cognitive complexity 41 (threshold 15). Drivers by points: if/else 10 (28 pts), match/switch 3 (11 pts), boolean chains 1, loops 1 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/late.rs"},"region":{"startLine":1925}}}],"partialFingerprints":{"codehealthFindingId/v1":"76eb720381fcba12c343eedc0fdb1725031d6bc71101f8ee5ca42faed65f5e31"}},{"ruleId":"D2","level":"warning","message":{"text":"LateResolutionVisitor::resolve_anonymous_lifetime (cognitive 41): LateResolutionVisitor::resolve_anonymous_lifetime has cognitive complexity 41 (threshold 15). Drivers by points: if/else 15 (36 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 22). 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":"compiler/rustc_resolve/src/late.rs"},"region":{"startLine":2037}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a5a088dcc55bd2cb484bd2cf12b09be7b521b08f9516dfe3db87f42bc866ad3"}},{"ruleId":"D2","level":"warning","message":{"text":"compiler_builtins::float::add::add (cognitive 41): compiler_builtins::float::add::add has cognitive complexity 41 (threshold 15). Drivers by points: if/else 26 (40 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":"library/compiler-builtins/compiler-builtins/src/float/add.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b4b6b2f6159e006397b603edd2b26fef03762b819cf418ca2cfdfc56638cc71"}},{"ruleId":"D2","level":"warning","message":{"text":"libm::math::lgamma_r::lgamma_r (cognitive 41): libm::math::lgamma_r::lgamma_r has cognitive complexity 41 (threshold 15). Drivers by points: if/else 27 (37 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/compiler-builtins/libm/src/math/lgamma_r.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"76bb3e759bfb9aecedf1040cc7ccc9228e5e68d867e43a1ab3d36291c820a8aa"}},{"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/tools/miri/src/shims/unix/linux_like/sync.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a2c39fb5a45c7eb0368f17aadd0f562954f738ce9f4b8202b25016801f3e43c"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_db::imports::insert_use::guess_granularity_from_scope (cognitive 41): ide_db::imports::insert_use::guess_granularity_from_scope has cognitive complexity 41 (threshold 15). Drivers by points: if/else 15 (32 pts), boolean chains 6, match/switch 2, loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-db/src/imports/insert_use.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"a39d9c4eb72733e82b6358c13dcb5d6cb783d5f67da9f808d5553039a97f8576"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_db::rename::source_edit_from_def (cognitive 41): ide_db::rename::source_edit_from_def has cognitive complexity 41 (threshold 15). Drivers by points: if/else 11 (27 pts), match/switch 3 (8 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 23). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-db/src/rename.rs"},"region":{"startLine":673}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b3dfa2e7fb2d6d58351da95d25c7727a84e85f66959f3658cd99bde8c14f5ae"}},{"ruleId":"D2","level":"warning","message":{"text":"Converter::extend_literal (cognitive 41): Converter::extend_literal has cognitive complexity 41 (threshold 15). Drivers by points: if/else 20 (40 pts), match/switch 1 (nesting depth added 20). 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/tools/rust-analyzer/crates/parser/src/lexed_str.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9e962702d7ffe180238285b874a0fda368e5e1e67411cd6cd6b244f2256a5e1"}},{"ruleId":"D2","level":"warning","message":{"text":"syntax_bridge::prettify_macro_expansion::prettify_macro_expansion (cognitive 41): syntax_bridge::prettify_macro_expansion::prettify_macro_expansion has cognitive complexity 41 (threshold 15). Drivers by points: if/else 7 (19 pts), match/switch 5 (12 pts), boolean chains 7, loops 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/tools/rust-analyzer/crates/syntax-bridge/src/prettify_macro_expansion.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"46a2468c89f4f501231ef072049ce517c5cb4060fe3cd1366aaba552e7a4d078"}},{"ruleId":"D2","level":"warning","message":{"text":"rustfmt_nightly::matches::rewrite_match_body (cognitive 41): rustfmt_nightly::matches::rewrite_match_body has cognitive complexity 41 (threshold 15). Drivers by points: if/else 22 (27 pts), boolean chains 9, match/switch 4 (5 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":"src/tools/rustfmt/src/matches.rs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b5805e3d2709f794e190dc0d5dac5a773a64e9c479d2ba425fe3bc39ff0bf78"}},{"ruleId":"D2","level":"warning","message":{"text":"initSearch::buildItemSearchType (cognitive 41): initSearch::buildItemSearchType has cognitive complexity 41 (threshold 15). Drivers by points: if/else 16 (29 pts), boolean chains 7, loops 1 (3 pts), ternaries 1 (2 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":2032}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e6849dcd6dc819bc5e3e6bfb520f0821187031c39fed45a1f62dd77957f9bcc"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_codegen_cranelift::abi::codegen_fn_prelude (cognitive 40): rustc_codegen_cranelift::abi::codegen_fn_prelude has cognitive complexity 40 (threshold 15). Drivers by points: if/else 13 (28 pts), loops 4 (7 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/src/abi/mod.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b7eae3d9a3254d75ce52027959395a7f8fc6d50a864701a3db07a67cf5089e7"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_codegen_cranelift::abi::codegen_terminator_call (cognitive 40): rustc_codegen_cranelift::abi::codegen_terminator_call has cognitive complexity 40 (threshold 15). Drivers by points: if/else 33 (47 pts), match/switch 6 (11 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (rustc_codegen_cranelift::abi::codegen_terminator_call::adjust_call_for_c_variadic) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/src/abi/mod.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d187ca053cb24e49d4dd9cda0b7daa6cbd5569511b457cfcc062d3c1f9e0261"}},{"ruleId":"D2","level":"warning","message":{"text":"Builder::codegen_intrinsic_call (cognitive 40): Builder::codegen_intrinsic_call has cognitive complexity 40 (threshold 15). Drivers by points: if/else 14 (26 pts), match/switch 7 (14 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_gcc/src/intrinsic/mod.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"e500c861316edeb115c0bbc71a5715212d461637b57766d2ba5a30e1aa18cda5"}},{"ruleId":"D2","level":"warning","message":{"text":"ArArchiveBuilder::build_inner (cognitive 40): ArArchiveBuilder::build_inner has cognitive complexity 40 (threshold 15). Drivers by points: if/else 10 (24 pts), match/switch 4 (10 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/back/archive.rs"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ee772b33e5306eb00f97aee4a518d3e78b92fdefe858a35aba89362d03f8659"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionCx::codegen_scalar_binop (cognitive 40): FunctionCx::codegen_scalar_binop has cognitive complexity 40 (threshold 15). Drivers by points: if/else 26 (39 pts), match/switch 1 (nesting depth added 13). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/mir/rvalue.rs"},"region":{"startLine":883}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbafc2d7975f2460cb5e6c5eb0efcd720b8d15c1b3aa3e01210c0ceed6bddf87"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_hir_analysis::check::bounds_from_generic_clauses (cognitive 40): rustc_hir_analysis::check::bounds_from_generic_clauses has cognitive complexity 40 (threshold 15). Drivers by points: if/else 15 (27 pts), loops 4 (7 pts), boolean chains 3, match/switch 2 (3 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/check/mod.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"64c1150d068cce225145a08fdad0c3d2cb07c25e53f7ba14fcb6d22e817411fe"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_hir_analysis::check::compare_impl_item::compare_number_of_generics (cognitive 40): rustc_hir_analysis::check::compare_impl_item::compare_number_of_generics has cognitive complexity 40 (threshold 15). Drivers by points: if/else 12 (24 pts), loops 3 (8 pts), match/switch 3 (8 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/check/compare_impl_item.rs"},"region":{"startLine":1639}}}],"partialFingerprints":{"codehealthFindingId/v1":"43bf1021f30b45ef24a6f508b6478e58013bb8901b4ec5c04c416b8e62eeebdb"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_hir_analysis::coherence::builtin::infringing_fields_error (cognitive 40): rustc_hir_analysis::coherence::builtin::infringing_fields_error has cognitive complexity 40 (threshold 15). Drivers by points: if/else 6 (25 pts), loops 4 (8 pts), match/switch 2 (6 pts), boolean chains 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":"compiler/rustc_hir_analysis/src/coherence/builtin.rs"},"region":{"startLine":890}}}],"partialFingerprints":{"codehealthFindingId/v1":"8695c7147f360a310bd55dec5393946a02ad36396f54f4fca49b64436fb040a8"}},{"ruleId":"D2","level":"warning","message":{"text":"Validator::validate_rvalue (cognitive 40): Validator::validate_rvalue has cognitive complexity 40 (threshold 15). Drivers by points: if/else 11 (30 pts), match/switch 3 (5 pts), boolean chains 3, loops 1 (2 pts) (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":"compiler/rustc_mir_transform/src/promote_consts.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"8df9de2b79b0604317bdd62f0798b18ddf7952b4b3ed92d343489d6bd9958cd6"}},{"ruleId":"D2","level":"warning","message":{"text":"Lexer::cook_lexer_literal (cognitive 40): Lexer::cook_lexer_literal has cognitive complexity 40 (threshold 15). Drivers by points: if/else 17 (33 pts), loops 1 (3 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 19). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/lexer/mod.rs"},"region":{"startLine":820}}}],"partialFingerprints":{"codehealthFindingId/v1":"3805b68b98fb36941d169ed1c955764d9246e5cb11f7774ccc67a4f5945e4f8c"}},{"ruleId":"D2","level":"warning","message":{"text":"LateResolutionVisitor::suggest_using_enum_variant (cognitive 40): LateResolutionVisitor::suggest_using_enum_variant has cognitive complexity 40 (threshold 15). Drivers by points: if/else 17 (27 pts), match/switch 6 (11 pts), boolean chains 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/late/diagnostics.rs"},"region":{"startLine":3603}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc4d2173e7af8161635ae3191a54148db64a8baeb1170a4b71a551069026740a"}},{"ruleId":"D2","level":"warning","message":{"text":"AddLifetimeParamsSuggestion::add_to_diag (cognitive 40): AddLifetimeParamsSuggestion::add_to_diag has cognitive complexity 40 (threshold 15). Drivers by points: if/else 14 (26 pts), loops 2 (7 pts), match/switch 3 (4 pts), boolean chains 3 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/diagnostics.rs"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd97deb0b54d0a5416fef877eb8b7274cd61b7d2b4c57dc462e2e8d4a9e1927f"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_ty_utils::abi::arg_attrs_for_rust_scalar (cognitive 40): rustc_ty_utils::abi::arg_attrs_for_rust_scalar has cognitive complexity 40 (threshold 15). Drivers by points: if/else 12 (29 pts), match/switch 2 (6 pts), boolean chains 5 (nesting depth added 21). 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":"compiler/rustc_ty_utils/src/abi.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"c72bdb6dbf957abbb18b59351f89d62fbf1fc85e071bddbf05a874da6b3dfafa"}},{"ruleId":"D2","level":"warning","message":{"text":"libm::math::lgammaf_r::lgammaf_r (cognitive 40): libm::math::lgammaf_r::lgammaf_r has cognitive complexity 40 (threshold 15). Drivers by points: if/else 27 (37 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/compiler-builtins/libm/src/math/lgammaf_r.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"75f59e13fd589cc75b098065035add31dac63ec0735099666a122e0b41997ea4"}},{"ruleId":"D2","level":"warning","message":{"text":"core::num::imp::flt2dec::strategy::dragon::format_exact (cognitive 40): core::num::imp::flt2dec::strategy::dragon::format_exact has cognitive complexity 40 (threshold 15). Drivers by points: if/else 18 (31 pts), loops 2 (6 pts), boolean chains 3 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/num/imp/flt2dec/strategy/dragon.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc903f57dc0c98ad46448c2d37f940e163fcf5f6420771f85941e1356b0c6c5e"}},{"ruleId":"D2","level":"warning","message":{"text":"X86IntrinsicType::from_param (cognitive 40): X86IntrinsicType::from_param has cognitive complexity 40 (threshold 15). Drivers by points: if/else 11 (22 pts), match/switch 5 (12 pts), boolean chains 6 (nesting depth added 18). 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":"library/stdarch/crates/intrinsic-test/src/x86/types.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c164b863de7cd28a66eb857d63f0998e4f9792499b0c73dfca877762119c72b"}},{"ruleId":"D2","level":"warning","message":{"text":"Context::render_item (cognitive 40): Context::render_item has cognitive complexity 40 (threshold 15). Drivers by points: if/else 16 (26 pts), loops 2 (7 pts), boolean chains 4, match/switch 1 (3 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/render/context.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"e14da7c43ec75a86c22b75782b405c06300a2e46b192f5500860a309f759e930"}},{"ruleId":"D2","level":"warning","message":{"text":"SerializedSearchIndex::sort (cognitive 40): SerializedSearchIndex::sort has cognitive complexity 40 (threshold 15). Drivers by points: loops 11 (25 pts), if/else 5 (9 pts), match/switch 2 (6 pts) (nesting depth added 22). Of this number, 20 points are the body\u0027s own statements and 20 belong to one function item inside it that branches. To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/render/search_index.rs"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf1481ec46ceefd5759f6716e91895026fbac0de2f16076bc298e07bc388fb09"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::implicit_saturating_sub::check_with_condition (cognitive 40): clippy_lints::implicit_saturating_sub::check_with_condition has cognitive complexity 40 (threshold 15). Drivers by points: if/else 15 (31 pts), boolean chains 7, match/switch 1 (2 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/implicit_saturating_sub.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"30ccbc4d17bc06ed117fae68c838863e186f88f01766f7e92693c5a44800098b"}},{"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/tools/miri/src/intrinsics/x86/sse42.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc5b0cf3a2a1113766ee32d7b1c2cb0f75ede38a47c7f3381bd806ba07891461"}},{"ruleId":"D2","level":"warning","message":{"text":"ExprCollector::collect_pat (cognitive 40): ExprCollector::collect_pat has cognitive complexity 40 (threshold 15). Drivers by points: if/else 10 (21 pts), loops 4 (10 pts), match/switch 4 (8 pts), boolean chains 1 (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/tools/rust-analyzer/crates/hir-def/src/expr_store/lower.rs"},"region":{"startLine":2918}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aa93871f825d19a132df5074d6f4e82a866d35361c4eaba71751c5b43d1f2a7"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_db::prime_caches::parallel_prime_caches (cognitive 40): ide_db::prime_caches::parallel_prime_caches has cognitive complexity 40 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 8 (14 pts), match/switch 6 (8 pts), boolean chains 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-db/src/prime_caches.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"beef407c2a5fefa9b5f6c5cd4f8e5db091673df383924533556e791ad997fc68"}},{"ruleId":"D2","level":"warning","message":{"text":"Sysroot::load_workspace (cognitive 40): Sysroot::load_workspace has cognitive complexity 40 (threshold 15). Drivers by points: if/else 11 (26 pts), loops 4 (11 pts), match/switch 1 (3 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/project-model/src/sysroot.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"2015d5a69e6d503a3f6b406401a8fee1d7cdafbc7ab8c7f17b26501bffb08c47"}},{"ruleId":"D2","level":"warning","message":{"text":"GlobalState::handle_task (cognitive 40): GlobalState::handle_task has cognitive complexity 40 (threshold 15). Drivers by points: match/switch 9 (21 pts), if/else 7 (19 pts) (nesting depth added 24). 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/tools/rust-analyzer/crates/rust-analyzer/src/main_loop.rs"},"region":{"startLine":850}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c8965842a90d3e1e90b2ecf6bdb0030fb913f78158106d4fdd22deb0e0c4ba1"}},{"ruleId":"D2","level":"warning","message":{"text":"RustBuild.download_toolchain (cognitive 40): RustBuild.download_toolchain has cognitive complexity 40 (threshold 15). Drivers by points: if/else 11 (27 pts), boolean chains 6, loops 2 (5 pts), ternaries 1 (2 pts) (nesting depth added 20). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/bootstrap.py"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdc06cf9d899274ffe71b9c825ead4412ac9b575d1168e422bec800e0195ab03"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_attr_parsing::attributes::diagnostic::parse_directive_items (cognitive 39): rustc_attr_parsing::attributes::diagnostic::parse_directive_items has cognitive complexity 39 (threshold 15). Drivers by points: if/else 11 (25 pts), match/switch 4 (10 pts), loops 2 (4 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_attr_parsing/src/attributes/diagnostic/mod.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"2db8f4740479f1d3bb7e7ee3b9530e4363b98e6747c07ebcaf8e80cfcb3bcbab"}},{"ruleId":"D2","level":"warning","message":{"text":"TerminatorCodegenHelper::do_call (cognitive 39): TerminatorCodegenHelper::do_call has cognitive complexity 39 (threshold 15). Drivers by points: if/else 21 (29 pts), loops 2 (6 pts), boolean chains 3, match/switch 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/mir/block.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"08b8d48393cb56e900bfd70204bb4e4b7a4ffeb028623b57204408061a262979"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_hir_analysis::collect::generics_of::generics_of (cognitive 39): rustc_hir_analysis::collect::generics_of::generics_of has cognitive complexity 39 (threshold 15). Drivers by points: if/else 14 (20 pts), match/switch 6 (12 pts), loops 2 (4 pts), boolean chains 3 (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":"compiler/rustc_hir_analysis/src/collect/generics_of.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"6498c24333b210a694d4d29b0d189e1eb7a317d9cd241993f82786a8bc1711d5"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::suggest_missing_return_type (cognitive 39): FnCtxt::suggest_missing_return_type has cognitive complexity 39 (threshold 15). Drivers by points: if/else 16 (36 pts), boolean chains 2, match/switch 1 (nesting depth added 20). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/fn_ctxt/suggestions.rs"},"region":{"startLine":975}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b0f4bec73c9019c817f3d541fd5dfd79b47a4db2de55a5061e267258ce5b2e8"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::report_failed_method_call_on_numerical_infer_var (cognitive 39): FnCtxt::report_failed_method_call_on_numerical_infer_var has cognitive complexity 39 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 3 (12 pts), loops 2 (10 pts), boolean chains 3 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/method/suggest.rs"},"region":{"startLine":2982}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dc26dd0f1fe4575c7ae6f8ccfd73c66577d84cf4bea1239d5574d7ed31163a1"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::compute_definition_site_hidden_types (cognitive 39): FnCtxt::compute_definition_site_hidden_types has cognitive complexity 39 (threshold 15). Drivers by points: if/else 11 (27 pts), loops 4 (7 pts), match/switch 3 (5 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/opaque_types.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ccf29137fee5e798a4c063a72dac69f7c17b83ce6102183afbbb2f378f22ae0"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_lint::foreign_modules::structurally_same_type_impl (cognitive 39): rustc_lint::foreign_modules::structurally_same_type_impl has cognitive complexity 39 (threshold 15). Drivers by points: if/else 13 (29 pts), boolean chains 7, match/switch 1 (2 pts), loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_lint/src/foreign_modules.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"5934d5a6423777175e964d373ebf194d9f5520f22620d00c7053c9d02250e633"}},{"ruleId":"D2","level":"warning","message":{"text":"EncodeContext::encode_mir (cognitive 39): EncodeContext::encode_mir has cognitive complexity 39 (threshold 15). Drivers by points: if/else 15 (32 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_metadata/src/rmeta/encoder.rs"},"region":{"startLine":1935}}}],"partialFingerprints":{"codehealthFindingId/v1":"077ecc29ee62ba9198abcbb2b635b529b49231dc08b2d62c5f00e13b85e92f07"}},{"ruleId":"D2","level":"warning","message":{"text":"CondChecker::visit_expr (cognitive 39): CondChecker::visit_expr has cognitive complexity 39 (threshold 15). Drivers by points: if/else 8 (22 pts), match/switch 5 (14 pts), boolean chains 3 (nesting depth added 23). Of this number, 32 points are the body\u0027s own statements and 7 belong to 2 function items inside it that branch. 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":"compiler/rustc_parse/src/parser/expr.rs"},"region":{"startLine":4064}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b9ea416286574e81e74d0a4cab0453b8fe0b17450b24182bf6598c9eaba83c1"}},{"ruleId":"D2","level":"warning","message":{"text":"LateResolutionVisitor::resolve_fn_params (cognitive 39): LateResolutionVisitor::resolve_fn_params has cognitive complexity 39 (threshold 15). Drivers by points: if/else 10 (24 pts), match/switch 3 (11 pts), boolean chains 2, loops 2 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/late.rs"},"region":{"startLine":2645}}}],"partialFingerprints":{"codehealthFindingId/v1":"d345c254cc8f96f3a5c9d45781a4e94e9a211ea9b1f28bcbce098e38aaf164be"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_target::callconv::x86_64::compute_abi_info (cognitive 39): rustc_target::callconv::x86_64::compute_abi_info has cognitive complexity 39 (threshold 15). Drivers by points: if/else 14 (22 pts), match/switch 3 (8 pts), boolean chains 5, loops 2 (4 pts) (nesting depth added 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":"compiler/rustc_target/src/callconv/x86_64.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"27b03a464dac6a9a71cda67a1db294e0a416efdccde54360536736059a4728dc"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeErrCtxt::cmp_fn_sig (cognitive 39): TypeErrCtxt::cmp_fn_sig has cognitive complexity 39 (threshold 15). Drivers by points: if/else 18 (29 pts), loops 3 (6 pts), boolean chains 2, match/switch 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/error_reporting/infer/mod.rs"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"14ddc58f5b74d050f554969b5beb9e281f01aedb3e1ab4da0b07e157d962f0e2"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeErrCtxt::try_conversion_context (cognitive 39): TypeErrCtxt::try_conversion_context has cognitive complexity 39 (threshold 15). Drivers by points: if/else 17 (26 pts), boolean chains 9, loops 2, match/switch 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/error_reporting/traits/fulfillment_errors.rs"},"region":{"startLine":1273}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb2cd308d4ddd568ad63a1e11c98e15ed6494b8cf3eb0e8a01ee6a496e7f7556"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_trait_selection::traits::dyn_compatibility::virtual_call_violations_for_method (cognitive 39): rustc_trait_selection::traits::dyn_compatibility::virtual_call_violations_for_method has cognitive complexity 39 (threshold 15). Drivers by points: if/else 19 (27 pts), match/switch 2 (8 pts), boolean chains 3, loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/traits/dyn_compatibility.rs"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"67e8681fa941e1e077d5a1e98e22c80a45f9b09e4d708b8a261d110d3d40b7ca"}},{"ruleId":"D2","level":"warning","message":{"text":"libm::math::remquo::remquo (cognitive 39): libm::math::remquo::remquo has cognitive complexity 39 (threshold 15). Drivers by points: if/else 20 (25 pts), loops 4 (9 pts), boolean chains 5 (nesting depth added 10). 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":"library/compiler-builtins/libm/src/math/remquo.rs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"5115e4ae0f533cc8d06437bd8009b68d3f1f3e2747429025aa404d8f2a73ab24"}},{"ruleId":"D2","level":"warning","message":{"text":"libm::math::remquof::remquof (cognitive 39): libm::math::remquof::remquof has cognitive complexity 39 (threshold 15). Drivers by points: if/else 20 (25 pts), loops 4 (9 pts), boolean chains 5 (nesting depth added 10). 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":"library/compiler-builtins/libm/src/math/remquof.rs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"feaecff914f0bcce4f67807627d6b7d3caba1e3e029aa389cfeece311ee1bdaf"}},{"ruleId":"D2","level":"warning","message":{"text":"Intrinsic::generate_big_endian (cognitive 39): Intrinsic::generate_big_endian has cognitive complexity 39 (threshold 15). Drivers by points: if/else 14 (29 pts), loops 4 (8 pts), boolean chains 2 (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":"library/stdarch/crates/stdarch-gen-arm/src/intrinsic.rs"},"region":{"startLine":1061}}}],"partialFingerprints":{"codehealthFindingId/v1":"cedbf7b456967441475791ec4abc0c480d16946a4ddf8b74eaa1c414a08098a6"}},{"ruleId":"D2","level":"warning","message":{"text":"sembr::reformat (cognitive 39): sembr::reformat has cognitive complexity 39 (threshold 15). Drivers by points: if/else 18 (35 pts), boolean chains 3, loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/doc/rustc-dev-guide/ci/sembr/src/main.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"639449eb75e227b28c8f61825e020547535ffaf2f16293dffaba3fbd108dc494"}},{"ruleId":"D2","level":"warning","message":{"text":"rustdoc::passes::collect_trait_impls::collect_trait_impls (cognitive 39): rustdoc::passes::collect_trait_impls::collect_trait_impls has cognitive complexity 39 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 7 (13 pts), match/switch 2 (8 pts), boolean chains 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/passes/collect_trait_impls.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"eca6a2f47c22995692488805c0968f70bd8d9161ece15d417378b69a15d9bc0d"}},{"ruleId":"D2","level":"warning","message":{"text":"InitializeVisitor::visit_expr (cognitive 39): InitializeVisitor::visit_expr has cognitive complexity 39 (threshold 15). Drivers by points: if/else 14 (30 pts), match/switch 2 (8 pts), boolean chains 1 (nesting depth added 22). 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/tools/clippy/clippy_lints/src/loops/utils.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"2197567ded1eb33ea7f97ab7616276959b87eba1b7c00525267abe01b39c70ce"}},{"ruleId":"D2","level":"warning","message":{"text":"Types::check_ty (cognitive 39): Types::check_ty has cognitive complexity 39 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 4 (12 pts), match/switch 5 (9 pts), boolean chains 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/tools/clippy/clippy_lints/src/types/mod.rs"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"21b804301d8e8bc1cb4c793a49e6d64f842c44d591e9b38a5132314373db575b"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::methods::search_is_some::check (cognitive 39): clippy_lints::methods::search_is_some::check has cognitive complexity 39 (threshold 15). Drivers by points: if/else 20 (34 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/methods/search_is_some.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfcf94eef2b4c3d58413aa4735cfece1cc8c72e789b048aed6c823b2f6b35844"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::transmute::transmute_undefined_repr::check (cognitive 39): clippy_lints::transmute::transmute_undefined_repr::check has cognitive complexity 39 (threshold 15). Drivers by points: if/else 11 (32 pts), boolean chains 4, match/switch 1 (2 pts), loops 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/transmute/transmute_undefined_repr.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c929ce620cd69fc03c98b26143d1877a404d332b34140e710f09e0b83f4cdce"}},{"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/tools/miri/src/shims/unix/freebsd/sync.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"fef19fcaec0cc9ab0b673a49f25bd98ca8cc6257ccc55cd09af727cf32c99dd7"}},{"ruleId":"D2","level":"warning","message":{"text":"InferenceContext::analyze_closure (cognitive 39): InferenceContext::analyze_closure has cognitive complexity 39 (threshold 15). Drivers by points: if/else 16 (30 pts), loops 3 (5 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/infer/closure/analysis.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"e387588a186240107dea72fee7953a628b11efa36cf2bd0de1961fd86c7aa4e6"}},{"ruleId":"D2","level":"warning","message":{"text":"InferenceContext::infer_ref_pat (cognitive 39): InferenceContext::infer_ref_pat has cognitive complexity 39 (threshold 15). Drivers by points: if/else 12 (29 pts), boolean chains 5, match/switch 3 (5 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/infer/pat.rs"},"region":{"startLine":1356}}}],"partialFingerprints":{"codehealthFindingId/v1":"675c0711df159fcb35dea9ebcdfcf1cd08f1af349a9a24bd955c1fc67a5e07be"}},{"ruleId":"D2","level":"warning","message":{"text":"Evaluator::place_addr_and_ty_and_metadata (cognitive 39): Evaluator::place_addr_and_ty_and_metadata has cognitive complexity 39 (threshold 15). Drivers by points: match/switch 8 (27 pts), if/else 5 (11 pts), loops 1 (nesting depth added 25). 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/tools/rust-analyzer/crates/hir-ty/src/mir/eval.rs"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bab84862d761a8d948ea2e3ab8239df53351ec32793cb69e9d6ff405ed98109"}},{"ruleId":"D2","level":"warning","message":{"text":"ide::inlay_hints::closing_brace::hints (cognitive 39): ide::inlay_hints::closing_brace::hints has cognitive complexity 39 (threshold 15). Drivers by points: if/else 16 (27 pts), match/switch 4 (9 pts), boolean chains 3 (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":"src/tools/rust-analyzer/crates/ide/src/inlay_hints/closing_brace.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e5e64010cbccb3e3ddd362f9f497f749c24ff066e4eab4aadffcb251869a791"}},{"ruleId":"D2","level":"warning","message":{"text":"Module::process_def_in_sel (cognitive 39): Module::process_def_in_sel has cognitive complexity 39 (threshold 15). Drivers by points: if/else 11 (23 pts), boolean chains 11, loops 2 (3 pts), match/switch 1 (2 pts) (nesting depth added 14). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/extract_module.rs"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"996a24cfcfab80481add23f078f5f04c7cadcbdbdb7a97e0d31b6efcb1c0eb1e"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_assists::handlers::add_turbo_fish::add_turbo_fish (cognitive 39): ide_assists::handlers::add_turbo_fish::add_turbo_fish has cognitive complexity 39 (threshold 15). Drivers by points: if/else 17 (30 pts), match/switch 7, loops 1 (2 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/add_turbo_fish.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"f118991e59430f540e86d524b8856550cd8014184150d4868abd19550fe3ad12"}},{"ruleId":"D2","level":"warning","message":{"text":"parser::grammar::expressions::atom::parse_asm_expr (cognitive 39): parser::grammar::expressions::atom::parse_asm_expr has cognitive complexity 39 (threshold 15). Drivers by points: if/else 19 (34 pts), boolean chains 4, loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/parser/src/grammar/expressions/atom.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"720720b1834f66983b8e25803c3346a1eb5c1ece20e1edfb3f841151732afb47"}},{"ruleId":"D2","level":"warning","message":{"text":"DeprecatedParser::convert (cognitive 38): DeprecatedParser::convert has cognitive complexity 38 (threshold 15). Drivers by points: if/else 13 (27 pts), match/switch 3 (7 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_attr_parsing/src/attributes/deprecation.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"3991abcfa309194d58d3ddef6ab1d3489acda27cbd1b6d703865633aa20848ef"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_codegen_cranelift::constant::codegen_const_value (cognitive 38): rustc_codegen_cranelift::constant::codegen_const_value has cognitive complexity 38 (threshold 15). Drivers by points: if/else 11 (28 pts), match/switch 4 (10 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/src/constant.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea5e2b9b75964db0a88e10c2a680961502b413562a431192a4a791b1cb8ee361"}},{"ruleId":"D2","level":"warning","message":{"text":"Builder::load_operand (cognitive 38): Builder::load_operand has cognitive complexity 38 (threshold 15). Drivers by points: if/else 20 (36 pts), boolean chains 1, match/switch 1 (nesting depth added 16). Of this number, 28 points are the body\u0027s own statements and 10 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":"compiler/rustc_codegen_llvm/src/builder.rs"},"region":{"startLine":738}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bfb0a0fb064583119243f8ee99d2c4143fc40f7e43be5755f7b905784f7190b"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_hir_analysis::check::compare_impl_item::compare_number_of_method_arguments (cognitive 38): rustc_hir_analysis::check::compare_impl_item::compare_number_of_method_arguments has cognitive complexity 38 (threshold 15). Drivers by points: if/else 17 (35 pts), match/switch 1 (3 pts) (nesting depth added 20). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/check/compare_impl_item.rs"},"region":{"startLine":1779}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2e4dff5e0ff67fe08088d4367d3588aa82941274ee4f039a2c940dd279fef41"}},{"ruleId":"D2","level":"warning","message":{"text":"Resolver::maybe_push_ambiguity (cognitive 38): Resolver::maybe_push_ambiguity has cognitive complexity 38 (threshold 15). Drivers by points: if/else 18 (21 pts), boolean chains 15, match/switch 1 (2 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"compiler/rustc_resolve/src/ident.rs"},"region":{"startLine":829}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a86f6f98cf821bdcee79981686e40d32a5b2396a909b353f5b8e7b973b94a05"}},{"ruleId":"D2","level":"warning","message":{"text":"AssignmentResult::report_unused_assignments (cognitive 38): AssignmentResult::report_unused_assignments has cognitive complexity 38 (threshold 15). Drivers by points: if/else 10 (24 pts), boolean chains 6, loops 3 (5 pts), match/switch 1 (3 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/liveness.rs"},"region":{"startLine":1182}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd9975543df6e9e930ec17c0e44275f61d952d315f58196fc4a24433d5a5b75e"}},{"ruleId":"D2","level":"warning","message":{"text":"ReplacementVisitor::visit_statement (cognitive 38): ReplacementVisitor::visit_statement has cognitive complexity 38 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 5 (15 pts), match/switch 2 (3 pts), boolean chains 1 (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":"compiler/rustc_mir_transform/src/sroa.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"a31cbf9c6145eaa092a69e54161ac2c010507d1c1de22f285ac45d28715fa0f4"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_param_general (cognitive 38): Parser::parse_param_general has cognitive complexity 38 (threshold 15). Drivers by points: if/else 18 (28 pts), boolean chains 5, match/switch 2 (5 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/function.rs"},"region":{"startLine":737}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b93d21bb4d7c4788163d6538c40b84a44ceca5eda092f6fc4da9a2922c33282"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_resolve::check_unused::calc_unused_spans (cognitive 38): rustc_resolve::check_unused::calc_unused_spans has cognitive complexity 38 (threshold 15). Drivers by points: if/else 15 (28 pts), boolean chains 4, match/switch 2 (4 pts), loops 1 (2 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/check_unused.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e91559323698bc46070629cf40b9711adf030bbb7659165f3424ae0a6927fee"}},{"ruleId":"D2","level":"warning","message":{"text":"libm::math::cbrt::cbrt_round (cognitive 38): libm::math::cbrt::cbrt_round has cognitive complexity 38 (threshold 15). Drivers by points: if/else 12 (30 pts), boolean chains 4, loops 1 (4 pts) (nesting depth added 21). 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":"library/compiler-builtins/libm/src/math/cbrt.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"123ef411b97a73c29f59c6dcdac3859735e8fcf6608ebafd8312dee1308ca82d"}},{"ruleId":"D2","level":"warning","message":{"text":"libm::math::jnf::jnf (cognitive 38): libm::math::jnf::jnf has cognitive complexity 38 (threshold 15). Drivers by points: if/else 17 (23 pts), loops 6 (14 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":"library/compiler-builtins/libm/src/math/jnf.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2613d3ccb9130ea2c005c05e98d9bac11f3e686c2e0e9daf25bd33e3f4eb227"}},{"ruleId":"D2","level":"warning","message":{"text":"libm::math::rem_pio2::rem_pio2 (cognitive 38): libm::math::rem_pio2::rem_pio2 has cognitive complexity 38 (threshold 15). Drivers by points: if/else 21 (35 pts), loops 2, boolean chains 1 (nesting depth added 14). Of this number, 35 points are the body\u0027s own statements and 3 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":"library/compiler-builtins/libm/src/math/rem_pio2.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"4400af17ec408a6f7cdb2623521f279b8012b1778cd0fe6b5f2d067397ad08f3"}},{"ruleId":"D2","level":"warning","message":{"text":"Command::fmt (cognitive 38): Command::fmt has cognitive complexity 38 (threshold 15). Drivers by points: if/else 18 (31 pts), loops 3 (7 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/process/unix/common.rs"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"51905b63d1f27805eaeb46dfabaded7f8b7a6142fec2c334df90e7be7ed49241"}},{"ruleId":"D2","level":"warning","message":{"text":"bootstrap::core::build_steps::compile::run_cargo (cognitive 38): bootstrap::core::build_steps::compile::run_cargo has cognitive complexity 38 (threshold 15). Drivers by points: if/else 11 (23 pts), match/switch 4 (8 pts), boolean chains 4, loops 3 (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":"src/bootstrap/src/core/build_steps/compile.rs"},"region":{"startLine":2678}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e076b5bbe55b5863385d307760436c45ae4bf7aaa59d8c5ffb3643d8c64dd53"}},{"ruleId":"D2","level":"warning","message":{"text":"StmtsChecker::visit_expr (cognitive 38): StmtsChecker::visit_expr has cognitive complexity 38 (threshold 15). Drivers by points: if/else 13 (33 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/significant_drop_tightening.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f031cc44cdcb1621058cc728adc124afaac38b19c739fbf2d58b75ed96626ae"}},{"ruleId":"D2","level":"warning","message":{"text":"PeekableVisitor::visit_expr (cognitive 38): PeekableVisitor::visit_expr has cognitive complexity 38 (threshold 15). Drivers by points: if/else 7 (22 pts), match/switch 3 (11 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/unused_peekable.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7c4642b0d74ceea8cbde62395d848283ced1889a75aacfeadf9b4458a29ea66"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::matches::manual_utils::check_with (cognitive 38): clippy_lints::matches::manual_utils::check_with has cognitive complexity 38 (threshold 15). Drivers by points: if/else 18 (24 pts), boolean chains 7, match/switch 4 (7 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/tools/clippy/clippy_lints/src/matches/manual_utils.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"771f4e36565bd1b37b8c8efd980e2f1c5cb8fdcc667f95ec2849772f76f0f2d3"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::methods::unnecessary_to_owned::check (cognitive 38): clippy_lints::methods::unnecessary_to_owned::check has cognitive complexity 38 (threshold 15). Drivers by points: if/else 18 (32 pts), boolean chains 4, match/switch 1 (2 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/methods/unnecessary_to_owned.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"91ca5ea07a3b825c0affc9485c016e7e921ef98b99f5a91b394caf08918646ba"}},{"ruleId":"D2","level":"warning","message":{"text":"compiletest::directives::ignore_llvm (cognitive 38): compiletest::directives::ignore_llvm has cognitive complexity 38 (threshold 15). Drivers by points: if/else 17 (36 pts), boolean chains 2 (nesting depth added 19). 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/tools/compiletest/src/directives.rs"},"region":{"startLine":1249}}}],"partialFingerprints":{"codehealthFindingId/v1":"27e9cec111d77217ce641b091335dc8aacb2f6b0a6eea081181464bb6a62c54e"}},{"ruleId":"D2","level":"warning","message":{"text":"InferenceContext::infer_mut_expr_without_adjust (cognitive 38): InferenceContext::infer_mut_expr_without_adjust has cognitive complexity 38 (threshold 15). Drivers by points: if/else 10 (26 pts), match/switch 4 (8 pts), loops 2 (4 pts) (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/tools/rust-analyzer/crates/hir-ty/src/infer/mutability.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"d46080a4a3b9fc72f39751320df039ddab1443d224253546d74ca4234803f3d5"}},{"ruleId":"D2","level":"warning","message":{"text":"ide::inlay_hints::lifetime::hints_ (cognitive 38): ide::inlay_hints::lifetime::hints_ has cognitive complexity 38 (threshold 15). Drivers by points: if/else 13 (18 pts), match/switch 9 (13 pts), boolean chains 6, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/inlay_hints/lifetime.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"6817a54d4963eb243e4e647bc2faf7f2c73458067f05320cd4c3d9b19c429408"}},{"ruleId":"D2","level":"warning","message":{"text":"ide::syntax_highlighting::highlight::highlight_name_ref (cognitive 38): ide::syntax_highlighting::highlight::highlight_name_ref has cognitive complexity 38 (threshold 15). Drivers by points: if/else 12 (28 pts), match/switch 5 (8 pts), boolean chains 2 (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/tools/rust-analyzer/crates/ide/src/syntax_highlighting/highlight.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"3880c521864993f4940458ff365beb5518ffd65d131caaa630460ea959d4b806"}},{"ruleId":"D2","level":"warning","message":{"text":"rust_analyzer::handlers::request::handle_runnables (cognitive 38): rust_analyzer::handlers::request::handle_runnables has cognitive complexity 38 (threshold 15). Drivers by points: if/else 11 (28 pts), boolean chains 6, loops 2 (3 pts), match/switch 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/handlers/request.rs"},"region":{"startLine":1016}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c9e0d4e53810261bd75ce4b5dac17f5a879e3b57d1376d3bc9d468950bbd23b"}},{"ruleId":"D2","level":"warning","message":{"text":"rust_analyzer::lsp::to_proto::code_lens (cognitive 38): rust_analyzer::lsp::to_proto::code_lens has cognitive complexity 38 (threshold 15). Drivers by points: if/else 9 (29 pts), match/switch 3 (6 pts), boolean chains 3 (nesting depth added 23). 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/tools/rust-analyzer/crates/rust-analyzer/src/lsp/to_proto.rs"},"region":{"startLine":1759}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b53b9aaa267b1d1b760b1853f527f94695f3e14582024823f4eea4d84c435f7"}},{"ruleId":"D2","level":"warning","message":{"text":"DocSearch.buildItemSearchType (cognitive 38): DocSearch.buildItemSearchType has cognitive complexity 38 (threshold 15). Drivers by points: if/else 16 (29 pts), boolean chains 6, loops 1 (3 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":2032}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebd60108c5ac27e7d6bbdd236bf477cb0ca3fe721c45ab1791c586b73a9ec899"}},{"ruleId":"D2","level":"warning","message":{"text":"State::print_item (cognitive 37): State::print_item has cognitive complexity 37 (threshold 15). Drivers by points: if/else 11 (20 pts), loops 3 (7 pts), boolean chains 5, match/switch 3 (5 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ast_pretty/src/pprust/state/item.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bb7e6dc34134fefddd19188fa41e041b6b9276ed7a219005e63d2a69f244394"}},{"ruleId":"D2","level":"warning","message":{"text":"MirBorrowckCtxt::add_move_error_suggestions (cognitive 37): MirBorrowckCtxt::add_move_error_suggestions has cognitive complexity 37 (threshold 15). Drivers by points: if/else 19 (33 pts), boolean chains 2, loops 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/diagnostics/move_errors.rs"},"region":{"startLine":1075}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dd83e5ceb1e7a2a93f57a82e7651972142d6b84ae58fd1b0e7ce5ca1d670f0e"}},{"ruleId":"D2","level":"warning","message":{"text":"MirBorrowckCtxt::note_due_to_edition_2024_opaque_capture_rules (cognitive 37): MirBorrowckCtxt::note_due_to_edition_2024_opaque_capture_rules has cognitive complexity 37 (threshold 15). Drivers by points: if/else 9 (26 pts), loops 3 (8 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/diagnostics/opaque_types.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"c87ccce1d119ed487d38b7e44581970b80fa8d37166de8d4af061386550c70ec"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_codegen_llvm::va_arg::emit_va_arg (cognitive 37): rustc_codegen_llvm::va_arg::emit_va_arg has cognitive complexity 37 (threshold 15). Drivers by points: if/else 14 (21 pts), match/switch 6 (12 pts), boolean chains 4 (nesting depth added 13). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/va_arg.rs"},"region":{"startLine":1070}}}],"partialFingerprints":{"codehealthFindingId/v1":"319eec3b13d3129cdb430db3a5674fc3b3fd44e524e853fe2d93468cec8eaffb"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionCx::retag_operand (cognitive 37): FunctionCx::retag_operand has cognitive complexity 37 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 2 (8 pts), match/switch 3 (8 pts), boolean chains 1 (nesting depth added 23). 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":"compiler/rustc_codegen_ssa/src/mir/retag.rs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2fe6caaedf9431d90903a50f293cc6e4637b63def98dd703a3f044178e66f13"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_hir_analysis::coherence::orphan::orphan_check_impl (cognitive 37): rustc_hir_analysis::coherence::orphan::orphan_check_impl has cognitive complexity 37 (threshold 15). Drivers by points: match/switch 7 (17 pts), if/else 9 (16 pts), loops 1 (4 pts) (nesting depth added 20). 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":"compiler/rustc_hir_analysis/src/coherence/orphan.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"e838c365b633288bcb80d4a0c5b177c861309a45848881215bd0a0bcce6343c6"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::report_binop_fulfillment_errors (cognitive 37): FnCtxt::report_binop_fulfillment_errors has cognitive complexity 37 (threshold 15). Drivers by points: if/else 12 (26 pts), loops 1 (4 pts), match/switch 3 (4 pts), boolean chains 3 (nesting depth added 18). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/op.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"71c1b315708a24787c673cc7359bd3ccfd9cb4f17a6eb938184779f356483067"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::perform_2229_migration_analysis (cognitive 37): FnCtxt::perform_2229_migration_analysis has cognitive complexity 37 (threshold 15). Drivers by points: if/else 10 (19 pts), match/switch 3 (11 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/upvar.rs"},"region":{"startLine":1073}}}],"partialFingerprints":{"codehealthFindingId/v1":"1846772a93ef0af9a9ac89294f9c43480dd86666b0ced27dd149cdfa17087b38"}},{"ruleId":"D2","level":"warning","message":{"text":"Resolver::resolve_ident_in_module (cognitive 37): Resolver::resolve_ident_in_module has cognitive complexity 37 (threshold 15). Drivers by points: if/else 12 (28 pts), match/switch 3 (6 pts), boolean chains 3 (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":"compiler/rustc_resolve/src/ident.rs"},"region":{"startLine":995}}}],"partialFingerprints":{"codehealthFindingId/v1":"5056abdbd3ccc24a07bad671085dbfc63b5cd4e2bc1fc3c3cb9a60a8f3baf12f"}},{"ruleId":"D2","level":"warning","message":{"text":"CrateError::report (cognitive 37): CrateError::report has cognitive complexity 37 (threshold 15). Drivers by points: loops 7 (22 pts), if/else 8 (12 pts), match/switch 2 (3 pts) (nesting depth added 20). 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":"compiler/rustc_metadata/src/locator.rs"},"region":{"startLine":1084}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a5fa928f1526ec1b7685676bc43d5348037592cfed2fc9405704512adeccddb"}},{"ruleId":"D2","level":"warning","message":{"text":"TOFinder::process_switch_int (cognitive 37): TOFinder::process_switch_int has cognitive complexity 37 (threshold 15). Drivers by points: if/else 13 (25 pts), loops 3 (7 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/jump_threading.rs"},"region":{"startLine":680}}}],"partialFingerprints":{"codehealthFindingId/v1":"d09fda938f04f44199a015cedda4868634983a1269cbfd0b6166c734745a0d2f"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_parse::parser::asm::parse_asm_operand (cognitive 37): rustc_parse::parser::asm::parse_asm_operand has cognitive complexity 37 (threshold 15). Drivers by points: if/else 25 (37 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":"compiler/rustc_parse/src/parser/asm.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"c397e0448d3d630f3d60675266a8f926ddef4e726f9c1c76ce37de678a66079b"}},{"ruleId":"D2","level":"warning","message":{"text":"LateResolutionVisitor::detect_missing_binding_available_from_pattern (cognitive 37): LateResolutionVisitor::detect_missing_binding_available_from_pattern has cognitive complexity 37 (threshold 15). Drivers by points: if/else 6 (23 pts), loops 4 (13 pts), boolean chains 1 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/late/diagnostics.rs"},"region":{"startLine":1772}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a0db08f68f2f0817d776289f954cb86e652397ac2aafe7e6f11a175f499cee2"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeStats::print_type_sizes (cognitive 37): CodeStats::print_type_sizes has cognitive complexity 37 (threshold 15). Drivers by points: if/else 10 (22 pts), match/switch 3 (8 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_session/src/code_stats.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3da932c40449c2eae78cadaa9975f547323eba4a0d1f873669d3f6764480688"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_session::options::build_options (cognitive 37): rustc_session::options::build_options has cognitive complexity 37 (threshold 15). Drivers by points: if/else 7 (20 pts), match/switch 5 (16 pts), loops 1 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_session/src/options.rs"},"region":{"startLine":761}}}],"partialFingerprints":{"codehealthFindingId/v1":"e29b8cf644cdb3af7f5ac2b10e7b148e7204e5f174d6cdad49baa24a00096baa"}},{"ruleId":"D2","level":"warning","message":{"text":"TwoWaySearcher::next (cognitive 37): TwoWaySearcher::next has cognitive complexity 37 (threshold 15). Drivers by points: if/else 12 (29 pts), loops 3 (5 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (TwoWaySearcher::next_back) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/str/pattern.rs"},"region":{"startLine":1588}}}],"partialFingerprints":{"codehealthFindingId/v1":"845ea656ad32622268349a6b44edfff85d7c2e27c45f748cafb37853fc40f480"}},{"ruleId":"D2","level":"warning","message":{"text":"TwoWaySearcher::next_back (cognitive 37): TwoWaySearcher::next_back has cognitive complexity 37 (threshold 15). Drivers by points: if/else 12 (29 pts), loops 3 (5 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (TwoWaySearcher::next) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/str/pattern.rs"},"region":{"startLine":1683}}}],"partialFingerprints":{"codehealthFindingId/v1":"851aac692c660310c9dc47c8571147dccf261b4f5393b5011814390b02fd89b5"}},{"ruleId":"D2","level":"warning","message":{"text":"Command::posix_spawn (cognitive 37): Command::posix_spawn has cognitive complexity 37 (threshold 15). Drivers by points: if/else 18 (25 pts), match/switch 4 (7 pts), boolean chains 4, loops 1 (nesting depth added 10). Of this number, 29 points are the body\u0027s own statements and 8 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":"library/std/src/sys/process/unix/unix.rs"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc2a896eaab9507c51f8d589732cf72c37b12cd4c105f87ac018d5c13c011848"}},{"ruleId":"D2","level":"warning","message":{"text":"stdarch_test::disassembly::parse (cognitive 37): stdarch_test::disassembly::parse has cognitive complexity 37 (threshold 15). Drivers by points: if/else 9 (23 pts), boolean chains 5, loops 4 (5 pts), match/switch 1 (4 pts) (nesting depth added 18). Of this number, 30 points are the body\u0027s own statements and 7 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":"library/stdarch/crates/stdarch-test/src/disassembly.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"601d1bb90d128a140961b7dcd71543d02ee682039c0a12af3c414e1e7b1f0428"}},{"ruleId":"D2","level":"warning","message":{"text":"ArbitrarySourceItemOrdering::check_item (cognitive 37): ArbitrarySourceItemOrdering::check_item has cognitive complexity 37 (threshold 15). Drivers by points: if/else 9 (24 pts), loops 3 (6 pts), boolean chains 4, match/switch 2 (3 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/arbitrary_source_item_ordering.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8fe9d8274cf0212364eab23a1c302732ce29d875e711212ac63dfce63c64e2c"}},{"ruleId":"D2","level":"warning","message":{"text":"PassByRefOrValue::check_poly_fn (cognitive 37): PassByRefOrValue::check_poly_fn has cognitive complexity 37 (threshold 15). Drivers by points: if/else 7 (19 pts), match/switch 4 (11 pts), boolean chains 6, 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/tools/clippy/clippy_lints/src/pass_by_ref_or_value.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b1099dd87930b085389cf9db833ea1bdb0bb062df3e7bbeab7babf1e3a2fe25"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::loops::while_let_on_iterator::needs_mutable_borrow (cognitive 37): clippy_lints::loops::while_let_on_iterator::needs_mutable_borrow has cognitive complexity 37 (threshold 15). Drivers by points: if/else 26 (36 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/loops/while_let_on_iterator.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"6665cb9aad3162a4c4cd44e3d3cc76b5745e4df711016c5307085635dd0e4315"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::unit_types::let_unit_value::check (cognitive 37): clippy_lints::unit_types::let_unit_value::check has cognitive complexity 37 (threshold 15). Drivers by points: if/else 12 (26 pts), boolean chains 7, match/switch 1 (4 pts) (nesting depth added 17). 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/tools/clippy/clippy_lints/src/unit_types/let_unit_value.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"5382f8d7fe25b5d42140b60c41bc5a3cbc9a8f7526eae67b4250489f7fa79621"}},{"ruleId":"D2","level":"warning","message":{"text":"HirEqInterExpr::eq_expr (cognitive 37): HirEqInterExpr::eq_expr has cognitive complexity 37 (threshold 15). Drivers by points: boolean chains 29, if/else 2 (4 pts), match/switch 3 (4 pts) (nesting depth added 3). 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/tools/clippy/clippy_utils/src/hir_utils.rs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"57b5879c1dffb52f3c14524c259abb2c8ed9575126883ca211b151235b3cc159"}},{"ruleId":"D2","level":"warning","message":{"text":"MirLowerCtx::lower_expr_as_place_without_adjust (cognitive 37): MirLowerCtx::lower_expr_as_place_without_adjust has cognitive complexity 37 (threshold 15). Drivers by points: if/else 13 (30 pts), match/switch 3 (5 pts), boolean chains 2 (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/tools/rust-analyzer/crates/hir-ty/src/mir/lower/as_place.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"62da5511ff90d17019f323f1fd1b4066da7fa9c56ef48c1f3908f305d1a5ea95"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_diagnostics::handlers::unlinked_file::fixes (cognitive 37): ide_diagnostics::handlers::unlinked_file::fixes has cognitive complexity 37 (threshold 15). Drivers by points: if/else 8 (18 pts), match/switch 4 (11 pts), loops 4 (7 pts), boolean chains 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-diagnostics/src/handlers/unlinked_file.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"574ae8ac53b890d71b1586e06544fd4c416349efd48fbc39dd2b50bd8d67c38e"}},{"ruleId":"D2","level":"warning","message":{"text":"GlobalState::current_status (cognitive 37): GlobalState::current_status has cognitive complexity 37 (threshold 15). Drivers by points: if/else 16 (30 pts), match/switch 1 (3 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/reload.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d84cbf2b3a3ab423668385b3fb919af1b1f70f4922f60afec99773b5f4898f8"}},{"ruleId":"D2","level":"warning","message":{"text":"rust_analyzer::diagnostics::flycheck_to_proto::map_rust_diagnostic_to_lsp (cognitive 37): rust_analyzer::diagnostics::flycheck_to_proto::map_rust_diagnostic_to_lsp has cognitive complexity 37 (threshold 15). Drivers by points: if/else 13 (23 pts), loops 5 (7 pts), match/switch 3 (5 pts), boolean chains 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/diagnostics/flycheck_to_proto.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"396b53d381b9087cd91f034b20a0abebf42850ded8f43a82ec74b758d5eaccc5"}},{"ruleId":"D2","level":"warning","message":{"text":"TtTreeSink::token (cognitive 37): TtTreeSink::token has cognitive complexity 37 (threshold 15). Drivers by points: match/switch 8 (27 pts), if/else 4 (6 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 22). 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/tools/rust-analyzer/crates/syntax-bridge/src/lib.rs"},"region":{"startLine":933}}}],"partialFingerprints":{"codehealthFindingId/v1":"74055379d3a917c401c83d562587f243ad32ee793fa252ff2bda1ca479367eae"}},{"ruleId":"D2","level":"warning","message":{"text":"rustfmt_nightly::items::format_trait (cognitive 37): rustfmt_nightly::items::format_trait has cognitive complexity 37 (threshold 15). Drivers by points: if/else 15 (24 pts), boolean chains 6, match/switch 2 (5 pts), loops 1 (2 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/items.rs"},"region":{"startLine":1173}}}],"partialFingerprints":{"codehealthFindingId/v1":"e25b17aa7ce23d2b364b300bb593f3d1b444bff3c0916fa42b941b680ef40081"}},{"ruleId":"D2","level":"warning","message":{"text":"rustfmt_nightly::parse::macros::parse_macro_args (cognitive 37): rustfmt_nightly::parse::macros::parse_macro_args has cognitive complexity 37 (threshold 15). Drivers by points: if/else 8 (25 pts), match/switch 2 (9 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 25). 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/tools/rustfmt/src/parse/macros/mod.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bb194d317863f6318ab205a3a05e6bac100019656b2837e6dc81e8da554357f"}},{"ruleId":"D2","level":"warning","message":{"text":"rustfmt_nightly::types::join_bounds_inner (cognitive 37): rustfmt_nightly::types::join_bounds_inner has cognitive complexity 37 (threshold 15). Drivers by points: if/else 20 (23 pts), match/switch 7 (8 pts), boolean chains 6 (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/tools/rustfmt/src/types.rs"},"region":{"startLine":1166}}}],"partialFingerprints":{"codehealthFindingId/v1":"f99fea0bd02e53e220c90aee8264002ea425bad66e9a69af57dab649e49809ad"}},{"ruleId":"D2","level":"warning","message":{"text":"MirBorrowckCtxt::explain_impl_static_obligation (cognitive 36): MirBorrowckCtxt::explain_impl_static_obligation has cognitive complexity 36 (threshold 15). Drivers by points: if/else 16 (29 pts), boolean chains 4, loops 1 (2 pts), match/switch 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":"compiler/rustc_borrowck/src/diagnostics/region_errors.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c796f8089926153314e65bef57c172195323ae9c7c40d9e73c8276f6a3cee38"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeChecker::visit_terminator (cognitive 36): TypeChecker::visit_terminator has cognitive complexity 36 (threshold 15). Drivers by points: if/else 8 (20 pts), match/switch 7 (13 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 19). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/type_check/mod.rs"},"region":{"startLine":739}}}],"partialFingerprints":{"codehealthFindingId/v1":"7652b07912e0b911b9684deb999afbaa192c38e4e6edb57ceea3bed9b4eb4098"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_builtin_macros::format::report_invalid_references (cognitive 36): rustc_builtin_macros::format::report_invalid_references has cognitive complexity 36 (threshold 15). Drivers by points: if/else 13 (26 pts), loops 2 (4 pts), boolean chains 3, match/switch 3 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_builtin_macros/src/format.rs"},"region":{"startLine":984}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bead6f175b073b370e1f51ace4f1d1e5dc0c781a4c2553bfcb3a457d9537088"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_codegen_cranelift::cast::clif_int_or_float_cast (cognitive 36): rustc_codegen_cranelift::cast::clif_int_or_float_cast has cognitive complexity 36 (threshold 15). Drivers by points: if/else 17 (24 pts), boolean chains 7, match/switch 2 (5 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/src/cast.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"5167b899ba55ca95f3a1fc2ec7a05b336b353f89d1ac2e495dbef065ceddf48f"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_codegen_llvm::builder::autodiff::match_args_from_caller_to_enzyme (cognitive 36): rustc_codegen_llvm::builder::autodiff::match_args_from_caller_to_enzyme has cognitive complexity 36 (threshold 15). Drivers by points: if/else 10 (22 pts), loops 3 (9 pts), match/switch 2 (5 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/builder/autodiff.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"8df9c6bcb4ec10a7836875f0331f86d0cc76cf907cdc6413e2e2e300006dba2e"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionCx::debug_introduce_local (cognitive 36): FunctionCx::debug_introduce_local has cognitive complexity 36 (threshold 15). Drivers by points: if/else 14 (21 pts), match/switch 5 (9 pts), boolean chains 5, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/mir/debuginfo.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"efa6e1a400c42b49cce753f977465f16cf2f4b164f8b110bdd55300284dbfec7"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_codegen_ssa::back::link::link_rlib (cognitive 36): rustc_codegen_ssa::back::link::link_rlib has cognitive complexity 36 (threshold 15). Drivers by points: if/else 15 (26 pts), loops 4 (5 pts), match/switch 3 (4 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/back/link.rs"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad2d1e5f5e06c3bb3c864622b052e647a8ce589f992d42e16f23e3fc0a40df9c"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_codegen_ssa::target_features::parse_rust_feature_list (cognitive 36): rustc_codegen_ssa::target_features::parse_rust_feature_list has cognitive complexity 36 (threshold 15). Drivers by points: if/else 9 (25 pts), loops 4 (11 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/target_features.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"0606342d5954fb7ccf298a832c8a712cb5247404595a1dfbad756997e05d5c15"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_hir_analysis::check::check::check_transparent (cognitive 36): rustc_hir_analysis::check::check::check_transparent has cognitive complexity 36 (threshold 15). Drivers by points: if/else 15 (24 pts), match/switch 3 (6 pts), boolean chains 4, loops 1 (2 pts) (nesting depth added 13). Of this number, 23 points are the body\u0027s own statements and 13 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":"compiler/rustc_hir_analysis/src/check/check.rs"},"region":{"startLine":1782}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1bac420466f5a98df2186db3fb7fc04ef1290f267a9822e32dee3a2463f8fe2"}},{"ruleId":"D2","level":"warning","message":{"text":"Resolver::finalize_macro_resolutions (cognitive 36): Resolver::finalize_macro_resolutions has cognitive complexity 36 (threshold 15). Drivers by points: match/switch 5 (15 pts), if/else 6 (14 pts), loops 4 (5 pts), boolean chains 2 (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":"compiler/rustc_resolve/src/macros.rs"},"region":{"startLine":907}}}],"partialFingerprints":{"codehealthFindingId/v1":"06ac4cf5f61707792e1152de4aa357325b7ce614890d920f7dfaf78c0d11ef3f"}},{"ruleId":"D2","level":"warning","message":{"text":"LexicalResolver::expansion (cognitive 36): LexicalResolver::expansion has cognitive complexity 36 (threshold 15). Drivers by points: match/switch 6 (19 pts), if/else 5 (15 pts), loops 2 (nesting depth added 23). 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":"compiler/rustc_infer/src/infer/lexical_region_resolve/mod.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"d73bcd159be26dcc407dfd1b4d3c15cca6089db408d7176bd457401a669f5a08"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_passes::stability::stability_implications (cognitive 36): rustc_passes::stability::stability_implications has cognitive complexity 36 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 4 (15 pts), boolean chains 2 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_passes/src/stability.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"94daea269258dd9e49c97030c833106d74610111183d0b469904c1f4d920d915"}},{"ruleId":"D2","level":"warning","message":{"text":"LateResolutionVisitor::maybe_report_lifetime_uses (cognitive 36): LateResolutionVisitor::maybe_report_lifetime_uses has cognitive complexity 36 (threshold 15). Drivers by points: if/else 13 (27 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":"compiler/rustc_resolve/src/late/diagnostics.rs"},"region":{"startLine":4105}}}],"partialFingerprints":{"codehealthFindingId/v1":"b21774f8845269c716d8e80e13b427b93059362ad3d88ef455c8179c6169d037"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_trait_selection::traits::project::assemble_candidates_from_impls (cognitive 36): rustc_trait_selection::traits::project::assemble_candidates_from_impls has cognitive complexity 36 (threshold 15). Drivers by points: if/else 9 (17 pts), match/switch 7 (16 pts), boolean chains 3 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/traits/project.rs"},"region":{"startLine":976}}}],"partialFingerprints":{"codehealthFindingId/v1":"472b3f8428a9f6d36966946e85411deeac70be4ab9c3afd27d3106b3679d1514"}},{"ruleId":"D2","level":"warning","message":{"text":"Sysroot::run (cognitive 36): Sysroot::run has cognitive complexity 36 (threshold 15). Drivers by points: if/else 16 (29 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/build_steps/compile.rs"},"region":{"startLine":1946}}}],"partialFingerprints":{"codehealthFindingId/v1":"962d3c51e41708b13ae0c771e0182dc0f949e99d692dbff8c3b165a605c4a28b"}},{"ruleId":"D2","level":"warning","message":{"text":"NonminimalBoolVisitor::bool_expr (cognitive 36): NonminimalBoolVisitor::bool_expr has cognitive complexity 36 (threshold 15). Drivers by points: if/else 9 (22 pts), loops 3 (7 pts), boolean chains 4, match/switch 1 (3 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/booleans.rs"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"a81a3f95519aa0238bb6f7a26f8cce686172c6d57c35a9860103787724d09f60"}},{"ruleId":"D2","level":"warning","message":{"text":"NumericFallbackVisitor::visit_expr (cognitive 36): NumericFallbackVisitor::visit_expr has cognitive complexity 36 (threshold 15). Drivers by points: if/else 9 (21 pts), loops 4 (12 pts), boolean chains 2, match/switch 1 (nesting depth added 20). 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/tools/clippy/clippy_lints/src/default_numeric_fallback.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"f09ba023214205edb0bf8e9202e39b8486876bd6a905569cdd9a46f2ac4a86e1"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::matches::match_wild_err_arm::check (cognitive 36): clippy_lints::matches::match_wild_err_arm::check has cognitive complexity 36 (threshold 15). Drivers by points: if/else 7 (26 pts), loops 2 (8 pts), boolean chains 2 (nesting depth added 25). 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/tools/clippy/clippy_lints/src/matches/match_wild_err_arm.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a454698696ae2cfc209964d73587cbd0fa3109b90d22ffec51b898918416c81"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::option_if_let_else::try_get_option_occurrence (cognitive 36): clippy_lints::option_if_let_else::try_get_option_occurrence has cognitive complexity 36 (threshold 15). Drivers by points: if/else 10 (18 pts), match/switch 5 (12 pts), boolean chains 6 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/option_if_let_else.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eea59744931c39d7161cf652196ea4dcf9a48c406e8f364b94cc6c00ddfaad1"}},{"ruleId":"D2","level":"warning","message":{"text":"ExprCollector::maybe_collect_expr_as_pat (cognitive 36): ExprCollector::maybe_collect_expr_as_pat has cognitive complexity 36 (threshold 15). Drivers by points: if/else 12 (24 pts), match/switch 7 (11 pts), boolean chains 1 (nesting depth added 16). Of this number, 23 points are the body\u0027s own statements and 13 belong to 3 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/expr_store/lower.rs"},"region":{"startLine":2086}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e53a01b76923cd46dfe5ba530227d7dd99dac751fe99db822e42c96c3e9bd99"}},{"ruleId":"D2","level":"warning","message":{"text":"Pat::hir_fmt (cognitive 36): Pat::hir_fmt has cognitive complexity 36 (threshold 15). Drivers by points: if/else 9 (23 pts), match/switch 5 (11 pts), boolean chains 2 (nesting depth added 20). 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/tools/rust-analyzer/crates/hir-ide/src/diagnostics/match_check.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea407742cb981824745a1c7115956a37ba72ca42bafdc304396ad8dd5732cf23"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_assists::handlers::apply_demorgan::apply_demorgan (cognitive 36): ide_assists::handlers::apply_demorgan::apply_demorgan has cognitive complexity 36 (threshold 15). Drivers by points: if/else 17 (30 pts), match/switch 2 (3 pts), loops 2, 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/tools/rust-analyzer/crates/ide-assists/src/handlers/apply_demorgan.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"edc439462250d3577f5fa1162797d23aef6256bde30e7077fdb29979550d8cbd"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_completion::completions::item_list::add_keywords (cognitive 36): ide_completion::completions::item_list::add_keywords has cognitive complexity 36 (threshold 15). Drivers by points: if/else 17 (28 pts), boolean chains 8 (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/tools/rust-analyzer/crates/ide-completion/src/completions/item_list.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b7a7658727de15e12527bcdd64d9e28d32881767a03b65d7c81fa6f90184bd4"}},{"ruleId":"D2","level":"warning","message":{"text":"rustfmt_nightly::comment::identify_comment (cognitive 36): rustfmt_nightly::comment::identify_comment has cognitive complexity 36 (threshold 15). Drivers by points: if/else 16 (27 pts), boolean chains 5, loops 2 (3 pts), match/switch 1 (nesting depth added 12). Of this number, 25 points are the body\u0027s own statements and 11 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/comment.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"123f019f2ff554387be7d1d0897c8db3a56d0ce81ac004dfb8193549394610c1"}},{"ruleId":"D2","level":"warning","message":{"text":"main.register_implementors (cognitive 36): main.register_implementors has cognitive complexity 36 (threshold 15). Drivers by points: if/else 10 (22 pts), loops 3 (7 pts), ternaries 3 (5 pts), boolean chains 2 (nesting depth added 18). Of this number, 29 points are the body\u0027s own statements and 7 belong to 3 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/main.js"},"region":{"startLine":791}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aeb2c4e8baced4004e78cd741923d2a81bf4b9dd92ade7f59225333fb58b3fc"}},{"ruleId":"D2","level":"warning","message":{"text":"initSearch::execQuery::unifyGenericTypes (cognitive 36): initSearch::execQuery::unifyGenericTypes has cognitive complexity 36 (threshold 15). Drivers by points: if/else 14 (27 pts), boolean chains 6, ternaries 2 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":3353}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2af7d10d6c01ff84da2940fb9b4dfc4f67790b8ec922a171487a5ec08a101e8"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_builtin_macros::autodiff::llvm_enzyme::expand_with_mode (cognitive 35): rustc_builtin_macros::autodiff::llvm_enzyme::expand_with_mode has cognitive complexity 35 (threshold 15). Drivers by points: if/else 13 (21 pts), match/switch 9 (12 pts), boolean chains 1, loops 1 (nesting depth added 11). Of this number, 34 points are the body\u0027s own statements and 1 belongs 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":"compiler/rustc_builtin_macros/src/autodiff.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"6acb62441796935d4eb240810ac419080423a060023a7e9c72de5b936ca21643"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_builtin_macros::format_foreign::printf::parse_next_substitution (cognitive 35): rustc_builtin_macros::format_foreign::printf::parse_next_substitution has cognitive complexity 35 (threshold 15). Drivers by points: match/switch 9 (19 pts), if/else 11 (16 pts) (nesting depth added 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. 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":"compiler/rustc_builtin_macros/src/format_foreign/printf/mod.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aa6afa5deefd0a084746db3556cfd3a4ba0d3415431fb8febc27eac0ad3fcad"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_codegen_cranelift::scripts::filter_profile::main (cognitive 35): rustc_codegen_cranelift::scripts::filter_profile::main has cognitive complexity 35 (threshold 15). Drivers by points: if/else 18 (32 pts), boolean chains 2, loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/scripts/filter_profile.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"1065568d93323675c3438b7a430d2b8edee14aab6bf5c96e025e7488f16c441e"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_codegen_llvm::back::write::codegen (cognitive 35): rustc_codegen_llvm::back::write::codegen has cognitive complexity 35 (threshold 15). Drivers by points: if/else 16 (29 pts), boolean chains 3, match/switch 2 (3 pts) (nesting depth added 14). Of this number, 29 points are the body\u0027s own statements and 6 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":"compiler/rustc_codegen_llvm/src/back/write.rs"},"region":{"startLine":971}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed56d789a070a3180c368300f156dca457e62a688b94b2859b85daf57ab212ce"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionCx::codegen_statement (cognitive 35): FunctionCx::codegen_statement has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (30 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 20). 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":"compiler/rustc_codegen_ssa/src/mir/statement.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc6c41b304ec3b5749599a74101a7271843713c5db68cd41b68bc022663f58ec"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_codegen_ssa::back::link::link_staticlib (cognitive 35): rustc_codegen_ssa::back::link::link_staticlib has cognitive complexity 35 (threshold 15). Drivers by points: if/else 15 (21 pts), boolean chains 11, loops 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/back/link.rs"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fa7571a9afa6b0d7f2f21314b315bbaf7fde28bfb7342254db4df9ae703c2f4"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_hir_analysis::diagnostics::remove_or_use_generic::suggest_to_remove_or_use_generic (cognitive 35): rustc_hir_analysis::diagnostics::remove_or_use_generic::suggest_to_remove_or_use_generic has cognitive complexity 35 (threshold 15). Drivers by points: if/else 22 (29 pts), boolean chains 3, match/switch 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"compiler/rustc_hir_analysis/src/diagnostics/remove_or_use_generic.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"b864f8ee650054fcf149b63de4227aa2bda187fde35c485620ea43b9b3ae01b6"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::suggest_unsatisfied_ty_or_trait (cognitive 35): FnCtxt::suggest_unsatisfied_ty_or_trait has cognitive complexity 35 (threshold 15). Drivers by points: if/else 14 (23 pts), boolean chains 5, match/switch 1 (4 pts), loops 1 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/method/suggest.rs"},"region":{"startLine":881}}}],"partialFingerprints":{"codehealthFindingId/v1":"a651d02c40af52fc23baca421cddd76dee971809e0c7d985302441b740ccf256"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::suggest_associated_call_syntax (cognitive 35): FnCtxt::suggest_associated_call_syntax has cognitive complexity 35 (threshold 15). Drivers by points: if/else 16 (27 pts), match/switch 2 (6 pts), boolean chains 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/method/suggest.rs"},"region":{"startLine":2698}}}],"partialFingerprints":{"codehealthFindingId/v1":"57310e47053f569fda4b45b733f9e03a66fbc4fac42df014c15f5776d15a0ab1"}},{"ruleId":"D2","level":"warning","message":{"text":"UnsafetyVisitor::visit_pat (cognitive 35): UnsafetyVisitor::visit_pat has cognitive complexity 35 (threshold 15). Drivers by points: if/else 10 (24 pts), match/switch 3 (6 pts), loops 2 (5 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_build/src/check_unsafety.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dab6eda06341276287a7dfbbeabfb7405bc32630b46bfd3725b306378c2e4c6"}},{"ruleId":"D2","level":"warning","message":{"text":"ConstToPat::valtree_to_pat (cognitive 35): ConstToPat::valtree_to_pat has cognitive complexity 35 (threshold 15). Drivers by points: if/else 10 (17 pts), match/switch 4 (8 pts), boolean chains 7, loops 1 (3 pts) (nesting depth added 13). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_build/src/thir/pattern/const_to_pat.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"f22f2aa6b37015bd19fe5f7e47c5e2f60c453e6fd009538dc99da13e8f7dfd6c"}},{"ruleId":"D2","level":"warning","message":{"text":"VnState::simplify_cast (cognitive 35): VnState::simplify_cast has cognitive complexity 35 (threshold 15). Drivers by points: if/else 13 (27 pts), boolean chains 4, match/switch 1 (3 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":"compiler/rustc_mir_transform/src/gvn.rs"},"region":{"startLine":1565}}}],"partialFingerprints":{"codehealthFindingId/v1":"f03ad2bd8a46a3ff6379b589b4d7496031f1d25252cf140a7e16f653e699d26f"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_generic_params (cognitive 35): Parser::parse_generic_params has cognitive complexity 35 (threshold 15). Drivers by points: if/else 15 (28 pts), match/switch 2 (5 pts), boolean chains 1, 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":"compiler/rustc_parse/src/parser/generics.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"673498d79c99b9b149fd6571dacadb65189c5ac85c5bccd0ba862454ba2fa72a"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_item_impl (cognitive 35): Parser::parse_item_impl has cognitive complexity 35 (threshold 15). Drivers by points: if/else 20 (26 pts), boolean chains 6, match/switch 2 (3 pts) (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/item.rs"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e723be5621e7142cf802a95633fcd765888a4ed95e17eb4074c6c47982e61b8"}},{"ruleId":"D2","level":"warning","message":{"text":"LateResolutionVisitor::lookup_typo_candidate (cognitive 35): LateResolutionVisitor::lookup_typo_candidate has cognitive complexity 35 (threshold 15). Drivers by points: if/else 13 (25 pts), loops 2 (5 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/late/diagnostics.rs"},"region":{"startLine":3362}}}],"partialFingerprints":{"codehealthFindingId/v1":"62da0b9e67ccbc995540dd588e8aaf42855c13f177a700f50962b838e15e6207"}},{"ruleId":"D2","level":"warning","message":{"text":"compiler_builtins::float::mul::mul (cognitive 35): compiler_builtins::float::mul::mul has cognitive complexity 35 (threshold 15). Drivers by points: if/else 21 (34 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/compiler-builtins/compiler-builtins/src/float/mul.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"469b4bbc044425b6d3c6ab8b3af07b036ecdfb8485c41f7deb022884cab311d5"}},{"ruleId":"D2","level":"warning","message":{"text":"Install::deserialize (cognitive 35): Install::deserialize has cognitive complexity 35 (threshold 15). Drivers by points: if/else 7 (21 pts), match/switch 9 (13 pts), loops 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/config/toml/install.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"7371db7008457a0c265ed27723e696119280cf61c01f8c6ff1f82aef32cb29cc"}},{"ruleId":"D2","level":"warning","message":{"text":"Stripper::fold_item (cognitive 35): Stripper::fold_item has cognitive complexity 35 (threshold 15). Drivers by points: if/else 16 (30 pts), boolean chains 3, match/switch 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/passes/strip_hidden.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"f061fcde20c94504578c449891e52b7d287706334e885bd759ac0e0e57477006"}},{"ruleId":"D2","level":"warning","message":{"text":"rustdoc::main_args (cognitive 35): rustdoc::main_args has cognitive complexity 35 (threshold 15). Drivers by points: if/else 16 (22 pts), match/switch 6 (7 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/lib.rs"},"region":{"startLine":826}}}],"partialFingerprints":{"codehealthFindingId/v1":"6827f9301829f91c5aa3a1bb5524e3749031ff9b5bab61b5b46a2e184d471f7b"}},{"ruleId":"D2","level":"warning","message":{"text":"UselessFormat::check_expr (cognitive 35): UselessFormat::check_expr has cognitive complexity 35 (threshold 15). Drivers by points: if/else 9 (22 pts), match/switch 3 (9 pts), boolean chains 4 (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/tools/clippy/clippy_lints/src/format.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"8100728e7af0af4e73616fee260f7742e918a92b51171775708605de1eb999d6"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::matches::match_wild_enum::check (cognitive 35): clippy_lints::matches::match_wild_enum::check has cognitive complexity 35 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 7 (12 pts), boolean chains 7, loops 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/matches/match_wild_enum.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3115549c3ce5808898806930836a6a7158399710f90c5cb49e5c252b1adb475"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::suspicious_operation_groupings::check_binops (cognitive 35): clippy_lints::suspicious_operation_groupings::check_binops has cognitive complexity 35 (threshold 15). Drivers by points: if/else 11 (26 pts), loops 2 (4 pts), match/switch 2 (4 pts), boolean chains 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/tools/clippy/clippy_lints/src/suspicious_operation_groupings.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"5581f3cf6bf04d621f2d63bfbde631b22c80eeb0d98ce1c0d32f7bb23bd66b16"}},{"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/tools/miri/src/bin/log/tracing_chrome.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c6dd28bc29f82f613e71e2bff509eda9bbda97908c3004f5137a3d7d7248f35"}},{"ruleId":"D2","level":"warning","message":{"text":"DefMap::resolve_remaining_segments (cognitive 35): DefMap::resolve_remaining_segments has cognitive complexity 35 (threshold 15). Drivers by points: if/else 9 (20 pts), match/switch 5 (14 pts), loops 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/nameres/path_resolution.rs"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba0d0d1fa4ee53aeeed25766c715b8eb5b83ba9dd8414b080ea7f2332516e1f7"}},{"ruleId":"D2","level":"warning","message":{"text":"ExprValidator::check_for_unnecessary_else (cognitive 35): ExprValidator::check_for_unnecessary_else has cognitive complexity 35 (threshold 15). Drivers by points: if/else 9 (27 pts), loops 1 (4 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 23). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ide/src/diagnostics/expr.rs"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a57185dcebf07add6e0c248d12924f604be5eb0ae3a8612843ba263ae07cf62"}},{"ruleId":"D2","level":"warning","message":{"text":"hir_ide::display::render_const_scalar_from_valtree_inner (cognitive 35): hir_ide::display::render_const_scalar_from_valtree_inner has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (26 pts), match/switch 3 (5 pts), loops 2 (4 pts) (nesting depth added 18). 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/tools/rust-analyzer/crates/hir-ide/src/display.rs"},"region":{"startLine":1094}}}],"partialFingerprints":{"codehealthFindingId/v1":"b92fdaf139e641d4fd4313b3ec2d89fed33aa5666f9451d08e1aa01cacf8bec5"}},{"ruleId":"D2","level":"warning","message":{"text":"InferenceContext::try_find_coercion_lub (cognitive 35): InferenceContext::try_find_coercion_lub has cognitive complexity 35 (threshold 15). Drivers by points: if/else 14 (17 pts), match/switch 5 (11 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 10). 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/tools/rust-analyzer/crates/hir-ty/src/infer/coerce.rs"},"region":{"startLine":926}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc5c165c76dcbbede93a97c13bd401f7371dc8e583640349de8333550574afdc"}},{"ruleId":"D2","level":"warning","message":{"text":"Evaluator::create_memory_map::rec (cognitive 35): Evaluator::create_memory_map::rec has cognitive complexity 35 (threshold 15). Drivers by points: loops 5 (15 pts), match/switch 6 (13 pts), if/else 3 (7 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/mir/eval.rs"},"region":{"startLine":2223}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d3436db2c682e73e01dde42d6c1daf76cd35882e64c40f4e690742312765eed"}},{"ruleId":"D2","level":"warning","message":{"text":"Filler::fill_body (cognitive 35): Filler::fill_body has cognitive complexity 35 (threshold 15). Drivers by points: match/switch 5 (20 pts), loops 5 (13 pts), if/else 1 (2 pts) (nesting depth added 24). 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/tools/rust-analyzer/crates/hir-ty/src/mir/monomorphization.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"edaab7800319148b0527c0cd3fc88bab88df1b62ef5251436740e1842f110d0e"}},{"ruleId":"D2","level":"warning","message":{"text":"ide::annotations::annotations (cognitive 35): ide::annotations::annotations has cognitive complexity 35 (threshold 15). Drivers by points: if/else 14 (23 pts), boolean chains 5, match/switch 4 (5 pts), loops 1 (2 pts) (nesting depth added 11). Of this number, 29 points are the body\u0027s own statements and 6 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/tools/rust-analyzer/crates/ide/src/annotations.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"504d4673d4ffdc1fb96fc902a9bf660a0a59f650043d2bb4a2aaa092bf0d4070"}},{"ruleId":"D2","level":"warning","message":{"text":"ide::signature_help::signature_help_for_call (cognitive 35): ide::signature_help::signature_help_for_call has cognitive complexity 35 (threshold 15). Drivers by points: if/else 11 (17 pts), match/switch 8 (17 pts), loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/signature_help.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"11a08aed65ef6b992cb8ed4490618a9d0ca49bbfee536f5932b86a244675f571"}},{"ruleId":"D2","level":"warning","message":{"text":"ide::view_syntax_tree::syntax_node_to_json (cognitive 35): ide::view_syntax_tree::syntax_node_to_json has cognitive complexity 35 (threshold 15). Drivers by points: if/else 5 (15 pts), match/switch 5 (15 pts), loops 2 (5 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/view_syntax_tree.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"02f14667952ff66f5f11f4bb037621bcbb0ee5c1e40b424e387f714bdca5ed7b"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_assists::handlers::extract_function::update_external_control_flow (cognitive 35): ide_assists::handlers::extract_function::update_external_control_flow has cognitive complexity 35 (threshold 15). Drivers by points: if/else 6 (24 pts), match/switch 3 (9 pts), boolean chains 1, loops 1 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/extract_function.rs"},"region":{"startLine":2128}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a153f41c4683a96b35cc268e159e53b2fe33668689a0b030dd2a5fa2caa629a"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_assists::handlers::generate_new::generate_new (cognitive 35): ide_assists::handlers::generate_new::generate_new has cognitive complexity 35 (threshold 15). Drivers by points: if/else 14 (24 pts), match/switch 4 (6 pts), loops 1 (4 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_new.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7338a371e8cbbbab70977aa11cb42f9190a7efef5fd514dabbe45b7bbd485d9"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_completion::render::function::add_call_parens (cognitive 35): ide_completion::render::function::add_call_parens has cognitive complexity 35 (threshold 15). Drivers by points: if/else 13 (21 pts), match/switch 4 (12 pts), boolean chains 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-completion/src/render/function.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f6a8f4af4cf4bd52c7618abdbe54f3b561e4ee694e6c8eb2a12a5b4fcb2d265"}},{"ruleId":"D2","level":"warning","message":{"text":"Reader::read_tokenstream (cognitive 35): Reader::read_tokenstream has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (23 pts), match/switch 4 (11 pts), loops 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/proc-macro-api/src/legacy_protocol/msg/flat.rs"},"region":{"startLine":871}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f6a6e780b00325612a68f4ab72d21f24306dd97411ea7ed8ce5729fdc04f2c3"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkspaceBuildScripts::build_command (cognitive 35): WorkspaceBuildScripts::build_command has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (28 pts), match/switch 3 (7 pts) (nesting depth added 20). 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/tools/rust-analyzer/crates/project-model/src/build_dependencies.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"409fe7e972674f70c03a018eff2c62a363d72edebb17f0a61513e28408bd0e56"}},{"ruleId":"D2","level":"warning","message":{"text":"Context::try_overflow_last_item (cognitive 35): Context::try_overflow_last_item has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (25 pts), boolean chains 7, match/switch 2 (3 pts) (nesting depth added 14). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/overflow.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"27cf4f21019878eee9062633bd09f70cb83a040d0912b350ea408d5335c3751f"}},{"ruleId":"D2","level":"warning","message":{"text":"DocSearch.execQuery::unifyGenericTypes (cognitive 35): DocSearch.execQuery::unifyGenericTypes has cognitive complexity 35 (threshold 15). Drivers by points: if/else 14 (27 pts), boolean chains 5, ternaries 2 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 7 other methods here (DocSearch.execQuery::buildHrefAndPath, DocSearch.execQuery::formatDisplayTypeSignature::writeFn, DocSearch.execQuery::transformResults, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":3353}}}],"partialFingerprints":{"codehealthFindingId/v1":"d607dbfd6a56662f9b0f3dc69cbcd39f008b8e0c181a86867b4bd8df88327022"}},{"ruleId":"D2","level":"warning","message":{"text":"search.initSearch::unifyGenericTypes (cognitive 35): search.initSearch::unifyGenericTypes has cognitive complexity 35 (threshold 15). Drivers by points: if/else 14 (27 pts), boolean chains 5, ternaries 2 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 15 other methods here (search.initSearch, search.initSearch::getItemsBefore, search.initSearch::getNextElem, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 16 times rather than 16 independent problems. Splitting this body alone leaves the other 15 exactly as they are. Where these are variations on one operation, the change that clears all 16 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":3353}}}],"partialFingerprints":{"codehealthFindingId/v1":"76202b5702849a9a6bcd9b0e192bf65124580db8b05f3d8b15b757032497a023"}},{"ruleId":"D2","level":"warning","message":{"text":"initSearch::execQuery::innerRunTypeQuery (cognitive 35): initSearch::execQuery::innerRunTypeQuery has cognitive complexity 35 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 9 (16 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":4228}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ca81bd09cc3c8a0761ac821fb0fa09fb9ce6d39b7b90e19a9c20e7f8195beda"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_codegen_ssa::back::link::report_linker_output (cognitive 34): rustc_codegen_ssa::back::link::report_linker_output has cognitive complexity 34 (threshold 15). Drivers by points: if/else 19 (23 pts), boolean chains 9, loops 1 (2 pts) (nesting depth added 5). Of this number, 28 points are the body\u0027s own statements and 6 belong to 2 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/back/link.rs"},"region":{"startLine":1061}}}],"partialFingerprints":{"codehealthFindingId/v1":"94ec8e557ecde931ac4f276afb4b28b56dca82e945cb5f2d9c48c635cacda7d9"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_codegen_ssa::back::linker::get_linker (cognitive 34): rustc_codegen_ssa::back::linker::get_linker has cognitive complexity 34 (threshold 15). Drivers by points: if/else 11 (19 pts), match/switch 4 (8 pts), boolean chains 5, loops 1 (2 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/back/linker.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4425c48e1e5493b414361e0bb1410f5b1424c64e6c076310c197e19adeee742"}},{"ruleId":"D2","level":"warning","message":{"text":"InterpCx::init_stack_frame (cognitive 34): InterpCx::init_stack_frame has cognitive complexity 34 (threshold 15). Drivers by points: if/else 15 (23 pts), boolean chains 4, loops 2 (4 pts), match/switch 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_const_eval/src/interpret/call.rs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"a48b37ea7fae171f0cda302ac746454dd0c4fc71197fed4a245243705e970411"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::suggest_missing_break_or_return_expr (cognitive 34): FnCtxt::suggest_missing_break_or_return_expr has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 7, match/switch 3 (6 pts), loops 1 (2 pts) (nesting depth added 14). Most of this is not in the body itself: 14 of the 34 points are its own statements and the rest belongs to one function item inside it that branches (is_in_arm). 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":"compiler/rustc_hir_typeck/src/fn_ctxt/suggestions.rs"},"region":{"startLine":1303}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cfcc5de66d9ac4bbc1114de1de3e952fafce14320ca3bda4c53731bc06ddad5"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::set_not_found_span_label (cognitive 34): FnCtxt::set_not_found_span_label has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (23 pts), match/switch 3 (9 pts), boolean chains 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/method/suggest.rs"},"region":{"startLine":1443}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbf991e5bcb59703651368e80c2c39f6bf491922c41210886baff0091c781e1f"}},{"ruleId":"D2","level":"warning","message":{"text":"Resolver::try_resolve_visibility (cognitive 34): Resolver::try_resolve_visibility has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (25 pts), match/switch 4 (9 pts) (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":"compiler/rustc_resolve/src/build_reduced_graph.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"85c9b002cf89b1d49bd46677a59742234c227261fbc60b60b04f92ea14ffcd50"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_incremental::persist::fs::garbage_collect_session_directories (cognitive 34): rustc_incremental::persist::fs::garbage_collect_session_directories has cognitive complexity 34 (threshold 15). Drivers by points: if/else 17 (28 pts), loops 3, match/switch 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_incremental/src/persist/fs.rs"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"80be80a4977b93c25f3f5ced58eda3eb73776fb9c500557aa66e803b35b8ab92"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_mir_dataflow::impls::precise_liveness::liveness_matrix (cognitive 34): rustc_mir_dataflow::impls::precise_liveness::liveness_matrix has cognitive complexity 34 (threshold 15). Drivers by points: loops 7 (17 pts), if/else 6 (14 pts), boolean chains 3 (nesting depth added 18). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_dataflow/src/impls/precise_liveness.rs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d1c7cdcf9c55f7d5099388409c68bbd5aed84eead3be945145ae57cf3d6adf2"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::collect_tokens (cognitive 34): Parser::collect_tokens has cognitive complexity 34 (threshold 15). Drivers by points: if/else 21 (27 pts), boolean chains 5, loops 2 (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":"compiler/rustc_parse/src/parser/attr_wrapper.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"db705387393b0f128ce84111998b5515585c3d98aaa4de29f8a0fb60ca6b3623"}},{"ruleId":"D2","level":"warning","message":{"text":"AmdgpuInlineAsmReg::parse (cognitive 34): AmdgpuInlineAsmReg::parse has cognitive complexity 34 (threshold 15). Drivers by points: if/else 17 (34 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_target/src/asm/amdgpu.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"91375b6c225083ae256b8adf84e4669916c119f7a411b857ddff0b0d625fbf64"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkerThread::wait_for_jobs (cognitive 34): WorkerThread::wait_for_jobs has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (21 pts), loops 4 (8 pts), match/switch 1 (5 pts) (nesting depth added 20). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_thread_pool/src/registry.rs"},"region":{"startLine":809}}}],"partialFingerprints":{"codehealthFindingId/v1":"f11a210cd9db892eae51f8e064abeb1ff80d8022c6ad309e486646349495e09a"}},{"ruleId":"D2","level":"warning","message":{"text":"libm::math::expm1::expm1 (cognitive 34): libm::math::expm1::expm1 has cognitive complexity 34 (threshold 15). Drivers by points: if/else 23 (34 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/compiler-builtins/libm/src/math/expm1.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e1924602f53a26382bc60582c0751faf0b47d044c574d860f730ebe8c5360d2"}},{"ruleId":"D2","level":"warning","message":{"text":"libm::math::expm1f::expm1f (cognitive 34): libm::math::expm1f::expm1f has cognitive complexity 34 (threshold 15). Drivers by points: if/else 23 (34 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/compiler-builtins/libm/src/math/expm1f.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7b6064f6408335f467f70e9941cd99da619e659711abdcc4e563fe47ff1bb26"}},{"ruleId":"D2","level":"warning","message":{"text":"Command::fmt (cognitive 34): Command::fmt has cognitive complexity 34 (threshold 15). Drivers by points: if/else 14 (27 pts), loops 3 (7 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/process/unsupported.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"a509dcd40f2cfa0a9e9fecece546ecf896692dcc437a88d2297fea0c523efe92"}},{"ruleId":"D2","level":"warning","message":{"text":"Display::fmt (cognitive 34): Display::fmt has cognitive complexity 34 (threshold 15). Drivers by points: if/else 11 (19 pts), match/switch 8 (15 pts) (nesting depth added 15). Of this number, 32 points are the body\u0027s own statements and 2 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/librustdoc/clean/cfg.rs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba0e7682faf7a978fc2a344f839561b515bc84fd3260abb2a5707a5e515638c3"}},{"ruleId":"D2","level":"warning","message":{"text":"rustdoc::clean::clean_middle_ty (cognitive 34): rustdoc::clean::clean_middle_ty has cognitive complexity 34 (threshold 15). Drivers by points: if/else 13 (24 pts), match/switch 6 (10 pts) (nesting depth added 15). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/clean/mod.rs"},"region":{"startLine":2136}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c7716fe7414200178d1b6a989d615394a54849034d3ab57bd69f6166197a63e"}},{"ruleId":"D2","level":"warning","message":{"text":"rustdoc::html::format::fmt_type (cognitive 34): rustdoc::html::format::fmt_type has cognitive complexity 34 (threshold 15). Drivers by points: if/else 13 (22 pts), match/switch 5 (10 pts), boolean chains 2 (nesting depth added 14). 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/librustdoc/html/format.rs"},"region":{"startLine":1116}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba92ff3d05a4d8f4bb06b487abb6852ccd7d48e45d29e9111a68b7d1e71677f0"}},{"ruleId":"D2","level":"warning","message":{"text":"NormalizedPat::from_pat (cognitive 34): NormalizedPat::from_pat has cognitive complexity 34 (threshold 15). Drivers by points: match/switch 13 (29 pts), if/else 3 (5 pts) (nesting depth added 18). 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/tools/clippy/clippy_lints/src/matches/match_same_arms.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"f33c39de901bfd24084eb6ca7e2022ed4a13db3a34e0535a67c2acc697784368"}},{"ruleId":"D2","level":"warning","message":{"text":"NonCopyConst::is_non_freeze_val_borrowed (cognitive 34): NonCopyConst::is_non_freeze_val_borrowed has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (26 pts), loops 2 (5 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/non_copy_const.rs"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcc8fa07c15d485dad0454b71e27032bd89dffa950e2ef078bc52f578d99b911"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::matches::collapsible_match::check_arm (cognitive 34): clippy_lints::matches::collapsible_match::check_arm has cognitive complexity 34 (threshold 15). Drivers by points: if/else 16 (26 pts), boolean chains 4, match/switch 4 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/matches/collapsible_match.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e105d5a096149bc2b160b343ea1f4195294bc71c6715d957d89a33dc3f0da7c"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::methods::unnecessary_sort_by::detect_lint (cognitive 34): clippy_lints::methods::unnecessary_sort_by::detect_lint has cognitive complexity 34 (threshold 15). Drivers by points: if/else 14 (29 pts), boolean chains 5 (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/methods/unnecessary_sort_by.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff289842a2977e2f6fdd6b33b3fbac8e05fb50be2f265e547a78b5d159dcda94"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::returns::needless_return::check_final_expr (cognitive 34): clippy_lints::returns::needless_return::check_final_expr has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (19 pts), match/switch 4 (10 pts), boolean chains 3, loops 1 (2 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/tools/clippy/clippy_lints/src/returns/needless_return.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a420ea6f9fdf5f1ea9075356eaa87dc7e650ef347f230974048057fa5ad0873"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::string_patterns::check_manual_pattern_char_comparison (cognitive 34): clippy_lints::string_patterns::check_manual_pattern_char_comparison has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (24 pts), boolean chains 5, match/switch 2 (5 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/string_patterns.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fc083f9cc09dbf5858115c4536381e7246b7b1f2c438e24048a9cac4c2ee407"}},{"ruleId":"D2","level":"warning","message":{"text":"compiletest::directives::needs::handle_needs (cognitive 34): compiletest::directives::needs::handle_needs has cognitive complexity 34 (threshold 15). Drivers by points: if/else 18 (29 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/compiletest/src/directives/needs.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"81594c03f56eca0becaaf92e44fe52d22eb0285468a5c34074d117f3fabcb0a4"}},{"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":"src/tools/miri/priroda/src/debugger.rs"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4591b76d7aa0387a56ac3ba5fb03c214b4da1a51cd156ce3ab2461f75c13931"}},{"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/tools/miri/src/borrow_tracker/tree_borrows/mod.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cc758526be717807825a0d8b2b21aa1bd4c03fedf62f3a9dc451cd6b6ef6897"}},{"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/tools/miri/src/intrinsics/aarch64.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d1aaa99e42bb2efcacdf4c8a747c92721e96604eee3823154e34f430c105e33"}},{"ruleId":"D2","level":"warning","message":{"text":"Resolver::resolve_path_in_type_ns_with_prefix_info (cognitive 34): Resolver::resolve_path_in_type_ns_with_prefix_info has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (23 pts), match/switch 4 (9 pts), boolean chains 1, loops 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/resolver.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"55793bd023303378ade7d97ea90a1ce5b1d47a3cd003b1751142366473c63dc8"}},{"ruleId":"D2","level":"warning","message":{"text":"hir_def::expr_store::lower::lower_body (cognitive 34): hir_def::expr_store::lower::lower_body has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (20 pts), match/switch 4 (9 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/expr_store/lower.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"50748c72d6a1e68aa3eae033c2dd6a990a04cf82875213a7e573d7308e29b7c8"}},{"ruleId":"D2","level":"warning","message":{"text":"MirLowerCtx::lower_block_to_place (cognitive 34): MirLowerCtx::lower_block_to_place has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (27 pts), match/switch 2 (6 pts), loops 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/mir/lower.rs"},"region":{"startLine":1677}}}],"partialFingerprints":{"codehealthFindingId/v1":"753e9318cb1e5826e612100fefcfbf62e59fb7707d4876c57ab470a29392ffab"}},{"ruleId":"D2","level":"warning","message":{"text":"Definition::search_scope (cognitive 34): Definition::search_scope has cognitive complexity 34 (threshold 15). Drivers by points: match/switch 15 (25 pts), if/else 8, boolean chains 1 (nesting depth added 10). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-db/src/search.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"95be8f1e23e27ffbb323ab794b42acbbb5ba8ddfe794fcf696a4b788e97749d3"}},{"ruleId":"D2","level":"warning","message":{"text":"ProjectFolders::new (cognitive 34): ProjectFolders::new has cognitive complexity 34 (threshold 15). Drivers by points: loops 10 (18 pts), if/else 5 (10 pts), match/switch 1 (4 pts), boolean chains 2 (nesting depth added 16). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/load-cargo/src/lib.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"1352f4ccfa466a4d14c275085d6ac488dc8a0bac7417334c8e19ad63e579fa10"}},{"ruleId":"D2","level":"warning","message":{"text":"parser::grammar::expressions::atom::builtin_expr (cognitive 34): parser::grammar::expressions::atom::builtin_expr has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (25 pts), loops 2 (5 pts), boolean chains 4 (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":"src/tools/rust-analyzer/crates/parser/src/grammar/expressions/atom.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e7569a2d5fc7bcb311e30e69c023094502ef2ca15644f729735dce0ba4401d0"}},{"ruleId":"D2","level":"warning","message":{"text":"project_model::env::cargo_config_env (cognitive 34): project_model::env::cargo_config_env has cognitive complexity 34 (threshold 15). Drivers by points: if/else 13 (31 pts), match/switch 1 (2 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/tools/rust-analyzer/crates/project-model/src/env.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"768a3c8b38d915c9656bef21cd7256c8ee5774e34ae341e617a7df75f7b5b628"}},{"ruleId":"D2","level":"warning","message":{"text":"ChainFormatterShared::format_last_child (cognitive 34): ChainFormatterShared::format_last_child has cognitive complexity 34 (threshold 15). Drivers by points: if/else 16 (23 pts), boolean chains 6, match/switch 1 (5 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/chains.rs"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"9935d1fe492f4c65a3fd0fbcbd150a69983f328e7adfdd103ef0c8b2dab3503c"}},{"ruleId":"D2","level":"warning","message":{"text":"tidy::deps::check_permitted_dependencies (cognitive 34): tidy::deps::check_permitted_dependencies has cognitive complexity 34 (threshold 15). Drivers by points: if/else 15 (27 pts), loops 4 (6 pts), boolean chains 1 (nesting depth added 14). Of this number, 27 points are the body\u0027s own statements and 7 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/tools/tidy/src/deps.rs"},"region":{"startLine":962}}}],"partialFingerprints":{"codehealthFindingId/v1":"b70b2dcc4fd26ace15e7d83fe91ec9198f01066acaaa05aeca1ab7e2a4ed6495"}},{"ruleId":"D2","level":"warning","message":{"text":"configure.apply_args (cognitive 34): configure.apply_args has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (22 pts), loops 4 (10 pts), boolean chains 2 (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/bootstrap/configure.py"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"87843a8dcc5d267de0d7ddc8a38438aa2b37015e7cb70f6c2b007e0022cf8d3b"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutCalculator::layout_of_union (cognitive 33): LayoutCalculator::layout_of_union has cognitive complexity 33 (threshold 15). Drivers by points: if/else 15 (27 pts), match/switch 2 (3 pts), boolean chains 2, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_abi/src/layout.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4d3675bedb4631fd9fe6fbb92987d8bcbafbc7db62da59a889153d87dbc80cf"}},{"ruleId":"D2","level":"warning","message":{"text":"MirBorrowckCtxt::is_mutable (cognitive 33): MirBorrowckCtxt::is_mutable has cognitive complexity 33 (threshold 15). Drivers by points: match/switch 9 (28 pts), if/else 2 (4 pts), boolean chains 1 (nesting depth added 21). 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":"compiler/rustc_borrowck/src/lib.rs"},"region":{"startLine":2577}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d6941e3eb3ae7667a62396ee55c4aa062ff9bafc4465abe2b8a9459db577237"}},{"ruleId":"D2","level":"warning","message":{"text":"LoanInvalidationsGenerator::visit_terminator (cognitive 33): LoanInvalidationsGenerator::visit_terminator has cognitive complexity 33 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 5 (10 pts), match/switch 2 (4 pts) (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":"compiler/rustc_borrowck/src/polonius/legacy/loan_invalidations.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c900d19ba66d2ce8c4555db3172e7185d05915786d87ea740d28e4b4771df26"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionCx::codegen_switchint_terminator (cognitive 33): FunctionCx::codegen_switchint_terminator has cognitive complexity 33 (threshold 15). Drivers by points: if/else 15 (20 pts), boolean chains 7, match/switch 2 (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":"compiler/rustc_codegen_ssa/src/mir/block.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"57b19ff345078e3a45215b4d474e9d8e77806983cd4382cbdd424f7564aa0ec0"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_codegen_ssa::mir::arg_local_refs (cognitive 33): rustc_codegen_ssa::mir::arg_local_refs has cognitive complexity 33 (threshold 15). Drivers by points: if/else 15 (22 pts), match/switch 4 (7 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/mir/mod.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c38ffc6f521c436b93c4318e0312ca382560fd6dda535db4ef83fc877bd35a5"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_expand::mbe::diagnostics::failed_to_match_macro (cognitive 33): rustc_expand::mbe::diagnostics::failed_to_match_macro has cognitive complexity 33 (threshold 15). Drivers by points: if/else 15 (23 pts), boolean chains 5, loops 2 (3 pts), match/switch 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_expand/src/mbe/diagnostics.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"0349d1a9b9183e5cbad96e712a8043735e1fdbacc59fa440e0955362f7527212"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_hir_analysis::hir_ty_lowering::generics::check_generic_arg_count (cognitive 33): rustc_hir_analysis::hir_ty_lowering::generics::check_generic_arg_count has cognitive complexity 33 (threshold 15). Drivers by points: if/else 18 (25 pts), boolean chains 6, match/switch 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/hir_ty_lowering/generics.rs"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"b005aaa8e8fb29bbcecb742a84c1c21213c024e7b8ab827f7e3a0a8bb614555f"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_hir_analysis::impl_wf_check::enforce_impl_lifetime_params_are_constrained (cognitive 33): rustc_hir_analysis::impl_wf_check::enforce_impl_lifetime_params_are_constrained has cognitive complexity 33 (threshold 15). Drivers by points: if/else 7 (24 pts), loops 2 (5 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/impl_wf_check.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"d23301ac03739f8c11b7a7ceb1950fc909b27d47202ec97cccfbf6279ad75813"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::no_such_field_err (cognitive 33): FnCtxt::no_such_field_err has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (17 pts), loops 3 (6 pts), boolean chains 5, match/switch 1 (5 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/expr.rs"},"region":{"startLine":3269}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f53f4a632e59e961e178bdddf01ae01c3decfbf284ca2f74b5caf3da7d37625"}},{"ruleId":"D2","level":"warning","message":{"text":"InlineAsmCtxt::check_asm_operand_type (cognitive 33): InlineAsmCtxt::check_asm_operand_type has cognitive complexity 33 (threshold 15). Drivers by points: if/else 14 (24 pts), match/switch 4 (5 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 12). Of this number, 32 points are the body\u0027s own statements and 1 belongs 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":"compiler/rustc_hir_typeck/src/inline_asm.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"77a2d931cb71d69c199752f71f5f2dc7d55f45f40d0b54aecf5977a9fbb38256"}},{"ruleId":"D2","level":"warning","message":{"text":"ImproperCTypesVisitor::visit_type (cognitive 33): ImproperCTypesVisitor::visit_type has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (19 pts), match/switch 4 (7 pts), boolean chains 5, loops 1 (2 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_lint/src/types/improper_ctypes.rs"},"region":{"startLine":784}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ff8ef5068f159d6777a755d691575573e732c62927aab62fd30c58a946c41af"}},{"ruleId":"D2","level":"warning","message":{"text":"TOFinder::process_assign (cognitive 33): TOFinder::process_assign has cognitive complexity 33 (threshold 15). Drivers by points: if/else 13 (26 pts), match/switch 3 (5 pts), loops 1 (2 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/jump_threading.rs"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3d9ba47c33d1939ec0bcdabbd8a0cbf6fcf0b61ffa128044ca188c5b628e973"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_mir_transform::move_elimination::reconstruct_storage (cognitive 33): rustc_mir_transform::move_elimination::reconstruct_storage has cognitive complexity 33 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 5 (8 pts), match/switch 3 (8 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/move_elimination.rs"},"region":{"startLine":812}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea444be19ca74eed17bc88ef9f18f51145994cf8018d150f64806e24359ceab8"}},{"ruleId":"D2","level":"warning","message":{"text":"OrphanChecker::visit_ty (cognitive 33): OrphanChecker::visit_ty has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (19 pts), match/switch 6 (14 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":"compiler/rustc_next_trait_solver/src/coherence.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"035578f9426f4f7361f174ef062222d2d5f2aa86a89ec380644a4690afd35daa"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::recover_missing_kw_before_item (cognitive 33): Parser::recover_missing_kw_before_item has cognitive complexity 33 (threshold 15). Drivers by points: if/else 22 (28 pts), boolean chains 5 (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":"compiler/rustc_parse/src/parser/item.rs"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"16d314b856c2591fa5fd2256eca9ddef8c956e25bcc44972a33f2056ad16141c"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::format (cognitive 33): Parser::format has cognitive complexity 33 (threshold 15). Drivers by points: if/else 26 (33 pts) (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse_format/src/lib.rs"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6784286bad75df5c69f1ea1d801669fe0b0a571f33da3fe232f02e192a3a735"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_pattern_analysis::usefulness::compute_exhaustiveness_and_usefulness (cognitive 33): rustc_pattern_analysis::usefulness::compute_exhaustiveness_and_usefulness has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (23 pts), loops 4 (6 pts), boolean chains 4 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_pattern_analysis/src/usefulness.rs"},"region":{"startLine":1698}}}],"partialFingerprints":{"codehealthFindingId/v1":"16a7bb1887680a316ff77d0d33ce1cd0f75dd55c8cc0c75b72f16cb5a55f270b"}},{"ruleId":"D2","level":"warning","message":{"text":"InlineAsmClobberAbi::parse (cognitive 33): InlineAsmClobberAbi::parse has cognitive complexity 33 (threshold 15). Drivers by points: match/switch 15 (25 pts), if/else 4 (8 pts) (nesting depth added 14). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_target/src/asm/mod.rs"},"region":{"startLine":1041}}}],"partialFingerprints":{"codehealthFindingId/v1":"845d3eccdc607e821faa64cf3e90db2ebfec36c93abd4fb1e627299ae5b91c63"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_target::callconv::loongarch::should_use_fp_conv_helper (cognitive 33): rustc_target::callconv::loongarch::should_use_fp_conv_helper has cognitive complexity 33 (threshold 15). Drivers by points: match/switch 6 (14 pts), if/else 4 (13 pts), loops 2 (6 pts) (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":"compiler/rustc_target/src/callconv/loongarch.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"f654b5d759bfa0fdf825ce463aa521a4cb2d82b4dc48246bae92dca0869a7ceb"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_target::callconv::riscv::should_use_fp_conv_helper (cognitive 33): rustc_target::callconv::riscv::should_use_fp_conv_helper has cognitive complexity 33 (threshold 15). Drivers by points: match/switch 6 (14 pts), if/else 4 (13 pts), loops 2 (6 pts) (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":"compiler/rustc_target/src/callconv/riscv.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d854c1f86b4ab5fae42d470ed7247134d0d77f9948a372579702ee24708934a"}},{"ruleId":"D2","level":"warning","message":{"text":"AutoTraitFinder::map_vid_to_region (cognitive 33): AutoTraitFinder::map_vid_to_region has cognitive complexity 33 (threshold 15). Drivers by points: if/else 4 (20 pts), loops 4 (7 pts), match/switch 2 (6 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/traits/auto_trait.rs"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"682cf901d6d5e6f5d244d368c00f9a9e38e4b5bd77a6e8d9f46ed6f31b92d56a"}},{"ruleId":"D2","level":"warning","message":{"text":"libm::math::exp2m1::cr_exp2m1 (cognitive 33): libm::math::exp2m1::cr_exp2m1 has cognitive complexity 33 (threshold 15). Drivers by points: if/else 17 (31 pts), boolean chains 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/compiler-builtins/libm/src/math/exp2m1.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"a16ca581b0ef8f64da8e20831896141ac2ed0a15aea15acb8f3594049ea80025"}},{"ruleId":"D2","level":"warning","message":{"text":"std::sys::random::linux::getrandom (cognitive 33): std::sys::random::linux::getrandom has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (20 pts), match/switch 2 (8 pts), loops 2 (5 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/random/linux.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"a086b37795228bce46410701b28a842a497649b25dfccd286606bf96255075dc"}},{"ruleId":"D2","level":"warning","message":{"text":"citool::jobs::calculate_jobs (cognitive 33): citool::jobs::calculate_jobs has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (23 pts), loops 2 (8 pts), boolean chains 1, match/switch 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ci/citool/src/jobs.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef828d2a257c286e4483d1983f67f63269de2528ba095a631317ecf0e90bf12c"}},{"ruleId":"D2","level":"warning","message":{"text":"rustdoc::clean::maybe_expand_private_type_alias (cognitive 33): rustdoc::clean::maybe_expand_private_type_alias has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (23 pts), match/switch 3 (8 pts), boolean chains 1, loops 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/clean/mod.rs"},"region":{"startLine":1804}}}],"partialFingerprints":{"codehealthFindingId/v1":"58c90332c31d515420c8a74223519c50329415823569dc6e6e88625c25cb188e"}},{"ruleId":"D2","level":"warning","message":{"text":"rustdoc::html::highlight::write_code (cognitive 33): rustdoc::html::highlight::write_code has cognitive complexity 33 (threshold 15). Drivers by points: if/else 14 (28 pts), match/switch 3, boolean chains 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/highlight.rs"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"11c1e4250e9079c5522fde3295cb787c01f837100c336bd2bde2d2abcb466d50"}},{"ruleId":"D2","level":"warning","message":{"text":"NoEffect::check_no_effect (cognitive 33): NoEffect::check_no_effect has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (26 pts), boolean chains 4, loops 1 (3 pts) (nesting depth added 18). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/no_effect.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf17489b35c41586df8b39d43e30a35664714cbb6401c371109007cb866f7652"}},{"ruleId":"D2","level":"warning","message":{"text":"NonCopyConst::is_non_freeze_init_borrowed (cognitive 33): NonCopyConst::is_non_freeze_init_borrowed has cognitive complexity 33 (threshold 15). Drivers by points: match/switch 5 (15 pts), if/else 5 (11 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 17). 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/tools/clippy/clippy_lints/src/non_copy_const.rs"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"df2df148318b6247bed6aa0fba8338e50f0866fe6e3dd3391daa5dfc30e89b69"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::assigning_clones::build_sugg (cognitive 33): clippy_lints::assigning_clones::build_sugg has cognitive complexity 33 (threshold 15). Drivers by points: if/else 13 (28 pts), match/switch 3 (5 pts) (nesting depth added 17). 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/tools/clippy/clippy_lints/src/assigning_clones.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4f6ad34b68a9da87b11b58fae5115948676d6f68badd5c9a44af7a62aa10662"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::floating_point_arithmetic::radians::check (cognitive 33): clippy_lints::floating_point_arithmetic::radians::check has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (23 pts), boolean chains 10 (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/tools/clippy/clippy_lints/src/floating_point_arithmetic/radians.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"a44606dc4451cc01bfa5bbe9571920d8cf468bd34b841fba4ada38a9d5fce0fc"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::functions::misnamed_getters::check_fn (cognitive 33): clippy_lints::functions::misnamed_getters::check_fn has cognitive complexity 33 (threshold 15). Drivers by points: if/else 19 (26 pts), boolean chains 3, loops 2 (3 pts), match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/functions/misnamed_getters.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"8333bb529166558cf2ae733da43ec4392235edfa09ddad35447855013fa38415"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::lifetimes::could_use_elision (cognitive 33): clippy_lints::lifetimes::could_use_elision has cognitive complexity 33 (threshold 15). Drivers by points: if/else 13 (20 pts), loops 5 (7 pts), boolean chains 6 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/lifetimes.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e918bb846988c440c1ad4d5bdd61eef7d5c8e288a61a9acbcaa009da6f9d834"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_utils::capture_local_usage (cognitive 33): clippy_utils::capture_local_usage has cognitive complexity 33 (threshold 15). Drivers by points: match/switch 6 (18 pts), if/else 4 (8 pts), loops 2 (5 pts), boolean chains 2 (nesting depth added 19). Of this number, 32 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. 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/tools/clippy/clippy_utils/src/lib.rs"},"region":{"startLine":859}}}],"partialFingerprints":{"codehealthFindingId/v1":"3100f54e5213cefbaddad3a8af74c498c903e1ba2560e2b0a919edfd870e84b4"}},{"ruleId":"D2","level":"warning","message":{"text":"Evaluator::exec_extern_c (cognitive 33): Evaluator::exec_extern_c has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (24 pts), match/switch 4 (7 pts), loops 1 (2 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/tools/rust-analyzer/crates/hir-ty/src/mir/eval/shim.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"72b7e4b510d1d4f829a2ec06003d8826495e202369ec689a04d1eebf72126bb5"}},{"ruleId":"D2","level":"warning","message":{"text":"hir_ty::lower::remap_gat_vars_and_recurse_into_nested_projections (cognitive 33): hir_ty::lower::remap_gat_vars_and_recurse_into_nested_projections has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (27 pts), match/switch 2 (3 pts), loops 2, 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":"src/tools/rust-analyzer/crates/hir-ty/src/lower.rs"},"region":{"startLine":2373}}}],"partialFingerprints":{"codehealthFindingId/v1":"b99417d97ece0cd4d1ff27e041ebb5369d83ba05edad28b29273090153055f86"}},{"ruleId":"D2","level":"warning","message":{"text":"ide::hover::hover_offset (cognitive 33): ide::hover::hover_offset has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (20 pts), boolean chains 7, match/switch 3 (5 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/hover.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"66254a5dc2c24b0138c57535972e20599d5f8e239db24da67951f35f2009e5e4"}},{"ruleId":"D2","level":"warning","message":{"text":"ide::join_lines::remove_newline (cognitive 33): ide::join_lines::remove_newline has cognitive complexity 33 (threshold 15). Drivers by points: if/else 13 (21 pts), match/switch 4 (8 pts), boolean chains 4 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/join_lines.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf606c9c613e35b6a63906425bab13eaad70ab82567a8b782e13b47ee12e58cc"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_completion::context::analysis::analyze (cognitive 33): ide_completion::context::analysis::analyze has cognitive complexity 33 (threshold 15). Drivers by points: if/else 14 (24 pts), boolean chains 8, match/switch 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-completion/src/context/analysis.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ee33f11c4b3b380d557e8bd65003c647ea294d67e546bd38e2d2a4e8de44ed9"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_db::traits::diff_assoc_items (cognitive 33): ide_db::traits::diff_assoc_items has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (20 pts), match/switch 3 (7 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-db/src/traits.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"49a9a246e7caf5e2ed46a78c5ef37d756d4b27c91fe998b50bbac930fe84414c"}},{"ruleId":"D2","level":"warning","message":{"text":"Matcher::attempt_match_token_tree (cognitive 33): Matcher::attempt_match_token_tree has cognitive complexity 33 (threshold 15). Drivers by points: if/else 5 (16 pts), match/switch 4 (12 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-ssr/src/matching.rs"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a6774643d6de7a6fc7116b969873ffe1c0c2757447a6bd525d4ce2e3cec4160"}},{"ruleId":"D2","level":"warning","message":{"text":"Reader::read_subtree (cognitive 33): Reader::read_subtree has cognitive complexity 33 (threshold 15). Drivers by points: if/else 8 (22 pts), match/switch 2 (8 pts), loops 2 (3 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/proc-macro-api/src/legacy_protocol/msg/flat.rs"},"region":{"startLine":759}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2f75c9bf9ad8a81682a9a0fe9c25398d00c7568813844d8c03363feb50c95e1"}},{"ruleId":"D2","level":"warning","message":{"text":"rustfmt_nightly::string::break_string (cognitive 33): rustfmt_nightly::string::break_string has cognitive complexity 33 (threshold 15). Drivers by points: if/else 13 (22 pts), match/switch 3 (6 pts), loops 3, boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/string.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd6518e419b84e1f76da5be6da702efc9e5d94f4de8824eb73212bf9017fc66b"}},{"ruleId":"D2","level":"warning","message":{"text":"check_gdb.var_matches (cognitive 33): check_gdb.var_matches has cognitive complexity 33 (threshold 15). Drivers by points: if/else 16 (20 pts), boolean chains 6, error handling 2 (6 pts), loops 1 (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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/etc/debugger_tester/gdb/check_gdb.py"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"acd39d828596a8e80b76c12bdd88f6e27eea32ba4dd9929b71d6d01bcab1cf0c"}},{"ruleId":"D2","level":"warning","message":{"text":"LoweringContext::lower_assoc_item_constraint (cognitive 32): LoweringContext::lower_assoc_item_constraint has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (18 pts), match/switch 5 (12 pts), boolean chains 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ast_lowering/src/lib.rs"},"region":{"startLine":1229}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a5bc9039e3fa94bfbd69a13f3468ee4170070a7bb46043bf9072718864426ac"}},{"ruleId":"D2","level":"warning","message":{"text":"AstValidator::visit_fn (cognitive 32): AstValidator::visit_fn has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (21 pts), match/switch 4 (7 pts), boolean chains 4 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ast_passes/src/ast_validation.rs"},"region":{"startLine":1937}}}],"partialFingerprints":{"codehealthFindingId/v1":"19cbb7c491e686920098b660b4e4e4a8ec97662a8195b4d908130287f0c285f8"}},{"ruleId":"D2","level":"warning","message":{"text":"AstValidator::visit_assoc_item (cognitive 32): AstValidator::visit_assoc_item has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (17 pts), match/switch 6 (10 pts), boolean chains 5 (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":"compiler/rustc_ast_passes/src/ast_validation.rs"},"region":{"startLine":2059}}}],"partialFingerprints":{"codehealthFindingId/v1":"7337efccb1fcba2b6d66a5fc5525ae6f46680423a67189b61b7a546e1c5b4371"}},{"ruleId":"D2","level":"warning","message":{"text":"DocParser::parse_single_doc_attr_item (cognitive 32): DocParser::parse_single_doc_attr_item has cognitive complexity 32 (threshold 15). Drivers by points: if/else 15 (24 pts), match/switch 3 (6 pts), loops 1 (2 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_attr_parsing/src/attributes/doc.rs"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d354b10e505f338e62f2080c19bf2313544d874f60c067655216987f7687b84"}},{"ruleId":"D2","level":"warning","message":{"text":"MirBorrowckCtxt::add_static_impl_trait_suggestion (cognitive 32): MirBorrowckCtxt::add_static_impl_trait_suggestion has cognitive complexity 32 (threshold 15). Drivers by points: if/else 14 (28 pts), loops 1 (2 pts), match/switch 1 (2 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/diagnostics/region_errors.rs"},"region":{"startLine":1173}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0051891dbaff155ae9cb104ea303d591a80c69354633c7365281de96c349e5d"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_borrowck::places_conflict::place_projection_conflict (cognitive 32): rustc_borrowck::places_conflict::place_projection_conflict has cognitive complexity 32 (threshold 15). Drivers by points: if/else 18 (28 pts), match/switch 2 (3 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":"compiler/rustc_borrowck/src/places_conflict.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"816b32e8c84debdcc6d739e1216ff7e0295174aea2bcce915e6539f4e254a399"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_builtin_macros::concat_bytes::expand_concat_bytes (cognitive 32): rustc_builtin_macros::concat_bytes::expand_concat_bytes has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 3 (9 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":"compiler/rustc_builtin_macros/src/concat_bytes.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"f70e24c4c9cbf7eb3c2654c2f3876191c9ed408c35b37b2ea5b013d762619d3e"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_builtin_macros::deriving::coerce_pointee::expand_derive_coerce_pointee (cognitive 32): rustc_builtin_macros::deriving::coerce_pointee::expand_derive_coerce_pointee has cognitive complexity 32 (threshold 15). Drivers by points: if/else 13 (21 pts), loops 4 (6 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_builtin_macros/src/deriving/coerce_pointee.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce7927e4982212ccc69a963a6a553aff545e185e26a7e2820dc6bef192cda3d7"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_codegen_ssa::back::link::raw_dylib::create_elf_raw_dylib_stub (cognitive 32): rustc_codegen_ssa::back::link::raw_dylib::create_elf_raw_dylib_stub has cognitive complexity 32 (threshold 15). Drivers by points: if/else 14 (20 pts), loops 5 (7 pts), match/switch 4 (5 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":"compiler/rustc_codegen_ssa/src/back/link/raw_dylib.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f98b95f395a38d653060778f6981d67f8f403336cc10cd0851e1219f2f8a7a7"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_expand::mbe::transcribe::transcribe (cognitive 32): rustc_expand::mbe::transcribe::transcribe has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (26 pts), match/switch 2 (5 pts), loops 1 (nesting depth added 21). 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":"compiler/rustc_expand/src/mbe/transcribe.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"28e33d1755e397ed3a73a4f086ce9bb6c382ee40f0d8996205813e783d3c1c7c"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_expand::mbe::transcribe::transcribe_sequence (cognitive 32): rustc_expand::mbe::transcribe::transcribe_sequence has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (26 pts), loops 2 (4 pts), boolean chains 1, match/switch 1 (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":"compiler/rustc_expand/src/mbe/transcribe.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8969ede07bb73d445d2caa4751ba7d5e2f518adf654763e766ef670d8431e2b"}},{"ruleId":"D2","level":"warning","message":{"text":"Resolver::check_for_module_export_macro (cognitive 32): Resolver::check_for_module_export_macro has cognitive complexity 32 (threshold 15). Drivers by points: if/else 15 (26 pts), boolean chains 4, loops 1, match/switch 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":"compiler/rustc_resolve/src/diagnostics/impls.rs"},"region":{"startLine":3684}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bb88e634404dd9bcaaddbd210116595b65043701b6c450c11931e070de1214d"}},{"ruleId":"D2","level":"warning","message":{"text":"CrateLocator::extract_one (cognitive 32): CrateLocator::extract_one has cognitive complexity 32 (threshold 15). Drivers by points: if/else 14 (27 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_metadata/src/locator.rs"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"209ea4e2c3f68d3fbdda967316a6dc318e55979970619b11dc233cb96b5de98c"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_middle::mir::pretty::pretty_print_const_value_tcx (cognitive 32): rustc_middle::mir::pretty::pretty_print_const_value_tcx has cognitive complexity 32 (threshold 15). Drivers by points: if/else 7 (18 pts), match/switch 3 (8 pts), loops 1 (5 pts), boolean chains 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/mir/pretty.rs"},"region":{"startLine":1928}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d5bbd076946ca031903bcc04d81590acab733f8c7a7fc35061d1a1ec512b9d8"}},{"ruleId":"D2","level":"warning","message":{"text":"AddCallGuards::run_pass (cognitive 32): AddCallGuards::run_pass has cognitive complexity 32 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 5 (9 pts), boolean chains 4, match/switch 2 (4 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/add_call_guards.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaf5ace5b7e7fe1a45094756b667cdd546fca4abb8edd760e22b99b8932be6e2"}},{"ruleId":"D2","level":"warning","message":{"text":"EvalCtxt::term_is_fully_unconstrained (cognitive 32): EvalCtxt::term_is_fully_unconstrained has cognitive complexity 32 (threshold 15). Drivers by points: if/else 16 (22 pts), boolean chains 7, match/switch 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_next_trait_solver/src/solve/eval_ctxt/mod.rs"},"region":{"startLine":1226}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d952cdd052d88919596c8939a6c6691d8b47a4f7fa0be690ad0459a2ede4eaf"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::maybe_augment_stashed_expr_in_pats_with_suggestions (cognitive 32): Parser::maybe_augment_stashed_expr_in_pats_with_suggestions has cognitive complexity 32 (threshold 15). Drivers by points: if/else 13 (21 pts), match/switch 6 (10 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/pat.rs"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"36a458ed98bc03ca94ddaa2fa1246d659c3061b73a68401729e3d6085957e146"}},{"ruleId":"D2","level":"warning","message":{"text":"LateResolutionVisitor::lookup_assoc_candidate (cognitive 32): LateResolutionVisitor::lookup_assoc_candidate has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 4 (12 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 16). Of this number, 31 points are the body\u0027s own statements and 1 belongs 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":"compiler/rustc_resolve/src/late/diagnostics.rs"},"region":{"startLine":3244}}}],"partialFingerprints":{"codehealthFindingId/v1":"42e5dc32abc30d4d2e076df539a701dc58dd6d2f7ee10b20e7bf37f43cf42417"}},{"ruleId":"D2","level":"warning","message":{"text":"FnAbi::apply_attrs_llfn (cognitive 32): FnAbi::apply_attrs_llfn has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (22 pts), loops 2 (4 pts), match/switch 3 (4 pts), boolean chains 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/abi.rs"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"d62609bcbc2f2dedcd3dba6f2086f56bae4e68ade021a5b8250ca4afbc294144"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_target::callconv::sparc64::classify (cognitive 32): rustc_target::callconv::sparc64::classify has cognitive complexity 32 (threshold 15). Drivers by points: match/switch 6 (17 pts), if/else 4 (11 pts), loops 1 (4 pts) (nesting depth added 21). 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":"compiler/rustc_target/src/callconv/sparc64.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"57feb222f6909c98df3092f8bdd2336b69ed012563638b3e2dd1739731542a26"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_trait_selection::traits::const_evaluatable::is_const_evaluatable (cognitive 32): rustc_trait_selection::traits::const_evaluatable::is_const_evaluatable has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (21 pts), match/switch 5 (10 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":"compiler/rustc_trait_selection/src/traits/const_evaluatable.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"6589fe8f214cd50f680d9ef5eae42041b55aee964cf28f4daa006f98e0fe1877"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_trait_selection::traits::effects::evaluate_host_effect_from_conditionally_const_item_bounds (cognitive 32): rustc_trait_selection::traits::effects::evaluate_host_effect_from_conditionally_const_item_bounds has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (28 pts), loops 2 (4 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/traits/effects.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"041ae26d5c3747a395a8069ea9889d0b87115154ba357486fa35b2e60769ebb0"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_ty_utils::instance::resolve_instance_raw (cognitive 32): rustc_ty_utils::instance::resolve_instance_raw has cognitive complexity 32 (threshold 15). Drivers by points: if/else 14 (23 pts), match/switch 2 (8 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ty_utils/src/instance.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebe653831595365075843b1be14187060857280dadd46e3159c27059f10e737f"}},{"ruleId":"D2","level":"warning","message":{"text":"Utf8Chunks::next (cognitive 32): Utf8Chunks::next has cognitive complexity 32 (threshold 15). Drivers by points: if/else 7 (20 pts), match/switch 3 (11 pts), loops 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/str/lossy.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c15dbdd03eb2892964bdce68d621c8dd6c3a2f598adc6f04e680708928a6580"}},{"ruleId":"D2","level":"warning","message":{"text":"stdarch_gen_hexagon::scalar::generate_functions (cognitive 32): stdarch_gen_hexagon::scalar::generate_functions has cognitive complexity 32 (threshold 15). Drivers by points: if/else 15 (27 pts), loops 2 (3 pts), match/switch 1 (2 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/stdarch-gen-hexagon/src/scalar.rs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"78a0be59f891622080b61fb3a145264a727573e3571ac730f1f8963ed759311f"}},{"ruleId":"D2","level":"warning","message":{"text":"Gcc::merge (cognitive 32): Gcc::merge has cognitive complexity 32 (threshold 15). Drivers by points: if/else 14 (30 pts), match/switch 2 (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/bootstrap/src/core/config/toml/gcc.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"5439c6cc8d35eb888daa1aa3f3f750510835e429e809d220ee8b9928f25aec24"}},{"ruleId":"D2","level":"warning","message":{"text":"LinkCollector::resolve_with_disambiguator (cognitive 32): LinkCollector::resolve_with_disambiguator has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (22 pts), loops 2 (5 pts), match/switch 2 (3 pts), boolean chains 2 (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/librustdoc/passes/collect_intra_doc_links.rs"},"region":{"startLine":1615}}}],"partialFingerprints":{"codehealthFindingId/v1":"16a9067e725875e42e31dd316a54a68e0d20ae63d6dc9425c7d901e072da182d"}},{"ruleId":"D2","level":"warning","message":{"text":"rustdoc::html::format::generate_item_def_id_path (cognitive 32): rustdoc::html::format::generate_item_def_id_path has cognitive complexity 32 (threshold 15). Drivers by points: if/else 14 (24 pts), boolean chains 6, match/switch 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/format.rs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"503a9aa680d71a4f82551af2b17c289d9bd633366122454ae26cbd7e5f867158"}},{"ruleId":"D2","level":"warning","message":{"text":"rustdoc::html::markdown::find_codes (cognitive 32): rustdoc::html::markdown::find_codes has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (20 pts), match/switch 2 (5 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/markdown.rs"},"region":{"startLine":746}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b062a77fa2a19c7c820b6ccd7fb56b9d437263313526a36c15ca302f6518d67"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_config::de::create_value_list_msg (cognitive 32): clippy_config::de::create_value_list_msg has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 3 (9 pts), match/switch 1 (2 pts), boolean chains 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/tools/clippy/clippy_config/src/de.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ae2099de61c119a786ca155a6d41aeed54903aaeaa46ba0fe8b051f82430e5b"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_dev::edit_lints::rename_update_fn (cognitive 32): clippy_dev::edit_lints::rename_update_fn has cognitive complexity 32 (threshold 15). Drivers by points: if/else 7 (21 pts), boolean chains 5, match/switch 2 (5 pts), loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_dev/src/edit_lints.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ce5512577fb425ee27c6b0c3c7505a46381dc3dba8db296f1cde36ed84f506b"}},{"ruleId":"D2","level":"warning","message":{"text":"ArbitrarySourceItemOrdering::check_mod (cognitive 32): ArbitrarySourceItemOrdering::check_mod has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (25 pts), boolean chains 3, match/switch 1 (3 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":"src/tools/clippy/clippy_lints/src/arbitrary_source_item_ordering.rs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d8ca5a5bcfc4d9a0aeec1996d626fb66d2613d1642fae284f307b8be6927e58"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::implicit_return::lint_implicit_returns (cognitive 32): clippy_lints::implicit_return::lint_implicit_returns has cognitive complexity 32 (threshold 15). Drivers by points: if/else 13 (27 pts), boolean chains 2, loops 1 (2 pts), match/switch 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/tools/clippy/clippy_lints/src/implicit_return.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"f442859c2e933cf64328ee374363dfc6bc99adc76027856d46989dc07355745e"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::matches::single_match::report_single_pattern (cognitive 32): clippy_lints::matches::single_match::report_single_pattern has cognitive complexity 32 (threshold 15). Drivers by points: if/else 15 (21 pts), boolean chains 6, match/switch 2 (5 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/tools/clippy/clippy_lints/src/matches/single_match.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"8888436d187f82e0c4021cc5afe7562175db658c8e5441bbca9135a4770820eb"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::methods::useless_asref::check (cognitive 32): clippy_lints::methods::useless_asref::check has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (22 pts), boolean chains 6, match/switch 1 (4 pts) (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/methods/useless_asref.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f30da6a7a4a90b488f74904b81e3867c30a2140078f92aefa7afbb4e6af7699"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::operators::invalid_upcast_comparisons::upcast_comparison_bounds_err (cognitive 32): clippy_lints::operators::invalid_upcast_comparisons::upcast_comparison_bounds_err has cognitive complexity 32 (threshold 15). Drivers by points: boolean chains 15, if/else 7 (15 pts), match/switch 1 (2 pts) (nesting depth added 9). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/operators/invalid_upcast_comparisons.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"aae21c44f2ab0c04c28bac94a935c4e1d2f6ce56b31d350ea4102da6c9674354"}},{"ruleId":"D2","level":"warning","message":{"text":"TestCx::compare_output (cognitive 32): TestCx::compare_output has cognitive complexity 32 (threshold 15). Drivers by points: if/else 20 (28 pts), boolean chains 3, match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/compiletest/src/runtest.rs"},"region":{"startLine":2859}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c337df2e80805c29f2d73e5d6be8e45eb7f2e42bbf2c0dda1124c7290d8919a"}},{"ruleId":"D2","level":"warning","message":{"text":"Node::trim_clone (cognitive 32): Node::trim_clone has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 4 (8 pts), boolean chains 4, match/switch 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/tools/generate-copyright/src/main.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b562e44f2b91e57c8bb63cb6ae635ee441e29df73bdb3fe3986b4f3fa01e930"}},{"ruleId":"D2","level":"warning","message":{"text":"SourceToDefCtx::container_to_def (cognitive 32): SourceToDefCtx::container_to_def has cognitive complexity 32 (threshold 15). Drivers by points: if/else 15 (26 pts), match/switch 2 (4 pts), boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir/src/semantics/source_to_def.rs"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"a30e287931e1007aed2a6a2797b6648d53e60cac01e4b96f0b6ee08f6ac4a104"}},{"ruleId":"D2","level":"warning","message":{"text":"hir_expand::attrs::expand_cfg_attr_with_doc_comments (cognitive 32): hir_expand::attrs::expand_cfg_attr_with_doc_comments has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (26 pts), loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-expand/src/attrs.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"368bd19cdfdc12546403aa6ceb5ee2deeb75ad4b87daed6c3255715f2ec962d0"}},{"ruleId":"D2","level":"warning","message":{"text":"Evaluator::patch_addresses (cognitive 32): Evaluator::patch_addresses has cognitive complexity 32 (threshold 15). Drivers by points: loops 5 (15 pts), match/switch 6 (11 pts), if/else 2 (6 pts) (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/tools/rust-analyzer/crates/hir-ty/src/mir/eval.rs"},"region":{"startLine":2396}}}],"partialFingerprints":{"codehealthFindingId/v1":"277920baea9a03f4f0a31a04e674e136a132d1df2779c7e90b548756a2f1a0c5"}},{"ruleId":"D2","level":"warning","message":{"text":"ide::syntax_highlighting::highlight::punctuation (cognitive 32): ide::syntax_highlighting::highlight::punctuation has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (22 pts), match/switch 4 (7 pts), boolean chains 3 (nesting depth added 13). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/syntax_highlighting/highlight.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"d11b71363c9b020a11e15b28e929a04e227d5310493b1be5cfd622ef46b94be3"}},{"ruleId":"D2","level":"warning","message":{"text":"rust_analyzer::handlers::request::run_rustfmt (cognitive 32): rust_analyzer::handlers::request::run_rustfmt has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (20 pts), boolean chains 6, match/switch 4 (6 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/handlers/request.rs"},"region":{"startLine":2405}}}],"partialFingerprints":{"codehealthFindingId/v1":"9374ba071a759c7f6753c0e1c81d8b66473d87dc6e91d0e6c0b7af7a8c7f48b8"}},{"ruleId":"D2","level":"warning","message":{"text":"ModResolver::find_external_module (cognitive 32): ModResolver::find_external_module has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (24 pts), match/switch 5 (8 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/modules.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"495bf2845c4cfb54063bfb44878c92b839d07f0840cadd84a7a0a5e590c0eb1f"}},{"ruleId":"D2","level":"warning","message":{"text":"rustfmt_nightly::parse::macros::parse_macro_arg (cognitive 32): rustfmt_nightly::parse::macros::parse_macro_arg has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (20 pts), match/switch 4 (8 pts), boolean chains 4 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/parse/macros/mod.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6367ce365fcae1060d2687dac33ae2e48a444f77f6074f3b64097c0a99470cf"}},{"ruleId":"D2","level":"warning","message":{"text":"TyAndLayout::homogeneous_aggregate (cognitive 31): TyAndLayout::homogeneous_aggregate has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (17 pts), match/switch 4 (8 pts), loops 2 (5 pts), boolean chains 1 (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":"compiler/rustc_abi/src/callconv.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"c909449ae7736ab22f6f2e2bce4433908ba9695291254047554464425f56a736"}},{"ruleId":"D2","level":"warning","message":{"text":"LinkParser::extend (cognitive 31): LinkParser::extend has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (21 pts), match/switch 3 (6 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_attr_parsing/src/attributes/link_attrs.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a91d24af474e80dc6174292f481e6fd26affd635a9d48caa43a15dbda18e5e9"}},{"ruleId":"D2","level":"warning","message":{"text":"LintParser::parse (cognitive 31): LintParser::parse has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (21 pts), match/switch 2 (7 pts), loops 1 (2 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":"compiler/rustc_attr_parsing/src/attributes/lint.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b2a91e1b8b1883613540c8a10988633e22efa574569ceaa3ed4b7a6975b8ae5"}},{"ruleId":"D2","level":"warning","message":{"text":"MirBorrowckCtxt::suggest_static_lifetime_for_gat_from_hrtb (cognitive 31): MirBorrowckCtxt::suggest_static_lifetime_for_gat_from_hrtb has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (22 pts), loops 3 (7 pts), boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/diagnostics/region_errors.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"77a72f2d471a18653ecb0b6caed745eb2d06a43ab391d7c8e9af3ba28d5a9064"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeChecker::visit_const_operand (cognitive 31): TypeChecker::visit_const_operand has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (21 pts), match/switch 3 (9 pts), boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/type_check/mod.rs"},"region":{"startLine":1735}}}],"partialFingerprints":{"codehealthFindingId/v1":"da0749e2bc5c7ba1c6a447c3f3d3d836c562eb4f70177d54fd5cd9b27ec8b784"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_codegen_ssa::target_features::internal_target_features (cognitive 31): rustc_codegen_ssa::target_features::internal_target_features has cognitive complexity 31 (threshold 15). Drivers by points: if/else 15 (25 pts), loops 1 (3 pts), boolean chains 2, match/switch 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/target_features.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"7174fc36b8e710109680a5e3dc917c9025ed3cab089c7c91c4a47cf12135b0a0"}},{"ruleId":"D2","level":"warning","message":{"text":"MacroExpander::fully_expand_fragment (cognitive 31): MacroExpander::fully_expand_fragment has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (19 pts), match/switch 3 (7 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_expand/src/expand.rs"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb338fc2ba9d8423d850433e21d3ec39e63d99190e34e8947bdb2e02acf8d93a"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_hir_analysis::check::compare_impl_item::refine::check_refining_return_position_impl_trait_in_trait (cognitive 31): rustc_hir_analysis::check::compare_impl_item::refine::check_refining_return_position_impl_trait_in_trait has cognitive complexity 31 (threshold 15). Drivers by points: if/else 16 (22 pts), loops 4 (5 pts), boolean chains 4 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/check/compare_impl_item/refine.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a30caf4b527cfb8fb798acaf77b40765582a9d497d99a3f1219afd7cfa7de6a"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_hir_analysis::coherence::builtin::visit_implementation_of_dispatch_from_dyn (cognitive 31): rustc_hir_analysis::coherence::builtin::visit_implementation_of_dispatch_from_dyn has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (26 pts), boolean chains 4, match/switch 1 (nesting depth added 13). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/coherence/builtin.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac1dc5308ca52883c06b38210208d27d6b04a22a217aad986cbf3bb273740853"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::check_expr_break (cognitive 31): FnCtxt::check_expr_break has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (27 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 16). 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":"compiler/rustc_hir_typeck/src/expr.rs"},"region":{"startLine":729}}}],"partialFingerprints":{"codehealthFindingId/v1":"01c2da1081b0c7694dba1b489f7f431e4c8f8c9b14b62ab6ed61d6329b9778aa"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::label_generic_mismatches (cognitive 31): FnCtxt::label_generic_mismatches has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (29 pts), loops 1 (2 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/fn_ctxt/checks.rs"},"region":{"startLine":2059}}}],"partialFingerprints":{"codehealthFindingId/v1":"e327c8f537ae93f22010f5bf21a6314f116fafc96eedcac5be21d2296e2e0d94"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::compute_min_captures (cognitive 31): FnCtxt::compute_min_captures has cognitive complexity 31 (threshold 15). Drivers by points: match/switch 5 (13 pts), if/else 5 (11 pts), loops 4 (7 pts) (nesting depth added 17). Of this number, 29 points are the body\u0027s own statements and 2 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":"compiler/rustc_hir_typeck/src/upvar.rs"},"region":{"startLine":879}}}],"partialFingerprints":{"codehealthFindingId/v1":"0119ab11e4fb0617e514bcbb20395c61ade1b255ff71d775fd38a23b1d83cdf9"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_interface::passes::write_out_deps (cognitive 31): rustc_interface::passes::write_out_deps has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (21 pts), loops 5 (7 pts), match/switch 3 (nesting depth added 10). Of this number, 30 points are the body\u0027s own statements and 1 belongs 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":"compiler/rustc_interface/src/passes.rs"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b8c136e06498c2872f3d1fb04808c3da513f6c798301dea0cee988abb22c5c7"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeLimits::check_expr (cognitive 31): TypeLimits::check_expr has cognitive complexity 31 (threshold 15). Drivers by points: match/switch 10 (16 pts), if/else 5 (8 pts), boolean chains 7 (nesting depth added 9). Most of this is not in the body itself: 9 of the 31 points are its own statements and the rest belongs to 4 function items inside it that branch (check_limits, is_valid, rev_binop, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_lint/src/types.rs"},"region":{"startLine":656}}}],"partialFingerprints":{"codehealthFindingId/v1":"b69e928452d001c4ecdabd42b9293ca52d9e7840ac16bc66abea17e4841c3aec"}},{"ruleId":"D2","level":"warning","message":{"text":"Collector::process_command_line (cognitive 31): Collector::process_command_line has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (23 pts), match/switch 1 (4 pts), boolean chains 2, loops 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_metadata/src/native_libs.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec6c05a9c4f974b3006460a6d32db1f2717727d3c8305fa3c587af10c1503b79"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_metadata::rmeta::decoder::cstore_impl::provide (cognitive 31): rustc_metadata::rmeta::decoder::cstore_impl::provide has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (22 pts), loops 4 (5 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_metadata/src/rmeta/decoder/cstore_impl.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e7363b08e8d53ea1eea2d0d6aa28e18ca67c9d6c37a18998e20704227d5fecb"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_middle::lint::emit_lint_base::emit_lint_base_impl (cognitive 31): rustc_middle::lint::emit_lint_base::emit_lint_base_impl has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 6, loops 3 (6 pts), match/switch 2 (3 pts) (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/lint.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"35105ba53aa8d098a81cf6cfac976768d36b163d73a24fda16f4b1849679493b"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_mir_transform::dataflow_const_prop::try_write_constant (cognitive 31): rustc_mir_transform::dataflow_const_prop::try_write_constant has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (25 pts), loops 2 (4 pts), boolean chains 1, match/switch 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":"compiler/rustc_mir_transform/src/dataflow_const_prop.rs"},"region":{"startLine":777}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ec8953a6cd5ab7a9122bc795ab9f347189b6d4f61cf3143c5dc4cd5710fbb58"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_mir_transform::dead_store_elimination::eliminate (cognitive 31): rustc_mir_transform::dead_store_elimination::eliminate has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (21 pts), loops 5 (8 pts), boolean chains 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/dead_store_elimination.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dc5141c72bf8f80b1dd2397c166c7cab51b99bf1e8e43bf07dc22a0407bb083"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_query_impl::handle_cycle_error::layout_of (cognitive 31): rustc_query_impl::handle_cycle_error::layout_of has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (28 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_query_impl/src/handle_cycle_error.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1a7da9ad3af916a20db985ceb73d0eefd72906688a8c957b63a543793b86ac4"}},{"ruleId":"D2","level":"warning","message":{"text":"LateResolutionVisitor::suggest_adding_generic_parameter (cognitive 31): LateResolutionVisitor::suggest_adding_generic_parameter has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (23 pts), match/switch 3 (5 pts), boolean chains 3 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/late/diagnostics.rs"},"region":{"startLine":3973}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5c4c6a1c5da277a108c00217c85129370f8f05852a6e78a67646971381ef0f1"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_trait_selection::traits::try_evaluate_const (cognitive 31): rustc_trait_selection::traits::try_evaluate_const has cognitive complexity 31 (threshold 15). Drivers by points: if/else 7 (17 pts), match/switch 5 (11 pts), boolean chains 3 (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":"compiler/rustc_trait_selection/src/traits/mod.rs"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"607a5d3eacd5457d37d7997153641360989b27dbffe467f9694e7164bb91ec9e"}},{"ruleId":"D2","level":"warning","message":{"text":"proc_macro::quote::quote (cognitive 31): proc_macro::quote::quote has cognitive complexity 31 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 3 (9 pts), match/switch 3 (9 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":"library/proc_macro/src/quote.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1fadceeaa8689f89308d53d8ee821774ee47ccb3db57b3180e45817ff04e889"}},{"ruleId":"D2","level":"warning","message":{"text":"Pgo::deserialize (cognitive 31): Pgo::deserialize has cognitive complexity 31 (threshold 15). Drivers by points: if/else 6 (18 pts), match/switch 8 (12 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":"src/bootstrap/src/core/config/toml/pgo.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"bacf3438bcdc4e545dad7bf95bd96ada8e27a86ec78e838d74621a03889dfb1e"}},{"ruleId":"D2","level":"warning","message":{"text":"WildcardImports::check_use_tree (cognitive 31): WildcardImports::check_use_tree has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (26 pts), boolean chains 2, loops 1 (2 pts), match/switch 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/wildcard_imports.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbbe0465faf279383e0c965fb9c92ae5e2b3c0951cfd16382d799a12692a6397"}},{"ruleId":"D2","level":"warning","message":{"text":"TestCx::run_rmake_test (cognitive 31): TestCx::run_rmake_test has cognitive complexity 31 (threshold 15). Drivers by points: if/else 25 (29 pts), boolean chains 1, loops 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/compiletest/src/runtest/run_make.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"8397cd7934d41793712dcaceca2577e939fba290730c99256bbb6d368ca04745"}},{"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":"src/tools/miri/cargo-miri/src/setup.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdeedf2f9db2aca35519c994ae7719b5ecf8847a87349818fbd9c2379088f72b"}},{"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/tools/miri/src/shims/native_lib/trace/parent.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac7a3f9a2b329e387bd3a55e0f141125059030a7617e38ef7379447517150f6f"}},{"ruleId":"D2","level":"warning","message":{"text":"hir::display::write_function (cognitive 31): hir::display::write_function has cognitive complexity 31 (threshold 15). Drivers by points: if/else 20 (22 pts), match/switch 3 (7 pts), boolean chains 1, loops 1 (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":"src/tools/rust-analyzer/crates/hir/src/display.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae89278d8ffa9a64cd84df354429ee13a0a169bf15cd80aa80d072c8c6dd1c06"}},{"ruleId":"D2","level":"warning","message":{"text":"DefCollector::seed_with_top_level (cognitive 31): DefCollector::seed_with_top_level has cognitive complexity 31 (threshold 15). Drivers by points: if/else 7 (17 pts), match/switch 4 (9 pts), boolean chains 3, loops 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/nameres/collector.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f3b03b59788f77ebe9ac29497a96e53a60c60a9ffb97841b4513b6fb2e68d15"}},{"ruleId":"D2","level":"warning","message":{"text":"DefCollector::push_res_and_update_glob_vis (cognitive 31): DefCollector::push_res_and_update_glob_vis has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (22 pts), boolean chains 9 (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/tools/rust-analyzer/crates/hir-def/src/nameres/collector.rs"},"region":{"startLine":1202}}}],"partialFingerprints":{"codehealthFindingId/v1":"edafe63161b9fc456a6e21f07b7c21e5eb4475e81116a94cb38418c5de72aa0d"}},{"ruleId":"D2","level":"warning","message":{"text":"UnsafeVisitor::walk_expr (cognitive 31): UnsafeVisitor::walk_expr has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (19 pts), match/switch 5 (8 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 14). 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/tools/rust-analyzer/crates/hir-ide/src/diagnostics/unsafe_check.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"7193af6a2d55a92aecab6e39c5e9c2f4541bfa095720e1bf8e486597edf62f73"}},{"ruleId":"D2","level":"warning","message":{"text":"InferenceContext::compute_min_captures (cognitive 31): InferenceContext::compute_min_captures has cognitive complexity 31 (threshold 15). Drivers by points: match/switch 5 (13 pts), if/else 5 (11 pts), loops 4 (7 pts) (nesting depth added 17). Of this number, 29 points are the body\u0027s own statements and 2 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/tools/rust-analyzer/crates/hir-ty/src/infer/closure/analysis.rs"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"7042e1389a7316707e24780a2f826ff264ae4c643a0543b35750fe81cfb9743e"}},{"ruleId":"D2","level":"warning","message":{"text":"MirEvalError::pretty_print (cognitive 31): MirEvalError::pretty_print has cognitive complexity 31 (threshold 15). Drivers by points: match/switch 9 (28 pts), loops 2 (3 pts) (nesting depth added 20). 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/tools/rust-analyzer/crates/hir-ide/src/mir_pretty/errors.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"976d2a78eea45e83229e0006b5882a0147ff22c4a89a96ce2a5fb035ce5c4923"}},{"ruleId":"D2","level":"warning","message":{"text":"ide::moniker::def_to_non_local_moniker (cognitive 31): ide::moniker::def_to_non_local_moniker has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (19 pts), match/switch 5 (10 pts), boolean chains 1, loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/moniker.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"440de61d70c11c76f60aaf52f72a2f16b74fea2fb4f2bd6a0d181aa191620cbf"}},{"ruleId":"D2","level":"warning","message":{"text":"parser::grammar::items::opt_item (cognitive 31): parser::grammar::items::opt_item has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 13, match/switch 3 (4 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/parser/src/grammar/items.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"74f51e33912394ca816ff0118855eb45bc4a9754e0d2ce1f48a5684a10b45d68"}},{"ruleId":"D2","level":"warning","message":{"text":"ControlFlow::rewrite_cond (cognitive 31): ControlFlow::rewrite_cond has cognitive complexity 31 (threshold 15). Drivers by points: if/else 21 (24 pts), boolean chains 6, match/switch 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/expr.rs"},"region":{"startLine":981}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ebaf866ba61e3f4ca417ae14491577914b9057fd951c0726b9a8557960b5505"}},{"ruleId":"D2","level":"warning","message":{"text":"Pat::rewrite_result (cognitive 30): Pat::rewrite_result has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (19 pts), match/switch 6 (11 pts) (nesting depth added 12). 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/tools/rustfmt/src/patterns.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"654c5fbb1535fa81ba32e89b48a1d933cf1f94c3cfd6bb01541cd1ae67825d9c"}},{"ruleId":"D2","level":"warning","message":{"text":"DocParser::parse_auto_cfg_values (cognitive 30): DocParser::parse_auto_cfg_values has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (22 pts), match/switch 2 (5 pts), boolean chains 2, loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_attr_parsing/src/attributes/doc.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"563fa915a930a549be5151ecff4c0a6df0c7b58d04be78e9261f7b7eb8c30c68"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_attr_parsing::attributes::doc::parse_notable_trait (cognitive 30): rustc_attr_parsing::attributes::doc::parse_notable_trait has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (19 pts), match/switch 3 (7 pts), loops 1 (4 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_attr_parsing/src/attributes/doc.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b5b1f6f1a399e1faad31d624d91a11eee16a6ed64056967cff75d5726bb9ca6"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_attr_parsing::check_cfg::unexpected_cfg_value (cognitive 30): rustc_attr_parsing::check_cfg::unexpected_cfg_value has cognitive complexity 30 (threshold 15). Drivers by points: if/else 19 (25 pts), boolean chains 5 (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":"compiler/rustc_attr_parsing/src/check_cfg.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"51f82136a02f5ec0b3718d9eddd04be4f400a79283b3324d6812bc84431c5e24"}},{"ruleId":"D2","level":"warning","message":{"text":"ConfigInfo::setup (cognitive 30): ConfigInfo::setup has cognitive complexity 30 (threshold 15). Drivers by points: if/else 20 (22 pts), match/switch 6 (7 pts), boolean chains 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_gcc/build_system/src/config.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"7564cf3130977b63ab24dfb449a40c15c31f446c674dbc743570bdc1c6ecb74f"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_codegen_cranelift::inline_asm::codegen_inline_asm_terminator (cognitive 30): rustc_codegen_cranelift::inline_asm::codegen_inline_asm_terminator has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (19 pts), match/switch 5 (9 pts), boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/src/inline_asm.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"02f15613a22f336b653e0ef46c120faf4c8a6bde86b8f1f58875a6b0d92f73d8"}},{"ruleId":"D2","level":"warning","message":{"text":"WrongNumberOfGenericArgs::suggest_adding_type_and_const_args (cognitive 30): WrongNumberOfGenericArgs::suggest_adding_type_and_const_args has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (19 pts), match/switch 3 (8 pts), loops 1 (2 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":"compiler/rustc_hir_analysis/src/diagnostics/wrong_number_of_generic_args.rs"},"region":{"startLine":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cb251df0210634763f348052c71ef7b7c3bbf7c9d68a6aaf9accb8986729118"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_hir_analysis::hir_ty_lowering::generics::generic_arg_mismatch_err (cognitive 30): rustc_hir_analysis::hir_ty_lowering::generics::generic_arg_mismatch_err has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (23 pts), boolean chains 4, match/switch 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/hir_ty_lowering/generics.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"26ded167f6de41a63d92b0b30a2aa144269133f286d01af76097934219042034"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::emit_err_pat_wrong_number_of_fields (cognitive 30): FnCtxt::emit_err_pat_wrong_number_of_fields has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (15 pts), match/switch 6 (11 pts), boolean chains 3, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/pat.rs"},"region":{"startLine":1895}}}],"partialFingerprints":{"codehealthFindingId/v1":"387bd14ad5aa0aed03b32dbdb81092f2b5603a1b6c567b7418f43e73f45a3a12"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::check_struct_pat_fields (cognitive 30): FnCtxt::check_struct_pat_fields has cognitive complexity 30 (threshold 15). Drivers by points: if/else 16 (23 pts), boolean chains 3, match/switch 2 (3 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/pat.rs"},"region":{"startLine":2088}}}],"partialFingerprints":{"codehealthFindingId/v1":"f909eba885eca72ff5d6a67bb91d586fd477291b26e617b0baeded38f6c181ba"}},{"ruleId":"D2","level":"warning","message":{"text":"Resolver::find_cfg_stripped (cognitive 30): Resolver::find_cfg_stripped has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (22 pts), loops 2 (4 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 15). Most of this is not in the body itself: 13 of the 30 points are its own statements and the rest belongs to one function item inside it that branches (comes_from_same_module_for_glob). 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":"compiler/rustc_resolve/src/diagnostics/impls.rs"},"region":{"startLine":3825}}}],"partialFingerprints":{"codehealthFindingId/v1":"ede0d3dd30c1520d875e9e3ad8db007566c1327a13269f2550138e0f939d733e"}},{"ruleId":"D2","level":"warning","message":{"text":"SubdiagnosticVariant::from_attr (cognitive 30): SubdiagnosticVariant::from_attr has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (22 pts), match/switch 5 (7 pts), loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_macros/src/diagnostics/utils.rs"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a5016247b1fff3283ea3f7fdebf343e2712165c8f71a039916864781af9855b"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_middle::ty::diagnostics::suggest_changing_unsized_bound (cognitive 30): rustc_middle::ty::diagnostics::suggest_changing_unsized_bound has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (20 pts), loops 3 (9 pts), boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/ty/diagnostics.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"8db05a7d3d1993383ed0ed89c00f8be83745dd697133bd7d3980ba7ac65eef9d"}},{"ruleId":"D2","level":"warning","message":{"text":"Builder::choose_bucket_for_candidate (cognitive 30): Builder::choose_bucket_for_candidate has cognitive complexity 30 (threshold 15). Drivers by points: if/else 16 (24 pts), match/switch 3 (5 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_build/src/builder/matches/buckets.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"36447e67809cfa3fe467a09befb97b35705cd063c1156700bae275c96149486e"}},{"ruleId":"D2","level":"warning","message":{"text":"AssignmentResult::find_dead_assignments (cognitive 30): AssignmentResult::find_dead_assignments has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 3 (8 pts), loops 4 (7 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/liveness.rs"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"06947c8340e09cab77e9de225e67dc6eed61eb7c87344b5e72ed4d78d64bbb4f"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_mir_transform::dest_prop::save_as_intervals (cognitive 30): rustc_mir_transform::dest_prop::save_as_intervals has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 3 (10 pts), loops 4 (5 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/dest_prop.rs"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"9de92c182e6d93a99d1d929cf7b67e3c1847ce62d97660c681986da1d294cc85"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_monomorphize::partitioning::internalize_symbols (cognitive 30): rustc_monomorphize::partitioning::internalize_symbols has cognitive complexity 30 (threshold 15). Drivers by points: if/else 6 (18 pts), loops 4 (8 pts), match/switch 1 (4 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_monomorphize/src/partitioning.rs"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c514f0ed6fb4b04ba9e6a694526fd34753e6c513012d16ef5673963a82388f4"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_next_trait_solver::solve::assembly::structural_traits::extract_tupled_inputs_and_output_from_callable (cognitive 30): rustc_next_trait_solver::solve::assembly::structural_traits::extract_tupled_inputs_and_output_from_callable has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (24 pts), boolean chains 3, match/switch 2 (3 pts) (nesting depth added 14). 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":"compiler/rustc_next_trait_solver/src/solve/assembly/structural_traits.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"f934f73e9250409a0912071d998255da4c04a13e29abd13705ecb14a804bbf5a"}},{"ruleId":"D2","level":"warning","message":{"text":"ReachableContext::propagate_node (cognitive 30): ReachableContext::propagate_node has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (19 pts), match/switch 5 (10 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_passes/src/reachable.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"c654de963d306a31cfdab6ee25f9ec4be400d3781741ead55bdd526108e2240b"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_target::callconv::loongarch::classify_arg (cognitive 30): rustc_target::callconv::loongarch::classify_arg has cognitive complexity 30 (threshold 15). Drivers by points: if/else 16 (24 pts), match/switch 3 (4 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_target/src/callconv/loongarch.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"48c70536cda97bf81de842e1e2f55894cbac50ecb4d7e064c1af73435fa60ece"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_target::callconv::riscv::classify_arg (cognitive 30): rustc_target::callconv::riscv::classify_arg has cognitive complexity 30 (threshold 15). Drivers by points: if/else 16 (24 pts), match/switch 3 (4 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_target/src/callconv/riscv.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"56e9afce74f21bca358a5c40ec3d43fc242ea5c296753c98fd7ffe93c49e3194"}},{"ruleId":"D2","level":"warning","message":{"text":"MaybeTransmutableQuery::answer_impl (cognitive 30): MaybeTransmutableQuery::answer_impl has cognitive complexity 30 (threshold 15). Drivers by points: if/else 16 (24 pts), match/switch 2 (4 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_transmute/src/maybe_transmutable/mod.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3164781a09d8258cf852a5f8cb917385c929528160b35212c11b0f94a148aa9"}},{"ruleId":"D2","level":"warning","message":{"text":"OpaqueTypeCollector::visit_ty (cognitive 30): OpaqueTypeCollector::visit_ty has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (24 pts), loops 1 (4 pts), boolean chains 1, match/switch 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ty_utils/src/opaque_types.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"a73764a53f286dadcbec02b869d343d32e36a1e0a1b1a9650d294bd379e7f9ad"}},{"ruleId":"D2","level":"warning","message":{"text":"Zip::next_back (cognitive 30): Zip::next_back has cognitive complexity 30 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 2 (10 pts), boolean chains 5 (nesting depth added 17). 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":"library/core/src/iter/adapters/zip.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"06c9ddda2efe68cddd9b8f65cf52a4290034297ea6346299f7e4368c086902d8"}},{"ruleId":"D2","level":"warning","message":{"text":"stdarch_gen_hexagon::hvx::generate_functions (cognitive 30): stdarch_gen_hexagon::hvx::generate_functions has cognitive complexity 30 (threshold 15). Drivers by points: if/else 13 (27 pts), loops 2, 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":"library/stdarch/crates/stdarch-gen-hexagon/src/hvx.rs"},"region":{"startLine":1438}}}],"partialFingerprints":{"codehealthFindingId/v1":"257ef0b5e17b07c201a926bb77fd335d7e6457e1754f6c43a37e41b131740267"}},{"ruleId":"D2","level":"warning","message":{"text":"bootstrap::utils::cc_detect::default_compiler (cognitive 30): bootstrap::utils::cc_detect::default_compiler has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (24 pts), match/switch 3 (5 pts), boolean chains 1 (nesting depth added 12). 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/bootstrap/src/utils/cc_detect.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7c3e7d86908d8e4906831b362611a7709b8b6e8887abfc7b66fcf3eae1bb7a2"}},{"ruleId":"D2","level":"warning","message":{"text":"Classifier::advance (cognitive 30): Classifier::advance has cognitive complexity 30 (threshold 15). Drivers by points: match/switch 8 (15 pts), if/else 5 (11 pts), boolean chains 2, loops 2 (nesting depth added 13). 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/librustdoc/html/highlight.rs"},"region":{"startLine":1060}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3c890a3cfa23c70bfc3e223db4db7c512dc64cd1a9b036585e03b1f798e1f83"}},{"ruleId":"D2","level":"warning","message":{"text":"rustdoc::html::markdown::rust_code_blocks (cognitive 30): rustdoc::html::markdown::rust_code_blocks has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (17 pts), match/switch 2 (7 pts), loops 2 (5 pts), boolean chains 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/markdown.rs"},"region":{"startLine":2050}}}],"partialFingerprints":{"codehealthFindingId/v1":"1987ede300fec535968860c49631e8ffa2094886213a94dfecc838d4cabb2b19"}},{"ruleId":"D2","level":"warning","message":{"text":"MultipleInherentImpl::check_crate_post (cognitive 30): MultipleInherentImpl::check_crate_post has cognitive complexity 30 (threshold 15). Drivers by points: if/else 4 (13 pts), match/switch 3 (11 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/inherent_impl.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"238c53da782a7dd61d24722e4100cdf90cf172a794069603cc8535072a4bdb9e"}},{"ruleId":"D2","level":"warning","message":{"text":"NeedlessLateInit::check_if_or_match (cognitive 30): NeedlessLateInit::check_if_or_match has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (25 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/needless_late_init.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"5785eb2d608597375422c7a55a82b757664fdfe2c91d4f22cb2102f1602d1904"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::doc::doc_suspicious_footnotes::check (cognitive 30): clippy_lints::doc::doc_suspicious_footnotes::check has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (17 pts), match/switch 2 (8 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/doc/doc_suspicious_footnotes.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea8fa35aa4189db2fa95f77c16bc0ba2a4a43f6b019c14e05b57e2ce903abb43"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::methods::str_splitn::parse_iter_usage (cognitive 30): clippy_lints::methods::str_splitn::parse_iter_usage has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (22 pts), match/switch 3 (5 pts), boolean chains 3 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/methods/str_splitn.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ff30fad30ffe4d1ccc436f3858cf950f718687ee342f2cfde2fbda17655378e"}},{"ruleId":"D2","level":"warning","message":{"text":"TestCx::run_codegen_units_test (cognitive 30): TestCx::run_codegen_units_test has cognitive complexity 30 (threshold 15). Drivers by points: if/else 16 (20 pts), loops 5 (8 pts), boolean chains 2 (nesting depth added 7). Of this number, 20 points are the body\u0027s own statements and 10 belong to 3 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/compiletest/src/runtest/codegen_units.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"b232bf589a1fa561f5bdce34b469817cc4954ede690795a616b0d53afa84de0d"}},{"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":"src/tools/miri/priroda/src/debugger.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"823b56159be9b0ba8f822bb3aa85eb73d9c55fa9ba3fa2bda4451010468ecf26"}},{"ruleId":"D2","level":"warning","message":{"text":"InferenceContext::deduce_closure_signature_from_predicates (cognitive 30): InferenceContext::deduce_closure_signature_from_predicates has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (19 pts), match/switch 3 (9 pts), boolean chains 1, loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/infer/closure.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad83aeedd4d5b8aa45e81b267ba337761bbdc9bf0a2fdadd6e37558045d571a1"}},{"ruleId":"D2","level":"warning","message":{"text":"ProbeContext::consider_probe (cognitive 30): ProbeContext::consider_probe has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (20 pts), match/switch 5 (8 pts), boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/method_resolution/probe.rs"},"region":{"startLine":1567}}}],"partialFingerprints":{"codehealthFindingId/v1":"79b5b2e906bab71cc58e0f3c0c209c56a91c3ab1fcd886455ee2552d9fbdfc3a"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_assists::handlers::convert_bool_to_enum::replace_usages (cognitive 30): ide_assists::handlers::convert_bool_to_enum::replace_usages has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (26 pts), match/switch 1 (3 pts), loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_bool_to_enum.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cc6d4a55ef5f194637beff1ab05ead080c4c238be325a554e2126bcb1319a5b"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_assists::handlers::convert_closure_to_fn::compute_closure_type_params (cognitive 30): ide_assists::handlers::convert_closure_to_fn::compute_closure_type_params has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 5 (11 pts), match/switch 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_closure_to_fn.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"36ea6064bad20468d344535f7222d111b35d4af22071deb41b0bd370c3c9fd36"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_db::syntax_helpers::format_string_exprs::parse_format_exprs (cognitive 30): ide_db::syntax_helpers::format_string_exprs::parse_format_exprs has cognitive complexity 30 (threshold 15). Drivers by points: if/else 13 (25 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-db/src/syntax_helpers/format_string_exprs.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"d37f335a51866c9b6aa7e9a023db142b246a542869d83ef975d2b65f2d4b33b5"}},{"ruleId":"D2","level":"warning","message":{"text":"GlobalState::compute_priming_scope (cognitive 30): GlobalState::compute_priming_scope has cognitive complexity 30 (threshold 15). Drivers by points: if/else 5 (19 pts), loops 4 (9 pts), match/switch 1 (2 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/global_state.rs"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"a534b3426e5156249958b054222ee69b390f08e08f90ac74e6f698f81d0bfc44"}},{"ruleId":"D2","level":"warning","message":{"text":"AstIdMap::from_source (cognitive 30): AstIdMap::from_source has cognitive complexity 30 (threshold 15). Drivers by points: if/else 5 (15 pts), match/switch 3 (7 pts), boolean chains 4, loops 3 (4 pts) (nesting depth added 15). Of this number, 29 points are the body\u0027s own statements and 1 belongs 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/tools/rust-analyzer/crates/span/src/ast_id.rs"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b774f48087931895611e18f6e5bde3d8d028b909b97b2288578d295748b2a95"}},{"ruleId":"D2","level":"warning","message":{"text":"UseTree::normalize (cognitive 30): UseTree::normalize has cognitive complexity 30 (threshold 15). Drivers by points: if/else 13 (20 pts), match/switch 3 (5 pts), loops 1 (3 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/imports.rs"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"74e1b8f12417d4aa74804ea0844c3348734d4c8a30b807531831b8fde2ef8130"}},{"ruleId":"D2","level":"warning","message":{"text":"RustBuild.build_bootstrap_cmd (cognitive 30): RustBuild.build_bootstrap_cmd has cognitive complexity 30 (threshold 15). Drivers by points: if/else 21 (22 pts), ternaries 4, boolean chains 2, error handling 1, loops 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/bootstrap.py"},"region":{"startLine":1067}}}],"partialFingerprints":{"codehealthFindingId/v1":"579ce347b8cb09f5756972e41c7e85917a00895077c2eb0f1b51204a5f87ec73"}},{"ruleId":"D2","level":"warning","message":{"text":"batchmode.main (cognitive 30): batchmode.main has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (20 pts), boolean chains 7, error handling 2, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/etc/debugger_tester/lldb/batchmode.py"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"f37e96696fde38ea4291e5f84d023a8f2555ac897ba3b3998e0aed3b20e57d20"}},{"ruleId":"D2","level":"warning","message":{"text":"htmldocck.compare_tree (cognitive 30): htmldocck.compare_tree has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (27 pts), loops 3 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/etc/htmldocck.py"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"534b53dc41b7445eac72e9b1e4a789efae58b5bf8db4dfecc842373e4fd76b1b"}},{"ruleId":"D2","level":"warning","message":{"text":"DocSearch.parseQuery::parseInput (cognitive 30): DocSearch.parseQuery::parseInput has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (27 pts), loops 2, boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":1442}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ab39279e0b6d07990eef361d00471f3b0899d8daf41683f7a1157c330771d6a"}},{"ruleId":"D2","level":"warning","message":{"text":"DocSearch.getRow (cognitive 30): DocSearch.getRow has cognitive complexity 30 (threshold 15). Drivers by points: ternaries 17 (19 pts), boolean chains 9, if/else 2 (nesting depth added 2). Of this number, 26 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":1930}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d7f6b96bb42464b14312824aeb5c4a557ed738c4ef358a0b409227ce9d3f55f"}},{"ruleId":"D2","level":"warning","message":{"text":"search.initSearch::parseInput (cognitive 30): search.initSearch::parseInput has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (27 pts), loops 2, boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 15 other methods here (search.initSearch, search.initSearch::getItemsBefore, search.initSearch::getNextElem, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 16 times rather than 16 independent problems. Splitting this body alone leaves the other 15 exactly as they are. Where these are variations on one operation, the change that clears all 16 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":1442}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1bcf7128ee18e5d91f582e5b6ab7c88b86ffdce3ba106b3382de68a18076155"}},{"ruleId":"D2","level":"warning","message":{"text":"initSearch::parseQuery::parseInput (cognitive 30): initSearch::parseQuery::parseInput has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (27 pts), loops 2, boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":1442}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0fad4c1a1ec638738b1ee6a4472c63dd9b88603b30c6a8a7935125a367bedcc"}},{"ruleId":"D2","level":"warning","message":{"text":"LoweringContext::lower_path_segment (cognitive 29): LoweringContext::lower_path_segment has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 4 (12 pts), boolean chains 3 (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":"compiler/rustc_ast_lowering/src/path.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfa772d5a4bad3d42bf14ba3e50787f67f17e9c8a58ce7bf880ee064a121ec0c"}},{"ruleId":"D2","level":"warning","message":{"text":"State::print_inline_asm (cognitive 29): State::print_inline_asm has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (17 pts), match/switch 5 (11 pts), loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ast_pretty/src/pprust/state.rs"},"region":{"startLine":1768}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b386e4a1d5f582740eb565e5ed034ebdd4d542b7ae7b99c0cac69a754c3b74f"}},{"ruleId":"D2","level":"warning","message":{"text":"PrintState::print_comment (cognitive 29): PrintState::print_comment has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 3 (8 pts), match/switch 2 (3 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":"compiler/rustc_ast_pretty/src/pprust/state.rs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f125ffc0aa57e740a93ce482622a42474248f6f21a1cbc2f27831b9d213ca3d"}},{"ruleId":"D2","level":"warning","message":{"text":"y::utils::split_args (cognitive 29): y::utils::split_args has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (21 pts), loops 3 (7 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_gcc/build_system/src/utils.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"081ccff659c4dac71a9a9354cd9858d74cc23ba6d05da322bd9feb659cc780f0"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_codegen_cranelift::codegen_f16_f128::codegen_cast (cognitive 29): rustc_codegen_cranelift::codegen_f16_f128::codegen_cast has cognitive complexity 29 (threshold 15). Drivers by points: if/else 14 (19 pts), boolean chains 5, match/switch 2 (5 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/src/codegen_f16_f128.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3afb756ae095e6ad92798625548f7ab4e80988328ce6b1de106cf183de08980"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_codegen_llvm::attributes::instrument_function_attr (cognitive 29): rustc_codegen_llvm::attributes::instrument_function_attr has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (18 pts), match/switch 4 (11 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/attributes.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"24f942045ae4448fe2a59c9268bac8d647a936200507856739189c29b091c14b"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_codegen_llvm::callee::get_fn (cognitive 29): rustc_codegen_llvm::callee::get_fn has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13 (22 pts), boolean chains 7 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/callee.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"68e5ae3ff21473a5857c5091d99e8886ac59cad7e7edeba99d866c4bc733fb6e"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionCx::codegen_argument (cognitive 29): FunctionCx::codegen_argument has cognitive complexity 29 (threshold 15). Drivers by points: match/switch 9 (18 pts), if/else 4 (9 pts), boolean chains 2 (nesting depth added 14). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/mir/block.rs"},"region":{"startLine":1976}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd191396e99b59a659a2284bd0582ad7542a2a8a58805cbb99e5406fa51719c7"}},{"ruleId":"D2","level":"warning","message":{"text":"InvocationCollector::flat_map_node (cognitive 29): InvocationCollector::flat_map_node has cognitive complexity 29 (threshold 15). Drivers by points: match/switch 5 (16 pts), if/else 2 (7 pts), loops 2 (6 pts) (nesting depth added 20). 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":"compiler/rustc_expand/src/expand.rs"},"region":{"startLine":2338}}}],"partialFingerprints":{"codehealthFindingId/v1":"d812de03ae61642080160fd508d24359c67c9e6d2f76066898813bd2a267f1cd"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_expand::config::features (cognitive 29): rustc_expand::config::features has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (26 pts), loops 1 (2 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":"compiler/rustc_expand/src/config.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"252713f97662c210fa52de9508bc0118ad68561ad6eb7061c57a7f83ba17ae16"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::borrow_pat_suggestion (cognitive 29): FnCtxt::borrow_pat_suggestion has cognitive complexity 29 (threshold 15). Drivers by points: if/else 6 (16 pts), match/switch 3 (7 pts), boolean chains 3, loops 1 (3 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/pat.rs"},"region":{"startLine":1374}}}],"partialFingerprints":{"codehealthFindingId/v1":"f013a28c8de9e7eb261d0d0a24e8cf276a8d540a9ad04aa86a36b25e631721fb"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::convert_place_derefs_to_mutable (cognitive 29): FnCtxt::convert_place_derefs_to_mutable has cognitive complexity 29 (threshold 15). Drivers by points: if/else 6 (20 pts), loops 3 (5 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/place_op.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"193af35ef0bced3a0c67317f8ff38e7a8ce3638c9cf00b645a4755746d75e857"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_lint::types::lint_nan (cognitive 29): rustc_lint::types::lint_nan has cognitive complexity 29 (threshold 15). Drivers by points: if/else 18, match/switch 4 (6 pts), loops 3, boolean chains 2 (nesting depth added 2). Most of this is not in the body itself: 3 of the 29 points are its own statements and the rest belongs to 3 function items inside it that branch (eq_ne_suggestion, nan_method_path, nan_ty). 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":"compiler/rustc_lint/src/types.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"9610f2ccb684fa17f49834f2c25c28022bb01fb370214377e05472efa0af37bc"}},{"ruleId":"D2","level":"warning","message":{"text":"UndefinedBehaviorInfo::fmt (cognitive 29): UndefinedBehaviorInfo::fmt has cognitive complexity 29 (threshold 15). Drivers by points: if/else 15 (27 pts), match/switch 2 (nesting depth added 12). Of this number, 26 points are the body\u0027s own statements and 3 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":"compiler/rustc_middle/src/mir/interpret/error.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"391611d54cf4c0b5a32057be82a923f3a7a1d408b8072e5882a42f561e5261cd"}},{"ruleId":"D2","level":"warning","message":{"text":"ConstInt::fmt (cognitive 29): ConstInt::fmt has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 7 (14 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/ty/consts/int.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"74d314a3cfc39df301c1cbfbf5503399d6b82af8db637c1385700c95161f51c0"}},{"ruleId":"D2","level":"warning","message":{"text":"PrettyPrinter::pretty_print_const_valtree (cognitive 29): PrettyPrinter::pretty_print_const_valtree has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 4 (8 pts), loops 1 (4 pts), boolean chains 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/ty/print/pretty.rs"},"region":{"startLine":1902}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1505610feac3e7ce82591542e4bd0ab58d472f50145b4c176d55241bb001811"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parameter_without_type (cognitive 29): Parser::parameter_without_type has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 7, match/switch 2 (5 pts), loops 1 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/diagnostics.rs"},"region":{"startLine":2001}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3aa5ffcafb4a6c42ab82fc06902e764c9954297459dcda60c675593fafc51d6"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_if_after_cond (cognitive 29): Parser::parse_if_after_cond has cognitive complexity 29 (threshold 15). Drivers by points: if/else 15 (25 pts), boolean chains 3, match/switch 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/expr.rs"},"region":{"startLine":2392}}}],"partialFingerprints":{"codehealthFindingId/v1":"c409485f452fe29bf12f09172bbcda2168eb7a3111ac65aa1df77e61596dbc98"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeErrCtxt::consider_returning_binding_diag (cognitive 29): TypeErrCtxt::consider_returning_binding_diag has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 4, loops 2 (4 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":"compiler/rustc_trait_selection/src/error_reporting/infer/suggest.rs"},"region":{"startLine":912}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2c5c993bc666a64481ef0c1cfd05ab932556579b9373c55994625809c0c82e4"}},{"ruleId":"D2","level":"warning","message":{"text":"SelectionContext::assemble_candidates_from_auto_impls (cognitive 29): SelectionContext::assemble_candidates_from_auto_impls has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (22 pts), match/switch 2 (6 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/traits/select/candidate_assembly.rs"},"region":{"startLine":749}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c27e72775fd5fc80e5cb13cc4ed1b32639fb136aeb4b7d55243185ebe5aa977"}},{"ruleId":"D2","level":"warning","message":{"text":"SearchGraph::rebase_provisional_cache_entries (cognitive 29): SearchGraph::rebase_provisional_cache_entries has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 4 (11 pts), match/switch 1 (2 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_type_ir/src/search_graph/mod.rs"},"region":{"startLine":1013}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e35e0816f5cc0a78ff3be658abb177e7010349ff3cd507bb2d5708e7bfd13e0"}},{"ruleId":"D2","level":"warning","message":{"text":"core::num::imp::flt2dec::strategy::grisu::max_pow10_no_more_than (cognitive 29): core::num::imp::flt2dec::strategy::grisu::max_pow10_no_more_than has cognitive complexity 29 (threshold 15). Drivers by points: if/else 17 (29 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":"library/core/src/num/imp/flt2dec/strategy/grisu.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d2f02e0f14551c631f9695dee79991ef29a23c772cfc3c5188cedfe98c8d4ba"}},{"ruleId":"D2","level":"warning","message":{"text":"UdpSocket::send_to (cognitive 29): UdpSocket::send_to has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (20 pts), loops 3 (5 pts), match/switch 2 (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":"library/std/src/sys/net/connection/xous/udp.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccb67350b59d119b7c73c1d4215c5ac3cce50210776b33df81e4783147cb0b3e"}},{"ruleId":"D2","level":"warning","message":{"text":"stdarch_gen_arm::intrinsic::create_tokens (cognitive 29): stdarch_gen_arm::intrinsic::create_tokens has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13 (18 pts), loops 3 (6 pts), match/switch 3, boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/stdarch-gen-arm/src/intrinsic.rs"},"region":{"startLine":1691}}}],"partialFingerprints":{"codehealthFindingId/v1":"940025d2a059ecc86ad1c7efc01db39f180c4dbd19986abe6352ffb46178ba04"}},{"ruleId":"D2","level":"warning","message":{"text":"stdarch_gen_hexagon::scalar::parse_prototype (cognitive 29): stdarch_gen_hexagon::scalar::parse_prototype has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (26 pts), loops 1 (3 pts) (nesting depth added 19). 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":"library/stdarch/crates/stdarch-gen-hexagon/src/scalar.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"345c649db074b677ed8613a11a10e2c0d8907597bf3d42a015634a76ca590ad2"}},{"ruleId":"D2","level":"warning","message":{"text":"TagIterator::parse_outside_attribute_block (cognitive 29): TagIterator::parse_outside_attribute_block has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13 (24 pts), boolean chains 4, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/markdown.rs"},"region":{"startLine":1173}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8b2774453ad6e1ef1d1a6de106dc57dadd5b7d8e2fddea02c2be98eded0d2e9"}},{"ruleId":"D2","level":"warning","message":{"text":"LinkCollector::resolve_links (cognitive 29): LinkCollector::resolve_links has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13 (22 pts), boolean chains 3, loops 3, match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/passes/collect_intra_doc_links.rs"},"region":{"startLine":1079}}}],"partialFingerprints":{"codehealthFindingId/v1":"06a71c4aa7d807ac44806e3d52a724e63798fba9c965bd616a54aa9cce9c8235"}},{"ruleId":"D2","level":"warning","message":{"text":"rustdoc::html::render::print_item::item_variants (cognitive 29): rustdoc::html::render::print_item::item_variants has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (19 pts), match/switch 2 (6 pts), loops 2 (4 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/render/print_item.rs"},"region":{"startLine":1794}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2881f64ff0db12dc2492a7412c98d7d7debbf04683d3f4a9a4977dcb8a5a34e"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::functions::too_many_lines::check_fn (cognitive 29): clippy_lints::functions::too_many_lines::check_fn has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (22 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/functions/too_many_lines.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfbe85c5f7c7d31231fb287fafe3e8d2b87a8b9eb82f42102b58067148b7d35d"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::manual_let_else::replace_in_pattern (cognitive 29): clippy_lints::manual_let_else::replace_in_pattern has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (25 pts), match/switch 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/tools/clippy/clippy_lints/src/manual_let_else.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"83f511fd66b0b946ccca1c5b9c87f96be2bce15d3d8174382bd8d6082ea7664b"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::matches::match_same_arms::check (cognitive 29): clippy_lints::matches::match_same_arms::check has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 8, match/switch 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/matches/match_same_arms.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4f9ad9f13e30fe8486ef97a18fd19a99f1473cec6c9bbb05e724f08e589b6ae"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::operators::bit_mask::check (cognitive 29): clippy_lints::operators::bit_mask::check has cognitive complexity 29 (threshold 15). Drivers by points: match/switch 4 (15 pts), if/else 8 (10 pts), boolean chains 4 (nesting depth added 13). 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/tools/clippy/clippy_lints/src/operators/bit_mask.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb07c7b1138b13dc49bbb26e2e7ca0f064603f6c379aade71285ee90380aefc7"}},{"ruleId":"D2","level":"warning","message":{"text":"HirEqInterExpr::check_ctxt (cognitive 29): HirEqInterExpr::check_ctxt has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (20 pts), boolean chains 7, loops 1 (2 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/tools/clippy/clippy_utils/src/hir_utils.rs"},"region":{"startLine":929}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1861d1afc7420302d5cf5e6b04e9f1785da94e339f4b3b4e9a5931dfa01e7f6"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_utils::mir::reachable_while_storage_live (cognitive 29): clippy_utils::mir::reachable_while_storage_live has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 4 (7 pts), boolean chains 3 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_utils/src/mir/mod.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"60f3edc040fb139a9068ac522178e64d92e392482017b7cb717a6fc5933f64e9"}},{"ruleId":"D2","level":"warning","message":{"text":"compiletest::directives::ignore_gdb (cognitive 29): compiletest::directives::ignore_gdb has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13 (26 pts), boolean chains 3 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/compiletest/src/directives.rs"},"region":{"startLine":1059}}}],"partialFingerprints":{"codehealthFindingId/v1":"868472f0e0769f67578e52148198fa9605242c159cc6f6e0f5d0cfe87e5c26b1"}},{"ruleId":"D2","level":"warning","message":{"text":"hir::source_analyzer::resolve_hir_path_ (cognitive 29): hir::source_analyzer::resolve_hir_path_ has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (20 pts), match/switch 4 (5 pts), boolean chains 4 (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/tools/rust-analyzer/crates/hir/src/source_analyzer.rs"},"region":{"startLine":1873}}}],"partialFingerprints":{"codehealthFindingId/v1":"71f20564274639695358ea33d77017338f534d1d12b61f361a96ec050b972a3a"}},{"ruleId":"D2","level":"warning","message":{"text":"hir_def::expr_store::pretty::print_generic_params (cognitive 29): hir_def::expr_store::pretty::print_generic_params has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (21 pts), loops 2 (4 pts), match/switch 1 (4 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/expr_store/pretty.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae024acd1d7668060d63bba5eb16e8c37f526f46b11081ce681d9b95a9a7edbd"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_assists::handlers::extract_module::extract_module (cognitive 29): ide_assists::handlers::extract_module::extract_module has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13 (19 pts), loops 5 (8 pts), boolean chains 1, match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/extract_module.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdbb11c89cb37e1df05443b135a7afd391893570f71124a17bfe85bc03194ed2"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_assists::handlers::generate_delegate_methods::generate_delegate_methods (cognitive 29): ide_assists::handlers::generate_delegate_methods::generate_delegate_methods has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (17 pts), match/switch 4 (8 pts), boolean chains 2, loops 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_delegate_methods.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"45c78f56fb536e1766d2f742cb62abad98fb364b15c42074eb1de4a75e7acbca"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_db::imports::merge_imports::recursive_normalize (cognitive 29): ide_db::imports::merge_imports::recursive_normalize has cognitive complexity 29 (threshold 15). Drivers by points: if/else 15 (24 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-db/src/imports/merge_imports.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8c5ebeea42fd24896d296edc10ed210a22d9d0358347d5c8617b7fb7ccb24e8"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_diagnostics::handlers::missing_fields::fixes (cognitive 29): ide_diagnostics::handlers::missing_fields::fixes has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (21 pts), loops 2 (4 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-diagnostics/src/handlers/missing_fields.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"6056679ff38f2f66854e8132d1086d204bddfb650384e7e127b821d72a64bee1"}},{"ruleId":"D2","level":"warning","message":{"text":"rustfmt_nightly::items::format_impl (cognitive 29): rustfmt_nightly::items::format_impl has cognitive complexity 29 (threshold 15). Drivers by points: if/else 14 (20 pts), boolean chains 5, match/switch 2 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/items.rs"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"9163d6ccfe17f5255e258a15ab6f1076741b8b268e4e6e8f89df3d66cf43c795"}},{"ruleId":"D2","level":"warning","message":{"text":"tidy::rustdoc_templates::check (cognitive 29): tidy::rustdoc_templates::check has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (21 pts), loops 2 (4 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/tidy/src/rustdoc_templates.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"14f1e1594e4a1e53937d2fb255d5c7a810eeaef1b8cdef89da415f352a76dc50"}},{"ruleId":"D2","level":"warning","message":{"text":"configure.parse_args (cognitive 29): configure.parse_args has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (25 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/configure.py"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"b504217d9afedc722a238ecba9bad933baeaa7a0a88cd48d981ec296ad5a779b"}},{"ruleId":"D2","level":"warning","message":{"text":"Attribute::rewrite_result (cognitive 28): Attribute::rewrite_result has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 3 (12 pts), boolean chains 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/attr.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"30277ca77aa7412941d8a476d00aa29415310c4721c0866406de7fd0484fb1d3"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_attr_parsing::attributes::cfg::eval_config_entry (cognitive 28): rustc_attr_parsing::attributes::cfg::eval_config_entry has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (23 pts), loops 2 (4 pts), match/switch 1 (nesting depth added 12). 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":"compiler/rustc_attr_parsing/src/attributes/cfg.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dfe4f83bf04eecd3575682ec14168d51a5db52627998178798e11f602a831d4"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_attr_parsing::attributes::proc_macro_attrs::parse_derive_like (cognitive 28): rustc_attr_parsing::attributes::proc_macro_attrs::parse_derive_like has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14 (25 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_attr_parsing/src/attributes/proc_macro_attrs.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8ab1f2ff4dc9c52d557cfdb104ba22c0cf056001783cfc384730de0097aef64"}},{"ruleId":"D2","level":"warning","message":{"text":"MirBorrowckCtxt::propagate_closure_used_mut_upvar (cognitive 28): MirBorrowckCtxt::propagate_closure_used_mut_upvar has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (18 pts), match/switch 4 (9 pts), loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/lib.rs"},"region":{"startLine":1653}}}],"partialFingerprints":{"codehealthFindingId/v1":"942e77e0343b67768509a2ce9367d88974c52c848c343970612c203c1a281575"}},{"ruleId":"D2","level":"warning","message":{"text":"Builder::dbg_scope_fn (cognitive 28): Builder::dbg_scope_fn has cognitive complexity 28 (threshold 15). Drivers by points: if/else 19 (23 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 5). Most of this is not in the body itself: 8 of the 28 points are its own statements and the rest belongs to 3 function items inside it that branch (get_containing_scope, get_function_signature, get_template_parameters). 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":"compiler/rustc_codegen_llvm/src/debuginfo/mod.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"12486b38df02dccd3ed5895a753922887b4dd4f8e8ee33aeb709a80da99624af"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_codegen_llvm::builder::autodiff::adjust_activity_to_abi (cognitive 28): rustc_codegen_llvm::builder::autodiff::adjust_activity_to_abi has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 3 (11 pts), loops 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/builder/autodiff.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"df5b79f55aa255ca2e6fa7d1760fe3c9f687dfdd01d883efd4fadd9f5071da31"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_codegen_ssa::back::link::exec_linker (cognitive 28): rustc_codegen_ssa::back::link::exec_linker has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (11 pts), match/switch 3 (8 pts), loops 4 (7 pts), boolean chains 2 (nesting depth added 11). Of this number, 22 points are the body\u0027s own statements and 6 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":"compiler/rustc_codegen_ssa/src/back/link.rs"},"region":{"startLine":2135}}}],"partialFingerprints":{"codehealthFindingId/v1":"52c55bc8b959fb13ddd22bfee0efd37d78df7aa024ff6f68220f522880f41ac8"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_codegen_ssa::back::write::do_thin_lto (cognitive 28): rustc_codegen_ssa::back::write::do_thin_lto has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 3 (8 pts), loops 3 (5 pts), boolean chains 3 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/back/write.rs"},"region":{"startLine":981}}}],"partialFingerprints":{"codehealthFindingId/v1":"1148d03e87d951409c03bf5ca3b70a2700bfaaaa25125c0ca4a80f9a5b7206a9"}},{"ruleId":"D2","level":"warning","message":{"text":"ValidityVisitor::try_visit_primitive (cognitive 28): ValidityVisitor::try_visit_primitive has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (26 pts), boolean chains 1, match/switch 1 (nesting depth added 13). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_const_eval/src/interpret/validity.rs"},"region":{"startLine":853}}}],"partialFingerprints":{"codehealthFindingId/v1":"68dcfa17e3a14a9ce591f7ed02cfa0c49739c64e8bf8a1634e960b388d4fd992"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_errors::emitter::detect_confusion_type (cognitive 28): rustc_errors::emitter::detect_confusion_type has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (20 pts), boolean chains 4, loops 1 (2 pts), match/switch 2 (nesting depth added 12). 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":"compiler/rustc_errors/src/emitter.rs"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"a67f72d6bc07a11d63f24752f3ede3d67b248a13c8baf2de3fd917879e81367e"}},{"ruleId":"D2","level":"warning","message":{"text":"WrongNumberOfGenericArgs::get_lifetime_args_suggestions_from_param_names (cognitive 28): WrongNumberOfGenericArgs::get_lifetime_args_suggestions_from_param_names has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (22 pts), boolean chains 4, loops 1, match/switch 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/diagnostics/wrong_number_of_generic_args.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe0479ba04b43852bb4538249e91f261dc25bd5518e97e5f0ca4af65b95014d0"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_hir_analysis::check::check::check_packed (cognitive 28): rustc_hir_analysis::check::check::check_packed has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (20 pts), loops 2 (6 pts), boolean chains 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/check/check.rs"},"region":{"startLine":1666}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e41a6da60e6e2dd63e93fcf154e7c3f372f4cc83c4fed0e9ce46ada52b601a8"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_hir_analysis::check::wfcheck::check_type_defn (cognitive 28): rustc_hir_analysis::check::wfcheck::check_type_defn has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 3 (5 pts), boolean chains 4, match/switch 1 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/check/wfcheck.rs"},"region":{"startLine":980}}}],"partialFingerprints":{"codehealthFindingId/v1":"48ffca9800144a8a66e2ecf760722a0fc0e72a7b8598febb7efec34c927f8be1"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_hir_analysis::check::wfcheck::check_where_clauses (cognitive 28): rustc_hir_analysis::check::wfcheck::check_where_clauses has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (20 pts), match/switch 1 (4 pts), boolean chains 3, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/check/wfcheck.rs"},"region":{"startLine":1447}}}],"partialFingerprints":{"codehealthFindingId/v1":"c505324ac64607f9f2e8182c923aaa9ec495b61beaf73e047fcdcf4ffe542de2"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_hir_analysis::collect::item_bounds::remap_gat_vars_and_recurse_into_nested_projections (cognitive 28): rustc_hir_analysis::collect::item_bounds::remap_gat_vars_and_recurse_into_nested_projections has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (18 pts), match/switch 3 (7 pts), loops 2, 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":"compiler/rustc_hir_analysis/src/collect/item_bounds.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"b41777c4ea0e3420542bbe6863d900ec90ce4a10b8aa44d8687af809b91d1ee7"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_hir_analysis::variance::variance_of_opaque (cognitive 28): rustc_hir_analysis::variance::variance_of_opaque has cognitive complexity 28 (threshold 15). Drivers by points: loops 6 (12 pts), if/else 5 (8 pts), match/switch 3 (6 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/variance/mod.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3a9bb49dec35778517396db3884061f926ece75b518fb6ae50b59ed08a33954"}},{"ruleId":"D2","level":"warning","message":{"text":"ExprUseVisitor::walk_captures (cognitive 28): ExprUseVisitor::walk_captures has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 3 (7 pts), match/switch 2 (7 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/expr_use_visitor.rs"},"region":{"startLine":991}}}],"partialFingerprints":{"codehealthFindingId/v1":"172eb0d61840e0cf3ae3704a6747a385d795ea3a5e90d569c2ccea57c7143792"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::probe_op (cognitive 28): FnCtxt::probe_op has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (13 pts), match/switch 5 (11 pts), boolean chains 4 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/method/probe.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"f297275dc8ff71fc83f6584243aeea71a07ba010e04e5ad652493cfb2d9d1734"}},{"ruleId":"D2","level":"warning","message":{"text":"SubdiagnosticDeriveVariantBuilder::into_tokens (cognitive 28): SubdiagnosticDeriveVariantBuilder::into_tokens has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14 (23 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_macros/src/diagnostics/subdiagnostic.rs"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"338b00639570bf18163e2f29fd49a6442dba3a54ebd88591cb7594985cd18181"}},{"ruleId":"D2","level":"warning","message":{"text":"ConstToPat::alias_to_pat (cognitive 28): ConstToPat::alias_to_pat has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (18 pts), match/switch 2 (5 pts), boolean chains 4, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_build/src/thir/pattern/const_to_pat.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"944671969ad0725e105227d019bc5a5665acd5c483fddfab6ecb115075361c73"}},{"ruleId":"D2","level":"warning","message":{"text":"DropCtxt::open_drop_for_multivariant (cognitive 28): DropCtxt::open_drop_for_multivariant has cognitive complexity 28 (threshold 15). Drivers by points: if/else 16 (27 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/elaborate_drop.rs"},"region":{"startLine":1069}}}],"partialFingerprints":{"codehealthFindingId/v1":"3381612a6d24be91a9f9ae9abcfed85f3a8ce5cef522f4c0ca451b8c5c7c41ef"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionItemRefChecker::check_bound_args (cognitive 28): FunctionItemRefChecker::check_bound_args has cognitive complexity 28 (threshold 15). Drivers by points: if/else 4 (20 pts), loops 3 (8 pts) (nesting depth added 21). 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":"compiler/rustc_mir_transform/src/function_item_references.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"10e2acddb6ee19bb54aa8ad43894ac09e69c89c4bb77c39c29028dba4c6d2bc4"}},{"ruleId":"D2","level":"warning","message":{"text":"CfgChecker::check_cleanup_control_flow (cognitive 28): CfgChecker::check_cleanup_control_flow has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 6 (8 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/validate.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"517c97b9957ebae84c2b7f3dcbeae77e8b917c82fe51eb3c5dbc5a82bc2cf253"}},{"ruleId":"D2","level":"warning","message":{"text":"LateResolutionVisitor::lookup_doc_alias_name (cognitive 28): LateResolutionVisitor::lookup_doc_alias_name has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (20 pts), loops 3 (5 pts), boolean chains 3 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/late/diagnostics.rs"},"region":{"startLine":1342}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6232e3776a8a644ea88a326556b66191f87eab8687bd0fa6c2baca00d24af02"}},{"ruleId":"D2","level":"warning","message":{"text":"libm::math::tanf::tanf (cognitive 28): libm::math::tanf::tanf has cognitive complexity 28 (threshold 15). Drivers by points: if/else 17 (28 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/compiler-builtins/libm/src/math/tanf.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e85f00d56a53b50b38f8747b02f7a214456b7509a99c3e69982c73826014409"}},{"ruleId":"D2","level":"warning","message":{"text":"std::sys::thread_local::guard::windows::enable (cognitive 28): std::sys::thread_local::guard::windows::enable has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (25 pts), match/switch 1 (3 pts) (nesting depth added 17). 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":"library/std/src/sys/thread_local/guard/windows.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"421cf32637326b9a8acaaedf0c7b6cf50805d0f79354ce293e2d9ec9eeb7935d"}},{"ruleId":"D2","level":"warning","message":{"text":"FindCalls::visit_expr (cognitive 28): FindCalls::visit_expr has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (16 pts), match/switch 5 (12 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/scrape_examples.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"1150ff04c099ae4ed6f2623b74cca35ddf651070420ccf5e3f0b83259943a107"}},{"ruleId":"D2","level":"warning","message":{"text":"FloatLiteral::check_expr (cognitive 28): FloatLiteral::check_expr has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (19 pts), boolean chains 5, match/switch 2 (4 pts) (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/tools/clippy/clippy_lints/src/float_literal.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b04da10d1d846febcd5e3f3384902b85d05002519702f10474db18fa986b830"}},{"ruleId":"D2","level":"warning","message":{"text":"FormatArgsExpr::check_templates (cognitive 28): FormatArgsExpr::check_templates has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (19 pts), boolean chains 5, loops 2 (4 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/format_args.rs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"62641507672b310606c677d34c80041f649f3cc13c40124fd2b0866953e2a6af"}},{"ruleId":"D2","level":"warning","message":{"text":"MacroUseImports::check_crate_post (cognitive 28): MacroUseImports::check_crate_post has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (22 pts), loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/macro_use.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e73b03cc7800cd40eb31200c62cca6523c98b5fcb58d1a10239e79ffc3dcb18"}},{"ruleId":"D2","level":"warning","message":{"text":"TupleArrayConversions::check_expr (cognitive 28): TupleArrayConversions::check_expr has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 10, match/switch 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/tuple_array_conversions.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c3a70d21d356f1da7ad42de6522f6b2455a2cd0655588566d5462a81e1592b5"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::methods::unnecessary_map_or::check (cognitive 28): clippy_lints::methods::unnecessary_map_or::check has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14 (17 pts), boolean chains 6, match/switch 2 (5 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":"src/tools/clippy/clippy_lints/src/methods/unnecessary_map_or.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"c43b47d8d28fe45b74989d61bde3e6f07b7456c4e07ea6c89e750fd01be1f2d3"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::misc_early::unneeded_field_pattern::check (cognitive 28): clippy_lints::misc_early::unneeded_field_pattern::check has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (21 pts), loops 2 (5 pts), boolean chains 2 (nesting depth added 16). 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/tools/clippy/clippy_lints/src/misc_early/unneeded_field_pattern.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"5415079250022a26f30ac4f4c0364313f76f93843f47f229e076398288d44d03"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::undocumented_unsafe_blocks::text_has_safety_comment (cognitive 28): clippy_lints::undocumented_unsafe_blocks::text_has_safety_comment has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 6, match/switch 2 (5 pts), loops 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/undocumented_unsafe_blocks.rs"},"region":{"startLine":801}}}],"partialFingerprints":{"codehealthFindingId/v1":"f929bc6b8fd32794bee9f3a69e816a8cc5cd009433bb6362b39d7f7410eed917"}},{"ruleId":"D2","level":"warning","message":{"text":"ExprEagernessVisitor::visit_binary (cognitive 28): ExprEagernessVisitor::visit_binary has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 5 (8 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_utils/src/eager_or_lazy.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e005233efaf6c253d140a9307f071f2804d5b99131ee8731e344be73cdd7a80"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_utils::paths::local_item_child_by_name (cognitive 28): clippy_utils::paths::local_item_child_by_name has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (20 pts), match/switch 3 (6 pts), boolean chains 2 (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_utils/src/paths.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab3cd37bbec06dd422d53b2d8582063849bf530427bcc17e3c57da3fa475a6f1"}},{"ruleId":"D2","level":"warning","message":{"text":"compiletest::json::push_actual_errors (cognitive 28): compiletest::json::push_actual_errors has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 8 (13 pts), boolean chains 1, match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/compiletest/src/json.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"81c80cdacf9d7ee1d48ff0e1bfcd40f361e3c491682e5c88d97b2b1d938abf1a"}},{"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/tools/miri/src/shims/unix/foreign_items.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"be0028ca2cd35d5a06b290390a28e7bc048e9f3f3024a5845e76092f7001c264"}},{"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/tools/miri/src/shims/unix/linux_like/epoll.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"68145634e199c184ce63e01cadde0f658053766af6005a11ab78fed08f049450"}},{"ruleId":"D2","level":"warning","message":{"text":"Printer::print_type_ref (cognitive 28): Printer::print_type_ref has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (19 pts), match/switch 3 (5 pts), loops 2 (4 pts) (nesting depth added 15). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/expr_store/pretty.rs"},"region":{"startLine":1259}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f063521b095d7c97ce595de19a4bcacc92910077edf839929f19703d02b3bbb"}},{"ruleId":"D2","level":"warning","message":{"text":"SolverContext::compute_goal_fast_path (cognitive 28): SolverContext::compute_goal_fast_path has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (20 pts), match/switch 3 (6 pts), boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/next_solver/solver.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b28371eb68b133f5605d1e7be7ce40151ae2af31cf8d2b93562489ea83ad8eb"}},{"ruleId":"D2","level":"warning","message":{"text":"ide::inlay_hints::param_name::hints (cognitive 28): ide::inlay_hints::param_name::hints has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (18 pts), match/switch 5 (9 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/inlay_hints/param_name.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5f467802bf0f4ab9c6670e34db75237a4e91cf579e416370be0d8d26b1dbc16"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_assists::handlers::extract_expressions_from_format_string::extract_expressions_from_format_string (cognitive 28): ide_assists::handlers::extract_expressions_from_format_string::extract_expressions_from_format_string has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (16 pts), match/switch 4 (9 pts), loops 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/extract_expressions_from_format_string.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"31aaab694e4d8d82a300b9f9b20abc2dcaef13c9b4d818241df5c65a7551ca8e"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_assists::handlers::wrap_return_type::wrap_return_type (cognitive 28): ide_assists::handlers::wrap_return_type::wrap_return_type has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 4 (8 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/wrap_return_type.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0e54b8c10883e0f4c489b80f24881c5e252b9008a3ea7a0f2d2301ff95dab54"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_completion::completions::attribute::complete_attribute_path (cognitive 28): ide_completion::completions::attribute::complete_attribute_path has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (15 pts), match/switch 4 (7 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-completion/src/completions/attribute.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"b12e0529e5e26fa0086f41b3105184ae3886a22bee83ac4a1febf73066d852e2"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_db::imports::merge_imports::version_sort::version_sort (cognitive 28): ide_db::imports::merge_imports::version_sort::version_sort has cognitive complexity 28 (threshold 15). Drivers by points: match/switch 5 (14 pts), if/else 3 (11 pts), boolean chains 2, loops 1 (nesting depth added 17). 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/tools/rust-analyzer/crates/ide-db/src/imports/merge_imports.rs"},"region":{"startLine":978}}}],"partialFingerprints":{"codehealthFindingId/v1":"8204d4fcdd48eb1e9fa7edc78fb5b663043811fa073a98eedd3fa05642f3cf46"}},{"ruleId":"D2","level":"warning","message":{"text":"rustfmt_nightly::sort::version_sort (cognitive 28): rustfmt_nightly::sort::version_sort has cognitive complexity 28 (threshold 15). Drivers by points: match/switch 5 (14 pts), if/else 3 (11 pts), boolean chains 2, loops 1 (nesting depth added 17). 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/tools/rustfmt/src/sort.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d6317bc6f360c0a8a6f1153d33f255cecf53b72dc2558fea2f84cf8b6aa38cb"}},{"ruleId":"D2","level":"warning","message":{"text":"rustfmt_nightly::string::rewrite_string (cognitive 28): rustfmt_nightly::string::rewrite_string has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 2 (4 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/string.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"50a13b40645bfac23fc1374a2b65618ca49c66a7e25041b8e579c8a162773977"}},{"ruleId":"D2","level":"warning","message":{"text":"tidy::x_version::check (cognitive 28): tidy::x_version::check has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (24 pts), loops 1 (2 pts), boolean chains 1, match/switch 1 (nesting depth added 14). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/tidy/src/x_version.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"646ee7ee342236ef7f0bea4ccc795cad02bef617e795a346b295a3932f6d0f35"}},{"ruleId":"D2","level":"warning","message":{"text":"debug.getDebugConfiguration (cognitive 28): debug.getDebugConfiguration has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (19 pts), loops 2 (4 pts), boolean chains 3, ternaries 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/editors/code/src/debug.ts"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"147dad963474b3c51ab300cd31e1b4766474013a3626ad68e63383162ed944ab"}},{"ruleId":"D2","level":"warning","message":{"text":"Local::rewrite_result (cognitive 27): Local::rewrite_result has cognitive complexity 27 (threshold 15). Drivers by points: if/else 16 (24 pts), boolean chains 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/items.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"534cd48426a39d32342221941a790eff5cf95cbe25c5144f3479cc9a500bc185"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_ast::util::comments::beautify_doc_string::get_horizontal_trim (cognitive 27): rustc_ast::util::comments::beautify_doc_string::get_horizontal_trim has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 4 (7 pts), boolean chains 3, match/switch 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (rustc_ast::util::comments::beautify_doc_string) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ast/src/util/comments.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"229950e8b8f34d56c449b8fe51334a8dd47502df42682b2ae6d75174873ee7be"}},{"ruleId":"D2","level":"warning","message":{"text":"LoweringContext::lower_expr_mut (cognitive 27): LoweringContext::lower_expr_mut has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (18 pts), match/switch 5 (8 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":"compiler/rustc_ast_lowering/src/expr.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"de17445dd7c18d0b36c549687ebc7652ebe7a2ecbec5b2abe447e1ee589b33bd"}},{"ruleId":"D2","level":"warning","message":{"text":"LoweringContext::lower_qpath (cognitive 27): LoweringContext::lower_qpath has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (18 pts), match/switch 4 (6 pts), boolean chains 2, loops 1 (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":"compiler/rustc_ast_lowering/src/path.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"003afc4bcd8feb89351f4129f2044eaa59c03ebd32da4c7d1fa6d067e7ad9f02"}},{"ruleId":"D2","level":"warning","message":{"text":"AstValidator::visit_generics (cognitive 27): AstValidator::visit_generics has cognitive complexity 27 (threshold 15). Drivers by points: if/else 3 (12 pts), match/switch 3 (9 pts), loops 3 (6 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ast_passes/src/ast_validation.rs"},"region":{"startLine":1825}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec90cf00c41b5699f123f2043198cc87cc01a0f8f4a035fb5707b39b5a345225"}},{"ruleId":"D2","level":"warning","message":{"text":"MirBorrowckCtxt::point_at_binding_outside_closure (cognitive 27): MirBorrowckCtxt::point_at_binding_outside_closure has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (25 pts), boolean chains 1, loops 1 (nesting depth added 18). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/diagnostics/mutability_errors.rs"},"region":{"startLine":1171}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f54a496d88b5e533f6fa8e38a273fc02df46a370697c259106c3ffe029887c2"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_borrowck::diagnostics::mutability_errors::suggest_ampmut (cognitive 27): rustc_borrowck::diagnostics::mutability_errors::suggest_ampmut has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (20 pts), boolean chains 5, match/switch 1 (2 pts) (nesting depth added 14). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/diagnostics/mutability_errors.rs"},"region":{"startLine":1890}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1f2559af2dd951ef015138fd30c06f8c74859c00edc1d709d4587bc8c4033bb"}},{"ruleId":"D2","level":"warning","message":{"text":"Format::translate (cognitive 27): Format::translate has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (17 pts), match/switch 7 (8 pts), boolean chains 1, loops 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_builtin_macros/src/format_foreign/printf/mod.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec1f4e51741978212aa2cb56b08d4d7917beecdcefe25a09a7d53b4c45fbd2bd"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_builtin_macros::deriving::debug::debug_body (cognitive 27): rustc_builtin_macros::deriving::debug::debug_body has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (18 pts), loops 3 (7 pts), match/switch 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_builtin_macros/src/deriving/debug.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"eba1db8d071824f679c400511f413d03f5cde77bd851e0a04d656230a46568de"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_codegen_cranelift::intrinsics::llvm_aarch64::codegen_aarch64_llvm_intrinsic_call (cognitive 27): rustc_codegen_cranelift::intrinsics::llvm_aarch64::codegen_aarch64_llvm_intrinsic_call has cognitive complexity 27 (threshold 15). Drivers by points: match/switch 8 (15 pts), loops 5 (10 pts), boolean chains 2 (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":"compiler/rustc_codegen_cranelift/src/intrinsics/llvm_aarch64.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bf1da94e8d95cc43c7446b66c5262b400abf599358cc9ae58bd10f10af331bc"}},{"ruleId":"D2","level":"warning","message":{"text":"CodegenCx::codegen_global_asm (cognitive 27): CodegenCx::codegen_global_asm has cognitive complexity 27 (threshold 15). Drivers by points: match/switch 4 (14 pts), if/else 4 (8 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 16). 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":"compiler/rustc_codegen_gcc/src/asm.rs"},"region":{"startLine":945}}}],"partialFingerprints":{"codehealthFindingId/v1":"58a7c0571a739fb7d017da5ac43bca58c4b34f58291dc4db67b8b53e1c3477a4"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_codegen_llvm::abi::get_attrs (cognitive 27): rustc_codegen_llvm::abi::get_attrs has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 3 (5 pts), boolean chains 2, match/switch 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":"compiler/rustc_codegen_llvm/src/abi.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ae96353167be00296939593560ea0175404177503b1c6f8e1be58b549429655"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_codegen_llvm::type_of::uncached_llvm_type (cognitive 27): rustc_codegen_llvm::type_of::uncached_llvm_type has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (17 pts), match/switch 6 (9 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":"compiler/rustc_codegen_llvm/src/type_of.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"483e36a7734ea2b905cd2ac95dda79ccc7cf17372e90918864b5f32937b192df"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_codegen_ssa::back::metadata::elf_e_flags (cognitive 27): rustc_codegen_ssa::back::metadata::elf_e_flags has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 6 (11 pts), boolean chains 2 (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":"compiler/rustc_codegen_ssa/src/back/metadata.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b00c915ace909cc09e3e75adf79b0cb24ea97cf8d53bc47ec27ccd0924d2eaf"}},{"ruleId":"D2","level":"warning","message":{"text":"InterpCx::read_discriminant (cognitive 27): InterpCx::read_discriminant has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (20 pts), match/switch 4 (6 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":"compiler/rustc_const_eval/src/interpret/discriminant.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"b81410a83279f53925edbcd3122b37f53d89c1094710906b3a8b0b4108f1a8d6"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_const_eval::interpret::intern::intern_const_alloc_recursive (cognitive 27): rustc_const_eval::interpret::intern::intern_const_alloc_recursive has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (21 pts), boolean chains 4, loops 1, match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_const_eval/src/interpret/intern.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ed6ee0e9193ebfbe5c3f373d2b4ec51f6c03f335031f3075344d156e26f5aca"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_hir_analysis::collect::dump::vtables (cognitive 27): rustc_hir_analysis::collect::dump::vtables has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (24 pts), match/switch 1 (2 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":"compiler/rustc_hir_analysis/src/collect/dump.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"4afe3b22118444be96422aa8f52ccde1a7e0483c8b60f622bb25373ae4c4c31d"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::try_find_coercion_lub (cognitive 27): FnCtxt::try_find_coercion_lub has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (13 pts), match/switch 5 (9 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/coercion.rs"},"region":{"startLine":1380}}}],"partialFingerprints":{"codehealthFindingId/v1":"7385c2ca370c850ca781e6b7493db7f6a8ee5d3157c7992f4e36540d73725765"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::suggest_calling_boxed_future_when_appropriate (cognitive 27): FnCtxt::suggest_calling_boxed_future_when_appropriate has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (15 pts), match/switch 4 (9 pts), boolean chains 3 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/fn_ctxt/suggestions.rs"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"394be64b8f2f318b32b70e664ab063cbf85777165390600eafc44fd23c90418d"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::suggest_use_shadowed_binding_with_method (cognitive 27): FnCtxt::suggest_use_shadowed_binding_with_method has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 7, match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/method/suggest.rs"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"528f119a997dde3e2c552aba33b47eabd79c8c0e5c045e0fbb98a52dce7b9f24"}},{"ruleId":"D2","level":"warning","message":{"text":"Resolver::report_conflict (cognitive 27): Resolver::report_conflict has cognitive complexity 27 (threshold 15). Drivers by points: match/switch 9 (11 pts), boolean chains 10, if/else 5 (6 pts) (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/diagnostics/impls.rs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"62e39d01d2a381c0bccdeba01b710f19852d4c4c7bd44bbcf91eb54759aa8fd2"}},{"ruleId":"D2","level":"warning","message":{"text":"LintStore::check_lint_name (cognitive 27): LintStore::check_lint_name has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (18 pts), match/switch 4 (8 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_lint/src/context.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a9c774a029139f482eb87f4635e86c4d0a3b6ed6615c560a8636381b2d92950"}},{"ruleId":"D2","level":"warning","message":{"text":"Ty::ty_and_layout_field::field_ty_or_layout (cognitive 27): Ty::ty_and_layout_field::field_ty_or_layout has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (17 pts), match/switch 4 (8 pts), boolean chains 2 (nesting depth added 12). 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":"compiler/rustc_middle/src/ty/layout.rs"},"region":{"startLine":858}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a41af7bcf6076e0a0c2f7c000424ca268ddff50cd51dac4727dee372840baa8"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_middle::ty::print::pretty::for_each_def (cognitive 27): rustc_middle::ty::print::pretty::for_each_def has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 4 (5 pts), match/switch 2 (5 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/ty/print/pretty.rs"},"region":{"startLine":3475}}}],"partialFingerprints":{"codehealthFindingId/v1":"9950152564928055b8cee695759ab1ed22dc48aa102d7e39c38942c0b93f1091"}},{"ruleId":"D2","level":"warning","message":{"text":"TailCallCkVisitor::check_tail_call (cognitive 27): TailCallCkVisitor::check_tail_call has cognitive complexity 27 (threshold 15). Drivers by points: if/else 19 (24 pts), boolean chains 2, loops 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_build/src/check_tail_calls.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1228c50ce1af968afa200ab751f1e221ce97596637b5d03c89d950124aaf38b"}},{"ruleId":"D2","level":"warning","message":{"text":"MatchVisitor::check_match (cognitive 27): MatchVisitor::check_match has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (20 pts), match/switch 2 (4 pts), boolean chains 2, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_build/src/thir/pattern/check_match.rs"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"13a183286693afb2d8cf28d5939922c5051db52ebaaa1bcd721b1ac70bc814d7"}},{"ruleId":"D2","level":"warning","message":{"text":"DerefChecker::visit_place (cognitive 27): DerefChecker::visit_place has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (21 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/deref_separator.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed47108da1ba99154ebc042b21ce462f807eb7107cb14f1d55c02882276094ac"}},{"ruleId":"D2","level":"warning","message":{"text":"UnreachableEnumBranching::run_pass (cognitive 27): UnreachableEnumBranching::run_pass has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (20 pts), loops 3 (5 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/unreachable_enum_branching.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddb0594ecd8d23d07aa5d83e24a4006e9009e7ea4b65d2963856a03de9264fc0"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_mir_transform::inline::resolve_callsite (cognitive 27): rustc_mir_transform::inline::resolve_callsite has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (26 pts), boolean chains 1 (nesting depth added 17). 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":"compiler/rustc_mir_transform/src/inline.rs"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"076fc6b3451095e59c196e049f89bea21a52c0f4206c75b6bc88613190529ff4"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_mir_transform::inline::try_inlining (cognitive 27): rustc_mir_transform::inline::try_inlining has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (20 pts), loops 3 (5 pts), match/switch 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/inline.rs"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"14f585a6c716c1db83ac679ba82382dd814908cfedc2faedf4856ac948f7dea4"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::next (cognitive 27): Parser::next has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (25 pts), match/switch 1 (2 pts) (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse_format/src/lib.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9aa7b4aec38c7229fe37e322602d3584f5f97f63065e235e72ee65c82c8f194"}},{"ruleId":"D2","level":"warning","message":{"text":"MissingStabilityAnnotations::check_compatible_stability (cognitive 27): MissingStabilityAnnotations::check_compatible_stability has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 7, match/switch 1 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_passes/src/stability.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"823f31be00f14e2da60e2670be83215e70fdaccc73d3cbaf449c63d66e2bb419"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_pattern_analysis::rustc::print::write_struct_like (cognitive 27): rustc_pattern_analysis::rustc::print::write_struct_like has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 5, loops 2 (5 pts), match/switch 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":"compiler/rustc_pattern_analysis/src/rustc/print.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"701d81b007b4c84387a6b9f3a604c2e781067185c69f32ef42ffb03b4900ca41"}},{"ruleId":"D2","level":"warning","message":{"text":"DefCollector::process_macro_use_imports (cognitive 27): DefCollector::process_macro_use_imports has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (21 pts), boolean chains 2, loops 1 (2 pts), match/switch 1 (2 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":"compiler/rustc_resolve/src/build_reduced_graph.rs"},"region":{"startLine":1153}}}],"partialFingerprints":{"codehealthFindingId/v1":"89dfa490a8635ad8588ad147f91c0ccc704f98393117254ea9c6c0bc63b98246"}},{"ruleId":"D2","level":"warning","message":{"text":"LateResolutionVisitor::detect_assoc_type_constraint_meant_as_path (cognitive 27): LateResolutionVisitor::detect_assoc_type_constraint_meant_as_path has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/late/diagnostics.rs"},"region":{"startLine":935}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc4a8d93d1848a97d00eb51647f101ba15077c0d3d2af2b14e9e79d0b0f722b5"}},{"ruleId":"D2","level":"warning","message":{"text":"V0SymbolMangler::print_type (cognitive 27): V0SymbolMangler::print_type has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (16 pts), match/switch 5 (7 pts), loops 2 (4 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_symbol_mangling/src/v0.rs"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"790819eddbd142b94db5b1cb1f5604c0257829da70ee79c2b36eb7029a926f98"}},{"ruleId":"D2","level":"warning","message":{"text":"FnAbi::adjust_for_rust_abi (cognitive 27): FnAbi::adjust_for_rust_abi has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 6, match/switch 3 (4 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_target/src/callconv/mod.rs"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dc76cda418a7bcba1537990795e182cafbcafe4b6a7b6ff50189838b07952e9"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeErrCtxt::report_not_const_evaluatable_error (cognitive 27): TypeErrCtxt::report_not_const_evaluatable_error has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (21 pts), boolean chains 3, match/switch 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/error_reporting/traits/fulfillment_errors.rs"},"region":{"startLine":4193}}}],"partialFingerprints":{"codehealthFindingId/v1":"61c85c91ea173cdc372ab65fe9b26101b231e1114274eae90b66a2574d32542e"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_trait_selection::error_reporting::traits::report_dyn_incompatibility (cognitive 27): rustc_trait_selection::error_reporting::traits::report_dyn_incompatibility has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 4 (8 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/error_reporting/traits/mod.rs"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"402f362e7ab5eb8f7c4456c296a99ab03a2f1fa2ee7d19a36265b52ffd307505"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_trait_selection::error_reporting::traits::call_kind::call_kind (cognitive 27): rustc_trait_selection::error_reporting::traits::call_kind::call_kind has cognitive complexity 27 (threshold 15). Drivers by points: if/else 17 (19 pts), boolean chains 7, match/switch 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"compiler/rustc_trait_selection/src/error_reporting/traits/call_kind.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"239754570e97018d6fceb7fe02fac3c80379aa19e790991ed03af326ba758a6a"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_trait_selection::traits::misc::type_allowed_to_implement_const_param_ty (cognitive 27): rustc_trait_selection::traits::misc::type_allowed_to_implement_const_param_ty has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (16 pts), match/switch 2 (6 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/traits/misc.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"f000a112262cb6a1d928141f98093d9a478a8d8421d1da18e61743f2bb9f7f16"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_ty_walk::walk_types (cognitive 27): rustc_ty_walk::walk_types has cognitive complexity 27 (threshold 15). Drivers by points: loops 8 (15 pts), if/else 5 (9 pts), match/switch 2 (3 pts) (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ty_walk/src/lib.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"1037415d95f7c6b3d294f7e292fb396f5340706c89cdea11163e9f94d4f74b32"}},{"ruleId":"D2","level":"warning","message":{"text":"BufWriter::write_vectored (cognitive 27): BufWriter::write_vectored has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (22 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/alloc/src/io/buffered/bufwriter.rs"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc31cd4a59f5fc6a2cfc378f7041a99e1bdaa6e16e1170204b3eba58200aad3d"}},{"ruleId":"D2","level":"warning","message":{"text":"libm::math::atan2::atan2 (cognitive 27): libm::math::atan2::atan2 has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (17 pts), match/switch 4 (7 pts), boolean chains 3 (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":"library/compiler-builtins/libm/src/math/atan2.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"b28331e6869f48cb1557e705a87ecf941abaae247cab26612353f211c71655fa"}},{"ruleId":"D2","level":"warning","message":{"text":"libm::math::atan2f::atan2f (cognitive 27): libm::math::atan2f::atan2f has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (17 pts), match/switch 4 (7 pts), boolean chains 3 (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":"library/compiler-builtins/libm/src/math/atan2f.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbd7ecdd8d4f8997f215003ba47c0d79f9ce5e0caaf0e43190fb488ef5cdf258"}},{"ruleId":"D2","level":"warning","message":{"text":"libm::math::sincosf::sincosf (cognitive 27): libm::math::sincosf::sincosf has cognitive complexity 27 (threshold 15). Drivers by points: if/else 17 (26 pts), match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/compiler-builtins/libm/src/math/sincosf.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"24db2d82b05b21e9d8f2e8595b99a5a13aeca8bd045cd9e25bd8cc26d66491e6"}},{"ruleId":"D2","level":"warning","message":{"text":"core::fmt::num::exp_u128 (cognitive 27): core::fmt::num::exp_u128 has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (16 pts), loops 3 (6 pts), boolean chains 3, match/switch 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 3 other methods here (core::fmt::num::imp::exp_u64, core::fmt::num::imp::exp_u32, core::fmt::num::imp::exp_u64) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/fmt/num.rs"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"37183e4c16211ce9e6177014a0be12138ac2cbce1e55b98d4d861d1333bbd544"}},{"ruleId":"D2","level":"warning","message":{"text":"core::fmt::num::imp::exp_u64 (cognitive 27): core::fmt::num::imp::exp_u64 has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (16 pts), loops 3 (6 pts), boolean chains 3, match/switch 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 3 other methods here (core::fmt::num::imp::exp_u32, core::fmt::num::imp::exp_u64, core::fmt::num::exp_u128) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/fmt/num.rs"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"20086d29efe7dd704d8a5a630213a3017ac208f428466e522443e0614cd945ed"}},{"ruleId":"D2","level":"warning","message":{"text":"core::fmt::num::imp::exp_u32 (cognitive 27): core::fmt::num::imp::exp_u32 has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (16 pts), loops 3 (6 pts), boolean chains 3, match/switch 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 3 other methods here (core::fmt::num::imp::exp_u64, core::fmt::num::imp::exp_u64, core::fmt::num::exp_u128) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/fmt/num.rs"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"a88d3bbf9766b1361ca49046245550bb2df15b0b5b382b2aa81cb165a0284740"}},{"ruleId":"D2","level":"warning","message":{"text":"core::fmt::num::imp::exp_u64 (cognitive 27): core::fmt::num::imp::exp_u64 has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (16 pts), loops 3 (6 pts), boolean chains 3, match/switch 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 3 other methods here (core::fmt::num::imp::exp_u64, core::fmt::num::imp::exp_u32, core::fmt::num::exp_u128) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/fmt/num.rs"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5e78e10fec26f10b82c5edad7dd43c975d506bdf61b1a739e4f6cb87d193d73"}},{"ruleId":"D2","level":"warning","message":{"text":"Channel::start_recv (cognitive 27): Channel::start_recv has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (24 pts), match/switch 1 (2 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":"library/std/src/sync/mpmc/list.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"462ca28bfe8ed550977ea7a9e95026fa7d5acab0f7ad746782bb15c06f95acdc"}},{"ruleId":"D2","level":"warning","message":{"text":"Libunwind::run (cognitive 27): Libunwind::run has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (21 pts), loops 4, boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/build_steps/llvm.rs"},"region":{"startLine":2095}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a6cf917bc531b9bd190343bec44682bf726a96cc81e820ffc789087ff28160c"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolBuild::run (cognitive 27): ToolBuild::run has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (16 pts), match/switch 5 (7 pts), boolean chains 4 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/build_steps/tool.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"25a533a814605de73cdb9be3a0b789ce1847f3a5489b5c5c90c6f0c49530bc82"}},{"ruleId":"D2","level":"warning","message":{"text":"DocTestBuilder::generate_unique_doctest (cognitive 27): DocTestBuilder::generate_unique_doctest has cognitive complexity 27 (threshold 15). Drivers by points: if/else 18 (24 pts), boolean chains 2, 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/librustdoc/doctest/make.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"b80776fd6f713d050f38db8dae46e3b418ebc54631bff71fbb2ce4c3e4e97965"}},{"ruleId":"D2","level":"warning","message":{"text":"TagParser::extract_tags (cognitive 27): TagParser::extract_tags has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (24 pts), boolean chains 2, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/passes/lint/html_tags.rs"},"region":{"startLine":680}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b004c9a6a9e1022221021c0ecb2e390df07c2d1eeecb197e13e8030152e77fe"}},{"ruleId":"D2","level":"warning","message":{"text":"RustdocVisitor::maybe_inline_local (cognitive 27): RustdocVisitor::maybe_inline_local has cognitive complexity 27 (threshold 15). Drivers by points: boolean chains 12, if/else 10 (12 pts), loops 1 (2 pts), match/switch 1 (nesting depth added 3). Of this number, 26 points are the body\u0027s own statements and 1 belongs 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/librustdoc/visit_ast.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"269de0df6da5518eb2ed57f28ed8e56295b070184f138927eb0a56151914e5b5"}},{"ruleId":"D2","level":"warning","message":{"text":"VarVisitor::visit_expr (cognitive 27): VarVisitor::visit_expr has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 8, loops 2 (4 pts), match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/loops/needless_range_loop.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cafe64a0d8701e712cf0af3289b716259718584d739013ee57cff0a15b37df0"}},{"ruleId":"D2","level":"warning","message":{"text":"OffendingFilterExpr::check_map_call (cognitive 27): OffendingFilterExpr::check_map_call has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (12 pts), match/switch 4 (8 pts), boolean chains 7 (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/tools/clippy/clippy_lints/src/methods/filter_map.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2eb37b919b3399fb95a6f9c4b0d4b32e99b8704a306e98499de130ef27009d0"}},{"ruleId":"D2","level":"warning","message":{"text":"WaitFinder::visit_expr (cognitive 27): WaitFinder::visit_expr has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (18 pts), match/switch 3 (7 pts), boolean chains 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/zombie_processes.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fe3aacffe33655539b35ef79e8e168b5cac707ec761fb18dbaade5b9ffe8a73"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::casts::unnecessary_cast::walk_receiver_path_step (cognitive 27): clippy_lints::casts::unnecessary_cast::walk_receiver_path_step has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 7, match/switch 2 (3 pts) (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/casts/unnecessary_cast.rs"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e70610189b637e16bcdab45df3259a531e6ffc1dcac7962ae9caaf753b70a54"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::doc::doc_paragraphs_missing_punctuation::is_missing_punctuation (cognitive 27): clippy_lints::doc::doc_paragraphs_missing_punctuation::is_missing_punctuation has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (20 pts), boolean chains 4, match/switch 1 (2 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":"src/tools/clippy/clippy_lints/src/doc/doc_paragraphs_missing_punctuation.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcb3bfcc259533a465a90dcfd5b932495f303668a99d4c6bd306c2010d2a67dd"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::ifs::branches_sharing_code::scan_block_for_eq (cognitive 27): clippy_lints::ifs::branches_sharing_code::scan_block_for_eq has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (17 pts), loops 3 (5 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/ifs/branches_sharing_code.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"9620dc6a00ba151935aacb60fe87c49fe3d3833ca6acb89344bfbece1e7570a7"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::loops::same_item_push::check (cognitive 27): clippy_lints::loops::same_item_push::check has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 3 (10 pts), boolean chains 3 (nesting depth added 15). Of this number, 24 points are the body\u0027s own statements and 3 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/tools/clippy/clippy_lints/src/loops/same_item_push.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"55da8b902d2caa23a998256ae2f2b0f2080edbe5aabd4c17343b58e7f43780d0"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::methods::option_as_ref_deref::check (cognitive 27): clippy_lints::methods::option_as_ref_deref::check has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 8, match/switch 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/methods/option_as_ref_deref.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bcd3748dfd5fc9eb5684eb6f0970c37332ab6de4a7ecc8f17dec10a81a68c3f"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::methods::unnecessary_iter_cloned::check_for_loop_iter (cognitive 27): clippy_lints::methods::unnecessary_iter_cloned::check_for_loop_iter has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 4, loops 1 (3 pts), match/switch 1 (3 pts) (nesting depth added 11). Of this number, 18 points are the body\u0027s own statements and 9 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/methods/unnecessary_iter_cloned.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"b78d2873fbfd73144f4bcc20f1e89ecd5b5f367b4a5fe17491b571407eb639b1"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::methods::unnecessary_lazy_eval::check (cognitive 27): clippy_lints::methods::unnecessary_lazy_eval::check has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (21 pts), boolean chains 3, match/switch 1 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/methods/unnecessary_lazy_eval.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"241f061b8d175944b0356cf8ca82330078626c5ed5a21d1270e280c21e01a22d"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::operators::manual_div_ceil::check (cognitive 27): clippy_lints::operators::manual_div_ceil::check has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 9, match/switch 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/operators/manual_div_ceil.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"53803347d9bb040b49518560ae52e7a8d6d11471d9e44167c0f7d358d61e1465"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::ptr::ptr_arg::check_ptr_arg_usage (cognitive 27): clippy_lints::ptr::ptr_arg::check_ptr_arg_usage has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (20 pts), boolean chains 5, match/switch 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/ptr/ptr_arg.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"116ed77eafc65771e78ab0cffb4d777e9fe34d78e745978f4c45de39a72eb3fd"}},{"ruleId":"D2","level":"warning","message":{"text":"HirEqInterExpr::eq_block (cognitive 27): HirEqInterExpr::eq_block has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 5, match/switch 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_utils/src/hir_utils.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"7095bafe6a9f0f94d98fedb6d3b9161dd2440f52382b5c60abbdd35d7e8e7a63"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_utils::ast_utils::eq_expr (cognitive 27): clippy_utils::ast_utils::eq_expr has cognitive complexity 27 (threshold 15). Drivers by points: boolean chains 25, if/else 1, match/switch 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_utils/src/ast_utils/mod.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac89cab34132f45b7d4a97d670637170e3b3961ed84f115f41366a8bc6d25138"}},{"ruleId":"D2","level":"warning","message":{"text":"hir_def::attrs::docs::get_horizontal_trim (cognitive 27): hir_def::attrs::docs::get_horizontal_trim has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 4 (7 pts), boolean chains 3, match/switch 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/attrs/docs.rs"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"68c936d2b6d4a4af3ca316252a5ede46f2d3c8f0059ce5ca42a015ecc825f6dc"}},{"ruleId":"D2","level":"warning","message":{"text":"hir_expand::eager::eager_macro_recur (cognitive 27): hir_expand::eager::eager_macro_recur has cognitive complexity 27 (threshold 15). Drivers by points: match/switch 7 (17 pts), if/else 4 (9 pts), loops 1 (nesting depth added 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. 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/tools/rust-analyzer/crates/hir-expand/src/eager.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"5158cf76f9e85a4337be3c23c0e7c13c0dd4ba8381a1dd302587a090e838c023"}},{"ruleId":"D2","level":"warning","message":{"text":"Generalizer::tys (cognitive 27): Generalizer::tys has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (16 pts), match/switch 4 (10 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/relate/generalize.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf108cf3adbea7066124dab55eb3c940079890b01355fb2061a706e954658bbd"}},{"ruleId":"D2","level":"warning","message":{"text":"ide::hover::render::render_memory_layout (cognitive 27): ide::hover::render::render_memory_layout has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (14 pts), match/switch 5 (10 pts), boolean chains 3 (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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/tools/rust-analyzer/crates/ide/src/hover/render.rs"},"region":{"startLine":1165}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0a9cecc9d46680339c24a2adb3fff35d444d7c5d9fb8f3d49c00166c6c17e4d"}},{"ruleId":"D2","level":"warning","message":{"text":"ide::inlay_hints::bind_pat::hints (cognitive 27): ide::inlay_hints::bind_pat::hints has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (19 pts), boolean chains 5, match/switch 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/inlay_hints/bind_pat.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"084f887165bfe0f68fb43f7f858279a9dc59f18dd3b7c3725094e9ef5a88ce93"}},{"ruleId":"D2","level":"warning","message":{"text":"ide::signature_help::signature_help (cognitive 27): ide::signature_help::signature_help has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (23 pts), match/switch 1 (2 pts), boolean chains 1, 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":"src/tools/rust-analyzer/crates/ide/src/signature_help.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"99f410beeffd74f2f5ee88ef536a74c82474911c729c7426d6417680b47ba0f2"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_assists::handlers::extract_function::extract_function (cognitive 27): ide_assists::handlers::extract_function::extract_function has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (21 pts), match/switch 4, boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/extract_function.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ae271c332dd61ecee84d95e04b7992beb76314ae24263150d26363e127116f1"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_assists::handlers::generate_documentation_template::introduction_builder (cognitive 27): ide_assists::handlers::generate_documentation_template::introduction_builder has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (23 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_documentation_template.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ed65c4ce55470db94a4185bd7daef28076a6b5f1f263ef03208e328a21ebb64"}},{"ruleId":"D2","level":"warning","message":{"text":"CompletionRelevance::score (cognitive 27): CompletionRelevance::score has cognitive complexity 27 (threshold 15). Drivers by points: if/else 17 (21 pts), match/switch 4 (6 pts) (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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/tools/rust-analyzer/crates/ide-completion/src/item.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"328da09908b739e0237f939e0b5908dbd16fed2da7f015fc1791955745bc063b"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_completion::completions::pattern::complete_pattern_path (cognitive 27): ide_completion::completions::pattern::complete_pattern_path has cognitive complexity 27 (threshold 15). Drivers by points: match/switch 6 (15 pts), if/else 3 (9 pts), loops 1 (3 pts) (nesting depth added 17). 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/tools/rust-analyzer/crates/ide-completion/src/completions/pattern.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f6c0af23cb9fa573f9c41062480c8686fb5854f13da7df5a2ceaf31c3e8bb74"}},{"ruleId":"D2","level":"warning","message":{"text":"Writer::subtree (cognitive 27): Writer::subtree has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (17 pts), match/switch 3 (9 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":"src/tools/rust-analyzer/crates/proc-macro-api/src/legacy_protocol/msg/flat.rs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee2642bc95a2b52b4e237e18a40e424fa9f3f009bd89f46171f570aaaa4cab08"}},{"ruleId":"D2","level":"warning","message":{"text":"project_model::workspace::project_json_to_crate_graph (cognitive 27): project_model::workspace::project_json_to_crate_graph has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (19 pts), loops 2 (4 pts), boolean chains 2, match/switch 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/project-model/src/workspace.rs"},"region":{"startLine":1107}}}],"partialFingerprints":{"codehealthFindingId/v1":"02f088e807030ec2b4ab7e754a67a52e4620d9843d1701e308d329f179068e0a"}},{"ruleId":"D2","level":"warning","message":{"text":"tt::storage::encode (cognitive 27): tt::storage::encode has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (16 pts), match/switch 3 (7 pts), boolean chains 4 (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/tt/src/storage.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cb9777a42bb390c1bc26eeb6fe7712badcb957983cfa9c73f6f8c4c2ec8cda3"}},{"ruleId":"D2","level":"warning","message":{"text":"rustfmt_nightly::bin::main::format (cognitive 27): rustfmt_nightly::bin::main::format has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (23 pts), boolean chains 3, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/bin/main.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eb72c0c5b7194ac7828990607cf07088e01ee55de6c032e3f2a7ee3b04b06f9"}},{"ruleId":"D2","level":"warning","message":{"text":"rustfmt_nightly::comment::combine_strs_with_missing_comments (cognitive 27): rustfmt_nightly::comment::combine_strs_with_missing_comments has cognitive complexity 27 (threshold 15). Drivers by points: if/else 16 (19 pts), boolean chains 8 (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/tools/rustfmt/src/comment.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8cc61c1fd81128319c176a65c977bcba79352503e15083214b7a1f766186cfc"}},{"ruleId":"D2","level":"warning","message":{"text":"configure.parse_example_config (cognitive 27): configure.parse_example_config has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (20 pts), loops 3 (4 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/configure.py"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e0cd9f5bf1e6cc57d82347d206a5346dbaf3791454164e9db062980fe655d0f"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_abi::layout::coroutine::coroutine_saved_local_eligibility (cognitive 26): rustc_abi::layout::coroutine::coroutine_saved_local_eligibility has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 7 (10 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":"compiler/rustc_abi/src/layout/coroutine.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6af47cce6a0c5c7ebbfbfdbb14d23b92a7952e1cb339eab2962f50738abd38c"}},{"ruleId":"D2","level":"warning","message":{"text":"LoweringContext::lower_variant_data (cognitive 26): LoweringContext::lower_variant_data has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (20 pts), loops 2 (5 pts), match/switch 1 (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":"compiler/rustc_ast_lowering/src/item.rs"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"4976fcf576e861ff9acac6bff7d3d0584ccb108c4aeb3b76e3e0fd31d922fe6c"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_ast_pretty::pprust::state::gather_comments (cognitive 26): rustc_ast_pretty::pprust::state::gather_comments has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (15 pts), match/switch 2 (6 pts), loops 2 (5 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ast_pretty/src/pprust/state.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"0023e4ddd62751fc16702009b900619fc166c536a63c5e91f05bca077c794324"}},{"ruleId":"D2","level":"warning","message":{"text":"PatchableFunctionEntryParser::convert (cognitive 26): PatchableFunctionEntryParser::convert has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (23 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_attr_parsing/src/attributes/codegen_attrs.rs"},"region":{"startLine":860}}}],"partialFingerprints":{"codehealthFindingId/v1":"5704bf0c9d77a34e9355502f8adcc4f8d2c5b9e8fe6b90ff79c2b940213d23b1"}},{"ruleId":"D2","level":"warning","message":{"text":"FindOpaqueRegion::visit_ty (cognitive 26): FindOpaqueRegion::visit_ty has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (18 pts), loops 2 (6 pts), boolean chains 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/diagnostics/opaque_types.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a03f4b094166869c765fc3bd81a98364c31c199bb6ab680ede26c794c559d92"}},{"ruleId":"D2","level":"warning","message":{"text":"MirBorrowckCtxt::append_binding_error (cognitive 26): MirBorrowckCtxt::append_binding_error has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 2 (4 pts), boolean chains 2, match/switch 1 (nesting depth added 14). 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":"compiler/rustc_borrowck/src/diagnostics/move_errors.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"e87496d9d0f859fb6f38791dd0fb1466149c81c4bb0f66127678f45b551e25d3"}},{"ruleId":"D2","level":"warning","message":{"text":"RegionInferenceContextInner::find_constraint_path_between_regions_inner (cognitive 26): RegionInferenceContextInner::find_constraint_path_between_regions_inner has cognitive complexity 26 (threshold 15). Drivers by points: loops 4 (10 pts), match/switch 2 (8 pts), if/else 4 (7 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/region_infer/region_context.rs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2676923f54d3b27c7856f0965d7ad8c4f824f166eb41ed31caf828f8c0777da"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeChecker::add_generic_reborrow_constraint (cognitive 26): TypeChecker::add_generic_reborrow_constraint has cognitive complexity 26 (threshold 15). Drivers by points: if/else 14 (21 pts), loops 2 (5 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/type_check/mod.rs"},"region":{"startLine":2484}}}],"partialFingerprints":{"codehealthFindingId/v1":"765d1e66fe980a7e6fa69aef4d6a342f20873ac7214b6ce038905576282dae63"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_builtin_macros::format::report_redundant_format_arguments (cognitive 26): rustc_builtin_macros::format::report_redundant_format_arguments has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (20 pts), loops 3 (6 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_builtin_macros/src/format.rs"},"region":{"startLine":912}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc5eb0bf3127873d5d7ceaaa300670938d84f07dad2691e5d787e3d80d8cfb96"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_codegen_cranelift::value_and_place::assert_assignable (cognitive 26): rustc_codegen_cranelift::value_and_place::assert_assignable has cognitive complexity 26 (threshold 15). Drivers by points: loops 7 (14 pts), match/switch 7 (11 pts), if/else 1 (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/src/value_and_place.rs"},"region":{"startLine":844}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4a8ba1b742c5a24db2001608785454da6f371dfede17d020f30dce67f6bca3e"}},{"ruleId":"D2","level":"warning","message":{"text":"GccCodegenBackend::init (cognitive 26): GccCodegenBackend::init has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 4 (12 pts) (nesting depth added 14). Of this number, 25 points are the body\u0027s own statements and 1 belongs 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":"compiler/rustc_codegen_gcc/src/lib.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"369b5fd4509d53aabbda1ce303e6abe7bc89b9e1b553a4367583dbd93663cd28"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_codegen_gcc::asm::modifier_to_gcc (cognitive 26): rustc_codegen_gcc::asm::modifier_to_gcc has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (19 pts), match/switch 4 (7 pts) (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_gcc/src/asm.rs"},"region":{"startLine":1065}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d70cb102f2a6aa35c39ce642dc9174b7d7631f8fcc14f94854f52e24dcb32f9"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_codegen_ssa::back::symbol_edit::macho_edit_impl (cognitive 26): rustc_codegen_ssa::back::symbol_edit::macho_edit_impl has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (21 pts), loops 3, boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/back/symbol_edit.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"e124f85fe3f6bb3a63640dc8e04272d374f2d394719cbcca26520122e59c9162"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_hir_analysis::check::entry::check_main_fn_ty (cognitive 26): rustc_hir_analysis::check::entry::check_main_fn_ty has cognitive complexity 26 (threshold 15). Drivers by points: if/else 17 (21 pts), match/switch 3, boolean chains 2 (nesting depth added 4). Of this number, 15 points are the body\u0027s own statements and 11 belong to 5 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/check/entry.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff0faab8491ad4677c32c6e20500cf36ec6f4a3a145c374ac297340d9db121c7"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_hir_analysis::check::wfcheck::check_method_receiver (cognitive 26): rustc_hir_analysis::check::wfcheck::check_method_receiver has cognitive complexity 26 (threshold 15). Drivers by points: match/switch 4 (15 pts), if/else 7 (11 pts) (nesting depth added 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. 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":"compiler/rustc_hir_analysis/src/check/wfcheck.rs"},"region":{"startLine":1753}}}],"partialFingerprints":{"codehealthFindingId/v1":"db570bbd4a19fd3643b0be4df44e5f3b9c466611116a42ac15125cd4d9b661fe"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::suggest_method_not_found_because_of_unsatisfied_bounds (cognitive 26): FnCtxt::suggest_method_not_found_because_of_unsatisfied_bounds has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (16 pts), match/switch 3 (5 pts), boolean chains 3, loops 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/method/suggest.rs"},"region":{"startLine":1132}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9374f7935bb9f0fdcf82a01aa121cf2a07bd6a7e340386f9fc21c1e6511bdff"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::note_unmet_impls_on_type (cognitive 26): FnCtxt::note_unmet_impls_on_type has cognitive complexity 26 (threshold 15). Drivers by points: if/else 14 (19 pts), match/switch 3 (4 pts), loops 2, 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":"compiler/rustc_hir_typeck/src/method/suggest.rs"},"region":{"startLine":3463}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4d3bcdfe1f6da47b2a8763473bad15c10d42453509fe629aa48f2e443b6136e"}},{"ruleId":"D2","level":"warning","message":{"text":"ProbeContext::pick_all_method (cognitive 26): ProbeContext::pick_all_method has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (21 pts), loops 1 (4 pts), boolean chains 1 (nesting depth added 16). 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":"compiler/rustc_hir_typeck/src/method/probe.rs"},"region":{"startLine":1326}}}],"partialFingerprints":{"codehealthFindingId/v1":"947fabe88ee0e71c6fb112ddc66ce71a34e7ebdacba23137e706f9b55c74d7f6"}},{"ruleId":"D2","level":"warning","message":{"text":"Newtype::parse (cognitive 26): Newtype::parse has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (22 pts), match/switch 2 (3 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_index_macros/src/newtype.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8e3a2b2bba013c46173928d58ede87b99526c8ea5d7457ce25f970e1107e45c"}},{"ruleId":"D2","level":"warning","message":{"text":"Generalizer::tys (cognitive 26): Generalizer::tys has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (17 pts), match/switch 3 (8 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_infer/src/infer/relate/generalize.rs"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6425bb649d76272bc582e06074504f019020e442db2ccd0660042a23903f37d"}},{"ruleId":"D2","level":"warning","message":{"text":"Cursor::advance_token (cognitive 26): Cursor::advance_token has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 4 (7 pts), boolean chains 4, loops 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_lexer/src/lib.rs"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"4828b956afce3a45dfb4cf3cac4cad12b0abf5bf7b937ae68faa54a4f5eac776"}},{"ruleId":"D2","level":"warning","message":{"text":"PanicMessageNotLiteral::into_diag (cognitive 26): PanicMessageNotLiteral::into_diag has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (21 pts), boolean chains 5 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_lint/src/non_fmt_panic.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"395587919952995a3c826f5bd79964e947625e4591b36017b4c150660a8b3829"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_middle::thir::visit::walk_expr (cognitive 26): rustc_middle::thir::visit::walk_expr has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 5 (10 pts), match/switch 2 (4 pts) (nesting depth added 14). 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":"compiler/rustc_middle/src/thir/visit.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"dffc4e16422760c2371daa7339c1fef60df6b12f708abbd40c871dd5c2956fbb"}},{"ruleId":"D2","level":"warning","message":{"text":"Builder::as_rvalue (cognitive 26): Builder::as_rvalue has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 4 (8 pts), boolean chains 2, loops 1 (2 pts) (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":"compiler/rustc_mir_build/src/builder/expr/as_rvalue.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0e6c5e2270442075dee22a7afd5eda63c3c4157c65d2557aea7aa18f197bfe5"}},{"ruleId":"D2","level":"warning","message":{"text":"ThirPrinter::print_pat_kind (cognitive 26): ThirPrinter::print_pat_kind has cognitive complexity 26 (threshold 15). Drivers by points: loops 7 (15 pts), if/else 6 (10 pts), match/switch 1 (nesting depth added 12). 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":"compiler/rustc_mir_build/src/thir/print.rs"},"region":{"startLine":729}}}],"partialFingerprints":{"codehealthFindingId/v1":"a33f93c7190397d39c386401999cd40d2c09d79ef50c7cf5f6bcc31199d186c4"}},{"ruleId":"D2","level":"warning","message":{"text":"DropsReachable::visit (cognitive 26): DropsReachable::visit has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 4, match/switch 2 (3 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/lint_tail_expr_drop_order.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f79a8cbbe7fb91c015c387ef445349789940c30d70a2f070c074676896a9ef3"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeChecker::visit_statement (cognitive 26): TypeChecker::visit_statement has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (24 pts), boolean chains 1, match/switch 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":"compiler/rustc_mir_transform/src/validate.rs"},"region":{"startLine":1482}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1d65c044f4b0e42a3fe3cc042f6a23d9cc66d2bea524e4efd501a0056cf758a"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_mir_transform::coroutine::layout::check_must_not_suspend_ty (cognitive 26): rustc_mir_transform::coroutine::layout::check_must_not_suspend_ty has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (18 pts), loops 3 (6 pts), boolean chains 1, match/switch 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/coroutine/layout.rs"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e0366b51f6041d630f39ffffe293cdc901c1225b966d073e7c769f3f9c551ff"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_monomorphize::partitioning::mono_item_visibility (cognitive 26): rustc_monomorphize::partitioning::mono_item_visibility has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 5, match/switch 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_monomorphize/src/partitioning.rs"},"region":{"startLine":803}}}],"partialFingerprints":{"codehealthFindingId/v1":"494a32af2a0ca58d6f8437e6abed33838542ede641d293e8cf7841ed1c33cbd3"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_parse::lexer::diagnostics::report_suspicious_mismatch_block (cognitive 26): rustc_parse::lexer::diagnostics::report_suspicious_mismatch_block has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 4 (8 pts), boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/lexer/diagnostics.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"233b3cb243e661c86cdb435996bc6a11d4c5e09863e65aad30822dcfbe51b308"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_outer_attributes (cognitive 26): Parser::parse_outer_attributes has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (21 pts), match/switch 1 (4 pts), loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/attr.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f2c3a8de0c20d6645fdc082249389c14177b52a3000c6ee2639efc4517b2ae3"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::expected_ident_found (cognitive 26): Parser::expected_ident_found has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 6, match/switch 1 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/diagnostics.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1abec059522d0928a1aa3480374137ebc190b0b841032bddafc0bd712dee122"}},{"ruleId":"D2","level":"warning","message":{"text":"MarkSymbolVisitor::visit_node (cognitive 26): MarkSymbolVisitor::visit_node has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 3 (6 pts), loops 1 (3 pts), boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_passes/src/dead.rs"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cd2487f2a3a99fd163305f68ac06049e618a173a23cafb1f3d17cbb43a89ce8"}},{"ruleId":"D2","level":"warning","message":{"text":"LateResolutionVisitor::resolve_expr (cognitive 26): LateResolutionVisitor::resolve_expr has cognitive complexity 26 (threshold 15). Drivers by points: loops 5 (11 pts), if/else 5 (10 pts), match/switch 3 (5 pts) (nesting depth added 13). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/late.rs"},"region":{"startLine":5512}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0c74e4a6c96dfacbed620d38793734d24035f48abe5227ff091c66582913f71"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_sanitizers::cfi::typeid::itanium_cxx_abi::encode::encode_ty (cognitive 26): rustc_sanitizers::cfi::typeid::itanium_cxx_abi::encode::encode_ty has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 4 (8 pts), boolean chains 2, loops 1 (2 pts) (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":"compiler/rustc_sanitizers/src/cfi/typeid/itanium_cxx_abi/encode.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"d09a7cfee6d9bfca291e0161cfa762f54124afd8bc041a767d5e039a97b9cee8"}},{"ruleId":"D2","level":"warning","message":{"text":"V0SymbolMangler::print_const (cognitive 26): V0SymbolMangler::print_const has cognitive complexity 26 (threshold 15). Drivers by points: match/switch 6 (10 pts), loops 4 (9 pts), if/else 4 (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":"compiler/rustc_symbol_mangling/src/v0.rs"},"region":{"startLine":771}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdc2971c176c7adef425068885808a81e912570409e7b2319ad0b2caf549c13e"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_target::callconv::x86_win32::compute_abi_info (cognitive 26): rustc_target::callconv::x86_win32::compute_abi_info has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 4, match/switch 1 (4 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_target/src/callconv/x86_win32.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"0672d7d61c8a28fb8010192f4ded9f344074186889dfb361ce1472c73ca6d09d"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeErrCtxt::report_concrete_failure (cognitive 26): TypeErrCtxt::report_concrete_failure has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 3 (5 pts), boolean chains 4, loops 1 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/error_reporting/infer/region.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0d58bf8ee1e9d92dc0d986ff3c49955ba438c16a0ab9c21aa0e4a60ad0ad1cf"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeErrCtxt::should_suggest_as_ref_kind (cognitive 26): TypeErrCtxt::should_suggest_as_ref_kind has cognitive complexity 26 (threshold 15). Drivers by points: match/switch 2 (11 pts), if/else 4 (10 pts), loops 1 (4 pts), boolean chains 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/error_reporting/infer/suggest.rs"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"c91376279e7d794f1a324f852088441ee5b8ba177bc66e43ee5f4f56437cb3d7"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_ty_utils::abi::fn_sig_for_fn_abi (cognitive 26): rustc_ty_utils::abi::fn_sig_for_fn_abi has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (21 pts), match/switch 3 (5 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ty_utils/src/abi.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"822a17346c319991ae19c9c8c73d029b17c512c53fae9ddd86e2f0b0bd43a28a"}},{"ruleId":"D2","level":"warning","message":{"text":"core::fmt::write (cognitive 26): core::fmt::write has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (25 pts), loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/fmt/mod.rs"},"region":{"startLine":1630}}}],"partialFingerprints":{"codehealthFindingId/v1":"25d33d74042948809d6c67e54a21530782b5feb286157e8f2d403905466380f7"}},{"ruleId":"D2","level":"warning","message":{"text":"core::num::imp::flt2dec::strategy::grisu::format_exact_opt (cognitive 26): core::num::imp::flt2dec::strategy::grisu::format_exact_opt has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 5, loops 2 (nesting depth added 6). Of this number, 14 points are the body\u0027s own statements and 12 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":"library/core/src/num/imp/flt2dec/strategy/grisu.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"171a5a7534d5c585851732af570184900992f059b6ea57c4c5f5477f834c7834"}},{"ruleId":"D2","level":"warning","message":{"text":"Command::spawn (cognitive 26): Command::spawn has cognitive complexity 26 (threshold 15). Drivers by points: match/switch 8 (15 pts), if/else 11 (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":"library/std/src/sys/process/unix/vxworks.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"114d148f9a85f4d68487af2c1a73eef1dd6065ab1b3fb19d4b4f33e50335d1b1"}},{"ruleId":"D2","level":"warning","message":{"text":"std::sys::personality::dwarf::eh::find_eh_action (cognitive 26): std::sys::personality::dwarf::eh::find_eh_action has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (20 pts), loops 2 (4 pts), match/switch 1 (2 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":"library/std/src/sys/personality/dwarf/eh.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"da5a1b47e291acb3ccde3b8d4bd9aea39ab60580c887d7a701f30746ac9f4ba3"}},{"ruleId":"D2","level":"warning","message":{"text":"stdarch_gen_hexagon::hvx::generate_extern_block (cognitive 26): stdarch_gen_hexagon::hvx::generate_extern_block has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (19 pts), loops 5 (6 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":"library/stdarch/crates/stdarch-gen-hexagon/src/hvx.rs"},"region":{"startLine":1201}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7c24d915c56167571e03a9fd199add3bf63a963100fbe86be14a5cdc21b1a01"}},{"ruleId":"D2","level":"warning","message":{"text":"bootstrap::core::build_steps::dist::maybe_install_llvm (cognitive 26): bootstrap::core::build_steps::dist::maybe_install_llvm has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (19 pts), match/switch 1 (4 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/build_steps/dist.rs"},"region":{"startLine":2508}}}],"partialFingerprints":{"codehealthFindingId/v1":"860ffefd6302ea23b4f60d6e6a55cf0823158561f69b2f03334141c0aeb873b7"}},{"ruleId":"D2","level":"warning","message":{"text":"IndexItemFunctionType::write_to_string_without_param_names (cognitive 26): IndexItemFunctionType::write_to_string_without_param_names has cognitive complexity 26 (threshold 15). Drivers by points: loops 4 (12 pts), if/else 4 (6 pts), boolean chains 4, match/switch 2 (4 pts) (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/render/mod.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"757881e86a5c4539fc4011fc0fdb002ec6f3acfd13006b525d8a561eb473a7db"}},{"ruleId":"D2","level":"warning","message":{"text":"ImplStripper::fold_item (cognitive 26): ImplStripper::fold_item has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 6, loops 1 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/passes/stripper.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"991724628cd147f061a98fea9bf06c420da59f488d9a0b403e28c28d073cd33d"}},{"ruleId":"D2","level":"warning","message":{"text":"rustdoc::doctest::run_tests (cognitive 26): rustdoc::doctest::run_tests has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (20 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/doctest.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"928df2fee7009c34bf68de93815468df733cf2c7c02eddfbfa85e54dda71b655"}},{"ruleId":"D2","level":"warning","message":{"text":"rustdoc::passes::lint::bare_urls::find_raw_urls (cognitive 26): rustdoc::passes::lint::bare_urls::find_raw_urls has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 3 (6 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/librustdoc/passes/lint/bare_urls.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"62906170e21ea9431751e8ff0c3b647fb4ac2c0be5264b56320872c7b7509ab6"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_config::conf::load_conf_file (cognitive 26): clippy_config::conf::load_conf_file has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (17 pts), match/switch 2 (6 pts), loops 2 (3 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_config/src/conf.rs"},"region":{"startLine":889}}}],"partialFingerprints":{"codehealthFindingId/v1":"845e44d41868537a81a3edd0be44e910300eb1fd1a5b46f35ae931ba16769e8c"}},{"ruleId":"D2","level":"warning","message":{"text":"NeedlessLateInit::check_block_post (cognitive 26): NeedlessLateInit::check_block_post has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 3 (8 pts), boolean chains 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/needless_late_init.rs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bfe0b1500191681bef9ea8a108c22669b60fad8f2f436d8c9c960bd61409634"}},{"ruleId":"D2","level":"warning","message":{"text":"QuestionMark::check_manual_let_else (cognitive 26): QuestionMark::check_manual_let_else has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 5, match/switch 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/manual_let_else.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"91a9b614fb85b2eb3ec089f3965ed9bb56d02c15ce16e084061713a356804e6c"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::matches::match_bool::check (cognitive 26): clippy_lints::matches::match_bool::check has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (18 pts), match/switch 2 (7 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/tools/clippy/clippy_lints/src/matches/match_bool.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d1fc5f469bc3fbe0c76a3f7a27ba3177f5336e05e6d7f10e3885be83b64a205"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::methods::map_identity::check (cognitive 26): clippy_lints::methods::map_identity::check has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (21 pts), boolean chains 5 (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/tools/clippy/clippy_lints/src/methods/map_identity.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"642fc0fdc665f2040c65b1401d9c943d07d7e993a5a151a73f1ee7bdd2acd5db"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::ptr::ptr_arg::check_fn_args (cognitive 26): clippy_lints::ptr::ptr_arg::check_fn_args has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (12 pts), match/switch 3 (10 pts), boolean chains 4 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/ptr/ptr_arg.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0dbee419cc6bf95107ec1f842efac349086de66fadbbdf0116e0a81b70445b1"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::time_subtraction::const_eval_duration (cognitive 26): clippy_lints::time_subtraction::const_eval_duration has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (23 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/time_subtraction.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"17b04d97ba2abe36799c0c9adf08107e32f3e5605650a9fd4467ac20c1b563c8"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_utils::is_default_equivalent_call (cognitive 26): clippy_utils::is_default_equivalent_call has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (14 pts), boolean chains 8, match/switch 1 (3 pts), loops 1 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_utils/src/lib.rs"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"efff66c8eb46164b1e0082e619f094b7a56758676e1067b478e983195daa741c"}},{"ruleId":"D2","level":"warning","message":{"text":"TestCx::run_debuginfo_gdb_test (cognitive 26): TestCx::run_debuginfo_gdb_test has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (17 pts), loops 3 (6 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/compiletest/src/runtest/debuginfo.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7c7398c805cc4a2b294f461062579cb3150345ecebc9380674c1237603f174f"}},{"ruleId":"D2","level":"warning","message":{"text":"TestCx::load_compare_outputs (cognitive 26): TestCx::load_compare_outputs has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (23 pts), match/switch 3 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/compiletest/src/runtest.rs"},"region":{"startLine":2478}}}],"partialFingerprints":{"codehealthFindingId/v1":"022eb94cf8fcf6496b75eb30a4a7506cba46c43e4737ab92bf8372119a610d0b"}},{"ruleId":"D2","level":"warning","message":{"text":"compiletest::directives::ignore_lldb (cognitive 26): compiletest::directives::ignore_lldb has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (24 pts), match/switch 1 (2 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/compiletest/src/directives.rs"},"region":{"startLine":1119}}}],"partialFingerprints":{"codehealthFindingId/v1":"4542d40ffc3237330c6a7fba6c58e6e736e0c925e9f3916ffa7447b2b4916a2f"}},{"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/tools/miri/src/borrow_tracker/stacked_borrows/mod.rs"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"4838770b438c0939a2790e0236a270153a36a670952afa51847d31de457c51f4"}},{"ruleId":"D2","level":"warning","message":{"text":"InferenceContext::resolve_value_path_inner (cognitive 26): InferenceContext::resolve_value_path_inner has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (13 pts), match/switch 4 (13 pts) (nesting depth added 14). Of this number, 25 points are the body\u0027s own statements and 1 belongs 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/tools/rust-analyzer/crates/hir-ty/src/infer/path.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ef10ada7aa3878897739a97405dc2838f817767f987a38e16c3f1db71a9eefb"}},{"ruleId":"D2","level":"warning","message":{"text":"InferenceContext::resolve_all (cognitive 26): InferenceContext::resolve_all has cognitive complexity 26 (threshold 15). Drivers by points: loops 15 (25 pts), if/else 1 (nesting depth added 10). 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/tools/rust-analyzer/crates/hir-ty/src/infer.rs"},"region":{"startLine":1644}}}],"partialFingerprints":{"codehealthFindingId/v1":"b08b9a51d39c2a7cb3a32c27025ed257ef82ce1eed9a1880b88383a1d394e1ab"}},{"ruleId":"D2","level":"warning","message":{"text":"MirBody::walk_places (cognitive 26): MirBody::walk_places has cognitive complexity 26 (threshold 15). Drivers by points: match/switch 6 (18 pts), loops 3 (8 pts) (nesting depth added 17). Of this number, 25 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. 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/tools/rust-analyzer/crates/hir-ty/src/mir.rs"},"region":{"startLine":1033}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a6f93da30de6b439da1d31797ab4e5bc1f7bb4f09674a450d31a32051077cd5"}},{"ruleId":"D2","level":"warning","message":{"text":"ide::goto_definition::goto_definition (cognitive 26): ide::goto_definition::goto_definition has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 3, match/switch 2 (3 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/goto_definition.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"37a7f533d9367e98185d22f2c64232a5091b1d1bd767ed59d933fc709ef17081"}},{"ruleId":"D2","level":"warning","message":{"text":"ide::highlight_related::highlight_branch_exit_points (cognitive 26): ide::highlight_related::highlight_branch_exit_points has cognitive complexity 26 (threshold 15). Drivers by points: loops 5 (12 pts), if/else 4 (9 pts), match/switch 2 (5 pts) (nesting depth added 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/highlight_related.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7ba02d98e4d488de27e83fa44487914389bf0d46f16706d2bb97043f2bb4b28"}},{"ruleId":"D2","level":"warning","message":{"text":"NameRefClass::classify (cognitive 26): NameRefClass::classify has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 6 (11 pts), boolean chains 3 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-db/src/defs.rs"},"region":{"startLine":745}}}],"partialFingerprints":{"codehealthFindingId/v1":"956998c20dc45a9b843b208bf610a1aa530ea22823bc19fd4fe481d06836e83d"}},{"ruleId":"D2","level":"warning","message":{"text":"ImportScope::find_insert_use_container (cognitive 26): ImportScope::find_insert_use_container has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (24 pts), boolean chains 1, loops 1 (nesting depth added 16). 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/tools/rust-analyzer/crates/ide-db/src/imports/insert_use.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"a008827023d6e9dfa6e4580bcc2312fcc308365bfb0c2404b8cb74aa15245e0b"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_diagnostics::semantic_diagnostics (cognitive 26): ide_diagnostics::semantic_diagnostics has cognitive complexity 26 (threshold 15). Drivers by points: match/switch 8 (18 pts), if/else 3 (4 pts), boolean chains 2, loops 2 (nesting depth added 11). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-diagnostics/src/lib.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"1702802710e82bda398ed7ee5ab6b750d551f488e8eed98b22ee499fb2abd4b9"}},{"ruleId":"D2","level":"warning","message":{"text":"ErasedFileAstId::kind_typed (cognitive 26): ErasedFileAstId::kind_typed has cognitive complexity 26 (threshold 15). Drivers by points: if/else 24, match/switch 1 (2 pts) (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/span/src/ast_id.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"2061276d20c1ffc64eb69485050791068410026db0082419e735b55ddc17f337"}},{"ruleId":"D2","level":"warning","message":{"text":"SyntaxEditor::add_generic_param (cognitive 26): SyntaxEditor::add_generic_param has cognitive complexity 26 (threshold 15). Drivers by points: if/else 14 (25 pts), match/switch 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/tools/rust-analyzer/crates/syntax/src/syntax_editor/edits.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"3901db7b80425dc305c69425c167e07d89a7d8ac4aec81c5eecc1054f0ce9f1d"}},{"ruleId":"D2","level":"warning","message":{"text":"syntax::validation::validate_literal (cognitive 26): syntax::validation::validate_literal has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (20 pts), boolean chains 5, match/switch 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/tools/rust-analyzer/crates/syntax/src/validation.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"187b9fb08dd4d8b063dea26617ab5553a9b2c175c4204f6fa7615937bfc80b0b"}},{"ruleId":"D2","level":"warning","message":{"text":"search.initSearch::createQueryElement (cognitive 26): search.initSearch::createQueryElement has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 6, 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. This shape REPEATS in the file: 15 other methods here (search.initSearch, search.initSearch::getItemsBefore, search.initSearch::getNextElem, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 16 times rather than 16 independent problems. Splitting this body alone leaves the other 15 exactly as they are. Where these are variations on one operation, the change that clears all 16 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":810}}}],"partialFingerprints":{"codehealthFindingId/v1":"f36286de8dab0c585d8d3e162392356f85853905074d03827b07d37c1ca2bc3e"}},{"ruleId":"D2","level":"warning","message":{"text":"tester.runSearch (cognitive 26): tester.runSearch has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 5, loops 2 (3 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/tools/rustdoc-js/tester.js"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee3b177cb2cea54500ae0cd692b272882a527006f53902d0298648ea5f3c4c63"}},{"ruleId":"D2","level":"warning","message":{"text":"loadSearchJS.doSearch (cognitive 26): loadSearchJS.doSearch has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (18 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 15). Of this number, 21 points are the body\u0027s own statements and 5 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustdoc-js/tester.js"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"7006ea856f26e50b2bc3422dd73936173a542f8115bc24cdafe3de89ab9342f7"}},{"ruleId":"D2","level":"warning","message":{"text":"State::print_use_tree (cognitive 25): State::print_use_tree has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (20 pts), loops 1 (3 pts), boolean chains 1, match/switch 1 (nesting depth added 13). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ast_pretty/src/pprust/state/item.rs"},"region":{"startLine":890}}}],"partialFingerprints":{"codehealthFindingId/v1":"b00d5361e3aa91bffc99ebbd7bcd1bf7b2ca95afc83a652ea40168a2febc4f44"}},{"ruleId":"D2","level":"warning","message":{"text":"GatherBorrows::visit_assign (cognitive 25): GatherBorrows::visit_assign has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (23 pts), loops 1 (2 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":"compiler/rustc_borrowck/src/borrow_set.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"19b717bc129fd9845357bfe817bf9fe6908046282494766296c36c439c666189"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_builtin_macros::format::parse_args (cognitive 25): rustc_builtin_macros::format::parse_args has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (18 pts), match/switch 3 (6 pts), loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_builtin_macros/src/format.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c92399ddcbcce4d457ef8895823508668999aa2462a44f932b503c55dcdbf6c"}},{"ruleId":"D2","level":"warning","message":{"text":"Builder::count_zeroes_nonzero (cognitive 25): Builder::count_zeroes_nonzero has cognitive complexity 25 (threshold 15). Drivers by points: if/else 19 (24 pts), boolean chains 1 (nesting depth added 5). Of this number, 23 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_gcc/src/intrinsic/mod.rs"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"59a6a4c83add89f96eba805fe2b8af364abd74466becc75ca72da2035ec74a16"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_codegen_gcc::gcc_util::new_context (cognitive 25): rustc_codegen_gcc::gcc_util::new_context has cognitive complexity 25 (threshold 15). Drivers by points: if/else 17 (18 pts), match/switch 4 (5 pts), boolean chains 1, loops 1 (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":"compiler/rustc_codegen_gcc/src/gcc_util.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcf1672eeac661b8f6e9b8c8dab08e29c2d6b8b5dbaeb2dc60869c6d795012a8"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionCx::clear_variant_dependent_padding (cognitive 25): FunctionCx::clear_variant_dependent_padding has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 5 (9 pts), boolean chains 1, match/switch 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/mir/block.rs"},"region":{"startLine":1840}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a862156c9f693278b057c2980d89894c15f9f0dd53e0d607e38125ded0d04f6"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_codegen_ssa::back::link::add_order_independent_options (cognitive 25): rustc_codegen_ssa::back::link::add_order_independent_options has cognitive complexity 25 (threshold 15). Drivers by points: if/else 17 (20 pts), boolean chains 5 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"compiler/rustc_codegen_ssa/src/back/link.rs"},"region":{"startLine":3247}}}],"partialFingerprints":{"codehealthFindingId/v1":"84760f9bc8254f61f990f42171c61b66196a5b8d9d8892b006f288a6996191e2"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_codegen_ssa::back::symbol_export::upstream_monomorphizations_provider (cognitive 25): rustc_codegen_ssa::back::symbol_export::upstream_monomorphizations_provider has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (16 pts), match/switch 2 (6 pts), loops 2 (3 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/back/symbol_export.rs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"26fce775710fd9c9e39c33c8605d65ee9320b49ae0ef840144323d6d826cc69f"}},{"ruleId":"D2","level":"warning","message":{"text":"InterpCx::deref_pointer (cognitive 25): InterpCx::deref_pointer has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (18 pts), match/switch 1 (4 pts), boolean chains 3 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_const_eval/src/interpret/place.rs"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a8fdefc6cb2937632c1dd910748f18c286b699ef0ae80c1f7303ba71d65c9ac"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_data_structures::graph::dominators::dominators_impl (cognitive 25): rustc_data_structures::graph::dominators::dominators_impl has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 7 (10 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_data_structures/src/graph/dominators/mod.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e77b4ee86e9bb11c0459fb5ffa456b374b393f3d3a234522f053d4026edb810"}},{"ruleId":"D2","level":"warning","message":{"text":"Highlighter::highlight_rustc_lexer (cognitive 25): Highlighter::highlight_rustc_lexer has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (19 pts), match/switch 2 (5 pts), loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_driver_impl/src/highlighter.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"84f6784315ee807524d2c6627947b663edf569919ca4895c18030163dd856ddc"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_driver_impl::compiler_entrypoint (cognitive 25): rustc_driver_impl::compiler_entrypoint has cognitive complexity 25 (threshold 15). Drivers by points: if/else 20 (22 pts), match/switch 2, boolean chains 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_driver_impl/src/lib.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bf54d7cc919875f98c52b3577067044fadae67aaa938f8d248d6792f13cf054"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_expand::mbe::quoted::parse (cognitive 25): rustc_expand::mbe::quoted::parse has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (22 pts), boolean chains 2, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_expand/src/mbe/quoted.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"edab3a677d0d4facb2b0362d521c522a146532cbab12243033c25da98d0eb998"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_hir_analysis::check::compare_impl_item::report_trait_method_mismatch (cognitive 25): rustc_hir_analysis::check::compare_impl_item::report_trait_method_mismatch has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (14 pts), match/switch 2 (5 pts), boolean chains 4, loops 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/check/compare_impl_item.rs"},"region":{"startLine":1001}}}],"partialFingerprints":{"codehealthFindingId/v1":"f58d45bf8322be8a4a9693853620143ba444b3cb7ff7dcadd85803b1d88904de"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_hir_analysis::check::wfcheck::lint_redundant_lifetimes (cognitive 25): rustc_hir_analysis::check::wfcheck::lint_redundant_lifetimes has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 3 (5 pts), boolean chains 1, match/switch 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/check/wfcheck.rs"},"region":{"startLine":2718}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f562bef0f768819c2c597e27c28f73e3b010d00e79cbbc11557301fa8aa2260"}},{"ruleId":"D2","level":"warning","message":{"text":"CoerceMany::report_return_mismatched_types (cognitive 25): CoerceMany::report_return_mismatched_types has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 7 (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":"compiler/rustc_hir_typeck/src/coercion.rs"},"region":{"startLine":2035}}}],"partialFingerprints":{"codehealthFindingId/v1":"d99d019e3cf7483d918190c1fc0d7503cf4c2ba20ea1ac54e4af5a4f91303578"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::deduce_closure_signature_from_predicates (cognitive 25): FnCtxt::deduce_closure_signature_from_predicates has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 3 (9 pts), boolean chains 1, loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/closure.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dfff4969b6eaf829127809ad84c9afec75d018462527dbd6cde2aa2b75597bf"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::report_unknown_field (cognitive 25): FnCtxt::report_unknown_field has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 5 (10 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/expr.rs"},"region":{"startLine":2619}}}],"partialFingerprints":{"codehealthFindingId/v1":"c69171b19519fbf68636a724836d62b62eec0876a27faf8a55133169f89a1e56"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::impl_into_iterator_should_be_iterator (cognitive 25): FnCtxt::impl_into_iterator_should_be_iterator has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (18 pts), loops 2 (4 pts), boolean chains 2, match/switch 1 (nesting depth added 9). Of this number, 17 points are the body\u0027s own statements and 8 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":"compiler/rustc_hir_typeck/src/method/suggest.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"257aad9c6b9262471c6fa2c2b2fdef56295cbafb9dcf356d7bd88e6a2ea45095"}},{"ruleId":"D2","level":"warning","message":{"text":"Resolver::detect_derive_attribute (cognitive 25): Resolver::detect_derive_attribute has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 3 (7 pts), loops 2 (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":"compiler/rustc_resolve/src/diagnostics/impls.rs"},"region":{"startLine":2231}}}],"partialFingerprints":{"codehealthFindingId/v1":"c865ced475739bb181c31aee8ce30463eb931e187e7eca054646abfae01e3138"}},{"ruleId":"D2","level":"warning","message":{"text":"Resolver::resolve_ident_in_module_globs_unadjusted (cognitive 25): Resolver::resolve_ident_in_module_globs_unadjusted has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (17 pts), match/switch 3 (6 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/ident.rs"},"region":{"startLine":1220}}}],"partialFingerprints":{"codehealthFindingId/v1":"94e5f6c5dd2f5f662762e08178b2469904cda34fa880e919ca85318bfbc3cbfc"}},{"ruleId":"D2","level":"warning","message":{"text":"NonLocalDefinitions::check_item (cognitive 25): NonLocalDefinitions::check_item has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 6, loops 1 (2 pts), match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_lint/src/non_local_def.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fa3bd1f25da61c00959b8d2b885727a918a951183492a4d3b6dd13f3036c969"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_lint::types::lint_wide_pointer (cognitive 25): rustc_lint::types::lint_wide_pointer has cognitive complexity 25 (threshold 15). Drivers by points: if/else 18 (22 pts), boolean chains 1, loops 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":"compiler/rustc_lint/src/types.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"aed187c776a9e9b9bf693acd161c81572fbbb6a9adf690f54bfd41b6e87cd1e3"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_lint::unused::must_use::is_ty_must_use (cognitive 25): rustc_lint::unused::must_use::is_ty_must_use has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 3, match/switch 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_lint/src/unused/must_use.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1f30e5540e1729fc0db75f4d1bc85a269927cdca7764dcf4a8ab04e4e948828"}},{"ruleId":"D2","level":"warning","message":{"text":"PrettyPrinter::pretty_print_dyn_existential (cognitive 25): PrettyPrinter::pretty_print_dyn_existential has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (21 pts), boolean chains 3, loops 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":"compiler/rustc_middle/src/ty/print/pretty.rs"},"region":{"startLine":1391}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8819e6172a692a57448a49e0f259ae1ccad8193f27970589084ca1d14f1474f"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_mir_build::builder::scope::build_scope_drops (cognitive 25): rustc_mir_build::builder::scope::build_scope_drops has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (21 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_build/src/builder/scope.rs"},"region":{"startLine":1790}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bebf4584abd6bd6b9e9b619e0f10c9981a8494e2ee995a3fc5b54578b4e1b63"}},{"ruleId":"D2","level":"warning","message":{"text":"AbortUnwindingCalls::run_pass (cognitive 25): AbortUnwindingCalls::run_pass has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 3 (6 pts), boolean chains 4, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/abort_unwinding_calls.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"b17521f9613d11f3723bc06c71dc63111e5f2a6f7bf7f8f5edc628a521b72580"}},{"ruleId":"D2","level":"warning","message":{"text":"ConstPropagator::visit_terminator (cognitive 25): ConstPropagator::visit_terminator has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (19 pts), loops 1 (3 pts), boolean chains 2, match/switch 1 (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":"compiler/rustc_mir_transform/src/known_panics_lint.rs"},"region":{"startLine":751}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c69547e65a0382894c960f85dc785dcc0ec69b2b82c8aac4937adc326ff22d5"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_mir_transform::ssa::compute_copy_classes (cognitive 25): rustc_mir_transform::ssa::compute_copy_classes has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (20 pts), loops 3 (5 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/ssa.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"6358f7139934965bd237aa1c437dc4ba33448ec420566b2645297e4ced772d4e"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_monomorphize::partitioning::merge_codegen_units (cognitive 25): rustc_monomorphize::partitioning::merge_codegen_units has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 5 (8 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_monomorphize/src/partitioning.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6dd950faf6648af11924d8213dcd5fd91ac314fa419eb3974e850e198323c70"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_monomorphize::partitioning::debug_dump (cognitive 25): rustc_monomorphize::partitioning::debug_dump has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (18 pts), loops 5 (7 pts) (nesting depth added 10). Of this number, 18 points are the body\u0027s own statements and 7 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":"compiler/rustc_monomorphize/src/partitioning.rs"},"region":{"startLine":997}}}],"partialFingerprints":{"codehealthFindingId/v1":"e75eaa2ceab2de5c2163c3f4b812a8507036802c1af58d16058d69888066689f"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_parse::parser::asm::parse_asm_args (cognitive 25): rustc_parse::parser::asm::parse_asm_args has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (20 pts), match/switch 1 (3 pts), boolean chains 1, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/asm.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"073ef89e502b211fe9334993caa75bc0376b586eb14de14b0103d4e8a0ec2b2f"}},{"ruleId":"D2","level":"warning","message":{"text":"RustcPatCtxt::lower_pat (cognitive 25): RustcPatCtxt::lower_pat has cognitive complexity 25 (threshold 15). Drivers by points: match/switch 10 (22 pts), if/else 2 (3 pts) (nesting depth added 13). 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":"compiler/rustc_pattern_analysis/src/rustc.rs"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"80bf857c4891289667fc0f31b034a51b822613baf3e7a3502f91168c7938a96c"}},{"ruleId":"D2","level":"warning","message":{"text":"NiceRegionError::explain_actual_impl_that_was_found (cognitive 25): NiceRegionError::explain_actual_impl_that_was_found has cognitive complexity 25 (threshold 15). Drivers by points: if/else 14 (19 pts), match/switch 4 (5 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":"compiler/rustc_trait_selection/src/error_reporting/infer/nice_region_error/placeholder_error.rs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b489c162c3caac54d0ffa27a5ae6298a76c38bd3435e1ed5fb501f445df935c"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeErrCtxt::suggest_function_pointers_impl (cognitive 25): TypeErrCtxt::suggest_function_pointers_impl has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 3, match/switch 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/error_reporting/infer/suggest.rs"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"da92c7eb0104a244337dda8970005593f4485b7278a3d0061a00ae12e71e5a2f"}},{"ruleId":"D2","level":"warning","message":{"text":"SelectionContext::assemble_candidates_for_unsizing (cognitive 25): SelectionContext::assemble_candidates_for_unsizing has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (18 pts), boolean chains 3, loops 1 (3 pts), match/switch 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/traits/select/candidate_assembly.rs"},"region":{"startLine":996}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd98c7ab84e36f747e6ad8e49cea619e1e986492fa1157d06d08f0dd334bab55"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_trait_selection::traits::misc::all_fields_implement_trait (cognitive 25): rustc_trait_selection::traits::misc::all_fields_implement_trait has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 2 (3 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/traits/misc.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b24f13219000bfa4ff2717d1a9a34e960cb16456726ba093b829c5183eaabdc"}},{"ruleId":"D2","level":"warning","message":{"text":"libm::math::sinf::sinf (cognitive 25): libm::math::sinf::sinf has cognitive complexity 25 (threshold 15). Drivers by points: if/else 15 (24 pts), match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/compiler-builtins/libm/src/math/sinf.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"152dbad35d1ff4b441c72100b97584c0c0aced043cf9395623c21b2e0376378d"}},{"ruleId":"D2","level":"warning","message":{"text":"core::num::imp::dec2flt::slow::parse_long_mantissa (cognitive 25): core::num::imp::dec2flt::slow::parse_long_mantissa has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (18 pts), loops 3, match/switch 1 (3 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/num/imp/dec2flt/slow.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"97f12f1d0ef760aab50bac644284daaad1edcfc92e2b40a472939525646d3e35"}},{"ruleId":"D2","level":"warning","message":{"text":"std::sys::path::windows_prefix::parse_prefix (cognitive 25): std::sys::path::windows_prefix::parse_prefix has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (21 pts), boolean chains 4 (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":"library/std/src/sys/path/windows_prefix.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"da368450e409c4893bc540f178bb366012be7c00b20259bce6a354bb44f5dedb"}},{"ruleId":"D2","level":"warning","message":{"text":"stdarch_gen_hexagon::hvx::parse_compound_expr (cognitive 25): stdarch_gen_hexagon::hvx::parse_compound_expr has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (20 pts), boolean chains 5 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/stdarch-gen-hexagon/src/hvx.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eb21a54b306ae52e0416787b0918a7479294d2905e24233a978176dbe5eb00a"}},{"ruleId":"D2","level":"warning","message":{"text":"DeferredCommand::finish_process (cognitive 25): DeferredCommand::finish_process has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (17 pts), match/switch 5 (8 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/bootstrap/src/utils/exec.rs"},"region":{"startLine":840}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fb5b6bdcf0d6b9f9bea3ff72dcef4622ea6e23fc4e8f19d814eb20ef826a988"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeBlocks::next (cognitive 25): CodeBlocks::next has cognitive complexity 25 (threshold 15). Drivers by points: if/else 16 (21 pts), match/switch 2 (3 pts), loops 1 (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":"src/librustdoc/html/markdown.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"007df6cd2fa8bf1568ebbe09034a0eb6f525f55f37a4d1db3abff2a1ee6d4da6"}},{"ruleId":"D2","level":"warning","message":{"text":"LinkReplacerInner::handle_event (cognitive 25): LinkReplacerInner::handle_event has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (20 pts), boolean chains 4, match/switch 1 (nesting depth added 12). 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/librustdoc/html/markdown.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"96bb952b60869ae6bf78de1f262fecbfc28f22eb3a881c1350097aeb89441615"}},{"ruleId":"D2","level":"warning","message":{"text":"rustdoc::html::render::print_item::render_enum_fields (cognitive 25): rustdoc::html::render::print_item::render_enum_fields has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (13 pts), match/switch 2 (7 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/render/print_item.rs"},"region":{"startLine":1714}}}],"partialFingerprints":{"codehealthFindingId/v1":"be4d14af580b9964a8a5539f39d7238411fe970412b0c1abc32b212d984aea3f"}},{"ruleId":"D2","level":"warning","message":{"text":"SuggestContext::recurse (cognitive 25): SuggestContext::recurse has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 2 (4 pts), match/switch 2 (3 pts) (nesting depth added 14). 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/tools/clippy/clippy_lints/src/booleans.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"71c434e7ba2d1a490d8e32a7721d39c3ad6982d0465f7d0dbc3a026090cd108a"}},{"ruleId":"D2","level":"warning","message":{"text":"LargeUnoptStackFrames::check_fn (cognitive 25): LargeUnoptStackFrames::check_fn has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 5, match/switch 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/large_unopt_stack_frames.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aa97090337eabda7b6f8755d0f55c07be5b5f2ed2da41636a40b51883aafb18"}},{"ruleId":"D2","level":"warning","message":{"text":"VarVisitor::check (cognitive 25): VarVisitor::check has cognitive complexity 25 (threshold 15). Drivers by points: if/else 14 (20 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/loops/needless_range_loop.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"e45171b35e3922941b4f6a3fa51555e636a9a579dacb87460a5e0614131cf9fc"}},{"ruleId":"D2","level":"warning","message":{"text":"OnlyUsedInRecursion::check_expr (cognitive 25): OnlyUsedInRecursion::check_expr has cognitive complexity 25 (threshold 15). Drivers by points: if/else 3 (11 pts), match/switch 2 (7 pts), boolean chains 5, loops 1 (2 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/only_used_in_recursion.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2fc500c7576c880970b5b1fe9ed5d46419396cecb86b8833aa4f330a00f409c"}},{"ruleId":"D2","level":"warning","message":{"text":"UnnecessaryWraps::check_fn (cognitive 25): UnnecessaryWraps::check_fn has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (18 pts), boolean chains 4, match/switch 2 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/unnecessary_wraps.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3c965415f40e24a4eaa3124e371f42b1b8030b16102d66dd4e0e7c44a987543"}},{"ruleId":"D2","level":"warning","message":{"text":"UselessVec::check_expr (cognitive 25): UselessVec::check_expr has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (16 pts), match/switch 2 (5 pts), boolean chains 4 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/useless_vec.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"80aafd79b85c4dde816f5ab9d1351503c1ee18726e055ab293c5c6922174cf98"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::loops::never_loop::never_loop_expr (cognitive 25): clippy_lints::loops::never_loop::never_loop_expr has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (15 pts), match/switch 4 (8 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/loops/never_loop.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"e99670e3f95874bae065776669471be96085062753861195bcd4328840daab76"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::matches::single_match::check (cognitive 25): clippy_lints::matches::single_match::check has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (20 pts), boolean chains 5 (nesting depth added 11). 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/tools/clippy/clippy_lints/src/matches/single_match.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"21f1c4e3b892ef7d3ca7b49dd92befadfcc1fc4cd553f52415a40209e8f501be"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::methods::manual_saturating_arithmetic::is_min_or_max (cognitive 25): clippy_lints::methods::manual_saturating_arithmetic::is_min_or_max has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 5, match/switch 2 (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/tools/clippy/clippy_lints/src/methods/manual_saturating_arithmetic.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"b11b8b75cd4bbb3e0cbc2ac3d53ac435a4f18d5f938ebbf021a88a7c305b529a"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::methods::open_options::get_open_options (cognitive 25): clippy_lints::methods::open_options::get_open_options has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 2 (6 pts), boolean chains 4 (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/tools/clippy/clippy_lints/src/methods/open_options.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9c647f2af682dd9c6828cbc5d0b845aa93b94013dba074893de40e531233e4d"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::methods::or_fun_call::check (cognitive 25): clippy_lints::methods::or_fun_call::check has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 4, match/switch 2 (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/tools/clippy/clippy_lints/src/methods/or_fun_call.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"813f1f420dc300ac910f21a240b68d8be8ac90e3ad32676ce446c98f72692b94"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::no_effect::reduce_expression (cognitive 25): clippy_lints::no_effect::reduce_expression has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (13 pts), match/switch 4 (10 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/no_effect.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d76a5864c41409177094c7290bb45bcc396056bc34e4ff1679278f697260808"}},{"ruleId":"D2","level":"warning","message":{"text":"AlmostStandardFormulation::check_item (cognitive 25): AlmostStandardFormulation::check_item has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 2 (8 pts), boolean chains 2 (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints_internal/src/almost_standard_lint_formulation.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe2771b6e6417ddbcbd42d12f086d65ef868f67e1b864c0b2c60457cd96562a9"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_utils::ty::type_certainty::path_segment_certainty (cognitive 25): clippy_utils::ty::type_certainty::path_segment_certainty has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (20 pts), match/switch 2 (3 pts), boolean chains 2 (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/tools/clippy/clippy_utils/src/ty/type_certainty/mod.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"c033c9449085deb6df8fb9cc630f6ab53a6012ef49b8c469a5b68b978cc0b4ee"}},{"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":"src/tools/miri/cargo-miri/src/phases.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f4333f114a600bdd7f024676da1115b2a584d580a5713a2ace7543374be5d51"}},{"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/tools/miri/src/concurrency/scheduler.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dd7e709943fa0f0b61ae1b4692784fa2ed2af1f8fd0cd3ba78ed9a0289cbaf3"}},{"ruleId":"D2","level":"warning","message":{"text":"hir::display::write_generic_params_or_args (cognitive 25): hir::display::write_generic_params_or_args has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (17 pts), boolean chains 3, match/switch 1 (3 pts), loops 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir/src/display.rs"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9c77814da5ed9af55e6d5667ec2016d983fce07aa71e60f38ac22b80bd7fd9a"}},{"ruleId":"D2","level":"warning","message":{"text":"hir_def::find_path::find_path_for_module (cognitive 25): hir_def::find_path::find_path_for_module has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 3, loops 1 (2 pts), 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/tools/rust-analyzer/crates/hir-def/src/find_path.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3b82823d8d901d5254ff8f08cc20db13930125c7e67064a1827771c3bb84237"}},{"ruleId":"D2","level":"warning","message":{"text":"hir_def::find_path::find_local_import_locations (cognitive 25): hir_def::find_path::find_local_import_locations has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (17 pts), loops 2 (3 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/find_path.rs"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"26e936ecc26c4a1db3a25f809b9c9bd61a2aad61893c8b37e3c03decbde5550a"}},{"ruleId":"D2","level":"warning","message":{"text":"Coerce::coerce_from_fn_item (cognitive 25): Coerce::coerce_from_fn_item has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (22 pts), boolean chains 2, match/switch 1 (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/tools/rust-analyzer/crates/hir-ty/src/infer/coerce.rs"},"region":{"startLine":742}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e36127f18e9d76851a1bab506d37d50d93fbdb6b5843356d759d2f93c130bee"}},{"ruleId":"D2","level":"warning","message":{"text":"InferenceContext::infer_pat_inner (cognitive 25): InferenceContext::infer_pat_inner has cognitive complexity 25 (threshold 15). Drivers by points: loops 3 (8 pts), match/switch 4 (7 pts), if/else 5 (6 pts), boolean chains 4 (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/tools/rust-analyzer/crates/hir-ty/src/infer/pat.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2df8184eb4967b4c3cac615b37a1f1765f1733c77a7770f5b6a146ca3b7fb23"}},{"ruleId":"D2","level":"warning","message":{"text":"TraitImpls::collect_def_map::collect (cognitive 25): TraitImpls::collect_def_map::collect has cognitive complexity 25 (threshold 15). Drivers by points: loops 5 (10 pts), if/else 3 (9 pts), match/switch 2 (6 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/method_resolution.rs"},"region":{"startLine":732}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bc7245cfdc5ecb5a27bf3a18467af109fe9565a10ca90b7e337e1d048a1c711"}},{"ruleId":"D2","level":"warning","message":{"text":"AdtDef::new (cognitive 25): AdtDef::new has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (24 pts), match/switch 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/next_solver/interner.rs"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f38ecab733470d76ac59de2fc804e7cee91190540ac37165956878160e0d9e9"}},{"ruleId":"D2","level":"warning","message":{"text":"hir_ty::mir::lower::mir_body_for_closure_query (cognitive 25): hir_ty::mir::lower::mir_body_for_closure_query has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 4 (7 pts), loops 2 (3 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/tools/rust-analyzer/crates/hir-ty/src/mir/lower.rs"},"region":{"startLine":1998}}}],"partialFingerprints":{"codehealthFindingId/v1":"43158e5cd45a30631629d8b88dee143fd5dc8dd477d8d02519418626fc3491a1"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_assists::handlers::extract_type_alias::collect_used_generics (cognitive 25): ide_assists::handlers::extract_type_alias::collect_used_generics has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 5 (9 pts), boolean chains 2 (nesting depth added 11). Of this number, 24 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. 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/tools/rust-analyzer/crates/ide-assists/src/handlers/extract_type_alias.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"cefac9484b51305206dd5279aeff5b8f1a9501db5d38e79fce00a40b04fad07a"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_assists::handlers::remove_dbg::compute_dbg_replacement (cognitive 25): ide_assists::handlers::remove_dbg::compute_dbg_replacement has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 4 (8 pts), boolean chains 5 (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/tools/rust-analyzer/crates/ide-assists/src/handlers/remove_dbg.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1e3365cc1870d8e8591cecd7acb8edf8b16388576ea3deef4521637a3b20b35"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_db::syntax_helpers::node_ext::walk_patterns_in_expr (cognitive 25): ide_db::syntax_helpers::node_ext::walk_patterns_in_expr has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (15 pts), match/switch 3 (8 pts), boolean chains 1, loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-db/src/syntax_helpers/node_ext.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"160d495a09c206c7fd4b8232bfa46877be80dda975179a3a7b0179b04d57eee7"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkspaceBuildScripts::rustc_crates (cognitive 25): WorkspaceBuildScripts::rustc_crates has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (12 pts), match/switch 3 (9 pts), loops 3 (4 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/project-model/src/build_dependencies.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"54e66e87bb23ccad8bf3b394ce297e09e8348e103fef8b22df0d994627f51e40"}},{"ruleId":"D2","level":"warning","message":{"text":"FlycheckActor::check_command (cognitive 25): FlycheckActor::check_command has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 5 (10 pts), boolean chains 1 (nesting depth added 12). 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/tools/rust-analyzer/crates/rust-analyzer/src/flycheck.rs"},"region":{"startLine":884}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fa53a1c38b0ae122834c6fb7ea285a9a16fe31c66663b2fcec94284b779e66b"}},{"ruleId":"D2","level":"warning","message":{"text":"tt::transform_tt (cognitive 25): tt::transform_tt has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 3 (6 pts), match/switch 2 (5 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/tt/src/lib.rs"},"region":{"startLine":761}}}],"partialFingerprints":{"codehealthFindingId/v1":"542026be54dc12fef43089e31822a8955a7514ff6bf99d39a6c258854c416db0"}},{"ruleId":"D2","level":"warning","message":{"text":"FmtVisitor::visit_item (cognitive 25): FmtVisitor::visit_item has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (18 pts), match/switch 3 (7 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/visitor.rs"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"5356b3c8fd35057798a7f0333673f272f245fb9cd42c79aba616abf37b0b4d0f"}},{"ruleId":"D2","level":"warning","message":{"text":"tidy::deps::check_license_exceptions (cognitive 25): tidy::deps::check_license_exceptions has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 2 (5 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/tidy/src/deps.rs"},"region":{"startLine":858}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9abd84b9471ff81980b01128930746ff2b5abe7298afca0bb9d0815e9731033"}},{"ruleId":"D2","level":"warning","message":{"text":"MirBorrowckCtxt::add_moved_or_invoked_closure_note (cognitive 24): MirBorrowckCtxt::add_moved_or_invoked_closure_note has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 2 (6 pts), boolean chains 2, loops 1 (nesting depth added 12). 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":"compiler/rustc_borrowck/src/diagnostics/mod.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"b95e91889dd41a1a610778072bd64efc94e396d5901139511a2bdc50e0da6045"}},{"ruleId":"D2","level":"warning","message":{"text":"MirBorrowckCtxt::consume_rvalue (cognitive 24): MirBorrowckCtxt::consume_rvalue has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (10 pts), match/switch 5 (9 pts), loops 2 (5 pts) (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":"compiler/rustc_borrowck/src/lib.rs"},"region":{"startLine":1475}}}],"partialFingerprints":{"codehealthFindingId/v1":"454ab4100153a9e3442e14da53db0da4c70b128dc75d22cebb6f0865eb4be0d7"}},{"ruleId":"D2","level":"warning","message":{"text":"Builder::gcc_shr (cognitive 24): Builder::gcc_shr has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (18 pts), boolean chains 3, match/switch 1 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_gcc/src/int.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"228d3eeb0c9fcbd726170a1dd6010ef9031ed9bf3d5fbf4d87065ae70cd4f754"}},{"ruleId":"D2","level":"warning","message":{"text":"Builder::gcc_icmp (cognitive 24): Builder::gcc_icmp has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 3 (6 pts), boolean chains 3 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_gcc/src/int.rs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6ed9d40a7631a9b1c0b6597ca9ca6f43428ddeb09aaf48e372a2eaec83d2a58"}},{"ruleId":"D2","level":"warning","message":{"text":"CodegenCx::get_static_inner (cognitive 24): CodegenCx::get_static_inner has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (20 pts), boolean chains 4 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/consts.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff6c575671457579b1ead948f7249117ca24670e3b80fc0b152d8f32be6e2c8f"}},{"ruleId":"D2","level":"warning","message":{"text":"CodegenCx::codegen_static_item (cognitive 24): CodegenCx::codegen_static_item has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 7 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/consts.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"440f3e327f9721152c4900fb757fa8120ad3ea38658834ec339cf47dab7ef935"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_codegen_llvm::base::compile_codegen_unit::module_codegen (cognitive 24): rustc_codegen_llvm::base::compile_codegen_unit::module_codegen has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (16 pts), loops 4 (6 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/base.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d9b538107ae14b7d8088a44feebd81765b009f730bee2895ece76def07deb1a"}},{"ruleId":"D2","level":"warning","message":{"text":"CrateInfo::new (cognitive 24): CrateInfo::new has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (12 pts), match/switch 4 (8 pts), boolean chains 3, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/base.rs"},"region":{"startLine":1017}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fa4a86c9adaea7b377e60398d82b938467954954be7d591648db5bae87181af"}},{"ruleId":"D2","level":"warning","message":{"text":"Checker::visit_rvalue (cognitive 24): Checker::visit_rvalue has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 5, match/switch 2 (3 pts) (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":"compiler/rustc_const_eval/src/check_consts/check.rs"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"35e4f13b2574915734c3d2ac8b9da086802987fd71e1f0e953228f24bb149527"}},{"ruleId":"D2","level":"warning","message":{"text":"InterpCx::init_fn_call (cognitive 24): InterpCx::init_fn_call has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (16 pts), match/switch 3 (5 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_const_eval/src/interpret/call.rs"},"region":{"startLine":758}}}],"partialFingerprints":{"codehealthFindingId/v1":"247bf2a09242541ebd90b1fa69b95b3c0caccf3deff148de2d0f5fc766897cec"}},{"ruleId":"D2","level":"warning","message":{"text":"TriColorDepthFirstSearch::run_from (cognitive 24): TriColorDepthFirstSearch::run_from has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_data_structures/src/graph/iterate/mod.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5fefa0bba2be4ae6309c50691a7fe68190d91c7094a7e155dcdb70c32b9a5d5"}},{"ruleId":"D2","level":"warning","message":{"text":"State::print_item (cognitive 24): State::print_item has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 3 (6 pts), match/switch 2 (3 pts) (nesting depth added 13). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_pretty/src/lib.rs"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff352b7c3a0abe9c50e8ad78ca5bec4556ffcfd8a1268799a8db6094f7175cf1"}},{"ruleId":"D2","level":"warning","message":{"text":"State::print_expr (cognitive 24): State::print_expr has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 2 (5 pts), match/switch 2 (3 pts) (nesting depth added 12). 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":"compiler/rustc_hir_pretty/src/lib.rs"},"region":{"startLine":1572}}}],"partialFingerprints":{"codehealthFindingId/v1":"18eb83383c818e7f28e718bf8a0e6d1bb572e1f16820061e842f2f9cbe5ccf10"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::annotate_expected_due_to_let_ty (cognitive 24): FnCtxt::annotate_expected_due_to_let_ty has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 4 (8 pts), boolean chains 4 (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/demand.rs"},"region":{"startLine":707}}}],"partialFingerprints":{"codehealthFindingId/v1":"142dde98d39cb0e7eb2f34751a2b730719d9196d407fc139916078dfcb866336"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::check_expr_index (cognitive 24): FnCtxt::check_expr_index has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 1 (3 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/expr.rs"},"region":{"startLine":3504}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d4ef9a540f48eae5cd95a53d2626bd738e627b1b055b96122526d05356c18ee"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::confusable_method_name (cognitive 24): FnCtxt::confusable_method_name has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 2 (5 pts), boolean chains 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/method/suggest.rs"},"region":{"startLine":2380}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a95ee7c40b6394a5e965823c639ccb30c311e21831b7d8db13a66d5376793b5"}},{"ruleId":"D2","level":"warning","message":{"text":"InferCtxt::shallow_resolve (cognitive 24): InferCtxt::shallow_resolve has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 3 (8 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_infer/src/infer/mod.rs"},"region":{"startLine":1264}}}],"partialFingerprints":{"codehealthFindingId/v1":"36159a45d864c6e8063e4bd801e5f81d3108c3293f35a9bc82cb8fcbb56ac398"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_interface::passes::configure_and_expand (cognitive 24): rustc_interface::passes::configure_and_expand has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 4, loops 1 (2 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_interface/src/passes.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebf2df203017542731eb0fff60f40f9761c35087b14c8882024260c0556c6568"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_lint::types::repr_nullable_ptr (cognitive 24): rustc_lint::types::repr_nullable_ptr has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 4 (9 pts), boolean chains 1 (nesting depth added 12). 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":"compiler/rustc_lint/src/types.rs"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"87f861aeaba97a768f03b2e798a2364ecab47c9337d3979eebc3508893060145"}},{"ruleId":"D2","level":"warning","message":{"text":"CStore::inject_allocator_crate (cognitive 24): CStore::inject_allocator_crate has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (12 pts), match/switch 4 (8 pts), boolean chains 2, loops 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_metadata/src/creader.rs"},"region":{"startLine":1174}}}],"partialFingerprints":{"codehealthFindingId/v1":"88740190012eac29b7224de578379bee36c7f7dfa63e581141f545c00eba97bc"}},{"ruleId":"D2","level":"warning","message":{"text":"Collector::build_dll_import (cognitive 24): Collector::build_dll_import has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (17 pts), match/switch 3 (5 pts), boolean chains 2 (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":"compiler/rustc_metadata/src/native_libs.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"f93f9a10569ade0c3109b1d8ddfefd2297e7c87e1e15795cf51771b15a707733"}},{"ruleId":"D2","level":"warning","message":{"text":"PrettyPrinter::try_print_visible_def_path_recur (cognitive 24): PrettyPrinter::try_print_visible_def_path_recur has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (15 pts), match/switch 4 (7 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/ty/print/pretty.rs"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b0607321c2234e70cd525665832fe1b278f947fbfd821a5c21ee0b137feb695"}},{"ruleId":"D2","level":"warning","message":{"text":"FmtPrinter::name_all_regions (cognitive 24): FmtPrinter::name_all_regions has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (18 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 6). Of this number, 22 points are the body\u0027s own statements and 2 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":"compiler/rustc_middle/src/ty/print/pretty.rs"},"region":{"startLine":2814}}}],"partialFingerprints":{"codehealthFindingId/v1":"883df830c53c5e2038f303de3819659b305de47297907a04481d38de248459f8"}},{"ruleId":"D2","level":"warning","message":{"text":"CostChecker::visit_terminator (cognitive 24): CostChecker::visit_terminator has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (21 pts), boolean chains 2, match/switch 1 (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/cost_checker.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3e60cf27a3d95b3a017b8c2a286c6bec102b50cf5bae91c50fc181c53c0040a"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_mir_transform::cross_crate_inline::cross_crate_inlinable (cognitive 24): rustc_mir_transform::cross_crate_inline::cross_crate_inlinable has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 7, match/switch 3, loops 1 (2 pts) (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/cross_crate_inline.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5286f16ab805690d5b8d3d172345678ba0dac42fe50fa7c0e18cf9bf472e8f2"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_mir_transform::ffi_unwind_calls::has_ffi_unwind_calls (cognitive 24): rustc_mir_transform::ffi_unwind_calls::has_ffi_unwind_calls has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (20 pts), match/switch 2 (3 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/ffi_unwind_calls.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aa39eb3d80ef7112bae820a2ce6bc738be60385961fcb029211a15ce3505cfa"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_mir_transform::inline::inline_call (cognitive 24): rustc_mir_transform::inline::inline_call has cognitive complexity 24 (threshold 15). Drivers by points: if/else 15 (19 pts), loops 3 (5 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":"compiler/rustc_mir_transform/src/inline.rs"},"region":{"startLine":854}}}],"partialFingerprints":{"codehealthFindingId/v1":"359ccc0c5f1c8c3d054cfb7e1d51df48aec048b857b3aae788948dee350ce041"}},{"ruleId":"D2","level":"warning","message":{"text":"EvalCtxt::normalize_opaque_type (cognitive 24): EvalCtxt::normalize_opaque_type has cognitive complexity 24 (threshold 15). Drivers by points: match/switch 6 (14 pts), if/else 6 (10 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":"compiler/rustc_next_trait_solver/src/solve/project_goals/opaque_types.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"138f2bd2bd03c6845c9e1153a8715d94b13c670aea79400bdf6bdea83f42d8d3"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_where_clause_predicates (cognitive 24): Parser::parse_where_clause_predicates has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 2 (5 pts), loops 2 (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":"compiler/rustc_parse/src/parser/generics.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"63ee045472a7ea18318b480e3a79691af80810019f38acfb776db3697259dbf0"}},{"ruleId":"D2","level":"warning","message":{"text":"Slice::split (cognitive 24): Slice::split has cognitive complexity 24 (threshold 15). Drivers by points: match/switch 5 (11 pts), if/else 4 (8 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 12). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_pattern_analysis/src/constructor.rs"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8085cc1e0e3588068d54ce247830fcdab853aa9774573d49bf741c3e6097fe5"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_pattern_analysis::usefulness::collect_overlapping_range_endpoints (cognitive 24): rustc_pattern_analysis::usefulness::collect_overlapping_range_endpoints has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (23 pts), loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_pattern_analysis/src/usefulness.rs"},"region":{"startLine":1598}}}],"partialFingerprints":{"codehealthFindingId/v1":"7620af839a8e0e54432484cb73a31cccb9e8ae6cf9660c3561c4bd3156cd3e5f"}},{"ruleId":"D2","level":"warning","message":{"text":"LateResolutionVisitor::err_code_special_cases (cognitive 24): LateResolutionVisitor::err_code_special_cases has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (17 pts), loops 2 (7 pts) (nesting depth added 17). 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":"compiler/rustc_resolve/src/late/diagnostics.rs"},"region":{"startLine":1573}}}],"partialFingerprints":{"codehealthFindingId/v1":"16dabbcc259e07f887abc8be6709bf408fba00ea7e392e6cc445f3e5cd42ea15"}},{"ruleId":"D2","level":"warning","message":{"text":"LateResolutionVisitor::future_proof_import (cognitive 24): LateResolutionVisitor::future_proof_import has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 2 (5 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/late.rs"},"region":{"startLine":2938}}}],"partialFingerprints":{"codehealthFindingId/v1":"457e9bc27968b12f2da0b600b7ea08a5993252e1a457051c9c810486f487dd02"}},{"ruleId":"D2","level":"warning","message":{"text":"LateResolutionVisitor::resolve_doc_links (cognitive 24): LateResolutionVisitor::resolve_doc_links has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 4 (10 pts), boolean chains 3, match/switch 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/late.rs"},"region":{"startLine":5799}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d96ea8d19252fa8ee88cdaab69726d1459d0aa45a9729a4cca553a72dcb4643"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_resolve::late::lang_items::collect_item (cognitive 24): rustc_resolve::late::lang_items::collect_item has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (19 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/late/lang_items.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"db220336eb3d6a710d784d2f8f02e47176d2dfd71a9e8e15702e1be441a4083e"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_resolve::rustdoc::strip_generics_from_path (cognitive 24): rustc_resolve::rustdoc::strip_generics_from_path has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 2 (5 pts), match/switch 2 (5 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":"compiler/rustc_resolve/src/rustdoc.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"74ece11c84dfb6eafb95b89f441321fac4a7ea0855d9abed57fea4c37da9dcde"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_target::callconv::x86_64::classify_arg (cognitive 24): rustc_target::callconv::x86_64::classify_arg has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (18 pts), loops 6 (13 pts), match/switch 4 (7 pts), boolean chains 2 (nesting depth added 16). 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. This shape REPEATS in the file: one other method here (rustc_target::callconv::x86_64::classify_arg::classify) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_target/src/callconv/x86_64.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c4342af83f988113c4fbd3dfb9c171d1fe15f35da2b00be026774f7fb5db4b5"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_target::callconv::x86_win64::compute_abi_info (cognitive 24): rustc_target::callconv::x86_win64::compute_abi_info has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (19 pts), match/switch 2 (3 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_target/src/callconv/x86_win64.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6fe0f56d17f54782681582538bb9f4ba39d1a3491881ec7d6ff25d48865b5c6"}},{"ruleId":"D2","level":"warning","message":{"text":"DescriptionCtx::new (cognitive 24): DescriptionCtx::new has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (19 pts), match/switch 2 (4 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":"compiler/rustc_trait_selection/src/diagnostics/note_and_explain.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a5cf5c56277a12fe41d8e307c0362c237086009035d3d771eb6e80274676a63"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeErrCtxt::emit_specialized_closure_kind_error (cognitive 24): TypeErrCtxt::emit_specialized_closure_kind_error has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14 (16 pts), boolean chains 5, match/switch 2 (3 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/error_reporting/traits/fulfillment_errors.rs"},"region":{"startLine":1099}}}],"partialFingerprints":{"codehealthFindingId/v1":"266fb031b7553d0cb8e8f0151098e6b8f5fcb383fb09a8444d4a1bd02af92654"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_trait_selection::diagnostics::impl_trait_overcapture_suggestion (cognitive 24): rustc_trait_selection::diagnostics::impl_trait_overcapture_suggestion has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (18 pts), loops 2 (3 pts), match/switch 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/diagnostics.rs"},"region":{"startLine":1961}}}],"partialFingerprints":{"codehealthFindingId/v1":"6097f01013e29fb7a893116b381ba3228b8f084b8d1bc8357ff361bf5c42bbd0"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_trait_selection::error_reporting::traits::to_pretty_impl_header (cognitive 24): rustc_trait_selection::error_reporting::traits::to_pretty_impl_header has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (20 pts), loops 3 (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":"compiler/rustc_trait_selection/src/error_reporting/traits/mod.rs"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"e00bcc1d80758ae82fa1fdeff38e09ba91c006ca77b7db356b90dbaacd4dd513"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_trait_selection::traits::effects::evaluate_host_effect_from_item_bounds (cognitive 24): rustc_trait_selection::traits::effects::evaluate_host_effect_from_item_bounds has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (21 pts), loops 2 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/traits/effects.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"25d0b8cc6636b024717db95b434ccfb37a24999831fa6e1bd253a86c876f21cd"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_trait_selection::traits::query::dropck_outlives::compute_dropck_outlives_with_errors (cognitive 24): rustc_trait_selection::traits::query::dropck_outlives::compute_dropck_outlives_with_errors has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (14 pts), match/switch 2 (7 pts), loops 2 (3 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/traits/query/dropck_outlives.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"920ff0cceeff36f6ecd99fa2712717df0e4b5cb387ecb286c9fab4b11949f5e4"}},{"ruleId":"D2","level":"warning","message":{"text":"libm::math::atan::atan (cognitive 24): libm::math::atan::atan has cognitive complexity 24 (threshold 15). Drivers by points: if/else 16 (24 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/compiler-builtins/libm/src/math/atan.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d368e6bcf9e60e7455c1282085d5be6caa1f456d7514ddd0e8c9507462c4734"}},{"ruleId":"D2","level":"warning","message":{"text":"libm::math::atanf::atanf (cognitive 24): libm::math::atanf::atanf has cognitive complexity 24 (threshold 15). Drivers by points: if/else 16 (24 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/compiler-builtins/libm/src/math/atanf.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a1ff278a601518b66d882ea07c103b4df749792cb02709200eac9d9193d6853"}},{"ruleId":"D2","level":"warning","message":{"text":"libm::math::generic::scalbn::scalbn (cognitive 24): libm::math::generic::scalbn::scalbn has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (24 pts) (nesting depth added 14). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/compiler-builtins/libm/src/math/generic/scalbn.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3e8949e043395c6a454d0c87b98de9a518ad23c3118ccbf36e39b0735b02782"}},{"ruleId":"D2","level":"warning","message":{"text":"libm::math::support::hex_float::parse_hex (cognitive 24): libm::math::support::hex_float::parse_hex has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 3 (7 pts), loops 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/compiler-builtins/libm/src/math/support/hex_float.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"42eee7858531a38a1a490094d58e267d4d6681ffa140ba2a6c12d407c793b0ae"}},{"ruleId":"D2","level":"warning","message":{"text":"core::slice::rotate::ptr_rotate_swap (cognitive 24): core::slice::rotate::ptr_rotate_swap has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 3 (7 pts), boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/slice/rotate.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed382e941b8a1d4ad9dd2ade0c9bb4c264bcb6a8ee57780f357b3758a77b33bd"}},{"ruleId":"D2","level":"warning","message":{"text":"Intrinsic::defer_to_existing_llvm_link (cognitive 24): Intrinsic::defer_to_existing_llvm_link has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (17 pts), match/switch 3 (7 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":"library/stdarch/crates/stdarch-gen-arm/src/intrinsic.rs"},"region":{"startLine":1549}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6be8e17ec74c72d92714b36fe995445a53ae3e2361c3d5ee02a348d3c41b87f"}},{"ruleId":"D2","level":"warning","message":{"text":"bootstrap::core::build_steps::compile::copy_self_contained_objects (cognitive 24): bootstrap::core::build_steps::compile::copy_self_contained_objects has cognitive complexity 24 (threshold 15). Drivers by points: loops 5 (13 pts), if/else 7 (10 pts), boolean chains 1 (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/build_steps/compile.rs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0d3954cb79e0ccaed2ff0d9f7e30cb95769b21e39c02131a78faa2239892e9e"}},{"ruleId":"D2","level":"warning","message":{"text":"bootstrap::core::build_steps::compile::std_cargo (cognitive 24): bootstrap::core::build_steps::compile::std_cargo has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 3, loops 1, match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/build_steps/compile.rs"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"056de630b02b9ebd914f66693bbadeb73248bb5331d742f04e7688472ae4c0eb"}},{"ruleId":"D2","level":"warning","message":{"text":"bootstrap::core::builder::cli_paths::match_paths_to_steps_and_run (cognitive 24): bootstrap::core::builder::cli_paths::match_paths_to_steps_and_run has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 6 (8 pts), boolean chains 4 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/builder/cli_paths.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f71559b897a59c73198ed5eca3aafc7efc39d9d43ef1a7d41c4e2c6f1391482"}},{"ruleId":"D2","level":"warning","message":{"text":"rustdoc::clean::clean_ty_generics_inner (cognitive 24): rustdoc::clean::clean_ty_generics_inner has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (17 pts), loops 2 (4 pts), match/switch 2, boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/clean/mod.rs"},"region":{"startLine":885}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a53a932f20ea924d38134187f27902c7f704e6d94012f296ee5d01c25925191"}},{"ruleId":"D2","level":"warning","message":{"text":"rustdoc::clean::clean_use_statement_leaf (cognitive 24): rustdoc::clean::clean_use_statement_leaf has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 7 (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/librustdoc/clean/mod.rs"},"region":{"startLine":3237}}}],"partialFingerprints":{"codehealthFindingId/v1":"785696600fb511b0205d4d317564a68cd75d37904b5fdc82cd35d79ae3167fc2"}},{"ruleId":"D2","level":"warning","message":{"text":"rustdoc::html::render::repr_attribute (cognitive 24): rustdoc::html::render::repr_attribute has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 5, match/switch 3 (5 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/render/mod.rs"},"region":{"startLine":3051}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cb2808b9468e6a4688783e6b7841cb6ccc1f282952dd992b1392615b6bc61e3"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_dev::main (cognitive 24): clippy_dev::main has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 6 (11 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_dev/src/main.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"866a107759f206dca6ea20dbf2e019bd284659298d62a06ed92eab950101bcf7"}},{"ruleId":"D2","level":"warning","message":{"text":"Loops::check_expr (cognitive 24): Loops::check_expr has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/loops/mod.rs"},"region":{"startLine":859}}}],"partialFingerprints":{"codehealthFindingId/v1":"9001a6f91db69a78bee0619c501481cb0677b6ce68ba94fcf145b22780e0f90f"}},{"ruleId":"D2","level":"warning","message":{"text":"MissingConstForFn::check_fn (cognitive 24): MissingConstForFn::check_fn has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 7, 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/tools/clippy/clippy_lints/src/missing_const_for_fn.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"98383e1daf451b34aacf4f50154c09fe22926218ed2ee6dbe468dfc46a196a9a"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::methods::unnecessary_filter_map::check (cognitive 24): clippy_lints::methods::unnecessary_filter_map::check has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (16 pts), match/switch 3 (5 pts), boolean chains 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/methods/unnecessary_filter_map.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"4978732393d280ca7f1cfbeae509e55a8f94e67234d554c2704cc3d9e6c9d50f"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::methods::unnecessary_literal_unwrap::check (cognitive 24): clippy_lints::methods::unnecessary_literal_unwrap::check has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (18 pts), match/switch 3 (4 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/tools/clippy/clippy_lints/src/methods/unnecessary_literal_unwrap.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"d40d6c912ca933aec98ccf628f574657c1d24b78e4c5b7c9b0c253ac98f49549"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::unit_return_expecting_ord::get_args_to_check (cognitive 24): clippy_lints::unit_return_expecting_ord::get_args_to_check has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (21 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/unit_return_expecting_ord.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c6850696695545b37aab6717af3767fdfd8354b2b74a9e85935016cf60f6179"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::unit_types::unit_cmp::check (cognitive 24): clippy_lints::unit_types::unit_cmp::check has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 2 (6 pts), boolean chains 3 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/unit_types/unit_cmp.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a0ca754527a3fec37f59db5b8edd08031df659e6c1fc7a71fc575e9eedbe437"}},{"ruleId":"D2","level":"warning","message":{"text":"TestCx::check_mir_dump (cognitive 24): TestCx::check_mir_dump has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 3 (5 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/compiletest/src/runtest/mir_opt.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"4910514ae9abc71e2fc400a94cee956377a0c30d2692173fec73ee199aa4d7c6"}},{"ruleId":"D2","level":"warning","message":{"text":"compiletest::runtest::compute_diff::make_diff (cognitive 24): compiletest::runtest::compute_diff::make_diff has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 3 (7 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/compiletest/src/runtest/compute_diff.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e3acf9c6858f0e415cc3c9c8542bda4b1b3f41eb28b3b099b46d976aa96feb0"}},{"ruleId":"D2","level":"warning","message":{"text":"coverage_dump::covfun::dump_covfun_mappings (cognitive 24): coverage_dump::covfun::dump_covfun_mappings has cognitive complexity 24 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 5 (10 pts), match/switch 1 (4 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/coverage-dump/src/covfun.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"73a79d0f8c0dc2c05df818e9f136c3a2f6bd28cd01d998606cf4170f53dc8b76"}},{"ruleId":"D2","level":"warning","message":{"text":"Checker::check_url (cognitive 24): Checker::check_url has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (13 pts), match/switch 4 (7 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/linkchecker/main.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"00919388786ca3624c6eb7283e610bd7a65481f3dc076c1057c49f020d422ce3"}},{"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/tools/miri/src/borrow_tracker/tree_borrows/diagnostics.rs"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"649aa9006bfc91cd3f47e0ea07f8e653953b3f6b7283e5f73b7d3be7cc38d115"}},{"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/tools/miri/src/shims/unix/socket.rs"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"437aa3e44137de8d291296237ce56c9991e09b97733ce47aa601a50b4cac8e99"}},{"ruleId":"D2","level":"warning","message":{"text":"hir::display::write_variants (cognitive 24): hir::display::write_variants has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (19 pts), match/switch 1 (3 pts), loops 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir/src/display.rs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"85ffd70aad34b0d286dcb7f0b90703e408d0b77f7fba78a2615b1ca67e59b577"}},{"ruleId":"D2","level":"warning","message":{"text":"ItemScope::dump (cognitive 24): ItemScope::dump has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (10 pts), match/switch 4 (9 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/item_scope.rs"},"region":{"startLine":751}}}],"partialFingerprints":{"codehealthFindingId/v1":"7729757345727c3575be3d4bc8f47f5aaf8300a274a6e82a2488c813d0d3a994"}},{"ruleId":"D2","level":"warning","message":{"text":"Resolver::rename_will_conflict_with_renamed (cognitive 24): Resolver::rename_will_conflict_with_renamed has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 2 (4 pts), match/switch 1 (2 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/tools/rust-analyzer/crates/hir-def/src/resolver.rs"},"region":{"startLine":846}}}],"partialFingerprints":{"codehealthFindingId/v1":"642151e2c301573468c3a95ecad17e1fd8efe24c7a497d6b2c0924ed04636646"}},{"ruleId":"D2","level":"warning","message":{"text":"hir_def::expr_store::pretty::print_where_clauses (cognitive 24): hir_def::expr_store::pretty::print_where_clauses has cognitive complexity 24 (threshold 15). Drivers by points: if/else 4 (14 pts), loops 2 (7 pts), match/switch 1 (3 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/expr_store/pretty.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"94677cd9afcadbba60b6fe5ce70ae558905bde132ac2b4e3f4779b2a79e9644a"}},{"ruleId":"D2","level":"warning","message":{"text":"hir_expand::builtin::fn_macro::concat_expand (cognitive 24): hir_expand::builtin::fn_macro::concat_expand has cognitive complexity 24 (threshold 15). Drivers by points: match/switch 5 (12 pts), if/else 2 (6 pts), boolean chains 5, loops 1 (nesting depth added 11). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-expand/src/builtin/fn_macro.rs"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"618bc586e011f632896c02a953c4091163bd60568d8632e363971a2db9fcb11d"}},{"ruleId":"D2","level":"warning","message":{"text":"InferenceContext::infer_mut_expr (cognitive 24): InferenceContext::infer_mut_expr has cognitive complexity 24 (threshold 15). Drivers by points: match/switch 3 (12 pts), if/else 3 (10 pts), loops 1 (2 pts) (nesting depth added 17). 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/tools/rust-analyzer/crates/hir-ty/src/infer/mutability.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"7443ec2deea7567189dbc2fba07c3fd919579a75669abc011fc0593049ed270d"}},{"ruleId":"D2","level":"warning","message":{"text":"ide::file_structure::structure_node (cognitive 24): ide::file_structure::structure_node has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (20 pts), match/switch 2 (3 pts), loops 1 (nesting depth added 10). Of this number, 17 points are the body\u0027s own statements and 7 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/tools/rust-analyzer/crates/ide/src/file_structure.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"59dd6c5ec7db1778bd53b10e2b7b48aeff8c17447ab0ec3dcc1a4ec4fe268370"}},{"ruleId":"D2","level":"warning","message":{"text":"ide::hover::render::literal (cognitive 24): ide::hover::render::literal has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (12 pts), match/switch 7 (12 pts) (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/hover/render.rs"},"region":{"startLine":849}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a70b1c6715d017364a0cc0562fd2a5995c0a01c994e9f0187eaec7c2a41976f"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_assists::handlers::wrap_unwrap_cfg_attr::attempt_get_derive (cognitive 24): ide_assists::handlers::wrap_unwrap_cfg_attr::attempt_get_derive has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 5, loops 2 (4 pts), match/switch 1 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/wrap_unwrap_cfg_attr.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7f508d392ab5991ab8e1b0806897957d06352cede4d2b06b7bf84b3a348b5ad"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_db::rename::source_edit_from_name_ref (cognitive 24): ide_db::rename::source_edit_from_name_ref has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (18 pts), match/switch 2 (4 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-db/src/rename.rs"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac404054f38166884044f693ac21032ae91b5dc886539b7df23787fabfeac902"}},{"ruleId":"D2","level":"warning","message":{"text":"parser::grammar::expressions::expr_bp (cognitive 24): parser::grammar::expressions::expr_bp has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 5, match/switch 2 (3 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/parser/src/grammar/expressions.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0a7c824c52830c50021f1bb1f9cc680e5459afd7e5696397d871cf8850b5a14"}},{"ruleId":"D2","level":"warning","message":{"text":"NotifyActor::load_entry (cognitive 24): NotifyActor::load_entry has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 5, loops 1 (2 pts), match/switch 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/vfs-notify/src/lib.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"a543918ef4cd647dd5f069d3075f0c1d0c347d68e02e5e2d3d26734ca7ffb8dc"}},{"ruleId":"D2","level":"warning","message":{"text":"rustfmt_nightly::parse::macros::cfg_if::parse_cfg_if_inner (cognitive 24): rustfmt_nightly::parse::macros::cfg_if::parse_cfg_if_inner has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 2 (3 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/parse/macros/cfg_if.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"13ea1469bfe8af12adb71b63813edf286d006c8aac706d1c61e2d36b3a67bfed"}},{"ruleId":"D2","level":"warning","message":{"text":"rustfmt_nightly::rustfmt_diff::make_diff (cognitive 24): rustfmt_nightly::rustfmt_diff::make_diff has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 3 (7 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/rustfmt_diff.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"87af06eea8e166518dc02ebb7c43276aa6c719e1306a3a04a5a898141e8f2cd3"}},{"ruleId":"D2","level":"warning","message":{"text":"tidy::features::check (cognitive 24): tidy::features::check has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 5, match/switch 2 (4 pts), loops 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/tidy/src/features.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a2dd8b48938ab61ba835332693451a0889e5890be82345f7446543ce5fae9e9"}},{"ruleId":"D2","level":"warning","message":{"text":"publish_toolstate.update_latest (cognitive 24): publish_toolstate.update_latest has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (12 pts), error handling 3 (9 pts), loops 2 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/publish_toolstate.py"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e89e276afa35f49aa8e32f59882c00bae7b0c42bb5e2a3c07fe2afa88ec34e2"}},{"ruleId":"D2","level":"warning","message":{"text":"config.substituteVariablesInEnv (cognitive 24): config.substituteVariablesInEnv has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 5 (7 pts), boolean chains 3 (nesting depth added 9). Of this number, 18 points are the body\u0027s own statements and 6 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/editors/code/src/config.ts"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"c291f94ffa57e7c44f8c65d3eb29611e210a5fda65d948edd79e2f0d882d1b69"}},{"ruleId":"D2","level":"warning","message":{"text":"bootstrap.getServer (cognitive 24): bootstrap.getServer has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 2 (5 pts), boolean chains 1, ternaries 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/tools/rust-analyzer/editors/code/src/bootstrap.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"619bf1650d84d06138d16aae4bfd45bf4fd68ae4c080e83c1816f0593115a6f9"}},{"ruleId":"D2","level":"warning","message":{"text":"initSearch::getRow (cognitive 24): initSearch::getRow has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 16, boolean chains 7, if/else 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/librustdoc/html/static/js/search.js"},"region":{"startLine":1930}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0cf74764b8db155022517a815218c4e0706688f9d24fcd1e2e1133ed1cac567"}},{"ruleId":"D2","level":"warning","message":{"text":"MirBorrowckCtxt::visit_after_early_terminator_effect (cognitive 23): MirBorrowckCtxt::visit_after_early_terminator_effect has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 3 (6 pts), match/switch 2 (4 pts) (nesting depth added 13). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/lib.rs"},"region":{"startLine":882}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef5fae7332ede51e497a71b2c55c1ebd3e113ca3dcf549b6f53840bb80fd51d7"}},{"ruleId":"D2","level":"warning","message":{"text":"MirBorrowckCtxt::check_movable_place (cognitive 23): MirBorrowckCtxt::check_movable_place has cognitive complexity 23 (threshold 15). Drivers by points: match/switch 5 (14 pts), if/else 2 (8 pts), loops 1 (nesting depth added 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. 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":"compiler/rustc_borrowck/src/lib.rs"},"region":{"startLine":1899}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbc11499f7ccce6afa3233abb53f432b4e01aa42cf2a2e6ed79734a436fcbf4f"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeChecker::check_iscleanup (cognitive 23): TypeChecker::check_iscleanup has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 2 (4 pts), match/switch 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":"compiler/rustc_borrowck/src/type_check/mod.rs"},"region":{"startLine":2081}}}],"partialFingerprints":{"codehealthFindingId/v1":"19078c2963b45b58aeda2a0cab45f0e12faad0a1728730d2bc0d8a7423d36149"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_borrowck::polonius::legacy::emit_move_facts (cognitive 23): rustc_borrowck::polonius::legacy::emit_move_facts has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 4 (7 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/polonius/legacy/mod.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"1322c24564c2993b431d939e04c5032324946a32ceadbdd5ffd4431725038e77"}},{"ruleId":"D2","level":"warning","message":{"text":"CollectProcMacros::visit_item (cognitive 23): CollectProcMacros::visit_item has cognitive complexity 23 (threshold 15). Drivers by points: if/else 14 (21 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_builtin_macros/src/proc_macro_harness.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3a8ac8d87841446ea3bb5ec15d2d65f1db04bb5daec11501f2310740580e1d5"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_codegen_llvm::asm::llvm_fixup_input (cognitive 23): rustc_codegen_llvm::asm::llvm_fixup_input has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (14 pts), match/switch 3 (5 pts), boolean chains 4 (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":"compiler/rustc_codegen_llvm/src/asm.rs"},"region":{"startLine":1171}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e27c2d4f258558bf507091783f064d2a9343fe730f3e80891b01fcd04706cc7"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_codegen_llvm::asm::llvm_fixup_output (cognitive 23): rustc_codegen_llvm::asm::llvm_fixup_output has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (14 pts), match/switch 3 (5 pts), boolean chains 4 (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":"compiler/rustc_codegen_llvm/src/asm.rs"},"region":{"startLine":1374}}}],"partialFingerprints":{"codehealthFindingId/v1":"c19fbf48b1a44637df9b7ee4bfc0bf15fa0b20f8bb48541b932eaf224c207ccd"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_codegen_llvm::attributes::sanitize_attrs (cognitive 23): rustc_codegen_llvm::attributes::sanitize_attrs has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 2, 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":"compiler/rustc_codegen_llvm/src/attributes.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9b2a18c3f16dfab707a91ba38074a6cb71e0f9af7b10644242645f7615acb4b"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_codegen_ssa::back::link::print_native_static_libs (cognitive 23): rustc_codegen_ssa::back::link::print_native_static_libs has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (19 pts), match/switch 2, boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/back/link.rs"},"region":{"startLine":2017}}}],"partialFingerprints":{"codehealthFindingId/v1":"1290b2c7f0958b22b97d3b7372eb6b3c31262bf2ca714f4e33ff4cd7110e66ef"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_codegen_ssa::mir::codegen_mir (cognitive 23): rustc_codegen_ssa::mir::codegen_mir has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 3, loops 3, match/switch 1 (2 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"compiler/rustc_codegen_ssa/src/mir/mod.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"51655604599df9fbeb0406878c6d32f40d5103109a9172374ed90f0c1a372121"}},{"ruleId":"D2","level":"warning","message":{"text":"Emitter::render_multispan_macro_backtrace (cognitive 23): Emitter::render_multispan_macro_backtrace has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 3 (4 pts), match/switch 1 (4 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_errors/src/emitter.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"26f4b78b66b1a5c4dfb1fda22a8d60f71437db1d35225ae260c8861d2d83ec89"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_hir_analysis::check::region::resolve_local::record_rvalue_scope_if_borrow_expr (cognitive 23): rustc_hir_analysis::check::region::resolve_local::record_rvalue_scope_if_borrow_expr has cognitive complexity 23 (threshold 15). Drivers by points: loops 5 (11 pts), if/else 4 (9 pts), boolean chains 2, match/switch 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":"compiler/rustc_hir_analysis/src/check/region.rs"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9db845190c1833fed5defcb8607f402cf0321ea810b58b090f13100aef001a4"}},{"ruleId":"D2","level":"warning","message":{"text":"CastCheck::do_check (cognitive 23): CastCheck::do_check has cognitive complexity 23 (threshold 15). Drivers by points: if/else 4 (11 pts), match/switch 5 (11 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/cast.rs"},"region":{"startLine":933}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8f0ceb9f305ef08cd55e3338a17fb6d6969e4657a99afe3a5078be4d9b12bbd"}},{"ruleId":"D2","level":"warning","message":{"text":"ExprUseVisitor::cat_pattern (cognitive 23): ExprUseVisitor::cat_pattern has cognitive complexity 23 (threshold 15). Drivers by points: loops 7 (13 pts), match/switch 3 (6 pts), if/else 2 (4 pts) (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/expr_use_visitor.rs"},"region":{"startLine":1590}}}],"partialFingerprints":{"codehealthFindingId/v1":"83d4924143c2c9c4f519730a844ce3e6431ea5da7250962806ef7efcaed8753f"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCallDiagCtxt::check_wrap_args_in_tuple (cognitive 23): FnCallDiagCtxt::check_wrap_args_in_tuple has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 1 (3 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/fn_ctxt/checks.rs"},"region":{"startLine":2350}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c34b4623758522023a33104238f13b50da3d4b2e8dfcb5bea3137401a2b1c26"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::report_unexpected_variant_res (cognitive 23): FnCtxt::report_unexpected_variant_res has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (18 pts), match/switch 3 (4 pts), boolean chains 1 (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/lib.rs"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce3b5637da09b1bd7708a027fa46b6ffce817d4e110559db39e03655c6635515"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::check_user_unop (cognitive 23): FnCtxt::check_user_unop has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (15 pts), match/switch 2 (4 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 13). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/op.rs"},"region":{"startLine":961}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4b439db6c3d0176c8a05bc6e4cb28d09b49775ff3a57d9ddd66d85ba0f034ba"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::check_pat_inner (cognitive 23): FnCtxt::check_pat_inner has cognitive complexity 23 (threshold 15). Drivers by points: loops 3 (8 pts), match/switch 4 (7 pts), boolean chains 5, if/else 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/pat.rs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"877a0b21afc5de758d4e1fabd1895295f4fdb932832a398c0c9269b912050c64"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::check_pat_ident (cognitive 23): FnCtxt::check_pat_ident has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (14 pts), match/switch 3 (5 pts), boolean chains 4 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/pat.rs"},"region":{"startLine":1167}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf798f075e9f7788d3c63bd82ee37c6586769ba7de0cd8a804c38ce42a355b75"}},{"ruleId":"D2","level":"warning","message":{"text":"InlineAsmCtxt::get_asm_ty (cognitive 23): InlineAsmCtxt::get_asm_ty has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 6 (9 pts) (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/inline_asm.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"7987b01e0873f69f7c53cf2780cbd17eed50acc0301632e8e6dfefd66c02f99d"}},{"ruleId":"D2","level":"warning","message":{"text":"WritebackCx::fix_scalar_builtin_expr (cognitive 23): WritebackCx::fix_scalar_builtin_expr has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (20 pts), boolean chains 2, match/switch 1 (nesting depth added 13). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/writeback.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8966511b875590cf3f3fd4576a10aba7a93274c9c28529a207f12d3cced3180"}},{"ruleId":"D2","level":"warning","message":{"text":"Resolver::ambiguity_diagnostic (cognitive 23): Resolver::ambiguity_diagnostic has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 7 (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":"compiler/rustc_resolve/src/diagnostics/impls.rs"},"region":{"startLine":2453}}}],"partialFingerprints":{"codehealthFindingId/v1":"84da8a2faef9a60ad17965c9626bca8a88c815e9d4cfcfa2e107273a838e13fb"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_incremental::persist::load::load_dep_graph (cognitive 23): rustc_incremental::persist::load::load_dep_graph has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 1 (2 pts), boolean chains 1, match/switch 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_incremental/src/persist/load.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"927ff35b76eb0de11be4fb8c06e7300552a4ea5c5ded41d7e06a1bfd3f10eab0"}},{"ruleId":"D2","level":"warning","message":{"text":"IntervalSet::insert_range (cognitive 23): IntervalSet::insert_range has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (23 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":"compiler/rustc_index/src/interval.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c004d50523e0247d3f60d81fced7e107364fd6bf0746bc9704f20b5dc3ab46f"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_lint::types::literal::lint_uint_literal (cognitive 23): rustc_lint::types::literal::lint_uint_literal has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (18 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 12). 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":"compiler/rustc_lint/src/types/literal.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"1771dd738e339dc492ebde9673ac067d694e3d03767228301798bdbd6f01b306"}},{"ruleId":"D2","level":"warning","message":{"text":"Printer::default_print_def_path (cognitive 23): Printer::default_print_def_path has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 4, match/switch 2 (4 pts) (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/ty/print/mod.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"df8f2b5e386c7032ef3f3f0fcda9ec340f1f1b4188b2a898970ae4089f18c679"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_middle::ty::significant_drop_order::true_significant_drop_ty (cognitive 23): rustc_middle::ty::significant_drop_order::true_significant_drop_ty has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 2 (5 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/ty/significant_drop_order.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae05330ac03e171b8ebcb39f68d1e4f5dc5e187cad969361b5b378956ddad91e"}},{"ruleId":"D2","level":"warning","message":{"text":"Builder::build_exit_tree (cognitive 23): Builder::build_exit_tree has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 2 (6 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_build/src/builder/scope.rs"},"region":{"startLine":1959}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7fcdb3cbfef7e7c51ee9e2aa3a6a4b37e7bcd3271deca7f697b9ddb24ad3a94"}},{"ruleId":"D2","level":"warning","message":{"text":"VnState::project (cognitive 23): VnState::project has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 3 (5 pts), boolean chains 3 (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/gvn.rs"},"region":{"startLine":822}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0b176cb008d25857f5ff0f848df58a1369853b884217feef8c0608aadd2e7b2"}},{"ruleId":"D2","level":"warning","message":{"text":"NormalInliner::check_callee_mir_body (cognitive 23): NormalInliner::check_callee_mir_body has cognitive complexity 23 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 4, loops 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/inline.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"92f02f9bffca6817b2c3ce6d15cc6cdd66bd519ba999a3290b04eba6ddc3784a"}},{"ruleId":"D2","level":"warning","message":{"text":"CfgSimplifier::simplify (cognitive 23): CfgSimplifier::simplify has cognitive complexity 23 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 4 (10 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/simplify.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc9fc9618f0092cadc00ddc73cda25e5d195f06721a489f9a1dc7b1229ef0679"}},{"ruleId":"D2","level":"warning","message":{"text":"RangeSet::visit_terminator (cognitive 23): RangeSet::visit_terminator has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 4, loops 2 (4 pts), match/switch 1 (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/ssa_range_prop.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"034a3ccefaa96c965f3f0eed78ad0d593763469a25a2fac3a36388d937bc01dd"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_mir_transform::inline::cycle::process (cognitive 23): rustc_mir_transform::inline::cycle::process has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (22 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/inline/cycle.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0f0ceb0a8ec4b2c3ec26be230225f6436fe0d76cee0c1a5fa00951040641c49"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_mir_transform::shim::build_call_shim (cognitive 23): rustc_mir_transform::shim::build_call_shim has cognitive complexity 23 (threshold 15). Drivers by points: if/else 16, match/switch 4 (7 pts) (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/shim.rs"},"region":{"startLine":781}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ac9cf8cff7d7f2359ebac674f3b76e8ffe2c1d7950b77ae2ee77a461ba31c5d"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_monomorphize::mono_checks::abi_check::do_check_simd_vector_abi (cognitive 23): rustc_monomorphize::mono_checks::abi_check::do_check_simd_vector_abi has cognitive complexity 23 (threshold 15). Drivers by points: if/else 4 (10 pts), match/switch 3 (8 pts), boolean chains 4, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_monomorphize/src/mono_checks/abi_check.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"d96a35c9bc0199d66db7a7c8c42b726b1843403e7f522db43ff135be597831c2"}},{"ruleId":"D2","level":"warning","message":{"text":"EvalCtxt::evaluate_goal_raw (cognitive 23): EvalCtxt::evaluate_goal_raw has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (11 pts), match/switch 6 (10 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_next_trait_solver/src/solve/eval_ctxt/mod.rs"},"region":{"startLine":800}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed38299fe02bbd459e6ba39dc609215030303a99eccfbc0ffc675db117d660c4"}},{"ruleId":"D2","level":"warning","message":{"text":"EvalCtxt::evaluate_const (cognitive 23): EvalCtxt::evaluate_const has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (13 pts), match/switch 4 (7 pts), boolean chains 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_next_trait_solver/src/solve/eval_ctxt/mod.rs"},"region":{"startLine":1550}}}],"partialFingerprints":{"codehealthFindingId/v1":"81fb97942f2bc7ec248e99eeaa0c3febbd751f5cc78fdd8daa2ad68540a16279"}},{"ruleId":"D2","level":"warning","message":{"text":"EvalCtxt::consider_builtin_upcast_to_principal (cognitive 23): EvalCtxt::consider_builtin_upcast_to_principal has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (16 pts), loops 2 (4 pts), match/switch 2 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_next_trait_solver/src/solve/trait_goals.rs"},"region":{"startLine":1140}}}],"partialFingerprints":{"codehealthFindingId/v1":"0615ccebf0fb3540c80c5ea81ceb3696368e16b66a1adaab943bee8f36f347a5"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_next_trait_solver::solve::assembly::structural_traits::extract_tupled_inputs_and_output_from_async_callable (cognitive 23): rustc_next_trait_solver::solve::assembly::structural_traits::extract_tupled_inputs_and_output_from_async_callable has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (20 pts), boolean chains 2, match/switch 1 (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_next_trait_solver/src/solve/assembly/structural_traits.rs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ea1037d5bbfb0e6581c378edc4990b334a7ee21ea34885e3a8216d68173bb65"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_parse::new_parser_from_file (cognitive 23): rustc_parse::new_parser_from_file has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (18 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 12). 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":"compiler/rustc_parse/src/lib.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fb642bc6ee6a1dd421fef17266b71c2cdeee7c25b49bfc3a8f813b6293fbc10"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_floating_field_access (cognitive 23): Parser::parse_floating_field_access has cognitive complexity 23 (threshold 15). Drivers by points: match/switch 3 (11 pts), if/else 4 (8 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 13). 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":"compiler/rustc_parse/src/parser/expr.rs"},"region":{"startLine":926}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7c4b9bdcb3ed0bb60c352547dc27c8aeb338ad0b4d8b67854bdbeea38ed0269"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_mod (cognitive 23): Parser::parse_mod has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/item.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc60564447d9dc4c8cc6c1eef653ac44cbef3b226ad6e17159bc2c5b759f1111"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_trait_bound (cognitive 23): Parser::parse_trait_bound has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (14 pts), match/switch 2 (5 pts), boolean chains 4 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/ty.rs"},"region":{"startLine":1412}}}],"partialFingerprints":{"codehealthFindingId/v1":"aac355024da803e62b316eec1f609c0a2f4153b1fe3fa1b07682d827bd20b913"}},{"ruleId":"D2","level":"warning","message":{"text":"LateResolutionVisitor::resolve_item (cognitive 23): LateResolutionVisitor::resolve_item has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (17 pts), match/switch 3 (4 pts), boolean chains 2 (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":"compiler/rustc_resolve/src/late.rs"},"region":{"startLine":2981}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8eaca69fc7699f14c9ad14ace3ac58551f81d83e28dd2d7e9f5bb16ee63761c"}},{"ruleId":"D2","level":"warning","message":{"text":"LateResolutionVisitor::compute_and_check_or_pat_binding_map (cognitive 23): LateResolutionVisitor::compute_and_check_or_pat_binding_map has cognitive complexity 23 (threshold 15). Drivers by points: loops 6 (10 pts), if/else 4 (9 pts), match/switch 1 (4 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":"compiler/rustc_resolve/src/late.rs"},"region":{"startLine":4400}}}],"partialFingerprints":{"codehealthFindingId/v1":"2386296f68b47ebe0268fe9ab6cee0aab77bd70d37487b09509f0f63de2d628c"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_session::utils::extra_compiler_flags (cognitive 23): rustc_session::utils::extra_compiler_flags has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (18 pts), match/switch 1 (4 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_session/src/utils.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"368f15d566df35d8b8a658c536767ee8e4d6ee2132ce4aa2d60d3f6bcb51cf6b"}},{"ruleId":"D2","level":"warning","message":{"text":"FnAbi::adjust_for_foreign_abi (cognitive 23): FnAbi::adjust_for_foreign_abi has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (17 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":"compiler/rustc_target/src/callconv/mod.rs"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b242cbcf02bba7ebb9b2007a70fd7316a7488b8feedf7048a60c18e87aa4874"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeErrCtxt::maybe_detailed_projection_msg (cognitive 23): TypeErrCtxt::maybe_detailed_projection_msg has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (11 pts), match/switch 3 (11 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":"compiler/rustc_trait_selection/src/error_reporting/traits/fulfillment_errors.rs"},"region":{"startLine":2064}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e9400d1d6475d1eb3cf29892efe2931f6e41ffe8dccc9645d3c3e329fa0104b"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_trait_selection::traits::outlives_for_liveness::live_args_for_outlives_clause (cognitive 23): rustc_trait_selection::traits::outlives_for_liveness::live_args_for_outlives_clause has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 3 (5 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/traits/outlives_for_liveness.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"533f1e9e5d85c066626f6a857f8cf6b436acc7e4712985fbf4db2be8eb97c905"}},{"ruleId":"D2","level":"warning","message":{"text":"symcheck::check_elf_exe_stack (cognitive 23): symcheck::check_elf_exe_stack has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (16 pts), loops 3 (5 pts), match/switch 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/compiler-builtins/crates/symcheck/src/main.rs"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"f482459b682ace1a4e07712ccd09eceb94bd5eb57f581910fd66be7406746687"}},{"ruleId":"D2","level":"warning","message":{"text":"libm::math::cosf::cosf (cognitive 23): libm::math::cosf::cosf has cognitive complexity 23 (threshold 15). Drivers by points: if/else 15 (22 pts), 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":"library/compiler-builtins/libm/src/math/cosf.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6fc4e30c41c11f88fede82efcb3b4a6ad30b78acd6d6c1eccbe53371d82cdf8"}},{"ruleId":"D2","level":"warning","message":{"text":"libm::math::log1p::log1p (cognitive 23): libm::math::log1p::log1p has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (22 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/compiler-builtins/libm/src/math/log1p.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"81d89c3ce8f350139c83d44478f476ea74f78647f9cdf5ed730f74aaeae6c68e"}},{"ruleId":"D2","level":"warning","message":{"text":"libm::math::log1pf::log1pf (cognitive 23): libm::math::log1pf::log1pf has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (22 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/compiler-builtins/libm/src/math/log1pf.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"029679eca02c6f7f445470bb5bf4b64dec002b7af3090bd884be1924f0b63373"}},{"ruleId":"D2","level":"warning","message":{"text":"core::str::pattern::simd_contains (cognitive 23): core::str::pattern::simd_contains has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 5 (7 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/str/pattern.rs"},"region":{"startLine":1941}}}],"partialFingerprints":{"codehealthFindingId/v1":"4235ddc7e689c4369297148d4c4a53b657ac4dbee32efba7900181cfc65ab286"}},{"ruleId":"D2","level":"warning","message":{"text":"stdarch_gen_arm::fn_suffix::make_neon_suffix (cognitive 23): stdarch_gen_arm::fn_suffix::make_neon_suffix has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (20 pts), match/switch 2 (3 pts) (nesting depth added 12). 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":"library/stdarch/crates/stdarch-gen-arm/src/fn_suffix.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"7689f12f89c5c3da54c274cc8a10846aeef9febf79f516b7039b786577003f4d"}},{"ruleId":"D2","level":"warning","message":{"text":"bootstrap::core::build_steps::compile::rustc_cargo_env (cognitive 23): bootstrap::core::build_steps::compile::rustc_cargo_env has cognitive complexity 23 (threshold 15). Drivers by points: if/else 16 (18 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/build_steps/compile.rs"},"region":{"startLine":1315}}}],"partialFingerprints":{"codehealthFindingId/v1":"f524b606c4af2ab3b43a27a0ceed2712e27d19ed0b02ccf0a6eb42b085532fbc"}},{"ruleId":"D2","level":"warning","message":{"text":"LinkCollector::resolve_ambiguities (cognitive 23): LinkCollector::resolve_ambiguities has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (14 pts), match/switch 2 (6 pts), loops 2 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/passes/collect_intra_doc_links.rs"},"region":{"startLine":1309}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bf96e3793d000c1d93554452038f98b740c3c0698c48ce6991d040022cec4d6"}},{"ruleId":"D2","level":"warning","message":{"text":"rustdoc::html::format::primitive_link_fragment (cognitive 23): rustdoc::html::format::primitive_link_fragment has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 2 (5 pts), loops 1 (4 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/format.rs"},"region":{"startLine":975}}}],"partialFingerprints":{"codehealthFindingId/v1":"ced5e9fa30a62203ff3105d30217558f042e9a4da777e0ab1afa42dbeba063df"}},{"ruleId":"D2","level":"warning","message":{"text":"rustdoc::passes::lint::redundant_explicit_links::check_redundant_explicit_link (cognitive 23): rustdoc::passes::lint::redundant_explicit_links::check_redundant_explicit_link has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (19 pts), match/switch 1 (3 pts), loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/passes/lint/redundant_explicit_links.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"60b7eca18044dbbb36f87875667bb71709d6c65a6008286044bb525f25112240"}},{"ruleId":"D2","level":"warning","message":{"text":"LegacyNumericConstants::check_use_tree (cognitive 23): LegacyNumericConstants::check_use_tree has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 3, loops 1 (2 pts), 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/tools/clippy/clippy_lints/src/legacy_numeric_constants.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8d2b071a104ff38a21c193c1294a9bac766eb8a42cf5fa6ea90ccfdd22c9811"}},{"ruleId":"D2","level":"warning","message":{"text":"NonCanonicalImpls::check_item (cognitive 23): NonCanonicalImpls::check_item has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 4, loops 1 (4 pts), match/switch 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/non_canonical_impls.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"616134382024846e9c72d495eac9ffbcb7c505614c1492b0574e7c46ec4af9ed"}},{"ruleId":"D2","level":"warning","message":{"text":"NonSendFieldInSendTy::check_item (cognitive 23): NonSendFieldInSendTy::check_item has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 3 (8 pts), match/switch 1 (4 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/non_send_fields_in_send_ty.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"0824be97c1dbe4190726fe5ad14e7adf7e02a0eda189ac216ffbb81836c2326e"}},{"ruleId":"D2","level":"warning","message":{"text":"UnwrappableVariablesVisitor::visit_expr (cognitive 23): UnwrappableVariablesVisitor::visit_expr has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (22 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/tools/clippy/clippy_lints/src/unwrap.rs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e209a8c5ae81c0009265ad4d7d9c23c7b5e3d6e0513a2d50b96cc89c6f145f6"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::doc::too_long_first_doc_paragraph::check (cognitive 23): clippy_lints::doc::too_long_first_doc_paragraph::check has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 4, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/doc/too_long_first_doc_paragraph.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"86209aad300b3d9a717b500bd03091dfaba881019fd0ec1908a9b82f209eb2fc"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::infinite_iter::complete_infinite_iter (cognitive 23): clippy_lints::infinite_iter::complete_infinite_iter has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 2 (4 pts), boolean chains 3, match/switch 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/tools/clippy/clippy_lints/src/infinite_iter.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb59e2136a6cf6d91f48b123cb6f7fa86f61cf0c46b8cca30b8ccfb7154887d1"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::literals::decimal_literal_representation::check_text (cognitive 23): clippy_lints::literals::decimal_literal_representation::check_text has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 14, if/else 6 (9 pts) (nesting depth added 3). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/literals/decimal_literal_representation.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d03d698a0f08fe7654b852545db8b24299246fcb3aaab482c8d00c9e05cda8c"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::matches::redundant_pattern_match::find_method_and_type (cognitive 23): clippy_lints::matches::redundant_pattern_match::find_method_and_type has cognitive complexity 23 (threshold 15). Drivers by points: if/else 14 (20 pts), boolean chains 2, 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/tools/clippy/clippy_lints/src/matches/redundant_pattern_match.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d3570d3ab4d68fc003eb2ee0af41b665353126b532885c7aa7075fe9008b96e"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::methods::chunks_exact_to_as_chunks::check (cognitive 23): clippy_lints::methods::chunks_exact_to_as_chunks::check has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 4, match/switch 1 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/methods/chunks_exact_to_as_chunks.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc30ef450acab4694faaa5dc961281ffce3c42fda3fbedf8e0fef7662b1d667a"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::transmute::transmute_ptr_to_ref::check (cognitive 23): clippy_lints::transmute::transmute_ptr_to_ref::check has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (20 pts), match/switch 2 (3 pts) (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/transmute/transmute_ptr_to_ref.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ff6fba82773a763f8c8a2359a0a6fc7a09b63eada8c51d55208f10ab901f13c"}},{"ruleId":"D2","level":"warning","message":{"text":"SpanlessHash::hash_pat (cognitive 23): SpanlessHash::hash_pat has cognitive complexity 23 (threshold 15). Drivers by points: loops 6 (12 pts), if/else 5 (10 pts), match/switch 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/tools/clippy/clippy_utils/src/hir_utils.rs"},"region":{"startLine":1461}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1a1b8847b51b850409c39ef1f4e45a617adea150a70003950ceb3528b9f066d"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_utils::ty::contains_ty_adt_constructor_opaque::contains_ty_adt_constructor_opaque_inner (cognitive 23): clippy_utils::ty::contains_ty_adt_constructor_opaque::contains_ty_adt_constructor_opaque_inner has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (14 pts), match/switch 2 (5 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 14). 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/tools/clippy/clippy_utils/src/ty/mod.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7df102962de78a6914c244983f549232d811da3764fbf8bbc8cfb67e163b6de"}},{"ruleId":"D2","level":"warning","message":{"text":"TestCx::show_diff (cognitive 23): TestCx::show_diff has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 4 (7 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/compiletest/src/runtest.rs"},"region":{"startLine":2984}}}],"partialFingerprints":{"codehealthFindingId/v1":"f727c2f9e81a8b9fe5ae7b2a48c4c72a1069b05a3a57012668b1d1c441b29b1b"}},{"ruleId":"D2","level":"warning","message":{"text":"generate_copyright::cargo_metadata::load_important_files (cognitive 23): generate_copyright::cargo_metadata::load_important_files has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 3 (7 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/generate-copyright/src/cargo_metadata.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"70a2729c44b261e5bf92d9043300c0267ff509d0347735686540d672419cf83e"}},{"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/tools/miri/src/borrow_tracker/tree_borrows/mod.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"586b2f6618fb6a206a0fb8ef518dc2d02475bcdd0933ab795c4dbd6ac6b94031"}},{"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/tools/miri/src/data_structures/dedup_range_map.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"55b18c26c20f6ace48afbf5e1fefab2e9c02bfa41f39a5fe7bb0b0889ccbfe33"}},{"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/tools/miri/src/intrinsics/x86/bmi.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ae757c554c6c765456b511f845b4904c0a33b1a9ecaf0df237c59067d1d5ebc"}},{"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/tools/miri/src/machine.rs"},"region":{"startLine":1463}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f44dd9fddd629897ad3ff5c9f54bc7e2e8aee335fcb8bc53221d6252c2911e6"}},{"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/tools/miri/src/shims/unix/fd.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bee450fffbadc028901e7a67fc724e6c0757f44edb9badac0e1439d70f1384c"}},{"ruleId":"D2","level":"warning","message":{"text":"Expr::gen_source_code (cognitive 23): Expr::gen_source_code has cognitive complexity 23 (threshold 15). Drivers by points: match/switch 8 (17 pts), if/else 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/tools/rust-analyzer/crates/hir/src/term_search/expr.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"12db936cf152ec1fa3c1b40b415cddd68b54ec4b347d7133db0fdd0689685f99"}},{"ruleId":"D2","level":"warning","message":{"text":"hir::term_search::tactics::data_constructor (cognitive 23): hir::term_search::tactics::data_constructor has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (20 pts), boolean chains 2, match/switch 1 (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir/src/term_search/tactics.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8380d5d5c32ed22a7905b2548b8f5fd4707fbc63d3630a27295fb73f2d05f43"}},{"ruleId":"D2","level":"warning","message":{"text":"hir_def::lang_item::crate_lang_items (cognitive 23): hir_def::lang_item::crate_lang_items has cognitive complexity 23 (threshold 15). Drivers by points: match/switch 3 (11 pts), loops 4 (8 pts), if/else 4 (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/tools/rust-analyzer/crates/hir-def/src/lang_item.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"876c55948484282436fc4a3d0ad8df7c32e7ac5bb9bb7bfb2b0af3b82bce371d"}},{"ruleId":"D2","level":"warning","message":{"text":"ExprUseVisitor::cat_pattern (cognitive 23): ExprUseVisitor::cat_pattern has cognitive complexity 23 (threshold 15). Drivers by points: loops 7 (13 pts), match/switch 3 (6 pts), if/else 2 (4 pts) (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/infer/closure/analysis/expr_use_visitor.rs"},"region":{"startLine":1496}}}],"partialFingerprints":{"codehealthFindingId/v1":"3659c61ccac6abd8391974a281ad9274e6c5df95ce12472098a58209fbe08b07"}},{"ruleId":"D2","level":"warning","message":{"text":"ide::syntax_highlighting::highlight::highlight_name_ref_by_syntax (cognitive 23): ide::syntax_highlighting::highlight::highlight_name_ref_by_syntax has cognitive complexity 23 (threshold 15). Drivers by points: match/switch 7 (13 pts), if/else 6 (10 pts) (nesting depth added 10). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/syntax_highlighting/highlight.rs"},"region":{"startLine":792}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b5cb542ae9b37c05177068f10db032c05b170a35f4c844dd380486a3b20c53e"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_assists::handlers::extract_function::make_body (cognitive 23): ide_assists::handlers::extract_function::make_body has cognitive complexity 23 (threshold 15). Drivers by points: match/switch 11 (23 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/tools/rust-analyzer/crates/ide-assists/src/handlers/extract_function.rs"},"region":{"startLine":1800}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c5c6420ae8a0c636b129694d2fb33470b2fe5151a8bf881ec825e33dd316b55"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_assists::handlers::merge_match_arms::get_arm_types::recurse (cognitive 23): ide_assists::handlers::merge_match_arms::get_arm_types::recurse has cognitive complexity 23 (threshold 15). Drivers by points: loops 4 (13 pts), if/else 3 (7 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 14). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/merge_match_arms.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4ef3d8e2bb63161123c828844ba768f456d5629441aa9717ab9d5d9ffed7454"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_assists::handlers::remove_unused_imports::remove_unused_imports (cognitive 23): ide_assists::handlers::remove_unused_imports::remove_unused_imports has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (10 pts), match/switch 6 (9 pts), loops 2 (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/tools/rust-analyzer/crates/ide-assists/src/handlers/remove_unused_imports.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"3857bf18a50b47e76f8dae228006aceb5caeb75b33b5ea5754bcffc4380825a2"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_db::imports::merge_imports::recursive_merge (cognitive 23): ide_db::imports::merge_imports::recursive_merge has cognitive complexity 23 (threshold 15). Drivers by points: if/else 4 (13 pts), match/switch 2 (6 pts), boolean chains 3, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-db/src/imports/merge_imports.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"76915c7d1f059347a307ca6ba113f7466f790b270a657c4ac3b75f504a80f7e1"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_db::symbol_index::resolve_path_to_modules (cognitive 23): ide_db::symbol_index::resolve_path_to_modules has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 5 (11 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/tools/rust-analyzer/crates/ide-db/src/symbol_index.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe503c56af95fca517a9330d56713251176ae1cb4603e9a406c2a6d5b068db2c"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_db::syntax_helpers::tree_diff::diff::go (cognitive 23): ide_db::syntax_helpers::tree_diff::diff::go has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (13 pts), match/switch 3 (6 pts), loops 2 (4 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-db/src/syntax_helpers/tree_diff.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"f65d64b5cf5e45c26255f3fedc6ed60900196527fcf69fe8a4a699532e1cca59"}},{"ruleId":"D2","level":"warning","message":{"text":"parser::grammar::params::param (cognitive 23): parser::grammar::params::param has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 3, match/switch 1 (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/parser/src/grammar/params.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"e426938db3972065eee49c76d03bbee77e504c4260b350992f9e1ccb9b029fd9"}},{"ruleId":"D2","level":"warning","message":{"text":"parser::grammar::paths::path_segment (cognitive 23): parser::grammar::paths::path_segment has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (19 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/parser/src/grammar/paths.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4c420e8e1ac2da979bcd33fe6a2258e3334b3323fc85878a8229e908f863ef0"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkspaceBuildScripts::run_command (cognitive 23): WorkspaceBuildScripts::run_command has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (13 pts), match/switch 3 (7 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/project-model/src/build_dependencies.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5053c87a6d1cf2021bc5698f3b3c714dd03aa3a7398688e4d97072452d6ea5f"}},{"ruleId":"D2","level":"warning","message":{"text":"Diagnostics::run_ (cognitive 23): Diagnostics::run_ has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 2 (4 pts), match/switch 1 (4 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/tools/rust-analyzer/crates/rust-analyzer/src/cli/diagnostics.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"b80468b2fa38200f06ad0260eba12db3fb40f26bbb14e690138328767649da9a"}},{"ruleId":"D2","level":"warning","message":{"text":"rust_analyzer::lsp::to_proto::merge_text_and_snippet_edits (cognitive 23): rust_analyzer::lsp::to_proto::merge_text_and_snippet_edits has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 4 (9 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/lsp/to_proto.rs"},"region":{"startLine":1197}}}],"partialFingerprints":{"codehealthFindingId/v1":"0429d656f373bff9fbcfb68aa9ed1c3df11e2bed18ad896bfff9e70e78758d60"}},{"ruleId":"D2","level":"warning","message":{"text":"Chain::from_ast (cognitive 23): Chain::from_ast has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (18 pts), loops 2, match/switch 1 (2 pts), boolean chains 1 (nesting depth added 9). Of this number, 19 points are the body\u0027s own statements and 4 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/chains.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bcf72a31b24be2b1caa7bdec308b122fe5d917e6ca484695d762bfa0a180e84"}},{"ruleId":"D2","level":"warning","message":{"text":"UseTree::from_ast (cognitive 23): UseTree::from_ast has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 4, match/switch 2 (3 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/imports.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"a75dea7ca41320326598daf144bf5a5b2038da52509f846a29e97af3738260de"}},{"ruleId":"D2","level":"warning","message":{"text":"rustfmt_nightly::items::format_struct_struct (cognitive 23): rustfmt_nightly::items::format_struct_struct has cognitive complexity 23 (threshold 15). Drivers by points: if/else 15 (18 pts), boolean chains 4, match/switch 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/items.rs"},"region":{"startLine":1447}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e7434431043f52549471aeda257ec83db4d90e1d2a3810c735bfe91b62cf7f9"}},{"ruleId":"D2","level":"warning","message":{"text":"rustfmt_nightly::matches::rewrite_match (cognitive 23): rustfmt_nightly::matches::rewrite_match has cognitive complexity 23 (threshold 15). Drivers by points: if/else 14 (17 pts), match/switch 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":"src/tools/rustfmt/src/matches.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eb2b342640b8dc92202b2a30e95538b56fa3c32624412ff988c12bf73dde795"}},{"ruleId":"D2","level":"warning","message":{"text":"bootstrap.bootstrap (cognitive 23): bootstrap.bootstrap has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 5 (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/bootstrap/bootstrap.py"},"region":{"startLine":1332}}}],"partialFingerprints":{"codehealthFindingId/v1":"e726b91d3d964bcd9967e674cce291b246e4b48ec57faf4098457d3d27857f67"}},{"ruleId":"D2","level":"warning","message":{"text":"from_lldb.variable_from_lldb (cognitive 23): from_lldb.variable_from_lldb has cognitive complexity 23 (threshold 15). Drivers by points: if/else 17 (20 pts), boolean chains 2, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/etc/debugger_tester/lldb/from_lldb.py"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"31d52d8861ba34894b7180f68fbf349a3b3c75c4f5e385c34a633225d48d6ead"}},{"ruleId":"D2","level":"warning","message":{"text":"DocSearch.execQuery::checkPath (cognitive 23): DocSearch.execQuery::checkPath has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 4, loops 2 (3 pts), ternaries 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 7 other methods here (DocSearch.execQuery::buildHrefAndPath, DocSearch.execQuery::formatDisplayTypeSignature::writeFn, DocSearch.execQuery::transformResults, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":3896}}}],"partialFingerprints":{"codehealthFindingId/v1":"1172e445428803560bc1ea081396f2e1916934b3c02c174fea70fd6fb1e80a1b"}},{"ruleId":"D2","level":"warning","message":{"text":"search.initSearch::checkPath (cognitive 23): search.initSearch::checkPath has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 4, loops 2 (3 pts), ternaries 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 15 other methods here (search.initSearch, search.initSearch::getItemsBefore, search.initSearch::getNextElem, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 16 times rather than 16 independent problems. Splitting this body alone leaves the other 15 exactly as they are. Where these are variations on one operation, the change that clears all 16 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":3896}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ba3df320a34b65031a209c1131f934f7672e5ec50a81c7010452c62fa115f64"}},{"ruleId":"D2","level":"warning","message":{"text":"search.initSearch::addTab::addNextResultToOutput (cognitive 23): search.initSearch::addTab::addNextResultToOutput has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (6 pts), ternaries 2 (3 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 15 other methods here (search.initSearch, search.initSearch::getItemsBefore, search.initSearch::getNextElem, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 16 times rather than 16 independent problems. Splitting this body alone leaves the other 15 exactly as they are. Where these are variations on one operation, the change that clears all 16 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":5012}}}],"partialFingerprints":{"codehealthFindingId/v1":"71cc25648d9e711f76999a160b3e200a06a8915d0ce1c21b2b96009d8fb498da"}},{"ruleId":"D2","level":"warning","message":{"text":"InlineNeighborsTree.decode (cognitive 23): InlineNeighborsTree.decode has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (13 pts), ternaries 5 (7 pts), boolean chains 2, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/stringdex.js"},"region":{"startLine":2597}}}],"partialFingerprints":{"codehealthFindingId/v1":"77683ec221594aac209646854fa81101edc32de00956d5cafea52bc543119661"}},{"ruleId":"D2","level":"warning","message":{"text":"initSearch::execQuery::checkPath (cognitive 23): initSearch::execQuery::checkPath has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 4, loops 2 (3 pts), ternaries 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":3896}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea1adbdd538b848fdd75a079f485bc6a38e539a8bd1acb40cdcf00564d80e7a3"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_ast::util::comments::beautify_doc_string (cognitive 22): rustc_ast::util::comments::beautify_doc_string has cognitive complexity 22 (threshold 15). Drivers by points: if/else 18 (37 pts), loops 5 (10 pts), boolean chains 7, match/switch 1 (nesting depth added 24). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This shape REPEATS in the file: one other method here (rustc_ast::util::comments::beautify_doc_string::get_horizontal_trim) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ast/src/util/comments.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"e114652db84ea20bdf87d01911dc9381d7634f57865f57690e1d4eee8c918bb1"}},{"ruleId":"D2","level":"warning","message":{"text":"LoweringContext::finalize_body_lowering (cognitive 22): LoweringContext::finalize_body_lowering has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (14 pts), match/switch 4 (8 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ast_lowering/src/delegation/mod.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dad0a6dd97d21a6691535fa23d0906ae78a85c2f3a1dd214caf3035867063fc"}},{"ruleId":"D2","level":"warning","message":{"text":"GatherBorrows::gather_reborrows (cognitive 22): GatherBorrows::gather_reborrows has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (18 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/borrow_set.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4c8f8866ce2f7e9857b77643bec3826c9cd6032b4d6e1b48b8e348d5aeb21b2"}},{"ruleId":"D2","level":"warning","message":{"text":"MirBorrowckCtxt::show_mutating_upvar (cognitive 22): MirBorrowckCtxt::show_mutating_upvar has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 1 (5 pts), loops 1 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/diagnostics/mutability_errors.rs"},"region":{"startLine":1002}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d58362d4e5b639895df3909f2a0cfd98c02cbc73df48d4e8207cb0268f51442"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_codegen_cranelift::abi::codegen_terminator_call::adjust_call_for_c_variadic (cognitive 22): rustc_codegen_cranelift::abi::codegen_terminator_call::adjust_call_for_c_variadic has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 1, loops 1, match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (rustc_codegen_cranelift::abi::codegen_terminator_call) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/src/abi/mod.rs"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc0f5a712c93abddd9e2a2055ebc717bc57d8f448296ed780ecb682517430c85"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_codegen_cranelift::discriminant::codegen_get_discriminant (cognitive 22): rustc_codegen_cranelift::discriminant::codegen_get_discriminant has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 6 (12 pts), if/else 7 (10 pts) (nesting depth added 9). 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":"compiler/rustc_codegen_cranelift/src/discriminant.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"322905e17bf8cdefc63d24dc8e321579dd94c9ec32dbb5d0ae9d5a5a2e1e2c77"}},{"ruleId":"D2","level":"warning","message":{"text":"CodegenCx::declare_fn (cognitive 22): CodegenCx::declare_fn has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 2 (6 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/declare.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"6494970fe767c49f6742c04ba3d707df59b3df930157c4ef262b8be25031b746"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_codegen_llvm::asm::modifier_to_llvm (cognitive 22): rustc_codegen_llvm::asm::modifier_to_llvm has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (15 pts), match/switch 4 (7 pts) (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":"compiler/rustc_codegen_llvm/src/asm.rs"},"region":{"startLine":915}}}],"partialFingerprints":{"codehealthFindingId/v1":"995c0ba2e0f682f8de243b1bebf280f89e43851b44db547dfca3f32e6247c2f9"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_codegen_llvm::back::write::optimize_inner (cognitive 22): rustc_codegen_llvm::back::write::optimize_inner has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/back/write.rs"},"region":{"startLine":874}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aa044723441f5418ce9acf9fbd596f67beeeace2470c14698078a0b7d73089a"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_codegen_ssa::back::link::add_linked_symbol_object (cognitive 22): rustc_codegen_ssa::back::link::add_linked_symbol_object has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 3, match/switch 1 (2 pts), loops 1 (nesting depth added 4). Of this number, 16 points are the body\u0027s own statements and 6 belong to one function item inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/back/link.rs"},"region":{"startLine":2537}}}],"partialFingerprints":{"codehealthFindingId/v1":"685c12ac0756a077d5afec6499d7856e03b2288cb8f5bbfcfa1f4c21dfd9e79a"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_codegen_ssa::back::symbol_edit::elf_edit_impl (cognitive 22): rustc_codegen_ssa::back::symbol_edit::elf_edit_impl has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 3, loops 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/back/symbol_edit.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2db0898516ea7b53456d2ccb01958b1b7fb162950615f151fbef0f2b23d73f4"}},{"ruleId":"D2","level":"warning","message":{"text":"InterpCx::cast (cognitive 22): InterpCx::cast has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 5 (9 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_const_eval/src/interpret/cast.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"b11ae5c3d6cbd8f4c1139c7e9ea2228fd4e2dc223bee45d894872262144c2563"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_hir_analysis::check::fn_sig_suggestion (cognitive 22): rustc_hir_analysis::check::fn_sig_suggestion has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (14 pts), match/switch 3 (6 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/check/mod.rs"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"6774ba134c3f77705c205b3a9cbffa5c40cae3b985e4c6d49cf632255319c9e5"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_hir_analysis::check::wfcheck::check_param_wf (cognitive 22): rustc_hir_analysis::check::wfcheck::check_param_wf has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 4 (11 pts), if/else 5 (10 pts), boolean chains 1 (nesting depth added 12). Of this number, 18 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. 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":"compiler/rustc_hir_analysis/src/check/wfcheck.rs"},"region":{"startLine":795}}}],"partialFingerprints":{"codehealthFindingId/v1":"63f9f2d49992ca4a89acb9ea61a79677225cdc6f815f88a05cf54756282d7001"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_hir_analysis::coherence::builtin::coerce_unsized_info (cognitive 22): rustc_hir_analysis::coherence::builtin::coerce_unsized_info has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (20 pts), boolean chains 1, match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/coherence/builtin.rs"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"f00482688fc68f7a6123c78130be1ddf593317c7251d006c30502b7a6aa4ff40"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_hir_analysis::collect::check_enum_variant_types (cognitive 22): rustc_hir_analysis::collect::check_enum_variant_types has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/collect.rs"},"region":{"startLine":828}}}],"partialFingerprints":{"codehealthFindingId/v1":"eefa3ff6caaaf54c6c7fd8366550124b3a6ad0cb8318b555ac921c006e142803"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_hir_analysis::collect::clauses_of::explicit_clauses_of (cognitive 22): rustc_hir_analysis::collect::clauses_of::explicit_clauses_of has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (14 pts), match/switch 2 (6 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/collect/clauses_of.rs"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"002844676bece2f3f0b80da6f874fad606fe8f839fa9728cf7b55cd367e4c551"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_hir_analysis::collect::clauses_of::assert_only_contains_clauses_from (cognitive 22): rustc_hir_analysis::collect::clauses_of::assert_only_contains_clauses_from has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 5 (13 pts), loops 4 (8 pts), if/else 1 (nesting depth added 12). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/collect/clauses_of.rs"},"region":{"startLine":739}}}],"partialFingerprints":{"codehealthFindingId/v1":"17b82e51bb976ed9b19b3ed3219f01a0ed42e2e97921884b32e946c2e1c4d220"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_hir_analysis::collect::type_of::infer_placeholder_type (cognitive 22): rustc_hir_analysis::collect::type_of::infer_placeholder_type has cognitive complexity 22 (threshold 15). Drivers by points: if/else 15 (20 pts), boolean chains 1, 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":"compiler/rustc_hir_analysis/src/collect/type_of.rs"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"63aa0901246ac3d1b73bd0b51b5e229adbd60e1839bc32efaa52e677e2ff7a82"}},{"ruleId":"D2","level":"warning","message":{"text":"State::print_inline_asm (cognitive 22): State::print_inline_asm has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 4 (9 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_pretty/src/lib.rs"},"region":{"startLine":1481}}}],"partialFingerprints":{"codehealthFindingId/v1":"392d67030dcf56875c553546bc78e692a94047eaa6a319aad0f5e3db5ac63cc9"}},{"ruleId":"D2","level":"warning","message":{"text":"ArgMatchingCtxt::detect_missing_turbofish (cognitive 22): ArgMatchingCtxt::detect_missing_turbofish has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 2 (3 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":"compiler/rustc_hir_typeck/src/fn_ctxt/checks.rs"},"region":{"startLine":3277}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a211013151a3f75d698a03d2e02ce3b51ecb625ed91ccc94cb3348d3230240c"}},{"ruleId":"D2","level":"warning","message":{"text":"Resolver::lookup_import_candidates (cognitive 22): Resolver::lookup_import_candidates has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 1 (4 pts), boolean chains 2, loops 1 (2 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":"compiler/rustc_resolve/src/diagnostics/impls.rs"},"region":{"startLine":1939}}}],"partialFingerprints":{"codehealthFindingId/v1":"054a1366d1e3f2da09d6c5af0cf373cefb75334aba4eb4e090fa2866f37e479e"}},{"ruleId":"D2","level":"warning","message":{"text":"LexicalResolver::collect_error_for_expanding_node (cognitive 22): LexicalResolver::collect_error_for_expanding_node has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 3 (4 pts), boolean chains 1, match/switch 1 (nesting depth added 9). Of this number, 21 points are the body\u0027s own statements and 1 belongs 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":"compiler/rustc_infer/src/infer/lexical_region_resolve/mod.rs"},"region":{"startLine":694}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f2afa92d84e7b4b0447f49526dd05276009d9122934f31445f91c963bda46ca"}},{"ruleId":"D2","level":"warning","message":{"text":"UnusedDelimLint::is_expr_delims_necessary (cognitive 22): UnusedDelimLint::is_expr_delims_necessary has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (10 pts), match/switch 4 (8 pts), loops 3, boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_lint/src/unused.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"a83031c4cea054357c5bec9e6b3af39cc9b56ab50f78567b648cda95e21a7165"}},{"ruleId":"D2","level":"warning","message":{"text":"UnusedDelimLint::emit_unused_delims (cognitive 22): UnusedDelimLint::emit_unused_delims has cognitive complexity 22 (threshold 15). Drivers by points: if/else 14 (15 pts), boolean chains 7 (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":"compiler/rustc_lint/src/unused.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"907ae6b10d252871ca94024027fca4025ccfb9c3c7024fc73e2b63ad3003f683"}},{"ruleId":"D2","level":"warning","message":{"text":"TerminatorKind::fmt_head (cognitive 22): TerminatorKind::fmt_head has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 3 (6 pts), match/switch 2 (4 pts) (nesting depth added 12). 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":"compiler/rustc_middle/src/mir/pretty.rs"},"region":{"startLine":990}}}],"partialFingerprints":{"codehealthFindingId/v1":"186c7bfff0ed4abbb8e3446b8a4b96ea66a2ff8205b773f84f531825247b28ae"}},{"ruleId":"D2","level":"warning","message":{"text":"ProjectedUserTypesNode::build_user_type_projections (cognitive 22): ProjectedUserTypesNode::build_user_type_projections has cognitive complexity 22 (threshold 15). Drivers by points: loops 7 (19 pts), match/switch 1 (2 pts), if/else 1 (nesting depth added 13). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_build/src/builder/matches/user_ty.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"003bb6d52e744441451a60a45046d18ec2cf4a4fbc87591a5c98294288316260"}},{"ruleId":"D2","level":"warning","message":{"text":"Promoter::promote_temp (cognitive 22): Promoter::promote_temp has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (13 pts), match/switch 3 (6 pts), loops 1 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/promote_consts.rs"},"region":{"startLine":775}}}],"partialFingerprints":{"codehealthFindingId/v1":"c005fff9b79b575095682fd5f0b12d9753d3c1fec58a5978fac714e75099eb88"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_mir_transform::promote_consts::promote_candidates (cognitive 22): rustc_mir_transform::promote_consts::promote_candidates has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 3, boolean chains 2, match/switch 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/promote_consts.rs"},"region":{"startLine":1002}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0292fdb81e4cf4e84ef69f49aeff9b356fdfa3fe605503c8ada6b73db26e6fb"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::recover_stmt_ (cognitive 22): Parser::recover_stmt_ has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (15 pts), boolean chains 4, match/switch 1 (2 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/diagnostics.rs"},"region":{"startLine":1922}}}],"partialFingerprints":{"codehealthFindingId/v1":"91541fe93d87203c6ef3a3e0e1a681a9de2567ac53443796e1d3ae4be9f9c1d4"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_angle_arg (cognitive 22): Parser::parse_angle_arg has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 4, match/switch 2 (4 pts) (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/path.rs"},"region":{"startLine":781}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aee399cfc3116d3c1d9ba3e7f97c7b1d1d66ebcde2d928c1a97f5671fbdccb5"}},{"ruleId":"D2","level":"warning","message":{"text":"RustcPatCtxt::ctors_for_ty (cognitive 22): RustcPatCtxt::ctors_for_ty has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 3, loops 1 (3 pts), match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_pattern_analysis/src/rustc.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"16d6f4e8b47f62babfa56fa2e5c2a9b029e036d7d6527f4305d60ba412822142"}},{"ruleId":"D2","level":"warning","message":{"text":"LateResolutionVisitor::suggest_self_value (cognitive 22): LateResolutionVisitor::suggest_self_value has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (21 pts), match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/late/diagnostics.rs"},"region":{"startLine":1679}}}],"partialFingerprints":{"codehealthFindingId/v1":"a05adf9638708ac0da2ae7bb861f6cc02e17929dd55f8c1ec72e4d3ab4086d45"}},{"ruleId":"D2","level":"warning","message":{"text":"SourceMap::span_wrapped_by_angle_or_parentheses (cognitive 22): SourceMap::span_wrapped_by_angle_or_parentheses has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (20 pts), loops 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_span/src/source_map.rs"},"region":{"startLine":826}}}],"partialFingerprints":{"codehealthFindingId/v1":"774dd0e18f8b559872bafad103678f6c8f0f9452a488581440c789aa6559c9d4"}},{"ruleId":"D2","level":"warning","message":{"text":"UdpSocket::recv_inner (cognitive 22): UdpSocket::recv_inner has cognitive complexity 22 (threshold 15). Drivers by points: if/else 15 (20 pts), loops 1 (2 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":"library/std/src/sys/net/connection/xous/udp.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"bae83c6ce782f58babdf26cf5984b44db18e3dffeb51afd70058e7ae142e4183"}},{"ruleId":"D2","level":"warning","message":{"text":"std::sys::args::windows::parse_lp_cmd_line (cognitive 22): std::sys::args::windows::parse_lp_cmd_line has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 3 (7 pts), boolean chains 3, loops 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/args/windows.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"cccdab931f7be7649df9fc81e718dc364c6b24721530f6cd6a892a89c4427b3e"}},{"ruleId":"D2","level":"warning","message":{"text":"std::sys::args::windows::append_bat_arg (cognitive 22): std::sys::args::windows::append_bat_arg has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 5, loops 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":"library/std/src/sys/args/windows.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"451efbafdf06759770a5c3e2db2aa775298a97a7392addb217b9e5128c21e709"}},{"ruleId":"D2","level":"warning","message":{"text":"bootstrap::cli_main::main (cognitive 22): bootstrap::cli_main::main has cognitive complexity 22 (threshold 15). Drivers by points: if/else 14 (16 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/cli_main.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"426a1204750af0de8f5c39a564319fc1e4679279a6a352e6750ebb69b2e71d10"}},{"ruleId":"D2","level":"warning","message":{"text":"LangString::parse (cognitive 22): LangString::parse has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 8, if/else 4 (8 pts), match/switch 2 (5 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/markdown.rs"},"region":{"startLine":1264}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fa6f0ff14c235789bfaefc6dfe9aff0a24af71e53b342225e4019d0b663e6a3"}},{"ruleId":"D2","level":"warning","message":{"text":"RustdocVisitor::visit_use_inner (cognitive 22): RustdocVisitor::visit_use_inner has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (5 pts), boolean chains 3, match/switch 1 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/visit_ast.rs"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba6e9fb9b4814da21e3eed24afb9c864d65b227d9b31b99516a1676000850805"}},{"ruleId":"D2","level":"warning","message":{"text":"rustdoc::clean::clean_qpath (cognitive 22): rustdoc::clean::clean_qpath has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (18 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/clean/mod.rs"},"region":{"startLine":1717}}}],"partialFingerprints":{"codehealthFindingId/v1":"20c5e932dc219a414baf1968f33e6e8f6a8c99c6938d2bf0f50ad2c991a2cd73"}},{"ruleId":"D2","level":"warning","message":{"text":"DisallowedItems::check_pat (cognitive 22): DisallowedItems::check_pat has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 2 (4 pts), boolean chains 2, match/switch 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/disallowed_items.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"87346ba0f0c82cb797992fa25189874f0c93b06934c46211b2bddc1e624d42f3"}},{"ruleId":"D2","level":"warning","message":{"text":"LargeEnumVariant::check_item (cognitive 22): LargeEnumVariant::check_item has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (20 pts), boolean chains 2 (nesting depth added 11). 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/tools/clippy/clippy_lints/src/large_enum_variant.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccf7429723b4d0ebdde6f2eeedace7c4efd119e215805c73f9ea9cb7b7d17752"}},{"ruleId":"D2","level":"warning","message":{"text":"NeedlessPassByRefMut::check_fn (cognitive 22): NeedlessPassByRefMut::check_fn has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 4, loops 2 (3 pts), match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/needless_pass_by_ref_mut.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"611a4cb2ab5b179a7e981adefd42ac3bdea3a4adb50a38b566cee0a619ade9e0"}},{"ruleId":"D2","level":"warning","message":{"text":"SimilarNamesNameVisitor::check_ident (cognitive 22): SimilarNamesNameVisitor::check_ident has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 5, 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/tools/clippy/clippy_lints/src/non_expressive_names.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"f219e0324af23d7c14478469e03220add1ad930a017b625114110547bcab4376"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::casts::needless_type_cast::is_cast_in_generic_context (cognitive 22): clippy_lints::casts::needless_type_cast::is_cast_in_generic_context has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (15 pts), match/switch 2 (5 pts), boolean chains 1, loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/casts/needless_type_cast.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"420ce0a89b01e017a61f50643d9ad96fb121402e48015c14a4081d9217dcba6c"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::doc::markdown::check (cognitive 22): clippy_lints::doc::markdown::check has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 7, loops 3 (5 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/tools/clippy/clippy_lints/src/doc/markdown.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"c663f98d065871e5e4401edacf0c90699627de5045c7c1ce7ad44e9be1414f4b"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::let_if_seq::check_block_inner (cognitive 22): clippy_lints::let_if_seq::check_block_inner has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (19 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/let_if_seq.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"a77bdbfddeb09c5c9e6d08f0e581bafb7650b507e4c1d89c5d2c5f0eb6d7b79e"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::methods::read_line_without_trim::check (cognitive 22): clippy_lints::methods::read_line_without_trim::check has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 5 (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/tools/clippy/clippy_lints/src/methods/read_line_without_trim.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"f37e74cae11d85c489cd00989b9a6520a960284e6bc8586ccd8f8470748de32c"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::needless_borrows_for_generic_args::needless_borrow_count (cognitive 22): clippy_lints::needless_borrows_for_generic_args::needless_borrow_count has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (13 pts), boolean chains 8, loops 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/needless_borrows_for_generic_args.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"a45278bf1c326f1736109a8910f6f8da57cc366017b5cd49df3e13871a1ec1b6"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::operators::float_cmp::check (cognitive 22): clippy_lints::operators::float_cmp::check has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 6, match/switch 2 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/operators/float_cmp.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"924fedc9d1b945df42bcdec8610056ca9dcd3e859c1ea319f79a68486b8b9988"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::ranges::can_switch_ranges (cognitive 22): clippy_lints::ranges::can_switch_ranges has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 7, 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/tools/clippy/clippy_lints/src/ranges.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6d729f0174f1bc908346a6ecedea88bb443a6542115e7a705f09aa90ca96f9b"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::shadow::find_init (cognitive 22): clippy_lints::shadow::find_init has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 4 (16 pts), if/else 2 (5 pts), loops 1 (nesting depth added 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. 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/tools/clippy/clippy_lints/src/shadow.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"33199b8bd767609c0c1a34c238f4e9ee93e774c97e8d48c47565223285a86b16"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::undocumented_unsafe_blocks::check_has_safety_comment (cognitive 22): clippy_lints::undocumented_unsafe_blocks::check_has_safety_comment has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (20 pts), boolean chains 1, match/switch 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/tools/clippy/clippy_lints/src/undocumented_unsafe_blocks.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8d55298482add4ca7bc3e45701618d91a335c8ef8a4f7ec453e57c8f6440332"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::unit_types::unit_arg::lint_unit_args (cognitive 22): clippy_lints::unit_types::unit_arg::lint_unit_args has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 6 (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/tools/clippy/clippy_lints/src/unit_types/unit_arg.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"036eb3a609d1c5d1ea147967fd76a12d531472e4406f18a9991c131697f875fc"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_utils::is_body_identity_function (cognitive 22): clippy_utils::is_body_identity_function has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 3, loops 2, match/switch 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_utils/src/lib.rs"},"region":{"startLine":1823}}}],"partialFingerprints":{"codehealthFindingId/v1":"589127b3caaccd17cfb0afd317c991989e1a00fbccd1b5b026cb58f66debc98c"}},{"ruleId":"D2","level":"warning","message":{"text":"CrateWithSource::download_and_extract (cognitive 22): CrateWithSource::download_and_extract has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 2 (3 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 10). Of this number, 19 points are the body\u0027s own statements and 3 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/tools/clippy/lintcheck/src/input.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"425edfa554b291879a86362815acfcfe94b53e31716b299f58fa4be8d4dd70f5"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy::driver::main (cognitive 22): clippy::driver::main has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 10, if/else 9, match/switch 2 (3 pts) (nesting depth added 1). Of this number, 19 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/src/driver.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6ad3e0b25a607ad4c3fe00ea2f968b571c5032246e2cfb7c58b50209248c721"}},{"ruleId":"D2","level":"warning","message":{"text":"TestCx::document_inner (cognitive 22): TestCx::document_inner has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 2, loops 1 (2 pts), match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/compiletest/src/runtest.rs"},"region":{"startLine":1012}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e5de71fa09de97ca4f9fec4cb4c2920b5a51bdda58d4337e1abfdd782c9b85c"}},{"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":"src/tools/miri/miri-script/src/commands.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"8502674a880a05e73fa0630372ad616451cda6d927c842ca5ad3bd141404db81"}},{"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/tools/miri/src/intrinsics/math.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"2542cc601e52765b0f93c4efd7a738348bd4a43e9a3cd51f12a97a20ccc29483"}},{"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/tools/miri/src/intrinsics/simd.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"994d473528d1349448b5a8be129a8c9a764e7c5e5f087488b107e5c60a5e95b7"}},{"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/tools/miri/src/shims/io_error.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"a80599721b99a9476c47d1a25bfb3e300c2f91aabe9952fe9e8cdbf0f9a1b761"}},{"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/tools/miri/src/diagnostics.rs"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5470304aabea24cd32baa92b5401ed4e5f87a1939cfbc1b95c44530db35eb18"}},{"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/tools/miri/src/shims/windows/foreign_items.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc2294bfc0d936addb244ce158432b465ce5d46969352f575fbbe230d16f389c"}},{"ruleId":"D2","level":"warning","message":{"text":"Printer::print_path (cognitive 22): Printer::print_path has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 3 (5 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/expr_store/pretty.rs"},"region":{"startLine":1111}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2159ec2f4798eb3f7503a83f2b24c929cadd89808a77f0ac7496a19228af5d8"}},{"ruleId":"D2","level":"warning","message":{"text":"DefMap::resolve_path_fp_with_macro_single (cognitive 22): DefMap::resolve_path_fp_with_macro_single has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 4 (6 pts), boolean chains 2, loops 1 (2 pts) (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/tools/rust-analyzer/crates/hir-def/src/nameres/path_resolution.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"e854bd95ad255b6c86df1298ce0ec582891cba6c3c00f0cdb8a85f52f3159445"}},{"ruleId":"D2","level":"warning","message":{"text":"Resolver::rename_will_conflict_with_another_variable (cognitive 22): Resolver::rename_will_conflict_with_another_variable has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (16 pts), loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/resolver.rs"},"region":{"startLine":797}}}],"partialFingerprints":{"codehealthFindingId/v1":"190f14d9cc4beb6aa47f4a9c91299b635715d26abfe19c15fd06c25eb75a5693"}},{"ruleId":"D2","level":"warning","message":{"text":"Visibility::max (cognitive 22): Visibility::max has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (16 pts), match/switch 2 (4 pts), boolean chains 2 (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This shape REPEATS in the file: one other method here (Visibility::min) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/visibility.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"922bb7c4cdb4b8b66719054829bad1a09e1bd4a6a2ba365df3f5ff9fd2265981"}},{"ruleId":"D2","level":"warning","message":{"text":"Visibility::min (cognitive 22): Visibility::min has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (16 pts), match/switch 2 (4 pts), boolean chains 2 (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This shape REPEATS in the file: one other method here (Visibility::max) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/visibility.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"dedd24fa46827de05772c17845650a19e942a7cb9ca3ac74e8ea09cae493ffab"}},{"ruleId":"D2","level":"warning","message":{"text":"hir_def::expr_store::lower::lower_function (cognitive 22): hir_def::expr_store::lower::lower_function has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 3 (11 pts), if/else 5 (8 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 12). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/expr_store/lower.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a3509bf1cc7e0427159587055ce2d91b9c1bf335137c67b800ff1b17a3d307c"}},{"ruleId":"D2","level":"warning","message":{"text":"ExprUseVisitor::walk_expr (cognitive 22): ExprUseVisitor::walk_expr has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 3 (6 pts), match/switch 2 (4 pts) (nesting depth added 12). 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/tools/rust-analyzer/crates/hir-ty/src/infer/closure/analysis/expr_use_visitor.rs"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa41c9beba01831f00439f498212a75352e4b2b6878e4b6c406ef4f415a585d2"}},{"ruleId":"D2","level":"warning","message":{"text":"ExprUseVisitor::walk_captures (cognitive 22): ExprUseVisitor::walk_captures has cognitive complexity 22 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 3 (7 pts), match/switch 2 (7 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/infer/closure/analysis/expr_use_visitor.rs"},"region":{"startLine":1052}}}],"partialFingerprints":{"codehealthFindingId/v1":"9789c9adee04380bf28a1412aca139640efc8d533e8c53d0c25a00b7f68d934f"}},{"ruleId":"D2","level":"warning","message":{"text":"Coerce::coerce_borrowed_pointer (cognitive 22): Coerce::coerce_borrowed_pointer has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (17 pts), match/switch 2 (3 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/infer/coerce.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8020d5d2c9075ebf4e4c94bdf34f180237196f56e8bdc85bc6f418f9ba2070e"}},{"ruleId":"D2","level":"warning","message":{"text":"InferenceContext::compute_definition_site_hidden_types (cognitive 22): InferenceContext::compute_definition_site_hidden_types has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 4 (7 pts), match/switch 1 (2 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/tools/rust-analyzer/crates/hir-ty/src/infer/opaques.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1f20e173871ed2b88f79975d1265f5f11c05f20521a699995db0467159e91ce"}},{"ruleId":"D2","level":"warning","message":{"text":"FulfillmentCtxt::try_evaluate_obligations (cognitive 22): FulfillmentCtxt::try_evaluate_obligations has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (11 pts), match/switch 3 (8 pts), loops 2 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/next_solver/fulfill.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3cfb526014bc442b988e9dee5c6371d10bc934325cf0371f8da71b3e2f808f4"}},{"ruleId":"D2","level":"warning","message":{"text":"ide::moniker::def_to_kind (cognitive 22): ide::moniker::def_to_kind has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (19 pts), match/switch 2 (3 pts) (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/moniker.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8e81c7430794e8e66f7606e4d66e5b0f8c59fd0264e11eb48f80fede9874df1"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_assists::handlers::convert_closure_to_fn::handle_call (cognitive 22): ide_assists::handlers::convert_closure_to_fn::handle_call has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 2, loops 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/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_closure_to_fn.rs"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3b7fb2e94a4d89451f4a5264c715fed7250251d255fbe9dca4627891f3589ac"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_assists::utils::gen_trait_fn_body::gen_clone_impl (cognitive 22): ide_assists::utils::gen_trait_fn_body::gen_clone_impl has cognitive complexity 22 (threshold 15). Drivers by points: loops 5 (16 pts), match/switch 3 (6 pts) (nesting depth added 14). 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/tools/rust-analyzer/crates/ide-assists/src/utils/gen_trait_fn_body.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ddd7d3191e63a24134058d595161f0dabfbc1845f4416a4bd225ab61d1a12ce"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_assists::utils::gen_trait_fn_body::gen_debug_impl (cognitive 22): ide_assists::utils::gen_trait_fn_body::gen_debug_impl has cognitive complexity 22 (threshold 15). Drivers by points: loops 5 (16 pts), match/switch 3 (6 pts) (nesting depth added 14). 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/tools/rust-analyzer/crates/ide-assists/src/utils/gen_trait_fn_body.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"c11f4a5f8976db5708490ebe1de167dcc8fa676ca65c1599cecbcea63102e559"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_completion::completions::pattern::complete_pattern (cognitive 22): ide_completion::completions::pattern::complete_pattern has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (9 pts), match/switch 5 (8 pts), boolean chains 5 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-completion/src/completions/pattern.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"d022cee6cb4f4d9e86debf32f6bc22326c51534519c8adafdab862b3ee571831"}},{"ruleId":"D2","level":"warning","message":{"text":"Query::search_maps (cognitive 22): Query::search_maps has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (10 pts), boolean chains 6, 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/tools/rust-analyzer/crates/ide-db/src/symbol_index.rs"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e0703587edce5f8806ab346a4df89ff180046d52018e7178a146272c29cf576"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_db::imports::insert_use::insert_use_with_editor_ (cognitive 22): ide_db::imports::insert_use::insert_use_with_editor_ has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (17 pts), match/switch 3 (4 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-db/src/imports/insert_use.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cfc8f12337611e8ae09d5b18032dc1d206b5edc79f265cc74bbbf3fe5a27232"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_diagnostics::handlers::type_mismatch::add_missing_ok_or_some (cognitive 22): ide_diagnostics::handlers::type_mismatch::add_missing_ok_or_some has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (20 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-diagnostics/src/handlers/type_mismatch.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a1ee9aa0487f15f16e5239dd0c5a80b3408f040b6c750af80fcc17d22f8feac"}},{"ruleId":"D2","level":"warning","message":{"text":"mbe::parser::parse_metavar_expr (cognitive 22): mbe::parser::parse_metavar_expr has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 1 (2 pts), match/switch 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/mbe/src/parser.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdb4caf6635d39f694f0c47e7c8bfd7f465b80e7e4461240bb27104f055b8239"}},{"ruleId":"D2","level":"warning","message":{"text":"CargoWorkspace::new (cognitive 22): CargoWorkspace::new has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 6 (8 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 7). Of this number, 16 points are the body\u0027s own statements and 6 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/tools/rust-analyzer/crates/project-model/src/cargo_workspace.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"392caa61c375c370150a7377d37a9ddd5dcad10c7a2d806d0c225566bcbec117"}},{"ruleId":"D2","level":"warning","message":{"text":"UseSegment::cmp (cognitive 22): UseSegment::cmp has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (16 pts), match/switch 3 (5 pts), boolean chains 1 (nesting depth added 9). Of this number, 21 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. 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/tools/rustfmt/src/imports.rs"},"region":{"startLine":921}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf3dfceefb5a55675b238a2c822aba27ae4f6e7e4e745abdeffa7017031c5f3e"}},{"ruleId":"D2","level":"warning","message":{"text":"rustfmt_nightly::items::rewrite_ty (cognitive 22): rustfmt_nightly::items::rewrite_ty has cognitive complexity 22 (threshold 15). Drivers by points: if/else 15 (20 pts), match/switch 1 (2 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/tools/rustfmt/src/items.rs"},"region":{"startLine":1767}}}],"partialFingerprints":{"codehealthFindingId/v1":"76ee862b2b02e40db29afe8a74f88b3a161c3e239814ffa3be01bcdf0834d907"}},{"ruleId":"D2","level":"warning","message":{"text":"rustfmt_nightly::patterns::rewrite_struct_pat (cognitive 22): rustfmt_nightly::patterns::rewrite_struct_pat has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (20 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/patterns.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"799f1dd60d341f8f4a58f236c46aadc75fd6e71ce806e5c29655f82f433d8ca0"}},{"ruleId":"D2","level":"warning","message":{"text":"Type.print_field_errors (cognitive 22): Type.print_field_errors has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/etc/debugger_tester/common.py"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"63f375e63320a8fd74d9ea4e8eab75642ceb36fcf8d9d85aa41757b23ae7f299"}},{"ruleId":"D2","level":"warning","message":{"text":"check_lldb.children_match (cognitive 22): check_lldb.children_match has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 2, loops 1, ternaries 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/etc/debugger_tester/lldb/check_lldb.py"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"e446f70afcf2c15a9ff0a84d4f48f9fb1aaac798275fa98f096cc7361373eeb6"}},{"ruleId":"D2","level":"warning","message":{"text":"setup (cognitive 22): setup has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (20 pts), boolean chains 2 (nesting depth added 9). Most of this is not in the body itself: 3 of the 22 points are its own statements and the rest belongs to 3 function items inside it that branch (onpageshow, a function literal at line 442, onclick). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/main.js"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5f75814626959e385faf4b38bf93f1bd70bddf1e6abce0f431cea4fd0cda5e4"}},{"ruleId":"D2","level":"warning","message":{"text":"loadDatabase::decode (cognitive 22): loadDatabase::decode has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (13 pts), ternaries 5 (6 pts), boolean chains 2, loops 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/stringdex.js"},"region":{"startLine":2597}}}],"partialFingerprints":{"codehealthFindingId/v1":"5099a8c9f1e23520df2220331811161556b784c2d3b4ef68fdee1ea37515451c"}},{"ruleId":"D2","level":"warning","message":{"text":"LoweringContext::lower_expr_range (cognitive 21): LoweringContext::lower_expr_range has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (18 pts), match/switch 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ast_lowering/src/expr.rs"},"region":{"startLine":1498}}}],"partialFingerprints":{"codehealthFindingId/v1":"934eaf14737ad435cfc827c07f187058b41e06c521f545ef8bc1cbfef892545c"}},{"ruleId":"D2","level":"warning","message":{"text":"AstValidator::check_c_variadic_type (cognitive 21): AstValidator::check_c_variadic_type has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 4 (6 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ast_passes/src/ast_validation.rs"},"region":{"startLine":943}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbe5cb052f4c2bd02715e4a3fba5404e28db0a949c2e47cf725ec5aba187d293"}},{"ruleId":"D2","level":"warning","message":{"text":"AttributeParser::check_target (cognitive 21): AttributeParser::check_target has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14 (16 pts), boolean chains 4, match/switch 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"compiler/rustc_attr_parsing/src/target_checking.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ccb35babac53899f97a87f885822fd09b09da2832449104132476b13666ceae"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_attr_parsing::attributes::cfg_select::lint_unreachable (cognitive 21): rustc_attr_parsing::attributes::cfg_select::lint_unreachable has cognitive complexity 21 (threshold 15). Drivers by points: match/switch 6 (17 pts), if/else 1 (2 pts), loops 2 (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":"compiler/rustc_attr_parsing/src/attributes/cfg_select.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"548b35bab5a96b8a0715c71c009536d09844ae7c469989909e2d19b77486c1ec"}},{"ruleId":"D2","level":"warning","message":{"text":"MirBorrowckCtxt::expected_fn_found_fn_mut_call (cognitive 21): MirBorrowckCtxt::expected_fn_found_fn_mut_call has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (14 pts), match/switch 3 (5 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/diagnostics/mutability_errors.rs"},"region":{"startLine":1215}}}],"partialFingerprints":{"codehealthFindingId/v1":"6faf45bc0940bc7c0ce6014ca756ac34a32da3e5bd68d5e926c328466c5fd3bf"}},{"ruleId":"D2","level":"warning","message":{"text":"RegionInferenceContextInner::best_blame_constraint (cognitive 21): RegionInferenceContextInner::best_blame_constraint has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13, boolean chains 6, match/switch 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":"compiler/rustc_borrowck/src/region_infer/region_context.rs"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"c946e1ccbae575ef1c470fa253ab699cd7f5215334cf0f592f97a4b8e93e0e8d"}},{"ruleId":"D2","level":"warning","message":{"text":"UniversalRegionRelationsBuilder::create_old (cognitive 21): UniversalRegionRelationsBuilder::create_old has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 5 (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":"compiler/rustc_borrowck/src/type_check/free_region_relations.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f1b022b0cf0a169f3e9e56409c5f21711c20264bace8b7930da6f0b361b7c02"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeChecker::visit_statement (cognitive 21): TypeChecker::visit_statement has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (17 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/type_check/mod.rs"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"faea3cfc8e62ddcd548cdb25bfa11366d36ac5719567bf3cf576042744590499"}},{"ruleId":"D2","level":"warning","message":{"text":"CodegenCx::codegen_global_asm (cognitive 21): CodegenCx::codegen_global_asm has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 3 (9 pts), boolean chains 1, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/asm.rs"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"96f06a8495cdf488cb17f37817901c929d707489de460595948c6f91e0f46e79"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_codegen_llvm::back::lto::thin_lto (cognitive 21): rustc_codegen_llvm::back::lto::thin_lto has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (15 pts), loops 3, match/switch 1 (2 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":"compiler/rustc_codegen_llvm/src/back/lto.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0cbee9ecc4e37afcc2f41a9c951d6dc829561dfd1779205531fb2220e29b133"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_codegen_llvm::llvm_util::global_llvm_features (cognitive 21): rustc_codegen_llvm::llvm_util::global_llvm_features has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (17 pts), match/switch 2, boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/llvm_util.rs"},"region":{"startLine":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f88e755f870e768be432e4d4616f4f94972e55a93e8891c1b8b8e3ac39b2080"}},{"ruleId":"D2","level":"warning","message":{"text":"CguReuseTracker::check_expected_reuse (cognitive 21): CguReuseTracker::check_expected_reuse has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (15 pts), match/switch 1 (4 pts), loops 1 (2 pts) (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":"compiler/rustc_codegen_ssa/src/assert_module_sources.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8a60bb61cee6869bde35085fbfc9e2cc528c9a9f5f745fe64006cec868c3084"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_codegen_ssa::back::link::add_sanitizer_libraries (cognitive 21): rustc_codegen_ssa::back::link::add_sanitizer_libraries has cognitive complexity 21 (threshold 15). Drivers by points: if/else 15 (16 pts), boolean chains 5 (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":"compiler/rustc_codegen_ssa/src/back/link.rs"},"region":{"startLine":1743}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad43022adb920a87939921b0d9648d3565383fa55438e71379317413b6d958b1"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_codegen_ssa::back::link::add_c_staticlib_symbols (cognitive 21): rustc_codegen_ssa::back::link::add_c_staticlib_symbols has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (10 pts), match/switch 2 (6 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/back/link.rs"},"region":{"startLine":2825}}}],"partialFingerprints":{"codehealthFindingId/v1":"20ebc3762a621193c0705291a421cb1775319c3b131504259e8b8f30b601e3ee"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_codegen_ssa::codegen_attrs::apply_overrides (cognitive 21): rustc_codegen_ssa::codegen_attrs::apply_overrides has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14 (19 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/codegen_attrs.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcf1c0cde11bfb228000b86b5553e99fc93f4c1e2780ecc4123a138f7e2dc0d7"}},{"ruleId":"D2","level":"warning","message":{"text":"InterpCx::mem_copy_repeatedly (cognitive 21): InterpCx::mem_copy_repeatedly has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (14 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_const_eval/src/interpret/memory.rs"},"region":{"startLine":1473}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bf8f323df38585a5f9863b8d61c2a861b8c464207a4e6516810f4614618de87"}},{"ruleId":"D2","level":"warning","message":{"text":"InterpCx::eval_rvalue_into_place (cognitive 21): InterpCx::eval_rvalue_into_place has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 1, match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_const_eval/src/interpret/step.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7029d64bc6b91378e8736ae61b340897217e683ff89ea50d528e14b9ad6f979"}},{"ruleId":"D2","level":"warning","message":{"text":"InterpCx::eval_terminator (cognitive 21): InterpCx::eval_terminator has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 3, loops 1 (2 pts), match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_const_eval/src/interpret/step.rs"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"b05a0ef22b06aab0af5d9c168373b856eebcbd5da9da11ae98232ed3217b6c2a"}},{"ruleId":"D2","level":"warning","message":{"text":"ObligationForest::process_obligations (cognitive 21): ObligationForest::process_obligations has cognitive complexity 21 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 3 (7 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_data_structures/src/obligation_forest/mod.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d13fdf44e3d398bead6dfd732ebdd2f68d01c1cdde27dbc5cdbadcd78c0fb34"}},{"ruleId":"D2","level":"warning","message":{"text":"AnnotateSnippetEmitter::unannotated_messages (cognitive 21): AnnotateSnippetEmitter::unannotated_messages has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (14 pts), boolean chains 6, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_errors/src/annotate_snippet_emitter_writer.rs"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"92ba58a9fe1ae220418fc96af6fe1078478f438b39326433fe906126d250a477"}},{"ruleId":"D2","level":"warning","message":{"text":"TtParser::match_one (cognitive 21): TtParser::match_one has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 2 (3 pts), loops 1 (2 pts) (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_expand/src/mbe/macro_parser.rs"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"857c42a231cbe639dccfaa65b64d5e038ec762d839950d2d884b5ec06b698de5"}},{"ruleId":"D2","level":"warning","message":{"text":"WfCheckingCtxt::check_test_binder_body (cognitive 21): WfCheckingCtxt::check_test_binder_body has cognitive complexity 21 (threshold 15). Drivers by points: match/switch 4 (10 pts), if/else 4 (8 pts), loops 3 (nesting depth added 10). Of this number, 13 points are the body\u0027s own statements and 8 belong to one function item inside it that branches. 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":"compiler/rustc_hir_analysis/src/check/wfcheck.rs"},"region":{"startLine":2428}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6365fa362abd050f8825f626a3e7b79e92491d4c5e15af212dbe3e43634a5bc"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_hir_analysis::check::check::check_scalable_vector (cognitive 21): rustc_hir_analysis::check::check::check_scalable_vector has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (9 pts), match/switch 4 (8 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/check/check.rs"},"region":{"startLine":1562}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c17e2483c34e975f338ecc76a5f8614a1e19a5571cac1ecc104851644039e04"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_hir_analysis::check::compare_impl_item::check_region_late_boundedness (cognitive 21): rustc_hir_analysis::check::compare_impl_item::check_region_late_boundedness has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 3, boolean chains 2, 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":"compiler/rustc_hir_analysis/src/check/compare_impl_item.rs"},"region":{"startLine":1294}}}],"partialFingerprints":{"codehealthFindingId/v1":"203ebb39912524fd55d2de5960d6552fc2896e24b6e7e2259d53f36e4da83087"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::check_expr_path (cognitive 21): FnCtxt::check_expr_path has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 1 (3 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/expr.rs"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"1802fe9e98e733a4948cc8a2397ba778d8dbb9bde51708c59b02c9dda2632cf0"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::emit_bad_pat_path (cognitive 21): FnCtxt::emit_bad_pat_path has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 4 (10 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":"compiler/rustc_hir_typeck/src/pat.rs"},"region":{"startLine":1696}}}],"partialFingerprints":{"codehealthFindingId/v1":"1128c564e65c77fbbec83727765418cf13db2f5f6d5acf812a948827cf0e13e1"}},{"ruleId":"D2","level":"warning","message":{"text":"Resolver::single_import_can_define_name (cognitive 21): Resolver::single_import_can_define_name has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 3, match/switch 1 (2 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/ident.rs"},"region":{"startLine":1406}}}],"partialFingerprints":{"codehealthFindingId/v1":"f918d10c59514f9c5e51781b6bb1e7af6fec2f826ea49f3b5ebda348fbac0fca"}},{"ruleId":"D2","level":"warning","message":{"text":"Resolver::check_unused_macros (cognitive 21): Resolver::check_unused_macros has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 3 (4 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/macros.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"8af843c76669d10d0c9c209fd9513899b10ed4fab788af21c6c524608c6b34d6"}},{"ruleId":"D2","level":"warning","message":{"text":"CleanVisitor::check_item (cognitive 21): CleanVisitor::check_item has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 4 (7 pts), match/switch 1 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_incremental/src/persist/clean.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"d82927dc39c52dde4d1cfec91e14e7660bebe55ced23298898d26b78b4e0270a"}},{"ruleId":"D2","level":"warning","message":{"text":"Generalizer::consts (cognitive 21): Generalizer::consts has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_infer/src/infer/relate/generalize.rs"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0c66f1aeef9612828f996780ece77887399706902ecffba9f1a3721b589fe15"}},{"ruleId":"D2","level":"warning","message":{"text":"SubdiagnosticDeriveVariantBuilder::generate_field_code_inner_path (cognitive 21): SubdiagnosticDeriveVariantBuilder::generate_field_code_inner_path has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 1, match/switch 1 (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_macros/src/diagnostics/subdiagnostic.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"a54129a4d755a459b9a82b418d7e9c94e8f7aecdccf3ad693e50cfbc38f97575"}},{"ruleId":"D2","level":"warning","message":{"text":"CannotFindCrate::into_diag (cognitive 21): CannotFindCrate::into_diag has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 4 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_metadata/src/diagnostics.rs"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"7056a78ce4494335894da6404dc2583f4f17d8b2ad280e29c6568cc413c3a90b"}},{"ruleId":"D2","level":"warning","message":{"text":"CrateLocator::find_commandline_library (cognitive 21): CrateLocator::find_commandline_library has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (19 pts), boolean chains 1, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_metadata/src/locator.rs"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"a64a7af03553c114fdcceffcce689d9d08613569d5f56462caa726ab191996cd"}},{"ruleId":"D2","level":"warning","message":{"text":"EncodeContext::encode_proc_macros (cognitive 21): EncodeContext::encode_proc_macros has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (17 pts), loops 2 (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":"compiler/rustc_metadata/src/rmeta/encoder.rs"},"region":{"startLine":2116}}}],"partialFingerprints":{"codehealthFindingId/v1":"16470dda0b504e88e55ed67d0fa8cec76d6e6a2302b24e1559f0b4b71785dae0"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_metadata::fs::encode_and_write_metadata (cognitive 21): rustc_metadata::fs::encode_and_write_metadata has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (18 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_metadata/src/fs.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"eba3879e11885e1a8aee1b6c9102660d97e6503ddb3d0fda80cf932ffb9224a2"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_middle::lint::explain_lint_level_source (cognitive 21): rustc_middle::lint::explain_lint_level_source has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (17 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/lint.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"12e2123caaeffd0905c2dd0812fd643268e2adcf7e9af89ea0a7f02b033c66a7"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_middle::mir::pretty::write_allocations (cognitive 21): rustc_middle::mir::pretty::write_allocations has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (9 pts), match/switch 4 (8 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 10). Of this number, 20 points are the body\u0027s own statements and 1 belongs 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":"compiler/rustc_middle/src/mir/pretty.rs"},"region":{"startLine":1584}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1ec955c966468de97229c2dc304dd46d9672da408d6161641f15d57452d2506"}},{"ruleId":"D2","level":"warning","message":{"text":"Builder::stmt_expr (cognitive 21): Builder::stmt_expr has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 2 (5 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_build/src/builder/expr/stmt.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"203324d792025422714d13113131aec313b3d3b90d71af68dae86e7b2b767fce"}},{"ruleId":"D2","level":"warning","message":{"text":"Builder::args_and_body (cognitive 21): Builder::args_and_body has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (13 pts), match/switch 2 (4 pts), boolean chains 2, loops 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_build/src/builder/mod.rs"},"region":{"startLine":1063}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe269d5f45713e234e758c1023e4108fb8138c711b98ae17e563ccecc51b29f0"}},{"ruleId":"D2","level":"warning","message":{"text":"PatCtxt::lower_pattern_unadjusted (cognitive 21): PatCtxt::lower_pattern_unadjusted has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 3 (6 pts), boolean chains 1 (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_build/src/thir/pattern/mod.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"4292a57f66a2e1d4acf4abde71cb26a0e18a5d593ccc3af786f945bb876bb4ab"}},{"ruleId":"D2","level":"warning","message":{"text":"ThirPrinter::print_expr_kind (cognitive 21): ThirPrinter::print_expr_kind has cognitive complexity 21 (threshold 15). Drivers by points: loops 5 (11 pts), if/else 5 (9 pts), match/switch 1 (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_build/src/thir/print.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"6506b6d66613fdf71a9b4677154d4b9d8d6eeb3d3931096be01c73244130f16e"}},{"ruleId":"D2","level":"warning","message":{"text":"SimplifyMatch::unify_by_copy (cognitive 21): SimplifyMatch::unify_by_copy has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 3, 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":"compiler/rustc_mir_transform/src/match_branches.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"17e4460c28b06cd89bd478c992df660993f0144d6af72df1f797ca19eab48c02"}},{"ruleId":"D2","level":"warning","message":{"text":"AliasFixup::visit_statement (cognitive 21): AliasFixup::visit_statement has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (19 pts), match/switch 1 (2 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":"compiler/rustc_mir_transform/src/move_elimination.rs"},"region":{"startLine":1132}}}],"partialFingerprints":{"codehealthFindingId/v1":"586ec109f51b31bda44a6d081ebfd3e94043224c18c895f2a99e4e1593cd7dbe"}},{"ruleId":"D2","level":"warning","message":{"text":"SingleUseConsts::run_pass (cognitive 21): SingleUseConsts::run_pass has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (17 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":"compiler/rustc_mir_transform/src/single_use_consts.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ea515ba417365d7300f1a9ea4531c8a540ede58d34cb3979d97bec825e58cd7"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_mir_transform::coroutine::create_coroutine_resume_function (cognitive 21): rustc_mir_transform::coroutine::create_coroutine_resume_function has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (18 pts), match/switch 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/coroutine/mod.rs"},"region":{"startLine":877}}}],"partialFingerprints":{"codehealthFindingId/v1":"caccce146989c47a95e5c7b59aa6d47082a39217f0a745778b8235c023e5f38f"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_mir_transform::liveness::check_liveness (cognitive 21): rustc_mir_transform::liveness::check_liveness has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 1 (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":"compiler/rustc_mir_transform/src/liveness.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3db04b0d7d331997670ec8f98384015fac8f9c3f3cdc564c3a18d2c4b316bdf"}},{"ruleId":"D2","level":"warning","message":{"text":"MirUsedCollector::visit_terminator (cognitive 21): MirUsedCollector::visit_terminator has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 3 (6 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_monomorphize/src/collector.rs"},"region":{"startLine":822}}}],"partialFingerprints":{"codehealthFindingId/v1":"02cd2e34a462ce821be9fa39f3052dd354e429d2753c04e09b70f49c5dfeb53a"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_monomorphize::partitioning::collect_and_partition_mono_items (cognitive 21): rustc_monomorphize::partitioning::collect_and_partition_mono_items has cognitive complexity 21 (threshold 15). Drivers by points: loops 5 (11 pts), if/else 5, match/switch 2 (4 pts), boolean chains 1 (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_monomorphize/src/partitioning.rs"},"region":{"startLine":1169}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c5eb8bf8fd68eb18e70a9f7ea5d1c0cda68d5c493514146af74ed427a95b973"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::recover_colon_colon_in_pat_typo (cognitive 21): Parser::recover_colon_colon_in_pat_typo has cognitive complexity 21 (threshold 15). Drivers by points: match/switch 6 (16 pts), if/else 3 (5 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":"compiler/rustc_parse/src/parser/diagnostics.rs"},"region":{"startLine":2558}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a67ce4cfa8f2ab76521713837ba2733bc1b255d9d9890d0d536df0049220779"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_field_ident (cognitive 21): Parser::parse_field_ident has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 2 (6 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/item.rs"},"region":{"startLine":2516}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fbe5a82bfb518326017f8ecde5f798fa5cb024997ea313b7fe8c4ea69691f16"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::recover_fn_trait_with_lifetime_params (cognitive 21): Parser::recover_fn_trait_with_lifetime_params has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14 (17 pts), boolean chains 2, 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":"compiler/rustc_parse/src/parser/ty.rs"},"region":{"startLine":1596}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3ff0c0be961a6293a53b9242f59dfe54ceef5c066adb56e67ca63a7d0655aeb"}},{"ruleId":"D2","level":"warning","message":{"text":"CheckAttrVisitor::check_proc_macro (cognitive 21): CheckAttrVisitor::check_proc_macro has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (17 pts), match/switch 2 (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":"compiler/rustc_passes/src/check_attr.rs"},"region":{"startLine":1084}}}],"partialFingerprints":{"codehealthFindingId/v1":"72d7532103508b73fa3c1eef4d9c496a989735afc38372f3732fe2d67bf63745"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_query_impl::handle_cycle_error::find_item_ty_spans (cognitive 21): rustc_query_impl::handle_cycle_error::find_item_ty_spans has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 1 (4 pts), boolean chains 3, match/switch 1 (nesting depth added 12). 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":"compiler/rustc_query_impl/src/handle_cycle_error.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5777e86aec06d3b67501bec4c065dc7ff25adaa64b8bf967eb2bacb6bb39d68"}},{"ruleId":"D2","level":"warning","message":{"text":"LateResolutionVisitor::smart_resolve_report_errors (cognitive 21): LateResolutionVisitor::smart_resolve_report_errors has cognitive complexity 21 (threshold 15). Drivers by points: if/else 16 (18 pts), boolean chains 2, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/late/diagnostics.rs"},"region":{"startLine":671}}}],"partialFingerprints":{"codehealthFindingId/v1":"706f9ddc84ff2d5c4ee4d1a2ba83433e8c095c1f81695447a4b65b5d16c71d1b"}},{"ruleId":"D2","level":"warning","message":{"text":"LateResolutionVisitor::suggest_changing_type_to_const_param (cognitive 21): LateResolutionVisitor::suggest_changing_type_to_const_param has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 4, match/switch 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/late/diagnostics.rs"},"region":{"startLine":2161}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1d63082fbd450040191b8a2a505cbcc95177763f7c65004c3702888b0db481f"}},{"ruleId":"D2","level":"warning","message":{"text":"LateResolutionVisitor::detect_and_suggest_const_parameter_error (cognitive 21): LateResolutionVisitor::detect_and_suggest_const_parameter_error has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (13 pts), match/switch 2 (5 pts), boolean chains 3 (nesting depth added 4). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/late/diagnostics.rs"},"region":{"startLine":3811}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f3cc3d451395920d9589389a38dd31c57b55e6416fceeca7f4464f332e73346"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_target::callconv::powerpc64::classify (cognitive 21): rustc_target::callconv::powerpc64::classify has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 6 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_target/src/callconv/powerpc64.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2d762df94a53d3d01df7fbaccbd156727e8662b6174c7b0671eca5e68cf78aa"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_target::callconv::x86::classify_ret (cognitive 21): rustc_target::callconv::x86::classify_ret has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (11 pts), match/switch 2 (8 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_target/src/callconv/x86.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"d895945905f417b320f33f994744e0e0f37d5285830924e225ec556c8355b61a"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_target::callconv::xtensa::classify_arg_ty (cognitive 21): rustc_target::callconv::xtensa::classify_arg_ty has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 3 (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":"compiler/rustc_target/src/callconv/xtensa.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c7d949e3532147381c399e251fa9af2fe453e6e3c780ac23a3feb4db6ad4a42"}},{"ruleId":"D2","level":"warning","message":{"text":"FulfillmentCtxt::try_evaluate_obligations (cognitive 21): FulfillmentCtxt::try_evaluate_obligations has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 2 (4 pts), boolean chains 3, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/solve/fulfill.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"b389c67527384ee7fdc04a2256fc723fef07613777df4c7a6ebe08501e521249"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_trait_selection::traits::outlives_for_liveness::args_known_to_outlive_opaque_params (cognitive 21): rustc_trait_selection::traits::outlives_for_liveness::args_known_to_outlive_opaque_params has cognitive complexity 21 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 4 (6 pts), match/switch 3 (6 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/traits/outlives_for_liveness.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"a68f59d22ca0cd83c0c46a2b07e96b19d467d5aa4bdf0e9c8f84dc01c0291f56"}},{"ruleId":"D2","level":"warning","message":{"text":"NormalizesTo::consider_impl_candidate (cognitive 21): NormalizesTo::consider_impl_candidate has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (13 pts), match/switch 6 (8 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_next_trait_solver/src/solve/normalizes_to.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b098305db5c87855d1f9066b32cfb78081e23c4e88a9a5e78c6d9fa8781e660"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_type_ir::relate::structurally_relate_tys (cognitive 21): rustc_type_ir::relate::structurally_relate_tys has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (14 pts), match/switch 4 (6 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":"compiler/rustc_type_ir/src/relate.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed7311397e402a379887f862188c8d5702269e853d72a2d3036e168749bdee9f"}},{"ruleId":"D2","level":"warning","message":{"text":"libm::math::fmaf16::fmaf16 (cognitive 21): libm::math::fmaf16::fmaf16 has cognitive complexity 21 (threshold 15). Drivers by points: if/else 18 (20 pts), boolean chains 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/compiler-builtins/libm/src/math/fmaf16.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"104bdf6e1dce8bbaf76d370b9ef0e3d5f2387fa2877b917ec07f55e77b9bffd9"}},{"ruleId":"D2","level":"warning","message":{"text":"libm_test::run_cfg::arg_max_iterations (cognitive 21): libm_test::run_cfg::arg_max_iterations has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (17 pts), match/switch 3, 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":"library/compiler-builtins/libm-test/src/run_cfg.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"415557c6c71655361f07e5fff4d67b0da4f299f467c6092903390735b7dfbce2"}},{"ruleId":"D2","level":"warning","message":{"text":"core::slice::rotate::ptr_rotate_gcd (cognitive 21): core::slice::rotate::ptr_rotate_gcd has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 3 (4 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/slice/rotate.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"d77b7095f167d52f13e6e97592eeb5d26d6841b009f0b2f1c2084df59100d488"}},{"ruleId":"D2","level":"warning","message":{"text":"core::slice::sort::select::partition_at_index_loop (cognitive 21): core::slice::sort::select::partition_at_index_loop has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (20 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/slice/sort/select.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"43ed9544acf41e49a0e70783a31aee2d1278f685f6a77913385471805e8ebb69"}},{"ruleId":"D2","level":"warning","message":{"text":"Command::do_exec (cognitive 21): Command::do_exec has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14 (20 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":"library/std/src/sys/process/unix/unix.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"f450c6490133edd46802414836342fcec22f7ee59e32a4e2ad55f5b65592bfc7"}},{"ruleId":"D2","level":"warning","message":{"text":"std::sys::fs::windows::rename_inner (cognitive 21): std::sys::fs::windows::rename_inner has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (21 pts) (nesting depth added 12). 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":"library/std/src/sys/fs/windows.rs"},"region":{"startLine":1329}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3784553e48c2dea7ce32bdb17216f8d965edec88a614a66ae79583a07d72fd5"}},{"ruleId":"D2","level":"warning","message":{"text":"std::sys::io::kernel_copy::linux::copy_regular_files (cognitive 21): std::sys::io::kernel_copy::linux::copy_regular_files has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (12 pts), match/switch 4 (7 pts), boolean chains 1, loops 1 (nesting depth added 11). Of this number, 20 points are the body\u0027s own statements and 1 belongs 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":"library/std/src/sys/io/kernel_copy/linux.rs"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4dac5bf624f43ae0a0f4c5241775d82ec6c570fad46af7d0e69183ffaf5e092"}},{"ruleId":"D2","level":"warning","message":{"text":"Expression::build (cognitive 21): Expression::build has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (18 pts), match/switch 2 (3 pts) (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/stdarch-gen-arm/src/expression.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"62e4f67099d1354eba53634d466ccce0094da3110b57dce5be8f82f75a3d5dae"}},{"ruleId":"D2","level":"warning","message":{"text":"stdarch_test::assert (cognitive 21): stdarch_test::assert has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 5, loops 2, match/switch 2 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/stdarch-test/src/lib.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c8849fc77a166828266e665dfc5f0c6b1877c943605ba5d54440f21381ffdd0"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolStateCheck::run (cognitive 21): ToolStateCheck::run has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 2, loops 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/build_steps/toolstate.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"255ca2cc67eff67d73c3e1e0ff7552b0a8fc6c6ad5f81f592f0e33adb0401fe3"}},{"ruleId":"D2","level":"warning","message":{"text":"Config::maybe_download_ci_llvm (cognitive 21): Config::maybe_download_ci_llvm has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 2 (6 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/download.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"f67649b87d4b64d46992876f499ff1e419ca96f226fc77cfc42887b2dd7488d5"}},{"ruleId":"D2","level":"warning","message":{"text":"SummaryLine::next (cognitive 21): SummaryLine::next has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (18 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/markdown.rs"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6cef1e6d0900609115735c80ff620b457e4d28aa896d06a21580d3edcda6a48"}},{"ruleId":"D2","level":"warning","message":{"text":"rustdoc::clean::inline::build_module_items (cognitive 21): rustdoc::clean::inline::build_module_items has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 4, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/clean/inline.rs"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"f10add7de04b2148dacb37d66c5f8912d84564bf3a00aaac24501df928322100"}},{"ruleId":"D2","level":"warning","message":{"text":"rustdoc::doctest::run (cognitive 21): rustdoc::doctest::run has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (16 pts), match/switch 3 (5 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/doctest.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5fc5e5224aa4f210687493de4f3b5e461e81443d44e498e849ec12e9cd14f03"}},{"ruleId":"D2","level":"warning","message":{"text":"rustdoc::html::format::href_with_jump_to_def_path_depth (cognitive 21): rustdoc::html::format::href_with_jump_to_def_path_depth has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 3, match/switch 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/format.rs"},"region":{"startLine":746}}}],"partialFingerprints":{"codehealthFindingId/v1":"9479c800e864e849a04ac8bc3e661713b3fe599d6967ca0f2b9bec869fee7467"}},{"ruleId":"D2","level":"warning","message":{"text":"rustdoc::html::render::sidebar::sidebar_deref_methods (cognitive 21): rustdoc::html::render::sidebar::sidebar_deref_methods has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 5, match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/render/sidebar.rs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc5e78a1b8353ab54333e66428649d59ff5e3f221aef0f948c29a358a13422b7"}},{"ruleId":"D2","level":"warning","message":{"text":"rustdoc::passes::collect_intra_doc_links::preprocess_link (cognitive 21): rustdoc::passes::collect_intra_doc_links::preprocess_link has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 6, match/switch 3 (5 pts) (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/passes/collect_intra_doc_links.rs"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"9124b6c9c4c70179bdba6d16283488cfed54eb2165644eeeb8b0854bd4dadf96"}},{"ruleId":"D2","level":"warning","message":{"text":"PostExpansionEarlyAttributes::check_attribute (cognitive 21): PostExpansionEarlyAttributes::check_attribute has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 7, loops 1 (2 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/attrs/mod.rs"},"region":{"startLine":663}}}],"partialFingerprints":{"codehealthFindingId/v1":"492b8deb541650e08b4dba29f6bf778108e73abc18c834d8a2d985c910bb5ff6"}},{"ruleId":"D2","level":"warning","message":{"text":"Casts::check_expr (cognitive 21): Casts::check_expr has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/casts/mod.rs"},"region":{"startLine":890}}}],"partialFingerprints":{"codehealthFindingId/v1":"cae4a7c6cb609b1d5ca47b056b3ade7a9a333b899a3b5671beb9900f85facfc4"}},{"ruleId":"D2","level":"warning","message":{"text":"InsertSearcher::visit_expr (cognitive 21): InsertSearcher::visit_expr has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 1 (3 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/entry.rs"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c215e708bab684955a29e7b8c015d8e59e546e300b1862d2f8d3f11b9adf0cb"}},{"ruleId":"D2","level":"warning","message":{"text":"ToDigitIsSome::check_expr (cognitive 21): ToDigitIsSome::check_expr has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 4, match/switch 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/to_digit_is_some.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d8f83da70c39efd558612dd8e62d9f9ad7d6cd174829a2744c30b1c1d4aa8ad"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::attrs::non_minimal_cfg::check_nested_cfg (cognitive 21): clippy_lints::attrs::non_minimal_cfg::check_nested_cfg has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (18 pts), boolean chains 2, loops 1 (nesting depth added 12). 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/tools/clippy/clippy_lints/src/attrs/non_minimal_cfg.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"7446fc8a084ccf7d9ad205aa7a81edaeb403803e6b656486e676bc727ce8680b"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::booleans::check_inverted_bool_in_condition (cognitive 21): clippy_lints::booleans::check_inverted_bool_in_condition has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 1, match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/booleans.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"dacc42e737ac9224a09827fb95187466e19802d7867eef1b1bb25bc9aba9fc5d"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::literals::mistyped_literal_suffix::check (cognitive 21): clippy_lints::literals::mistyped_literal_suffix::check has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (13 pts), match/switch 2 (7 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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/tools/clippy/clippy_lints/src/literals/mistyped_literal_suffix.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1014c008dab03c42092458188533ee10eacac2fca22131bb143823d66ad8d9c"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::matches::redundant_guards::check (cognitive 21): clippy_lints::matches::redundant_guards::check has cognitive complexity 21 (threshold 15). Drivers by points: match/switch 3 (9 pts), if/else 5 (7 pts), boolean chains 4, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/matches/redundant_guards.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b8054d4440c934529275d2c0285de92135ada89433594cc853c4242c8075ab1"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::methods::or_fun_call::check_unwrap_or_default (cognitive 21): clippy_lints::methods::or_fun_call::check_unwrap_or_default has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14, boolean chains 5, match/switch 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":"src/tools/clippy/clippy_lints/src/methods/or_fun_call.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d0a12790b71f2f9424179faba6c0211f0b0b557cefd699d5f02214a6799eabe"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::missing_asserts_for_indexing::report_indexes (cognitive 21): clippy_lints::missing_asserts_for_indexing::report_indexes has cognitive complexity 21 (threshold 15). Drivers by points: match/switch 3 (12 pts), if/else 1 (4 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 13). 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/tools/clippy/clippy_lints/src/missing_asserts_for_indexing.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"40784a43eee33c69596c3498f71079be440ce74496067e713bec553c59250e89"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::needless_borrows_for_generic_args::replace_types (cognitive 21): clippy_lints::needless_borrows_for_generic_args::replace_types has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (13 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/needless_borrows_for_generic_args.rs"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d8c8a41526f723305fdb1601f3d61983d967cc090df4217fdc7dca0b05d3452"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::operators::cmp_owned::check_op (cognitive 21): clippy_lints::operators::cmp_owned::check_op has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 4, match/switch 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/operators/cmp_owned.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"83b69717641a1434aa15dc4d1c41e52e99cfd37f9cdad2d8ce72252eccc4546f"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::question_mark::check_if_let_some_or_err_and_early_return (cognitive 21): clippy_lints::question_mark::check_if_let_some_or_err_and_early_return has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 8, match/switch 1 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/question_mark.rs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"071e15f269a46e60cbccb20774ab2ffe377bbc8d77b00de8df464e5b362d705f"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::transmute::transmute_undefined_repr::reduce_ty (cognitive 21): clippy_lints::transmute::transmute_undefined_repr::reduce_ty has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (16 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/transmute/transmute_undefined_repr.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dba568ad7a825dfb1741c2ef889328fafed59bcf0f428c0f53b2f39b2e0db6c"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::useless_conversion::into_iter_bound (cognitive 21): clippy_lints::useless_conversion::into_iter_bound has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (19 pts), boolean chains 1, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/useless_conversion.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e9c01cbb3f2e45edcc16f9f243fef37bf66045d57cfe700173f17a971a180f5"}},{"ruleId":"D2","level":"warning","message":{"text":"PossibleBorrowerVisitor::visit_terminator (cognitive 21): PossibleBorrowerVisitor::visit_terminator has cognitive complexity 21 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 4 (8 pts), match/switch 1 (3 pts) (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_utils/src/mir/possible_borrower.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac3b28740d78870d7a61c5622c9774621d3dc3739cdb711b03e90e4976463a28"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_utils::can_move_expr_to_closure (cognitive 21): clippy_utils::can_move_expr_to_closure has cognitive complexity 21 (threshold 15). Drivers by points: match/switch 4 (13 pts), if/else 3 (6 pts), loops 1 (2 pts) (nesting depth added 13). 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/tools/clippy/clippy_utils/src/lib.rs"},"region":{"startLine":954}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a455a57053233a04a046cefc3600dad6c9338461fcfe492979586a251de4327"}},{"ruleId":"D2","level":"warning","message":{"text":"Node::merge_groups (cognitive 21): Node::merge_groups has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 2 (4 pts), match/switch 2 (4 pts) (nesting depth added 12). 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/tools/collect-license-metadata/src/path_tree.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"050bd795790f39ada3a49ca79fdef91f1af5a5360a659a0689414c9f642527f6"}},{"ruleId":"D2","level":"warning","message":{"text":"AnyDiagnostic::body_validation_diagnostic (cognitive 21): AnyDiagnostic::body_validation_diagnostic has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 3 (5 pts), boolean chains 4 (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/tools/rust-analyzer/crates/hir/src/diagnostics.rs"},"region":{"startLine":1446}}}],"partialFingerprints":{"codehealthFindingId/v1":"06362b0b93f71589adfb5da8f5259d433c957e1469fbc04cb3ea9c061b6e26aa"}},{"ruleId":"D2","level":"warning","message":{"text":"Trait::hir_fmt (cognitive 21): Trait::hir_fmt has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 1 (4 pts), loops 1 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir/src/display.rs"},"region":{"startLine":908}}}],"partialFingerprints":{"codehealthFindingId/v1":"572d7c47494f892bc9899c56ca386d894610aa8dd2c09e9d7a120596897bcc7f"}},{"ruleId":"D2","level":"warning","message":{"text":"BuiltinDeriveImplTrait::get_method (cognitive 21): BuiltinDeriveImplTrait::get_method has cognitive complexity 21 (threshold 15). Drivers by points: match/switch 13 (21 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/tools/rust-analyzer/crates/hir-def/src/builtin_derive.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"da8c8fd204658aed0f864976f2665cdc32f0f603fc406d4162f406dc2c491927"}},{"ruleId":"D2","level":"warning","message":{"text":"ide::folding_ranges::collapse_expr (cognitive 21): ide::folding_ranges::collapse_expr has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 2 (6 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":"src/tools/rust-analyzer/crates/ide/src/folding_ranges.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe8a9e4db2a3e2ed8417fba7508c59eb745a7782585f3f35b7cca6ff02d60f7e"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_assists::handlers::convert_tuple_return_type_to_struct::replace_usages (cognitive 21): ide_assists::handlers::convert_tuple_return_type_to_struct::replace_usages has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (4 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/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_tuple_return_type_to_struct.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"63fd4a2646a62ddaf1f1823337f812ed39abad96a90502f510ecd7fe99b1038e"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_assists::handlers::convert_tuple_struct_to_named_struct::process_struct_name_reference (cognitive 21): ide_assists::handlers::convert_tuple_struct_to_named_struct::process_struct_name_reference has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2 (4 pts), match/switch 2 (3 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/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_tuple_struct_to_named_struct.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b6367be7c50027686597ab3a7f77453d1c1546882da9e30f2697aff5e90ed65"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_assists::handlers::remove_unused_imports::module_search_scope (cognitive 21): ide_assists::handlers::remove_unused_imports::module_search_scope has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (9 pts), loops 3 (7 pts), match/switch 2 (5 pts) (nesting depth added 8). Of this number, 16 points are the body\u0027s own statements and 5 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/tools/rust-analyzer/crates/ide-assists/src/handlers/remove_unused_imports.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"605d998b5bae50ab473462e1de77e2e152d6a304df9416df311c86832645a28c"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_assists::handlers::replace_if_let_with_match::replace_if_let_with_match (cognitive 21): ide_assists::handlers::replace_if_let_with_match::replace_if_let_with_match has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (14 pts), match/switch 4 (5 pts), boolean chains 1, loops 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/replace_if_let_with_match.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b6204d6d33f8a87f686284f0a81440248a362d9f78bc3e3397695909f68941e"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_completion::completions::item_list::trait_impl::get_transformed_fn (cognitive 21): ide_completion::completions::item_list::trait_impl::get_transformed_fn has cognitive complexity 21 (threshold 15). Drivers by points: match/switch 5 (12 pts), if/else 3 (8 pts), boolean chains 1 (nesting depth added 12). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-completion/src/completions/item_list/trait_impl.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"58d32f07ede8e5d612d0cb74bed9b3870ad421f0f08d1b0b7015ed4858e49d7c"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_db::syntax_helpers::node_ext::preorder_expr_with_ctx_checker (cognitive 21): ide_db::syntax_helpers::node_ext::preorder_expr_with_ctx_checker has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (13 pts), match/switch 2 (4 pts), boolean chains 3, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-db/src/syntax_helpers/node_ext.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bc74b2996bc949ec0a2a99a40c003c1c6a27d015808b8c081051be00ea10798"}},{"ruleId":"D2","level":"warning","message":{"text":"BindingsBuilder::build_inner (cognitive 21): BindingsBuilder::build_inner has cognitive complexity 21 (threshold 15). Drivers by points: loops 4 (14 pts), if/else 1 (5 pts), match/switch 1 (2 pts) (nesting depth added 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/mbe/src/expander/matcher.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9b291ab17d631e1f62acce8acfe86b64f5167ecc623a6999c1a2d64b918c5ea"}},{"ruleId":"D2","level":"warning","message":{"text":"mbe::expander::transcriber::expand_repeat (cognitive 21): mbe::expander::transcriber::expand_repeat has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 2 (5 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/mbe/src/expander/transcriber.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfd9568aff463af4ac32aa3baa0b1367c539f5c9883c6a2865a4c8fe92fa02fd"}},{"ruleId":"D2","level":"warning","message":{"text":"mbe::parser::parse_repeat (cognitive 21): mbe::parser::parse_repeat has cognitive complexity 21 (threshold 15). Drivers by points: match/switch 7 (20 pts), loops 1 (nesting depth added 13). 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/tools/rust-analyzer/crates/mbe/src/parser.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c9fe829e654a5b50398f4f003acb7a34be30e9f9da2270d5ad0dde4a089eef5"}},{"ruleId":"D2","level":"warning","message":{"text":"parser::grammar::expressions::lhs (cognitive 21): parser::grammar::expressions::lhs has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 4, loops 1 (2 pts), match/switch 1 (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/parser/src/grammar/expressions.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"4044ec456b3c427138a398ac539df09605a212a698d859cfd1d8220748d40cc3"}},{"ruleId":"D2","level":"warning","message":{"text":"parser::grammar::items::adt::record_field_list (cognitive 21): parser::grammar::items::adt::record_field_list has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 3, loops 1 (nesting depth added 6). Most of this is not in the body itself: 6 of the 21 points are its own statements and the rest belongs to one function item inside it that branches (record_field). 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/tools/rust-analyzer/crates/parser/src/grammar/items/adt.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c79b0c476960f1a55546fd289981b9f0e9c7222b1e4b5a143a023bb5562b8e7"}},{"ruleId":"D2","level":"warning","message":{"text":"FetchMetadata::new (cognitive 21): FetchMetadata::new has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 2, loops 1, 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":"src/tools/rust-analyzer/crates/project-model/src/cargo_workspace.rs"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"188b8cec14c54e2e7e375302abaf7c6ffd11279928f985acb6dac2ff59c4188d"}},{"ruleId":"D2","level":"warning","message":{"text":"GlobalState::handle_vfs_msg (cognitive 21): GlobalState::handle_vfs_msg has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (11 pts), match/switch 3 (5 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/main_loop.rs"},"region":{"startLine":980}}}],"partialFingerprints":{"codehealthFindingId/v1":"e04a82f6f34e1f2adb530b59bdb1681e7b4cdba994c7879318895095f7c3ab4d"}},{"ruleId":"D2","level":"warning","message":{"text":"EditPlan::build (cognitive 21): EditPlan::build has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 5, match/switch 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/tools/rust-analyzer/crates/syntax/src/syntax_editor/edit_algo.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"c64993f0c5e0ef2c893d007246f8b88fff23250b836ee688acebcd02d89ee934"}},{"ruleId":"D2","level":"warning","message":{"text":"Converter::next_token (cognitive 21): Converter::next_token has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (14 pts), match/switch 2 (6 pts), loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/syntax-bridge/src/lib.rs"},"region":{"startLine":663}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2476a62b3692feb9c3fd4d49ddaf9bce27a5752dea98e8ec69902fbf4f4d837"}},{"ruleId":"D2","level":"warning","message":{"text":"rustdoc_gui_test::main (cognitive 21): rustdoc_gui_test::main has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustdoc-gui-test/src/main.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e29385c115bbf19a6cc85cb8ae26ecfcadadbd89e5db11a4a82e9c02d448a28"}},{"ruleId":"D2","level":"warning","message":{"text":"rustfmt_nightly::format_code_block (cognitive 21): rustfmt_nightly::format_code_block has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (19 pts), loops 2 (nesting depth added 8). Of this number, 18 points are the body\u0027s own statements and 3 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/tools/rustfmt/src/lib.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"b37c19c8fe329da5eac929969098543d95eb3c8d4ddfca3d6cba70de0415db56"}},{"ruleId":"D2","level":"warning","message":{"text":"rustfmt_nightly::imports::merge_use_trees_inner (cognitive 21): rustfmt_nightly::imports::merge_use_trees_inner has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (20 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/tools/rustfmt/src/imports.rs"},"region":{"startLine":847}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd65a952a69dd2fb8f348f14f055cf0b1fc8e7edc3d7d36d713c8c900270f4b0"}},{"ruleId":"D2","level":"warning","message":{"text":"rustfmt_nightly::items::format_impl_ref_and_type (cognitive 21): rustfmt_nightly::items::format_impl_ref_and_type has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (16 pts), match/switch 3 (5 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/items.rs"},"region":{"startLine":958}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca248e122df9695640727661668a7faf8edab669d257a56db2ca047ff30e03b3"}},{"ruleId":"D2","level":"warning","message":{"text":"rustfmt_nightly::items::format_generics (cognitive 21): rustfmt_nightly::items::format_generics has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14 (16 pts), boolean chains 5 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/items.rs"},"region":{"startLine":3375}}}],"partialFingerprints":{"codehealthFindingId/v1":"42b7da6e6535b988b6206e0f50bb89e56d0e8ab4c2c8906d59ca0fb66b4fcfb1"}},{"ruleId":"D2","level":"warning","message":{"text":"tidy::error_codes::check_error_codes_tests (cognitive 21): tidy::error_codes::check_error_codes_tests has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 2 (3 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/tidy/src/error_codes.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"406112d3a1534d2752d0cc0081a71584f3c918cd631092b6fb3b97405ce1ce14"}},{"ruleId":"D2","level":"warning","message":{"text":"tidy::extra_checks::check (cognitive 21): tidy::extra_checks::check has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (16 pts), match/switch 2 (3 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/tidy/src/extra_checks/mod.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"052daf1d467a89bf651b560ce2d01cfe3d6486011cad94993c9236c09f267d77"}},{"ruleId":"D2","level":"warning","message":{"text":"common.from_dict (cognitive 21): common.from_dict has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 5, error handling 1 (2 pts), loops 1 (2 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/etc/debugger_tester/common.py"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc7271aee22821432c409f2e1c9de86ee190de9f52eb02e1245053e40459ab51"}},{"ruleId":"D2","level":"warning","message":{"text":"DocSearch.getTypeData (cognitive 21): DocSearch.getTypeData has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":1814}}}],"partialFingerprints":{"codehealthFindingId/v1":"01a8560f517b1d81f313bfa6a0b0ea6b7997ae18b2e88ef58ff0e1a2d6c570db"}},{"ruleId":"D2","level":"warning","message":{"text":"DocSearch.execQuery::buildHrefAndPath (cognitive 21): DocSearch.execQuery::buildHrefAndPath has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 5, ternaries 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level. This shape REPEATS in the file: 7 other methods here (DocSearch.execQuery::formatDisplayTypeSignature::writeFn, DocSearch.execQuery::transformResults, DocSearch.execQuery::unifyFunctionTypes, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":2199}}}],"partialFingerprints":{"codehealthFindingId/v1":"299fdd673bd43fd2bd11d481f70486efc6270755dce81a985741373175dd9561"}},{"ruleId":"D2","level":"warning","message":{"text":"search.initSearch::buildHrefAndPath (cognitive 21): search.initSearch::buildHrefAndPath has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 5, ternaries 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level. This shape REPEATS in the file: 15 other methods here (search.initSearch, search.initSearch::getItemsBefore, search.initSearch::getNextElem, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 16 times rather than 16 independent problems. Splitting this body alone leaves the other 15 exactly as they are. Where these are variations on one operation, the change that clears all 16 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":2199}}}],"partialFingerprints":{"codehealthFindingId/v1":"621585342c7c6efdb96e81fd0dba8f0e4e721e336a77a7bd446ca0e00fed8d44"}},{"ruleId":"D2","level":"warning","message":{"text":"tester.loadSearchJS.doSearch (cognitive 21): tester.loadSearchJS.doSearch has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustdoc-js/tester.js"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"7254d1050564e1674ed1d0ee4975ea4c51d8613a400a8a4f8bd05afc1bbe2033"}},{"ruleId":"D2","level":"warning","message":{"text":"initSearch::getTypeData (cognitive 21): initSearch::getTypeData has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":1814}}}],"partialFingerprints":{"codehealthFindingId/v1":"091df380108af49513ea0eb8ba73bc18f3bdd3ab4693a8d737f75c5eed42f98a"}},{"ruleId":"D2","level":"warning","message":{"text":"initSearch::execQuery::buildHrefAndPath (cognitive 21): initSearch::execQuery::buildHrefAndPath has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 5, ternaries 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":2199}}}],"partialFingerprints":{"codehealthFindingId/v1":"72cb159ff976655e96545ffbb58f1a6a072d650c89d812583629ee99a094afb4"}},{"ruleId":"D2","level":"warning","message":{"text":"LoweringContext::lower_legacy_const_generics (cognitive 20): LoweringContext::lower_legacy_const_generics has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ast_lowering/src/expr.rs"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1468e477f800f274ac0e6952dd2ed3d6694faead8dee80ac24df19cf88b2539"}},{"ruleId":"D2","level":"warning","message":{"text":"AstValidator::visit_ty_common (cognitive 20): AstValidator::visit_ty_common has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (15 pts), match/switch 2 (3 pts), loops 1 (2 pts) (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":"compiler/rustc_ast_passes/src/ast_validation.rs"},"region":{"startLine":1199}}}],"partialFingerprints":{"codehealthFindingId/v1":"a98f4e33e1fec4fdab319dfffce3e42073b9897626c2a92538faffa76ab6398d"}},{"ruleId":"D2","level":"warning","message":{"text":"AstValidator::visit_param_bound (cognitive 20): AstValidator::visit_param_bound has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 4 (8 pts), if/else 2 (7 pts), loops 1 (4 pts), boolean chains 1 (nesting depth added 12). 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":"compiler/rustc_ast_passes/src/ast_validation.rs"},"region":{"startLine":1876}}}],"partialFingerprints":{"codehealthFindingId/v1":"36d1519786286f05664cd59c3c7e76f8882b45dfe53354177eb1de82a0247f30"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_borrowck::polonius::dump::emit_mermaid_cfg (cognitive 20): rustc_borrowck::polonius::dump::emit_mermaid_cfg has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 4 (8 pts), match/switch 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/polonius/dump.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"caf8a20d88cc654528c84f29ad33ac2bfdda386073e78796fa239fcae35293d5"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_borrowck::region_infer::values::pretty_print_region_elements (cognitive 20): rustc_borrowck::region_infer::values::pretty_print_region_elements has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (16 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 10). Of this number, 18 points are the body\u0027s own statements and 2 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":"compiler/rustc_borrowck/src/region_infer/values.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"59256679980e52bdb3f86a0bcdf7ba7b30608c282d5e6b8ce1e32fc458f25b3c"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_builtin_macros::contracts::expand_contract_clause (cognitive 20): rustc_builtin_macros::contracts::expand_contract_clause has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 2, loops 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":"compiler/rustc_builtin_macros/src/contracts.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"48dacfac9d18e9f8797adcebbac7e35a8bb69526236dda89bc81c079b49ed36f"}},{"ruleId":"D2","level":"warning","message":{"text":"InlineAssemblyGenerator::allocate_stack_slots (cognitive 20): InlineAssemblyGenerator::allocate_stack_slots has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 5 (6 pts), match/switch 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/src/inline_asm.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"efa41fd50de884bb518c9839b574a491d35da2b79dfb9a187c73b1e10ef90c9a"}},{"ruleId":"D2","level":"warning","message":{"text":"Builder::check_ptr_call (cognitive 20): Builder::check_ptr_call has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 4, loops 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_gcc/src/builder.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ecd89974c7af17386b4a78c4a3d6e1e557fe1f49632613e16f76a5c93855ce2"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_codegen_llvm::consts::check_and_apply_linkage (cognitive 20): rustc_codegen_llvm::consts::check_and_apply_linkage has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/consts.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"caab5bfc1d7e1fa578dc7c33105457b41b0bb44d9dbedb83b5f483c23464dd6c"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_codegen_llvm::llvm_util::configure_llvm (cognitive 20): rustc_codegen_llvm::llvm_util::configure_llvm has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10, boolean chains 6, match/switch 2 (3 pts), loops 1 (nesting depth added 1). Of this number, 19 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. 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":"compiler/rustc_codegen_llvm/src/llvm_util.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"44195d7a4f0c3f95de6725146a6f2dd9543ff16618406536a1c2d8aeda95b4d8"}},{"ruleId":"D2","level":"warning","message":{"text":"ArArchiveBuilder::add_archive (cognitive 20): ArArchiveBuilder::add_archive has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (14 pts), match/switch 3 (4 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/back/archive.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"97020f6fe4e889c057217c364ce87b277c85cc0530e7319444c767cd743f7d58"}},{"ruleId":"D2","level":"warning","message":{"text":"OperandRef::extract_field (cognitive 20): OperandRef::extract_field has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/mir/operand.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"d21596b4c806a5201c8eee8d64e58582fc5a6deb183683b0b2dcc14af81710d8"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_codegen_ssa::back::symbol_edit::macho_collect_impl (cognitive 20): rustc_codegen_ssa::back::symbol_edit::macho_collect_impl has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (18 pts), loops 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":"compiler/rustc_codegen_ssa/src/back/symbol_edit.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"2def417efc9791adb811285e5a03d2dce8db21af7a50410931c8f0ee87cf54d7"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_codegen_ssa::base::codegen_crate (cognitive 20): rustc_codegen_ssa::base::codegen_crate has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (12 pts), loops 3 (4 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 4). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/base.rs"},"region":{"startLine":713}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b29f277b2fd30b7815e5f99e09d738e93b0aa743ff6e4dbb004a30420876cae"}},{"ruleId":"D2","level":"warning","message":{"text":"TransferFunction::visit_rvalue (cognitive 20): TransferFunction::visit_rvalue has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (15 pts), boolean chains 4, match/switch 1 (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_const_eval/src/check_consts/resolver.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cfa79aaefeb118898b69f99e39e591b463d0bd0668038c876bf959a16eddaf7"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_driver_impl::install_ice_hook (cognitive 20): rustc_driver_impl::install_ice_hook has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (10 pts), match/switch 2 (7 pts), boolean chains 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_driver_impl/src/lib.rs"},"region":{"startLine":1461}}}],"partialFingerprints":{"codehealthFindingId/v1":"452fc0df7e8f7a8cac9dacddbaec2d64156f13c1ea1f23599c0450246178d6d9"}},{"ruleId":"D2","level":"warning","message":{"text":"DiagCtxtHandle::print_error_count (cognitive 20): DiagCtxtHandle::print_error_count has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (16 pts), match/switch 3, boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_errors/src/lib.rs"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"03a43e7ad7b77005236c562e10f041253d231e6f440eff3e71d5301ef38ccfe7"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_graphviz::render_opts (cognitive 20): rustc_graphviz::render_opts has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 3, loops 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_graphviz/src/lib.rs"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"49e4285506b916ca94597a5c824d1b3c18fdd842f7f710ff7f506b7331b96970"}},{"ruleId":"D2","level":"warning","message":{"text":"WfCheckingCtxt::check_test_binder_region_constraints (cognitive 20): WfCheckingCtxt::check_test_binder_region_constraints has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (15 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/check/wfcheck.rs"},"region":{"startLine":2604}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a6096256b0d413c1a94b47b0591eee05d1376944aa321fcdeb179154d8ce929"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_hir_analysis::check::check::detect_discriminant_duplicate (cognitive 20): rustc_hir_analysis::check::check::detect_discriminant_duplicate has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 2 (3 pts), boolean chains 1, match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/check/check.rs"},"region":{"startLine":2005}}}],"partialFingerprints":{"codehealthFindingId/v1":"512dfda5414409db8e834c37a1d7dc9cac3b508a748b72f8184bf2e2b524eb1e"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_hir_analysis::collect::suggest_impl_trait (cognitive 20): rustc_hir_analysis::collect::suggest_impl_trait has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/collect.rs"},"region":{"startLine":1455}}}],"partialFingerprints":{"codehealthFindingId/v1":"20399c01fdbdaf77deb47ce9571de5620da5dfc91172b2220c5c2a92184ae9e8"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_hir_analysis::collect::clauses_of::gather_explicit_clauses_of (cognitive 20): rustc_hir_analysis::collect::clauses_of::gather_explicit_clauses_of has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (10 pts), match/switch 3 (5 pts), loops 3, boolean chains 2 (nesting depth added 4). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/collect/clauses_of.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"91ac101468ea1868d6ea5671d8a3c92528bbe9dbd45ac47803875aacad771224"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_hir_analysis::collect::clauses_of::const_conditions (cognitive 20): rustc_hir_analysis::collect::clauses_of::const_conditions has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 9 (15 pts), if/else 3 (4 pts), loops 1 (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":"compiler/rustc_hir_analysis/src/collect/clauses_of.rs"},"region":{"startLine":1030}}}],"partialFingerprints":{"codehealthFindingId/v1":"b86ebf3d68a33ebb0b53e205977a71a736fb8a64e3fbe34baee7fd0684afed5b"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_hir_analysis::outlives::implicit_infer::infer_clauses (cognitive 20): rustc_hir_analysis::outlives::implicit_infer::infer_clauses has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 3 (7 pts), match/switch 1 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/outlives/implicit_infer.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2bdc3d8d10d5e54011fc76cd3b3d5c237c7898fb357899526cc2afa775baf49"}},{"ruleId":"D2","level":"warning","message":{"text":"ExprUseVisitor::walk_pat (cognitive 20): ExprUseVisitor::walk_pat has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 3 (5 pts), boolean chains 1 (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/expr_use_visitor.rs"},"region":{"startLine":828}}}],"partialFingerprints":{"codehealthFindingId/v1":"729fae2d791d30489b81462369f96cdeb4aaa779a8238f3b546d521910911b84"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::check_expr_asm (cognitive 20): FnCtxt::check_expr_asm has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 2 (5 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/expr.rs"},"region":{"startLine":3773}}}],"partialFingerprints":{"codehealthFindingId/v1":"749840e962133d18b53e8da80968c827c4b217154067712dd12ef0e4e0201346"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::note_type_is_not_clone_inner_expr (cognitive 20): FnCtxt::note_type_is_not_clone_inner_expr has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 3 (6 pts), boolean chains 1 (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/fn_ctxt/suggestions.rs"},"region":{"startLine":2219}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e0fd873a45a6524a68db0d51ba274692ea35037e8a788034fc47680464a746f"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_hir_typeck::typeck_with_inspect (cognitive 20): rustc_hir_typeck::typeck_with_inspect has cognitive complexity 20 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 1, loops 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/lib.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fa09c025fb0a3812a17310741fb2349d95bac0ff532382e6477e0aea007abd5"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_hir_typeck::check::check_fn (cognitive 20): rustc_hir_typeck::check::check_fn has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 2, loops 2, match/switch 1 (2 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":"compiler/rustc_hir_typeck/src/check.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"66f11ccf6f6dba1edba029f6d9fb3b4854aa49829998166dbd894271fd5c9120"}},{"ruleId":"D2","level":"warning","message":{"text":"InferCtxt::query_response_instantiation_guess (cognitive 20): InferCtxt::query_response_instantiation_guess has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 2 (4 pts), loops 3, boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_infer/src/infer/canonical/query_response.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"25b68949e86b462a98e613f674c6e6ed26c9e5cd2ce2a0c2e34dc552027d38e9"}},{"ruleId":"D2","level":"warning","message":{"text":"Cursor::number (cognitive 20): Cursor::number has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 3 (6 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_lexer/src/lib.rs"},"region":{"startLine":910}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2b06bade0727a59aeea9c4d62afb385d3d47bd0f54c0160ab28d7085e6aa157"}},{"ruleId":"D2","level":"warning","message":{"text":"ImproperCTypesVisitor::visit_indirection (cognitive 20): ImproperCTypesVisitor::visit_indirection has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 4, 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":"compiler/rustc_lint/src/types/improper_ctypes.rs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"cab165d6b336e6fec7a267b7deee6daf6dfbafba74694017383c9e761b136253"}},{"ruleId":"D2","level":"warning","message":{"text":"ImproperCTypesVisitor::visit_struct_or_union (cognitive 20): ImproperCTypesVisitor::visit_struct_or_union has cognitive complexity 20 (threshold 15). Drivers by points: if/else 14 (19 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":"compiler/rustc_lint/src/types/improper_ctypes.rs"},"region":{"startLine":671}}}],"partialFingerprints":{"codehealthFindingId/v1":"f82082835ddb3a346cce9abd9615c14770b150cc158e26582d02bec9ff0896b2"}},{"ruleId":"D2","level":"warning","message":{"text":"DiagnosticDeriveVariantBuilder::generate_structure_code_for_attr (cognitive 20): DiagnosticDeriveVariantBuilder::generate_structure_code_for_attr has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 2 (4 pts), loops 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_macros/src/diagnostics/diagnostic_builder.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa5c30a6616d1ff9f3aa641115e9c6cc0ae2576068ec5eec8d3fe60266e773d4"}},{"ruleId":"D2","level":"warning","message":{"text":"Children::insert (cognitive 20): Children::insert has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (13 pts), match/switch 2 (4 pts), boolean chains 2, 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":"compiler/rustc_trait_selection/src/traits/specialize/specialization_graph.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8e45b30c70293f1edd75674465f3411303acda47712639b5436b5c52c49f81d"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_middle::mir::pretty::write_mir_pretty (cognitive 20): rustc_middle::mir::pretty::write_mir_pretty has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (17 pts), loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/mir/pretty.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"900b1e6a80214078f1953053034f3eb7fc20c95a8aa75de8efe11960bbadaf6b"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_middle::ty::print::pretty::trimmed_def_paths (cognitive 20): rustc_middle::ty::print::pretty::trimmed_def_paths has cognitive complexity 20 (threshold 15). Drivers by points: if/else 3 (9 pts), match/switch 3 (6 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/ty/print/pretty.rs"},"region":{"startLine":3555}}}],"partialFingerprints":{"codehealthFindingId/v1":"ada942338c87f42c24687d08e65203ecebc2070fe177ace4bf02c93770ee37b9"}},{"ruleId":"D2","level":"warning","message":{"text":"Builder::ast_block_stmts (cognitive 20): Builder::ast_block_stmts has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 2, loops 2, match/switch 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_build/src/builder/block.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"6304be68e0ae6813024cb16807b4089158e47359295f4df874bce216d0b39e8e"}},{"ruleId":"D2","level":"warning","message":{"text":"Analysis::iterate_to_fixpoint (cognitive 20): Analysis::iterate_to_fixpoint has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 2, loops 2, match/switch 1 (2 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":"compiler/rustc_mir_dataflow/src/framework/mod.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"94c77a2bd8a766e56f35f91ccb9f93f53da8e271b8eb07e1ac0a298247749924"}},{"ruleId":"D2","level":"warning","message":{"text":"MoveDataBuilder::gather_terminator (cognitive 20): MoveDataBuilder::gather_terminator has cognitive complexity 20 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 3 (6 pts), match/switch 2 (4 pts) (nesting depth added 12). 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":"compiler/rustc_mir_dataflow/src/move_paths/builder.rs"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"b17e4a1cfbb995a18902907279be06fe539638bfe3c24495cd63dae51aa13b9e"}},{"ruleId":"D2","level":"warning","message":{"text":"DropCtxt::open_drop_for_array (cognitive 20): DropCtxt::open_drop_for_array has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 1 (3 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/elaborate_drop.rs"},"region":{"startLine":1333}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f978fb8bccd0a5ff6dd25a565623f16557a973632995aae87a49173cf3d1e2d"}},{"ruleId":"D2","level":"warning","message":{"text":"VnState::simplify_aggregate (cognitive 20): VnState::simplify_aggregate has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 3, match/switch 2 (3 pts), loops 1 (2 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":"compiler/rustc_mir_transform/src/gvn.rs"},"region":{"startLine":1201}}}],"partialFingerprints":{"codehealthFindingId/v1":"af2da5b7881bb896de1e0dbe8fefcc09b7912f82591e1331e542393c81758c49"}},{"ruleId":"D2","level":"warning","message":{"text":"SimplifyConstCondition::run_pass (cognitive 20): SimplifyConstCondition::run_pass has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (9 pts), boolean chains 5, loops 2 (3 pts), match/switch 2 (3 pts) (nesting depth added 7). Of this number, 18 points are the body\u0027s own statements and 2 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":"compiler/rustc_mir_transform/src/simplify_branches.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"06a7c8f539c2dcf881f74265bf5c46d063bcfeb162457554ebf9d537e4d5a5ba"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_mir_transform::jump_threading::simplify_conditions (cognitive 20): rustc_mir_transform::jump_threading::simplify_conditions has cognitive complexity 20 (threshold 15). Drivers by points: loops 6 (12 pts), if/else 2 (5 pts), match/switch 1 (3 pts) (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/jump_threading.rs"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"b20fa9cb80bf4204640374d7d1ad4e738530c829ef532440f76255fd879659ce"}},{"ruleId":"D2","level":"warning","message":{"text":"RootCollector::process_item (cognitive 20): RootCollector::process_item has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (15 pts), match/switch 2 (4 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":"compiler/rustc_monomorphize/src/collector.rs"},"region":{"startLine":1604}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7d6f439243430fa1b767e7482dae0351b763ebd10d3c6e9ea225d5d76bc440b"}},{"ruleId":"D2","level":"warning","message":{"text":"EvalCtxt::filter_specialized_impls (cognitive 20): EvalCtxt::filter_specialized_impls has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 2 (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":"compiler/rustc_next_trait_solver/src/solve/assembly/mod.rs"},"region":{"startLine":1089}}}],"partialFingerprints":{"codehealthFindingId/v1":"57c1cbfbf6f2ecc7a281d8c46a21f20a746a4fab5bcfec86cbe3ae9d2ada48bc"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_next_trait_solver::canonical::compute_query_response_instantiation_values_in_universe (cognitive 20): rustc_next_trait_solver::canonical::compute_query_response_instantiation_values_in_universe has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_next_trait_solver/src/canonical/mod.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c50dd77ffb18da76029a8d57fdb28f84ecb33ffc15995940dddb6e68c8e2a0c"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::report_inc_dec_op (cognitive 20): Parser::report_inc_dec_op has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 5 (6 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/expr/diagnostics.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b3ce1221f0496a47d0c73a27b3fb8cb05da54956c76f87a5e9c5e87485b4d87"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_ty_param (cognitive 20): Parser::parse_ty_param has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/generics.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"fac5c615b03e9c99b011a74f1696376957bf0fdf42b457041ca5d3e906b7cddd"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_item_list (cognitive 20): Parser::parse_item_list has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 4, match/switch 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/item.rs"},"region":{"startLine":956}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cd53525bf5f94244ce5f6dcc9ec48782e4dc4fc733d232d5ad6c8668520a584"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_enum_variant (cognitive 20): Parser::parse_enum_variant has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (16 pts), match/switch 2 (4 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":"compiler/rustc_parse/src/parser/item.rs"},"region":{"startLine":1958}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8ed5b5ab74ac6c97af8633f849ad308aeda698152a339944f171ff92a114de3"}},{"ruleId":"D2","level":"warning","message":{"text":"MarkSymbolVisitor::check_impl_or_impl_item_live (cognitive 20): MarkSymbolVisitor::check_impl_or_impl_item_live has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 3 (6 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_passes/src/dead.rs"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc96293ab91ae5ee1389b0a31534363440c262df3e240aa5a7bb0215fe058951"}},{"ruleId":"D2","level":"warning","message":{"text":"DefCollector::build_reduced_graph_for_item (cognitive 20): DefCollector::build_reduced_graph_for_item has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 1 (3 pts), boolean chains 2, match/switch 1 (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/build_reduced_graph.rs"},"region":{"startLine":826}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7538f66ba0f185886766eab8e0b13027dab2c276ef095c5344e2dfcc0d543ca"}},{"ruleId":"D2","level":"warning","message":{"text":"LateResolutionVisitor::visit_fn (cognitive 20): LateResolutionVisitor::visit_fn has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 4 (5 pts), loops 2 (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":"compiler/rustc_resolve/src/late.rs"},"region":{"startLine":1174}}}],"partialFingerprints":{"codehealthFindingId/v1":"75d536053036f6e32d5dbcd0448d413894ab064f103bf44fefbb2de768882744"}},{"ruleId":"D2","level":"warning","message":{"text":"LateResolutionVisitor::visit_generic_params (cognitive 20): LateResolutionVisitor::visit_generic_params has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 4 (8 pts), match/switch 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":"compiler/rustc_resolve/src/late.rs"},"region":{"startLine":1794}}}],"partialFingerprints":{"codehealthFindingId/v1":"463e152839b206c9e4d74680527f162babd15cf3536180918018dfa6710ce323"}},{"ruleId":"D2","level":"warning","message":{"text":"LateResolutionVisitor::resolve_qpath (cognitive 20): LateResolutionVisitor::resolve_qpath has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/late.rs"},"region":{"startLine":5226}}}],"partialFingerprints":{"codehealthFindingId/v1":"951edc025763d8f7f0c8ad4ce8733397b405f0160509646508a55d6e3df6802e"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_sanitizers::cfi::typeid::itanium_cxx_abi::encode::encode_const_value (cognitive 20): rustc_sanitizers::cfi::typeid::itanium_cxx_abi::encode::encode_const_value has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 3 (6 pts), match/switch 1 (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_sanitizers/src/cfi/typeid/itanium_cxx_abi/encode.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ccb668b017433b1f00a69427592791df129624c0ae947e1ac103d5ec9f75526"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_symbol_mangling::compute_symbol_name (cognitive 20): rustc_symbol_mangling::compute_symbol_name has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (11 pts), match/switch 2 (5 pts), boolean chains 4 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_symbol_mangling/src/lib.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf8e7d6deae2b8d3c5d27a5c45b545aa625bff74f6a9789f3ec2c1dff0d7db70"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_target::callconv::powerpc::classify_arg (cognitive 20): rustc_target::callconv::powerpc::classify_arg has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 4 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_target/src/callconv/powerpc.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6f8dc86cd721da675d0e92f70398ec79337efcf7bdd09940ba22a1272f8ef5d"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_target::callconv::s390x::classify_arg (cognitive 20): rustc_target::callconv::s390x::classify_arg has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (14 pts), match/switch 2 (4 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_target/src/callconv/s390x.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"2720043964c6ed56245740a884bbb42fe1e93cdce89d4eb0f387b9d7f12ec522"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeErrCtxt::type_error_additional_suggestions (cognitive 20): TypeErrCtxt::type_error_additional_suggestions has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 4, match/switch 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/error_reporting/infer/mod.rs"},"region":{"startLine":1996}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b1bff4cd04f0dc2e4e5da998d2a6b31ae936c70f04b3be7d816bf43f05ccc58"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeErrCtxt::check_on_type_error_attribute (cognitive 20): TypeErrCtxt::check_on_type_error_attribute has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 2 (6 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/error_reporting/infer/mod.rs"},"region":{"startLine":2147}}}],"partialFingerprints":{"codehealthFindingId/v1":"e73167d74d74c10b7eeb54fe3308b9edfa7a1a32f94e033872c81570fd69a642"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeErrCtxt::report_region_errors (cognitive 20): TypeErrCtxt::report_region_errors has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 1 (3 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/error_reporting/infer/region.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"b18fdffb875478671e3d4df5723c791dcf74dd8ac884b0fd45e8283ed73f2b24"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeErrCtxt::annotate_source_of_ambiguity (cognitive 20): TypeErrCtxt::annotate_source_of_ambiguity has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (8 pts), match/switch 3 (6 pts), boolean chains 5, 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":"compiler/rustc_trait_selection/src/error_reporting/traits/ambiguity.rs"},"region":{"startLine":822}}}],"partialFingerprints":{"codehealthFindingId/v1":"60e8d613831cfdba0fdbdad09ffd9b61138ec9a72551d71cb11a2b780140e701"}},{"ruleId":"D2","level":"warning","message":{"text":"AutoTraitFinder::evaluate_predicates (cognitive 20): AutoTraitFinder::evaluate_predicates has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 2, match/switch 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/traits/auto_trait.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"043c104e7d89c476fc50cc044cc458db6b3edcbbeaf1d41da1106285177713fb"}},{"ruleId":"D2","level":"warning","message":{"text":"SelectionContext::assemble_closure_candidates (cognitive 20): SelectionContext::assemble_closure_candidates has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 2 (3 pts), boolean chains 2 (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":"compiler/rustc_trait_selection/src/traits/select/candidate_assembly.rs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"82117ec8974329c9f84ea2ee2ff794a127eea7432bf3a0cddbf97722c0c6abb7"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_trait_selection::traits::dyn_compatibility::dyn_compatibility_violations_for_assoc_item (cognitive 20): rustc_trait_selection::traits::dyn_compatibility::dyn_compatibility_violations_for_assoc_item has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/traits/dyn_compatibility.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7ad6e0db49532698b3cd06b93624fa41bee4688180089042632b7da955e46f6"}},{"ruleId":"D2","level":"warning","message":{"text":"libm::math::generic::sqrt::sqrt_round (cognitive 20): libm::math::generic::sqrt::sqrt_round has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (16 pts), match/switch 3 (4 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/compiler-builtins/libm/src/math/generic/sqrt.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"58e7179ea4ad18bc1b0d56f16424fac6f29b02cef5bcaab152a5a197348fcc2e"}},{"ruleId":"D2","level":"warning","message":{"text":"libm::math::jn::yn (cognitive 20): libm::math::jn::yn has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (14 pts), boolean chains 2, loops 1 (2 pts), match/switch 1 (2 pts) (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/compiler-builtins/libm/src/math/jn.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"be36d7d3c762f9d0ea2d2789773772c2a67c865c257aea64eea9cb0e5609f2ad"}},{"ruleId":"D2","level":"warning","message":{"text":"Channel::start_recv (cognitive 20): Channel::start_recv has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 1 (3 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sync/mpmc/array.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac639c6847f547db9013b14c0efb452534f6b6328d85f95d797d64f0640cce3b"}},{"ruleId":"D2","level":"warning","message":{"text":"RwLock::lock_contended (cognitive 20): RwLock::lock_contended has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 2 (4 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/sync/rwlock/queue.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"f52087faf8c20a0030eea35be7b0618f78c5f55e1d87e8c9600ef0ac20eeb716"}},{"ruleId":"D2","level":"warning","message":{"text":"RwLock::unlock_queue (cognitive 20): RwLock::unlock_queue has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 1 (3 pts), boolean chains 1, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/sync/rwlock/queue.rs"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f77c134b72c5ad5cf0c66b82b57f709ae8b00ce00ef626b070cf61420fe3e04"}},{"ruleId":"D2","level":"warning","message":{"text":"LazyKey::init (cognitive 20): LazyKey::init has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (18 pts), match/switch 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/thread_local/key/windows.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc4a47119abdb07d76c2a267e7c0d9759f52287d1b605852af963248c17d03d7"}},{"ruleId":"D2","level":"warning","message":{"text":"std::sys::args::windows::append_arg (cognitive 20): std::sys::args::windows::append_arg has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 2, match/switch 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/args/windows.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"e883549bc6bd0e83ecce6c8ae32464431afeeac942a0cffe82d95d15dd69adf3"}},{"ruleId":"D2","level":"warning","message":{"text":"std::sys::process::windows::child_pipe::child_pipe (cognitive 20): std::sys::process::windows::child_pipe::child_pipe has cognitive complexity 20 (threshold 15). Drivers by points: if/else 15 (16 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/process/windows/child_pipe.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"19bd9e387253fc48bb743f4c47e4000e190fec6defaa959342427b2b01e5e654"}},{"ruleId":"D2","level":"warning","message":{"text":"Wildcard::from_str (cognitive 20): Wildcard::from_str has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (18 pts), match/switch 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/stdarch-gen-arm/src/wildcards.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"c71c3167aadacfc8e7d4e1f24de3816b423ff2318a7f4324b47e9ff7546ea82a"}},{"ruleId":"D2","level":"warning","message":{"text":"Std::run (cognitive 20): Std::run has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (14 pts), loops 1 (3 pts), match/switch 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/build_steps/doc.rs"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"76546e1f756a994e6a0232e2bd3d0caae6beb21b338f2cab7313146fce6b8bb7"}},{"ruleId":"D2","level":"warning","message":{"text":"Vendor::run (cognitive 20): Vendor::run has cognitive complexity 20 (threshold 15). Drivers by points: loops 4 (9 pts), if/else 6 (8 pts), match/switch 2 (3 pts) (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/build_steps/vendor.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"c19c2dc1feb919166b22d9421d855230bc0e86a1342642378700198330e5f8b6"}},{"ruleId":"D2","level":"warning","message":{"text":"bootstrap::core::build_steps::tool::prepare_tool_cargo (cognitive 20): bootstrap::core::build_steps::tool::prepare_tool_cargo has cognitive complexity 20 (threshold 15). Drivers by points: if/else 15 (18 pts), boolean chains 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/build_steps/tool.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"108c0aa4387e6c73297de6d52b6ec9d4faacc0c548cdd01f0324d3b1cda099e4"}},{"ruleId":"D2","level":"warning","message":{"text":"citool::analysis::report_test_diffs (cognitive 20): citool::analysis::report_test_diffs has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (7 pts), loops 5 (7 pts), match/switch 4 (6 pts) (nesting depth added 5). Of this number, 16 points are the body\u0027s own statements and 4 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ci/citool/src/analysis.rs"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"a97e49d0ca110a18b7ad250b34fd80f001eb2edbdaf1c5da878e0f704c214913"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassStack::push (cognitive 20): ClassStack::push has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 5 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/highlight.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"e65885a0bbcf986ced659495b211bd723097425705f38ef6442b78c5964bc6cf"}},{"ruleId":"D2","level":"warning","message":{"text":"Classifier::get_full_ident_path (cognitive 20): Classifier::get_full_ident_path has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 5, loops 2 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/highlight.rs"},"region":{"startLine":984}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ae5f2d4fcb547a20adfab3408d7781e1aea0943fef3f953116d491e79f88763"}},{"ruleId":"D2","level":"warning","message":{"text":"Disambiguator::from_str (cognitive 20): Disambiguator::from_str has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (4 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/passes/collect_intra_doc_links.rs"},"region":{"startLine":1773}}}],"partialFingerprints":{"codehealthFindingId/v1":"f119222502406bb1e4c7e792ea1b28b47d7d323824b93efcdbc7f698ee5b6a90"}},{"ruleId":"D2","level":"warning","message":{"text":"ItemNameRepetitions::check_name_repetition (cognitive 20): ItemNameRepetitions::check_name_repetition has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 5 (nesting depth added 8). 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/tools/clippy/clippy_lints/src/item_name_repetitions.rs"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d0f666dd8c6901efa2f15d04a6804862357d168102d2f83a33885730c5ccc64"}},{"ruleId":"D2","level":"warning","message":{"text":"ManualStrip::check_expr (cognitive 20): ManualStrip::check_expr has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 2 (5 pts), boolean chains 4 (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/tools/clippy/clippy_lints/src/manual_strip.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb02fb51b03d5a75b4b72d8a95a3fbc6b757fb2a4b70d1910d525f56c623a685"}},{"ruleId":"D2","level":"warning","message":{"text":"TraitBounds::check_trait_item (cognitive 20): TraitBounds::check_trait_item has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 2 (5 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/trait_bounds.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dfe54ec77b0e9437c3477612627f6b49859bb8bb8c2a2deac934ee1fb5a6482"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::attrs::deprecated_attributes_without_fields::check_fields (cognitive 20): clippy_lints::attrs::deprecated_attributes_without_fields::check_fields has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/attrs/deprecated_attributes_without_fields.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc716474526a4d273a6e763a57cafa9a40e14fafd6637638df7df1dcc00efc97"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::cargo::lint_groups_priority::check (cognitive 20): clippy_lints::cargo::lint_groups_priority::check has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 1 (3 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/cargo/lint_groups_priority.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce7335e78262f8bcdfe184036a42e614b7fc0c4f9586a85c6d80f24ea4cba990"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::casts::unnecessary_cast::is_cast_from_ty_alias (cognitive 20): clippy_lints::casts::unnecessary_cast::is_cast_from_ty_alias has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 4 (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/tools/clippy/clippy_lints/src/casts/unnecessary_cast.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"a32c88ef17f88274bdda715d4742b3b1e4ef92c94e1d0a76474d7f1611f11d5d"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::doc::markdown::check_word (cognitive 20): clippy_lints::doc::markdown::check_word has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 9 (nesting depth added 2). Of this number, 11 points are the body\u0027s own statements and 9 belong to 3 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/doc/markdown.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"b48fa033a16033cf885a379483dd3f22f98c7f24417041ed9f336c7db3e80332"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::functions::not_unsafe_ptr_arg_deref::check_raw_ptr (cognitive 20): clippy_lints::functions::not_unsafe_ptr_arg_deref::check_raw_ptr has cognitive complexity 20 (threshold 15). Drivers by points: loops 2 (9 pts), if/else 3 (7 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 13). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/functions/not_unsafe_ptr_arg_deref.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a652963170ba896609ac42ced375177c73b6593ae1f1106d043a1e833ffb3a8"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::lifetimes::has_where_lifetimes (cognitive 20): clippy_lints::lifetimes::has_where_lifetimes has cognitive complexity 20 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 3 (7 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/lifetimes.rs"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"80e5784e64610e515988190c61dff464bcf1ba40e631d73b257f0458ffcec531"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::loops::while_let_on_iterator::is_expr_same_child_or_parent_field (cognitive 20): clippy_lints::loops::while_let_on_iterator::is_expr_same_child_or_parent_field has cognitive complexity 20 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 2 (5 pts), match/switch 2 (4 pts), boolean chains 2 (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/tools/clippy/clippy_lints/src/loops/while_let_on_iterator.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"18933c7ece420f752f47340489ed02276afd0019a0183ac2c69baa2664e48c10"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::matches::match_like_matches::check_match (cognitive 20): clippy_lints::matches::match_like_matches::check_match has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 6, loops 1 (2 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/tools/clippy/clippy_lints/src/matches/match_like_matches.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3c4ba19817edb84d7b6df46a9e27dd513cd74cad3283c86395d20cf28fea761"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::methods::map_with_unused_argument_over_ranges::extract_count_with_applicability (cognitive 20): clippy_lints::methods::map_with_unused_argument_over_ranges::extract_count_with_applicability has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 1 (4 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/methods/map_with_unused_argument_over_ranges.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"08b9f74b0b42e05b87684b308f9571cbbb7f49204c0537fde21ccd0b7f243afd"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::ranges::check_reversed_empty_range (cognitive 20): clippy_lints::ranges::check_reversed_empty_range has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 3 (7 pts), boolean chains 2, loops 1 (nesting depth added 9). Of this number, 16 points are the body\u0027s own statements and 4 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/ranges.rs"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"75f8470fcee9dca87ad83844f20d13a76e418e42bd34ac1e5cb22d3e0007352f"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::regex::check_regex (cognitive 20): clippy_lints::regex::check_regex has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 2 (5 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/regex.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"d075064fb556c5d4d39b6ad84f796f1a2e4b8c11f2e005e361138f6d028debf9"}},{"ruleId":"D2","level":"warning","message":{"text":"LintWithoutLintPass::check_item (cognitive 20): LintWithoutLintPass::check_item has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 1 (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints_internal/src/lint_without_lint_pass.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffcef11a1ffff6ea322f56c900566e85e93b1c9e8811430d8359105186ac29fe"}},{"ruleId":"D2","level":"warning","message":{"text":"ConstEvalCtxt::binop (cognitive 20): ConstEvalCtxt::binop has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 7 (14 pts), boolean chains 3, if/else 1 (3 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/tools/clippy/clippy_utils/src/consts.rs"},"region":{"startLine":1026}}}],"partialFingerprints":{"codehealthFindingId/v1":"d818de278f9d94b4caf0ff8e170780550be5fd7dd05d5d97c92064dee11e22d1"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_utils::expr_use_sites (cognitive 20): clippy_utils::expr_use_sites has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (17 pts), match/switch 2 (3 pts) (nesting depth added 12). 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/tools/clippy/clippy_utils/src/lib.rs"},"region":{"startLine":2698}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b7a092795d2fbc4f4f1f2bfa7b6a04f7008880f1360ae06db04cf7c4f649a56"}},{"ruleId":"D2","level":"warning","message":{"text":"Crate::run_clippy_lints (cognitive 20): Crate::run_clippy_lints has cognitive complexity 20 (threshold 15). Drivers by points: if/else 15 (16 pts), loops 1 (2 pts), boolean chains 1, match/switch 1 (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":"src/tools/clippy/lintcheck/src/main.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"322a8bc718a2847fb9ef10bb0410b952c1fbd640d02eb97ec5eaea3db3f33bd0"}},{"ruleId":"D2","level":"warning","message":{"text":"lintcheck::lintcheck (cognitive 20): lintcheck::lintcheck has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (15 pts), loops 2 (4 pts), match/switch 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/lintcheck/src/main.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"f15befc15f6b68dc706271bd5492ec3635ae3508253f860b9511da41af678c40"}},{"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":"src/tools/miri/priroda/src/main.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d4ad9f4ad232eb22980e5ba243307604aed7f16ec2934b151c112f3879b89a0"}},{"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/tools/miri/src/shims/foreign_items.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"cce02dda8a1b8d73f154962b90d79161323af53ed2be72c0c5517d0cc0bfa363"}},{"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/tools/miri/src/shims/unix/fs.rs"},"region":{"startLine":2372}}}],"partialFingerprints":{"codehealthFindingId/v1":"1960adb886baa6e39bfc15d69f860e07feaac5270707185203f3f4d228e722af"}},{"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/tools/miri/src/eval.rs"},"region":{"startLine":644}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bc81808a0ea2fdb244f60e51b18d8cb44a442738bac4682248ca6387bf6c791"}},{"ruleId":"D2","level":"warning","message":{"text":"InactiveReason::fmt (cognitive 20): InactiveReason::fmt has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (10 pts), match/switch 2 (6 pts), loops 2 (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/tools/rust-analyzer/crates/cfg/src/lib.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"00ddc18766f0ef9d2738faca6d9b14e400272344def3169f1bad4c6b83f49676"}},{"ruleId":"D2","level":"warning","message":{"text":"AnyDiagnostic::inference_diagnostic (cognitive 20): AnyDiagnostic::inference_diagnostic has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 11 (20 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/tools/rust-analyzer/crates/hir/src/diagnostics.rs"},"region":{"startLine":1578}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf84b69686c887b360c154f064881dcd49356d2fb1c3469536d3194092298f70"}},{"ruleId":"D2","level":"warning","message":{"text":"ExprCollector::collect_range_expr (cognitive 20): ExprCollector::collect_range_expr has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (18 pts), boolean chains 1, 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":"src/tools/rust-analyzer/crates/hir-def/src/expr_store/lower.rs"},"region":{"startLine":1942}}}],"partialFingerprints":{"codehealthFindingId/v1":"64b4d81dc1c45a390d2ea1e27ad56b9c0c73855abcbbf82e8f00ab1604e2bd7e"}},{"ruleId":"D2","level":"warning","message":{"text":"DefCollector::update_recursive (cognitive 20): DefCollector::update_recursive has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 3 (8 pts), loops 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/nameres/collector.rs"},"region":{"startLine":1111}}}],"partialFingerprints":{"codehealthFindingId/v1":"c02697a6c0f5c7b2cbe203cf0b77a4b5d4833e333c7cf49032f6eb32a2557a8d"}},{"ruleId":"D2","level":"warning","message":{"text":"MacroCallId::expand_speculative (cognitive 20): MacroCallId::expand_speculative has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (16 pts), match/switch 3, 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/tools/rust-analyzer/crates/hir-expand/src/lib.rs"},"region":{"startLine":783}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ca782ce6b0f16f5ca402937ba3ff933b888bbc12dc92ef9bde0b8db24141725"}},{"ruleId":"D2","level":"warning","message":{"text":"hir_expand::builtin::fn_macro::cfg_select_expand (cognitive 20): hir_expand::builtin::fn_macro::cfg_select_expand has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 3 (5 pts), boolean chains 4, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-expand/src/builtin/fn_macro.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"a51f4f259ee9d58466a785f9b09932644403593ca8ab12e1781cdf0792765735"}},{"ruleId":"D2","level":"warning","message":{"text":"TyLoweringContext::lower_ty_ext (cognitive 20): TyLoweringContext::lower_ty_ext has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 4 (10 pts), if/else 3 (9 pts), boolean chains 1 (nesting depth added 12). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/lower.rs"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"60de90b7614f8a9467311bd90a8d82710969d770e4e8e21d4d6f381e8558c361"}},{"ruleId":"D2","level":"warning","message":{"text":"Evaluator::exec_atomic_intrinsic (cognitive 20): Evaluator::exec_atomic_intrinsic has cognitive complexity 20 (threshold 15). Drivers by points: if/else 17 (18 pts), boolean chains 2 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/mir/eval/shim.rs"},"region":{"startLine":1511}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9ff9a39a9add303cb5928a3cd6cebf4987aaaa11cc27343a3790fecd31bfd5e"}},{"ruleId":"D2","level":"warning","message":{"text":"MirLowerCtx::lower_params_and_bindings (cognitive 20): MirLowerCtx::lower_params_and_bindings has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 2, loops 2, 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/tools/rust-analyzer/crates/hir-ty/src/mir/lower.rs"},"region":{"startLine":1758}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dd4fd05fda219eb2a0e58e86b8082835a37038dd1b7945cb1dd682d58021932"}},{"ruleId":"D2","level":"warning","message":{"text":"InferCtxt::query_response_instantiation_guess (cognitive 20): InferCtxt::query_response_instantiation_guess has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 2 (4 pts), loops 3, boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/canonical/instantiate.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"b35965f2f5afb20e1135b6be53dea13f3a3f38696c15b2e22f6d7ed8e6067d12"}},{"ruleId":"D2","level":"warning","message":{"text":"hir_ty::next_solver::util::sizedness_fast_path (cognitive 20): hir_ty::next_solver::util::sizedness_fast_path has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 4, loops 1 (3 pts), match/switch 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/next_solver/util.rs"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"56a5a914cbee4b871ec405104be9d211172c94e0c3a0218327371b7982d65f93"}},{"ruleId":"D2","level":"warning","message":{"text":"ide::call_hierarchy::incoming_calls (cognitive 20): ide::call_hierarchy::incoming_calls has cognitive complexity 20 (threshold 15). Drivers by points: if/else 3 (11 pts), match/switch 3 (5 pts), loops 2 (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/tools/rust-analyzer/crates/ide/src/call_hierarchy.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f1a96d9b363428f536e67600ebbde79ad2623bd1098d458cb330528fc61eff9"}},{"ruleId":"D2","level":"warning","message":{"text":"ide::expand_macro::expand_macro (cognitive 20): ide::expand_macro::expand_macro has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 2 (3 pts), boolean chains 1, match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/expand_macro.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"25456d77891b318b1117b68446a42d961e34e6e064b26c2c067048ecf7e1a37c"}},{"ruleId":"D2","level":"warning","message":{"text":"ide::extend_selection::try_extend_selection (cognitive 20): ide::extend_selection::try_extend_selection has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 3, match/switch 2 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/extend_selection.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"08fb306d2a014c65731436cc906803642d8f12ed4e2a9a493b7f25d5b3c100a7"}},{"ruleId":"D2","level":"warning","message":{"text":"ide::goto_type_definition::goto_type_definition (cognitive 20): ide::goto_type_definition::goto_type_definition has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (14 pts), match/switch 3 (4 pts), loops 1 (2 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/tools/rust-analyzer/crates/ide/src/goto_type_definition.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d29a5f08c1e77ec45816e1a3756c3304b95ec51446d531be2c6db7de44e6580"}},{"ruleId":"D2","level":"warning","message":{"text":"ide::hover::render::try_expr (cognitive 20): ide::hover::render::try_expr has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/hover/render.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"670010c7620bddf1508d5d5767e15d060cbed82bb52fe1cab89902633aeb7830"}},{"ruleId":"D2","level":"warning","message":{"text":"ide::rename::find_definitions (cognitive 20): ide::rename::find_definitions has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 6 (10 pts), if/else 8 (9 pts), boolean chains 1 (nesting depth added 5). 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/tools/rust-analyzer/crates/ide/src/rename.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"a615b58548c422597d88aafd37a4b18e74676c93307af2eb0d301f1b3dd9262e"}},{"ruleId":"D2","level":"warning","message":{"text":"ide::syntax_highlighting::inject::doc_comment (cognitive 20): ide::syntax_highlighting::inject::doc_comment has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 3 (6 pts), match/switch 3 (4 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/syntax_highlighting/inject.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"5688a3895e2ad37034026628153434ca3fd57bf8e5c34abfa8d5324ad36d21f8"}},{"ruleId":"D2","level":"warning","message":{"text":"ide::typing::on_eq_typed (cognitive 20): ide::typing::on_eq_typed has cognitive complexity 20 (threshold 15). Drivers by points: if/else 16 (17 pts), boolean chains 3 (nesting depth added 1). Most of this is not in the body itself: 5 of the 20 points are its own statements and the rest belongs to 3 function items inside it that branch (assign_expr, let_stmt, assign_to_eq). 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/tools/rust-analyzer/crates/ide/src/typing.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"4882f01bcdd461dad202b9f36f3bf34437fe244cc5c3a8ecb20109db83aa2623"}},{"ruleId":"D2","level":"warning","message":{"text":"Anchor::from (cognitive 20): Anchor::from has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 3, match/switch 2 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/extract_variable.rs"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8a16ff2352daaf4163ad4cd8658e72514022d6d882c8a86df8bd45340fb1065"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_assists::handlers::extract_function::fix_param_usages (cognitive 20): ide_assists::handlers::extract_function::fix_param_usages has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 4 (5 pts), boolean chains 3, match/switch 1 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/extract_function.rs"},"region":{"startLine":2033}}}],"partialFingerprints":{"codehealthFindingId/v1":"d15e354402f37cfbf9098d45b64ba25dc2cacdb4023985775562646f0bd11089"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_assists::handlers::generate_delegate_trait::remove_useless_where_clauses (cognitive 20): ide_assists::handlers::generate_delegate_trait::remove_useless_where_clauses has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_delegate_trait.rs"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ee1a931cd32098a210dc206a0e2f26337106020bb84d2d9734af1f98e69aba0"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_assists::handlers::inline_local_variable::inline_local_variable (cognitive 20): ide_assists::handlers::inline_local_variable::inline_local_variable has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 2, match/switch 2, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/inline_local_variable.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ca1954a6f9e19b806f276a1ac9aa10813f29f230abd8115a92b0c88e45a51b6"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_assists::handlers::move_guard::move_arm_cond_to_match_guard (cognitive 20): ide_assists::handlers::move_guard::move_arm_cond_to_match_guard has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (11 pts), match/switch 4 (7 pts), boolean chains 1, loops 1 (nesting depth added 4). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/move_guard.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"183ba6e0131ac4fba29655a9921ac15e0b8a44489085096042833a9294b55d07"}},{"ruleId":"D2","level":"warning","message":{"text":"ReplacementRenderer::render_token (cognitive 20): ReplacementRenderer::render_token has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 1 (4 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-ssr/src/replacing.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0c533c6811c469332267c4f280048cf822d4f4e73205621e5dd6cea79cd3549"}},{"ruleId":"D2","level":"warning","message":{"text":"parser::grammar::params::list_ (cognitive 20): parser::grammar::params::list_ has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 3 (5 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/parser/src/grammar/params.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4838af3f35ce83bc2faf10b1b6e3a62f6235c74148c16e2b1d714a387434887"}},{"ruleId":"D2","level":"warning","message":{"text":"CargoOptions::apply_on_command (cognitive 20): CargoOptions::apply_on_command has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (16 pts), match/switch 1 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/flycheck.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"4114f70a400874d7455955b18e454b3b6754f129c6eb5eabbc2c4c7d447a26b9"}},{"ruleId":"D2","level":"warning","message":{"text":"rust_analyzer::handlers::notification::handle_did_save_text_document (cognitive 20): rust_analyzer::handlers::notification::handle_did_save_text_document has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 4, loops 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/tools/rust-analyzer/crates/rust-analyzer/src/handlers/notification.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e4f06e90a796c31ead38d102f92dd6e291b7dd80c3ea775e7e3ea3c2437632a"}},{"ruleId":"D2","level":"warning","message":{"text":"Expr::needs_parens_in_expr (cognitive 20): Expr::needs_parens_in_expr has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 10, if/else 7, match/switch 2 (3 pts) (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/syntax/src/ast/prec.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e2dbec408246eb1f2b2ff4720f3bf08f74719c3d65e089aa1d82a772a524342"}},{"ruleId":"D2","level":"warning","message":{"text":"xtask::codegen::lints::generate_descriptor_clippy (cognitive 20): xtask::codegen::lints::generate_descriptor_clippy has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 3, match/switch 1 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/xtask/src/codegen/lints.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7f59cf914b6c765a8d23ff805682808a07aef154e911e565c0abebc24cc28b4"}},{"ruleId":"D2","level":"warning","message":{"text":"FmtVisitor::visit_stmt (cognitive 20): FmtVisitor::visit_stmt has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (19 pts), match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/visitor.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff995b8e442fa971654ee0258373f8ae64e077c1fceed6766593ef647e1012df"}},{"ruleId":"D2","level":"warning","message":{"text":"rustfmt_nightly::items::compute_budgets_for_params (cognitive 20): rustfmt_nightly::items::compute_budgets_for_params has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 4 (10 pts), if/else 6 (9 pts), boolean chains 1 (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/tools/rustfmt/src/items.rs"},"region":{"startLine":2935}}}],"partialFingerprints":{"codehealthFindingId/v1":"93dbdf2e5b65f2c41c4884ba7781bae4d4201bafc697b1e7a0da750a9d8ba18a"}},{"ruleId":"D2","level":"warning","message":{"text":"rustfmt_nightly::matches::flatten_arm_body (cognitive 20): rustfmt_nightly::matches::flatten_arm_body has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/matches.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f0afbe8876fc6a25c30d26ec9304c1848b10e59f62d247c3aa930d49d5a73fb"}},{"ruleId":"D2","level":"warning","message":{"text":"tidy::error_codes::check_error_codes_used (cognitive 20): tidy::error_codes::check_error_codes_used has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/tidy/src/error_codes.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"e04ae819df714259b351c28fe52420fb7e2e817038eaf2d384b9f5ae25c0dc6b"}},{"ruleId":"D2","level":"warning","message":{"text":"tidy::triagebot::check (cognitive 20): tidy::triagebot::check has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 2 (5 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/tools/tidy/src/triagebot.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"b361b99ad8c519f3ceb8ab807d56cac46f6ade6274e22937b19db7f16c83ff54"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_traits::codegen::codegen_select_candidate (cognitive 20): rustc_traits::codegen::codegen_select_candidate has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (11 pts), match/switch 4 (7 pts), loops 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_traits/src/codegen.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa8f0578572fa203275c7fcd22e84a91e536352ec6e6e29999427bd7fe051461"}},{"ruleId":"D2","level":"warning","message":{"text":"Crate._init_defs (cognitive 20): Crate._init_defs has cognitive complexity 20 (threshold 15). Drivers by points: loops 7 (11 pts), if/else 4 (9 pts) (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/compiler-builtins/etc/update-api-list.py"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"f03f5141ef29e4a286ff6c65a01c3332fd61ebee80fd0e74d553280e7c56af07"}},{"ruleId":"D2","level":"warning","message":{"text":"main.handleHashes (cognitive 20): main.handleHashes has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 5 (nesting depth added 7). Of this number, 10 points are the body\u0027s own statements and 10 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/main.js"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"391dc2e035f58bebda9fef665452b249eb25424acf471de01465d6810fdbb80b"}},{"ruleId":"D2","level":"warning","message":{"text":"PrefixSearchTree.searchLev (cognitive 20): PrefixSearchTree.searchLev has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 2 (3 pts), ternaries 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/librustdoc/html/static/js/stringdex.js"},"region":{"startLine":1855}}}],"partialFingerprints":{"codehealthFindingId/v1":"868b978f4daf3c156fc6ffa04107f585b9e32c0a7a24534fef71118ee3384543"}},{"ruleId":"D2","level":"warning","message":{"text":"Lev2TParametricDescription.transition (cognitive 20): Lev2TParametricDescription.transition has cognitive complexity 20 (threshold 15). Drivers by points: if/else 14 (20 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/librustdoc/html/static/js/stringdex.js"},"region":{"startLine":4010}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3d1626290b459bdcffd0f5aafc63cfd30b9a92c06efd7a7a6c68fc1e6338713"}},{"ruleId":"D2","level":"warning","message":{"text":"showTooltip (cognitive 20): showTooltip has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 4 (nesting depth added 3). Of this number, 15 points are the body\u0027s own statements and 5 belong to 2 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/main.js"},"region":{"startLine":1358}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ac68a6398f10c22df59c088886285c378e72a40d7206a16a073ad141e5d8939"}},{"ruleId":"D2","level":"warning","message":{"text":"buildSettingsPageSections (cognitive 20): buildSettingsPageSections has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 4 (12 pts), if/else 2 (4 pts), loops 3 (4 pts) (nesting depth added 11). Of this number, 16 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/settings.js"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"17e62faf61dec4eebfdc89f31dcc194dc495650a728b2f1d6400cbb81229321e"}},{"ruleId":"D2","level":"warning","message":{"text":"switchTheme (cognitive 20): switchTheme has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (13 pts), ternaries 1 (4 pts), boolean chains 3 (nesting depth added 7). Of this number, 16 points are the body\u0027s own statements and 4 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/storage.js"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"12b916fb8d084c34ac69714758c7606c1c2bb9edcf20177069e2b5f4dfb12ce3"}},{"ruleId":"D2","level":"warning","message":{"text":"loadDatabase::searchLev (cognitive 20): loadDatabase::searchLev has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 2 (3 pts), ternaries 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/librustdoc/html/static/js/stringdex.js"},"region":{"startLine":1855}}}],"partialFingerprints":{"codehealthFindingId/v1":"10d3f92607c01ebf2ce54c409532fa928c88f157f2502ac4134bf051c5f8378f"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_ast::tokenstream::append_flat_tokens_as_token_trees_to (cognitive 19): rustc_ast::tokenstream::append_flat_tokens_as_token_trees_to has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ast/src/tokenstream.rs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"9620f4cd87a0c92d50b1fd3e0110bdb5d35a1c68ef3f86c6600199531896613d"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_ast_passes::ast_validation::validate_generic_param_order (cognitive 19): rustc_ast_passes::ast_validation::validate_generic_param_order has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (7 pts), match/switch 3 (7 pts), loops 3 (5 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ast_passes/src/ast_validation.rs"},"region":{"startLine":1340}}}],"partialFingerprints":{"codehealthFindingId/v1":"d962a582cc5057230283ad153cff88ed4b52a20e68a635d481f9c88c9e684fb0"}},{"ruleId":"D2","level":"warning","message":{"text":"State::print_expr_struct (cognitive 19): State::print_expr_struct has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 2, loops 1, 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":"compiler/rustc_ast_pretty/src/pprust/state/expr.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c0ad918fc81516a5a79a5de5cb9979975834e90b5df8d5d82a987021b33f829"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_attr_parsing::attributes::cfg::parse_cfg_entry (cognitive 19): rustc_attr_parsing::attributes::cfg::parse_cfg_entry has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (11 pts), match/switch 4 (8 pts) (nesting depth added 12). 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":"compiler/rustc_attr_parsing/src/attributes/cfg.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"34aae6546749714af3f018c093a97f76d34293c917be83fa7b39b6953d9c9c18"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_attr_parsing::attributes::crate_level::parse_register_tool (cognitive 19): rustc_attr_parsing::attributes::crate_level::parse_register_tool has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_attr_parsing/src/attributes/crate_level.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"fecc273d342f4649f2a54aacd75dd553e71bfa397381254bcba85f7a81301d4f"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_attr_parsing::attributes::rustc_internal::parse_cgu_fields (cognitive 19): rustc_attr_parsing::attributes::rustc_internal::parse_cgu_fields has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (14 pts), match/switch 2 (4 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_attr_parsing/src/attributes/rustc_internal.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"179bd594e51a85b816f012228ef6de32858451f3050b1a9b3d4430cbd808ee44"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_attr_parsing::parser::expr_to_lit (cognitive 19): rustc_attr_parsing::parser::expr_to_lit has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 2, 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":"compiler/rustc_attr_parsing/src/parser.rs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"0294dfa4e6dbe1a4c3dfbf4ffae2a5a2e7d85c5211cce5623f46bc6790e5692b"}},{"ruleId":"D2","level":"warning","message":{"text":"MirBorrowckCtxt::explain_why_borrow_contains_point (cognitive 19): MirBorrowckCtxt::explain_why_borrow_contains_point has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 1, match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/diagnostics/explain_borrow.rs"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"486332b85c821cd0ef66028e07ef7c7f0720ddd6cb2ab3a23b6f7a1dd106f826"}},{"ruleId":"D2","level":"warning","message":{"text":"MirBorrowckCtxt::add_borrow_suggestions (cognitive 19): MirBorrowckCtxt::add_borrow_suggestions has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 2, 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":"compiler/rustc_borrowck/src/diagnostics/move_errors.rs"},"region":{"startLine":910}}}],"partialFingerprints":{"codehealthFindingId/v1":"90b5952f1cef464b77314d50bda214aa5ea45bfc907fb55b449839768335b622"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeChecker::check_call_dest (cognitive 19): TypeChecker::check_call_dest has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (17 pts), match/switch 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/type_check/mod.rs"},"region":{"startLine":1952}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e4a8c38e2041545f9b2e71265b7ac981917a463214942879f1f61f19dcca19c"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_builtin_macros::eii::eii_ (cognitive 19): rustc_builtin_macros::eii::eii_ has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 2, match/switch 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_builtin_macros/src/eii.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbda79bc8bb4ea986cc3b793de6fcdabe58eac496b9699a92e72d1dd9ebdaac2"}},{"ruleId":"D2","level":"warning","message":{"text":"ConfigInfo::parse_argument (cognitive 19): ConfigInfo::parse_argument has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 7 (13 pts), if/else 4 (6 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":"compiler/rustc_codegen_gcc/build_system/src/config.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"79e96ddc78911fe11ef0ad8f185e4872c65ee328de63348f816a8849df7944e7"}},{"ruleId":"D2","level":"warning","message":{"text":"y::main (cognitive 19): y::main has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 6 (11 pts), if/else 6 (7 pts), loops 1 (nesting depth added 6). 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":"compiler/rustc_codegen_cranelift/build_system/main.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c1ce6a02194f2e012a30af862fdf3d30038951d0a0a9804ef601cfd54aa110a"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_codegen_cranelift::build_isa (cognitive 19): rustc_codegen_cranelift::build_isa has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13 (15 pts), match/switch 4 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/src/lib.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb8b56068227b70b335281326a4014c8fd5e0d78adfd08e78c59d4e728f1cdb1"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_codegen_cranelift::constant::define_all_allocs (cognitive 19): rustc_codegen_cranelift::constant::define_all_allocs has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (8 pts), match/switch 3 (8 pts), loops 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/src/constant.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdec43441efd7d97c97e1e57530c80ba372d5054232fbfd3aca0d2d555a416c6"}},{"ruleId":"D2","level":"warning","message":{"text":"Builder::shuffle_vector (cognitive 19): Builder::shuffle_vector has cognitive complexity 19 (threshold 15). Drivers by points: loops 6 (11 pts), if/else 8 (nesting depth added 5). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_gcc/src/builder.rs"},"region":{"startLine":2101}}}],"partialFingerprints":{"codehealthFindingId/v1":"7938c07c3e11afd14592c868ed8d2afa440f5dfa84cdde3c0ca44d1e169808ff"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_codegen_gcc::attributes::from_fn_attrs (cognitive 19): rustc_codegen_gcc::attributes::from_fn_attrs has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (14 pts), match/switch 3 (4 pts), boolean chains 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_gcc/src/attributes.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed3b7c848ac659ac8e9b21133a48d666824a1c330cfcfd0da353ad81677ed08b"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_codegen_ssa::back::link::check_externally_implementable_item_linkage (cognitive 19): rustc_codegen_ssa::back::link::check_externally_implementable_item_linkage has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/back/link.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"632e3dffa2addf77998bc060b3a3a93d562dc08058fc255033831f526e653651"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_codegen_ssa::back::link::raw_dylib::collate_raw_dylibs_windows (cognitive 19): rustc_codegen_ssa::back::link::raw_dylib::collate_raw_dylibs_windows has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 2 (4 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":"compiler/rustc_codegen_ssa/src/back/link/raw_dylib.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"758fabb378297969e0af465227710e92959edcdc68ec0266af6e4f8536246cff"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_codegen_ssa::mir::analyze::cleanup_kinds::propagate (cognitive 19): rustc_codegen_ssa::mir::analyze::cleanup_kinds::propagate has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (10 pts), match/switch 3 (6 pts), loops 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/mir/analyze.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"7da094010a5243e94834ede9976009a04058b07e0a9aded90cb5d53d786513c4"}},{"ruleId":"D2","level":"warning","message":{"text":"ValidityVisitor::aggregate_field_path_elem (cognitive 19): ValidityVisitor::aggregate_field_path_elem has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (11 pts), match/switch 4 (7 pts), boolean chains 1 (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_const_eval/src/interpret/validity.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"02836261941b6241272e90d51ec636437113fff5111aa98099487ccd151e4076"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_driver_impl::report_ice (cognitive 19): rustc_driver_impl::report_ice has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (16 pts), match/switch 1 (2 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":"compiler/rustc_driver_impl/src/lib.rs"},"region":{"startLine":1540}}}],"partialFingerprints":{"codehealthFindingId/v1":"83188382116b901729c822b689468e340e703b4b169cd5de03c61f6fca67e4a8"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_hir_analysis::check::wfcheck::gather_gat_bounds (cognitive 19): rustc_hir_analysis::check::wfcheck::gather_gat_bounds has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 3 (5 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/check/wfcheck.rs"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"413abdf6689ce0b34c03ad6d029ad6810f4ee3e024ab5b29fad7df3b12d25dd2"}},{"ruleId":"D2","level":"warning","message":{"text":"CastCheck::check (cognitive 19): CastCheck::check has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (11 pts), match/switch 2 (5 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/cast.rs"},"region":{"startLine":820}}}],"partialFingerprints":{"codehealthFindingId/v1":"846b70df3025993f4707d9e77c349bd9dfa05631d26c75ef7538e3843d62712a"}},{"ruleId":"D2","level":"warning","message":{"text":"ExprUseVisitor::walk_expr (cognitive 19): ExprUseVisitor::walk_expr has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (4 pts), match/switch 2 (4 pts) (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/expr_use_visitor.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9e2e419813e5a1a716098273d4685374a5f7b31d54863300c3235405f3fc12b"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::check_expr_with_expectation_and_args (cognitive 19): FnCtxt::check_expr_with_expectation_and_args has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 3, boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/expr.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf400f130952c2257a6970781d88341ce2a042532ab1a0318cb3a8b126ac50b1"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::suggest_two_fn_call (cognitive 19): FnCtxt::suggest_two_fn_call has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (10 pts), match/switch 2 (6 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":"compiler/rustc_hir_typeck/src/fn_ctxt/suggestions.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b4156d90cba92ef7f9134e1b1c1193ed4362735260a5763e1fe68def623909f"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::suggest_calling_field_as_fn (cognitive 19): FnCtxt::suggest_calling_field_as_fn has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 2 (5 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/method/suggest.rs"},"region":{"startLine":2824}}}],"partialFingerprints":{"codehealthFindingId/v1":"58a91716331f63d7015700a597a211382101d2f8230e8ad8471875a28b700ff7"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::try_index_step (cognitive 19): FnCtxt::try_index_step has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/place_op.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"e03aea2c0e7b53504711311f66beb4ee9ac2f3bfe70f5a98145b4f7e2119f9fa"}},{"ruleId":"D2","level":"warning","message":{"text":"ProbeContext::assemble_extension_candidates_for_trait (cognitive 19): ProbeContext::assemble_extension_candidates_for_trait has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 3 (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":"compiler/rustc_hir_typeck/src/method/probe.rs"},"region":{"startLine":1134}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7135a92a4b368054cfc97afa8340edf3c189452bb399b7e1ec3db8ac1e05513"}},{"ruleId":"D2","level":"warning","message":{"text":"Canonicalizer::fold_ty (cognitive 19): Canonicalizer::fold_ty has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (16 pts), match/switch 2 (3 pts) (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":"compiler/rustc_infer/src/infer/canonical/canonicalizer.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"be32add400b408536b079cf62c8676cc7f5f74fb446268f6a7dafc3e214deabd"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_interface::passes::write_dep_info (cognitive 19): rustc_interface::passes::write_dep_info has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_interface/src/passes.rs"},"region":{"startLine":833}}}],"partialFingerprints":{"codehealthFindingId/v1":"41be04650a378189232a4630b4b4ee6846e190467b64608f7f2038faf7814d3b"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_interface::passes::collect_crate_types (cognitive 19): rustc_interface::passes::collect_crate_types has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (17 pts), loops 1 (2 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":"compiler/rustc_interface/src/passes.rs"},"region":{"startLine":1441}}}],"partialFingerprints":{"codehealthFindingId/v1":"4254aaaf980f4ac052744bc7641b22ddbdc25d6491331615a937c6bf591c8daa"}},{"ruleId":"D2","level":"warning","message":{"text":"Cursor::frontmatter (cognitive 19): Cursor::frontmatter has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 3, loops 1 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_lexer/src/lib.rs"},"region":{"startLine":699}}}],"partialFingerprints":{"codehealthFindingId/v1":"479759098910423d66c294067a4dbabf939f76dd793182874e086fc450b22e2a"}},{"ruleId":"D2","level":"warning","message":{"text":"CrateLocator::find_library_crate (cognitive 19): CrateLocator::find_library_crate has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 4 (6 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_metadata/src/locator.rs"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"04ee44dc177c5bf759b2a70fb22884e457577474a69b63d0b9d911a2a9a14e33"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_metadata::native_libs::collect (cognitive 19): rustc_metadata::native_libs::collect has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 2 (3 pts) (nesting depth added 11). 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":"compiler/rustc_metadata/src/native_libs.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"a90945b154db75c65736bd41fcdd7c5721b0934f98717e8ad7f3b465a3771139"}},{"ruleId":"D2","level":"warning","message":{"text":"TerminatorKind::successors_mut (cognitive 19): TerminatorKind::successors_mut has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2 (4 pts), match/switch 1 (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/mir/terminator.rs"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd4d30dd9bbb3af315a22a2f61b497f1287721298f520bb20da695de0ddef2a9"}},{"ruleId":"D2","level":"warning","message":{"text":"TransformVisitor::make_state (cognitive 19): TransformVisitor::make_state has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (18 pts), match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/coroutine/mod.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"245377fbb90b97311fc0fa2a4ebbcd5fa4f06ac89c9ef3a58a5131ded8cad9c9"}},{"ruleId":"D2","level":"warning","message":{"text":"ElaborateBoxDerefs::run_pass (cognitive 19): ElaborateBoxDerefs::run_pass has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 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":"compiler/rustc_mir_transform/src/elaborate_box_derefs.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"13e6b24824157dd5b5754d6ecb70c61852cec2c50e914b27a997693ce2c15bd4"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_mir_transform::coverage::expansion::build_expn_tree (cognitive 19): rustc_mir_transform::coverage::expansion::build_expn_tree has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 5 (7 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/coverage/expansion.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7135de51ffb4b7e76137a11fcc7052b5f94bfb12d5f82eec2f4411e67fba4bf"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_mir_transform::early_otherwise_branch::evaluate_candidate (cognitive 19): rustc_mir_transform::early_otherwise_branch::evaluate_candidate has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 2, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/early_otherwise_branch.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"75e776315f3fa802a7360964c3191558510dce2cc83da111740b145575bd49e4"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_mir_transform::inline::check_mir_is_available (cognitive 19): rustc_mir_transform::inline::check_mir_is_available has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 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":"compiler/rustc_mir_transform/src/inline.rs"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcf8bcd8573bbc96aefb55e23442262c40b8780b40167fc4c792eb49806b0c49"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_monomorphize::mono_checks::abi_check::check_call_site_abi (cognitive 19): rustc_monomorphize::mono_checks::abi_check::check_call_site_abi has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 4 (7 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":"compiler/rustc_monomorphize/src/mono_checks/abi_check.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"39d6415dcfff481866b3c7b3f276a468360b0ff67ba309800ed6a44e5c37e74c"}},{"ruleId":"D2","level":"warning","message":{"text":"Lexer::maybe_report_guarded_str (cognitive 19): Lexer::maybe_report_guarded_str has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (18 pts), match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/lexer/mod.rs"},"region":{"startLine":1169}}}],"partialFingerprints":{"codehealthFindingId/v1":"841234fadff801a3a212979b118782802a0d6a0c936d6e5cb3743315a62ebe87"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_expr_assoc_rest (cognitive 19): Parser::parse_expr_assoc_rest has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (10 pts), match/switch 3 (6 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/expr.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"3950de54e0caca235a808c307c5271664dad0944cdefbf70af8398a5c0b4125d"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_expr_dot_or_call_with (cognitive 19): Parser::parse_expr_dot_or_call_with has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 2, 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":"compiler/rustc_parse/src/parser/expr.rs"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d315cdc4cb04bad670262551b324037633f19c5589093874ef9d54b08f28eb1"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_expr_labeled (cognitive 19): Parser::parse_expr_labeled has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 6 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/expr.rs"},"region":{"startLine":1544}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dda6d655cd1e292ac25dc38b3711e59d3053fa433307c6fdc3169162237898e"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::error_fn_body_not_found (cognitive 19): Parser::error_fn_body_not_found has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (14 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/function.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c1307c367dfb0691115884bb04ab9cdf94a5c948a7e8063ef88334ab42d7f0d"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::nonterminal_may_begin_with (cognitive 19): Parser::nonterminal_may_begin_with has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 8 (15 pts), boolean chains 4 (nesting depth added 7). Of this number, 18 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. 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":"compiler/rustc_parse/src/parser/nonterminal.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"583bda090b356789c80e1097dbd298e128c355089c7f4be7ade650c0177e9720"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_angle_args (cognitive 19): Parser::parse_angle_args has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (16 pts), boolean chains 2, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/path.rs"},"region":{"startLine":738}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0d3edda0fe290001f54749acc636329652e11d56b0415b631ea079168e40dbe"}},{"ruleId":"D2","level":"warning","message":{"text":"DeadVisitor::lint_at_single_level (cognitive 19): DeadVisitor::lint_at_single_level has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 2, match/switch 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_passes/src/dead.rs"},"region":{"startLine":1322}}}],"partialFingerprints":{"codehealthFindingId/v1":"938d469e017f011cb24fbc144eae5e9138a76568f19fd5b900cf62628d89ac0e"}},{"ruleId":"D2","level":"warning","message":{"text":"LateResolutionVisitor::suggest_trait_and_bounds (cognitive 19): LateResolutionVisitor::suggest_trait_and_bounds has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 2, loops 1 (2 pts), match/switch 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/late/diagnostics.rs"},"region":{"startLine":1403}}}],"partialFingerprints":{"codehealthFindingId/v1":"de62a4950fc73ac3d8dfd6bb9466e3a56757c6123f7098d2b2b1ad9dc59cbd0b"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_sanitizers::cfi::typeid::itanium_cxx_abi::transform::transform_instance (cognitive 19): rustc_sanitizers::cfi::typeid::itanium_cxx_abi::transform::transform_instance has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (18 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":"compiler/rustc_sanitizers/src/cfi/typeid/itanium_cxx_abi/transform.rs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"385a98ecf5e59e407d585bb9ef10395f58d6ca831935379614c98f79baee889c"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_session::options::parse::parse_instrument_xray (cognitive 19): rustc_session::options::parse::parse_instrument_xray has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 2 (5 pts), boolean chains 3, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_session/src/options.rs"},"region":{"startLine":1739}}}],"partialFingerprints":{"codehealthFindingId/v1":"63f46976001ead629775aadc95e130ef8bc13b1a926000ce2699a73eeeb1afcc"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_target::callconv::mips64::classify_ret (cognitive 19): rustc_target::callconv::mips64::classify_ret has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_target/src/callconv/mips64.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b7566882c1b3d42110ad7f0c7427937d6e47bdbef94247904e4e3817034acd8"}},{"ruleId":"D2","level":"warning","message":{"text":"SelectionContext::assemble_builtin_copy_clone_candidate (cognitive 19): SelectionContext::assemble_builtin_copy_clone_candidate has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 2 (3 pts) (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/traits/select/candidate_assembly.rs"},"region":{"startLine":1159}}}],"partialFingerprints":{"codehealthFindingId/v1":"3178b39cac1240d837d7a4ea8d056e4170ad6d07f5b6956d2e356c45576f9fe1"}},{"ruleId":"D2","level":"warning","message":{"text":"SelectionContext::evaluate_trait_predicate_recursively (cognitive 19): SelectionContext::evaluate_trait_predicate_recursively has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (14 pts), loops 1 (3 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/traits/select/mod.rs"},"region":{"startLine":931}}}],"partialFingerprints":{"codehealthFindingId/v1":"d737a9ff283106a61322a9f145a3529b4d5cf9644bc28ff570a0d17ea22f00c5"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_trait_selection::traits::project::confirm_impl_candidate (cognitive 19): rustc_trait_selection::traits::project::confirm_impl_candidate has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13 (18 pts), match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/traits/project.rs"},"region":{"startLine":2058}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b5f7645d0f7b2e8fd24bb02512fcb3cea5279e3997ca57a3d15ae8134788d49"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_ty_utils::needs_drop::drop_tys_helper (cognitive 19): rustc_ty_utils::needs_drop::drop_tys_helper has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (8 pts), match/switch 4 (8 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 6). Of this number, 16 points are the body\u0027s own statements and 3 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":"compiler/rustc_ty_utils/src/needs_drop.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6ed06c09d241e8e83e40516cfb357e5ad1f1cff2e705a00eb22279a041847a1"}},{"ruleId":"D2","level":"warning","message":{"text":"Target::from_rustc (cognitive 19): Target::from_rustc has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 5 (14 pts), if/else 3 (4 pts), loops 1 (nesting depth added 10). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/compiler-builtins/crates/symcheck/src/main.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e73d2cbecf3cc54d8f7a918533cb069bcbbc6148ba3fd124896e80544f7ad37"}},{"ruleId":"D2","level":"warning","message":{"text":"libm::math::expf::expf (cognitive 19): libm::math::expf::expf has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (18 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":"library/compiler-builtins/libm/src/math/expf.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"849a67aebd16938f38cad192ea98dbd808370b6a2b5ed5512ac8ff416a0349b9"}},{"ruleId":"D2","level":"warning","message":{"text":"libm::math::tgamma::tgamma (cognitive 19): libm::math::tgamma::tgamma has cognitive complexity 19 (threshold 15). Drivers by points: if/else 14 (19 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/compiler-builtins/libm/src/math/tgamma.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"924005bffdb4d2d8414d3ad220b5c4cc443109d9d009768195b00765aafd5f1c"}},{"ruleId":"D2","level":"warning","message":{"text":"Channel::start_send (cognitive 19): Channel::start_send has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sync/mpmc/list.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"709be590a48a3169fbee092640dedd6ded749f9324c3e40b4ad5c645a2bb4159"}},{"ruleId":"D2","level":"warning","message":{"text":"Command::spawn_with_attributes (cognitive 19): Command::spawn_with_attributes has cognitive complexity 19 (threshold 15). Drivers by points: if/else 16, boolean chains 2, match/switch 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":"library/std/src/sys/process/windows.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ba411339643a543522bef0f722f1a37402bc94da777a51d743ff4da4bf7a576"}},{"ruleId":"D2","level":"warning","message":{"text":"std::sys::io::error::sgx::decode_error_kind (cognitive 19): std::sys::io::error::sgx::decode_error_kind has cognitive complexity 19 (threshold 15). Drivers by points: if/else 19. 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":"library/std/src/sys/io/error/sgx.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"63fef4ac92071adc07688477800499f21c8a6419b29c76cd3ca71a0c62efedd0"}},{"ruleId":"D2","level":"warning","message":{"text":"stdarch_test::wasm::disassemble_myself (cognitive 19): stdarch_test::wasm::disassemble_myself has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/stdarch-test/src/wasm.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"588d46f0e2a5e5e12d070a9151eac3486d1cff6f123199db98e8fd172ea066ff"}},{"ruleId":"D2","level":"warning","message":{"text":"Std::run (cognitive 19): Std::run has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13 (14 pts), boolean chains 4, loops 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/build_steps/compile.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9549114cc03fc093f996297c9069ea4098620beb7c6a3fee88f1874817528a0"}},{"ruleId":"D2","level":"warning","message":{"text":"OmpOffload::run (cognitive 19): OmpOffload::run has cognitive complexity 19 (threshold 15). Drivers by points: if/else 15 (18 pts), loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/build_steps/llvm.rs"},"region":{"startLine":1336}}}],"partialFingerprints":{"codehealthFindingId/v1":"e019d9633824bd6b60b7192e9d0cf984e4b1fdd0f1faeabc21c8e8d011e07bd7"}},{"ruleId":"D2","level":"warning","message":{"text":"bootstrap::core::build_steps::compile::rustc_llvm_env (cognitive 19): bootstrap::core::build_steps::compile::rustc_llvm_env has cognitive complexity 19 (threshold 15). Drivers by points: if/else 14 (16 pts), boolean chains 3 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/build_steps/compile.rs"},"region":{"startLine":1439}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b7a07727e0d3bfd13903a327d7f19159a025162756f4d7bfb4127570f647880"}},{"ruleId":"D2","level":"warning","message":{"text":"bootstrap::core::download::unpack (cognitive 19): bootstrap::core::download::unpack has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 4, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/download.rs"},"region":{"startLine":935}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d59d1e1eb9a9dfdabdfcddc43ec161f5d4a5a4f3c0f601fee9a4ddcc042498f"}},{"ruleId":"D2","level":"warning","message":{"text":"rustdoc::clean::blanket_impl::synthesize_blanket_impls (cognitive 19): rustdoc::clean::blanket_impl::synthesize_blanket_impls has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 3 (6 pts), match/switch 1 (4 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/clean/blanket_impl.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddcd5ae8b6dfb114dd81002e5f2181fff846133e5872363f6761971397dde760"}},{"ruleId":"D2","level":"warning","message":{"text":"rustdoc::passes::lint::html_tags::extract_path_forward (cognitive 19): rustdoc::passes::lint::html_tags::extract_path_forward has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/passes/lint/html_tags.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"58bc12ac98ccc0ebfe60c10c9fa64e51fd7230ae1c4630aca1dba74e12c5c8d2"}},{"ruleId":"D2","level":"warning","message":{"text":"rustdoc::theme::parse_rules (cognitive 19): rustdoc::theme::parse_rules has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 3 (5 pts), match/switch 3 (5 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/librustdoc/theme.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"5449abfc45813234fb445469107cdfa1b6fee290103cbd1d99771411b39374c4"}},{"ruleId":"D2","level":"warning","message":{"text":"ParseCxImpl::parse_lint_src_file (cognitive 19): ParseCxImpl::parse_lint_src_file has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_dev/src/parse.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"16108c47240560502f843106d644ec22e2f831e783338a485a8b652fa07bb584"}},{"ruleId":"D2","level":"warning","message":{"text":"Hir2Qmm::run (cognitive 19): Hir2Qmm::run has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 4 (9 pts), if/else 6 (8 pts), boolean chains 1, loops 1 (nesting depth added 7). Of this number, 18 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. 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/tools/clippy/clippy_lints/src/booleans.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fb16c4f44b1dd3513d1c13cfb7731941f7b7c6bd40a5959e108b8eb3f56f11d"}},{"ruleId":"D2","level":"warning","message":{"text":"IfThenSomeElseNone::check_expr (cognitive 19): IfThenSomeElseNone::check_expr has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/if_then_some_else_none.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fddd41d1983e27643cbb180f703f4daffb4a0a33a970325121d2e9ef11886cd"}},{"ruleId":"D2","level":"warning","message":{"text":"IncrementVisitor::visit_expr (cognitive 19): IncrementVisitor::visit_expr has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/loops/utils.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ed2b23a62b8533c28d3c76e91274d6f91a57d3069d147eb0357ae208f3f2d53"}},{"ruleId":"D2","level":"warning","message":{"text":"ModStyle::check_item (cognitive 19): ModStyle::check_item has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 4, match/switch 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/module_style.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec16d6c8fcaa99a1fc20c47db5c532a5c8c6c302e037d3c619fd163ba65993ec"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::cargo::feature_name::check (cognitive 19): clippy_lints::cargo::feature_name::check has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/cargo/feature_name.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad156ead86f7476892c1bf5ecc627b85849daaad3f23feb7d2ea9aaad708e3a8"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::casts::cast_possible_truncation::check (cognitive 19): clippy_lints::casts::cast_possible_truncation::check has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 3 (5 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/casts/cast_possible_truncation.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0c492eb71912f871944621211e6c6e65ea2f5521912419213ef975342007cb3"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::casts::cast_possible_wrap::check (cognitive 19): clippy_lints::casts::cast_possible_wrap::check has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (13 pts), match/switch 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":"src/tools/clippy/clippy_lints/src/casts/cast_possible_wrap.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"169a23ee4683d3342ae10a888a6fff801ffde58458ca46347098d9fbb7be4a03"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::floating_point_arithmetic::mul_add::check (cognitive 19): clippy_lints::floating_point_arithmetic::mul_add::check has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13, boolean chains 5, match/switch 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/tools/clippy/clippy_lints/src/floating_point_arithmetic/mul_add.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a6dfb88281c6ab71ae1b914b768390d2077c6f16b1284181e07b68829694d9e"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::functions::ref_option::check_fn (cognitive 19): clippy_lints::functions::ref_option::check_fn has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (18 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/tools/clippy/clippy_lints/src/functions/ref_option.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a9c3d86a820bc542b39ee47c9563a1f43f8c375538f5e48d9b741f7e48fa41d"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::functions::result::check_result_large_err (cognitive 19): clippy_lints::functions::result::check_result_large_err has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 3, loops 1 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/functions/result.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"5120a9034f116b0061728bd46b42e3fc3610bf947937498b775046efd814c05c"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::implicit_saturating_sub::check_subtraction (cognitive 19): clippy_lints::implicit_saturating_sub::check_subtraction has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 4 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/implicit_saturating_sub.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fb5ba2d428318cc294752fee25e40d588c95231262c30878652c5bbc9158080"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::loops::explicit_counter_loop::check (cognitive 19): clippy_lints::loops::explicit_counter_loop::check has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/loops/explicit_counter_loop.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5fcad77464f66c4ba6a5cff7d42c4e619b05fcebccf9933941a4fb14c919719"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::loops::manual_memcpy::build_manual_memcpy_suggestion (cognitive 19): clippy_lints::loops::manual_memcpy::build_manual_memcpy_suggestion has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (13 pts), boolean chains 3, match/switch 2 (3 pts) (nesting depth added 2). Of this number, 17 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. 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/tools/clippy/clippy_lints/src/loops/manual_memcpy.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe994220b88e7aa0d072c09dd72780d76a4534d0fe7ec4caab016f6747e68ae3"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::methods::unnecessary_fold::check_option_fold (cognitive 19): clippy_lints::methods::unnecessary_fold::check_option_fold has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 3 (4 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/methods/unnecessary_fold.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bc24ab657da3c77405ca6a0c6f133c12531b1ff9660343e16493714ca41cef9"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::needless_continue::check_and_warn (cognitive 19): clippy_lints::needless_continue::check_and_warn has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/needless_continue.rs"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b3283ea3e130b5f2b6595a716460f33bc890af9061b6b4bef9b27dc7f611087"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::unit_types::let_unit_value::expr_needs_inferred_result (cognitive 19): clippy_lints::unit_types::let_unit_value::expr_needs_inferred_result has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/unit_types/let_unit_value.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"9399dd60f60a9e2dec8df7cc1fa2196296026fecd00b392fd51cf6006a56ff50"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_utils::eager_or_lazy::fn_eagerness (cognitive 19): clippy_utils::eager_or_lazy::fn_eagerness has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (9 pts), match/switch 3 (6 pts), boolean chains 4 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_utils/src/eager_or_lazy.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c955911e06852a9ce80a02995ff39e04248b6fb92529b2c1ec10e2de19e230d"}},{"ruleId":"D2","level":"warning","message":{"text":"TestCx::check_rustdoc_test_option (cognitive 19): TestCx::check_rustdoc_test_option has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 3 (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/tools/compiletest/src/runtest.rs"},"region":{"startLine":2395}}}],"partialFingerprints":{"codehealthFindingId/v1":"d12cbd6cbb0a2f3a988cbc2b1cefc56dde9dc785d502f5cb439c48ea95fb221b"}},{"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":"src/tools/miri/cargo-miri/src/phases.rs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"9550ef4d83c89db08a9438b0fb42811d668cdcaa5df62da0ef9b19820245d9ee"}},{"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/tools/miri/src/alloc_addresses/mod.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aa578684baf4b85738fd804f2489cec75370dfabbe0aaa7f0de09d710326fe0"}},{"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/tools/miri/src/concurrency/data_race.rs"},"region":{"startLine":1111}}}],"partialFingerprints":{"codehealthFindingId/v1":"065e382b97f9b0e7b4d96cf9356e950e676bf5bf222cd4ecd9a853a5fea6e8ab"}},{"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/tools/miri/src/shims/os_str.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"f697d5e696f583730c4d29289a6921ab5bfb293087823ad30ee70ff7732129e0"}},{"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/tools/miri/src/shims/unix/freebsd/foreign_items.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"794ee61d20c496656d0ddb1aae0cd2fc3fca5731a2623a34154db45abca2d882"}},{"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/tools/miri/src/shims/unix/socket.rs"},"region":{"startLine":1125}}}],"partialFingerprints":{"codehealthFindingId/v1":"474da8a823f0177c50fee13231d2471da66095e8621320b2418cf2d6d98d1804"}},{"ruleId":"D2","level":"warning","message":{"text":"hir::display::write_fields (cognitive 19): hir::display::write_fields has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (14 pts), loops 1 (3 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/tools/rust-analyzer/crates/hir/src/display.rs"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"614c7d959a737cc20935d455a9418f9362685bc34568a0d13ccf2ee4442b30d3"}},{"ruleId":"D2","level":"warning","message":{"text":"ExprCollector::lower_generic_args (cognitive 19): ExprCollector::lower_generic_args has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (15 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/expr_store/lower.rs"},"region":{"startLine":1023}}}],"partialFingerprints":{"codehealthFindingId/v1":"597393c04da7c50b129fc1c7ffabc3c8b9efddbd720246fcfaccb94ebac56935"}},{"ruleId":"D2","level":"warning","message":{"text":"Printer::print_type_bounds (cognitive 19): Printer::print_type_bounds has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 3 (9 pts), if/else 2 (6 pts), loops 2 (4 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/tools/rust-analyzer/crates/hir-def/src/expr_store/pretty.rs"},"region":{"startLine":1364}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cc2b6f119bd6d2d45d6559b7359ebc63297adf8f9a24814711c63a42ed7d577"}},{"ruleId":"D2","level":"warning","message":{"text":"ModCollector::collect_macro_def (cognitive 19): ModCollector::collect_macro_def has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/nameres/collector.rs"},"region":{"startLine":2599}}}],"partialFingerprints":{"codehealthFindingId/v1":"920cb13e52c9bde5efd9c43d6a39909081589478f0b8e1cb145fbdd5ef9f1c98"}},{"ruleId":"D2","level":"warning","message":{"text":"MirPrettyCtx::blocks (cognitive 19): MirPrettyCtx::blocks has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 4 (12 pts), loops 3 (7 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/tools/rust-analyzer/crates/hir-ide/src/mir_pretty.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"89bc301e4cdfea50997d6691492c735641a8a98d6b5f8f4f19e4af32a14231db"}},{"ruleId":"D2","level":"warning","message":{"text":"ExprUseVisitor::walk_pat (cognitive 19): ExprUseVisitor::walk_pat has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (13 pts), match/switch 3 (4 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/tools/rust-analyzer/crates/hir-ty/src/infer/closure/analysis/expr_use_visitor.rs"},"region":{"startLine":879}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fc46d0430cb81d01a53b3eccc9a7fb5248e1b34b9ef8e5d7f5903f62e6787cf"}},{"ruleId":"D2","level":"warning","message":{"text":"InferenceContext::calculate_diverging_fallback (cognitive 19): InferenceContext::calculate_diverging_fallback has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 5 (8 pts), match/switch 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/infer/fallback.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"24fb5c89d615b6e1fbbf6bbba3e66c7f20a75102909a5e51b76b881f9d1f0f31"}},{"ruleId":"D2","level":"warning","message":{"text":"InferenceContext::check_record_pat_fields (cognitive 19): InferenceContext::check_record_pat_fields has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 2 (4 pts), boolean chains 2, loops 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/tools/rust-analyzer/crates/hir-ty/src/infer/pat.rs"},"region":{"startLine":1154}}}],"partialFingerprints":{"codehealthFindingId/v1":"49567ca69cbed82db8b4351497b684b62c8b87295cf954201628675c0d5e6b61"}},{"ruleId":"D2","level":"warning","message":{"text":"InferenceContext::struct_tail_with_normalize (cognitive 19): InferenceContext::struct_tail_with_normalize has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 4 (12 pts), if/else 3 (6 pts), loops 1 (nesting depth added 11). 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/tools/rust-analyzer/crates/hir-ty/src/infer.rs"},"region":{"startLine":2061}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b7a0990356223a7fec1f5b00648e682658c164173c07b9db9f73fd634316b90"}},{"ruleId":"D2","level":"warning","message":{"text":"Canonicalizer::fold_ty (cognitive 19): Canonicalizer::fold_ty has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (16 pts), match/switch 2 (3 pts) (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/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/canonical/canonicalizer.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"50cdd0945742d1c4d18951d8cb6d634e98939da40e727ff1af8186289db3872d"}},{"ruleId":"D2","level":"warning","message":{"text":"SolverContext::fetch_eligible_assoc_item (cognitive 19): SolverContext::fetch_eligible_assoc_item has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (13 pts), match/switch 3 (4 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/next_solver/solver.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"6800f9b4e6a113cbef3b4f991ad4c85a17da2fd1efc91842fbe588f497ae6e93"}},{"ruleId":"D2","level":"warning","message":{"text":"ide::hover::render::definition_owner_name (cognitive 19): ide::hover::render::definition_owner_name has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 8 (16 pts), if/else 2 (3 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/tools/rust-analyzer/crates/ide/src/hover/render.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e79fd70463ad16c0aaa3ece1b68ff7edaa88df5a3f988667ed5bf3bc8f3665f"}},{"ruleId":"D2","level":"warning","message":{"text":"ide::navigation_target::orig_range_with_focus_r (cognitive 19): ide::navigation_target::orig_range_with_focus_r has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 5, match/switch 3 (5 pts) (nesting depth added 4). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/navigation_target.rs"},"region":{"startLine":912}}}],"partialFingerprints":{"codehealthFindingId/v1":"1300b465fa2718a4b7ef049ec17fb90898d17c56f12fdda6286c294de906c761"}},{"ruleId":"D2","level":"warning","message":{"text":"ide::syntax_highlighting::string_injections (cognitive 19): ide::syntax_highlighting::string_injections has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/syntax_highlighting.rs"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"56b353b75e15949bb7474a0582ade1830f6fb00abffedc43bcfb24a1b4d67922"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_assists::handlers::add_missing_impl_members::add_missing_impl_members_inner (cognitive 19): ide_assists::handlers::add_missing_impl_members::add_missing_impl_members_inner has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 3 (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/tools/rust-analyzer/crates/ide-assists/src/handlers/add_missing_impl_members.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"b753b481735120d30eb88759dd14af8fc64e0717b837586c228ddc25597bd053"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_assists::handlers::extract_struct_from_enum_variant::tag_generics_in_variant (cognitive 19): ide_assists::handlers::extract_struct_from_enum_variant::tag_generics_in_variant has cognitive complexity 19 (threshold 15). Drivers by points: if/else 2 (8 pts), match/switch 2 (7 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/extract_struct_from_enum_variant.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7ae74fb03858c850ebc7d021081333a749f596c528375d755491483534f28c6"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_assists::handlers::wrap_unwrap_cfg_attr::wrap_unwrap_cfg_attr (cognitive 19): ide_assists::handlers::wrap_unwrap_cfg_attr::wrap_unwrap_cfg_attr has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (13 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/tools/rust-analyzer/crates/ide-assists/src/handlers/wrap_unwrap_cfg_attr.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"87d563391d87e55daeec9f503f66ad6304f95265093d8f3d0534fe81b6a61af7"}},{"ruleId":"D2","level":"warning","message":{"text":"CompletionContext::new (cognitive 19): CompletionContext::new has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (11 pts), match/switch 5 (6 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-completion/src/context.rs"},"region":{"startLine":790}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbae2ae4c55e781b8cf2366dddd0124ff361177e1f88c35a2102ca7cd33b4053"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_completion::completions::mod_::complete_mod (cognitive 19): ide_completion::completions::mod_::complete_mod has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (11 pts), match/switch 3 (6 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-completion/src/completions/mod_.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c5559b4378615b8587657f12e174ff11a004ef5a98a9e46c5d99a5ad3b474ca"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_completion::render::function::render (cognitive 19): ide_completion::render::function::render has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 4, match/switch 4 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-completion/src/render/function.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"4be9e6af748b4156d72ef36271bc631a39ec9cdccf84cbcbcc9a6ce68612124f"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_db::imports::insert_use::insert_use_with_alias_option_with_editor (cognitive 19): ide_db::imports::insert_use::insert_use_with_alias_option_with_editor has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 4 (9 pts), if/else 4 (6 pts), boolean chains 2, 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/tools/rust-analyzer/crates/ide-db/src/imports/insert_use.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"98852e51dac6df7aab72d1abddfaf00b8b0dd1bdd4c8f3edbd43f0f444826358"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_db::rust_doc::format_docs_ (cognitive 19): ide_db::rust_doc::format_docs_ has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (16 pts), boolean chains 2, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-db/src/rust_doc.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a8306ac6474dd18926f4ec0d8115e68566c29ad266b762d9eb9e6c61c116476"}},{"ruleId":"D2","level":"warning","message":{"text":"DeclarativeMacro::parse_macro2 (cognitive 19): DeclarativeMacro::parse_macro2 has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 2 (5 pts), loops 2 (3 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/tools/rust-analyzer/crates/mbe/src/lib.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"413872b2243d0382be1ca0c96da12e0265ea5f4e48b1a7ad913b25d20617a3ba"}},{"ruleId":"D2","level":"warning","message":{"text":"mbe::parser::next_op (cognitive 19): mbe::parser::next_op has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 7 (19 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/tools/rust-analyzer/crates/mbe/src/parser.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7f978884d807038861de3dcc08524c0d6c84a314a9c6651c4cfaf91df883d4d"}},{"ruleId":"D2","level":"warning","message":{"text":"Writer::group (cognitive 19): Writer::group has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 2 (5 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/proc-macro-api/src/legacy_protocol/msg/flat.rs"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a4b7a2f418e55242dc3e82628d54d2896494dc60cde587d45e4e25be08d238d"}},{"ruleId":"D2","level":"warning","message":{"text":"rust_analyzer::handlers::request::handle_run_test (cognitive 19): rust_analyzer::handlers::request::handle_run_test has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (8 pts), match/switch 2 (7 pts), loops 2 (4 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/handlers/request.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"a94189e11934d72d7e26693453e405689d01294b1b93499169f8ec1ce3856992"}},{"ruleId":"D2","level":"warning","message":{"text":"rust_analyzer::handlers::request::handle_workspace_symbol (cognitive 19): rust_analyzer::handlers::request::handle_workspace_symbol has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 5 (10 pts), if/else 6, boolean chains 2, loops 1 (nesting depth added 5). Most of this is not in the body itself: 6 of the 19 points are its own statements and the rest belongs to 2 function items inside it that branch (decide_search_kind_and_scope, exec_query). 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/tools/rust-analyzer/crates/rust-analyzer/src/handlers/request.rs"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1b096e25da155209dc7ce0514277d3fbc5f79e806dc08183da63a387fc10602"}},{"ruleId":"D2","level":"warning","message":{"text":"rust_analyzer::handlers::request::handle_code_action (cognitive 19): rust_analyzer::handlers::request::handle_code_action has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 3 (5 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/handlers/request.rs"},"region":{"startLine":1499}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ffb205241024560c790493155637d754f3716864ca24c4a6d491cff339deabd"}},{"ruleId":"D2","level":"warning","message":{"text":"xtask::codegen::lints::generate_lint_descriptor (cognitive 19): xtask::codegen::lints::generate_lint_descriptor has cognitive complexity 19 (threshold 15). Drivers by points: loops 9, if/else 3 (6 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 4). Most of this is not in the body itself: 9 of the 19 points are its own statements and the rest belongs to one function item inside it that branches (insert_lints). 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/tools/rust-analyzer/xtask/src/codegen/lints.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"142062401b358e1ac2e947c30eaa751118451dbae9a9dcce217e953bd36d3b2a"}},{"ruleId":"D2","level":"warning","message":{"text":"MacroArgParser::parse (cognitive 19): MacroArgParser::parse has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (16 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/macros.rs"},"region":{"startLine":943}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3b42f19b8eb320449b2be8b2dffabea7ddfa87dd1d5c51e75eef4b204de094e"}},{"ruleId":"D2","level":"warning","message":{"text":"MacroBranch::rewrite (cognitive 19): MacroBranch::rewrite has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (14 pts), match/switch 2 (3 pts), boolean chains 1, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/macros.rs"},"region":{"startLine":1310}}}],"partialFingerprints":{"codehealthFindingId/v1":"073c2680a5bbe994cab7355bbf0bec02056180756e43a2be6a4db68effa02b03"}},{"ruleId":"D2","level":"warning","message":{"text":"FmtVisitor::visit_impl_items (cognitive 19): FmtVisitor::visit_impl_items has cognitive complexity 19 (threshold 15). Drivers by points: loops 3 (6 pts), if/else 3 (5 pts), boolean chains 4, match/switch 2 (4 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/tools/rustfmt/src/items.rs"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0992f0a7f6e508a027f43fdf6a5b9f170b7891dc51fa08976196b3e0382d67c"}},{"ruleId":"D2","level":"warning","message":{"text":"rustfmt_nightly::comment::comment_style (cognitive 19): rustfmt_nightly::comment::comment_style 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/tools/rustfmt/src/comment.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"02df98dd8b21878bfb8bdd5858b7fe9ff415b022fd7e177ec18726ea9ca05014"}},{"ruleId":"D2","level":"warning","message":{"text":"rustfmt_nightly::parse::macros::cfg_select::parse_items_from_cfg_select_inner (cognitive 19): rustfmt_nightly::parse::macros::cfg_select::parse_items_from_cfg_select_inner has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 2 (3 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/parse/macros/cfg_select.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f604963c697aa647055ca1dcbc8ffaed9a755fea67569ce3e06e3d7a2e73f51"}},{"ruleId":"D2","level":"warning","message":{"text":"rustfmt_nightly::types::format_function_type (cognitive 19): rustfmt_nightly::types::format_function_type has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 3, match/switch 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/types.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e7b607e5eacf11b2e362ec4dd0a4f66d247950f7a5f6ab475449d509da43a64"}},{"ruleId":"D2","level":"warning","message":{"text":"initSearch::calculate (cognitive 19): initSearch::calculate has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (6 pts), loops 5 (6 pts), ternaries 2 (4 pts), boolean chains 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1897a2ab50addcfa37c0952573863c5e49252b3c8553b07a45486742f974e95"}},{"ruleId":"D2","level":"warning","message":{"text":"initSearch::showResults (cognitive 19): initSearch::showResults has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7, ternaries 3 (6 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":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":5280}}}],"partialFingerprints":{"codehealthFindingId/v1":"576884e884336d3c600b72c5068110f6aa9fadf8284835d4092034c322db8a01"}},{"ruleId":"D2","level":"warning","message":{"text":"remove (cognitive 19): remove has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (5 pts), ternaries 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/stringdex.js"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"89d463b5583e49b97f0f64e7a3c0a9b34004414fa37cb282b8280119def3bbad"}},{"ruleId":"D2","level":"warning","message":{"text":"Param::rewrite_result (cognitive 18): Param::rewrite_result has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (16 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/tools/rustfmt/src/items.rs"},"region":{"startLine":2299}}}],"partialFingerprints":{"codehealthFindingId/v1":"359b73895112aa813a0e1eb48a307212d7112dc47ba662f787b703df387119e1"}},{"ruleId":"D2","level":"warning","message":{"text":"TokenCursor::inlined_next_and_bump (cognitive 18): TokenCursor::inlined_next_and_bump has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 1 (3 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ast/src/tokenstream.rs"},"region":{"startLine":1010}}}],"partialFingerprints":{"codehealthFindingId/v1":"fde592c8988880606d697f6322defeb9e7fbd3690b341d0c5a13a9aeeba50693"}},{"ruleId":"D2","level":"warning","message":{"text":"MirBorrowckCtxt::borrowed_content_source (cognitive 18): MirBorrowckCtxt::borrowed_content_source has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 1 (2 pts), match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/diagnostics/mod.rs"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"62b1c71643a149b22b9fabc1bac33acc93d18f09e6ec027b5c20c89ce6a5ef6d"}},{"ruleId":"D2","level":"warning","message":{"text":"MirBorrowckCtxt::add_placeholder_from_predicate_note (cognitive 18): MirBorrowckCtxt::add_placeholder_from_predicate_note has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/diagnostics/mod.rs"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a582a7d43e2d8162315d45d26aa0a84de4d6769e6e24803771d52efda35f66c"}},{"ruleId":"D2","level":"warning","message":{"text":"MirBorrowckCtxt::give_name_from_error_region (cognitive 18): MirBorrowckCtxt::give_name_from_error_region has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 4 (9 pts), if/else 4 (8 pts), boolean chains 1 (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":"compiler/rustc_borrowck/src/diagnostics/region_name.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e92fea788f4e1b58bf4ec55c11c67b178a7f5926c7ae46b79f6bf7db7f98108"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeChecker::check_call_inputs (cognitive 18): TypeChecker::check_call_inputs has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 1 (3 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/type_check/mod.rs"},"region":{"startLine":2017}}}],"partialFingerprints":{"codehealthFindingId/v1":"2315929f345268872e11062ddf4c8e312234f56dd3bb3e0e2be902192be0c392"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeChecker::add_reborrow_constraint (cognitive 18): TypeChecker::add_reborrow_constraint has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 3 (9 pts), if/else 4 (5 pts), loops 2 (4 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":"compiler/rustc_borrowck/src/type_check/mod.rs"},"region":{"startLine":2357}}}],"partialFingerprints":{"codehealthFindingId/v1":"48358618482b049f7aea77153360cd922cea3f422609131ab20f0b84c13728ea"}},{"ruleId":"D2","level":"warning","message":{"text":"UnwindContext::new (cognitive 18): UnwindContext::new has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (17 pts), 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":"compiler/rustc_codegen_cranelift/src/debuginfo/unwind.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"e56da91edb02f83fc730df95f8a78da7fe7540d8a72d0df3c2f6ea7983146208"}},{"ruleId":"D2","level":"warning","message":{"text":"CPlace::write_cvalue_maybe_transmute (cognitive 18): CPlace::write_cvalue_maybe_transmute has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 6 (13 pts), if/else 4 (5 pts) (nesting depth added 8). Of this number, 16 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. 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":"compiler/rustc_codegen_cranelift/src/value_and_place.rs"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebbecac7ab2e53ff2cee0c0d69562cd5434bc5a0fae0ea627a65bf9538151b6b"}},{"ruleId":"D2","level":"warning","message":{"text":"Builder::load_operand (cognitive 18): Builder::load_operand has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 1, match/switch 1 (nesting depth added 4). Of this number, 14 points are the body\u0027s own statements and 4 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":"compiler/rustc_codegen_gcc/src/builder.rs"},"region":{"startLine":1092}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1cac9a9aa2f3dae9310cc7f178a3c06a32fff055292756e3c0452769c3ba76d"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_codegen_gcc::callee::get_fn (cognitive 18): rustc_codegen_gcc::callee::get_fn has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 5 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_gcc/src/callee.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"0da8a323a2703ec5ca43625b60a166b6cee38f1e6f169653b609f5d29d07a41f"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_codegen_llvm::intrinsic::intrinsic_fn (cognitive 18): rustc_codegen_llvm::intrinsic::intrinsic_fn has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 4 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/intrinsic.rs"},"region":{"startLine":1198}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d5218403745b648d587139fb9ac26fb5318281b6c987a0e0b54722dfe5e6e09"}},{"ruleId":"D2","level":"warning","message":{"text":"SharedEmitterMain::check (cognitive 18): SharedEmitterMain::check has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (9 pts), match/switch 3 (8 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/back/write.rs"},"region":{"startLine":2016}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bbd2076779e4bd6465ce54c22ab5bedb41f9362cf3ebd2c14cb7d66d387c80a"}},{"ruleId":"D2","level":"warning","message":{"text":"LocalAnalyzer::process_place (cognitive 18): LocalAnalyzer::process_place has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 2 (4 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/mir/analyze.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c80629e5e9d2df83553b8a9056b8b3501cbc139ffbf6c61d177c8cc0ff3dd25"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionCx::codegen_asm_terminator (cognitive 18): FunctionCx::codegen_asm_terminator has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (17 pts), match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/mir/block.rs"},"region":{"startLine":1486}}}],"partialFingerprints":{"codehealthFindingId/v1":"41393a0f3ff728e3a654990f35208b4aa4f2458ab6a7235db5917eabec4952d0"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_codegen_ssa::base::codegen_global_asm (cognitive 18): rustc_codegen_ssa::base::codegen_global_asm has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 3 (8 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":"compiler/rustc_codegen_ssa/src/base.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"18078249b97e12d5af20bd9dfd1f4b8460b0257c959e69dc873e6e1df34fb4d9"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_const_eval::util::check_validity_requirement::check_validity_requirement_lax (cognitive 18): rustc_const_eval::util::check_validity_requirement::check_validity_requirement_lax has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 2 (4 pts), match/switch 4, boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_const_eval/src/util/check_validity_requirement.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"21a8671e637a36e414017f02fe3758bb771ce3e6ee604d5f0a5ff8ecb5c4507d"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_driver_impl::handle_explain (cognitive 18): rustc_driver_impl::handle_explain has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 2, loops 1 (2 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":"compiler/rustc_driver_impl/src/lib.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"fde5d540a8f28a475976c1f9df6c68c5f27bfbb3a43815e9e3d1761bc317d97d"}},{"ruleId":"D2","level":"warning","message":{"text":"Emitter::fix_multispans_in_extern_macros_and_render_macro_backtrace (cognitive 18): Emitter::fix_multispans_in_extern_macros_and_render_macro_backtrace has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 4, match/switch 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_errors/src/emitter.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"679124301fbd931c799583272eafeb7f785eeb69ac889da8ba8ca8521083f919"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_hir_analysis::check::check::check_opaque_meets_bounds (cognitive 18): rustc_hir_analysis::check::check::check_opaque_meets_bounds has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (11 pts), match/switch 4, loops 2 (3 pts) (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/check/check.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff09efa8143ef102c22b3b3faad8ca9fa6745b2d605cf93fd96a02ac61a18928"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_hir_analysis::check::compare_impl_item::collect_return_position_impl_trait_in_trait_tys (cognitive 18): rustc_hir_analysis::check::compare_impl_item::collect_return_position_impl_trait_in_trait_tys has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 4 (7 pts), if/else 4 (6 pts), loops 4, 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":"compiler/rustc_hir_analysis/src/check/compare_impl_item.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"1211005ef9e81740bb7dd79b41424b938defbbc6537ec0ef6dff526068772bb9"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_hir_analysis::check::wfcheck::check_item (cognitive 18): rustc_hir_analysis::check::wfcheck::check_item has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (14 pts), match/switch 2 (4 pts) (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":"compiler/rustc_hir_analysis/src/check/wfcheck.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fe0d3caa256f99a5715364eff9b8b842422cca98ef1199e4ace4a47c6f36cec"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_hir_analysis::coherence::builtin::visit_implementation_of_const_param_ty (cognitive 18): rustc_hir_analysis::coherence::builtin::visit_implementation_of_const_param_ty has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 2 (7 pts), match/switch 2 (3 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":"compiler/rustc_hir_analysis/src/coherence/builtin.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8cf7da33fa7cc98d6e111089d6d6ee46cfe9a569272a8e35ca40f0a13ee5565"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::suggest_call_as_method (cognitive 18): FnCtxt::suggest_call_as_method has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (18 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/callee.rs"},"region":{"startLine":839}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdaa03ead828a0ac2993efc7e938935e12165eb1565611b897b2eff6931f4bf2"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::note_wrong_return_ty_due_to_generic_arg (cognitive 18): FnCtxt::note_wrong_return_ty_due_to_generic_arg has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 1, match/switch 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/demand.rs"},"region":{"startLine":1249}}}],"partialFingerprints":{"codehealthFindingId/v1":"3925835a84780ef436fa41f175911a1761389c6b66a8559ab8e126f0eaeb1147"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::report_private_fields (cognitive 18): FnCtxt::report_private_fields has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 4, match/switch 2 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/expr.rs"},"region":{"startLine":2495}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4d9adfb88851107123ee6b75cfc3bdbb8cd07673e23ebf0435458e8094f2b6c"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::lint_fully_qualified_call_from_2018 (cognitive 18): FnCtxt::lint_fully_qualified_call_from_2018 has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (18 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":"compiler/rustc_hir_typeck/src/method/prelude_edition_lints.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"47cf248dadcbcd09fbf817bb06a69e439a560140f58c2779d5e6b0af9d2d9d52"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::report_no_match_method_error (cognitive 18): FnCtxt::report_no_match_method_error has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12, boolean chains 6. 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":"compiler/rustc_hir_typeck/src/method/suggest.rs"},"region":{"startLine":1233}}}],"partialFingerprints":{"codehealthFindingId/v1":"19cdbbbadfe1bfc3d653ed62a0493fd68c4e94ef268a8dfec4fa8a9ba12352b2"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::check_str_addition (cognitive 18): FnCtxt::check_str_addition has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (9 pts), match/switch 3 (7 pts), boolean chains 2 (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":"compiler/rustc_hir_typeck/src/op.rs"},"region":{"startLine":865}}}],"partialFingerprints":{"codehealthFindingId/v1":"3674699ea0637806198cae942272629a884472ab2808b46f52231f9232174523"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::error_inexistent_fields (cognitive 18): FnCtxt::error_inexistent_fields has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 2 (5 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/pat.rs"},"region":{"startLine":2311}}}],"partialFingerprints":{"codehealthFindingId/v1":"54796eabca0db7e037ede56e93f131946b0fbf18ef599d5f8e16a0446b6571f3"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::has_significant_drop_outside_of_captures (cognitive 18): FnCtxt::has_significant_drop_outside_of_captures has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (17 pts), match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/upvar.rs"},"region":{"startLine":1732}}}],"partialFingerprints":{"codehealthFindingId/v1":"d61e396e34b4974b617c73e7041bb80dacbc1976ff80b58e45ce03ba2ddf35d8"}},{"ruleId":"D2","level":"warning","message":{"text":"WritebackCx::visit_opaque_types (cognitive 18): WritebackCx::visit_opaque_types has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 2, boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/writeback.rs"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"7190aa63cb18f9658f03601a9caf67ab5eb66fd3b02394aaeeb7a4919098cae7"}},{"ruleId":"D2","level":"warning","message":{"text":"Resolver::mention_default_field_values (cognitive 18): Resolver::mention_default_field_values has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (17 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/diagnostics/impls.rs"},"region":{"startLine":3010}}}],"partialFingerprints":{"codehealthFindingId/v1":"78662621082dcc6d27d0caa48b94c3ce03509233aa3dcdbbf61d234f32316ab3"}},{"ruleId":"D2","level":"warning","message":{"text":"IfThisChanged::process_attrs (cognitive 18): IfThisChanged::process_attrs has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (7 pts), match/switch 2 (7 pts), loops 2 (4 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_incremental/src/assert_dep_graph.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"83da4baf537818022dd341d6daf06244fb8b5c2ccdf8bab138ab238f9ca6b71c"}},{"ruleId":"D2","level":"warning","message":{"text":"EllipsisInclusiveRangePatterns::check_pat (cognitive 18): EllipsisInclusiveRangePatterns::check_pat has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (13 pts), match/switch 3 (5 pts) (nesting depth added 7). Of this number, 17 points are the body\u0027s own statements and 1 belongs 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":"compiler/rustc_lint/src/builtin.rs"},"region":{"startLine":1571}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eb200248d8afa1a6412af700c266b34512873fb14ee5bb7b027fdeef557c516"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_lint::ptr_nulls::useless_check (cognitive 18): rustc_lint::ptr_nulls::useless_check has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 4, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_lint/src/ptr_nulls.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd2c1a0b48b03ed5288a638171fd828a19bdad5bff4e7a058bf28f1562b2b441"}},{"ruleId":"D2","level":"warning","message":{"text":"CStore::report_incompatible_partial_mitigations (cognitive 18): CStore::report_incompatible_partial_mitigations has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 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":"compiler/rustc_metadata/src/creader.rs"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e38b415b7f0b2dfa3f62f460b055c338bb4bcc91bb7304495dd805cdbcb73f4"}},{"ruleId":"D2","level":"warning","message":{"text":"ProvenanceMap::read_ptr (cognitive 18): ProvenanceMap::read_ptr has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 2, 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":"compiler/rustc_middle/src/mir/interpret/allocation/provenance_map.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"176104db240868733350aa5bf20124cd75488b35eee314d68bb65f0a3233cd2b"}},{"ruleId":"D2","level":"warning","message":{"text":"Builder::visit_primary_bindings_special (cognitive 18): Builder::visit_primary_bindings_special has cognitive complexity 18 (threshold 15). Drivers by points: loops 5 (10 pts), if/else 3 (6 pts), match/switch 2 (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":"compiler/rustc_mir_build/src/builder/matches/mod.rs"},"region":{"startLine":819}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5c6883b3bc8d5bb3f6d5e2207c1ead1e0ad541d8f9c92331c2991e82e1f77f6"}},{"ruleId":"D2","level":"warning","message":{"text":"PatMigration::format_subdiagnostics (cognitive 18): PatMigration::format_subdiagnostics has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (17 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_build/src/thir/pattern/migration.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdb08a4fc042ab0aea7d2c7450b3e5baf7dd0c1f19e4d51fdcef4623ae6292ac"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_mir_build::thir::constant::lit_to_const (cognitive 18): rustc_mir_build::thir::constant::lit_to_const has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (13 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_build/src/thir/constant.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"20cad1539ec8942a91747807d24278ee7aa4134c8c448327394a646643770979"}},{"ruleId":"D2","level":"warning","message":{"text":"Forward::apply_effects_in_block (cognitive 18): Forward::apply_effects_in_block has cognitive complexity 18 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 4 (7 pts), match/switch 1 (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_dataflow/src/framework/direction.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"1189d3889da7f6bb382a152132f971dff05a3a09327bb19eea53c48342823dd3"}},{"ruleId":"D2","level":"warning","message":{"text":"EverInitializedPlaces::init_reaches_location (cognitive 18): EverInitializedPlaces::init_reaches_location has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2 (3 pts), boolean chains 1, match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_dataflow/src/impls/initialized.rs"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"995d309e4a7e4daa3db17682daf2b5ea0f72c3d59dfcd6da834d5380c953b88a"}},{"ruleId":"D2","level":"warning","message":{"text":"DestinationPropagation::run_pass (cognitive 18): DestinationPropagation::run_pass has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 1 (3 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/dest_prop.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e10e88cb4e60e657a6b0beca8113b01bf4c480d0bd478b67d05836182c8d2fc"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionItemRefChecker::check_terminator (cognitive 18): FunctionItemRefChecker::check_terminator has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 1 (4 pts) (nesting depth added 11). 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":"compiler/rustc_mir_transform/src/function_item_references.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f433c7c27806ec66846d42be60fe76980326cd0abb7347895c9ca7f61776c59"}},{"ruleId":"D2","level":"warning","message":{"text":"TailCopyToMove::run_pass (cognitive 18): TailCopyToMove::run_pass has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 3 (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":"compiler/rustc_mir_transform/src/tail_copy_to_move.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b86d06e2dc1caa3a8a3158225848df2e0937d8e5688f81771300c57bcaac143"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_mir_transform::early_otherwise_branch::verify_candidate_branch (cognitive 18): rustc_mir_transform::early_otherwise_branch::verify_candidate_branch has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (17 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":"compiler/rustc_mir_transform/src/early_otherwise_branch.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"096ddbaa2c12b976b09afb2e75bba3eb4aafcf288dbecdff7ce4b9cf105006ec"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_monomorphize::collector::visit_instance_use (cognitive 18): rustc_monomorphize::collector::visit_instance_use has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 2, 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":"compiler/rustc_monomorphize/src/collector.rs"},"region":{"startLine":995}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc2966b8f793a850a66e3e357d45b32d7c916cdfa265ea95011d15aef32972bc"}},{"ruleId":"D2","level":"warning","message":{"text":"EvalCtxt::try_assemble_bounds_via_registered_opaques (cognitive 18): EvalCtxt::try_assemble_bounds_via_registered_opaques has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 2 (3 pts), match/switch 2 (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":"compiler/rustc_next_trait_solver/src/solve/assembly/mod.rs"},"region":{"startLine":1150}}}],"partialFingerprints":{"codehealthFindingId/v1":"a485e95639e195724c9dd8d6fe850c6b33809c886d5669140a2f32b780913e63"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::annotate_following_item_if_applicable (cognitive 18): Parser::annotate_following_item_if_applicable has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (9 pts), match/switch 5 (8 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/attr.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e7195c2107123dc49e7d83a573753d614ad3a79171c1bf7183ee6bd9e8874e5"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_expr_break (cognitive 18): Parser::parse_expr_break has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 4, match/switch 1 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/expr.rs"},"region":{"startLine":1741}}}],"partialFingerprints":{"codehealthFindingId/v1":"15b39453350db1c3f882bab860747130c0c6e38d013e0f4675847af4aef1add5"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_self_param (cognitive 18): Parser::parse_self_param has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 6, match/switch 2 (3 pts) (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/function.rs"},"region":{"startLine":880}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2ad4e5ef7a4a75a2389ee0486aacd468014234ae3aee1a904d746fdadcb6195"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_pat_no_top_guard_inner (cognitive 18): Parser::parse_pat_no_top_guard_inner has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 5, match/switch 3 (4 pts), loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/pat.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad7179b6c40bcae57e81fca74a750e62b6c88abdfd462bcd4570ac05f9c558e1"}},{"ruleId":"D2","level":"warning","message":{"text":"Checker::visit_use::recurse (cognitive 18): Checker::visit_use::recurse has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 1 (3 pts), boolean chains 1, match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_passes/src/stability.rs"},"region":{"startLine":898}}}],"partialFingerprints":{"codehealthFindingId/v1":"e98f308259647fa07a54a86c0dfbe0ad8f12200313619cacba4d4f53912d7f51"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_passes::eii::check_externally_implementable_items (cognitive 18): rustc_passes::eii::check_externally_implementable_items has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 4 (6 pts), match/switch 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_passes/src/eii.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"673d222fc7dc92b1643937810fffa91d0907df0d72e95697eaff1adcf69ea765"}},{"ruleId":"D2","level":"warning","message":{"text":"Constructor::fmt_fields (cognitive 18): Constructor::fmt_fields has cognitive complexity 18 (threshold 15). Drivers by points: loops 5 (13 pts), match/switch 2 (3 pts), if/else 2 (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_pattern_analysis/src/constructor.rs"},"region":{"startLine":889}}}],"partialFingerprints":{"codehealthFindingId/v1":"d20d20d53a09cc5601f5d005f5acd0ca4a3965541ed434fc55212bfe9f740aae"}},{"ruleId":"D2","level":"warning","message":{"text":"LateResolutionVisitor::restrict_assoc_type_in_where_clause (cognitive 18): LateResolutionVisitor::restrict_assoc_type_in_where_clause has cognitive complexity 18 (threshold 15). Drivers by points: if/else 15 (18 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/late/diagnostics.rs"},"region":{"startLine":2304}}}],"partialFingerprints":{"codehealthFindingId/v1":"adc42c0fc3e845455468baeaa73acc5b0824b71b7b20d899d824ef3260bbf3c1"}},{"ruleId":"D2","level":"warning","message":{"text":"LateResolutionVisitor::find_module (cognitive 18): LateResolutionVisitor::find_module has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 3, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/late/diagnostics.rs"},"region":{"startLine":3536}}}],"partialFingerprints":{"codehealthFindingId/v1":"82e9e46953158ce9c6d1bfd262a2a5aebf5c9b79136c381f5564f8c17edac217"}},{"ruleId":"D2","level":"warning","message":{"text":"LateResolutionVisitor::find_lifetime_for_self (cognitive 18): LateResolutionVisitor::find_lifetime_for_self has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 1, match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/late.rs"},"region":{"startLine":2765}}}],"partialFingerprints":{"codehealthFindingId/v1":"24c22203dc85bb01eabc96a9f2a5e6583eced8d8da67468e9c64611d0b887b7e"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_span::edit_distance::edit_distance (cognitive 18): rustc_span::edit_distance::edit_distance has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 4 (5 pts), boolean chains 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_span/src/edit_distance.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1d53f567e4a616639f61f31bea83ca929ed9ff5230a62a1bba55304c5d71048"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_span::edit_distance::find_best_match_for_name_impl (cognitive 18): rustc_span::edit_distance::find_best_match_for_name_impl has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_span/src/edit_distance.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"958837f7b8e39d614a4ddc57558f664bd2a13541c9641dc06b910d5f5ceff92b"}},{"ruleId":"D2","level":"warning","message":{"text":"Target::abi_required_features (cognitive 18): Target::abi_required_features has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 10 (18 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":"compiler/rustc_target/src/target_features.rs"},"region":{"startLine":1333}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9abee87046d20d71e850b146a8d6a34466ce72098aa8a3173b75169e9b10acb"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_target::callconv::sparc64::classify_arg (cognitive 18): rustc_target::callconv::sparc64::classify_arg has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 3 (7 pts), if/else 5 (6 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_target/src/callconv/sparc64.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"b711ca67ccc021c1ca3dc040f5e5a4e62db077ed013d6ccea7615a557e37de9f"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_target::callconv::x86::fill_inregs (cognitive 18): rustc_target::callconv::x86::fill_inregs has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 2 (3 pts), boolean chains 2, 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":"compiler/rustc_target/src/callconv/x86.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"d27f7b4db1ce86cc64e5ec5c44a6727dc5aaa26d0624d1ef6e04be69f2f0d61b"}},{"ruleId":"D2","level":"warning","message":{"text":"NiceRegionError::try_report_mismatched_static_lifetime (cognitive 18): NiceRegionError::try_report_mismatched_static_lifetime has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (13 pts), loops 2 (5 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/error_reporting/infer/nice_region_error/mismatched_static_lifetime.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce409bd7a3fd97cf42b6a0ebd4448ac414bb4a6fe01cf8e3ea9c8fb724d857f2"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeErrCtxt::cmp_traits (cognitive 18): TypeErrCtxt::cmp_traits has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13 (17 pts), loops 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/error_reporting/infer/mod.rs"},"region":{"startLine":914}}}],"partialFingerprints":{"codehealthFindingId/v1":"baa94ab490130c28ceccdbe37841909f48ab11a2ccae503b18cd7ef1e499d96e"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeErrCtxt::suggest_await_on_expect_found (cognitive 18): TypeErrCtxt::suggest_await_on_expect_found has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 4 (6 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/error_reporting/infer/suggest.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dfdd9cb21be0248841a72b2f595d01e6b59ffedbd24cadc75c2da2029337025"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_trait_selection::error_reporting::traits::ambiguity::compute_applicable_impls_for_diagnostics (cognitive 18): rustc_trait_selection::error_reporting::traits::ambiguity::compute_applicable_impls_for_diagnostics has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 2, loops 1 (2 pts), match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/error_reporting/traits/ambiguity.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"65351e45ea986270e96afec9b4b4826051f786b31a9e3fee3c7abda81d01f06b"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_trait_selection::opaque_types::opaque_type_has_defining_use_args (cognitive 18): rustc_trait_selection::opaque_types::opaque_type_has_defining_use_args has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (9 pts), match/switch 2 (5 pts), boolean chains 2, loops 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/opaque_types.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"0405a6609a56e6fec6b2a17c6174234666097afb8406443aac8b007e596bb845"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_trait_selection::traits::specialize::specialization_graph_provider (cognitive 18): rustc_trait_selection::traits::specialize::specialization_graph_provider has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 3 (5 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/traits/specialize/mod.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"2af7417bd80b1847bf8f205cb1e2ad02bd642a7afb89ee7e32be1aef68e91ca6"}},{"ruleId":"D2","level":"warning","message":{"text":"Response::update_var_values_is_identity (cognitive 18): Response::update_var_values_is_identity has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 3, match/switch 1 (2 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_type_ir/src/solve/mod.rs"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"280b4e41e1bbe6b143ea10ce1caf7f49613023abdc6559463b5f5ce4c18a268f"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_type_ir::region_constraint::compute_new_region_constraints (cognitive 18): rustc_type_ir::region_constraint::compute_new_region_constraints has cognitive complexity 18 (threshold 15). Drivers by points: loops 4 (7 pts), match/switch 2 (6 pts), if/else 1 (4 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_type_ir/src/region_constraint.rs"},"region":{"startLine":701}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5b5bf9187b1ff7fceacb3d01fb1cca8252a0b15ce10084c851e83a8592cb630"}},{"ruleId":"D2","level":"warning","message":{"text":"compiler_builtins::float::trunc::trunc (cognitive 18): compiler_builtins::float::trunc::trunc has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (18 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":"library/compiler-builtins/compiler-builtins/src/float/trunc.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"febdd30c96dd2f9996b981c2b22ec789c998d75423bac5632fcf499104b26900"}},{"ruleId":"D2","level":"warning","message":{"text":"libm_macros::expand (cognitive 18): libm_macros::expand has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 3 (7 pts), if/else 3 (6 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/compiler-builtins/crates/libm-macros/src/lib.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ded72715dba2b507ea4ff26e2fe713153bd2555b252a2b8d59ca9fdde352bdf"}},{"ruleId":"D2","level":"warning","message":{"text":"libm::math::exp::exp (cognitive 18): libm::math::exp::exp has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (18 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":"library/compiler-builtins/libm/src/math/exp.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"532cb480e5381db537e320e509ea18badf497a7f1de1925bb6014fed77c9a07f"}},{"ruleId":"D2","level":"warning","message":{"text":"libm::math::generic::rint::rint_status (cognitive 18): libm::math::generic::rint::rint_status has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/compiler-builtins/libm/src/math/generic/rint.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"84a997a0f812f4d99ff716ff54fa0b330b506fc4312bea754d553a5aacce62a0"}},{"ruleId":"D2","level":"warning","message":{"text":"File::open_native (cognitive 18): File::open_native has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (16 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":"library/std/src/sys/fs/windows.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b47efef98131b7db1e51d6b8984a523cb843c80ed5faee2822fd117601693d3"}},{"ruleId":"D2","level":"warning","message":{"text":"Copier::copy (cognitive 18): Copier::copy has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (7 pts), match/switch 3 (7 pts), boolean chains 4 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/io/kernel_copy/linux.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"5279ce2c3a2f65e5d633887a44f9b628750aca2d8c4f953813079249975981ac"}},{"ruleId":"D2","level":"warning","message":{"text":"Socket::poll_connected (cognitive 18): Socket::poll_connected has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/net/connection/socket/unix.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"c697d892c4b043a9c1af16cb9faf0717eba8a1605c568010cc73dee8e3c381f4"}},{"ruleId":"D2","level":"warning","message":{"text":"TcpListener::accept (cognitive 18): TcpListener::accept has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13 (18 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/net/connection/xous/tcplistener.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"dedabfb805fc01bd77029b6d7301e5c27161d2895dc87b3c2d51b970657bfd0b"}},{"ruleId":"D2","level":"warning","message":{"text":"WaiterQueue::insert (cognitive 18): WaiterQueue::insert has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/sync/condvar/itron.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0a769513da0ba444cb3da74bf8f3848f12a259d348741915176a87fd4c4e8d5"}},{"ruleId":"D2","level":"warning","message":{"text":"Intrinsic::pre_build (cognitive 18): Intrinsic::pre_build has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 2 (4 pts), match/switch 2 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/stdarch-gen-arm/src/intrinsic.rs"},"region":{"startLine":1418}}}],"partialFingerprints":{"codehealthFindingId/v1":"b29bd6d9bfbc1429ab2d5a4335df53bcf72801d150ad51005f4f508c021d2201"}},{"ruleId":"D2","level":"warning","message":{"text":"stdarch_gen_loongarch::gen_bind (cognitive 18): stdarch_gen_loongarch::gen_bind has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (17 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/stdarch-gen-loongarch/src/main.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"060edf21ef24a9fe2f2a128756d7b7afc7df7cbb89784796a37188ee9dc6e9fc"}},{"ruleId":"D2","level":"warning","message":{"text":"Rustc::run::prepare_image (cognitive 18): Rustc::run::prepare_image has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (9 pts), loops 5 (7 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/build_steps/dist.rs"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bb0913ce723a59fffe74e45c0aa547fc0751c4e2b5c0dae0bd4c58168134fc8"}},{"ruleId":"D2","level":"warning","message":{"text":"LlvmTools::run (cognitive 18): LlvmTools::run has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 7). Of this number, 9 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/bootstrap/src/core/build_steps/dist.rs"},"region":{"startLine":2685}}}],"partialFingerprints":{"codehealthFindingId/v1":"169ba397bb648f38927d4fe7215a3dc7e927ac6f9f44058459b98816d27250f4"}},{"ruleId":"D2","level":"warning","message":{"text":"bootstrap::core::download::download_component (cognitive 18): bootstrap::core::download::download_component has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 1, match/switch 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/download.rs"},"region":{"startLine":798}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b08c1e0709c201285440f24260d1679479ce091c2fcbb08fa6c54c41e99913d"}},{"ruleId":"D2","level":"warning","message":{"text":"RenderType::read_from_bytes (cognitive 18): RenderType::read_from_bytes has cognitive complexity 18 (threshold 15). Drivers by points: loops 3 (10 pts), if/else 6 (8 pts) (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/render/mod.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b0096372bc3a24d1dcdf5fbc220c760782de2a4224411db0815f7be42981533"}},{"ruleId":"D2","level":"warning","message":{"text":"Stripper::fold_item (cognitive 18): Stripper::fold_item has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 3, match/switch 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/passes/stripper.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3d6b4ba7e2c784b6a1dcf7bc11d4db6ff427cd6f396ba8586423ce3beaf6ea8"}},{"ruleId":"D2","level":"warning","message":{"text":"RustdocVisitor::visit_item_inner (cognitive 18): RustdocVisitor::visit_item_inner has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 5, loops 1 (2 pts), match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/visit_ast.rs"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fcab16df1b0779b14815a947c0cd5b27b275688b42ab14139a16a14a2eaeaaa"}},{"ruleId":"D2","level":"warning","message":{"text":"rustdoc::doctest::doctest_run_fn (cognitive 18): rustdoc::doctest::doctest_run_fn has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (15 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/doctest.rs"},"region":{"startLine":1183}}}],"partialFingerprints":{"codehealthFindingId/v1":"585f14d08a99362373762f18e09d27f4e55108da18b10b8e924412acc1469516"}},{"ruleId":"D2","level":"warning","message":{"text":"rustdoc::passes::collect_intra_doc_links::ambiguity_error (cognitive 18): rustdoc::passes::collect_intra_doc_links::ambiguity_error has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (12 pts), loops 2 (3 pts), boolean chains 2, match/switch 1 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/passes/collect_intra_doc_links.rs"},"region":{"startLine":2506}}}],"partialFingerprints":{"codehealthFindingId/v1":"788b457b8535f795df12695f6b9a67ea9b9dff8c09f41c86e964a27e2add6cae"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_config::types::create_disallowed_map (cognitive 18): clippy_config::types::create_disallowed_map has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_config/src/types.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6b444cdff1c083e4332acf7d29951b17c325943460840dc9cbf8382adfbe82d"}},{"ruleId":"D2","level":"warning","message":{"text":"EmptyLineAfter::check_gaps (cognitive 18): EmptyLineAfter::check_gaps has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (8 pts), match/switch 3 (4 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/empty_line_after.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8f04949757097da623eab2b3add6db7845b925f934627ed684c7568c6caa9e4"}},{"ruleId":"D2","level":"warning","message":{"text":"NeedlessPassByRefMut::check_crate_post (cognitive 18): NeedlessPassByRefMut::check_crate_post has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (15 pts), loops 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/needless_pass_by_ref_mut.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"17255de4197a6ff43a856c22170e90132a18d9d3e23fd43a884b9e4467dd2fbd"}},{"ruleId":"D2","level":"warning","message":{"text":"PanicUnimplemented::check_expr (cognitive 18): PanicUnimplemented::check_expr has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 7, match/switch 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/panic_unimplemented.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aa7daee2c162294cbeaf37963dd78d8e08d34e0b80d687a4a36819d9a48d5ff"}},{"ruleId":"D2","level":"warning","message":{"text":"VecPushSearcher::display_err (cognitive 18): VecPushSearcher::display_err has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 4, loops 1 (2 pts), match/switch 2 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/vec_init_then_push.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"84ba6f920e3f7efa91be61e0d6f5904e300d225754f7b1b2208cd518e9d313f3"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::casts::cast_possible_truncation::apply_reductions (cognitive 18): clippy_lints::casts::cast_possible_truncation::apply_reductions has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 2 (3 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/tools/clippy/clippy_lints/src/casts/cast_possible_truncation.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"31af997c5f91d7c2398e1815cadf22f226913186edf2c8a4bc87a46d82856e90"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::casts::needless_type_cast::has_generic_return_type (cognitive 18): clippy_lints::casts::needless_type_cast::has_generic_return_type has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (12 pts), boolean chains 3, match/switch 2 (3 pts) (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/tools/clippy/clippy_lints/src/casts/needless_type_cast.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd6f9530238f109a9f564a00e355fbcb53fe78273738c863ec2d2a271ed5449a"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::casts::ptr_as_ptr::check (cognitive 18): clippy_lints::casts::ptr_as_ptr::check has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 2 (5 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/casts/ptr_as_ptr.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"4498359a6b2c728af3043bf14255f55d1b9ec79b36029251db527723e0ebfe59"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::doc::lazy_continuation::check (cognitive 18): clippy_lints::doc::lazy_continuation::check has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 4, loops 1 (2 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/doc/lazy_continuation.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"698daceadd35ef38da3a18192198a17bf428bbd38adbaef0d0e281bd3462b7fe"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::implied_bounds_in_impls::emit_lint (cognitive 18): clippy_lints::implied_bounds_in_impls::emit_lint has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 2, loops 1 (2 pts), match/switch 1 (2 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/tools/clippy/clippy_lints/src/implied_bounds_in_impls.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"206f7b427868d30b783b89977065168ebf7bd37b73829097b7da53bee59dc307"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::matches::manual_unwrap_or::handle (cognitive 18): clippy_lints::matches::manual_unwrap_or::handle has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 4 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/matches/manual_unwrap_or.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"32f3c1b66520d68ce97371231bcb1261efc17b10010ca7e5cd29169c1ede930f"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::matches::match_str_case_mismatch::verify_case (cognitive 18): clippy_lints::matches::match_str_case_mismatch::verify_case has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 2 (4 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/matches/match_str_case_mismatch.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"683de2727efdada8cb7417ad6a17f57128ab78cb3837d777c9a6981f6fadf056"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::methods::double_ended_iterator_last::check (cognitive 18): clippy_lints::methods::double_ended_iterator_last::check has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/methods/double_ended_iterator_last.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbe414eaaf97b28d38d076958f1e73856b26a598b490f1cd571f2fb6d6d5e75a"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::methods::unnecessary_to_owned::check_addr_of_expr (cognitive 18): clippy_lints::methods::unnecessary_to_owned::check_addr_of_expr has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 7 (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/tools/clippy/clippy_lints/src/methods/unnecessary_to_owned.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"5686600e48d2d251e8cdebe3ca5aacbf126c78e1a0b4055eddb9836dc22401f1"}},{"ruleId":"D2","level":"warning","message":{"text":"ConstEvalCtxt::expr (cognitive 18): ConstEvalCtxt::expr has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 5 (9 pts), if/else 4 (7 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/tools/clippy/clippy_utils/src/consts.rs"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9a87b4bd9e8759ab22abd0e2f1dafdd1d90cd212ead7819fd87a980e526105f"}},{"ruleId":"D2","level":"warning","message":{"text":"ExprEagernessVisitor::visit_expr (cognitive 18): ExprEagernessVisitor::visit_expr has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 3 (6 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/tools/clippy/clippy_utils/src/eager_or_lazy.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"f24ab28fb7b0963693296a291c6a7e0fcfac8efffae0af57a9c5be0018fa49b5"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_utils::qualify_min_const_fn::check_terminator (cognitive 18): clippy_utils::qualify_min_const_fn::check_terminator has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 2 (4 pts), loops 1 (3 pts) (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_utils/src/qualify_min_const_fn.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca5113b2daa20989844b9edadc408cf2929dfc65992aae4841efd7b3c1d6ff7c"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_utils::ty::type_certainty::expr_type_certainty (cognitive 18): clippy_utils::ty::type_certainty::expr_type_certainty has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (13 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_utils/src/ty/type_certainty/mod.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"65e0b43b9a2819d4df230f45f8bf032e2fe4297e10f326eb93819a0746cac34e"}},{"ruleId":"D2","level":"warning","message":{"text":"lintcheck::json::diff (cognitive 18): lintcheck::json::diff has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 3 (4 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/lintcheck/src/json.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1b003266b9cde6fbd23729c2eec9a970d5c2659dff97b8a6ebb4501d96ea54e"}},{"ruleId":"D2","level":"warning","message":{"text":"Node::merge_directory_licenses (cognitive 18): Node::merge_directory_licenses has cognitive complexity 18 (threshold 15). Drivers by points: loops 3 (7 pts), if/else 2 (6 pts), match/switch 2 (5 pts) (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/tools/collect-license-metadata/src/path_tree.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d4881155a70d067ed13ebf55cc584c004760384424f81d0ddf5c6bfe51dcb8f"}},{"ruleId":"D2","level":"warning","message":{"text":"TestCx::build_auxiliary (cognitive 18): TestCx::build_auxiliary has cognitive complexity 18 (threshold 15). Drivers by points: if/else 14 (15 pts), boolean chains 2, loops 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/compiletest/src/runtest.rs"},"region":{"startLine":1434}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7c79adddd5f5e237206d42dc1cbabd7a37f5294eaa0a5925f781d7633dbfb06"}},{"ruleId":"D2","level":"warning","message":{"text":"compiletest::read2::imp::read2 (cognitive 18): compiletest::read2::imp::read2 has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/compiletest/src/read2.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"5803f89f9f333ccab3ad67991f01693a75b3ca02fdd02f0d7fb1967147d5679f"}},{"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/tools/miri/src/borrow_tracker/stacked_borrows/stack.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5e72c335d3c5ee6ba59f1bebbc9ede9f237e54b9c2a7c1518774724af02c27f"}},{"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/tools/miri/src/shims/io_error.rs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5f83aec925cd44b8c37cbe7cfe10e843ba0e70e729d0054c334fe9780cbda13"}},{"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/tools/miri/src/shims/native_lib/mod.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"306191c633592f4630921279ab0a45e3a5e04666698bf1a06538d039b26cfa55"}},{"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/tools/miri/src/shims/unix/socket.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f8edd34280ac00f1e90b2a8bbec502bf568184b1a273c585db8b460b50fef63"}},{"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/tools/miri/src/shims/unix/virtual_socket.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"ead509024dac19c6eb125abb6aa922af73db197d7f9f7a1560c5949e617e441f"}},{"ruleId":"D2","level":"warning","message":{"text":"CfgExpr::parse_from_ast (cognitive 18): CfgExpr::parse_from_ast has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (10 pts), match/switch 4 (8 pts) (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/cfg/src/cfg_expr.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0655d870725a4493bd9531c512265cccfd509b52fc02eb0b8a1be142c7398e4"}},{"ruleId":"D2","level":"warning","message":{"text":"hir::term_search::tactics::free_function (cognitive 18): hir::term_search::tactics::free_function has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 3 (5 pts), boolean chains 2 (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/tools/rust-analyzer/crates/hir/src/term_search/tactics.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4549038534300ea04de9cc7391e8536da928651fda9ed7ae65f41a299f2e32a"}},{"ruleId":"D2","level":"warning","message":{"text":"ExprCollector::lower_coroutine_body_with_moved_arguments (cognitive 18): ExprCollector::lower_coroutine_body_with_moved_arguments has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/expr_store/lower.rs"},"region":{"startLine":1097}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfa34e750c86df6e4057f6d3638000da4f853456714dc63e38e31eefc3c195e0"}},{"ruleId":"D2","level":"warning","message":{"text":"UseTree::expand_impl (cognitive 18): UseTree::expand_impl has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 5 (9 pts), if/else 3 (6 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 8). Of this number, 14 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. 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/tools/rust-analyzer/crates/hir-def/src/item_tree.rs"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdc759f998c28dd278a8ac43f9e6e900a7835e8bce21151c873756ba3b83adf7"}},{"ruleId":"D2","level":"warning","message":{"text":"DefCollector::resolution_loop (cognitive 18): DefCollector::resolution_loop has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 3 (6 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/nameres/collector.rs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0e710a9624133de9de084dd90f0c88d4444cf3a9be9daa269db8cf852218187"}},{"ruleId":"D2","level":"warning","message":{"text":"hir_def::attrs::docs::extend_with_attrs (cognitive 18): hir_def::attrs::docs::extend_with_attrs has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (13 pts), match/switch 3 (4 pts), boolean chains 1 (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/attrs/docs.rs"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"f78376a91737bc19d90bc8f48ffdf02a8b0516a1cd9eb24b6fbc19acc81b51e6"}},{"ruleId":"D2","level":"warning","message":{"text":"hir_expand::mod_path::convert_path (cognitive 18): hir_expand::mod_path::convert_path has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 4 (8 pts), if/else 4 (6 pts), boolean chains 2, loops 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/tools/rust-analyzer/crates/hir-expand/src/mod_path.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"55416f62345a18b8f2ce68b1e9ef30a8c89b44745f11170857842ddf7b04e929"}},{"ruleId":"D2","level":"warning","message":{"text":"DeclValidator::validate_struct_fields (cognitive 18): DeclValidator::validate_struct_fields has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (DeclValidator::validate_enum_variant_fields) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ide/src/diagnostics/decl_check.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"09a3bc4de38b8448b0982fb1f92909a3d3efcc687cbec8eb30abe390da633c43"}},{"ruleId":"D2","level":"warning","message":{"text":"DeclValidator::validate_enum_variants (cognitive 18): DeclValidator::validate_enum_variants has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 3 (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/tools/rust-analyzer/crates/hir-ide/src/diagnostics/decl_check.rs"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"47385613c7df54a25180098ba5da8e277b91b55b92614dc7e378bf4fbb796d0c"}},{"ruleId":"D2","level":"warning","message":{"text":"DeclValidator::validate_enum_variant_fields (cognitive 18): DeclValidator::validate_enum_variant_fields has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (DeclValidator::validate_struct_fields) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ide/src/diagnostics/decl_check.rs"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"83b9ff743ad88e2cd42feeeda0b20acbcb728615467daa93dde847c0ed6ffc16"}},{"ruleId":"D2","level":"warning","message":{"text":"MatchCheckCtx::ctors_for_ty (cognitive 18): MatchCheckCtx::ctors_for_ty has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 1 (4 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ide/src/diagnostics/match_check/pat_analysis.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"db892d1d57b10c2d80c504b1e95b43b797e12cf7df54376ebd4ced5661f16dec"}},{"ruleId":"D2","level":"warning","message":{"text":"CastCheck::do_check (cognitive 18): CastCheck::do_check has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 6 (14 pts), if/else 1 (4 pts) (nesting depth added 11). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/infer/cast.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"fff6e94d45d9e34b9e06ed419e4bb72fb98e0ec223fcdf6067289f197a67db9c"}},{"ruleId":"D2","level":"warning","message":{"text":"Evaluator::run_drop_glue_deep (cognitive 18): Evaluator::run_drop_glue_deep has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (7 pts), match/switch 3 (6 pts), loops 1 (4 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/mir/eval.rs"},"region":{"startLine":2952}}}],"partialFingerprints":{"codehealthFindingId/v1":"b879ccf44cf6390c1d281f21708c5ded0dc4c67c64a5c418949e999b21538cbb"}},{"ruleId":"D2","level":"warning","message":{"text":"hir_ty::lower::generic_predicates (cognitive 18): hir_ty::lower::generic_predicates has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (11 pts), loops 2 (3 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 6). Of this number, 16 points are the body\u0027s own statements and 2 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/tools/rust-analyzer/crates/hir-ty/src/lower.rs"},"region":{"startLine":2778}}}],"partialFingerprints":{"codehealthFindingId/v1":"8be13f902110eaec6fc7b7d8091d73910f66d7bc0645957ecbb0203fb9d5d03c"}},{"ruleId":"D2","level":"warning","message":{"text":"ide::inlay_hints::binding_mode::hints (cognitive 18): ide::inlay_hints::binding_mode::hints has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 5 (8 pts), if/else 5 (6 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/inlay_hints/binding_mode.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e704f94d0910bf1cf24452df972d0804957350b8ba4400a431fbcb84b279cb8"}},{"ruleId":"D2","level":"warning","message":{"text":"ide::inlay_hints::chaining::hints (cognitive 18): ide::inlay_hints::chaining::hints has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 1 (2 pts), boolean chains 1, match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/inlay_hints/chaining.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"e562f077cd36a6db8bc63cb0e9a46ae6c9eeeaad4f40a10dd931ccdd1f50c7eb"}},{"ruleId":"D2","level":"warning","message":{"text":"Module::expand_and_group_usages_file_wise (cognitive 18): Module::expand_and_group_usages_file_wise has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 2 (6 pts), boolean chains 1, match/switch 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/extract_module.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"d549494e59b4c3d21da3977662781f9f93999349a29db28b97fa7816ea928e9f"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_assists::handlers::auto_import::relevance_score (cognitive 18): ide_assists::handlers::auto_import::relevance_score has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 5 (11 pts), if/else 4 (7 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/tools/rust-analyzer/crates/ide-assists/src/handlers/auto_import.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2c6cf5bb2706ec8a83612c417463cb512ef2df4305ccccab4fd5ddafc21561b"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_assists::handlers::unnecessary_async::unnecessary_async (cognitive 18): ide_assists::handlers::unnecessary_async::unnecessary_async has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (12 pts), match/switch 1 (3 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/unnecessary_async.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"2de11a8681c982194f39a869513b488d63b5283c1f2d6c494854a4982969528e"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_completion::completions::attribute::cfg::complete_cfg (cognitive 18): ide_completion::completions::attribute::cfg::complete_cfg has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (10 pts), match/switch 4 (6 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-completion/src/completions/attribute/cfg.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc030c37858dbef2d9b63c3a24264bab952104f67daa0e7531e75641e97f2c62"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_completion::render::render_resolution_path (cognitive 18): ide_completion::render::render_resolution_path has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (8 pts), boolean chains 5, match/switch 4 (5 pts) (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-completion/src/render.rs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd8f3c843de3d9c7b6b8865c25639e5b449fb9305e2e1f8038ccb351dba0d2ab"}},{"ruleId":"D2","level":"warning","message":{"text":"Definition::range_for_rename (cognitive 18): Definition::range_for_rename has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 7 (15 pts), if/else 2 (3 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/tools/rust-analyzer/crates/ide-db/src/rename.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"52e6d2c4561818329c625933eb265967a09c620e891669b85f6e7db0d6ca1453"}},{"ruleId":"D2","level":"warning","message":{"text":"ProcMacroServerProcess::run (cognitive 18): ProcMacroServerProcess::run has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 3 (8 pts), if/else 5 (7 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/proc-macro-api/src/process.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"76d3988bb8344b685ea44bcdd216e4899eeef8d0bc7a8b9bb0e143f719c8e0aa"}},{"ruleId":"D2","level":"warning","message":{"text":"rust_analyzer::handlers::request::handle_parent_module (cognitive 18): rust_analyzer::handlers::request::handle_parent_module has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 5 (13 pts), if/else 3 (5 pts) (nesting depth added 10). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/handlers/request.rs"},"region":{"startLine":931}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1d541fbbf249c6d3187eeeb4bf5bdd28986f1cfd4db56db19d53bbe8f80e052"}},{"ruleId":"D2","level":"warning","message":{"text":"rust_analyzer::lsp::to_proto::semantic_tokens (cognitive 18): rust_analyzer::lsp::to_proto::semantic_tokens has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (9 pts), match/switch 2 (6 pts), loops 2 (3 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/tools/rust-analyzer/crates/rust-analyzer/src/lsp/to_proto.rs"},"region":{"startLine":749}}}],"partialFingerprints":{"codehealthFindingId/v1":"505c9cdd32c5e5fc2b93375aa28876523245172b49b414c8b67927a0a04f83ec"}},{"ruleId":"D2","level":"warning","message":{"text":"stdx::process::imp::read2 (cognitive 18): stdx::process::imp::read2 has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/stdx/src/process.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b819fa84046dacffb4ecc81d877192d05ae0c1d43955f42d34b3a643a980fa0"}},{"ruleId":"D2","level":"warning","message":{"text":"syntax::validation::validate_path_keywords (cognitive 18): syntax::validation::validate_path_keywords has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 4, match/switch 1 (2 pts), loops 1 (nesting depth added 7). Most of this is not in the body itself: 8 of the 18 points are its own statements and the rest belongs to one function item inside it that branches (use_prefix). 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/tools/rust-analyzer/crates/syntax/src/validation.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"492fbe694bdc148438042f69ef5381781146edac1d0c191918a7396390641a0d"}},{"ruleId":"D2","level":"warning","message":{"text":"xtask::publish::notes::process_inline_macros (cognitive 18): xtask::publish::notes::process_inline_macros has cognitive complexity 18 (threshold 15). Drivers by points: loops 7 (15 pts), match/switch 2 (3 pts) (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/xtask/src/publish/notes.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"12cf4abe87e3e30c67611b950c2fd5db2777fc84090e3e3138486ac257c8b015"}},{"ruleId":"D2","level":"warning","message":{"text":"CommentCodeSlices::next (cognitive 18): CommentCodeSlices::next has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (8 pts), match/switch 3 (6 pts), boolean chains 3, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/comment.rs"},"region":{"startLine":1698}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a0064980896cc55f1402f8ab6cbdc3a2ab2f529f70926217957cc1e9d64215f"}},{"ruleId":"D2","level":"warning","message":{"text":"UseTree::flatten (cognitive 18): UseTree::flatten has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (6 pts), loops 2 (5 pts), match/switch 2 (5 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/imports.rs"},"region":{"startLine":699}}}],"partialFingerprints":{"codehealthFindingId/v1":"88b599d6e9027203934d764568dab769b27be7a68e80db3b68d3883798fa2df7"}},{"ruleId":"D2","level":"warning","message":{"text":"rustfmt_nightly::closures::rewrite_last_closure (cognitive 18): rustfmt_nightly::closures::rewrite_last_closure has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 3 (9 pts), if/else 4 (7 pts), boolean chains 2 (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/tools/rustfmt/src/closures.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1204d3b16ed3b42354670f4ad046174f6a1d0dad5295d53644a8f306b9de8f9"}},{"ruleId":"D2","level":"warning","message":{"text":"rustfmt_nightly::lists::extract_post_comment (cognitive 18): rustfmt_nightly::lists::extract_post_comment has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (12 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/tools/rustfmt/src/lists.rs"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"a175cee98744943f74c04e69f0d5a4cab3a64f02fdcf8e4b29e0fb445e594856"}},{"ruleId":"D2","level":"warning","message":{"text":"rustfmt_nightly::macros::rewrite_cfg_select_arm (cognitive 18): rustfmt_nightly::macros::rewrite_cfg_select_arm has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (13 pts), match/switch 3 (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/tools/rustfmt/src/macros.rs"},"region":{"startLine":1664}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9eabca15c52fbd59e29841d39d1aa100474631a3d5feb5c3ec8336f50fa5e71"}},{"ruleId":"D2","level":"warning","message":{"text":"tidy::pal::check_cfgs (cognitive 18): tidy::pal::check_cfgs has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 3, match/switch 2 (3 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/tidy/src/pal.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"143884cc1bd87577b20a1dea06bd3421f06367d05f3d6407780baab4585803b7"}},{"ruleId":"D2","level":"warning","message":{"text":"tidy::rustdoc_json::check (cognitive 18): tidy::rustdoc_json::check has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (13 pts), match/switch 2 (3 pts), loops 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/tools/tidy/src/rustdoc_json.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a68a6bd01cc3a33b65a915f3b786ac9badc4ee2a68a4b3987d730a9ee62eedc"}},{"ruleId":"D2","level":"warning","message":{"text":"SyntaxTreeProvider.getElementByRange (cognitive 18): SyntaxTreeProvider.getElementByRange has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/editors/code/src/syntax_tree_provider.ts"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"5162b40a52b99186dfce4e1052882545ad0ab4a5c11e383a42521ea69b610137"}},{"ruleId":"D2","level":"warning","message":{"text":"commands.asWorkspaceSnippetEdit (cognitive 18): commands.asWorkspaceSnippetEdit has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (6 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/editors/code/src/commands.ts"},"region":{"startLine":1147}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc9ccb2c53c915f2251c3615eaabf4cd014aba54241ad7588a40b0d67ab1e4d8"}},{"ruleId":"D2","level":"warning","message":{"text":"MetaItem::from_tokens (cognitive 17): MetaItem::from_tokens has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 1 (2 pts), match/switch 2 (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":"compiler/rustc_ast/src/attr/mod.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f6fbd60f52aa9ce2d0bf159092f368be09e4b1e643baf322c83837515be0507"}},{"ruleId":"D2","level":"warning","message":{"text":"LoweringContext::lower_ty (cognitive 17): LoweringContext::lower_ty has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (9 pts), match/switch 4 (8 pts) (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ast_lowering/src/lib.rs"},"region":{"startLine":1534}}}],"partialFingerprints":{"codehealthFindingId/v1":"53e1c54bda50b0e67a28ad0046b613684e9149477188c32b95508cdca6998d62"}},{"ruleId":"D2","level":"warning","message":{"text":"LoweringContext::lower_fn_decl (cognitive 17): LoweringContext::lower_fn_decl has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 6 (10 pts), if/else 5 (6 pts), boolean chains 1 (nesting depth added 5). 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":"compiler/rustc_ast_lowering/src/lib.rs"},"region":{"startLine":1935}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1292ca51c45f093bb2aba021626a38f23d5942ef5ece50b072bbf1008aa0798"}},{"ruleId":"D2","level":"warning","message":{"text":"NakedParser::finalize (cognitive 17): NakedParser::finalize has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 2 (3 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":"compiler/rustc_attr_parsing/src/attributes/codegen_attrs.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"138611df45930dc6774b4d1b1f9f864a90f1ab6991add0006da2f69c569bbf09"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_attr_parsing::validate_attr::emit_malformed_attribute (cognitive 17): rustc_attr_parsing::validate_attr::emit_malformed_attribute has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (13 pts), loops 2 (4 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_attr_parsing/src/validate_attr.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"92093e1db35cca85ccc8af9fba48f67a0629bea63a824ec06371ab1f6f51993f"}},{"ruleId":"D2","level":"warning","message":{"text":"MirBorrowckCtxt::move_spans (cognitive 17): MirBorrowckCtxt::move_spans has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (13 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/diagnostics/mod.rs"},"region":{"startLine":1011}}}],"partialFingerprints":{"codehealthFindingId/v1":"d54fe031c3aa518ff36a7bc61f0f808bbb3e349db17be61576f31a2c8c9cf0f8"}},{"ruleId":"D2","level":"warning","message":{"text":"MirBorrowckCtxt::borrow_spans (cognitive 17): MirBorrowckCtxt::borrow_spans has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (13 pts), match/switch 1 (3 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/diagnostics/mod.rs"},"region":{"startLine":1120}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8439bc1ec6a7f36e91afa677a9655e88087e2a1af6f7ad27ebfd532fb90d1a7"}},{"ruleId":"D2","level":"warning","message":{"text":"MirBorrowckCtxt::suggest_deref_closure_return (cognitive 17): MirBorrowckCtxt::suggest_deref_closure_return has cognitive complexity 17 (threshold 15). Drivers by points: if/else 14, boolean chains 2, loops 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/diagnostics/region_errors.rs"},"region":{"startLine":1390}}}],"partialFingerprints":{"codehealthFindingId/v1":"2119ee935bc32ca96a7452e421aa8e122fd1f66ba7b8a07aa40dea1f9cd1261c"}},{"ruleId":"D2","level":"warning","message":{"text":"MirBorrowckCtxt::give_name_if_we_can_match_upvar_args (cognitive 17): MirBorrowckCtxt::give_name_if_we_can_match_upvar_args has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (12 pts), match/switch 2 (4 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/diagnostics/region_name.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"dffd4c8553021fdd8ea8c690a9cc6093a5de5a7854bfbed927cfd8bcf5612bde"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_borrowck::places_conflict::place_components_conflict (cognitive 17): rustc_borrowck::places_conflict::place_components_conflict has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (7 pts), match/switch 2 (5 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/places_conflict.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"c095bdbc8ceaebbd0c05dc62c4e02b60c46f0484992564146346891709961e5e"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_borrowck::region_infer::opaque_types::compute_definition_site_hidden_types_from_defining_uses (cognitive 17): rustc_borrowck::region_infer::opaque_types::compute_definition_site_hidden_types_from_defining_uses has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (12 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/region_infer/opaque_types/mod.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"899786aab2dbd437c1410016434bba5e147c9205f8c21896d2b21657dd42f89d"}},{"ruleId":"D2","level":"warning","message":{"text":"Context::manage_cond_expr (cognitive 17): Context::manage_cond_expr has cognitive complexity 17 (threshold 15). Drivers by points: loops 5 (10 pts), if/else 3 (6 pts), match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_builtin_macros/src/assert/context.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a2d8a7e9fcd7a9a823d3fb45b81a0883d10ff9e2c36cb7d0d50a410ed75bb74"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_builtin_macros::deriving::reborrow::coerce_shared_target (cognitive 17): rustc_builtin_macros::deriving::reborrow::coerce_shared_target has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (12 pts), loops 2 (3 pts), boolean chains 1, match/switch 1 (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":"compiler/rustc_builtin_macros/src/deriving/reborrow.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"a01755bfce06f95e256082f95f5a3226ad3281fb82fa1297f3dc0033a3376663"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_builtin_macros::env::expand_env (cognitive 17): rustc_builtin_macros::env::expand_env has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (9 pts), match/switch 5 (6 pts), boolean chains 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"compiler/rustc_builtin_macros/src/env.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"427c42815ab6cf84e40d271b587e8decd9f4db8f95249925335ee85b92dcd8c8"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionCx::lib_call (cognitive 17): FunctionCx::lib_call has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 9, if/else 7 (8 pts) (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/src/abi/mod.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe2107411d3d7af073adca512d8dfa6691d82ff719472c133128a519e78b0789"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_codegen_gcc::intrinsic::old_archs::old_archs (cognitive 17): rustc_codegen_gcc::intrinsic::old_archs::old_archs has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 9 (17 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":"compiler/rustc_codegen_gcc/src/intrinsic/old_archs.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"42ddf74a081da76b98daecc4d25497146f4d1820ebe7ec396ac849eba05075cd"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_codegen_llvm::va_arg::emit_x86_64_sysv64_va_arg (cognitive 17): rustc_codegen_llvm::va_arg::emit_x86_64_sysv64_va_arg has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 6 (10 pts), if/else 6 (7 pts) (nesting depth added 5). 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":"compiler/rustc_codegen_llvm/src/va_arg.rs"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"83d847df1ff8bcc0092e004d184f2e3e8085e48844f0715af9a4b0700730f810"}},{"ruleId":"D2","level":"warning","message":{"text":"AssertModuleSource::check_attrs (cognitive 17): AssertModuleSource::check_attrs has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 2 (5 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/assert_module_sources.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"b265a6de35d37ed3e12697a48e083d3fd210360fb2b2c60cc15ff48f4c4e1c24"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_codegen_ssa::back::link::linker_and_flavor (cognitive 17): rustc_codegen_ssa::back::link::linker_and_flavor has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (13 pts), match/switch 3 (4 pts) (nesting depth added 5). Most of this is not in the body itself: 3 of the 17 points are its own statements and the rest belongs to 2 function items inside it that branch (infer_from, adjust_flavor_to_features). 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":"compiler/rustc_codegen_ssa/src/back/link.rs"},"region":{"startLine":1878}}}],"partialFingerprints":{"codehealthFindingId/v1":"db054d2aaaef66e145639255529242a8cbdad281459d34060dc6bb36c6a412f6"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_codegen_ssa::back::symbol_edit::coff_edit_impl (cognitive 17): rustc_codegen_ssa::back::symbol_edit::coff_edit_impl has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 3, boolean chains 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/back/symbol_edit.rs"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b5b606b96149a4afd3472025cdac77de8af0f44ddec6b6fad5818f07c923c8e"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_codegen_ssa::back::symbol_export::reachable_non_generics_helper (cognitive 17): rustc_codegen_ssa::back::symbol_export::reachable_non_generics_helper has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (13 pts), boolean chains 3, match/switch 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/back/symbol_export.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaa3212b098957b32e7ab520a23f2f7e18649e750c1cd3a7978b1e86712833e1"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_errors::annotate_snippet_emitter_writer::collect_annotations (cognitive 17): rustc_errors::annotate_snippet_emitter_writer::collect_annotations has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 3, match/switch 1 (2 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":"compiler/rustc_errors/src/annotate_snippet_emitter_writer.rs"},"region":{"startLine":685}}}],"partialFingerprints":{"codehealthFindingId/v1":"92cfa7f6162c6d63c65e76e316e872c0d36932d1eb7cc063e15ba2567b8f821e"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_expand::expand::parse_ast_fragment (cognitive 17): rustc_expand::expand::parse_ast_fragment has cognitive complexity 17 (threshold 15). Drivers by points: loops 6 (12 pts), if/else 2 (3 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":"compiler/rustc_expand/src/expand.rs"},"region":{"startLine":1077}}}],"partialFingerprints":{"codehealthFindingId/v1":"64bac982fec31e92eaa62a4b64e7e4e88db08a9f7a93378e2fb1205f3f86e8fc"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_hir_analysis::check::compare_impl_item::compare_synthetic_generics (cognitive 17): rustc_hir_analysis::check::compare_impl_item::compare_synthetic_generics has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 2, boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/check/compare_impl_item.rs"},"region":{"startLine":1959}}}],"partialFingerprints":{"codehealthFindingId/v1":"a91a02987e4fd12a0455d43de340d94ef376a5eb75428327b1e1c2870435f20d"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_hir_analysis::collect::clauses_of::implied_clauses_with_filter (cognitive 17): rustc_hir_analysis::collect::clauses_of::implied_clauses_with_filter has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 2 (4 pts), match/switch 3, boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/collect/clauses_of.rs"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5469ef5985a61829ef840597cde2390e7ed7c16a5aa4141187c733a36b7c148"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_hir_analysis::collect::type_of::opaque::find_opaque_ty_constraints_for_rpit (cognitive 17): rustc_hir_analysis::collect::type_of::opaque::find_opaque_ty_constraints_for_rpit has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/collect/type_of/opaque.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca05f63099f641f97d41a1245fccacfa874a9c39385a9c976d51b4b3a508086e"}},{"ruleId":"D2","level":"warning","message":{"text":"State::print_type (cognitive 17): State::print_type has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 2 (3 pts), loops 1 (2 pts) (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":"compiler/rustc_hir_pretty/src/lib.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"138e4a797817ea2b0432a6caf4a94388ba8963e7070afc1fc8ea84d690550c6c"}},{"ruleId":"D2","level":"warning","message":{"text":"Coerce::coerce_unsized_old_solver (cognitive 17): Coerce::coerce_unsized_old_solver has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 3 (8 pts), if/else 3 (7 pts), boolean chains 1, loops 1 (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":"compiler/rustc_hir_typeck/src/coercion.rs"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"4af27c7ab73fd90a8fd6d2ff58d304818ec9d90895752e81fc32f069de80bcfa"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::check_expr_match (cognitive 17): FnCtxt::check_expr_match has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 2 (3 pts), loops 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":"compiler/rustc_hir_typeck/src/_match.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0f3d725233272b1e0c441c8238fffc4b721aa66febe16e60d2fd57579d095fb"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::check_argument_types_maybe_method_like (cognitive 17): FnCtxt::check_argument_types_maybe_method_like has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/callee.rs"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3340576d053eefd436c3952b5ef0bb0ff6c0e7fe054187e481740f068d2f69d"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::suggest_returning_value_after_loop (cognitive 17): FnCtxt::suggest_returning_value_after_loop has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (11 pts), match/switch 3 (5 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/fn_ctxt/suggestions.rs"},"region":{"startLine":2456}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0bcdbaf82e0fd3bd252a5328a0a2fededca9939510c2b5803d57117bdc849ed"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::can_use_as_ref_or_mut (cognitive 17): FnCtxt::can_use_as_ref_or_mut has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 4, match/switch 2 (3 pts), loops 1 (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":"compiler/rustc_hir_typeck/src/fn_ctxt/suggestions.rs"},"region":{"startLine":2880}}}],"partialFingerprints":{"codehealthFindingId/v1":"c020f46f88982f7eab3eef29d681bd1f2979b68b18b05a75466890803eb68baf"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::lint_edition_dependent_dot_call (cognitive 17): FnCtxt::lint_edition_dependent_dot_call has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 5, match/switch 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/method/prelude_edition_lints.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e320ddc415c8f8bc2dffb3fbbb1fcd23494627656893ab9c898a94b45eb9a93"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::suggest_enum_variant_for_method_call (cognitive 17): FnCtxt::suggest_enum_variant_for_method_call has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 3 (10 pts), if/else 3 (4 pts), boolean chains 3 (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":"compiler/rustc_hir_typeck/src/method/suggest.rs"},"region":{"startLine":1568}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c7f159cf73d7c00a92e91ca89224516052af13d351e19f68f681999ad312076"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::note_predicate_source_and_get_derives (cognitive 17): FnCtxt::note_predicate_source_and_get_derives has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (3 pts), match/switch 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/method/suggest.rs"},"region":{"startLine":3634}}}],"partialFingerprints":{"codehealthFindingId/v1":"21f36cec69102413ea56baadcb4e5b210f0bf29fea4f38d34917e064f16f0959"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::compute_2229_migrations (cognitive 17): FnCtxt::compute_2229_migrations has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 3 (5 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":"compiler/rustc_hir_typeck/src/upvar.rs"},"region":{"startLine":1549}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab6beb89b579cc1adec40a34f64270e25615b613adba4a6f71341cadee4f0d08"}},{"ruleId":"D2","level":"warning","message":{"text":"Resolver::add_typo_suggestion (cognitive 17): Resolver::add_typo_suggestion has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (12 pts), match/switch 3 (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":"compiler/rustc_resolve/src/diagnostics/impls.rs"},"region":{"startLine":2333}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c12e6e139bb198c92e4e80a60321ced79d901cde03e06b643461cc04fbb0587"}},{"ruleId":"D2","level":"warning","message":{"text":"LexicalResolver::collect_bounding_regions (cognitive 17): LexicalResolver::collect_bounding_regions has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2, match/switch 1 (2 pts) (nesting depth added 8). Most of this is not in the body itself: 7 of the 17 points are its own statements and the rest belongs to one function item inside it that branches (process_edges). 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":"compiler/rustc_infer/src/infer/lexical_region_resolve/mod.rs"},"region":{"startLine":812}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a3e1d2f8bdcdcb1e8e5c5c8c800f84d3974f14778485723c26f6cee15ab51c0"}},{"ruleId":"D2","level":"warning","message":{"text":"InferenceFudger::fold_ty (cognitive 17): InferenceFudger::fold_ty has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (15 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":"compiler/rustc_infer/src/infer/snapshot/fudge.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"25e239cf0add366e2edbfe008ca74ce49a62fdf91f2a07b92b243bc84c305bd1"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_interface::interface::parse_cfg (cognitive 17): rustc_interface::interface::parse_cfg has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), match/switch 3 (6 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_interface/src/interface.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c3a7a2af0f5ec4a5f42e20eadd7324422c7b834a648e3df17dd192cc0b5aa96"}},{"ruleId":"D2","level":"warning","message":{"text":"NonLocalDefinitionsDiag::into_diag (cognitive 17): NonLocalDefinitionsDiag::into_diag has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_lint/src/diagnostics.rs"},"region":{"startLine":1886}}}],"partialFingerprints":{"codehealthFindingId/v1":"705266b2e3fced9e2c2d567e200e63cd8ab8e84d72f48e6f89e8d9aa284d3af3"}},{"ruleId":"D2","level":"warning","message":{"text":"LintLevelsBuilder::add_command_line (cognitive 17): LintLevelsBuilder::add_command_line has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 2 (3 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_lint/src/levels.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd1b30e4020d94bb11538c8ff9e0f593c1fb09103699cda24b4a38342324f281"}},{"ruleId":"D2","level":"warning","message":{"text":"ShadowedIntoIter::check_expr (cognitive 17): ShadowedIntoIter::check_expr has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13, boolean chains 4. Of this number, 13 points are the body\u0027s own statements and 4 belong to 2 function items inside it that branch. 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":"compiler/rustc_lint/src/shadowed_into_iter.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d92e04640936bf31da0a1019045409ce0be5503e32af3c6510087b949501324"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_lint::types::literal::report_bin_hex_error (cognitive 17): rustc_lint::types::literal::report_bin_hex_error has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13 (14 pts), boolean chains 2, match/switch 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_lint/src/types/literal.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"5acc6d011c50cb0f051dbb66e3c0b5808583a4ad36b2046ea2bdf51e0b7d11f8"}},{"ruleId":"D2","level":"warning","message":{"text":"TableBuilder::encode (cognitive 17): TableBuilder::encode has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_metadata/src/rmeta/table.rs"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"19e62906f889eded2041c744a15ec08c17cebeeb86a0b6cf28e2aa4b6b1a3842"}},{"ruleId":"D2","level":"warning","message":{"text":"InitMaskMaterialized::set_range_inbounds (cognitive 17): InitMaskMaterialized::set_range_inbounds has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 2 (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":"compiler/rustc_middle/src/mir/interpret/allocation/init_mask.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"88ddeb14d94554cb60d8d247108f15fd11af3aaa7b9dd6914ee006c59eaed66a"}},{"ruleId":"D2","level":"warning","message":{"text":"Builder::static_pattern_match_inner (cognitive 17): Builder::static_pattern_match_inner has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 pts), match/switch 6 (8 pts) (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":"compiler/rustc_mir_build/src/builder/matches/mod.rs"},"region":{"startLine":2921}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b786a3db428d071f32dc7babe7f6f511f94aaeb76dd03e986b7cb8ddc079666"}},{"ruleId":"D2","level":"warning","message":{"text":"OpportunitySet::apply_once (cognitive 17): OpportunitySet::apply_once has cognitive complexity 17 (threshold 15). Drivers by points: loops 4 (12 pts), if/else 1 (3 pts), match/switch 1 (2 pts) (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/jump_threading.rs"},"region":{"startLine":987}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf0b2ffb0b20975529ccdd3067f00bd8e385eb6bfeed6fb99923aebe8c91cefc"}},{"ruleId":"D2","level":"warning","message":{"text":"Lint::visit_terminator (cognitive 17): Lint::visit_terminator has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 2 (5 pts), match/switch 1 (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/lint.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c209e9938611a659cd73ba926304e994c42582fa7aa48095c576f5041b8513b"}},{"ruleId":"D2","level":"warning","message":{"text":"LintAndRemoveUninhabited::run_pass (cognitive 17): LintAndRemoveUninhabited::run_pass has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 2, loops 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/lint_and_remove_uninhabited.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"367fc6705e6b9f750850959993352eb7f91cc95b354fae3433619e1edb953cfb"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_mir_transform::coverage::spans::extract_refined_covspans (cognitive 17): rustc_mir_transform::coverage::spans::extract_refined_covspans has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (14 pts), loops 2, boolean chains 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/coverage/spans.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"53da5125753d9937bf21838a79d49f01122a61f7da0f497490d8ac5648c38167"}},{"ruleId":"D2","level":"warning","message":{"text":"RootCollector::process_nested_body (cognitive 17): RootCollector::process_nested_body has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (8 pts), match/switch 3 (6 pts), boolean chains 3 (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":"compiler/rustc_monomorphize/src/collector.rs"},"region":{"startLine":1692}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e0c20e0fe2efcf8260bc5b464b3663ba61389ec606e89e1de343a01eb7df63b"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_next_trait_solver::solve::eval_ctxt::fast_path::inlined_rerunning_stalled_goal_may_make_progress (cognitive 17): rustc_next_trait_solver::solve::eval_ctxt::fast_path::inlined_rerunning_stalled_goal_may_make_progress has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 2 (5 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_next_trait_solver/src/solve/eval_ctxt/fast_path.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aff96348a997b706f70c45665f8e73a2d71bdd513d01351d60f459f0d736bb6"}},{"ruleId":"D2","level":"warning","message":{"text":"Lexer::lex_token_trees (cognitive 17): Lexer::lex_token_trees has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (13 pts), match/switch 1 (3 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/lexer/tokentrees.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"35b059b577c3ce6977e46173cce837ee2527c741f2b1a891870b12e48da03a5d"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_parse::parser::asm::parse_options (cognitive 17): rustc_parse::parser::asm::parse_options has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/asm.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"29f3b9f6b6f7ae60d47978b25eb2ee4d526b7710b5f43d9b1050879344ed2724"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_parse::parser::generics::suggest_replacing_equality_pred_with_assoc_item_constraint (cognitive 17): rustc_parse::parser::generics::suggest_replacing_equality_pred_with_assoc_item_constraint has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (12 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/generics.rs"},"region":{"startLine":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c21119c367cf5d7e562cc3186fde6a7b042fa3afc41fad0a6b13cd6abd79223"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::break_up_float (cognitive 17): Parser::break_up_float has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 1, loops 1, 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":"compiler/rustc_parse/src/parser/expr.rs"},"region":{"startLine":844}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b8feaa8182687ec00fd15d295c00bed6ef577a0477848135f6d8c4b1810ae10"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::check_trait_front_matter (cognitive 17): Parser::check_trait_front_matter has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (12 pts), match/switch 1 (3 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":"compiler/rustc_parse/src/parser/item.rs"},"region":{"startLine":1102}}}],"partialFingerprints":{"codehealthFindingId/v1":"83c90a123590b3abe054cd747f7253c23810221fe78e94fe1acf31a337c9ca2e"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_generic_arg (cognitive 17): Parser::parse_generic_arg has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (10 pts), match/switch 2 (4 pts), boolean chains 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/path.rs"},"region":{"startLine":971}}}],"partialFingerprints":{"codehealthFindingId/v1":"32d4d9b0bd2d2436ce6145d330c7ba51504132454190b680ec0276cd73c73917"}},{"ruleId":"D2","level":"warning","message":{"text":"CheckAttrVisitor::check_repr (cognitive 17): CheckAttrVisitor::check_repr has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 7, if/else 6 (7 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 2). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_passes/src/check_attr.rs"},"region":{"startLine":966}}}],"partialFingerprints":{"codehealthFindingId/v1":"657d1bffe55d2b7b32b73ab9ad0056222ddccdd9d877248db3dd61bd1d02c81d"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_passes::dead::maybe_record_as_seed (cognitive 17): rustc_passes::dead::maybe_record_as_seed has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 pts), match/switch 2 (4 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_passes/src/dead.rs"},"region":{"startLine":1016}}}],"partialFingerprints":{"codehealthFindingId/v1":"044003b41857e5447ee433e4f8a7478f6b24e208b02303acc3518b5607512fc4"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_passes::stability::lookup_stability (cognitive 17): rustc_passes::stability::lookup_stability has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_passes/src/stability.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"f72affdf083bf673b4af3e4b9aac08af6947400646647e537d0c8b89ede1a300"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_query_impl::handle_cycle_error::create_cycle_error (cognitive 17): rustc_query_impl::handle_cycle_error::create_cycle_error has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13 (15 pts), loops 1, match/switch 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"compiler/rustc_query_impl/src/handle_cycle_error.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7957b8805b2c50a37b2c6c3f018bf409e22d17f90cd60e94a1bb6e34829e018"}},{"ruleId":"D2","level":"warning","message":{"text":"LateResolutionVisitor::call_has_self_arg (cognitive 17): LateResolutionVisitor::call_has_self_arg has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (11 pts), match/switch 1 (3 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/late/diagnostics.rs"},"region":{"startLine":2378}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bcc848554cc45d5bd887737b1e1680e43a88a20a5697db3994cca30fecb5ac3"}},{"ruleId":"D2","level":"warning","message":{"text":"LateResolutionVisitor::check_for_lang (cognitive 17): LateResolutionVisitor::check_for_lang has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (12 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/late/lang_items.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"235eadcef9ba8c54f0209f6c1d861f25fa50d57a2ba529af8e9b1827af54a6a1"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_session::options::parse::parse_offload (cognitive 17): rustc_session::options::parse::parse_offload has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 2 (4 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_session/src/options.rs"},"region":{"startLine":1545}}}],"partialFingerprints":{"codehealthFindingId/v1":"033c0df62e4940e2a2150c85a85d9c29f84e60813730904b90ac69a79852d87c"}},{"ruleId":"D2","level":"warning","message":{"text":"SpanData::encode (cognitive 17): SpanData::encode has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (14 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_metadata/src/rmeta/encoder.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d6c6e3d0f716bc9d14629ce578e3214c0852ddc1a2c8e5801a2459ba704b5df"}},{"ruleId":"D2","level":"warning","message":{"text":"SourceFile::encode (cognitive 17): SourceFile::encode has cognitive complexity 17 (threshold 15). Drivers by points: loops 3 (9 pts), if/else 3 (4 pts), match/switch 2 (4 pts) (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_span/src/lib.rs"},"region":{"startLine":2037}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4c1efb5d3ff330c7fd3dc1b1ae5ba2135fda199691a05611b8e4e7b30d03060"}},{"ruleId":"D2","level":"warning","message":{"text":"FnAbi::gcc_type (cognitive 17): FnAbi::gcc_type has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (11 pts), match/switch 2 (3 pts), boolean chains 2, loops 1 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_gcc/src/abi.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3629bbe94aeb79409d70e6c0d2aa2b93704d6346443fb2e77cd4ad0d47dc930"}},{"ruleId":"D2","level":"warning","message":{"text":"FnAbi::llvm_type (cognitive 17): FnAbi::llvm_type has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (13 pts), match/switch 2 (3 pts), loops 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/abi.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fc71cc28fe49e59bb0e629ac3f4da6a76526b954a532f9629831ebdaf8d7f93"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_target::asm::amdgpu::fill_reg_map (cognitive 17): rustc_target::asm::amdgpu::fill_reg_map has cognitive complexity 17 (threshold 15). Drivers by points: loops 3 (9 pts), if/else 4 (8 pts) (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_target/src/asm/amdgpu.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3cce02d4cc8ab329133cc845ec9685b4834488fceeaa7bc90b046811ffc6e59"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_target::callconv::x86::classify_arg (cognitive 17): rustc_target::callconv::x86::classify_arg has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 1 (3 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 7). Most of this is not in the body itself: 8 of the 17 points are its own statements and the rest belongs to one function item inside it that branches (contains_vector). 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":"compiler/rustc_target/src/callconv/x86.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"11f14694d91251e71cbdd0408f3db27f5f7292b7e6f0668a7f3730ff52073203"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeErrCtxt::expected_projection (cognitive 17): TypeErrCtxt::expected_projection has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"compiler/rustc_trait_selection/src/error_reporting/infer/note_and_explain.rs"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"46f1f4d759c8df14a226497a0ccfe0880e7a5d89373c77d560c902ee7be239b5"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_trait_selection::traits::project::project (cognitive 17): rustc_trait_selection::traits::project::project has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 1, match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/traits/project.rs"},"region":{"startLine":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"f695d4d3c371b17913734e5e065e2f6dc4085173b4d90ee8a47f5a6044616f7d"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_trait_selection::traits::project::assemble_candidates_from_clauses (cognitive 17): rustc_trait_selection::traits::project::assemble_candidates_from_clauses has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (12 pts), match/switch 1 (3 pts), boolean chains 1, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/traits/project.rs"},"region":{"startLine":921}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa367661823acfdc061789fc499a4353a726c76ca2900e432abe244f5b069aa4"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_trait_selection::traits::util::implicit_fast_path (cognitive 17): rustc_trait_selection::traits::util::implicit_fast_path has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), boolean chains 3, loops 1 (3 pts), match/switch 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/traits/util.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e1484786ec583db668672d8f3d29d5a24885a8c7c5b9f335ffbde2afbd7bba7"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_ty_utils::consts::recurse_build (cognitive 17): rustc_ty_utils::consts::recurse_build has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), match/switch 3 (5 pts), loops 1 (2 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":"compiler/rustc_ty_utils/src/consts.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"205707151a515deffabd2c00820edb87211de219e29c6580d5e57ece583e6fee"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_ty_utils::implied_bounds::assumed_wf_types (cognitive 17): rustc_ty_utils::implied_bounds::assumed_wf_types has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 1 (3 pts), match/switch 2 (3 pts) (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ty_utils/src/implied_bounds.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e92919e5b82e8f4edc358bcc73ab4cb9f97ee38531ecbc5ccaa6b89f42a3bb8"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_type_ir::region_constraint::pull_region_outlives_constraints_out_of_universe (cognitive 17): rustc_type_ir::region_constraint::pull_region_outlives_constraints_out_of_universe has cognitive complexity 17 (threshold 15). Drivers by points: loops 3 (8 pts), if/else 2 (6 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_type_ir/src/region_constraint.rs"},"region":{"startLine":794}}}],"partialFingerprints":{"codehealthFindingId/v1":"73e272aad2c6722775cc054f626fc24dd9913fe527c2ea29147811f8eb03c0fa"}},{"ruleId":"D2","level":"warning","message":{"text":"libm::math::arch::x86::detect::load_x86_features (cognitive 17): libm::math::arch::x86::detect::load_x86_features has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (16 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":"library/compiler-builtins/libm/src/math/arch/x86/detect.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"6286028167d757857c3e728f16c0b013f6910776ca786f9cad4d9de9f9467641"}},{"ruleId":"D2","level":"warning","message":{"text":"libm::math::hypot::cr_hypot (cognitive 17): libm::math::hypot::cr_hypot has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/compiler-builtins/libm/src/math/hypot.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"41a58886f730685a56a15264ab2dadf75fdafcf770e28abd3877915438c39d1a"}},{"ruleId":"D2","level":"warning","message":{"text":"core::num::imp::flt2dec::digits_to_dec_str (cognitive 17): core::num::imp::flt2dec::digits_to_dec_str has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (16 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":"library/core/src/num/imp/flt2dec/mod.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"29a64d4800dfc82e6059356e27c6b678e13c0389d985fe85909d02884f235002"}},{"ruleId":"D2","level":"warning","message":{"text":"core::num::imp::flt2dec::strategy::dragon::format_shortest (cognitive 17): core::num::imp::flt2dec::strategy::dragon::format_shortest has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 3, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/num/imp/flt2dec/strategy/dragon.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"4025de57aebb3ffe7829265a12ecca7ad84dc405877eff9f0a9f40d87fa37ff1"}},{"ruleId":"D2","level":"warning","message":{"text":"core::num::imp::flt2dec::strategy::grisu::format_shortest_opt (cognitive 17): core::num::imp::flt2dec::strategy::grisu::format_shortest_opt has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 5, loops 3 (nesting depth added 3). Most of this is not in the body itself: 8 of the 17 points are its own statements and the rest belongs to one function item inside it that branches (round_and_weed). 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":"library/core/src/num/imp/flt2dec/strategy/grisu.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"5126acd25f285448d8fc1a657ad058c501d7218f6cf92e3e8a2def85745fddfb"}},{"ruleId":"D2","level":"warning","message":{"text":"core::slice::sort::unstable::quicksort::partition_hoare_branchy_cyclic (cognitive 17): core::slice::sort::unstable::quicksort::partition_hoare_branchy_cyclic has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 3 (5 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/slice/sort/unstable/quicksort.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1b75b00dc1d97b86e8e0af125e76c228125b8fdd210d4805526390f30ab0a56"}},{"ruleId":"D2","level":"warning","message":{"text":"Channel::start_send (cognitive 17): Channel::start_send has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 1 (3 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sync/mpmc/array.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca80b7790b0ff874f58feb42f7106ca3d4b5da7935fc77e1fc1888692bdd4f6a"}},{"ruleId":"D2","level":"warning","message":{"text":"Once::call (cognitive 17): Once::call has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (14 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/sync/once/futex.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e94d688cb61398f4f0c7c0ef06d0c5b3e6e4b0680e6ffd76a015e2db478f45f"}},{"ruleId":"D2","level":"warning","message":{"text":"std::sys::process::uefi::cmd_exec (cognitive 17): std::sys::process::uefi::cmd_exec has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9, loops 2 (4 pts), match/switch 2 (4 pts) (nesting depth added 4). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/process/uefi.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d1bf643cd845236bae80a83a7c7a59d4582d810f339fdf13e107b2591c80207"}},{"ruleId":"D2","level":"warning","message":{"text":"std::sys::process::windows::search_paths (cognitive 17): std::sys::process::windows::search_paths has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 2 (4 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":"library/std/src/sys/process/windows.rs"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3e185591462889472d10d7e3c8d8d8f53b580a8d8dd206f325545a16a8fc1a9"}},{"ruleId":"D2","level":"warning","message":{"text":"stdarch_gen_hexagon::hvx::parse_prototype (cognitive 17): stdarch_gen_hexagon::hvx::parse_prototype has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 1 (3 pts) (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/stdarch-gen-hexagon/src/hvx.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"0233c9396b24461f51b99a27ff179274d84fab64f728c283790f50f16c513500"}},{"ruleId":"D2","level":"warning","message":{"text":"stdarch_gen_hexagon::hvx::get_compound_primary_instr (cognitive 17): stdarch_gen_hexagon::hvx::get_compound_primary_instr has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 6, match/switch 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/stdarch-gen-hexagon/src/hvx.rs"},"region":{"startLine":1370}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf8af1497c0a7a9c3a74f81aa40fb88ac73239e793e1e8d3c4855da3f84cbcec"}},{"ruleId":"D2","level":"warning","message":{"text":"Gcc::deserialize (cognitive 17): Gcc::deserialize has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 4 (10 pts), if/else 2 (6 pts), loops 1 (nesting depth added 10). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/config/toml/gcc.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"68e089c26a1b5b68ba43477eb2a9b2233d7a9ef704b3bb69eedfbe0fde14bf04"}},{"ruleId":"D2","level":"warning","message":{"text":"Impl::print_type (cognitive 17): Impl::print_type has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 7 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/format.rs"},"region":{"startLine":1412}}}],"partialFingerprints":{"codehealthFindingId/v1":"76fe97483179c64b49b54997a5f446d6ed0775e3a338f16fbac42af58b172206"}},{"ruleId":"D2","level":"warning","message":{"text":"Context::init (cognitive 17): Context::init has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (13 pts), match/switch 2 (3 pts), loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/render/context.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ad0e4cb48df3d507f858ae7f77a46d6c321e80c9c45e52ee701631a0e825d7a"}},{"ruleId":"D2","level":"warning","message":{"text":"rustdoc::clean::clean_doc_module (cognitive 17): rustdoc::clean::clean_doc_module has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 5, loops 1, match/switch 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/clean/mod.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e457c311ba186d1b36f52b0d3e4942feb3f56b996a3dc708e6c341b29bf3bcd"}},{"ruleId":"D2","level":"warning","message":{"text":"rustdoc::html::highlight::string_without_closing_tag (cognitive 17): rustdoc::html::highlight::string_without_closing_tag has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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/librustdoc/html/highlight.rs"},"region":{"startLine":1463}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4d32d98b5ce94ebef06789a1b8b8ac35bab9e4a0d531312c160c4becef97604"}},{"ruleId":"D2","level":"warning","message":{"text":"SourceItemOrderingModuleItemGroupings::deserialize (cognitive 17): SourceItemOrderingModuleItemGroupings::deserialize has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 2, loops 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_config/src/types.rs"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"6434f390f59e601bd3933369b74a70e7c895d74ec760655183ea1e57b594c57b"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_dev::deprecate_lint::remove_lint_declaration (cognitive 17): clippy_dev::deprecate_lint::remove_lint_declaration has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 6). Most of this is not in the body itself: 8 of the 17 points are its own statements and the rest belongs to 2 function items inside it that branch (remove_impl_lint_pass, remove_test_assets). 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/tools/clippy/clippy_dev/src/deprecate_lint.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"edb24ff1129026ea80fa56e833e15842fa69e5cfd7dbf80d777c5641f087312e"}},{"ruleId":"D2","level":"warning","message":{"text":"PatState::add_struct_pats (cognitive 17): PatState::add_struct_pats has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 3, match/switch 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/matches/single_match.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"056216fe664fc40e7d1647becf159b4a265f8c1dfc5aa113786155dc610571b3"}},{"ruleId":"D2","level":"warning","message":{"text":"MinIdentChars::check_impl_item (cognitive 17): MinIdentChars::check_impl_item has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 5, loops 1 (2 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/tools/clippy/clippy_lints/src/min_ident_chars.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"c35afcf24dd31b7573985ed396922b33e054c2a71feeac829a266751f27e9bbb"}},{"ruleId":"D2","level":"warning","message":{"text":"SimilarNamesNameVisitor::equal_length_strs_not_similar (cognitive 17): SimilarNamesNameVisitor::equal_length_strs_not_similar has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 4 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/non_expressive_names.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ccf2b6bee0bf9574d1db10ba0c6dad372ffe728b9f57c4cbdee453e71713682"}},{"ruleId":"D2","level":"warning","message":{"text":"PrintVisitor::expr (cognitive 17): PrintVisitor::expr has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 6 (12 pts), if/else 4 (5 pts) (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/tools/clippy/clippy_lints/src/utils/author.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d33b88ea238b6848053779027e70f3ca8732e1a2457bf72c0660b5a69bf6a4e"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::doc::check_attrs (cognitive 17): clippy_lints::doc::check_attrs has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 3, loops 2, match/switch 1 (2 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/doc/mod.rs"},"region":{"startLine":874}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aad6a951ee5a75c4839d4af67203d3fe9e64ff99418b961599c83da8df21671"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::infinite_iter::is_infinite (cognitive 17): clippy_lints::infinite_iter::is_infinite has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (8 pts), match/switch 2 (5 pts), boolean chains 2, loops 1 (2 pts) (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/tools/clippy/clippy_lints/src/infinite_iter.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"4276c3f0da87691317c591f204574ca54a2d8e7569c8f4fcb84a41e8f4e452d2"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::loops::manual_flatten::check (cognitive 17): clippy_lints::loops::manual_flatten::check has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (9 pts), match/switch 2 (5 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/loops/manual_flatten.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fff3eac3f5db914b04890246d1867d5a0c573e2053f454e51896337a46eb55b"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::methods::filter_map::check (cognitive 17): clippy_lints::methods::filter_map::check has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (12 pts), match/switch 2 (5 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/methods/filter_map.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"da0c9bcbb9a88e918f3864b184228ca66123fe294f5564f947d801f71a8fb8ba"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::methods::manual_contains::try_get_eligible_arg (cognitive 17): clippy_lints::methods::manual_contains::try_get_eligible_arg has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 1, 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":"src/tools/clippy/clippy_lints/src/methods/manual_contains.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dd43969eeb0066cb2ec74e53100539b0d530301ea76e874ed6978176675b095"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::no_effect::check_unnecessary_operation (cognitive 17): clippy_lints::no_effect::check_unnecessary_operation has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 1 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/no_effect.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"c04c71ce68ed902e6527122a1ff2f2d574f98be347206499d36b34b23748d93b"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::reference::is_manually_drop_through_union (cognitive 17): clippy_lints::reference::is_manually_drop_through_union has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 1 (2 pts) (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/reference.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"62522caa0bdfc57dec23a9b671e959e7c1a14e2eb1e667c2cf4f1f5ecaab1ef9"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_utils::maybe_get_relative_path (cognitive 17): clippy_utils::maybe_get_relative_path has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 2 (3 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_utils/src/lib.rs"},"region":{"startLine":3322}}}],"partialFingerprints":{"codehealthFindingId/v1":"23eb080c9e8223f3be96b449dcdc9021558b80dd80cbd6410718785eb1cb0cf3"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_utils::ast_utils::eq_item_kind (cognitive 17): clippy_utils::ast_utils::eq_item_kind has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 14, match/switch 2 (3 pts) (nesting depth added 1). 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/tools/clippy/clippy_utils/src/ast_utils/mod.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"96f04e1e064697c62c85fc6e5b9b6ea6b8f60336bb4598a3edcfd7ec8f6b0b7b"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_utils::qualify_min_const_fn::check_ty (cognitive 17): clippy_utils::qualify_min_const_fn::check_ty has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 3 (8 pts), if/else 1 (5 pts), loops 2 (4 pts) (nesting depth added 11). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_utils/src/qualify_min_const_fn.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"2320e46c8a6b9ff45a725c4eb5288ea7adc7c39ef3107b2df9d65c99aac01b13"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_utils::visitors::for_each_unconsumed_temporary::helper (cognitive 17): clippy_utils::visitors::for_each_unconsumed_temporary::helper has cognitive complexity 17 (threshold 15). Drivers by points: loops 4 (8 pts), if/else 3 (5 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 7). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_utils/src/visitors.rs"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea9396afc3755eb54d1a01b24b2cf0b7642da71f298fda838452fb2b1d0ad979"}},{"ruleId":"D2","level":"warning","message":{"text":"TestCx::run_pretty_test (cognitive 17): TestCx::run_pretty_test has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (12 pts), match/switch 3 (4 pts), loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/compiletest/src/runtest/pretty.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d9b3eb1237604fd20e38358d76c99ba8a18a883bf46217550a97beacd2a4896"}},{"ruleId":"D2","level":"warning","message":{"text":"jsondoclint::main (cognitive 17): jsondoclint::main has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (8 pts), match/switch 2 (7 pts), loops 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/jsondoclint/src/main.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b6bfbf7a774f1b067ada676710bebad6810d6646dfd70805699f407dc357aee"}},{"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":"src/tools/miri/priroda/src/frontend/dap.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"d982bcc9441787b3eeedadfbe3538fd61bf0a9f676c49ffd82b1ab724f61e20e"}},{"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/tools/miri/src/borrow_tracker/stacked_borrows/mod.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e7cc66d81eb36a5707b33e00f45ea89b0f36ebaa1602cb1e1f5831083213d84"}},{"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/tools/miri/src/borrow_tracker/stacked_borrows/stack.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cf06532240b02c8485f1cab2a4eefae6f685cf3317d7cd9646270163701b64b"}},{"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/tools/miri/src/intrinsics/x86/avx.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"746b82a94a0068e60dc1ce67bf611e7a7a3812782db6a642554d4ba46c1807dc"}},{"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/tools/miri/src/intrinsics/x86/sse2.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f06f7796ac151ecaaa2234574126b08b3c94e73c8e294629d1629a5236597ef"}},{"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/tools/miri/src/shims/unix/fs.rs"},"region":{"startLine":2212}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb10d86966fd6183c2e575983c433597eac0b93381c1f5636258c2cd1892e5d2"}},{"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/tools/miri/src/helpers.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"9199bc27d11711a2cc995921d3578d2162e6f19710b798fecfc0eb2689923de8"}},{"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/tools/miri/src/math.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"efbaa1c2b8dfce260d8ecd3f82be0a286715e38c2eb9f4b48999c03b1afdf93e"}},{"ruleId":"D2","level":"warning","message":{"text":"ExprCollector::collect_stmt (cognitive 17): ExprCollector::collect_stmt has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/expr_store/lower.rs"},"region":{"startLine":2725}}}],"partialFingerprints":{"codehealthFindingId/v1":"807a8c8b8440f1af8fb7a7ed75105981c8f4c0ace9ad5f6daf15f68925452cd3"}},{"ruleId":"D2","level":"warning","message":{"text":"UseTreeLowering::lower_use_tree (cognitive 17): UseTreeLowering::lower_use_tree has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 4 (9 pts), if/else 4 (7 pts), boolean chains 1 (nesting depth added 8). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/item_tree/lower.rs"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b54af27cf67b7fdbaa48060482b70ffa70a0108a67ff704997088adad99d059"}},{"ruleId":"D2","level":"warning","message":{"text":"Scope::process_names (cognitive 17): Scope::process_names has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (8 pts), match/switch 2 (5 pts), loops 2 (4 pts) (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/resolver.rs"},"region":{"startLine":1053}}}],"partialFingerprints":{"codehealthFindingId/v1":"4714bb7b36cf4b74e266e08607ca8a933a5f3dc44fe1f82f472ae3f14e2d4cc8"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionSignature::with_source_map (cognitive 17): FunctionSignature::with_source_map has cognitive complexity 17 (threshold 15). Drivers by points: if/else 15 (16 pts), match/switch 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/signatures.rs"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea153019d0735de7d20d2ea55450e3f3ba02a1aebd3c03485aabb3c6cd097fc5"}},{"ruleId":"D2","level":"warning","message":{"text":"DeclValidator::validate_union_fields (cognitive 17): DeclValidator::validate_union_fields has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ide/src/diagnostics/decl_check.rs"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a840c7b3b0818ff7d80e953e1de9e5464ead6d516f938c1ea0d47495920d8ee"}},{"ruleId":"D2","level":"warning","message":{"text":"CoerceMany::coerce_inner (cognitive 17): CoerceMany::coerce_inner has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (11 pts), match/switch 3 (6 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/infer/coerce.rs"},"region":{"startLine":1280}}}],"partialFingerprints":{"codehealthFindingId/v1":"783d3fa5377ca2ff5ecbca2862cbe25735081a7c67da24787b97792e618e7120"}},{"ruleId":"D2","level":"warning","message":{"text":"InferenceContext::infer_method_call (cognitive 17): InferenceContext::infer_method_call has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 5 (9 pts), if/else 3 (5 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":"src/tools/rust-analyzer/crates/hir-ty/src/infer/expr.rs"},"region":{"startLine":1773}}}],"partialFingerprints":{"codehealthFindingId/v1":"466c2c4145646751cf18b3d4628f197832460320b45ec0b76c841177db28beef"}},{"ruleId":"D2","level":"warning","message":{"text":"InferenceContext::infer_tuple_struct_pat (cognitive 17): InferenceContext::infer_tuple_struct_pat has cognitive complexity 17 (threshold 15). Drivers by points: loops 3 (7 pts), if/else 4 (5 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/infer/pat.rs"},"region":{"startLine":1046}}}],"partialFingerprints":{"codehealthFindingId/v1":"d67ce70f44766ce1b6d6efa1fec73c4907a2a94291392d87d0e3cec5f6b74c5f"}},{"ruleId":"D2","level":"warning","message":{"text":"PathLoweringContext::substs_from_args_and_bindings (cognitive 17): PathLoweringContext::substs_from_args_and_bindings has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), match/switch 4, boolean chains 3 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/lower/path.rs"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"aebfbd671bef31bb650a26eebd455ac6ab9ff356390aed97977ee2fc0fa236e0"}},{"ruleId":"D2","level":"warning","message":{"text":"Evaluator::unsizing_ptr_from_addr (cognitive 17): Evaluator::unsizing_ptr_from_addr has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 5 (11 pts), if/else 2 (6 pts) (nesting depth added 10). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/mir/eval.rs"},"region":{"startLine":1619}}}],"partialFingerprints":{"codehealthFindingId/v1":"9304cbabeb537077fb36ea27db13d40f36ccf646763b501f0ea0e9c5be4b1ca9"}},{"ruleId":"D2","level":"warning","message":{"text":"Generalizer::consts (cognitive 17): Generalizer::consts has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 2 (3 pts), boolean chains 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/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/relate/generalize.rs"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"9399fb86f47489da6e4e8f2d2da6736517fff735e3e282f90174e89d55c2faa8"}},{"ruleId":"D2","level":"warning","message":{"text":"InferenceFudger::fold_ty (cognitive 17): InferenceFudger::fold_ty has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (15 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/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/snapshot/fudge.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d786c50916a76260bd8cb6ea1b061c2b5aacd7c510d5556ef51abdae1270434"}},{"ruleId":"D2","level":"warning","message":{"text":"hir_ty::drop::has_drop_glue_impl (cognitive 17): hir_ty::drop::has_drop_glue_impl has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/drop.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f9139e2a8127ebbe7c147cffc4f71cb84758ba33b90681599191ad73744b24d"}},{"ruleId":"D2","level":"warning","message":{"text":"hir_ty::dyn_compatibility::virtual_call_violations_for_method (cognitive 17): hir_ty::dyn_compatibility::virtual_call_violations_for_method has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 3, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/dyn_compatibility.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"c867b1d11309a50ebe32ddd3e1bed84cd7ee428d9d2d5842887e6b4c53248c98"}},{"ruleId":"D2","level":"warning","message":{"text":"hir_ty::lower::path::check_generic_args_len (cognitive 17): hir_ty::lower::path::check_generic_args_len has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6, match/switch 3 (6 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/lower/path.rs"},"region":{"startLine":1063}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a7ce43792e2a50d703f4fb2fe4e7c062d734ce1fbb3aa915d0b5d83cc08a5ef"}},{"ruleId":"D2","level":"warning","message":{"text":"hir_ty::traits::check_orphan_rules (cognitive 17): hir_ty::traits::check_orphan_rules has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 pts), match/switch 3 (7 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/traits.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"50bb9e9eb0ea6b2b2c9adcab0f4ae0cf148a066d073021243833e5623881b015"}},{"ruleId":"D2","level":"warning","message":{"text":"ide::goto_definition::nav_for_exit_points (cognitive 17): ide::goto_definition::nav_for_exit_points has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 2 (3 pts), boolean chains 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/tools/rust-analyzer/crates/ide/src/goto_definition.rs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a97ff31d23ddda2cfa1b044c4c87ad156074be2b4c8ae359cb1920a42fe6e8a"}},{"ruleId":"D2","level":"warning","message":{"text":"ide::signature_help::signature_help_for_generics (cognitive 17): ide::signature_help::signature_help_for_generics has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 2 (3 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/signature_help.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd0fcbcaa526b98ef67d2c5c6dffa9202759948dc986a23919cb382524b40d83"}},{"ruleId":"D2","level":"warning","message":{"text":"GeneratedFunctionTarget::insert_fn_at (cognitive 17): GeneratedFunctionTarget::insert_fn_at has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 3 (4 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/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_function.rs"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"b15e38e98a75049054228e8b034050ce0f7aa77733def1ffc7707ba80cf8c85e"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_assists::handlers::convert_closure_to_fn::handle_calls (cognitive 17): ide_assists::handlers::convert_closure_to_fn::handle_calls has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (7 pts), loops 2 (5 pts), match/switch 2 (5 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_closure_to_fn.rs"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6f2d9c804eb0f41fca3ceec26b4bfbae2408f1b25d6191a22d71bbca9523c7f"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_assists::handlers::convert_into_to_from::convert_into_to_from (cognitive 17): ide_assists::handlers::convert_into_to_from::convert_into_to_from has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), match/switch 3 (4 pts), boolean chains 3, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_into_to_from.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"46176bda134e3d6d99121f5aa9bbfce7ee66def527b21a6cdf1ae297e4f082c8"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_assists::handlers::convert_let_else_to_match::remove_mut_and_collect_idents (cognitive 17): ide_assists::handlers::convert_let_else_to_match::remove_mut_and_collect_idents has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 1, match/switch 1 (nesting depth added 5). 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/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_let_else_to_match.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"53ef1eb5f89c8e32644e067f5a4abb041cf4e8656472c6efa973f2fd78e6e391"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_assists::handlers::convert_named_struct_to_tuple_struct::edit_field_references (cognitive 17): ide_assists::handlers::convert_named_struct_to_tuple_struct::edit_field_references has cognitive complexity 17 (threshold 15). Drivers by points: if/else 2 (9 pts), loops 3 (6 pts), match/switch 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_named_struct_to_tuple_struct.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"824f2d8bd4eeb9be253eb45434dd4a48a71a1b6bfb76e28af7f3efd319725d42"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_assists::handlers::extract_struct_from_enum_variant::create_struct_def (cognitive 17): ide_assists::handlers::extract_struct_from_enum_variant::create_struct_def has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 2, 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/tools/rust-analyzer/crates/ide-assists/src/handlers/extract_struct_from_enum_variant.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1bc747157022baa70881640b181c91a78347bc6d5792e4ca6f7f19a43195343"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_completion::completions::attribute::derive::complete_derive_path (cognitive 17): ide_completion::completions::attribute::derive::complete_derive_path has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 5 (10 pts), if/else 1 (3 pts), boolean chains 2, 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/tools/rust-analyzer/crates/ide-completion/src/completions/attribute/derive.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e3b35e4298fa77724d1109731e08334c8249f5ca2797dafdca6518c7a8a90b4"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_completion::completions::postfix::format_like::add_format_like_completions (cognitive 17): ide_completion::completions::postfix::format_like::add_format_like_completions has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (4 pts), match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-completion/src/completions/postfix/format_like.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"f52f59a07cb057d6122e00206317ca49a9ebd6ae443351cd0d76fd16ff7eb4d2"}},{"ruleId":"D2","level":"warning","message":{"text":"ScriptSource::parse (cognitive 17): ScriptSource::parse has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (14 pts), loops 1 (2 pts), match/switch 1 (nesting depth added 4). 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/tools/rust-analyzer/crates/parser/src/frontmatter.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"d89f89c8aad6a8ed3b867786a3fe30aa3b9355c73b059cedf1a9646132bb37be"}},{"ruleId":"D2","level":"warning","message":{"text":"LexedStr::to_input (cognitive 17): LexedStr::to_input has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/parser/src/shortcuts.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"f486825dc71f895226aeda743dd2531fff3f9102757c0c172494940fd5447601"}},{"ruleId":"D2","level":"warning","message":{"text":"parser::event::process (cognitive 17): parser::event::process has cognitive complexity 17 (threshold 15). Drivers by points: loops 3 (7 pts), match/switch 2 (6 pts), if/else 1 (4 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/parser/src/event.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"98cd8f51f1d6e54e8701f1745ecaaa10d08f2193d4eb33489cac1dff7eb47588"}},{"ruleId":"D2","level":"warning","message":{"text":"parser::grammar::expressions::record_expr_field_list (cognitive 17): parser::grammar::expressions::record_expr_field_list has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (13 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/parser/src/grammar/expressions.rs"},"region":{"startLine":708}}}],"partialFingerprints":{"codehealthFindingId/v1":"f98739901a69c3abe4f167a462a6cabf3fa28788b2b0501a32a48db7b7ed777c"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkspaceBuildScripts::run_once (cognitive 17): WorkspaceBuildScripts::run_once has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 3 (6 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/tools/rust-analyzer/crates/project-model/src/build_dependencies.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"00e9ff56b5455711036232e0a18d621bf5a02a9020c798c24bc0ea86c21497fc"}},{"ruleId":"D2","level":"warning","message":{"text":"GlobalState::handle_deferred_task (cognitive 17): GlobalState::handle_deferred_task has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 2 (3 pts) (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/main_loop.rs"},"region":{"startLine":1085}}}],"partialFingerprints":{"codehealthFindingId/v1":"69d0a30f9b6d7b899549aab7c74ba6e4ac888d58ec3319f67b7a3f28273ea883"}},{"ruleId":"D2","level":"warning","message":{"text":"GetOptsOptions::apply_to (cognitive 17): GetOptsOptions::apply_to has cognitive complexity 17 (threshold 15). Drivers by points: if/else 16, loops 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/bin/main.rs"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"4881849657f9723e416efb68cc4b1ac5bb313c9e2cd1aece106762fb531287f2"}},{"ruleId":"D2","level":"warning","message":{"text":"FmtVisitor::process_comment (cognitive 17): FmtVisitor::process_comment has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (11 pts), match/switch 2 (4 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/missed_spans.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e6d3a60444e8480c3ff3a0ac97b16df27da1c0881ed0571fdf43d31d155543c"}},{"ruleId":"D2","level":"warning","message":{"text":"rustfmt_nightly::macros::wrap_macro_args_inner (cognitive 17): rustfmt_nightly::macros::wrap_macro_args_inner has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 5, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/macros.rs"},"region":{"startLine":1021}}}],"partialFingerprints":{"codehealthFindingId/v1":"61db8bb071b59abcbd10c4c0d9bbf3673592f0ecdfee14bc444c8e4516a51ac1"}},{"ruleId":"D2","level":"warning","message":{"text":"rustfmt_nightly::matches::rewrite_guard (cognitive 17): rustfmt_nightly::matches::rewrite_guard has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (16 pts), boolean chains 1 (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/matches.rs"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"abd56c0303c836b05dbf41b55605f5866aeca100bf3898f0631daeda9af20186"}},{"ruleId":"D2","level":"warning","message":{"text":"tidy::deps::check (cognitive 17): tidy::deps::check has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/tidy/src/deps.rs"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f9bfe56ea3e8742425309f1180b8d1e486553aa0161ff97d365ae3f21c293b4"}},{"ruleId":"D2","level":"warning","message":{"text":"configure.set (cognitive 17): configure.set has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 2, 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/bootstrap/configure.py"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bf9d3812a519fc506fe89bfde9028857be08bb8fb005fcfc91462c1e6efce87"}},{"ruleId":"D2","level":"warning","message":{"text":"search.initSearch::addTab (cognitive 17): search.initSearch::addTab has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (12 pts), ternaries 2 (3 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 15 other methods here (search.initSearch, search.initSearch::getItemsBefore, search.initSearch::getNextElem, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 16 times rather than 16 independent problems. Splitting this body alone leaves the other 15 exactly as they are. Where these are variations on one operation, the change that clears all 16 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":4994}}}],"partialFingerprints":{"codehealthFindingId/v1":"afa77120f8889022504b1ce402b14c7ca6525a21dac7da03638b31138aaed1ab"}},{"ruleId":"D2","level":"warning","message":{"text":"tester.parseOptions (cognitive 17): tester.parseOptions has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 1, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustdoc-js/tester.js"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3a46ae84c2de3f3fda8ef15e3d75ef91c6ef0de5ea2d7fbd0500f8063e5b304"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_abi::layout::enum_layout::finalize_tag_and_patch_variants (cognitive 16): rustc_abi::layout::enum_layout::finalize_tag_and_patch_variants has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 2 (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":"compiler/rustc_abi/src/layout/enum_layout.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"073abb408d6557d6ba04cc998b70d865d3713b239055d8a3965d81b97d576743"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_ast::util::classify::type_trailing_braced_mac_call (cognitive 16): rustc_ast::util::classify::type_trailing_braced_mac_call has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 5 (15 pts), loops 1 (nesting depth added 10). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ast/src/util/classify.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a34ffa305cc8332bd67f12d972a04c2c806d1567b7414204675cd983f37aabc"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_ast_lowering::format::flatten_format_args (cognitive 16): rustc_ast_lowering::format::flatten_format_args has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (6 pts), loops 2 (4 pts), match/switch 1 (4 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ast_lowering/src/format.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"25780c1523431554836ea0f7e02e6101f1c6472b855be66bb9937e53526ba401"}},{"ruleId":"D2","level":"warning","message":{"text":"AstValidator::check_extern_fn_signature (cognitive 16): AstValidator::check_extern_fn_signature has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (13 pts), match/switch 2 (3 pts) (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ast_passes/src/ast_validation.rs"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6e712646be0d3491c97e17c29d5cf6711009cd90a8fad2b6ae6640d439d5db8"}},{"ruleId":"D2","level":"warning","message":{"text":"RustcAutodiffParser::convert (cognitive 16): RustcAutodiffParser::convert has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 1, loops 1, match/switch 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_attr_parsing/src/attributes/autodiff.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"08d6343d3fbf279a3e165b01792767d50df573d3dc32f08bb5ed34ed0537cd0c"}},{"ruleId":"D2","level":"warning","message":{"text":"AttributeParser::check_attribute_safety (cognitive 16): AttributeParser::check_attribute_safety has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 3, match/switch 2 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_attr_parsing/src/safety.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"a84cf613bf33d316375d40da1008497959874af784150967016c9f40159e1e34"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_attr_parsing::attributes::stability::parse_unstability (cognitive 16): rustc_attr_parsing::attributes::stability::parse_unstability has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 5 (11 pts), if/else 2 (4 pts), loops 1 (nesting depth added 8). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_attr_parsing/src/attributes/stability.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"34551233bfdb7acdab0ca2220441dd3339664d039e49223ac9937daa44024135"}},{"ruleId":"D2","level":"warning","message":{"text":"MirBorrowckCtxt::suggest_similar_mut_method_for_for_loop (cognitive 16): MirBorrowckCtxt::suggest_similar_mut_method_for_for_loop has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 4, match/switch 1 (2 pts), loops 1 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/diagnostics/mutability_errors.rs"},"region":{"startLine":1078}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7c6575a913c2b993c083b9732202cb72e3e0bcc9855715682ad36747eda2c6f"}},{"ruleId":"D2","level":"warning","message":{"text":"MirBorrowckCtxt::check_if_assigned_path_is_moved (cognitive 16): MirBorrowckCtxt::check_if_assigned_path_is_moved has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), match/switch 2 (5 pts), loops 2, boolean chains 1 (nesting depth added 6). Most of this is not in the body itself: 6 of the 16 points are its own statements and the rest belongs to one function item inside it that branches (check_parent_of_field). 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":"compiler/rustc_borrowck/src/lib.rs"},"region":{"startLine":2243}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeac5da6f2cbb996265882ff6ead5904fdf1eadba51013bbd33f4b269b3a1ee1"}},{"ruleId":"D2","level":"warning","message":{"text":"LivenessComputation::compute_drop_live_points_for_block (cognitive 16): LivenessComputation::compute_drop_live_points_for_block has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/type_check/liveness/trace.rs"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a444772f311001b8de6fb33760e33fc9e651061be127ceec6dad238eab7711f"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_borrowck::region_infer::opaque_types::apply_definition_site_hidden_types (cognitive 16): rustc_borrowck::region_infer::opaque_types::apply_definition_site_hidden_types has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (12 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/region_infer/opaque_types/mod.rs"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"257f576c5848fd34dcba58df83663057d271df73f317de09f69a69c3a631a5fb"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_builtin_macros::deriving::partial_ord::cmp_body (cognitive 16): rustc_builtin_macros::deriving::partial_ord::cmp_body has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_builtin_macros/src/deriving/partial_ord.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"d00cd41bafe7be9af26c93d97d0ab6ea56c426869ee086eea2109f489fd6a18e"}},{"ruleId":"D2","level":"warning","message":{"text":"Option::merge (cognitive 16): Option::merge has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/config/mod.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"96024de49266e1f75ed04341d9c1e05f844e2e8c8451726fbbe8208d436cfa5b"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_codegen_cranelift::abi::codegen_call_with_unwind_action (cognitive 16): rustc_codegen_cranelift::abi::codegen_call_with_unwind_action has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (8 pts), match/switch 5 (8 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/src/abi/mod.rs"},"region":{"startLine":843}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed271757cf769cc789212d9bd2bb780394d58bb786f7897d63369f546285b9e3"}},{"ruleId":"D2","level":"warning","message":{"text":"Builder::multiplicative_operation (cognitive 16): Builder::multiplicative_operation has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_gcc/src/int.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"a037f8babd49a82357e421df84a5cbd2c6cf8bf2023de2f96ca1b6b901643d74"}},{"ruleId":"D2","level":"warning","message":{"text":"Builder::gcc_shl (cognitive 16): Builder::gcc_shl has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (8 pts), boolean chains 5, match/switch 1 (3 pts) (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_gcc/src/int.rs"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a8f7fff9f6a3c7580875d3ed2e594fedea02e3d3d84226ca1aaaee319c8a1ce"}},{"ruleId":"D2","level":"warning","message":{"text":"CodegenCx::scalar_to_backend_with_pac (cognitive 16): CodegenCx::scalar_to_backend_with_pac has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_gcc/src/common.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c314a07d7e5355818cd3a20ae31270a7e4c7a05ea10de8e10fe4f07e3026115"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_codegen_gcc::intrinsic::llvm::adjust_intrinsic_arguments (cognitive 16): rustc_codegen_gcc::intrinsic::llvm::adjust_intrinsic_arguments has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 2 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_gcc/src/intrinsic/llvm.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f0724cfcc27a24f878f0bbba930c6dd27258f31253ac5ada0b2beb2c519b6b7"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_codegen_llvm::asm::llvm_fixup_output_type (cognitive 16): rustc_codegen_llvm::asm::llvm_fixup_output_type has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 4, match/switch 2 (3 pts) (nesting depth added 4). 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":"compiler/rustc_codegen_llvm/src/asm.rs"},"region":{"startLine":1558}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ebc94de58cf950add68f629d5d6466a424681ebcda6166d4aec91cde9cb7d98"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_codegen_llvm::consts::const_alloc_to_llvm (cognitive 16): rustc_codegen_llvm::consts::const_alloc_to_llvm has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (11 pts), match/switch 2 (4 pts), loops 1 (nesting depth added 4). Of this number, 13 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/consts.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"588e16c5abf3ee97127f445b4aac4519204f6c74f65e8a6a193f752bcdcfa71c"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_codegen_llvm::va_arg::emit_powerpc_va_arg (cognitive 16): rustc_codegen_llvm::va_arg::emit_powerpc_va_arg has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11, match/switch 2 (3 pts), boolean chains 2 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/va_arg.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c439148c4c59ae69970981b16fabac0b2cfcb31aa8777595599020f0a043b06"}},{"ruleId":"D2","level":"warning","message":{"text":"GccLinker::set_output_kind (cognitive 16): GccLinker::set_output_kind has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 4, match/switch 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/back/linker.rs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"d522d0185a5fd03c49e40e3f69101d78fa57d38448d0a7df147634e2cc16852c"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleConfig::new (cognitive 16): ModuleConfig::new has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 8, if/else 6, match/switch 2. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/back/write.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4d85f08eeadb48b7237b4aaee829f47f8ceac5d24bbef43619a33c0dd07ae41"}},{"ruleId":"D2","level":"warning","message":{"text":"TerminatorCodegenHelper::do_inlineasm (cognitive 16): TerminatorCodegenHelper::do_inlineasm has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (15 pts), match/switch 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/mir/block.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"5828439158932b266b7dd96dd86e31a3c36471b5b024a9bdd631f54c106917a8"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionCx::retag_place (cognitive 16): FunctionCx::retag_place has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 1 (4 pts), match/switch 2 (4 pts) (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/mir/retag.rs"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"a696cedfdd52f04401fa6573846c43224caa423858c2f1420d61c02ae1b0bb6b"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_codegen_ssa::back::symbol_edit::elf_collect_impl (cognitive 16): rustc_codegen_ssa::back::symbol_edit::elf_collect_impl has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 1, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/back/symbol_edit.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"84562c48634290c7a164cfa16bd32e6f90653b6e00b114a4ee120b312cec895d"}},{"ruleId":"D2","level":"warning","message":{"text":"ObligationForest::register_obligation_at (cognitive 16): ObligationForest::register_obligation_at has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 2 (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":"compiler/rustc_data_structures/src/obligation_forest/mod.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e7e133924ec4390aaf47591e1934033a8a97a41a1e8212bad6949a66129f69f"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_expand::mbe::macro_check::check_binders (cognitive 16): rustc_expand::mbe::macro_check::check_binders has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 2 (4 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":"compiler/rustc_expand/src/mbe/macro_check.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"75d7b4e3fd52bde70023220cd975d3b7633c035b8290e395772514d74c7f8d17"}},{"ruleId":"D2","level":"warning","message":{"text":"InherentCollect::check_def_id (cognitive 16): InherentCollect::check_def_id has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (13 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":"compiler/rustc_hir_analysis/src/coherence/inherent_impls.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"57f8b79391ed00caf0dae4936edae29924c60f9f39a0bb4a93028d81670670c6"}},{"ruleId":"D2","level":"warning","message":{"text":"InherentCollect::check_primitive_impl (cognitive 16): InherentCollect::check_primitive_impl has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 1 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/coherence/inherent_impls.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ad19bad11099f638017291c4dfdd8c8055a82122848d9e58301b21c22450f71"}},{"ruleId":"D2","level":"warning","message":{"text":"TaitConstraintLocator::check (cognitive 16): TaitConstraintLocator::check has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/collect/type_of/opaque.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae32e69aaef95db0b63ec43db738767d92871b3ad331d2e3a4e969fe5ebb8e9b"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_hir_analysis::check::check::check_simd (cognitive 16): rustc_hir_analysis::check::check::check_simd has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/check/check.rs"},"region":{"startLine":1485}}}],"partialFingerprints":{"codehealthFindingId/v1":"d45f01ef7ee2b4f7fe92c1898319560724f3bce3f86ccee0e20586ba719ab904"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_hir_analysis::check::check::check_packed_inner (cognitive 16): rustc_hir_analysis::check::check::check_packed_inner has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (10 pts), boolean chains 3, loops 1 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/check/check.rs"},"region":{"startLine":1754}}}],"partialFingerprints":{"codehealthFindingId/v1":"d062d1cf32b6f132f9df4f141719d2fe2260a0fc22c54dddf6faabf8491929ac"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_hir_analysis::check::wfcheck::receiver_is_valid (cognitive 16): rustc_hir_analysis::check::wfcheck::receiver_is_valid has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/check/wfcheck.rs"},"region":{"startLine":1926}}}],"partialFingerprints":{"codehealthFindingId/v1":"149638d43b3bb35b7c572dddf2e3251ecc3e69366d61ec51c362ed738af8cf49"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_hir_analysis::hir_ty_lowering::cmse::validate_cmse_abi (cognitive 16): rustc_hir_analysis::hir_ty_lowering::cmse::validate_cmse_abi has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), match/switch 3 (6 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":"compiler/rustc_hir_analysis/src/hir_ty_lowering/cmse.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"77a84fcca6f1bc32f1b514e05079f0f20d326960b3fd1f407f227947534018cb"}},{"ruleId":"D2","level":"warning","message":{"text":"State::print_fn (cognitive 16): State::print_fn has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (15 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":"compiler/rustc_hir_pretty/src/lib.rs"},"region":{"startLine":2277}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a486e6aa065f6bd6a88b4f421c39dcc1fabd2772b78408fd65f8a41cb3297fb"}},{"ruleId":"D2","level":"warning","message":{"text":"Coerce::coerce (cognitive 16): Coerce::coerce has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), match/switch 3, boolean chains 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/coercion.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdfb858e68c713bcae3da59a48029e9c274b4964ab50bcdc069139cc3939dfb1"}},{"ruleId":"D2","level":"warning","message":{"text":"Coerce::coerce_to_ref (cognitive 16): Coerce::coerce_to_ref has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (13 pts), match/switch 2, boolean chains 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/coercion.rs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"3292a928220a8c4da928290efacac4895a80b2add20f6394068f45597ace6ed5"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::check_repeat_exprs (cognitive 16): FnCtxt::check_repeat_exprs has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 5 (8 pts), if/else 4 (7 pts), loops 1 (nesting depth added 6). 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":"compiler/rustc_hir_typeck/src/fn_ctxt/checks.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"63c9c5eefe63054e42285e57e9ce0d1245eb8e467caa46d4b3a7f99cfbb15293"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::suggest_floating_point_literal (cognitive 16): FnCtxt::suggest_floating_point_literal has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (7 pts), match/switch 3 (5 pts), boolean chains 4 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/fn_ctxt/suggestions.rs"},"region":{"startLine":1824}}}],"partialFingerprints":{"codehealthFindingId/v1":"489bc8eb72a7538e796dc702b9749016ca855b4d0a98042c473f17e5ccb134b2"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::create_no_assoc_err (cognitive 16): FnCtxt::create_no_assoc_err has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/method/suggest.rs"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"a46d40d8f081caaed3ddf227e536b01b3f3665beebc86645bc018505152377bc"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::compute_2229_migrations_for_trait (cognitive 16): FnCtxt::compute_2229_migrations_for_trait has cognitive complexity 16 (threshold 15). Drivers by points: loops 5 (8 pts), if/else 3 (6 pts), boolean chains 1, match/switch 1 (nesting depth added 6). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/upvar.rs"},"region":{"startLine":1333}}}],"partialFingerprints":{"codehealthFindingId/v1":"858134d7ba1eaee7ea0c5628af83d06e2f1edf02f135f869572e0a65983b6580"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::log_closure_min_capture_info (cognitive 16): FnCtxt::log_closure_min_capture_info has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 2 (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":"compiler/rustc_hir_typeck/src/upvar.rs"},"region":{"startLine":1958}}}],"partialFingerprints":{"codehealthFindingId/v1":"da7cf865b4586de5e5d44312642e6ff133dd3640dd4ffc37f37d7c7c7ff3d652"}},{"ruleId":"D2","level":"warning","message":{"text":"Resolver::decl_description (cognitive 16): Resolver::decl_description has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/diagnostics/impls.rs"},"region":{"startLine":2424}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddfabab473afbc7c0356694d2c4ed08d65ddb00f5cfec431db4895026ac184bf"}},{"ruleId":"D2","level":"warning","message":{"text":"Resolver::resolve_ident_in_scope_set_inner (cognitive 16): Resolver::resolve_ident_in_scope_set_inner has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), match/switch 6 (7 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/ident.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"16144c9bbda841c15c745e55b5bad4d2143dac8e8de4574be0f530a60c1ddf32"}},{"ruleId":"D2","level":"warning","message":{"text":"Resolver::resolve_macro_or_delegation_path (cognitive 16): Resolver::resolve_macro_or_delegation_path has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (8 pts), match/switch 3 (5 pts), boolean chains 3 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/macros.rs"},"region":{"startLine":799}}}],"partialFingerprints":{"codehealthFindingId/v1":"38ffc2066f6a71cef1568f911371651c9d566c9483ab06e1629f7871d7af5be9"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_hir_typeck::fallback::compute_unsafe_infer_vars (cognitive 16): rustc_hir_typeck::fallback::compute_unsafe_infer_vars has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 3, 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":"compiler/rustc_hir_typeck/src/fallback.rs"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"9698afd67b761ae100096db43c268c8bc0383d35ba822fef2443a3cb024cef94"}},{"ruleId":"D2","level":"warning","message":{"text":"InferCtxt::instantiate_var (cognitive 16): InferCtxt::instantiate_var has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 2 (4 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":"compiler/rustc_infer/src/infer/relate/generalize.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"0627bf4e3aa60b351129567366a99c89cfa637ef0a0b1b52f92f874f1c78a7c1"}},{"ruleId":"D2","level":"warning","message":{"text":"LintLevelsBuilder::insert_spec (cognitive 16): LintLevelsBuilder::insert_spec has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (8 pts), match/switch 3 (5 pts), boolean chains 3 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_lint/src/levels.rs"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"ced37b8b5a85d493c74e8ab1abdf2063fdf74649e9638cf06376dc60ebff15e7"}},{"ruleId":"D2","level":"warning","message":{"text":"UnusedDelimLint::check_expr (cognitive 16): UnusedDelimLint::check_expr has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (7 pts), boolean chains 4, match/switch 2 (3 pts), loops 1 (2 pts) (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":"compiler/rustc_lint/src/unused.rs"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b1f3be66a90e55d670cc264dd1932898f61155617117a16a1864cc298dc363d"}},{"ruleId":"D2","level":"warning","message":{"text":"SubdiagnosticDeriveVariantBuilder::generate_field_code_inner_list (cognitive 16): SubdiagnosticDeriveVariantBuilder::generate_field_code_inner_list has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 2 (4 pts), loops 1 (2 pts) (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":"compiler/rustc_macros/src/diagnostics/subdiagnostic.rs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd21564f715af8f99bb805220f5b082799583bcb7a6b9973c85c6cc8c603b2b3"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_macros::diagnostics::utils::build_format (cognitive 16): rustc_macros::diagnostics::utils::build_format has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 3 (5 pts), 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":"compiler/rustc_macros/src/diagnostics/utils.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5147dd5203627768c1cc160f7e2e5901784cb3da380b6bc178b923c6bb8d29f"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_macros::symbols::symbols_with_errors (cognitive 16): rustc_macros::symbols::symbols_with_errors has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 4 (7 pts), if/else 3 (5 pts), loops 4 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_macros/src/symbols.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"80bff8c860778cb37ddbc28534fc050c33a581071b8c5f9161bb419035b29dc7"}},{"ruleId":"D2","level":"warning","message":{"text":"DepGraph::read_index (cognitive 16): DepGraph::read_index has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 8). 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":"compiler/rustc_middle/src/dep_graph/graph.rs"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"86620817d07cbd9ed636d9d326814b7775c91ba616c9c6aecc4ebb5d4bc04705"}},{"ruleId":"D2","level":"warning","message":{"text":"InitMaskMaterialized::find_bit::find_bit_fast (cognitive 16): InitMaskMaterialized::find_bit::find_bit_fast has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 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":"compiler/rustc_middle/src/mir/interpret/allocation/init_mask.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"269a491e829984791e87853e2c441af3efebdf4e6a35f36889d4ec9ae097f5bd"}},{"ruleId":"D2","level":"warning","message":{"text":"ProvenanceMap::prepare_copy (cognitive 16): ProvenanceMap::prepare_copy has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (8 pts), loops 2 (6 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/mir/interpret/allocation/provenance_map.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"9228bf99c82d4922051ce380cd35fdb82a7267312d4398c1e7d11b6d3a794d94"}},{"ruleId":"D2","level":"warning","message":{"text":"MonoItem::instantiation_mode (cognitive 16): MonoItem::instantiation_mode has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 3, match/switch 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/mono.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb18fbbc04ece18415cda7e7296b03e0d7f8deefe45f011ea91d456212996aa0"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_middle::ty::instance::resolve_async_drop_poll (cognitive 16): rustc_middle::ty::instance::resolve_async_drop_poll has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/ty/instance.rs"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"d94b0763af1c7116dada0916dbd68053d75c31f028b60fc3d669b4f47d3891e9"}},{"ruleId":"D2","level":"warning","message":{"text":"Builder::as_temp (cognitive 16): Builder::as_temp has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 3, match/switch 2 (3 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_build/src/builder/expr/as_temp.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bba82cdb128dd74b7986d7e801218cd85d226c53f58bbc2157ecd5cd374bdaa"}},{"ruleId":"D2","level":"warning","message":{"text":"Builder::break_for_tail_call (cognitive 16): Builder::break_for_tail_call has cognitive complexity 16 (threshold 15). Drivers by points: loops 3 (7 pts), if/else 2 (5 pts), match/switch 2 (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":"compiler/rustc_mir_build/src/builder/scope.rs"},"region":{"startLine":1090}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6c86507a1430cb7420c29cc4fa5a7b5e34ecb5aadc1b241c2c02c43964da19a"}},{"ruleId":"D2","level":"warning","message":{"text":"MatchVisitor::check_binding_is_irrefutable (cognitive 16): MatchVisitor::check_binding_is_irrefutable has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 4 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_build/src/thir/pattern/check_match.rs"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f617a1e108a28854a72d0ec1a1e4310314edc5d3131a4e3757a67d035418fcf"}},{"ruleId":"D2","level":"warning","message":{"text":"MutRestrictionChecker::visit_place (cognitive 16): MutRestrictionChecker::visit_place has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/check_mut_restriction.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaf2d5174d33fc7c402fb4010076340debdd1224e7353fd4aa7882a692009a66"}},{"ruleId":"D2","level":"warning","message":{"text":"ConstAnalysis::binary_op (cognitive 16): ConstAnalysis::binary_op has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), match/switch 3 (5 pts), boolean chains 3 (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":"compiler/rustc_mir_transform/src/dataflow_const_prop.rs"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"dba04d7d0a5276f2ee51c29dc806dca25f1a5dd8243e9ad764e70e44931e677c"}},{"ruleId":"D2","level":"warning","message":{"text":"AssignmentResult::merge_guards (cognitive 16): AssignmentResult::merge_guards has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 2 (4 pts), match/switch 1 (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":"compiler/rustc_mir_transform/src/liveness.rs"},"region":{"startLine":814}}}],"partialFingerprints":{"codehealthFindingId/v1":"162b325b8f6640843e6323c5bd4e15677a64461ae7bc1723a79fbab8414b315c"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_mir_transform::jump_threading::remove_costly_conditions (cognitive 16): rustc_mir_transform::jump_threading::remove_costly_conditions has cognitive complexity 16 (threshold 15). Drivers by points: loops 5 (9 pts), match/switch 1 (4 pts), if/else 1 (3 pts) (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/jump_threading.rs"},"region":{"startLine":860}}}],"partialFingerprints":{"codehealthFindingId/v1":"06fc3c21ddf3cbbfe8fc3a8c62784373e498e2b1051da857325f11d1a45581ce"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_inner_attributes (cognitive 16): Parser::parse_inner_attributes has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/attr.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"4596327636dbb24c69528ae53e3e9b5db494819116cd376f627750d21ddd0421"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::conflict_marker (cognitive 16): Parser::conflict_marker has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 2, loops 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":"compiler/rustc_parse/src/parser/diagnostics.rs"},"region":{"startLine":2841}}}],"partialFingerprints":{"codehealthFindingId/v1":"e727eab85dcd6a63840b33fc0c8b5c19df9efbcd9065134dbaad32fcd877d883"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::check_fn_front_matter (cognitive 16): Parser::check_fn_front_matter has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 11, match/switch 3, if/else 2. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/function.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"def9adb328f62a9bcc82f26ddb35ac537e2bbe1988a5f96fe069d217162ebb5e"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_const_item (cognitive 16): Parser::parse_const_item has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12 (13 pts), boolean chains 2, match/switch 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/item.rs"},"region":{"startLine":1775}}}],"partialFingerprints":{"codehealthFindingId/v1":"b87aeab969555b6ceda52ff0e4594c32687fd860aaf3d00a99fd880a346434a9"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_tuple_struct_body (cognitive 16): Parser::parse_tuple_struct_body has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), match/switch 3 (4 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/item.rs"},"region":{"startLine":2208}}}],"partialFingerprints":{"codehealthFindingId/v1":"bac505430bec4547f1ce10d44bf5d6c58266f842b32e3a1434c82c6973c14a7d"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_single_struct_field (cognitive 16): Parser::parse_single_struct_field has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 4, match/switch 1 (nesting depth added 5). 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":"compiler/rustc_parse/src/parser/item.rs"},"region":{"startLine":2339}}}],"partialFingerprints":{"codehealthFindingId/v1":"a374c96bac1210ae8ffef4b570e592d2998a09dc099cf1440429154fe9e3c3e9"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_trait_bound_modifiers (cognitive 16): Parser::parse_trait_bound_modifiers has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 3, match/switch 2 (3 pts) (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/ty.rs"},"region":{"startLine":1315}}}],"partialFingerprints":{"codehealthFindingId/v1":"a59a86a10be938532008dffb834f4bed2228c6582746c681db857d321a22163f"}},{"ruleId":"D2","level":"warning","message":{"text":"CheckAttrVisitor::check_attributes (cognitive 16): CheckAttrVisitor::check_attributes has cognitive complexity 16 (threshold 15). Drivers by points: if/else 2 (9 pts), match/switch 2 (5 pts), boolean chains 1, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_passes/src/check_attr.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"08d890eaffbc491a66e68c551eb1010ca136759cb80cf25da1fcc7054f5bb4d4"}},{"ruleId":"D2","level":"warning","message":{"text":"DeadVisitor::fulfill_dead_code_expectations (cognitive 16): DeadVisitor::fulfill_dead_code_expectations has cognitive complexity 16 (threshold 15). Drivers by points: loops 4 (9 pts), if/else 3 (5 pts), boolean chains 1, match/switch 1 (nesting depth added 7). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_passes/src/dead.rs"},"region":{"startLine":1267}}}],"partialFingerprints":{"codehealthFindingId/v1":"0334fc1ff8a52928dad363c78803dc6c1c91a3cb0c20487f15dba24c0fc44cbd"}},{"ruleId":"D2","level":"warning","message":{"text":"RustcPatCtxt::print_witness_pat (cognitive 16): RustcPatCtxt::print_witness_pat has cognitive complexity 16 (threshold 15). Drivers by points: loops 2 (6 pts), match/switch 3 (5 pts), boolean chains 3, if/else 1 (2 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":"compiler/rustc_pattern_analysis/src/rustc.rs"},"region":{"startLine":786}}}],"partialFingerprints":{"codehealthFindingId/v1":"634fe1166ace594536007333bfa897536658725edef5cf4a130f538afb18cb37"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_query_impl::handle_cycle_error::recursive_type_error (cognitive 16): rustc_query_impl::handle_cycle_error::recursive_type_error has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 3 (4 pts), boolean chains 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_query_impl/src/handle_cycle_error.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"f43a70eae456a9995b11f97e6dcdd5bd2b711b3c977848a885c627d0e6372863"}},{"ruleId":"D2","level":"warning","message":{"text":"UnusedImportCheckVisitor::report_unused_extern_crate_items (cognitive 16): UnusedImportCheckVisitor::report_unused_extern_crate_items has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/check_unused.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"c34d08b8d195fd4e32e63137702790ab89fc812cd91111aeab8e68ecf87437a4"}},{"ruleId":"D2","level":"warning","message":{"text":"DefCollector::build_reduced_graph_for_extern_crate (cognitive 16): DefCollector::build_reduced_graph_for_extern_crate has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/build_reduced_graph.rs"},"region":{"startLine":1003}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c3ea3e3cc62837f62d15d48757827c47c25ccb64c655258eb0ec03e7af321d2"}},{"ruleId":"D2","level":"warning","message":{"text":"DuplicateLangItem::into_diag (cognitive 16): DuplicateLangItem::into_diag has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12 (15 pts), match/switch 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/diagnostics/mod.rs"},"region":{"startLine":1809}}}],"partialFingerprints":{"codehealthFindingId/v1":"0714210cc0dac8c2d46eb8a6a6cd71ec4f711536ae95ee61e3f0a0d10543cd9d"}},{"ruleId":"D2","level":"warning","message":{"text":"LateResolutionVisitor::point_at_impl_lifetimes (cognitive 16): LateResolutionVisitor::point_at_impl_lifetimes has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 2, match/switch 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/late.rs"},"region":{"startLine":2203}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdb45715332918362f8472d24a4122fa3349eef45d1607d7dbb7c190d11b2b88"}},{"ruleId":"D2","level":"warning","message":{"text":"LateResolutionVisitor::resolve_fn_signature (cognitive 16): LateResolutionVisitor::resolve_fn_signature has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (7 pts), loops 2 (6 pts), match/switch 1 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/late.rs"},"region":{"startLine":2592}}}],"partialFingerprints":{"codehealthFindingId/v1":"41c4cee95065c12bd5f732a931c4ba405ba955273e212f5f94f5c553c0793a42"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_resolve::rustdoc::parse_links (cognitive 16): rustc_resolve::rustdoc::parse_links has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2, match/switch 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/rustdoc.rs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"b99f02452c2b1eae63d6e7f416aa4efbcff91b38b68fa8acceb3c2122496b240"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_session::diagnostics::create_lit_error (cognitive 16): rustc_session::diagnostics::create_lit_error has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (7 pts), match/switch 4 (6 pts), boolean chains 3 (nesting depth added 4). Of this number, 12 points are the body\u0027s own statements and 4 belong to 2 function items inside it that branch. 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":"compiler/rustc_session/src/diagnostics.rs"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7247ff980664ee01c88ef7ca2119ddf60a6ee0841c307f27c960e4b89eda689"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_target::callconv::x86_64::classify_arg::classify (cognitive 16): rustc_target::callconv::x86_64::classify_arg::classify has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 4 (7 pts), loops 3 (6 pts), if/else 2 (3 pts) (nesting depth added 7). 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. This shape REPEATS in the file: one other method here (rustc_target::callconv::x86_64::classify_arg) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_target/src/callconv/x86_64.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fd2418d8e28ae77840affc8ddb91541d80c521707b6982e928c858b95603c83"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_target::target_features::feature_to_arch_names (cognitive 16): rustc_target::target_features::feature_to_arch_names has cognitive complexity 16 (threshold 15). Drivers by points: if/else 16. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_target/src/target_features.rs"},"region":{"startLine":1138}}}],"partialFingerprints":{"codehealthFindingId/v1":"89febbf2137a70649f398087410a1bd13a64aba0bbcef8199a48d3a3465e5d13"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeErrCtxt::check_same_definition_different_crate (cognitive 16): TypeErrCtxt::check_same_definition_different_crate has cognitive complexity 16 (threshold 15). Drivers by points: loops 3 (8 pts), if/else 3 (6 pts), boolean chains 2 (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/error_reporting/traits/mod.rs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4e7cce14612f8482a20a46bf8cb27afdd4704f94f4eb3d788a9aaba12f8e78d"}},{"ruleId":"D2","level":"warning","message":{"text":"SelectionContext::assemble_async_closure_candidates (cognitive 16): SelectionContext::assemble_async_closure_candidates has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 3, match/switch 2 (3 pts) (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":"compiler/rustc_trait_selection/src/traits/select/candidate_assembly.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"882236352e59c31e25dccdc55814e0850a3a03a7fc859a3258eaaf6612e4183f"}},{"ruleId":"D2","level":"warning","message":{"text":"SelectionContext::reject_fn_ptr_impls (cognitive 16): SelectionContext::reject_fn_ptr_impls has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/traits/select/candidate_assembly.rs"},"region":{"startLine":658}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2c12a86abd17eb2da22711ee819a22e6b6ee91a9707f1f2d919d4682563f6b4"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_trait_selection::error_reporting::infer::region::msg_span_from_named_region (cognitive 16): rustc_trait_selection::error_reporting::infer::region::msg_span_from_named_region has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 2 (4 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":"compiler/rustc_trait_selection/src/error_reporting/infer/region.rs"},"region":{"startLine":1238}}}],"partialFingerprints":{"codehealthFindingId/v1":"e87d5dc7a91b472242bdf4ce300062407aef62c3573f1b7ccc4d9be9754e1a2a"}},{"ruleId":"D2","level":"warning","message":{"text":"NodeRef::fix_node_through_parent (cognitive 16): NodeRef::fix_node_through_parent has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (14 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":"library/alloc/src/collections/btree/fix.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"55e9908dc0c88680bcce70c4ce90183d80db76e6bc962a86e14fcda72aab7c9d"}},{"ruleId":"D2","level":"warning","message":{"text":"Handle::remove_leaf_kv (cognitive 16): Handle::remove_leaf_kv has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/alloc/src/collections/btree/remove.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c062a9223da50bdb30fa30383c3c574a7aebac6a4b81294d3eabf47a35a73c5"}},{"ruleId":"D2","level":"warning","message":{"text":"symcheck::exec_cargo_with_args (cognitive 16): symcheck::exec_cargo_with_args has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/compiler-builtins/crates/symcheck/src/main.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"922e2a6f96cd1b8744eb63a60136a162b511470ee1286536bf592c8bda71b1d7"}},{"ruleId":"D2","level":"warning","message":{"text":"libm::math::exp2::exp2 (cognitive 16): libm::math::exp2::exp2 has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/compiler-builtins/libm/src/math/exp2.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"672535e3f6fc9d778068a8fa54a7fddb61b3b2a8488896e4d938f182195f7ef1"}},{"ruleId":"D2","level":"warning","message":{"text":"libm::math::hypot::as_hypot_hard (cognitive 16): libm::math::hypot::as_hypot_hard has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (14 pts), loops 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"library/compiler-builtins/libm/src/math/hypot.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"136b06cb1e8e9587e79e3acf61c65f76781b27574c72efe4d81a7ab4e7073863"}},{"ruleId":"D2","level":"warning","message":{"text":"CharSearcher::next_match (cognitive 16): CharSearcher::next_match has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 1 (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This shape REPEATS in the file: one other method here (CharSearcher::next_match_back) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/str/pattern.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cbd095cb99725ec6926d0d5da0ddfc8f9ee4dd76b1ca2e7d69e069bf3eec2fa"}},{"ruleId":"D2","level":"warning","message":{"text":"CharSearcher::next_match_back (cognitive 16): CharSearcher::next_match_back has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 1 (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This shape REPEATS in the file: one other method here (CharSearcher::next_match) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/str/pattern.rs"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fc11731eb00d2201f0d25d70c00f3f1e3cf3d431d0f353033b186dbc0107556"}},{"ruleId":"D2","level":"warning","message":{"text":"core::num::imp::dec2flt::parse::parse_partial_number (cognitive 16): core::num::imp::dec2flt::parse::parse_partial_number has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 2, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/num/imp/dec2flt/parse.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"92fa9325ccf2662452ee23fec1e2233f3442760714324cfe0051ee976524088e"}},{"ruleId":"D2","level":"warning","message":{"text":"core::ptr::align_offset (cognitive 16): core::ptr::align_offset has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (15 pts), loops 1 (nesting depth added 4). Of this number, 11 points are the body\u0027s own statements and 5 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":"library/core/src/ptr/mod.rs"},"region":{"startLine":2282}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a9231502aaee4a95a47c053ce1614d34bfd1cfe01cc7aa2c0f602a87ceb4302"}},{"ruleId":"D2","level":"warning","message":{"text":"DirBuilder::create_dir_all (cognitive 16): DirBuilder::create_dir_all has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), boolean chains 4, loops 2, match/switch 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/fs.rs"},"region":{"startLine":3914}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ed724078ca71c53eeb5cdd42a48ea67eb6fc5982bea397393f2dd13a5e1ef27"}},{"ruleId":"D2","level":"warning","message":{"text":"Mode::fmt (cognitive 16): Mode::fmt has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12, match/switch 4. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/fs/unix.rs"},"region":{"startLine":1819}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c2163629c6b371ca0c218c3e02b96dc3c3d598b99ddf84b95251ae694ec5004"}},{"ruleId":"D2","level":"warning","message":{"text":"std::sys::args::uefi::parse_lp_cmd_line (cognitive 16): std::sys::args::uefi::parse_lp_cmd_line has cognitive complexity 16 (threshold 15). Drivers by points: loops 4 (6 pts), if/else 3 (5 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/args/uefi.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3781097fc2f2f5703ed26e5dc6341fdf7ace33c6e5b182dedbaaca159f02354"}},{"ruleId":"D2","level":"warning","message":{"text":"Invoc::parse (cognitive 16): Invoc::parse has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/assert-instr-macro/src/lib.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc0accba314f9d4bd7125a7510aef8ba876854c0042051e73da5c9b5cbf0463a"}},{"ruleId":"D2","level":"warning","message":{"text":"Standalone::run (cognitive 16): Standalone::run has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 5, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/build_steps/doc.rs"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f9358f2c12e35aa5a8b547b517aa90ae3685a46388185ff51480bdcb8173517"}},{"ruleId":"D2","level":"warning","message":{"text":"Config::download_rustc_commit (cognitive 16): Config::download_rustc_commit has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), boolean chains 4, match/switch 2 (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/bootstrap/src/core/config/config.rs"},"region":{"startLine":1755}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1200ce11e9d58c2b53aefbd44fc24c9528ecf5fc308f10c258c533591fdcfe1"}},{"ruleId":"D2","level":"warning","message":{"text":"Session::copy_link_internal (cognitive 16): Session::copy_link_internal has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/session.rs"},"region":{"startLine":1512}}}],"partialFingerprints":{"codehealthFindingId/v1":"7df5af07ce0e826468eea5f4a442db85f70082c6ba49b61b8d602330ceb93933"}},{"ruleId":"D2","level":"warning","message":{"text":"bootstrap::core::build_steps::dist::copy_src_dirs::filter_fn (cognitive 16): bootstrap::core::build_steps::dist::copy_src_dirs::filter_fn has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 5, match/switch 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/build_steps/dist.rs"},"region":{"startLine":1091}}}],"partialFingerprints":{"codehealthFindingId/v1":"d14fb0f536703add601c22d17bb96acb4012484750f2fd2d9cebfa9f5de2b449"}},{"ruleId":"D2","level":"warning","message":{"text":"citool::analysis::report_debuginfo_statistics (cognitive 16): citool::analysis::report_debuginfo_statistics has cognitive complexity 16 (threshold 15). Drivers by points: if/else 2 (6 pts), loops 3 (5 pts), match/switch 1 (5 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ci/citool/src/analysis.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4460bda35b1ffb01fc687e233ed17009db5e883e8290de44514a9ea3ba2f2d2"}},{"ruleId":"D2","level":"warning","message":{"text":"sembr::main (cognitive 16): sembr::main has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/doc/rustc-dev-guide/ci/sembr/src/main.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"4acb73ae915dd62e8156d0ca22a4a6a4ab2f1ad36a5d52b72eb27f2f5c1994d4"}},{"ruleId":"D2","level":"warning","message":{"text":"Markdown::split_summary_and_content (cognitive 16): Markdown::split_summary_and_content has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/markdown.rs"},"region":{"startLine":1471}}}],"partialFingerprints":{"codehealthFindingId/v1":"008f5d3440a96c70a3d0c775d1307721cba288d2d0209898b3c67f5d36e84638"}},{"ruleId":"D2","level":"warning","message":{"text":"LinkCollector::resolve_with_disambiguator_cached (cognitive 16): LinkCollector::resolve_with_disambiguator_cached has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (8 pts), boolean chains 5, match/switch 1 (2 pts), loops 1 (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":"src/librustdoc/passes/collect_intra_doc_links.rs"},"region":{"startLine":1552}}}],"partialFingerprints":{"codehealthFindingId/v1":"1add8b59c79c6393257ca85090705dc484abd02f388e2174bfb3b461d1fd8605"}},{"ruleId":"D2","level":"warning","message":{"text":"rustdoc::formats::cache::add_item_to_search_index (cognitive 16): rustdoc::formats::cache::add_item_to_search_index has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (6 pts), match/switch 4 (6 pts), boolean chains 3, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/formats/cache.rs"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a7a2e27f89824ec2a76a02a2240341b5b4a2282b6cbb829fe4b5b7bdcb423b0"}},{"ruleId":"D2","level":"warning","message":{"text":"rustdoc::html::format::print_parameter (cognitive 16): rustdoc::html::format::print_parameter has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (14 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/librustdoc/html/format.rs"},"region":{"startLine":1519}}}],"partialFingerprints":{"codehealthFindingId/v1":"6975d87369151970b45753e87410bcb31fe5bec6346389f23ff86e3bb3fd018d"}},{"ruleId":"D2","level":"warning","message":{"text":"rustdoc::html::render::render_stability_since_raw_with_extra (cognitive 16): rustdoc::html::render::render_stability_since_raw_with_extra has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (15 pts), match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/render/mod.rs"},"region":{"startLine":1229}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c4040496feab6d8407e805a261cacccd42c445ee0be04634538bc87d2150332"}},{"ruleId":"D2","level":"warning","message":{"text":"rustdoc::html::render::render_impl_summary (cognitive 16): rustdoc::html::render::render_impl_summary has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/render/mod.rs"},"region":{"startLine":2366}}}],"partialFingerprints":{"codehealthFindingId/v1":"5782610d16522f7d29f1364a10f86c28e9b666cf32963e32f9325664e94e512f"}},{"ruleId":"D2","level":"warning","message":{"text":"rustdoc::passes::lint::check_code_block_syntax::check_rust_syntax (cognitive 16): rustdoc::passes::lint::check_code_block_syntax::check_rust_syntax has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 3, loops 1, match/switch 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/passes/lint/check_code_block_syntax.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d548098e3d2a2a499f75239eebedac690c49b55e6c17a0b2ad5341a55b68f2a"}},{"ruleId":"D2","level":"warning","message":{"text":"Tool::collect_checksums (cognitive 16): Tool::collect_checksums has cognitive complexity 16 (threshold 15). Drivers by points: loops 6 (12 pts), if/else 1 (4 pts) (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/bump-stage0/src/main.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8cf35c0bd53bf7e0628c7e2f48c9524b3ad666f29500925375a5f9b91a2668e"}},{"ruleId":"D2","level":"warning","message":{"text":"Documentation::check_attributes (cognitive 16): Documentation::check_attributes has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 4 (8 pts), if/else 3 (5 pts), boolean chains 3 (nesting depth added 6). 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/tools/clippy/clippy_lints/src/doc/mod.rs"},"region":{"startLine":759}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7161f4f0df2d7272c7ae9662f749dd40400bad008a2bd495bcdc5b55b723db4"}},{"ruleId":"D2","level":"warning","message":{"text":"FromStrRadix10::check_expr (cognitive 16): FromStrRadix10::check_expr has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 2, match/switch 1 (2 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/tools/clippy/clippy_lints/src/from_str_radix_10.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"c11f544aec1c654d3e4ae0c77f55f5ae1bbd7dc3f922c98d39008c0b1dfd8f43"}},{"ruleId":"D2","level":"warning","message":{"text":"InconsistentStructConstructor::check_expr (cognitive 16): InconsistentStructConstructor::check_expr has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 1 (2 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/tools/clippy/clippy_lints/src/inconsistent_struct_constructor.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3bdbab6f08283744960ba16faada4f3761c6690f11415394aba23f59eb201ec"}},{"ruleId":"D2","level":"warning","message":{"text":"ItemNameRepetitions::check_struct_name_repetition (cognitive 16): ItemNameRepetitions::check_struct_name_repetition has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/item_name_repetitions.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba7dfddd2cd9fc566f06cb1a444e217a4ea8bca3906d6f00d57fc40ab3f13ab7"}},{"ruleId":"D2","level":"warning","message":{"text":"LoopVisitor::visit_expr (cognitive 16): LoopVisitor::visit_expr has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 2, 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/tools/clippy/clippy_lints/src/loops/infinite_loop.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"e93614e14d5cd7dd8500185a361b44a9bf237ca0f9468c9369b40a6cc3e42e6a"}},{"ruleId":"D2","level":"warning","message":{"text":"MutMut::check_expr (cognitive 16): MutMut::check_expr has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 4, loops 1 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/mut_mut.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9ef1c97b56213bd8a7a7de74087a16519b70a11cb3edf63d3491aed97cce20e"}},{"ruleId":"D2","level":"warning","message":{"text":"RawStrings::check_raw_string (cognitive 16): RawStrings::check_raw_string has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 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/tools/clippy/clippy_lints/src/raw_strings.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8dd71a64aec41a22afbf2f89759cff546c1f363d0574bd62510b91a2c8055f6"}},{"ruleId":"D2","level":"warning","message":{"text":"ReadVecVisitor::visit_expr (cognitive 16): ReadVecVisitor::visit_expr has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 3, 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/tools/clippy/clippy_lints/src/read_zero_byte_vec.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d7fb74e62ec1411289b7eb4f2a069fe56f66847bcddaefaa6f1611c495cbd9b"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::attrs::unnecessary_clippy_cfg::check (cognitive 16): clippy_lints::attrs::unnecessary_clippy_cfg::check has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 2, loops 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/tools/clippy/clippy_lints/src/attrs/unnecessary_clippy_cfg.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"023c8e0ddd4b7cd780b17f0608127ef41e606d5b700ac4c0357340a9f3f35e35"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::casts::utils::enum_ty_to_nbits (cognitive 16): clippy_lints::casts::utils::enum_ty_to_nbits has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (8 pts), match/switch 4 (8 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/tools/clippy/clippy_lints/src/casts/utils.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0c6f57dfe13837f66201126cbc94cc8eee6497432eb2752467069fa28da3301"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::checked_conversions::get_types_from_cast (cognitive 16): clippy_lints::checked_conversions::get_types_from_cast has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/checked_conversions.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"a68c33a7c2dc26dfca73b8dd91a774cc32fd28ec0e6df3b907bb81e12ca9a897"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::collection_is_never_read::has_no_read_access (cognitive 16): clippy_lints::collection_is_never_read::has_no_read_access has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 4 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/collection_is_never_read.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ae50727ba7b31399223fe966c4548952c1735235df2b7e47e5e0ad9d5d59e02"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::floating_point_arithmetic::powi::check (cognitive 16): clippy_lints::floating_point_arithmetic::powi::check has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/floating_point_arithmetic/powi.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bbb2726aea4f928ebf72c0b333e69e70ea6c31b87545ebf631163883da7a367"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::ifs::branches_sharing_code::check_match (cognitive 16): clippy_lints::ifs::branches_sharing_code::check_match has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 1, loops 1, match/switch 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/ifs/branches_sharing_code.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"706867bc3fcb493580eece6e68ef435eb946b3eb087e62bdd4c5cc14817a7d29"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::loops::never_loop::check (cognitive 16): clippy_lints::loops::never_loop::check has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 2 (5 pts), boolean chains 1, match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/loops/never_loop.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"f24b0d858745821220214e4c221c44f4247b21be8c6cca7949643d11d9c0ff05"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::manual_pop_if::check_if_let_pattern (cognitive 16): clippy_lints::manual_pop_if::check_if_let_pattern has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 2 (7 pts), if/else 3 (6 pts), boolean chains 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/manual_pop_if.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"9952e80f31b1a012c1109b45080ad931fa2a70f6dd0a5162f53e3c1e23c5b7fb"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::matches::overlapping_arms::all_ranges (cognitive 16): clippy_lints::matches::overlapping_arms::all_ranges has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 1 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/matches/overlapping_arms.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"aad278b3db87ee42c6722741eb1098a593cb6c87ed00a0dfdbc658548d28a4cf"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::matches::overlapping_arms::overlapping (cognitive 16): clippy_lints::matches::overlapping_arms::overlapping has cognitive complexity 16 (threshold 15). Drivers by points: if/else 2 (7 pts), loops 3 (5 pts), match/switch 2 (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/tools/clippy/clippy_lints/src/matches/overlapping_arms.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d86e9a04800dadfbe63b73d27baef323791af6db67af1a1b166fc6337f7e79b"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::methods::clone_on_copy::check_function (cognitive 16): clippy_lints::methods::clone_on_copy::check_function has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/methods/clone_on_copy.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b2e12ca0d68e65aa7f85186146ad619a49fab1b6724cacb091d81394c580f78"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::methods::needless_collect::check_collect_into_intoiterator (cognitive 16): clippy_lints::methods::needless_collect::check_collect_into_intoiterator has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/methods/needless_collect.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec86802a55bada6600483064f1f4b1cf7f5145c37a57eb4ddef4977c1cd5f768"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::methods::obfuscated_if_else::check (cognitive 16): clippy_lints::methods::obfuscated_if_else::check has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (7 pts), match/switch 3 (7 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/tools/clippy/clippy_lints/src/methods/obfuscated_if_else.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c0cf32807456eadbde07d5f8c628f22da30ee6794bfac3dcb9ef936309cd945"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::methods::or_fun_call::check_or_fn_call (cognitive 16): clippy_lints::methods::or_fun_call::check_or_fn_call has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/methods/or_fun_call.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eb59c4f24ba8dfb4ddc6bb3dc22d8ddd944819ccebc7bd2b588496a031413b5"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::missing_asserts_for_indexing::check_index (cognitive 16): clippy_lints::missing_asserts_for_indexing::check_index has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (12 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/missing_asserts_for_indexing.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad19b687125a777f1fef67fa5a703f88da69876923ca5427c34b09af25366cb6"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::set_contains_or_insert::try_parse_op_call (cognitive 16): clippy_lints::set_contains_or_insert::try_parse_op_call has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/set_contains_or_insert.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"224f02816e953f3d2e2962bec8129bbeec5d2524b56456466c3c91418b39921e"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::unicode::check_str (cognitive 16): clippy_lints::unicode::check_str has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/unicode.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"9783ea1a43c6be12e3230bc6a9b3eecc2447d17b1fee83c2ffa36a4b9461609b"}},{"ruleId":"D2","level":"warning","message":{"text":"NumericLiteral::split_digit_parts (cognitive 16): NumericLiteral::split_digit_parts has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 1 (3 pts), loops 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_utils/src/numeric_literal.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"1235937a35559789b904d06f947c4741c2af3a485ba3dd706619a7012b16cd6f"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_utils::str_utils::camel_case_start_from_idx (cognitive 16): clippy_utils::str_utils::camel_case_start_from_idx has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_utils/src/str_utils.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"03c30aea1e142ab20d2e4e62e0532255d195e275316fb5644b1bb904534ac0e5"}},{"ruleId":"D2","level":"warning","message":{"text":"TestCx::run_incremental_test (cognitive 16): TestCx::run_incremental_test has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 4 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/compiletest/src/runtest/incremental.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2a7e9a33dae436f7b671b0dc23fd7caeb4ad7924f4df0b8e0fec0b0b767c10e"}},{"ruleId":"D2","level":"warning","message":{"text":"compiletest::run_tests (cognitive 16): compiletest::run_tests has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (15 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/tools/compiletest/src/lib.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2caf66dc5dd3588c5006ed423171e0ac566e61d165b7074e3848ed9ce7c98a5"}},{"ruleId":"D2","level":"warning","message":{"text":"LintExtractor::replace_produces (cognitive 16): LintExtractor::replace_produces has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 3 (9 pts), loops 4 (7 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/tools/lint-docs/src/lib.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"b95316870f7553c21fd5173a891789edf7c8c298cb3171405862011ec7c90397"}},{"ruleId":"D2","level":"warning","message":{"text":"LintExtractor::generate_lint_output (cognitive 16): LintExtractor::generate_lint_output has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 2, loops 2 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/lint-docs/src/lib.rs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"b38d4951c0f39d2ea35333561e30cb9460a1f795e38649a1f818ed8e089cc6b8"}},{"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":"src/tools/miri/priroda/src/frontend/cli.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9563c224734e0c9bf5a44b562317c6c91469aef57b6f6a5800043e129310f02"}},{"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/tools/miri/src/intrinsics/mod.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae7762e6ac4026bc5ad883094e4140c18c1690c19fc19b196c2468bce1887951"}},{"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/tools/miri/src/intrinsics/x86/sse41.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8d6a1276e685689b97c01eb7e01be2d245c3045cd69d139347996e9fc771e67"}},{"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/tools/miri/src/shims/tls.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cf32578d3a4aaf55d77376388c07d80445a72ed6c4e61e3fbcebc227ec4d4bf"}},{"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/tools/miri/src/shims/unix/socket.rs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"b48715ae4344d63210551db6a032eea398b6058e48d1e7221e71f42e67d26595"}},{"ruleId":"D2","level":"warning","message":{"text":"Function::hir_fmt (cognitive 16): Function::hir_fmt has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), match/switch 3 (4 pts), boolean chains 3 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir/src/display.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"4effb52a85b903157e42f0bbf7da0d8c0bd2b20614b5e36c216047de5235fa68"}},{"ruleId":"D2","level":"warning","message":{"text":"SemanticsImpl::analyze_impl (cognitive 16): SemanticsImpl::analyze_impl has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (15 pts), match/switch 1 (nesting depth added 5). 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/tools/rust-analyzer/crates/hir/src/semantics.rs"},"region":{"startLine":2283}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad3646a6a01d4f7d2c650ca28912eddbaa4df70e4794272f826bcd9d7401b8ce"}},{"ruleId":"D2","level":"warning","message":{"text":"SemanticsImpl::locals_used (cognitive 16): SemanticsImpl::locals_used has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), match/switch 3 (4 pts), boolean chains 2, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir/src/semantics.rs"},"region":{"startLine":2459}}}],"partialFingerprints":{"codehealthFindingId/v1":"99fb4c18b658048a6ceb42d937691e0c2420a4f44ab182bb70b45b3da5e4659a"}},{"ruleId":"D2","level":"warning","message":{"text":"SourceAnalyzer::resolve_offset_of_field (cognitive 16): SourceAnalyzer::resolve_offset_of_field has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 4 (11 pts), if/else 2 (4 pts), loops 1 (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/tools/rust-analyzer/crates/hir/src/source_analyzer.rs"},"region":{"startLine":1084}}}],"partialFingerprints":{"codehealthFindingId/v1":"653f26449a742a792b7b71b726d606dd72cd2b5cca8b12e70794e1691cda2d55"}},{"ruleId":"D2","level":"warning","message":{"text":"Docs::push_doc_lines (cognitive 16): Docs::push_doc_lines has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 2 (3 pts), boolean chains 2, match/switch 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/attrs/docs.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"08584e23b0504c13b0539f6615a0f54bc2df7b3dffcb51df9a02c5948be6c28f"}},{"ruleId":"D2","level":"warning","message":{"text":"Docs::remove_indent (cognitive 16): Docs::remove_indent has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 2, loops 1, match/switch 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/attrs/docs.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1b27a70c2b452830cc8de631d95c5eeb5f7371b9be12b9f43b41d55bff25ff9"}},{"ruleId":"D2","level":"warning","message":{"text":"AssocItemCollector::record_item (cognitive 16): AssocItemCollector::record_item has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 3 (6 pts) (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/tools/rust-analyzer/crates/hir-def/src/nameres/assoc.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dcf1f5fe8b0d2a8dd3a7927618cd39a1ef89ee1952dc77392a6ca26c9bac46c"}},{"ruleId":"D2","level":"warning","message":{"text":"ModCollector::collect_macro_rules (cognitive 16): ModCollector::collect_macro_rules has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 5 (12 pts), if/else 4 (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/tools/rust-analyzer/crates/hir-def/src/nameres/collector.rs"},"region":{"startLine":2517}}}],"partialFingerprints":{"codehealthFindingId/v1":"11e34351c8c6a6e278a3ad4e9b699221d40f1c84737d188071c4042480a32039"}},{"ruleId":"D2","level":"warning","message":{"text":"hir_def::find_path::find_in_sysroot (cognitive 16): hir_def::find_path::find_in_sysroot has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/find_path.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad477c7a262113fa1efdf579caf126c5893eec16530eb99821de04b7a512585e"}},{"ruleId":"D2","level":"warning","message":{"text":"DeclValidator::validate_func_body (cognitive 16): DeclValidator::validate_func_body has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 1, match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ide/src/diagnostics/decl_check.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"146e1e171e0a4e5c4245a8288e41493b4529ef32bf6d0ec3eef31c658a759ec4"}},{"ruleId":"D2","level":"warning","message":{"text":"HirFormatter::format_bounds_with (cognitive 16): HirFormatter::format_bounds_with has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 1 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ide/src/display.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8b663fa7ca33d4ecbdf3424cd7e2cc3fdaa38b505dee37aea145204c869b9f3"}},{"ruleId":"D2","level":"warning","message":{"text":"InferenceContext::try_index_step (cognitive 16): InferenceContext::try_index_step has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/infer/place_op.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1b931205a80dc0a8bc2040c952cd40f1364b2d21ad19a0182fb1353ee9e3246"}},{"ruleId":"D2","level":"warning","message":{"text":"ProbeContext::collapse_candidates_to_subtrait_pick (cognitive 16): ProbeContext::collapse_candidates_to_subtrait_pick has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/method_resolution/probe.rs"},"region":{"startLine":1909}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c13752c3458b499e7212f780587a73e1d4ee01e7734aafc24b4d9753066590c"}},{"ruleId":"D2","level":"warning","message":{"text":"DbInterner::unsizing_params_for_adt (cognitive 16): DbInterner::unsizing_params_for_adt has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (6 pts), match/switch 4 (6 pts), loops 3 (4 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/next_solver/interner.rs"},"region":{"startLine":1701}}}],"partialFingerprints":{"codehealthFindingId/v1":"2724db25ec4e2e8226769200e0b58d73866042d23d3320bef36c4656c48b10ab"}},{"ruleId":"D2","level":"warning","message":{"text":"hir_ty::consteval::literal_ty (cognitive 16): hir_ty::consteval::literal_ty has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 7 (16 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/tools/rust-analyzer/crates/hir-ty/src/consteval.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb7ac5cb10fc04282b6c564bb6e55509034a67ec132a321709f07486bdcb0cab"}},{"ruleId":"D2","level":"warning","message":{"text":"ide::inlay_hints::hints (cognitive 16): ide::inlay_hints::hints has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 5 (9 pts), if/else 3 (7 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/tools/rust-analyzer/crates/ide/src/inlay_hints.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb603d96f56bff6c9eeee71d23f17729cad7fffa207738902c1cc320dfc1f2e4"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_assists::handlers::convert_bool_to_enum::find_bool_node (cognitive 16): ide_assists::handlers::convert_bool_to_enum::find_bool_node has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (14 pts), match/switch 1 (2 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/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_bool_to_enum.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c31c08076c37ee62540eacf5df973b3d36b41d68e39c5e1dfaf9ec76a9a4274"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_assists::handlers::generate_documentation_template::make_example_for_fn (cognitive 16): ide_assists::handlers::generate_documentation_template::make_example_for_fn has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 2, loops 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_documentation_template.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"1465e770856367de8296abb9ae988c7ff10b523ea789e7b93e9fd9afd71d39cd"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_assists::handlers::generate_fn_type_alias::generate_fn_type_alias (cognitive 16): ide_assists::handlers::generate_fn_type_alias::generate_fn_type_alias has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (12 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_fn_type_alias.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"f93abb7ee84471ae871571b533acdc90732c9f923d6e09a459063385afc66680"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_assists::handlers::promote_local_to_const::promote_local_to_const (cognitive 16): ide_assists::handlers::promote_local_to_const::promote_local_to_const has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 1 (2 pts), boolean chains 1, 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":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/promote_local_to_const.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6a77aab684e839d9585d1e53b1e36a6e8f927f6760adce5d3f95935286f0916"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_assists::handlers::wrap_unwrap_cfg_attr::wrap_derive (cognitive 16): ide_assists::handlers::wrap_unwrap_cfg_attr::wrap_derive has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 3, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/wrap_unwrap_cfg_attr.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7bc80e7601e9b718a09b03140bad12153547a4c2d4d5aebf954e36295fff179"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_completion::completions::expr::complete_expr (cognitive 16): ide_completion::completions::expr::complete_expr has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (6 pts), loops 2 (6 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-completion/src/completions/expr.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"82414bfe3c60c1ace5af7ee515d1003393ceaf1c02bcf5f907c7e25698970ff5"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_completion::completions::fn_param::fill_fn_params (cognitive 16): ide_completion::completions::fn_param::fill_fn_params has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 4 (9 pts), if/else 4 (5 pts), boolean chains 1, loops 1 (nesting depth added 6). 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/tools/rust-analyzer/crates/ide-completion/src/completions/fn_param.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c3d1a984096e29e45c6b35e211ed2d158c0f50e4ac2fe1228099c2423c39d54"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_completion::completions::item_list::trait_impl::add_type_alias_impl (cognitive 16): ide_completion::completions::item_list::trait_impl::add_type_alias_impl has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), match/switch 2 (6 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/tools/rust-analyzer/crates/ide-completion/src/completions/item_list/trait_impl.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"f836f6a56b3ced05d456215da0732b67ead946027c2636cf73e161c7a88c6919"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_db::rename::rename_field_constructors (cognitive 16): ide_db::rename::rename_field_constructors has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8, loops 5 (7 pts), boolean chains 1 (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":"src/tools/rust-analyzer/crates/ide-db/src/rename.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"00fc737ee55a071db464fb6ccf85d9ba6eb2737776694489f481434727c56292"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_db::syntax_helpers::node_ext::for_each_tail_expr (cognitive 16): ide_db::syntax_helpers::node_ext::for_each_tail_expr has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (7 pts), match/switch 3 (6 pts), loops 1 (2 pts), boolean chains 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/tools/rust-analyzer/crates/ide-db/src/syntax_helpers/node_ext.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"181bf451f3462183e2ccf5528bcb40165a87e57abbc3c690eef47f4dd9f96aa1"}},{"ruleId":"D2","level":"warning","message":{"text":"MatchFinder::output_debug_for_nodes_at_range (cognitive 16): MatchFinder::output_debug_for_nodes_at_range has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-ssr/src/lib.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6b6e0d11c3ae1b631030f803ae88cfd79753c8cef2da1760de618d979adea77"}},{"ruleId":"D2","level":"warning","message":{"text":"SourceRootConfig::source_root_parent_map (cognitive 16): SourceRootConfig::source_root_parent_map has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 7). Of this number, 14 points are the body\u0027s own statements and 2 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/tools/rust-analyzer/crates/load-cargo/src/lib.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"27eb1019231d0cb1814c8f8d80019068d00086fc177b849dd86a02599653fafe"}},{"ruleId":"D2","level":"warning","message":{"text":"mbe::expander::expand_rules (cognitive 16): mbe::expander::expand_rules has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/mbe/src/expander.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1ba8baf0f28ce1a82b4de693db869fcd213138904445df473920c6cf06d9bf4"}},{"ruleId":"D2","level":"warning","message":{"text":"mbe::expander::matcher::match_meta_var (cognitive 16): mbe::expander::matcher::match_meta_var has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (7 pts), match/switch 4 (7 pts), boolean chains 2 (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/tools/rust-analyzer/crates/mbe/src/expander/matcher.rs"},"region":{"startLine":775}}}],"partialFingerprints":{"codehealthFindingId/v1":"97960bc364dc843ba55c43308cb508306418352f65d8bd6aeddf4b529687667d"}},{"ruleId":"D2","level":"warning","message":{"text":"parser::grammar::expressions::stmt (cognitive 16): parser::grammar::expressions::stmt has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (8 pts), boolean chains 5, match/switch 2 (3 pts) (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/parser/src/grammar/expressions.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"8341af710febc68e867487fb567d468279484edb164f05447eb2530dbe55cbc9"}},{"ruleId":"D2","level":"warning","message":{"text":"parser::grammar::patterns::pattern_single_r (cognitive 16): parser::grammar::patterns::pattern_single_r has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 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/tools/rust-analyzer/crates/parser/src/grammar/patterns.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a159e94071cba3aa7e7b1a21a4c2f7ec176b6f73e96efcbcac527730c0bdfa5"}},{"ruleId":"D2","level":"warning","message":{"text":"FetchMetadata::exec (cognitive 16): FetchMetadata::exec has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/project-model/src/cargo_workspace.rs"},"region":{"startLine":739}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c1b2dd21ad21757be13d6f25f54385cebec025210b4dd2881fcaed5b88c4057"}},{"ruleId":"D2","level":"warning","message":{"text":"LsifManager::add_token (cognitive 16): LsifManager::add_token has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 1 (2 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/tools/rust-analyzer/crates/rust-analyzer/src/cli/lsif.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c80da59650cb764452f680a93d90e1e9597b8f5f9bf91c6d7e712e19d55a660"}},{"ruleId":"D2","level":"warning","message":{"text":"rust_analyzer::session::run_session (cognitive 16): rust_analyzer::session::run_session has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), match/switch 4, boolean chains 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/session.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"315b07c54b18378da1fc2abc15a59dcab4d4eab1d49529d1caf00502fa01a75f"}},{"ruleId":"D2","level":"warning","message":{"text":"syntax::ast::prec::precedence (cognitive 16): syntax::ast::prec::precedence has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 6 (16 pts) (nesting depth added 10). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/syntax/src/ast/prec.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3181bdab0deabd3f72f217d56b0d92e4824915fbfccdede5021954f5045e567"}},{"ruleId":"D2","level":"warning","message":{"text":"syntax::parsing::reparsing::reparse_token (cognitive 16): syntax::parsing::reparsing::reparse_token has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (12 pts), boolean chains 3, 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/tools/rust-analyzer/crates/syntax/src/parsing/reparsing.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7466f816e8c18d6780dc3056ca71d5fafd9b7d273eeea998af6278b5c14b407"}},{"ruleId":"D2","level":"warning","message":{"text":"line_index::analyze_source_file_sse2 (cognitive 16): line_index::analyze_source_file_sse2 has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 2 (5 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/lib/line-index/src/lib.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"81eea57f322c08c64e7a3007268fd8d26cccbe9ae62c35989c85766f79f2f1fd"}},{"ruleId":"D2","level":"warning","message":{"text":"xtask::tidy::check_cargo_toml (cognitive 16): xtask::tidy::check_cargo_toml has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (13 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/xtask/src/tidy.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc64a737dca1f1d980e91a382f27c16bd8db8a85b8c92e7cf93d0f5c36c854a9"}},{"ruleId":"D2","level":"warning","message":{"text":"SilentOnIgnoredFilesEmitter::emit_diagnostic (cognitive 16): SilentOnIgnoredFilesEmitter::emit_diagnostic has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (16 pts) (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/parse/session.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"a96f5f0071a920cb7ae0b2949fc56c4eb695096870e03f77d1b37a15daecafb6"}},{"ruleId":"D2","level":"warning","message":{"text":"FmtVisitor::process_missing_code (cognitive 16): FmtVisitor::process_missing_code has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/missed_spans.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"4306e6a05e6b8bfd1b82d3cf1d13672ec6ad4055ade297706f827751a9aa85d4"}},{"ruleId":"D2","level":"warning","message":{"text":"rustfmt_nightly::cargo-fmt::main::execute (cognitive 16): rustfmt_nightly::cargo-fmt::main::execute has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 1, match/switch 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/cargo-fmt/main.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf518df4a9efc8ec7c70f616b971b3951f55c2c6e758818da5ab6ba11d5a208f"}},{"ruleId":"D2","level":"warning","message":{"text":"rustfmt_nightly::items::rewrite_struct_field (cognitive 16): rustfmt_nightly::items::rewrite_struct_field has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 3, loops 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/items.rs"},"region":{"startLine":1943}}}],"partialFingerprints":{"codehealthFindingId/v1":"8242e27004daf0843fb4daa983265c51e05530dab42a4365d13256a890a879ce"}},{"ruleId":"D2","level":"warning","message":{"text":"rustfmt_nightly::pairs::rewrite_pairs_multiline (cognitive 16): rustfmt_nightly::pairs::rewrite_pairs_multiline has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (12 pts), match/switch 2 (3 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/pairs.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9c6a4c4e0734e89152de1cad4236af8956deb2166c25d42746de741cf310e11"}},{"ruleId":"D2","level":"warning","message":{"text":"tidy::extra_checks::check_cpp_fmt (cognitive 16): tidy::extra_checks::check_cpp_fmt has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 1 (2 pts), match/switch 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/tools/tidy/src/extra_checks/mod.rs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9ab878eb51f1970cde2adcc3617122d8acd0d875f0b82784982acf38d1f9f8c"}},{"ruleId":"D2","level":"warning","message":{"text":"bootstrap.get (cognitive 16): bootstrap.get has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (16 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/bootstrap/bootstrap.py"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"9912762799cf0093ff879578a0efd8f6d586c8aa80ef385bbb4d5733bc2e7ae6"}},{"ruleId":"D2","level":"warning","message":{"text":"android-sdk-manager.fetch_repository (cognitive 16): android-sdk-manager.fetch_repository has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 3 (7 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ci/docker/scripts/android-sdk-manager.py"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cd7db8901458b7a95ddb15a9e92c9a902709e420685e05135ba242b2d1f914e"}},{"ruleId":"D2","level":"warning","message":{"text":"check_lldb.type_matches (cognitive 16): check_lldb.type_matches has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), ternaries 2 (4 pts), boolean chains 2, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/etc/debugger_tester/lldb/check_lldb.py"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"35425403bd145b35dd394a025dd25febc3cc2655018af49f000a0c12467bf569"}},{"ruleId":"D2","level":"warning","message":{"text":"DocSearch.execQuery::unifyFunctionTypeCheckBindings (cognitive 16): DocSearch.execQuery::unifyFunctionTypeCheckBindings has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 7 other methods here (DocSearch.execQuery::buildHrefAndPath, DocSearch.execQuery::formatDisplayTypeSignature::writeFn, DocSearch.execQuery::transformResults, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":3669}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1f4cc75af2f22bd10afb7db341689a01dadf165fae130117e9d0bea422142eb"}},{"ruleId":"D2","level":"warning","message":{"text":"search.initSearch::unifyFunctionTypeCheckBindings (cognitive 16): search.initSearch::unifyFunctionTypeCheckBindings has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 15 other methods here (search.initSearch, search.initSearch::getItemsBefore, search.initSearch::getNextElem, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 16 times rather than 16 independent problems. Splitting this body alone leaves the other 15 exactly as they are. Where these are variations on one operation, the change that clears all 16 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":3669}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2d74b4bc4dc6390942a37e42eabb91e8cdcc2a9edc8868fa68f34bf13dbafe4"}},{"ruleId":"D2","level":"warning","message":{"text":"settings.changeSetting (cognitive 16): settings.changeSetting has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), ternaries 1 (2 pts), 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/librustdoc/html/static/js/settings.js"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7934430202137c7adc678eff4afc31f6430a9d587ea22888778c1e22d176c7e"}},{"ruleId":"D2","level":"warning","message":{"text":"PrefixTrie.children (cognitive 16): PrefixTrie.children has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/stringdex.js"},"region":{"startLine":2180}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b3b38a510a8a45bb8e2e061249b964d420d000964fa85d21e02a54138f31a6e"}},{"ruleId":"D2","level":"warning","message":{"text":"stringdex.loadDatabase::loadColumnFromBytes (cognitive 16): stringdex.loadDatabase::loadColumnFromBytes has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 2 (6 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (stringdex.loadDatabase) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/stringdex.js"},"region":{"startLine":2968}}}],"partialFingerprints":{"codehealthFindingId/v1":"b66396bb266e315a9e7ba2720ac84fc731161a7d8fe508048099efff8ee407f4"}},{"ruleId":"D2","level":"warning","message":{"text":"initSearch::execQuery::unifyFunctionTypeCheckBindings (cognitive 16): initSearch::execQuery::unifyFunctionTypeCheckBindings has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":3669}}}],"partialFingerprints":{"codehealthFindingId/v1":"55accfd8a2cf7e5701d6395236747a175d1292185fb1baef6ebe4decd91b51e7"}},{"ruleId":"D2","level":"warning","message":{"text":"loadDatabase::searchTreeLoadByNodeID (cognitive 16): loadDatabase::searchTreeLoadByNodeID has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), ternaries 2 (6 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/librustdoc/html/static/js/stringdex.js"},"region":{"startLine":1196}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe5c8cd82b21dda69d2cd63398166d62e7b97d1b525b61bab8e9330da0407523"}},{"ruleId":"D2","level":"warning","message":{"text":"loadDatabase::children (cognitive 16): loadDatabase::children has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/stringdex.js"},"region":{"startLine":2180}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2cb178d63b245d7147d56ab05d4a309582987938c6c87acaad0066f797a97af"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: x86/avx512f.rs: FileTooLong \u2014 27565 significant 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 2609 free functions. The bar is 500 significant lines; this is 27065 over it, 55.13\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":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a483470a494e3e0b241e8bbf65ea510ebb24bc4f5688426a90376ad1c1ea3c99"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: FnCtxt: TooManyMethods \u2014 492 methods, declared across 27 files: src/expr.rs (67), src/pat.rs (62), fn_ctxt/_impl.rs (54), fn_ctxt/suggestions.rs (50), \u002B23 more file(s). The bar is 30 methods; this is 462 over it, 16.40\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":"compiler/rustc_hir_typeck/src/fn_ctxt/mod.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"0572becd6df362f7ce7ddd9b54bcf492da1bcb6c7538608d1758f01652128f30"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: x86/avx512fp16.rs: FileTooLong \u2014 8189 significant 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 923 free functions. The bar is 500 significant lines; this is 7689 over it, 16.38\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":"library/stdarch/crates/core_arch/src/x86/avx512fp16.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf18e42bf40678e17da6e2c8c8012fba7cc01db8f50bdf930f07766a2b1b2554"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Parser: TooManyMethods \u2014 482 methods, declared across 14 files: parser/expr.rs (132), parser/item.rs (80), parser/diagnostics.rs (72), parser/ty.rs (51), \u002B10 more file(s). The bar is 30 methods; this is 452 over it, 16.07\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":"compiler/rustc_parse_format/src/lib.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"ace6d23696c77f09ea08de78f87852b18898466da105f42dc993ceea029236f4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DocSearch.execQuery: MethodTooLong \u2014 execQuery runs 1597 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1497 over it, 15.97\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":2189}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea64961cec1d09aa9d27d7d16f8a92b5ab27d1adb1a0b964dd3eef8583833147"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: stringdex.loadDatabase: FunctionTooLong \u2014 loadDatabase runs 1576 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1476 over it, 15.76\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/stringdex.js"},"region":{"startLine":1089}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f223aae74cb6914ef44828b30ac7c09cbc67596bdaff39a1b0f02511d70e1a9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: x86/avx512bw.rs: FileTooLong \u2014 7569 significant 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 826 free functions. The bar is 500 significant lines; this is 7069 over it, 15.14\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512bw.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"49ac80f3ee91517d8e00c46c245163a9e5566dab397dbcd24e830e4d268f2391"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustc_codegen_gcc::intrinsic::simd::generic_simd_intrinsic: FunctionTooLong \u2014 rustc_codegen_gcc::intrinsic::simd::generic_simd_intrinsic runs 1161 significant 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 1061 over it, 11.61\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_gcc/src/intrinsic/simd.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"4373c828b7aab03bf3454b4b59dbd440c514519ab4c7a2105751aec0846db993"}},{"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/tools/miri/src/shims/unix/foreign_items.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"19d73c811e08b67823c9487b9a9b987c44dd17e4db6556a7f22b8cbd28dc6480"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: LoweringContext: TooManyMethods \u2014 283 methods, declared across 12 files: src/lib.rs (94), src/expr.rs (74), src/item.rs (50), src/pat.rs (15), \u002B8 more file(s). The bar is 30 methods; this is 253 over it, 9.43\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":"compiler/rustc_ast_lowering/src/lib.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"652a58484c0adf07b6844d7e4f5e4d0973a443c87572b237f93e1329564ff807"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustc_codegen_llvm::intrinsic::generic_simd_intrinsic: FunctionTooLong \u2014 rustc_codegen_llvm::intrinsic::generic_simd_intrinsic runs 937 significant 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 837 over it, 9.37\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/intrinsic.rs"},"region":{"startLine":1979}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b4a95b0f6ed26e6f35e1b53430810f64037d5539910a4f0d8a9f7e5ee927ca5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Config.parse_inner: MethodTooLong \u2014 parse_inner runs 933 significant 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 833 over it, 9.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/bootstrap/src/core/config/config.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"db1d7677b9daf07d364b10ae3ea6ca1f624dc3602e4dc8aaafefb56ddd31cafa"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mips/msa.rs: FileTooLong \u2014 4517 significant 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 527 free functions. The bar is 500 significant lines; this is 4017 over it, 9.03\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/mips/msa.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f93e7d65aa915346de11abf5263bce6054c568a55c014710bf67fd44e75f865"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustc_codegen_cranelift::intrinsics::llvm_x86::codegen_x86_llvm_intrinsic_call: FunctionTooLong \u2014 rustc_codegen_cranelift::intrinsics::llvm_x86::codegen_x86_llvm_intrinsic_call runs 901 significant 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 801 over it, 9.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/src/intrinsics/llvm_x86.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c68dfdd93109f3d2e0f7fbaee3b3345c725a1c0a330df58b813c9bfdf5f9a51"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustc_codegen_cranelift::intrinsics::codegen_regular_intrinsic_call: FunctionTooLong \u2014 rustc_codegen_cranelift::intrinsics::codegen_regular_intrinsic_call runs 856 significant 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 756 over it, 8.56\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":"compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e552b15e5608a5b2b2c49ec305f123ed3b891192c4ee126dc5ec71c522be366"}},{"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/tools/miri/src/shims/windows/foreign_items.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"9877debf11388d8f68e06fc5cdfeebb6107b67b0115aa9d4895f7815684a122c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: InterpCx: TooManyMethods \u2014 245 methods, declared across 20 files: interpret/memory.rs (51), interpret/eval_context.rs (28), interpret/place.rs (28), interpret/intrinsics.rs (25), \u002B16 more file(s). The bar is 30 methods; this is 215 over it, 8.17\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_const_eval/src/interpret/eval_context.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"3214d7354c029f9a2cbbc9a8d6a7e1f2d4ae81ad1459a56e849e6574ea8f573d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: s390x/vector.rs: FileTooLong \u2014 4027 significant 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 3527 over it, 8.05\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/s390x/vector.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c946c4b1c1cf26caa721ab316a1d6a122322d8e3eae4f1c689f244c340bc6af"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustc_codegen_cranelift::intrinsics::llvm_aarch64::codegen_aarch64_llvm_intrinsic_call: FunctionTooLong \u2014 rustc_codegen_cranelift::intrinsics::llvm_aarch64::codegen_aarch64_llvm_intrinsic_call runs 788 significant 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 688 over it, 7.88\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/src/intrinsics/llvm_aarch64.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"31c2bd744a1f10be24850d7db4ca3aeabfd607fe7ef50b334d9b0ccf59cd8954"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: LateResolutionVisitor: ClassTooLong \u2014 3147 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 144 methods, 5 blocks, lines 845-5942. The bar is 400 significant lines; this is 2747 over it, 7.87\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":"compiler/rustc_resolve/src/late.rs"},"region":{"startLine":845}}}],"partialFingerprints":{"codehealthFindingId/v1":"821e14cc504383619acd38190e4098fd839608de6751ac18b54705df88b9e79c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustc_codegen_cranelift::intrinsics::simd::codegen_simd_intrinsic_call: FunctionTooLong \u2014 rustc_codegen_cranelift::intrinsics::simd::codegen_simd_intrinsic_call runs 763 significant 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 663 over it, 7.63\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e888cf2f42e9552a070bcd8c671bac299607a014629ed1c3f494667762741c5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: x86/avx512dq.rs: FileTooLong \u2014 3769 significant 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 399 free functions. The bar is 500 significant lines; this is 3269 over it, 7.54\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512dq.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"57f5c645b11b5521b3473ee8a760ef76c3206e2de05eefc89ef4b0aae8fdf68c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/late.rs: FileTooLong \u2014 3725 significant 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 84% of them inside a single declaration: LateResolutionVisitor (5 blocks, 845-5942). The bar is 500 significant lines; this is 3225 over it, 7.45\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":"compiler/rustc_resolve/src/late.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad03952807c9737ecd68831ecedabd957164edc3b93b8dc79ab4bf416f7b18c6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/diagnostics.rs: FileTooLong \u2014 3585 significant 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 3085 over it, 7.17\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":"compiler/rustc_parse/src/diagnostics.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a3f42cd1a5eb930b1b983a9ee3d3a2665336190a14b7adfc88ede893a6ca2b2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: method/suggest.rs: FileTooLong \u2014 3530 significant 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 96% of them inside a single declaration: FnCtxt (98-4974). The bar is 500 significant lines; this is 3030 over it, 7.06\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":"compiler/rustc_hir_typeck/src/method/suggest.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b56b128ca1d1b1c3fec4d2b62ad65d3505545c2bc8e6565af704806440f44b7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: c/windows_sys.rs: FileTooLong \u2014 3501 significant 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 3001 over it, 7.00\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":"library/std/src/sys/pal/windows/c/windows_sys.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"31acf448fd8674c9c68c3e14423f23cd6d6e1d9f0c941e9663b89dad8685e085"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: InferenceContext: TooManyMethods \u2014 208 methods, declared across 15 files: src/infer.rs (56), infer/pat.rs (36), infer/expr.rs (33), infer/closure.rs (19), \u002B11 more file(s). The bar is 30 methods; this is 178 over it, 6.93\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/tools/rust-analyzer/crates/hir-ty/src/infer.rs"},"region":{"startLine":1340}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2c4ccb493921c89b0c017dd3b027853a0c31e602ea264ea07c07e6248ab50ec"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: late/diagnostics.rs: FileTooLong \u2014 3415 significant 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 93% of them inside a single declaration: LateResolutionVisitor (193-4999). The bar is 500 significant lines; this is 2915 over it, 6.83\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/late/diagnostics.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aff7106038f40cccc7af3439e61bdd7063a179efca425e838640ce71e8ea18c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MirLowerCtx.lower_expr_to_place_without_adjust: MethodTooLong \u2014 lower_expr_to_place_without_adjust runs 681 significant 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 581 over it, 6.81\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/mir/lower.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c5e24b9fe14cb00ca0b695f57011ab5de8fbf28bf89057a0bb8d9be388f8511"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: core_arch::s390x::vector: TooManyFunctions \u2014 200 free functions. The bar is 30 free functions; this is 170 over it, 6.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":"library/stdarch/crates/core_arch/src/s390x/vector.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"8381497c22b9ce0e6fc24f437fad2b6a9794704854b1a640b9ad86079d670cb4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: js/search.js: FileTooLong \u2014 3330 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units), about 99% of them inside a single declaration: initSearch (12-5608). The bar is 500 significant lines; this is 2830 over it, 6.66\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/librustdoc/html/static/js/search.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5253efb3d2e57a84e5b9987b4369be9a80c4639b004ae939aff78b013165cf53"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: core_arch::powerpc::altivec::sealed: TooManyFunctions \u2014 198 free functions. The bar is 30 free functions; this is 168 over it, 6.60\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":"library/stdarch/crates/core_arch/src/powerpc/altivec.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"872d516db86b3561021b978191b8a07a2f653fd9a9c05d8ba9a5d766f59576b0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Evaluator.exec_intrinsic: MethodTooLong \u2014 exec_intrinsic runs 654 significant 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 554 over it, 6.54\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/tools/rust-analyzer/crates/hir-ty/src/mir/eval/shim.rs"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5f6812bd2cf644e4c7a8bf069054929f8db2cc0ead50e96ec71148915f008ad"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Config: TooManyFields \u2014 196 stored fields beside 64 methods. The bar is 30 stored fields; this is 166 over it, 6.53\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/bootstrap/src/core/config/config.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b9db48756d3bc82e18f049a34664f5dda1170138b1ee414b464b976a31b208c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: powerpc/altivec.rs: FileTooLong \u2014 3160 significant 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 2660 over it, 6.32\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":"library/stdarch/crates/core_arch/src/powerpc/altivec.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0bc588579e797dda73bb6b251e9396c4cc794db39ddf94c320a96d16e3cba98"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ThirBuildCx.make_mirror_unadjusted: MethodTooLong \u2014 make_mirror_unadjusted runs 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) in one body. The bar is 100 significant lines; this is 493 over it, 5.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":"compiler/rustc_mir_build/src/thir/cx/expr.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8d99e48bb36d32e502f7983ac5029cd50f562012b19fc9907ef1e1120a3a732"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: InferCtxt: TooManyMethods \u2014 175 methods, declared across 21 files: infer/mod.rs (84), outlives/obligations.rs (16), infer/at.rs (10), snapshot/mod.rs (10), \u002B17 more file(s). The bar is 30 methods; this is 145 over it, 5.83\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_infer/src/infer/mod.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"15a7899e448a3e73d712da00a7ec2e7aaaf638ba979a01567d57423f297f0527"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Builder.expr_into_dest: MethodTooLong \u2014 expr_into_dest runs 579 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 479 over it, 5.79\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_build/src/builder/expr/into.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3d13408d2e28d194237d6fbe17f01433dc4f8036ba87372800f3cdd56f3cc97"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: diagnostics/impls.rs: FileTooLong \u2014 2884 significant 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 2384 over it, 5.77\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/diagnostics/impls.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fcceaed26d45274976ad3926f27b23d3665144b1034b88c6492d0d8bfd822a9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/hir.rs: FileTooLong \u2014 2852 significant 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 2352 over it, 5.70\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":"compiler/rustc_hir/src/hir.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b586ebff4e4f00cddc49a61acad96a718dfbc305a9ea1ffa5fd0c5920f398cca"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: traits/fulfillment_errors.rs: FileTooLong \u2014 2843 significant 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 2343 over it, 5.69\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/error_reporting/traits/fulfillment_errors.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"102cd24af7b80a80a1d3af2fede6e0f6a9a401e784c264d07d44eba35abf0fdc"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ide_completion::context::analysis::classify_name_ref: FunctionTooLong \u2014 ide_completion::context::analysis::classify_name_ref runs 565 significant 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 465 over it, 5.65\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-completion/src/context/analysis.rs"},"region":{"startLine":967}}}],"partialFingerprints":{"codehealthFindingId/v1":"864c4efc4f889792ff7457fb727cb293b586c67e740b22dd09cd9af896092b51"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Ty: TooManyMethods \u2014 168 methods, declared across 5 files: ty/sty.rs (140), ty/util.rs (19), inhabitedness/mod.rs (4), ty/diagnostics.rs (3), \u002B1 more file(s). The bar is 30 methods; this is 138 over it, 5.60\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. Most of these members implement ty.Ty (168 of 168 members), so moving them onto a smaller type would remove them from that contract rather than reduce it. To reduce it, split the contract instead: give each cohesive group of operations its own smaller interface and its own implementing type. Where the contract has to stay whole, move the work behind these members into collaborator types, so what is left here is a forward per member rather than a responsibility per member."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/ty/mod.rs"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"64b83e3700948b538adb73d315c9e677c48d7ca7707c57d65745f10f93d93cd4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: InterpCx.eval_simd_intrinsic: MethodTooLong \u2014 eval_simd_intrinsic runs 557 significant 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 457 over it, 5.57\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_const_eval/src/interpret/intrinsics/simd.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"69bf042e1f0dfa772f0ea08b3a907465934d2113106ba63ea08aef98a541e32f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: js/stringdex.js: FileTooLong \u2014 2776 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 500 significant lines; this is 2276 over it, 5.55\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/librustdoc/html/static/js/stringdex.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"53bb3294d6828a2559820983720363fb4e5e3bec7b89bb266e4feec674b0dd05"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustc_codegen_gcc::intrinsic::llvm::adjust_intrinsic_arguments: FunctionTooLong \u2014 rustc_codegen_gcc::intrinsic::llvm::adjust_intrinsic_arguments runs 547 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 447 over it, 5.47\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":"compiler/rustc_codegen_gcc/src/intrinsic/llvm.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7d46aa5f04416c23fdac9d865fbae741062874a480a23b625df4c2f57a26da7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: parser/expr.rs: FileTooLong \u2014 2722 significant 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 2222 over it, 5.44\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":"compiler/rustc_parse/src/parser/expr.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"367fb6e1641ffe066e9fa9856443e0b71f22f73f40d421b941d0f5294946f79b"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ExprCollector: ClassTooLong \u2014 2147 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 113 methods, 3 blocks, lines 508-3766. The bar is 400 significant lines; this is 1747 over it, 5.37\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/expr_store/lower.rs"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"33a38ea6710f28d12d11e1aa2e0f8366b1ceb338c46a9216b853f5d1821d3835"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Methods.check_methods: MethodTooLong \u2014 check_methods runs 536 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 436 over it, 5.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/tools/clippy/clippy_lints/src/methods/mod.rs"},"region":{"startLine":5437}}}],"partialFingerprints":{"codehealthFindingId/v1":"53c7b75fdaf84e549e2f2b063bba950c3e4184792212648dbf9a6602d5a76fce"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: expr_store/lower.rs: FileTooLong \u2014 2645 significant 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: ExprCollector (3 blocks, 508-3766). The bar is 500 significant lines; this is 2145 over it, 5.29\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/tools/rust-analyzer/crates/hir-def/src/expr_store/lower.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0968396da49cc6663758b62cbe6b1bc0fa3631b3741163015b0b8a2824df9b85"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Builder.codegen_intrinsic_call: MethodTooLong \u2014 codegen_intrinsic_call runs 526 significant 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 426 over it, 5.26\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/intrinsic.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"7736e7a389f0d58e9e0cc5845df4aac464ae02deded209b9aa835d7cb5df0c88"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/items.rs: FileTooLong \u2014 2627 significant 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 49 free functions. The bar is 500 significant lines; this is 2127 over it, 5.25\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/items.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c961e28457f48dabff589b2d4cd09a87f0daf82ce87046a3ecd43909045eb65"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SyntaxFactory: TooManyMethods \u2014 157 methods, declared across 2 files: syntax_factory/constructors.rs (153), ast/syntax_factory.rs (4). The bar is 30 methods; this is 127 over it, 5.23\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/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"06034b92c2d1448d583108862d6e5e8c4962439777f86fbddd9b5e19e880b763"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/expr.rs: FileTooLong \u2014 2550 significant 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 2050 over it, 5.10\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/expr.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"be01d8c3b10fd9a2cccb9c071271040a6b922edd0a1676d3d99e13ad66235118"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: fn_ctxt/suggestions.rs: FileTooLong \u2014 2548 significant 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 2048 over it, 5.10\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/fn_ctxt/suggestions.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5674b019d28de623df0809069ea5e31e030c8650ae2afe96b56ae15274926447"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Evaluator: ClassTooLong \u2014 2036 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 69 methods, 2 blocks, lines 166-3070. The bar is 400 significant lines; this is 1636 over it, 5.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/tools/rust-analyzer/crates/hir-ty/src/mir/eval.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1b8d13406660c79398b3ec1b3d064fc0c4930b49ab4768e5da4fe4952714d95"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: MirBorrowckCtxt: TooManyMethods \u2014 151 methods, declared across 11 files: diagnostics/mod.rs (28), src/lib.rs (26), src/borrowck_errors.rs (24), diagnostics/move_errors.rs (21), \u002B7 more file(s). The bar is 30 methods; this is 121 over it, 5.03\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/lib.rs"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"d92ce3fd4a3aa65d16117786a2d0a8faccabec9a916e8583d06471c779e5d4bb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mir/eval.rs: FileTooLong \u2014 2498 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 82% of them inside a single declaration: Evaluator (2 blocks, 166-3070). The bar is 500 significant lines; this is 1998 over it, 5.00\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/tools/rust-analyzer/crates/hir-ty/src/mir/eval.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccde9228d8ee24cd7e454d673423d06dbf0d745ddda95c3c62da8e1f5703ee49"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: wasm32/simd128.rs: FileTooLong \u2014 2471 significant 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 258 free functions. The bar is 500 significant lines; this is 1971 over it, 4.94\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/wasm32/simd128.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"658e53f6b38043dc81e3b15360142168a3d05e34a4b18637f6794178c24b9843"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustdoc::html::render::search_index::build_index: FunctionTooLong \u2014 rustdoc::html::render::search_index::build_index runs 494 significant 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 394 over it, 4.94\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/librustdoc/html/render/search_index.rs"},"region":{"startLine":1267}}}],"partialFingerprints":{"codehealthFindingId/v1":"47d23ba2a07ff52c35cefefa06ed69749e998f5c4d373fb3d9c89be7dea3113e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: hir_ty_lowering/mod.rs: FileTooLong \u2014 2448 significant 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 1948 over it, 4.90\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":"compiler/rustc_hir_analysis/src/hir_ty_lowering/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"85db4e60f46cc7b173a773b4e396e659a05ebad76215ce3c9e6785f53dc5264a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/ast.rs: FileTooLong \u2014 2428 significant 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 1928 over it, 4.86\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ast/src/ast.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c1cf161955cf8fb55ee5666757fef17db7313757872130d840994c1a1ccd7f3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/config.rs: FileTooLong \u2014 2416 significant 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 1916 over it, 4.83\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/config.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cdea878c704610da5232292a4ff3683a22f0b99ef1c2e83f77d1761194dcbc7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/diagnostics.rs: FileTooLong \u2014 2404 significant 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 1904 over it, 4.81\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_lint/src/diagnostics.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa648a6dd818983faf14cce442b570cb4b4fa8b70247d2cd380f55ba1d3ba446"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: LateResolutionVisitor: TooManyMethods \u2014 144 methods, declared across 3 files: src/late.rs (86), late/diagnostics.rs (56), late/lang_items.rs (2). The bar is 30 methods; this is 114 over it, 4.80\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/late.rs"},"region":{"startLine":845}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd4678f5bfa5d9cf97f8cb1bd9f704bfcb6786faf76d9b2463e45b4a2d86df90"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: core_arch::s390x::vector::sealed: TooManyFunctions \u2014 143 free functions. The bar is 30 free functions; this is 113 over it, 4.77\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":"library/stdarch/crates/core_arch/src/s390x/vector.rs"},"region":{"startLine":862}}}],"partialFingerprints":{"codehealthFindingId/v1":"b14561bc64e187604ba21cf7c5572e4f93025a0e176e97850f52121d0947d03d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: fn_ctxt/checks.rs: FileTooLong \u2014 2357 significant 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 1857 over it, 4.71\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":"compiler/rustc_hir_typeck/src/fn_ctxt/checks.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c14b40cea5c15a2d85b6b1e7b989cdfc3bc0d99f92bc64b65988535e949928d8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypeChecker.visit_rvalue: MethodTooLong \u2014 visit_rvalue runs 471 significant 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 371 over it, 4.71\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/type_check/mod.rs"},"region":{"startLine":992}}}],"partialFingerprints":{"codehealthFindingId/v1":"009d993c69150b27627f9948f9ebe6bd022202e97cdc76d8e45fc6c9ec12c488"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: libm_test::builtins_wrapper: TooManyFunctions \u2014 141 free functions. The bar is 30 free functions; this is 111 over it, 4.70\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":"library/compiler-builtins/libm-test/src/builtins_wrapper.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"897618dd682fb936ac0b69b396edaa983dfa9c4845f441c613734a387157f774"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustdoc::opts: FunctionTooLong \u2014 rustdoc::opts runs 469 significant 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 369 over it, 4.69\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/lib.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"d57cea2aa7953324199f00a5b46bf55ffca23512a293aca0695c0b27d5f4bc10"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SemanticsImpl: TooManyMethods \u2014 139 methods. The bar is 30 methods; this is 109 over it, 4.63\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/tools/rust-analyzer/crates/hir/src/semantics.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a25a93a7865abea56f40df2eaaa61befc7dfd49e61aace917b9f6f321f96bf7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: clean/mod.rs: FileTooLong \u2014 2311 significant 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 78 free functions. The bar is 500 significant lines; this is 1811 over it, 4.62\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/clean/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fca959ad13ce4e961b5d4a635679757d4297ebe38660e887c962d2fbe8591a50"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TypeErrCtxt: TooManyMethods \u2014 138 methods, declared across 11 files: traits/fulfillment_errors.rs (51), infer/mod.rs (31), infer/suggest.rs (16), infer/region.rs (11), \u002B7 more file(s). The bar is 30 methods; this is 108 over it, 4.60\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":"compiler/rustc_trait_selection/src/error_reporting/mod.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"2433e7e8012252f45137eec3a86e0df52cbeaec67222e3d1f0b5ca33511677ae"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: back/link.rs: FileTooLong \u2014 2298 significant 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 67 free functions. The bar is 500 significant lines; this is 1798 over it, 4.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":"compiler/rustc_codegen_ssa/src/back/link.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"77fbd19b955023aff5fd96240e2d1ba24d57cb2fd2cdaf90ca19d15996bd9184"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/intrinsic.rs: FileTooLong \u2014 2291 significant 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 1791 over it, 4.58\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/intrinsic.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7731667ab18f5187dd36a20319f7040607bc1d44a608055074f9a29f55cd1678"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FnCtxt.suggest_traits_to_import: MethodTooLong \u2014 suggest_traits_to_import runs 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) in one body. The bar is 100 significant lines; this is 353 over it, 4.53\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/method/suggest.rs"},"region":{"startLine":4140}}}],"partialFingerprints":{"codehealthFindingId/v1":"a694ea2de78bc9ac61cc77bccd9d5410d6d8272949087f9da9228c77f39d4186"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/options.rs: FileTooLong \u2014 2261 significant 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 78 free functions. The bar is 500 significant lines; this is 1761 over it, 4.52\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":"compiler/rustc_session/src/options.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"87cd84ca81e9eb47860359accecf942914f1d5348a3205a2efdf0276ff74bf79"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: State: ClassTooLong \u2014 1803 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 98 methods, 6 blocks, lines 72-2697. The bar is 400 significant lines; this is 1403 over it, 4.51\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":"compiler/rustc_hir_pretty/src/lib.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2558cb6c81276a4aa6131052e60928d8bade1ab6e9c39a97b0e33ffdd689694"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 2241 significant 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 77% of them inside a single declaration: LoweringContext (3 blocks, 284-3352). The bar is 500 significant lines; this is 1741 over it, 4.48\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":"compiler/rustc_ast_lowering/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a89dab8542be63b83c44efd1e0b261d6e1ad8ae45071c2341f3aec0b0dbf24a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: print/pretty.rs: FileTooLong \u2014 2239 significant 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 1739 over it, 4.48\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":"compiler/rustc_middle/src/ty/print/pretty.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0831c1e67510d4064f52f3073ca82e01b74b8605d6c6138559fb2ffe2533e938"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: x86/avx2.rs: FileTooLong \u2014 2228 significant 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 193 free functions. The bar is 500 significant lines; this is 1728 over it, 4.46\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":"library/stdarch/crates/core_arch/src/x86/avx2.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f04d89e4cf193f10e96f6b4e576a3bad49161658fe510f13c53d6598bdf8d851"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Builder: TooManyMethods \u2014 133 methods, declared across 16 files: builder/scope.rs (38), matches/mod.rs (34), expr/as_place.rs (11), builder/mod.rs (10), \u002B12 more file(s). The bar is 30 methods; this is 103 over it, 4.43\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":"compiler/rustc_mir_build/src/builder/mod.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"730c276bdf1378a4f5ea30121b8999411051639bba04a128b1126c3f8b997db2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Ty.hir_fmt: MethodTooLong \u2014 hir_fmt runs 439 significant 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 339 over it, 4.39\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/tools/rust-analyzer/crates/hir-ide/src/display.rs"},"region":{"startLine":1281}}}],"partialFingerprints":{"codehealthFindingId/v1":"1292ccc2d73884bce92dda22890a906c6eeffa0c06e11657f95e08502be4ddc2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Options.from_matches: MethodTooLong \u2014 from_matches runs 437 significant 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 337 over it, 4.37\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/config.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"6677a614d8601788d75fa13d9ed77be0f5baf73faf940e0dc046e58c9083c61f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: render/mod.rs: FileTooLong \u2014 2177 significant 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 54 free functions. The bar is 500 significant lines; this is 1677 over it, 4.35\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/render/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"00055bf72403854f18f3db0c202f44899f2dfecf8f7da2f869aeb9e41724151e"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: LoweringContext: ClassTooLong \u2014 1736 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 283 methods, 3 blocks, lines 284-3352. The bar is 400 significant lines; this is 1336 over it, 4.34\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":"compiler/rustc_ast_lowering/src/lib.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3437311572b0e4a70c77720e61e96d55908383a88c7b3a3aaad7e81b4b41e91"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: llvm/ffi.rs: FileTooLong \u2014 2169 significant 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 1669 over it, 4.34\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/llvm/ffi.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5ba24499bbe427ecdf4755ec72a6d7f569a63add356cac635f9fd604619bd4c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: musl_math_sys: TooManyFunctions \u2014 130 free functions. The bar is 30 free functions; this is 100 over it, 4.33\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/compiler-builtins/crates/musl-math-sys/src/lib.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"914fa2b367d78e58d1e83a67f16de4a07c5ef23bb7ac21bccd4766b2ef2e2702"}},{"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/tools/miri/src/shims/foreign_items.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"5569f5fa90171b1203b8998b5ad08ebf8f55b72a9f81ecc3e9df5b50122ea8bf"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustc_hir_analysis::check::intrinsic::check_intrinsic_type: FunctionTooLong \u2014 rustc_hir_analysis::check::intrinsic::check_intrinsic_type runs 432 significant 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 332 over it, 4.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":"compiler/rustc_hir_analysis/src/check/intrinsic.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"0379139c0fa90f4cd0e728ba3ab5eb6c045cf0407216a4bdc9f92f0279307d28"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypeErrCtxt.note_and_explain_type_err: MethodTooLong \u2014 note_and_explain_type_err runs 431 significant 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 331 over it, 4.31\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/error_reporting/infer/note_and_explain.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"faa0eace0e21d3dc70e4555f64f61db2198d3186389f0a4c7c125258b3a48b9b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 2153 significant 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 149 free functions. The bar is 500 significant lines; this is 1653 over it, 4.31\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/tools/clippy/clippy_utils/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"51c2360ba48dd90110a1a20b940034e6642d32bedd504b0eee1a85934af3f3e9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustc_ty_utils::layout::layout_of_uncached: FunctionTooLong \u2014 rustc_ty_utils::layout::layout_of_uncached runs 425 significant 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 325 over it, 4.25\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ty_utils/src/layout.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"e24faef5fb545f3f40c2afd759c1bbc9ea918289f2d9f4b133d3551154804190"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustdoc::html::render::print_item::item_trait: FunctionTooLong \u2014 rustdoc::html::render::print_item::item_trait runs 425 significant 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 325 over it, 4.25\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/render/print_item.rs"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"01b8f54a1936368c017e6f4fdf64050a1a2a55b6a13de0d6ad602edcd1bfd6a9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lower.rs: FileTooLong \u2014 2094 significant 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 46 free functions. The bar is 500 significant lines; this is 1594 over it, 4.19\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/lower.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"97891769d3fa1c58487ccebe2c7c2906b509f22e18171ed42b9205eb3d08bf68"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Extended.run: MethodTooLong \u2014 run runs 411 significant 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 311 over it, 4.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/bootstrap/src/core/build_steps/dist.rs"},"region":{"startLine":1902}}}],"partialFingerprints":{"codehealthFindingId/v1":"650be234b7bad30e7a54f3e923da0103de592d702aa4b17b6dc229b6de06c64e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/pat.rs: FileTooLong \u2014 2042 significant 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 1542 over it, 4.08\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/pat.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eebc11c9ee4f9eb93350e4b8dbae3249d31ebd3b2b87cb1dc48bac7a545cd305"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FunctionCx.codegen_intrinsic_call: MethodTooLong \u2014 codegen_intrinsic_call runs 408 significant 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 308 over it, 4.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":"compiler/rustc_codegen_ssa/src/mir/intrinsic.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e5d668c8e19642d817f100b3781f28d7fd260227943b0ce1135e024a86ef9e4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/display.rs: FileTooLong \u2014 2039 significant 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 1539 over it, 4.08\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ide/src/display.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb1f3a3e600e8c9211c0b9131f9c4ade1dc360b5ebc611958f3a4361af869dd0"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: CodegenCx: TooManyMethods \u2014 122 methods, declared across 17 files: src/type_.rs (23), src/int.rs (18), src/consts.rs (12), src/context.rs (12), \u002B13 more file(s). The bar is 30 methods; this is 92 over it, 4.07\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":"compiler/rustc_codegen_gcc/src/context.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"eed6252adad91682630ac611e2ff81a50bc600f6364122d238108a820810c32a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: parser/item.rs: FileTooLong \u2014 2005 significant 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 1505 over it, 4.01\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/item.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"95d468639792d252a00acb60c969a63cecc6429ac9e8cb6d6987fd055045c2b7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LateResolutionVisitor.smart_resolve_context_dependent_help: MethodTooLong \u2014 smart_resolve_context_dependent_help runs 396 significant 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 296 over it, 3.96\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":"compiler/rustc_resolve/src/late/diagnostics.rs"},"region":{"startLine":2488}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b040cd1499efb139e494337e8e9df9786ef5ced7ca464dcfea8fee6146dfd8e"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Builder: ClassTooLong \u2014 1581 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 73 methods, 14 blocks, lines 52-2599. The bar is 400 significant lines; this is 1181 over it, 3.95\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":"compiler/rustc_codegen_gcc/src/builder.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"c27d6c4c0819a82250755df5ec75c73a931bc65cf9fc4f5503a04d66e30431ad"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: InferenceContext.infer_expr_inner: MethodTooLong \u2014 infer_expr_inner runs 393 significant 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 293 over it, 3.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/tools/rust-analyzer/crates/hir-ty/src/infer/expr.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3213fca93f376ee9f52144bc54c9783fd6a8855062ab5391707e264718df800"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: build_steps/dist.rs: FileTooLong \u2014 1964 significant 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 1464 over it, 3.93\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/build_steps/dist.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d159886b0c2935556f48c34042bba98488497bacf794b1dfae47a401bca7e13"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Evaluator.eval_rvalue: MethodTooLong \u2014 eval_rvalue runs 390 significant 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 290 over it, 3.90\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/tools/rust-analyzer/crates/hir-ty/src/mir/eval.rs"},"region":{"startLine":1029}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f0d89d77db0c7eb2178ec3e1d991357a3cb38c14291d75741b6f74a15bdbddb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: handlers/request.rs: FileTooLong \u2014 1948 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 80 free functions. The bar is 500 significant lines; this is 1448 over it, 3.90\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/tools/rust-analyzer/crates/rust-analyzer/src/handlers/request.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4a065e61277e6b3276628e1234115346c8987da5b158d0c5e6e75547408b0eb"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: EvalCtxt: TooManyMethods \u2014 116 methods, declared across 13 files: eval_ctxt/mod.rs (51), solve/mod.rs (15), solve/trait_goals.rs (15), assembly/mod.rs (13), \u002B9 more file(s). The bar is 30 methods; this is 86 over it, 3.87\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_next_trait_solver/src/solve/eval_ctxt/mod.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4d401d938023615e801b4c08f84ef04b0f5c9aa33f75df772a5c3abc4d1f95f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 1921 significant 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 94% of them inside a single declaration: State (6 blocks, 72-2697). The bar is 500 significant lines; this is 1421 over it, 3.84\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":"compiler/rustc_hir_pretty/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6adedb05624b63f1cfb2335afb8901daf853c3a8426a37e48c2c68d234a3dc2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ExprCollector.maybe_collect_expr: MethodTooLong \u2014 maybe_collect_expr runs 382 significant 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 282 over it, 3.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/tools/rust-analyzer/crates/hir-def/src/expr_store/lower.rs"},"region":{"startLine":1417}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dce4b3a7eefcc43dfcb4d4b01f56f0cbe92aadbd1cfd6e2449ee3376b323877"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/semantics.rs: FileTooLong \u2014 1903 significant 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 1403 over it, 3.81\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir/src/semantics.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ffbbef42f140e6e94cd7710113ab8f25436078ef99224f76da328b366002679"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ExprCollector: TooManyMethods \u2014 113 methods, declared across 3 files: expr_store/lower.rs (107), lower/format_args.rs (5), lower/asm.rs (1). The bar is 30 methods; this is 83 over it, 3.77\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/tools/rust-analyzer/crates/hir-def/src/expr_store/lower.rs"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"65d7718bc633b104d1253123948581f676d76568fd7dc01eb07ee442b491d916"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TypeChecker: ClassTooLong \u2014 1497 significant 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, 4 blocks, lines 227-2759. The bar is 400 significant lines; this is 1097 over it, 3.74\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":"compiler/rustc_borrowck/src/type_check/mod.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b64badd6f2501216d1120d0e1246e3fb4d5059ef49bb2ccbafc682c525d7e71"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SelectionContext: ClassTooLong \u2014 1494 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 99 methods, 4 blocks, lines 98-2811. The bar is 400 significant lines; this is 1094 over it, 3.74\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":"compiler/rustc_trait_selection/src/traits/select/mod.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"60a17fb54bbb30f1a299a5542e19f6f7bac1a98324687c8a0c8399fe03cd48b4"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: CompilerCtxt: TooManyMethods \u2014 112 methods, declared across 2 files: context/impls.rs (111), context/mod.rs (1). The bar is 30 methods; this is 82 over it, 3.73\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":"compiler/rustc_public_bridge/src/context/mod.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7d72e3f301a0b368d3231af89da0fe1795482f0acdc87baebe79afcd721d2ca"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: methods/mod.rs: FileTooLong \u2014 1866 significant 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 1366 over it, 3.73\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/methods/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe78b08c9ed69d82772f47323b69e155b9c19b14d36cd11145d74b48d0f821c3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: render/print_item.rs: FileTooLong \u2014 1855 significant 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 39 free functions. The bar is 500 significant lines; this is 1355 over it, 3.71\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/librustdoc/html/render/print_item.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e6e75e431d07ce680704b8207257e893544bd09b8e6fb699d85ec7cbe086181"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: stdarch_gen_hexagon::hvx::get_compound_helper_signatures: FunctionTooLong \u2014 stdarch_gen_hexagon::hvx::get_compound_helper_signatures runs 371 significant 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 271 over it, 3.71\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/stdarch-gen-hexagon/src/hvx.rs"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c106023bec85750d76b468f391f46c6e12168c76c851011acb89879ebec3d29"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: InferCtxt: TooManyMethods \u2014 111 methods, declared across 13 files: infer/mod.rs (71), snapshot/mod.rs (10), canonical/instantiate.rs (6), outlives/obligations.rs (5), \u002B9 more file(s). The bar is 30 methods; this is 81 over it, 3.70\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/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/mod.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa8a7917ebb1c8c73cdfe3294d02603cc1eb86d63bb84309b37e3e0b74529fd6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: InterpCx.eval_intrinsic: MethodTooLong \u2014 eval_intrinsic runs 370 significant 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 270 over it, 3.70\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":"compiler/rustc_const_eval/src/interpret/intrinsics.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eba955e01af68c7fa1b7eef9014608100c49b89e82437581392386a0cba4720"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: x86/avx.rs: FileTooLong \u2014 1842 significant 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 187 free functions. The bar is 500 significant lines; this is 1342 over it, 3.68\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"82d6de96037a7ff08e4f198b8f14226bae5d1e6123866d87d21e105926e74b2c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: render/search_index.rs: FileTooLong \u2014 1840 significant 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 1340 over it, 3.68\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/render/search_index.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d722a5fbd03a50970ab7e57712c52cdbe4eaf065987847f8088d2a932eddc9d4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypeErrCtxt.maybe_report_ambiguity: MethodTooLong \u2014 maybe_report_ambiguity runs 368 significant 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 268 over it, 3.68\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/error_reporting/traits/ambiguity.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"a862ce2c5d2b427dda78e12ae60f59ba64d21e5ce692e061d9d3e6840a646b5e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: core_arch::powerpc::altivec: TooManyFunctions \u2014 110 free functions. The bar is 30 free functions; this is 80 over it, 3.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":"library/stdarch/crates/core_arch/src/powerpc/altivec.rs"},"region":{"startLine":3323}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca2e9e888335cb052406c292c1c2d7b737276b1a9e9c2c26c0eb57f2fe698afb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: config/config.rs: FileTooLong \u2014 1830 significant 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 74% of them inside a single declaration: Config (3 blocks, 90-2030). The bar is 500 significant lines; this is 1330 over it, 3.66\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/bootstrap/src/core/config/config.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e53fb8d1dbd5b7623a0092e22d6f20a4d4683ddb2e8514c2c8d4f433e0d3ff4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: rmeta/encoder.rs: FileTooLong \u2014 1828 significant 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 1328 over it, 3.66\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":"compiler/rustc_metadata/src/rmeta/encoder.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e58bdaebd783b20173082b554e1694925e54ba17dd822957ce42bdd467c824b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: nameres/collector.rs: FileTooLong \u2014 1813 significant 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 1313 over it, 3.63\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/tools/rust-analyzer/crates/hir-def/src/nameres/collector.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a05455a73106ef97a999246340679f2cf9d81a76128359cd2c51d23f03c6f3aa"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/expr.rs: FileTooLong \u2014 1811 significant 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 62 free functions. The bar is 500 significant lines; this is 1311 over it, 3.62\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/expr.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b77d6cba327f3f5f755f5ae47cd0bd6778e6ebf5eb825e9a2aeb2047afee50f3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: parser/diagnostics.rs: FileTooLong \u2014 1810 significant 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 1310 over it, 3.62\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/diagnostics.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac608195e41fd40a84aea5ebcdd99680e826605aab0786cdff9536b95c95aae9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: x86/sse2.rs: FileTooLong \u2014 1806 significant 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 218 free functions. The bar is 500 significant lines; this is 1306 over it, 3.61\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":"library/stdarch/crates/core_arch/src/x86/sse2.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b75721e5993754d501ff3b97dc3b9a9d4c4c0930d0b60e34f8e24fed39fc9e8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: State.print_expr_outer_attr_style: MethodTooLong \u2014 print_expr_outer_attr_style runs 360 significant 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 260 over it, 3.60\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":"compiler/rustc_ast_pretty/src/pprust/state/expr.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba79f9f8769d6ad87062234abd5d55009ad44db03dd9ee915e802c4e4889e6d8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Builder.cargo: MethodTooLong \u2014 cargo runs 360 significant 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 260 over it, 3.60\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/bootstrap/src/core/builder/cargo.rs"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"008ebedaddfbeea5e054966ad3023145d941b804e05b0860c39044cf88fa7f24"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FnCtxt.handle_unsatisfied_predicates: MethodTooLong \u2014 handle_unsatisfied_predicates runs 357 significant 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 257 over it, 3.57\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/method/suggest.rs"},"region":{"startLine":1705}}}],"partialFingerprints":{"codehealthFindingId/v1":"d47cb32fc25214b0f4165ba3cf15c6f7152e357562aa2253d0f516e0576dbc36"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: check/wfcheck.rs: FileTooLong \u2014 1770 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 31 free functions. The bar is 500 significant lines; this is 1270 over it, 3.54\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/check/wfcheck.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9972f9ef1afac1b16c856944a97c1df792b2979b75079df856c00dcee7101148"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: check/compare_impl_item.rs: FileTooLong \u2014 1757 significant 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 1257 over it, 3.51\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/check/compare_impl_item.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc7b2948d1ad28cdb56e98c4a83c1e1d6aba6a8cbd104cbde98157d1f9a17e84"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/expand.rs: FileTooLong \u2014 1755 significant 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 1255 over it, 3.51\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_expand/src/expand.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"79dfbd42aff008af891aa961e372f83c1f1d0efbcbf955a844e197af428ce2ef"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: infer/mod.rs: FileTooLong \u2014 1748 significant 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 86% of them inside a single declaration: TypeErrCtxt (118-2487). The bar is 500 significant lines; this is 1248 over it, 3.50\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/error_reporting/infer/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6168502f269e5ec5c6357fbb56e227961047ce19a623a19838190a5d6e2c2462"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LoweringContext.lower_inline_asm: MethodTooLong \u2014 lower_inline_asm runs 346 significant 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 246 over it, 3.46\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":"compiler/rustc_ast_lowering/src/asm.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"d54581e93d7cc834c2326005823ccd5438913e6b4d6bcfc59f4236e7ca02360b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: type_check/mod.rs: FileTooLong \u2014 1726 significant 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 87% of them inside a single declaration: TypeChecker (4 blocks, 227-2759). The bar is 500 significant lines; this is 1226 over it, 3.45\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":"compiler/rustc_borrowck/src/type_check/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"80caf7acc6b41b0414b7c7c950ad7e6cdd2238615a8746901ae086b56ae26cd4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/builder.rs: FileTooLong \u2014 1709 significant 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 93% of them inside a single declaration: Builder (14 blocks, 52-2599). The bar is 500 significant lines; this is 1209 over it, 3.42\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":"compiler/rustc_codegen_gcc/src/builder.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"87cfbc4a1bdc3ea9f98827b711a58042580d2f8a77648cb8b81ed31d4243e1c6"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Config: ClassTooLong \u2014 1362 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 64 methods, 3 blocks, lines 90-2030. The bar is 400 significant lines; this is 962 over it, 3.41\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/config/config.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"5481f96583c92f88ab7cfcee5df66a36239032484dc75f09cd51bd50c03ebb4c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypeErrCtxt.note_type_err: MethodTooLong \u2014 note_type_err runs 340 significant 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 240 over it, 3.40\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/error_reporting/infer/mod.rs"},"region":{"startLine":1465}}}],"partialFingerprints":{"codehealthFindingId/v1":"5037863e9912f8c041ae974934c79cf0c56ef1a34a9859a4eec5e56d95ef0466"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mir/lower.rs: FileTooLong \u2014 1698 significant 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 79% of them inside a single declaration: MirLowerCtx (2 blocks, 78-1941). The bar is 500 significant lines; this is 1198 over it, 3.40\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/tools/rust-analyzer/crates/hir-ty/src/mir/lower.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d973b4305ca9998fd0a6af03f64de51dbf9f01d93a1da73051580b89111b52c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/infer.rs: FileTooLong \u2014 1695 significant 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 1195 over it, 3.39\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/tools/rust-analyzer/crates/hir-ty/src/infer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"483088a4fa483b2b30ef61b215633af1c597f74cbcd0dc0555d41ba14a7b7aa6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/diagnostics.rs: FileTooLong \u2014 1692 significant 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 1192 over it, 3.38\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":"compiler/rustc_hir_analysis/src/diagnostics.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bef24f5732f05ca7589b2792a579d76666322d8914a62c7efa89c56200a48fa1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: passes/collect_intra_doc_links.rs: FileTooLong \u2014 1690 significant 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 1190 over it, 3.38\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/librustdoc/passes/collect_intra_doc_links.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"79f4a5176456dbef8981a6ed625e330ddf80f4fd5be640214c0a0249fdea5e10"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: select/mod.rs: FileTooLong \u2014 1682 significant 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: SelectionContext (4 blocks, 98-2811). The bar is 500 significant lines; this is 1182 over it, 3.36\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":"compiler/rustc_trait_selection/src/traits/select/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e8b3de43a319997ac8706fd3791cb91ca603435cb9d779ebc53c11d9f523d49"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CompileTimeMachine.call_intrinsic: MethodTooLong \u2014 call_intrinsic runs 336 significant 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 236 over it, 3.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":"compiler/rustc_const_eval/src/const_eval/machine.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"709c2bc7eab49734f074d3dd08ef59cfe2b114b4a6346630498300f87263a863"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/diagnostics.rs: FileTooLong \u2014 1675 significant 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 1175 over it, 3.35\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_attr_parsing/src/diagnostics.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"300e54dad43cae6ab11fc847b05a4d41bb51816e137f5673c9f22ec81abe8d7a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: MirLowerCtx: ClassTooLong \u2014 1335 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 66 methods, 2 blocks, lines 78-1941. The bar is 400 significant lines; this is 935 over it, 3.34\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/tools/rust-analyzer/crates/hir-ty/src/mir/lower.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcf685e4c95208f09a7f33c385ef555b4ef23ca4643bec2b975013c547b32f42"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: fs/unix.rs: FileTooLong \u2014 1668 significant 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 1168 over it, 3.34\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/fs/unix.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"373799485080640a146064d3058aa5e0f0890fef04051d3d763a989004d7dd57"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: State: TooManyMethods \u2014 100 methods, declared across 3 files: pprust/state.rs (54), state/item.rs (24), state/expr.rs (22). The bar is 30 methods; this is 70 over it, 3.33\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":"compiler/rustc_ast_pretty/src/pprust/state.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"641d09f8f8997cbedbe3b1e1ce5fef1f18e9dfc4039459c5de520e88c82c6c15"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: CompilerInterface: TooManyMethods \u2014 100 methods. The bar is 30 methods; this is 70 over it, 3.33\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_public/src/compiler_interface.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"76319c228cded7543dcbc75fefcc51f21e11fd2d8e7073fb73a0ec0ec69a98cc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: method/probe.rs: FileTooLong \u2014 1655 significant 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 65% of them inside a single declaration: ProbeContext (4 blocks, 55-2715). The bar is 500 significant lines; this is 1155 over it, 3.31\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":"compiler/rustc_hir_typeck/src/method/probe.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c29cb1e5cd929a76cd8e714bbc4a59f302460e309e3dcacdd7791d173b9e492"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SelectionContext: TooManyMethods \u2014 99 methods, declared across 3 files: select/mod.rs (49), select/candidate_assembly.rs (28), select/confirmation.rs (22). The bar is 30 methods; this is 69 over it, 3.30\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/traits/select/mod.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"281e2b155e659013e07bfeb7d1d1abf263e67ecb9d78ff88dddb3a866fb50ab8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: next_solver/interner.rs: FileTooLong \u2014 1640 significant 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 1140 over it, 3.28\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/tools/rust-analyzer/crates/hir-ty/src/next_solver/interner.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fe1c6506e8295991a532669178fc3768e7da3e8d2347a360d69996d435d14ff"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: hir_expand::builtin::derive_macro::coerce_pointee_expand: FunctionTooLong \u2014 hir_expand::builtin::derive_macro::coerce_pointee_expand runs 328 significant 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 228 over it, 3.28\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-expand/src/builtin/derive_macro.rs"},"region":{"startLine":1128}}}],"partialFingerprints":{"codehealthFindingId/v1":"46d6124958263f00f40ac244281c1f6e2fa94d53cba164bcb0b4201ffcb4a747"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: slice/iter.rs: FileTooLong \u2014 1639 significant 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 1139 over it, 3.28\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":"library/core/src/slice/iter.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1956fb0ba28f4fc6113db4c617c13f48a587781e8814d84b26634b7ed5b2d1d9"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: State: TooManyMethods \u2014 98 methods. The bar is 30 methods; this is 68 over it, 3.27\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_pretty/src/lib.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"697d642d2575e449cb4c204fecec0edb8091952dfbf1a7f3dc9d6176ea10f573"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mir/block.rs: FileTooLong \u2014 1629 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 80% of them inside a single declaration: FunctionCx (410-2531). The bar is 500 significant lines; this is 1129 over it, 3.26\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":"compiler/rustc_codegen_ssa/src/mir/block.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1114b39c81856868c364db276fd22f102548c19ee524a437b3beb0bfb59b254b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/diagnostics.rs: FileTooLong \u2014 1625 significant 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 1125 over it, 3.25\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/diagnostics.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5d6689f2f7a6bf947b2ab742ea83fcf4fefda2d49dc0aa8c3740c32df92c222"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustdoc::html::render::render_impl: FunctionTooLong \u2014 rustdoc::html::render::render_impl runs 325 significant 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 225 over it, 3.25\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/render/mod.rs"},"region":{"startLine":1893}}}],"partialFingerprints":{"codehealthFindingId/v1":"814b1e5c41702c0defb211dccdbcbbd0b8b3dbf539bfc09f8b44616e1c0c34a8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 1621 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 66% of them inside a single declaration: MirBorrowckCtxt (3 blocks, 735-2770). The bar is 500 significant lines; this is 1121 over it, 3.24\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"24e00cc8a2210e841342c0baff9a36a43800998999052226d1945a87bc9cdc41"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ThirPrinter.print_expr_kind: MethodTooLong \u2014 print_expr_kind runs 324 significant 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 224 over it, 3.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":"compiler/rustc_mir_build/src/thir/print.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fd30c401b9592caee379739878cd5ff0081ce7d45ea4f175654893877e3c6fd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/source_analyzer.rs: FileTooLong \u2014 1616 significant 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 74% of them inside a single declaration: SourceAnalyzer (2 blocks, 77-1752). The bar is 500 significant lines; this is 1116 over it, 3.23\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir/src/source_analyzer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7edf1333810fa1923db372ff987a43f14108ed7f4acc906e26f66a6132692785"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Resolver: TooManyMethods \u2014 96 methods, declared across 8 files: diagnostics/impls.rs (44), src/ident.rs (21), src/build_reduced_graph.rs (14), src/macros.rs (10), \u002B4 more file(s). The bar is 30 methods; this is 66 over it, 3.20\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":"compiler/rustc_hir_typeck/src/writeback.rs"},"region":{"startLine":917}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9701aa55bf9297a4bfecd2d4f63323c031ac12f7649522b203bc40f4288ace4"}},{"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/tools/miri/src/shims/unix/macos/foreign_items.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1c7d123f8899dd83b6de3dfdbb976858e28616f302436f3c02c0c8ad4f618a1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Config: TooManyFields \u2014 95 stored fields beside 27 methods. The bar is 30 stored fields; this is 65 over it, 3.17\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/tools/compiletest/src/common.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"a63eadd73a501c3934be12d385792155bbcb961203f617e7179a4ea2917aea32"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: syntax_factory/constructors.rs: FileTooLong \u2014 1578 significant 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 99% of them inside a single declaration: SyntaxFactory (2 blocks, 15-2413). The bar is 500 significant lines; this is 1078 over it, 3.16\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/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6423c844ca274ce5f61b8fad0b77d8fa1d15edb9065555cd9775315503d97cd0"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: AstValidator: ClassTooLong \u2014 1261 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 55 methods, 3 blocks, lines 122-2236. The bar is 400 significant lines; this is 861 over it, 3.15\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":"compiler/rustc_ast_passes/src/ast_validation.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ef47fba6988100976fef521f5c9273bd9da84b117934ed8e4244a83556a3609"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pprust/state.rs: FileTooLong \u2014 1573 significant 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 1073 over it, 3.15\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ast_pretty/src/pprust/state.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea2847387d7c514080f58e45ecf99960b9cd3253c6fd035cd9e5aa6dba8ea81a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: x86/avx512vbmi2.rs: FileTooLong \u2014 1571 significant 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 150 free functions. The bar is 500 significant lines; this is 1071 over it, 3.14\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512vbmi2.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b28df17cd78c8c6958c8e57ab6172fc4ce23a0d6180737011b381b8683bf8d2e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FunctionCx.codegen_call_terminator: MethodTooLong \u2014 codegen_call_terminator runs 313 significant 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 213 over it, 3.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":"compiler/rustc_codegen_ssa/src/mir/block.rs"},"region":{"startLine":955}}}],"partialFingerprints":{"codehealthFindingId/v1":"48c925616c7dc915591ef6cc8904acd8862de0d464b49756b8129f94b5810342"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MirLowerCtx.pattern_match_inner: MethodTooLong \u2014 pattern_match_inner runs 313 significant 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 213 over it, 3.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/tools/rust-analyzer/crates/hir-ty/src/mir/lower/pattern_matching.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c5e05d73482efd2463800696a02f23fd5da19d1523260a5b739c01af5e602dc"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustc_lint::register_builtins: FunctionTooLong \u2014 rustc_lint::register_builtins runs 311 significant 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 211 over it, 3.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":"compiler/rustc_lint/src/lib.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1016a79107ef7f3a0991a66f49268aa63c2b6c48732cedc9a7a84e9df795cc4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: build_steps/compile.rs: FileTooLong \u2014 1554 significant 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 1054 over it, 3.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/bootstrap/src/core/build_steps/compile.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"98b6dd5998e1f5042ee859bb582da82652b6351945d62dc88fe358bf5fd3df59"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: clean/types.rs: FileTooLong \u2014 1552 significant 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 1052 over it, 3.10\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/clean/types.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"31ff5e8a1f205cf2561a9f90ae598eb3a79f4167a2869eae92ef928b7c50546d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/diagnostics.rs: FileTooLong \u2014 1551 significant 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 1051 over it, 3.10\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir/src/diagnostics.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"673d954dfa0a9700fca88a697313b8478af640777395dd363b7ccb9bc6042126"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/expr.rs: FileTooLong \u2014 1545 significant 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 95% of them inside a single declaration: LoweringContext (111-2361). The bar is 500 significant lines; this is 1045 over it, 3.09\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":"compiler/rustc_ast_lowering/src/expr.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"680ee3de0560cdbc19b9fb5a8a5365c000f6fef7273bd9ae13c657228cdc94fa"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FnCtxt.instantiate_value_path: MethodTooLong \u2014 instantiate_value_path runs 309 significant 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 209 over it, 3.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/fn_ctxt/_impl.rs"},"region":{"startLine":1037}}}],"partialFingerprints":{"codehealthFindingId/v1":"3174051c91acb1ebed09a7ced3e1b8300a38cbb888444826f35b41f21b39e82f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lsp/to_proto.rs: FileTooLong \u2014 1541 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 52 free functions. The bar is 500 significant lines; this is 1041 over it, 3.08\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/lsp/to_proto.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd8b154d0c12499d3d12dd305eb9847d022cfb5e4ff76b1ca24fd7efdcf5ea8d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: VecDeque: TooManyMethods \u2014 92 methods. The bar is 30 methods; this is 62 over it, 3.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/alloc/src/collections/vec_deque/mod.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ac28a859f4febe654677720062cd5dc8077af8eaa56195f4bdfd94437f86b19"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypeChecker.visit_rvalue: MethodTooLong \u2014 visit_rvalue runs 306 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 206 over it, 3.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/validate.rs"},"region":{"startLine":1018}}}],"partialFingerprints":{"codehealthFindingId/v1":"18906e03739cc816149a881efb3403402d0eba08b45ca5845483aff41e8cb6fb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AnyDiagnostic.inference_diagnostic: MethodTooLong \u2014 inference_diagnostic runs 306 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 206 over it, 3.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir/src/diagnostics.rs"},"region":{"startLine":1578}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2cad0629145dbc1a201537bfa784dd44c41fa6242837f47364a17e73bb8a8b0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 1527 significant 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 1027 over it, 3.05\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_span/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"65f2ca95eda40b45c45b8645241996dfcd4fb53ad0a1309a917aa0f95d9451e7"}},{"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/tools/miri/src/shims/unix/fs.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff4d5e33be13e7f8b4f3d2bbcd83aa9a9a8826e771e98c817f41c2e799e122a5"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Args: TooManyFields \u2014 91 stored fields. The bar is 30 stored fields; this is 61 over it, 3.03\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/tools/compiletest/src/cli.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeb3ebe027203c4cb6c37f255bd43309a96662e98fce0847fac8c64ffba98636"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TokenStream.from_str: MethodTooLong \u2014 from_str runs 302 significant 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 202 over it, 3.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/proc-macro-srv/src/token_stream.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"929545f5008b6caac8d6c2a83780d5d0992318a358a9c9149eac489d39a5f244"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: context/analysis.rs: FileTooLong \u2014 1509 significant 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 1009 over it, 3.02\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-completion/src/context/analysis.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d62e537d5ae92111cb16aa1364f07f6105febd799732a55a4ddd2f10cf381c78"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SourceAnalyzer: ClassTooLong \u2014 1203 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 70 methods, 2 blocks, lines 77-1752. The bar is 400 significant lines; this is 803 over it, 3.01\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/tools/rust-analyzer/crates/hir/src/source_analyzer.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"13bd7389294195ed619c41b3a922e7a03b318fcfa472f4358a9dffe18c70b7d8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/ident.rs: FileTooLong \u2014 1501 significant 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 98% of them inside a single declaration: Resolver (50-2244). The bar is 500 significant lines; this is 1001 over it, 3.00\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":"compiler/rustc_resolve/src/ident.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e2291efb9a40c06b01d0601e2dd5b5ae16db8a8891b8d556ac23a2147fa5164"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CastCheck.report_cast_error: MethodTooLong \u2014 report_cast_error runs 300 significant 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 200 over it, 3.00\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":"compiler/rustc_hir_typeck/src/cast.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"af1f0a8ddbc71dc4f25f2fed815204f8ed2f6972046e7c3ce0d083362cddc5c9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/item.rs: FileTooLong \u2014 1498 significant 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 98% of them inside a single declaration: LoweringContext (46-2163). The bar is 500 significant lines; this is 998 over it, 3.00\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":"compiler/rustc_ast_lowering/src/item.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eb8d71a674ba7570f68287638a343da69ded983f412bb9dda5939eb3186b3cc"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustc_hir_analysis::check::check::check_item_type: FunctionTooLong \u2014 rustc_hir_analysis::check::check::check_item_type runs 298 significant 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 198 over it, 2.98\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":"compiler/rustc_hir_analysis/src/check/check.rs"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"3689f268c1abf9167f7b8eb7b698790cc4fbf54d8e97487f3f1c058e9a8335ec"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: check/check.rs: FileTooLong \u2014 1484 significant 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 984 over it, 2.97\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/check/check.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"46e89f1be9ce899566918035661550d2f5e2693bd79bf49e70009ed950d3ea45"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: diagnostics/mod.rs: FileTooLong \u2014 1483 significant 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 983 over it, 2.97\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/diagnostics/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b707e132b565d176ad3e06518b899a93be75b8162df33a6ac9f9afa068d6ae15"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/builtin.rs: FileTooLong \u2014 1482 significant 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 982 over it, 2.96\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":"compiler/rustc_lint/src/builtin.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"14d0303de56b9b7ab4d7a9247af40115243f2d345808113eac7f1e4863f0c295"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FulfillProcessor.process_obligation: MethodTooLong \u2014 process_obligation runs 294 significant 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 194 over it, 2.94\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":"compiler/rustc_trait_selection/src/traits/fulfill.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"50692706ca7de066f98b0c7eb26b564456e42311322cd8cd35e3a2128266c996"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Builder.codegen_intrinsic_call: MethodTooLong \u2014 codegen_intrinsic_call runs 291 significant 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 191 over it, 2.91\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":"compiler/rustc_codegen_gcc/src/intrinsic/mod.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"60754be3305d4cfffd7718e1a60bc3b8b78d7bec45839fde2ad883b2431a7ad3"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: VecDeque: ClassTooLong \u2014 1162 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 92 methods, 25 blocks, lines 104-4151. The bar is 400 significant lines; this is 762 over it, 2.91\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":"library/alloc/src/collections/vec_deque/mod.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"0019f3a51b949a8b207f6f690e5eeabf11fd6cdfade7e38a10daa67352ed4779"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: handlers/extract_function.rs: FileTooLong \u2014 1452 significant 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 36 free functions. The bar is 500 significant lines; this is 952 over it, 2.90\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/tools/rust-analyzer/crates/ide-assists/src/handlers/extract_function.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6348df38f0e7d12b0f694409ec71a550351c23944a75d591af3b5f75ee82c7b9"}},{"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/tools/miri/src/shims/unix/foreign_items.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"295d3b453cfb871d2b1db3f184cc45f1fe2af5c5d1c76b433a37ef4dad0834ec"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ide::hover::render::definition: FunctionTooLong \u2014 ide::hover::render::definition runs 288 significant 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 188 over it, 2.88\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/hover/render.rs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"b28c9d3af0abdcea07b64a3bc0c5dddcbaeb8fc5b68cb7f6efa2be2636020512"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AnalysisStats.run_inference: MethodTooLong \u2014 run_inference runs 288 significant 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 188 over it, 2.88\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/cli/analysis_stats.rs"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ea7a0e1b73873a29b99c91208ca6d898484404af1ce3f3c3e0f377f16465871"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/builder.rs: FileTooLong \u2014 1423 significant 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 84% of them inside a single declaration: Builder (13 blocks, 227-2195). The bar is 500 significant lines; this is 923 over it, 2.85\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":"compiler/rustc_codegen_llvm/src/builder.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ad77d66b01ef3b731fdf55970a022decf3d6fd8df03fdb5699760cd9c4c21dc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: hir_ty_lowering/errors.rs: FileTooLong \u2014 1416 significant 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 916 over it, 2.83\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/hir_ty_lowering/errors.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"44c1d034800acad6a60baa665757cda0ae914e35a1c88099b234f9cb764195fa"}},{"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/tools/miri/src/shims/unix/linux/foreign_items.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"cce735e440385c36a84cbc29e1137477434092809f10f1257d2e332d3a21f7bc"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Config: TooManyMethods \u2014 84 methods. The bar is 30 methods; this is 54 over it, 2.80\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/tools/rust-analyzer/crates/rust-analyzer/src/config.rs"},"region":{"startLine":1116}}}],"partialFingerprints":{"codehealthFindingId/v1":"62dcbb675aef0a8db18816194ca7b37a4e62d43c260298a5c3d4ff4ad2700c41"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DefCollector.resolve_macros: MethodTooLong \u2014 resolve_macros runs 280 significant 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 180 over it, 2.80\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/tools/rust-analyzer/crates/hir-def/src/nameres/collector.rs"},"region":{"startLine":1306}}}],"partialFingerprints":{"codehealthFindingId/v1":"d03989a13024ad94ed189cae33272b371e681c4c72f8ed670115fc75dec4d01b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/workspace.rs: FileTooLong \u2014 1398 significant 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 898 over it, 2.80\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/tools/rust-analyzer/crates/project-model/src/workspace.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"87ff5d2c209faa472fd810ecf6ce14ddfd2a847d534e43e9d670082c4da9a013"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/ast_validation.rs: FileTooLong \u2014 1394 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 90% of them inside a single declaration: AstValidator (3 blocks, 122-2236). The bar is 500 significant lines; this is 894 over it, 2.79\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":"compiler/rustc_ast_passes/src/ast_validation.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c77f07fefe0aabc473b29b845490280a3393550ad78f631e835de091fb9d14eb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: build_steps/llvm.rs: FileTooLong \u2014 1394 significant 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 894 over it, 2.79\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/bootstrap/src/core/build_steps/llvm.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dc0eb419bc0dcb81bde66f711915ea98631845d99ac19428ed15fb9d113fb86"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: html/markdown.rs: FileTooLong \u2014 1389 significant 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 889 over it, 2.78\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/markdown.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4211183915b8dbfba9bf773f904c7a9452b89abd4a1fbf9fd5fd19273a25a9d0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: infer/expr.rs: FileTooLong \u2014 1372 significant 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: InferenceContext (55-2170). The bar is 500 significant lines; this is 872 over it, 2.74\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/tools/rust-analyzer/crates/hir-ty/src/infer/expr.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e69dc54e941358d1289010a6b6560151a02dea01c20626d717a700a2bd3a57b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustc_codegen_cranelift::base::codegen_stmt: FunctionTooLong \u2014 rustc_codegen_cranelift::base::codegen_stmt runs 274 significant 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 174 over it, 2.74\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":"compiler/rustc_codegen_cranelift/src/base.rs"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"77c92031a9731b009fb412eeed1ff2919ca434c91d478626c4769f723db14859"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Builder.codegen_inline_asm: MethodTooLong \u2014 codegen_inline_asm runs 274 significant 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 174 over it, 2.74\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":"compiler/rustc_codegen_gcc/src/asm.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"45bcde0a2bebc9be331797f363441a19426dddf9725dba18b20e0d9e51e8ee56"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Session: TooManyMethods \u2014 82 methods, declared across 3 files: core/session.rs (79), src/utils.rs (2), options/mitigation_coverage.rs (1). The bar is 30 methods; this is 52 over it, 2.73\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/bootstrap/src/core/session.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f64d5df46a2bf6ac6802c1f400a53e701945aa9b6c40a25e40c5ba6cd191d8f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ty/mod.rs: FileTooLong \u2014 1356 significant 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 856 over it, 2.71\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":"compiler/rustc_middle/src/ty/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a0ce771a8b252b8854b14331b71e3878bb971cec215994e5a3dc59dd62fd9e9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: traits/project.rs: FileTooLong \u2014 1355 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 31 free functions. The bar is 500 significant lines; this is 855 over it, 2.71\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":"compiler/rustc_trait_selection/src/traits/project.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff3d4ddcd34489ba154125e5bc22bb85aa604bce7aa4f3c9d2129c79700032bc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ModCollector.collect: MethodTooLong \u2014 collect runs 271 significant 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 171 over it, 2.71\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/nameres/collector.rs"},"region":{"startLine":1898}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1676c27f88e5f7facf34a18ab89ef81700d28093762197e290a5cf576de2ebb"}},{"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/tools/miri/src/machine.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"53c7b70c580af41077832de6e5999a5b84d46df9522d7e986fcc84d713eb4749"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ProbeContext: ClassTooLong \u2014 1082 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 42 methods, 4 blocks, lines 55-2715. The bar is 400 significant lines; this is 682 over it, 2.71\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":"compiler/rustc_hir_typeck/src/method/probe.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"04cca412f27f8959b74d68537d8f9c073b8dbaaea5a8b04a3a52b177b64cc74c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: matches/mod.rs: FileTooLong \u2014 1347 significant 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 78% of them inside a single declaration: Builder (3 blocks, 92-3009). The bar is 500 significant lines; this is 847 over it, 2.69\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":"compiler/rustc_mir_build/src/builder/matches/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aff3775b155249e5c38fb90782dcc545305b05741d2d3ca8f09034c3c69fd68"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: MirBorrowckCtxt: ClassTooLong \u2014 1072 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 151 methods, 3 blocks, lines 735-2770. The bar is 400 significant lines; this is 672 over it, 2.68\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":"compiler/rustc_borrowck/src/lib.rs"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bf618bc11bfda3479a03a62bbc377f5df80ff31b9859b28050d59a09e864b88"}},{"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/tools/miri/src/shims/unix/fs.rs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f65dc7876aed063bfdc029ea8f41dbf0210814ec45fc4a4a8d0f451063fac3e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LoweringContext.lower_item_kind: MethodTooLong \u2014 lower_item_kind runs 267 significant 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 167 over it, 2.67\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":"compiler/rustc_ast_lowering/src/item.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f1ed0d8ce155aa14794f04d436c714833536f7d7261ae2b0c26d310ee4497ae"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BorrowExplanation.add_explanation_to_diagnostic: MethodTooLong \u2014 add_explanation_to_diagnostic runs 267 significant 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 167 over it, 2.67\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":"compiler/rustc_borrowck/src/diagnostics/explain_borrow.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1fe531134427f16bd1d4d3c077232f3a3389db1e5fed6804796faa39e445848"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Lexer.next_token_from_cursor: MethodTooLong \u2014 next_token_from_cursor runs 267 significant 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 167 over it, 2.67\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":"compiler/rustc_parse/src/lexer/mod.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"eec9ce85a6106fc0d6d1bd3112fe3a90353fbb7da5675498f9d0f845c5f10f97"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Builder.get_step_descriptions: MethodTooLong \u2014 get_step_descriptions runs 267 significant 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 167 over it, 2.67\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/bootstrap/src/core/builder/mod.rs"},"region":{"startLine":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"609dbd506dd2e7da161604ada95119a8dc3ef3d6f07183b191667302fd3673ab"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 1333 significant 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 833 over it, 2.67\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":"compiler/rustc_abi/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"872a299025556179500a2870e31faf58d5c2d1ff6e9a14f11429538fedde6092"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/upvar.rs: FileTooLong \u2014 1333 significant 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 833 over it, 2.67\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":"compiler/rustc_hir_typeck/src/upvar.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e7d10a77131986772950b9af4c81c2316de0d0d13275032cad8fd2b13eb6f79"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mir/pretty.rs: FileTooLong \u2014 1319 significant 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 819 over it, 2.64\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/mir/pretty.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"de78d2e88d197e6f6eb3c039b6fcd9ec3fe0b45f9104a3aa6a9aca297f52124b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Analysis: TooManyMethods \u2014 79 methods. The bar is 30 methods; this is 49 over it, 2.63\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/tools/rust-analyzer/crates/ide/src/lib.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"250ee52f8e806288c5c6e53edef86af941a5af16b921e6a4aa54f1b76c929382"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Resolver.resolve_path_with_ribs: MethodTooLong \u2014 resolve_path_with_ribs runs 263 significant 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 163 over it, 2.63\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/ident.rs"},"region":{"startLine":1878}}}],"partialFingerprints":{"codehealthFindingId/v1":"3957df033a161c36e926b150900a0102fcdfdc9751e6d0c31e5239246b4ce328"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: VnState: ClassTooLong \u2014 1049 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 40 methods, 4 blocks, lines 380-2149. The bar is 400 significant lines; this is 649 over it, 2.62\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":"compiler/rustc_mir_transform/src/gvn.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"075da1f4b5d7e45783e527b9d617d4f692b25d8c3cb596055fe40a7c57eee3f0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: vec_deque/mod.rs: FileTooLong \u2014 1311 significant 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: VecDeque (25 blocks, 104-4151). The bar is 500 significant lines; this is 811 over it, 2.62\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":"library/alloc/src/collections/vec_deque/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d15a88eb23ffe69650289ee3b6c63f10bfa9c4220b5f64e8f8835d10abc648bc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ty/sty.rs: FileTooLong \u2014 1306 significant 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: Ty (3 blocks, 364-2178). The bar is 500 significant lines; this is 806 over it, 2.61\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":"compiler/rustc_middle/src/ty/sty.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7b670e48dd8a573edc41301e937a4d03699d1154fd92f3989d2a07512eb1de4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/gvn.rs: FileTooLong \u2014 1306 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 80% of them inside a single declaration: VnState (4 blocks, 380-2149). The bar is 500 significant lines; this is 806 over it, 2.61\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":"compiler/rustc_mir_transform/src/gvn.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b8dcb3732332d3e2659201bb88a3de51e3a50f87313614f0eec83778b30fdbb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: eval_ctxt/mod.rs: FileTooLong \u2014 1306 significant 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 72% of them inside a single declaration: EvalCtxt (2 blocks, 103-1966). The bar is 500 significant lines; this is 806 over it, 2.61\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":"compiler/rustc_next_trait_solver/src/solve/eval_ctxt/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c838cfa63014797112247d80ae71ea42c23216e04963a50426b84722516bad6f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FnCtxt.label_fn_like: MethodTooLong \u2014 label_fn_like runs 261 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 161 over it, 2.61\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/fn_ctxt/checks.rs"},"region":{"startLine":1665}}}],"partialFingerprints":{"codehealthFindingId/v1":"75d1b155c963e6ffeb034d45076d3fd11b43859543bc26c5b2e74d52d466115a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: AtHwcap: TooManyFields \u2014 78 stored fields beside 1 method. The bar is 30 stored fields; this is 48 over it, 2.60\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std_detect/src/detect/os/linux/aarch64.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6d4af8851fea5ac7c508c4fe8abc81822f11a9069c2ea4e20ae7404ccb9f7f5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Builder.codegen_inline_asm: MethodTooLong \u2014 codegen_inline_asm runs 259 significant 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 159 over it, 2.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":"compiler/rustc_codegen_llvm/src/asm.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bd848c37841f1cb1ac192a1c4ec59e2790cd61b9ffd8a8253ce4190cfef597c"}},{"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/tools/miri/src/machine.rs"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b7a6832f283da90dcda14702b0d7209330b0de05428446187d4ee7f9d010dd7"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: EncodeContext: ClassTooLong \u2014 1032 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 47 methods, 6 blocks, lines 56-2474. The bar is 400 significant lines; this is 632 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":"compiler/rustc_metadata/src/rmeta/encoder.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"b856ba846d6ed2237c25476b4624edbf9a8969dab24420cccaa72de6a778b1b5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FunctionCx.codegen_rvalue_operand: MethodTooLong \u2014 codegen_rvalue_operand runs 255 significant 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 155 over it, 2.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":"compiler/rustc_codegen_ssa/src/mir/rvalue.rs"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"68f8438c1a948903c821269f8f2a2f9848c2cf6f964ec68f735620c96117fb19"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Builder.as_rvalue: MethodTooLong \u2014 as_rvalue runs 255 significant 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 155 over it, 2.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":"compiler/rustc_mir_build/src/builder/expr/as_rvalue.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fc00bdd941a4c2eca303c75f091467bcd791dedff8db23c62bb0e4298345e35"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustc_codegen_ssa::back::write::start_executing_work: FunctionTooLong \u2014 rustc_codegen_ssa::back::write::start_executing_work runs 253 significant 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 153 over it, 2.53\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/back/write.rs"},"region":{"startLine":1204}}}],"partialFingerprints":{"codehealthFindingId/v1":"daaa25d15f56c99aaef0ad2585c1f45b606786bce93be9d6b7737ce54e3ebc04"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: diagnostics/mutability_errors.rs: FileTooLong \u2014 1260 significant 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 760 over it, 2.52\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":"compiler/rustc_borrowck/src/diagnostics/mutability_errors.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fb67cbf198648edd939b30ef51950961ac2382baced2169d0ada4c502bdee8f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DefCollector: ClassTooLong \u2014 1005 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 22 methods, 2 blocks, lines 232-1881. The bar is 400 significant lines; this is 605 over it, 2.51\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/tools/rust-analyzer/crates/hir-def/src/nameres/collector.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"56e0a1c5cc1a04fdaef7204b9e94baf25afd401e91baa732855717a34c5b31d7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustc_codegen_llvm::context::init_module: FunctionTooLong \u2014 rustc_codegen_llvm::context::init_module runs 251 significant 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 151 over it, 2.51\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/context.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f23058d584edea88254db6b71cdaf3e2933261790623ccd04e232b70b48d307"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Dereferencing.check_expr: MethodTooLong \u2014 check_expr runs 251 significant 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 151 over it, 2.51\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/dereference.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ac0a08d6e59fe39de47b5480675616c9d27b06331c1bb67b7e04347bd907f54"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: tidy::style::check_file_style: FunctionTooLong \u2014 tidy::style::check_file_style runs 250 significant 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 150 over it, 2.50\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/tidy/src/style.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eff071e8b3746349874df73dceb73b74665a64847a76588e61f85a0d77dbede"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/collect.rs: FileTooLong \u2014 1245 significant 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 745 over it, 2.49\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/collect.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d40668690771a8923fc7ceaac5c627fe10989f0d21794921600dbf80fa7d393"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/queries.rs: FileTooLong \u2014 1244 significant 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 744 over it, 2.49\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/queries.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3399364f63ec1ff7943e160b705625a8de5208e84eef37cf8a5309347174c2f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/coercion.rs: FileTooLong \u2014 1243 significant 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 743 over it, 2.49\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/coercion.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a49dd51d174cf4682ed3ee68cc33d8aba2182c710a4641a491a88469460b79c3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: js/main.js: FileTooLong \u2014 1241 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 500 significant lines; this is 741 over it, 2.48\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/librustdoc/html/static/js/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"de774c84748043f3b0bb1b80cef12a1802239e8d08a8a2e07c192418f9a1df27"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LoweringContext.lower_expr_mut: MethodTooLong \u2014 lower_expr_mut runs 248 significant 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 148 over it, 2.48\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ast_lowering/src/expr.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"27a2ef9db00cff94988ed6d8b7c48cc38489516aced93ac807db16228e73702c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LowerIntrinsics.run_pass: MethodTooLong \u2014 run_pass runs 248 significant 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 148 over it, 2.48\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/lower_intrinsics.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cded5836516fde95aaa4aa30db1206567792397e3f707fe290417903172f2ff"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Printer.print_expr_in: MethodTooLong \u2014 print_expr_in runs 248 significant 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 148 over it, 2.48\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/expr_store/pretty.rs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"9910cf2b478f7588034daf399e0cbcc860cc26c554d36dc05a3abba0f3724eba"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Span: TooManyMethods \u2014 74 methods, declared across 3 files: src/lib.rs (59), src/span_encoding.rs (14), src/hygiene.rs (1). The bar is 30 methods; this is 44 over it, 2.47\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":"compiler/rustc_span/src/span_encoding.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"148bb8d71d8baf59a9dc32e6934576cdc16dd2e6acfb40ae824d39616b99f321"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: intrinsic/simd.rs: FileTooLong \u2014 1231 significant 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 731 over it, 2.46\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":"compiler/rustc_codegen_gcc/src/intrinsic/simd.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"14f0f7b8e7b3b9788dd3fc42f8c5946b86c86c62af5a2d526dbed6fe2771343d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: debuginfo/metadata.rs: FileTooLong \u2014 1225 significant 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 39 free functions. The bar is 500 significant lines; this is 725 over it, 2.45\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/debuginfo/metadata.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc756457279b917f9d089f6af7675940f7abff5a55cd4d31b8be34b66cbf95a4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/main.rs: FileTooLong \u2014 1225 significant 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 725 over it, 2.45\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/stdarch-gen-loongarch/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b05013c382b397813fe7aec4c7011e511ee849974e150d034796c9b6edfbb33"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: method_resolution/probe.rs: FileTooLong \u2014 1220 significant 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 720 over it, 2.44\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/tools/rust-analyzer/crates/hir-ty/src/method_resolution/probe.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c88709b1c10561f25b2552e3de1f60a404121dbaee5b66ee45a778329b2d352"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/asm.rs: FileTooLong \u2014 1219 significant 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 719 over it, 2.44\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":"compiler/rustc_codegen_llvm/src/asm.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"99f223be26279b078264e903fe80bb98df8d5dde341928ddb6be854134de4dc0"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Builder: TooManyMethods \u2014 73 methods, declared across 4 files: src/builder.rs (31), src/int.rs (22), intrinsic/mod.rs (12), src/atomics.rs (8). The bar is 30 methods; this is 43 over it, 2.43\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":"compiler/rustc_codegen_gcc/src/builder.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"7761ba5c9c2f55f7d5218f9a178dde5582947931d338df4b4bf8c4c0b986f287"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: FunctionCx: TooManyMethods \u2014 73 methods, declared across 12 files: mir/block.rs (27), mir/debuginfo.rs (14), mir/rvalue.rs (11), mir/retag.rs (5), \u002B8 more file(s). The bar is 30 methods; this is 43 over it, 2.43\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":"compiler/rustc_codegen_ssa/src/mir/mod.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d838a811331973015b5187bafc0be2592a5b79bb829abb5f6347efebdb277f8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cli/analysis_stats.rs: FileTooLong \u2014 1213 significant 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 86% of them inside a single declaration: AnalysisStats (51-1481). The bar is 500 significant lines; this is 713 over it, 2.43\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/tools/rust-analyzer/crates/rust-analyzer/src/cli/analysis_stats.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"df1407da3935e32afae20efe73fe9062c9d36737bfcdbd614d9bb78a0d0665e7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: back/write.rs: FileTooLong \u2014 1211 significant 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 711 over it, 2.42\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":"compiler/rustc_codegen_ssa/src/back/write.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6733dc2592dbb2e54b18d509b2e05f0b8f77586a2e7e59e266a3e7ba96c1b365"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: infer/region.rs: FileTooLong \u2014 1211 significant 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 711 over it, 2.42\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":"compiler/rustc_trait_selection/src/error_reporting/infer/region.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c02342508179ea7c935e318a184b04c29ffc84ab4c72dbb662ea5c47be31075e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: stdarch_verify::to_type: FunctionTooLong \u2014 stdarch_verify::to_type runs 241 significant 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 141 over it, 2.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":"library/stdarch/crates/stdarch-verify/src/lib.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"19685e7448c688955dffb23b25c46809e1ef7f4aeabe499323d81d672ca4b4a4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/hir_utils.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). The bar is 500 significant lines; this is 696 over it, 2.39\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/tools/clippy/clippy_utils/src/hir_utils.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"31ab9ba0c2beb1231c233221a2337ac4a7fe778a3730cbfbe6f6a3d9b605ace0"}},{"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-1548). 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/tools/miri/src/shims/unix/foreign_items.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"32873be5c4b1767783308ceab344727d81a033ee049e3d3073c8ae616bdf7700"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: eval/shim.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 98% of them inside a single declaration: Evaluator (30-1627). 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/tools/rust-analyzer/crates/hir-ty/src/mir/eval/shim.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"16e014301ea7a838911955069d2acad639f2f2b23e9f01f55250a437ff91e302"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: State.print_item: MethodTooLong \u2014 print_item runs 239 significant 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 139 over it, 2.39\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":"compiler/rustc_ast_pretty/src/pprust/state/item.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"e20b8050f82e8caff8437e8ed55712da5a0434b715ec4ca4a314b2fddd721300"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Assemble.run: MethodTooLong \u2014 run runs 239 significant 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 139 over it, 2.39\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/bootstrap/src/core/build_steps/compile.rs"},"region":{"startLine":2122}}}],"partialFingerprints":{"codehealthFindingId/v1":"e465f13227c6a1030145b3124433863181ed222c2ad28d4ccf7da8b11afc8ead"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ide_completion::context::analysis::expected_type_and_name: FunctionTooLong \u2014 ide_completion::context::analysis::expected_type_and_name runs 239 significant 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 139 over it, 2.39\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/tools/rust-analyzer/crates/ide-completion/src/context/analysis.rs"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ec50c64f62a0c8ba16eda3ccca2cc314bd94c7d703a4f4e682a87198b9ba2a8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cx/expr.rs: FileTooLong \u2014 1190 significant 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: ThirBuildCx (70-1749). The bar is 500 significant lines; this is 690 over it, 2.38\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":"compiler/rustc_mir_build/src/thir/cx/expr.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0981959e9a4ec81e5f0d6a8c4c6c2fd5d288704038f3cf7eefcc2eb868def38a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FnCallDiagCtxt.labels_and_suggestion_text: MethodTooLong \u2014 labels_and_suggestion_text 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":"compiler/rustc_hir_typeck/src/fn_ctxt/checks.rs"},"region":{"startLine":2654}}}],"partialFingerprints":{"codehealthFindingId/v1":"004fa4e044455f349a3f2b65f02ee6485a8f25fe7d79af1a5d90cfd71be5cd4a"}},{"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/tools/miri/src/bin/miri.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4e938d94a52e6f86d955d09024b9cd37386c6481f5cc85a26d49143ced4bc99"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: html/format.rs: FileTooLong \u2014 1186 significant 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 51 free functions. The bar is 500 significant lines; this is 686 over it, 2.37\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/format.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d27f05f17c011a725370b5621368a71d4b89009427dcd3ade4fc7eb58d10d08"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AnalysisStats.run: MethodTooLong \u2014 run runs 237 significant 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 137 over it, 2.37\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/cli/analysis_stats.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"674fe9f1b85f20eed161bde8ad146d6035be465af943c2bfa501422b49b18c37"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/comment.rs: FileTooLong \u2014 1184 significant 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 684 over it, 2.37\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/comment.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc76a767b26922c42d5c5aa6ece4aa8c283d74dc970c684a788e82b601659036"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/intrinsic.rs: FileTooLong \u2014 1180 significant 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 680 over it, 2.36\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":"library/stdarch/crates/stdarch-gen-arm/src/intrinsic.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2c722f7312e284f022e4e594d8f3ffecd9d5e2e16257a36d023d50e399b96af"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: CheckAttrVisitor: ClassTooLong \u2014 943 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 25 methods, 3 blocks, lines 113-1489. The bar is 400 significant lines; this is 543 over it, 2.36\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":"compiler/rustc_passes/src/check_attr.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3734c18f26d5dec184c3aae5edecded217132feb230bdf4bbfd42ea801cb53a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: parser/pat.rs: FileTooLong \u2014 1170 significant 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 670 over it, 2.34\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/pat.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bc4655e5093e3f138c87d5c8f219f69ccb54d2826b140be3cab804f7bd87871"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/macros.rs: FileTooLong \u2014 1170 significant 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 670 over it, 2.34\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/macros.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ac9c0bf29a66fbed57ba9a10ef2088728267c1954a02fb17ed3e9f53b4ae994"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustc_codegen_ssa::back::link::link_natively: FunctionTooLong \u2014 rustc_codegen_ssa::back::link::link_natively runs 234 significant 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 134 over it, 2.34\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":"compiler/rustc_codegen_ssa/src/back/link.rs"},"region":{"startLine":1232}}}],"partialFingerprints":{"codehealthFindingId/v1":"785382280c6484175aa5a6c4a77c882d4567e5836cb2a8235a027dc092405e4c"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: EvalCtxt: ClassTooLong \u2014 934 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 116 methods, 2 blocks, lines 103-1966. The bar is 400 significant lines; this is 534 over it, 2.34\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":"compiler/rustc_next_trait_solver/src/solve/eval_ctxt/mod.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4ac0d38c4f1addf1b11b2919b6dabac1ff212131f4ee869c19dc72835c2c431"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: NodeRef: TooManyMethods \u2014 70 methods, declared across 4 files: btree/node.rs (50), btree/navigate.rs (10), btree/search.rs (8), btree/fix.rs (2). The bar is 30 methods; this is 40 over it, 2.33\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":"library/alloc/src/collections/btree/node.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b17ae579656209379c6146be1f9aeed567e5613448daf950eab3062ab4fe6fa"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Ty: TooManyMethods \u2014 70 methods. The bar is 30 methods; this is 40 over it, 2.33\u00D7 the bar. Most of these members implement ty.Ty (70 of 70 members), so moving them onto a smaller type would remove them from that contract rather than reduce it. To reduce it, split the contract instead: give each cohesive group of operations its own smaller interface and its own implementing type. Where the contract has to stay whole, move the work behind these members into collaborator types, so what is left here is a forward per member rather than a responsibility per member."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/next_solver/ty.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"04256f5bd585fab9b3f8468f87a3df9038288ae6e27fb11f1d0cc59f3adeca7a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SourceAnalyzer: TooManyMethods \u2014 70 methods. The bar is 30 methods; this is 40 over it, 2.33\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir/src/source_analyzer.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ab4ab6d0059d57f6a6ef5709fd81771b03619141755060e0cd0a4515f499cfa"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustc_codegen_cranelift::base::codegen_fn_body: FunctionTooLong \u2014 rustc_codegen_cranelift::base::codegen_fn_body runs 233 significant 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 133 over it, 2.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":"compiler/rustc_codegen_cranelift/src/base.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"59c905a188e5521cb80af2c721bffba42261133ad7d2e47f9d7bef31d485d8c9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 1164 significant 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 664 over it, 2.33\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":"library/compiler-builtins/crates/api-list-common/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"63b63b39a0aad37981efe76be043485d0b3ee1dee1f96fdc5653900bdcae50a5"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DropCtxt: ClassTooLong \u2014 929 significant 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 142-1671. The bar is 400 significant lines; this is 529 over it, 2.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":"compiler/rustc_mir_transform/src/elaborate_drop.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bc4257699caa72a9f960bba7b7363be88cffc9c30631641d7508eea49366c7d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Resolver.validate_res_from_ribs: MethodTooLong \u2014 validate_res_from_ribs runs 231 significant 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 131 over it, 2.31\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/ident.rs"},"region":{"startLine":1476}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e8e536cd0d937cfb95f0b1031477031f18427f593b6e90d110d17749a703335"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: bootstrap::core::sanity::check: FunctionTooLong \u2014 bootstrap::core::sanity::check runs 231 significant 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 131 over it, 2.31\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/sanity.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec0601bc49334628470dd39a4dcb3164c0e9e0c2f3db419d0d31f18a45e63716"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Evaluator: TooManyMethods \u2014 69 methods, declared across 3 files: mir/eval.rs (55), eval/shim.rs (12), shim/simd.rs (2). The bar is 30 methods; this is 39 over it, 2.30\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/mir/eval.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc5c457f223bde99e52b4e798e6b6160eb8f52f02228d4554f1f7ed66e101878"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SelectionContext.evaluate_predicate_recursively: MethodTooLong \u2014 evaluate_predicate_recursively runs 230 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/traits/select/mod.rs"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa5ee1b358faef161c35539f4801397eb1935642676c5b1c72ae823444d007e1"}},{"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/tools/miri/src/intrinsics/aarch64.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"b055940d4397bb81176e36d2dde8b900b3ac84afce8250ca2b849d15b423d425"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ide_completion::completions::postfix::complete_postfix: FunctionTooLong \u2014 ide_completion::completions::postfix::complete_postfix runs 228 significant 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 128 over it, 2.28\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-completion/src/completions/postfix.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"93e20a354e2d63339e1a64e6bdf74a04160508f950318f7287684d39bfb99b21"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustc_hir_analysis::collect::generics_of::generics_of: FunctionTooLong \u2014 rustc_hir_analysis::collect::generics_of::generics_of runs 227 significant 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 127 over it, 2.27\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/collect/generics_of.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9b7ccd78dd316eeda1f815c98346d0e14cb2275324633e7133c1fae2b6487cf"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Command.posix_spawn: MethodTooLong \u2014 posix_spawn runs 227 significant 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 127 over it, 2.27\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/process/unix/unix.rs"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"1550e22ba8bdca545c9534c152d83d00a85309304ba02b2222bbb5729b71c5eb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: builder/scope.rs: FileTooLong \u2014 1129 significant 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 68% of them inside a single declaration: Builder (2 blocks, 530-2094). The bar is 500 significant lines; this is 629 over it, 2.26\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":"compiler/rustc_mir_build/src/builder/scope.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"10966566bb5c1831fabbee7ded914ee3f0ad5f0b92de78e7edfa7331af70fef7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mbe/macro_rules.rs: FileTooLong \u2014 1128 significant 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 628 over it, 2.26\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_expand/src/mbe/macro_rules.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdb366e7ddc957c47054822d3e7f2072cb8d8182805865480081f3f365e73a32"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PrintVisitor.expr: MethodTooLong \u2014 expr runs 225 significant 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 125 over it, 2.25\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/utils/author.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"020aae5f49dc4b523d905244062e3119cd805adf41a4d81f76217729d96813e2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: hir_ty::layout::layout_of_ty_query: FunctionTooLong \u2014 hir_ty::layout::layout_of_ty_query runs 225 significant 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 125 over it, 2.25\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/layout.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"42970eec8c9bcc93d6e9dca0f5ac4f197516cb976ef86c434a51a8bc6fb17a63"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: intrinsics/mod.rs: FileTooLong \u2014 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). The bar is 500 significant lines; this is 623 over it, 2.25\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"255d0528ab8498ad0a7ed14d664a8b397b32dc97ff0579af6a3356e73a9f0e88"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/diagnostics.rs: FileTooLong \u2014 1119 significant 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 619 over it, 2.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":"compiler/rustc_mir_build/src/diagnostics.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e2a00ff3309268bc5a5d4ae9566dcce69a8d1a317a9a02cca922ff69ef706da"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: intrinsics/mod.rs: FileTooLong \u2014 1118 significant 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 56 free functions. The bar is 500 significant lines; this is 618 over it, 2.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":"library/core/src/intrinsics/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4f9f908ea5a819893017e1648acb1c2fb5f25de3c147531fc4fed868171f3f7"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: CodegenCx: TooManyFields \u2014 67 stored fields beside 122 methods. The bar is 30 stored fields; this is 37 over it, 2.23\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":"compiler/rustc_codegen_gcc/src/context.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"5810896a15cc9661225301cfa5ec9abd8f583ebd28d3863fe422c9c1f69dc3a3"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Session: ClassTooLong \u2014 891 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 82 methods, 4 blocks, lines 39-1805. The bar is 400 significant lines; this is 491 over it, 2.23\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/session.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4788f374d894b3f8a8ace1635750e19bb54ad38254aeb1c61fcda115dfaa636"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: builtin/derive_macro.rs: FileTooLong \u2014 1111 significant 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 611 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/tools/rust-analyzer/crates/hir-expand/src/builtin/derive_macro.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d87b3a8e47fff2d0c55cd7c2d78ef288e015c799bf6dcffc9d90aa7548c31c0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: fs/windows.rs: FileTooLong \u2014 1109 significant 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 609 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":"library/std/src/sys/fs/windows.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"61c7fed12723cf1cc7e9c7352dee74818109a45310bfee96bf3eb90a62e87b6e"}},{"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/tools/miri/src/concurrency/data_race.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcc5a40136a3aeda70a048f62c5aa0f832bc3ddad9330139016c6032ab80bae9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Newtype.parse: MethodTooLong \u2014 parse runs 221 significant 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 121 over it, 2.21\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_index_macros/src/newtype.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"e970a9ea94efc58f6c5641c99e275cf3cbffd2fb96f6302a91e4aa4d9c50efa0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustc_parse::lexer::unescape_error_reporting::emit_unescape_error: FunctionTooLong \u2014 rustc_parse::lexer::unescape_error_reporting::emit_unescape_error runs 221 significant 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 121 over it, 2.21\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/lexer/unescape_error_reporting.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f8bf8042924687e7d06f0be7136ec4669f3bebf3f7251b0bd98b84b92d520ef"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ExprUseVisitor: ClassTooLong \u2014 881 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 44 methods, 4 blocks, lines 280-1860. The bar is 400 significant lines; this is 481 over it, 2.20\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/expr_use_visitor.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e20e08804628eca2bd0f487a1940dfa9a3915eb65ed5b19bc1ff5f2edc6bd8e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: MirLowerCtx: TooManyMethods \u2014 66 methods, declared across 3 files: mir/lower.rs (48), lower/pattern_matching.rs (11), lower/as_place.rs (7). The bar is 30 methods; this is 36 over it, 2.20\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/tools/rust-analyzer/crates/hir-ty/src/mir/lower.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"6549be26f83aad24a9b7cb284e64c1f3ab07fb27a285b6316e8c7bf6fc4b9ecc"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustc_builtin_macros::asm::expand_preparsed_asm: FunctionTooLong \u2014 rustc_builtin_macros::asm::expand_preparsed_asm runs 220 significant 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 120 over it, 2.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":"compiler/rustc_builtin_macros/src/asm.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"f19bcd55525dabc84e7e98c98ded3859a5af7e8ea5bded77310b4d9656996e4d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: compiletest::directives::handlers::make_directive_handlers_map: FunctionTooLong \u2014 compiletest::directives::handlers::make_directive_handlers_map runs 220 significant 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 120 over it, 2.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/tools/compiletest/src/directives/handlers.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7fc27d8cd4255473923f54a4d2c443fa0f090dcf7a6de2a40d402048054a207"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: etc/lldb_providers.py: FileTooLong \u2014 1095 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 595 over it, 2.19\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/etc/lldb_providers.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1106880915762429b4e504601405a039ed38c7de419cd4c9cdab3e495bfc0338"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AstValidator.visit_item: MethodTooLong \u2014 visit_item runs 219 significant 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 119 over it, 2.19\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":"compiler/rustc_ast_passes/src/ast_validation.rs"},"region":{"startLine":1417}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa8aa71f64993d5c2d743d0750cef7fa5385a9060bb03e321c78dca90181742f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FindUsages.short_associated_function_fast_search: MethodTooLong \u2014 short_associated_function_fast_search runs 219 significant 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 119 over it, 2.19\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/tools/rust-analyzer/crates/ide-db/src/search.rs"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3e7e33dbcc3b701eac77950e01ea8306b5f5875019d0810fe087a85921ae668"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GlobalState.handle_event: MethodTooLong \u2014 handle_event runs 219 significant 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 119 over it, 2.19\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/tools/rust-analyzer/crates/rust-analyzer/src/main_loop.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"0178e6469aee44c9b8e71b535fb17541c8d02238a9d5bb27edfdad82cebf9577"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: parser/ty.rs: FileTooLong \u2014 1093 significant 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 593 over it, 2.19\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/ty.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"526288351e428949516aff6e87d5ca954b411c6ebca5a6d243ce228697642cb9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: solve/trait_goals.rs: FileTooLong \u2014 1091 significant 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 591 over it, 2.18\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":"compiler/rustc_next_trait_solver/src/solve/trait_goals.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5250de74b24cd47e238a1e2ed76f643926c28b07ea384a8afe1034014b4a9eb4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypeErrCtxt.cmp: MethodTooLong \u2014 cmp runs 217 significant 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 117 over it, 2.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":"compiler/rustc_trait_selection/src/error_reporting/infer/mod.rs"},"region":{"startLine":1129}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d65cfe3a1e2dd55a71ff7953c7644ba59d89345e6381778ae9e9937146bfa1a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustdoc::passes::collect_intra_doc_links::resolution_failure: FunctionTooLong \u2014 rustdoc::passes::collect_intra_doc_links::resolution_failure runs 217 significant 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 117 over it, 2.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":"src/librustdoc/passes/collect_intra_doc_links.rs"},"region":{"startLine":2106}}}],"partialFingerprints":{"codehealthFindingId/v1":"5519d4f8c4f3598474e0f22e195f97a2cdf8efecff3d94a4633bc0d2c1aef19b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SourceAnalyzer.resolve_path: MethodTooLong \u2014 resolve_path runs 217 significant 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 117 over it, 2.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":"src/tools/rust-analyzer/crates/hir/src/source_analyzer.rs"},"region":{"startLine":1158}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f3a3bde6cfca8cc39ad1ada7f4c6066308bd9a515ba4139fb1dbece6977c821"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustc_codegen_llvm::back::write::llvm_optimize: FunctionTooLong \u2014 rustc_codegen_llvm::back::write::llvm_optimize runs 216 significant 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 116 over it, 2.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":"compiler/rustc_codegen_llvm/src/back/write.rs"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"e53b5ab18b9dfc39e9c556856c0bc5f3dc97367951a616d316fbc3d937858a43"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ide_assists::handlers::convert_closure_to_fn::convert_closure_to_fn: FunctionTooLong \u2014 ide_assists::handlers::convert_closure_to_fn::convert_closure_to_fn runs 216 significant 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 116 over it, 2.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/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_closure_to_fn.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5b9eb8e574448b7b77e3e9c5482d5939788bd31e9b71a8487afd5f33fd2eed8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: back/linker.rs: FileTooLong \u2014 1078 significant 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 578 over it, 2.16\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/back/linker.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3e84be734bc6e897ea24cfe3ff3e075b9c9f464716e43ff6aed8d9931d13b05"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/validate.rs: FileTooLong \u2014 1078 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 66% of them inside a single declaration: TypeChecker (3 blocks, 578-1685). The bar is 500 significant lines; this is 578 over it, 2.16\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":"compiler/rustc_mir_transform/src/validate.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2eb5d4385ca1cc479b0280d969d613ef8233817666f9f44faced2aec6ae698e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: build_steps/doc.rs: FileTooLong \u2014 1078 significant 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 578 over it, 2.16\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/build_steps/doc.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6d556713d47b93861debdf55d3753f38ab89fba0fcd021aa2305853c4d7a4e4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: asm/mod.rs: FileTooLong \u2014 1074 significant 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 574 over it, 2.15\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_target/src/asm/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5d852ee6e3145668fe603945faec750e78237ced701f4a9a6f77694cd928f48"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 1072 significant 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 572 over it, 2.14\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-expand/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"99f94c78991d67d886f5bc95c653872e4fe1c3ab401d9755693bdf8bd2902a93"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LateResolutionVisitor.try_lookup_name_relaxed: MethodTooLong \u2014 try_lookup_name_relaxed runs 214 significant 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 114 over it, 2.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/late/diagnostics.rs"},"region":{"startLine":1022}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad3f531dedd9b264cadfaf39d562b54da3acc9d2c8963106a96a5afe8bcc10aa"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/build_reduced_graph.rs: FileTooLong \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), about 70% of them inside a single declaration: DefCollector (3 blocks, 480-1578). The bar is 500 significant lines; this is 569 over it, 2.14\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":"compiler/rustc_resolve/src/build_reduced_graph.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc0b27bfd20033b50d25f6efdbf259c6370803dde7b9e148614e4ea0f4eaa568"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pattern/check_match.rs: FileTooLong \u2014 1068 significant 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 568 over it, 2.14\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_build/src/thir/pattern/check_match.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5de88a3ce583bd25ee335ca952599377dfe4890bf99578df3573f1e5e35f1ca"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Config: TooManyMethods \u2014 64 methods, declared across 3 files: config/config.rs (41), core/download.rs (20), toml/mod.rs (3). The bar is 30 methods; this is 34 over it, 2.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/bootstrap/src/core/config/config.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccca78cdae67838b1eaceeb2cec29c020a83bc10404df930511e914c4f9f70d1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Rustc: TooManyMethods \u2014 64 methods, declared across 2 files: external_deps/rustc.rs (63), src/wasm.rs (1). The bar is 30 methods; this is 34 over it, 2.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/tools/run-make-support/src/external_deps/rustc.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ec6a570149f412a0ca6757a7267fadde65e170023c3502c5eafc4949982345b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CheckAttrVisitor.check_one_parsed_attribute: MethodTooLong \u2014 check_one_parsed_attribute runs 213 significant 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 113 over it, 2.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":"compiler/rustc_passes/src/check_attr.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a9d42faa44d520eb506a6acfdabea1a6b560b626eca4d4ff53e513e321901d2"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DbInterner: ClassTooLong \u2014 849 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 19 methods, 4 blocks, lines 352-2117. The bar is 400 significant lines; this is 449 over it, 2.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/tools/rust-analyzer/crates/hir-ty/src/next_solver/interner.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"868a5aa8f25f4425f5375d32852742deef138b95587b17e44f26b837c4bcec48"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: fn_ctxt/_impl.rs: FileTooLong \u2014 1058 significant 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 96% of them inside a single declaration: FnCtxt (49-1717). The bar is 500 significant lines; this is 558 over it, 2.12\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":"compiler/rustc_hir_typeck/src/fn_ctxt/_impl.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"74218f126ad8a43ec80c969879d08751f70de6116bbd4c9591f5c317b6e91238"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/check_attr.rs: FileTooLong \u2014 1058 significant 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: CheckAttrVisitor (3 blocks, 113-1489). The bar is 500 significant lines; this is 558 over it, 2.12\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":"compiler/rustc_passes/src/check_attr.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9b829157ee1268d7b4c4461b578a6eafa137fc72b38ef8e710ec3d564eeffdc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/dead.rs: FileTooLong \u2014 1058 significant 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 558 over it, 2.12\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_passes/src/dead.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a5d41b7c9dc9d6bd122bf0876821cebc8516960c5ba45be1f28cf0dff8a0653"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Ty: ClassTooLong \u2014 844 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 70 methods, 12 blocks, lines 55-1416. The bar is 400 significant lines; this is 444 over it, 2.11\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/tools/rust-analyzer/crates/hir-ty/src/next_solver/ty.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"d40f59a4891fa09b0b27fec18ea49f46d0b3936e8791e830e4e5bf75c445e9f8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Parser.maybe_recover_unexpected_block_label: MethodTooLong \u2014 maybe_recover_unexpected_block_label runs 211 significant 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 111 over it, 2.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":"compiler/rustc_parse/src/parser/diagnostics.rs"},"region":{"startLine":2693}}}],"partialFingerprints":{"codehealthFindingId/v1":"5989d05735853855db16faf0088f31e740c854affa48635982acdedac01f896d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustc_ty_utils::layout::invariant::layout_sanity_check: FunctionTooLong \u2014 rustc_ty_utils::layout::invariant::layout_sanity_check runs 211 significant 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 111 over it, 2.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":"compiler/rustc_ty_utils/src/layout/invariant.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cb80dc7043760d3dbc94212cbb43f95db2f11e9f4fd89b1e1d127af8fdf0c1b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SourceMap: TooManyMethods \u2014 63 methods. The bar is 30 methods; this is 33 over it, 2.10\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":"compiler/rustc_span/src/source_map.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"06cad0b0feea970cdcf850898bd1468ca1c9c4cac27f79771b702adc86c8b798"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: CStore: 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), 58 methods, 3 blocks, lines 58-1504. 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":"compiler/rustc_metadata/src/creader.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6d44ae1be0bb59d5fd04b6bbe5e0ed0963dae6ea36d9d7cf79f2c4be1b4f80c"}},{"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/tools/miri/src/shims/windows/foreign_items.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"6283e7df2d2c122f4f4f18b4431dc4e0b6b3937d220dc85d281ce2f0df330442"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/diagnostics.rs: FileTooLong \u2014 1045 significant 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 545 over it, 2.09\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/diagnostics.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4a7edf80f4d78dd9ca297c108273bb3d0b95106bf97e01b10816634e8e27b5f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustc_ty_utils::instance::resolve_associated_item: FunctionTooLong \u2014 rustc_ty_utils::instance::resolve_associated_item runs 209 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 109 over it, 2.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ty_utils/src/instance.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"b60ed65f44937bfc4621f3990b424bcc1e83e4b597e12bf6e82b193108cfd32c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: builder/mod.rs: FileTooLong \u2014 1044 significant 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 62% of them inside a single declaration: Builder (4 blocks, 45-1767). The bar is 500 significant lines; this is 544 over it, 2.09\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/bootstrap/src/core/builder/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a2c044aad37f6a40c5753a526008f7dbb250dec93c069353d236ceb58ff8bc5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/commands.ts: FileTooLong \u2014 1042 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 542 over it, 2.08\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/editors/code/src/commands.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"80bd64e1a73ec12bbf24cbd89b7860520831b5b9e842c9801c45763f3a977718"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: InferenceContext: ClassTooLong \u2014 828 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 208 methods, 2 blocks, lines 1340-2623. The bar is 400 significant lines; this is 428 over it, 2.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/infer.rs"},"region":{"startLine":1340}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ec7a396d155dc5f240e0c2978bba73fe21654d09b0a785acd9bc08ff2e0e0f2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: hover/render.rs: FileTooLong \u2014 1035 significant 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 535 over it, 2.07\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/hover/render.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"43845c24b01dbbe9e881ad19a5684b7fb77705288e47f18a80afb793a50d5a4c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: InferenceContext.resolve_variant: MethodTooLong \u2014 resolve_variant runs 207 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 107 over it, 2.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/infer.rs"},"region":{"startLine":2256}}}],"partialFingerprints":{"codehealthFindingId/v1":"075fdecc0974890997b9337d3c84d252d3697f7f9be713d0004bab33a0404e1b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: FmtVisitor: TooManyMethods \u2014 62 methods, declared across 5 files: src/visitor.rs (34), src/items.rs (14), src/missed_spans.rs (11), src/reorder.rs (2), \u002B1 more file(s). The bar is 30 methods; this is 32 over it, 2.07\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/tools/rustfmt/src/visitor.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"41eea27787657e17e06d7e5359ef2398d7ad9ff000f250c5e9dccb6fd3eb1be9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AttributeKind.is_extern_indicator: MethodTooLong \u2014 is_extern_indicator runs 206 significant 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 106 over it, 2.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":"compiler/rustc_attr_ir/src/encode_cross_crate.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"92243b0fc61fc5248154a0b0ee1709a250691bf4f9f2894fd242a959be8556ab"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: UselessConversion.check_expr: MethodTooLong \u2014 check_expr runs 206 significant 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 106 over it, 2.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/tools/clippy/clippy_lints/src/useless_conversion.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"495340cfd8e2f1b5bb896b0ff03b74ee76ca8a7add8a9c6da3ae2f865e7d9fc8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/diagnostics.rs: FileTooLong \u2014 1029 significant 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 529 over it, 2.06\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ast_passes/src/diagnostics.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ac27f3ccd876f16ea6798c034a80c6d8f226f8f7ae0adfe630760894ad3a3e5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: infer/mod.rs: FileTooLong \u2014 1029 significant 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 60% of them inside a single declaration: InferCtxt (4 blocks, 244-1925). The bar is 500 significant lines; this is 529 over it, 2.06\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":"compiler/rustc_infer/src/infer/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6adf51169dfef5ae185d64b51212a473edc577d037c9877a68a6fabcc34aa7c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/expr_use_visitor.rs: FileTooLong \u2014 1023 significant 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 86% of them inside a single declaration: ExprUseVisitor (4 blocks, 280-1860). The bar is 500 significant lines; this is 523 over it, 2.05\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":"compiler/rustc_hir_typeck/src/expr_use_visitor.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d34a17e860727fc77eb567f6b48e2aff6784dee2bbe88d7d2363c855af70cc8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: diagnostics/mod.rs: FileTooLong \u2014 1019 significant 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 519 over it, 2.04\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/diagnostics/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8936df4e867475a8e7b2ae16a15dd7de11588cb44335a15fccc51ed0db34d0a6"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DiagCtxtHandle: TooManyMethods \u2014 61 methods. The bar is 30 methods; this is 31 over it, 2.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_errors/src/lib.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"de2b71bb52265b1a972707f01aed8a0b14d23bf079e4068996617f7d7f142f8e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: BuiltinCombinedLateLintModPass: TooManyFields \u2014 61 stored fields beside 2 methods. The bar is 30 stored fields; this is 31 over it, 2.03\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":"compiler/rustc_lint/src/lib.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d9de85dee1dc349c89f31e370c623e0c55fc0776fe4e7324542281b4cd08890"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: intrinsic/mod.rs: FileTooLong \u2014 1015 significant 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 68% of them inside a single declaration: Builder (3 blocks, 138-1304). The bar is 500 significant lines; this is 515 over it, 2.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":"compiler/rustc_codegen_gcc/src/intrinsic/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"90ed10b39e015e22cf130a2f9c2e70adf077ccf97a72dee2aae2887c8228f2bf"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: UnsafetyVisitor.visit_expr: MethodTooLong \u2014 visit_expr runs 203 significant 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 103 over it, 2.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_build/src/check_unsafety.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d9b7f6bb892a2ff56d59c018f34814f0e49c72e0fd46e56a06e036a2b151f89"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: expr_store/pretty.rs: FileTooLong \u2014 1012 significant 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 67% of them inside a single declaration: Printer (3 blocks, 450-1411). The bar is 500 significant lines; this is 512 over it, 2.02\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/tools/rust-analyzer/crates/hir-def/src/expr_store/pretty.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"15049d6a81422a390c3e3d3d6c3b4288ded1e9498a4666ba3ce8e8cf373c2923"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustc_sanitizers::cfi::typeid::itanium_cxx_abi::encode::encode_ty: FunctionTooLong \u2014 rustc_sanitizers::cfi::typeid::itanium_cxx_abi::encode::encode_ty runs 202 significant 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 102 over it, 2.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_sanitizers/src/cfi/typeid/itanium_cxx_abi/encode.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"43d3e8d24ea20bf8e6c09aa8bf62a3e617a817a84cd245055edd5418a6b55141"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustdoc::html::render::search_index::simplify_fn_type: FunctionTooLong \u2014 rustdoc::html::render::search_index::simplify_fn_type runs 202 significant 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 102 over it, 2.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/render/search_index.rs"},"region":{"startLine":2119}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6f6040a09d2be654532fbdeb2725a08a776b6d216bacc41f5c520de77f1aea6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ProjectWorkspace.load_cargo: MethodTooLong \u2014 load_cargo runs 202 significant 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 102 over it, 2.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/project-model/src/workspace.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"f767f86978c183ed7384d5d7926255a245e0ca09ae8c6ca304792d2c36199272"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 1006 significant 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 506 over it, 2.01\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/proc_macro/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"342d7e783a90b029f703fd358c8de4e505429f14808ced393c48cde0b8f9e3c5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/diagnostics.rs: FileTooLong \u2014 1005 significant 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 505 over it, 2.01\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/diagnostics.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"337617d241a5a9fb75986312b6161b3ac77bcd29633007a00937418fa1f60fb3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: hir_ide::display::render_const_scalar_inner: FunctionTooLong \u2014 hir_ide::display::render_const_scalar_inner runs 201 significant 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 101 over it, 2.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ide/src/display.rs"},"region":{"startLine":819}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd539b7e922271b84b917b503a68b4f5f159cffca4095c9526ac3a64eb7f3852"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/collector.rs: FileTooLong \u2014 1003 significant 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 503 over it, 2.01\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_monomorphize/src/collector.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"763b9042f4de793ebb40faa9a4996b8656be2849a5092cb942e61fbb00e93156"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/elaborate_drop.rs: FileTooLong \u2014 1002 significant 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 93% of them inside a single declaration: DropCtxt (2 blocks, 142-1671). The bar is 500 significant lines; this is 502 over it, 2.00\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":"compiler/rustc_mir_transform/src/elaborate_drop.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc367a49144925b377bd50eca03eab2b57b7b6cc19b0d092bd5f1eb464292019"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: intrinsics/llvm_x86.rs: FileTooLong \u2014 1001 significant 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 501 over it, 2.00\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":"compiler/rustc_codegen_cranelift/src/intrinsics/llvm_x86.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdce03de46db5f594dea4c9737688a5b86e657df335c58030fba44f2cdd1cab9"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Lexer: ClassTooLong \u2014 800 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 31 methods, 2 blocks, lines 125-1301. The bar is 400 significant lines; this is 400 over it, 2.00\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":"compiler/rustc_parse/src/lexer/mod.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb93fd6d926d11209e3d1300898057dc0640346dd25c412b321766d534efb1b1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: client.createClient: FunctionTooLong \u2014 createClient runs 200 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 100 over it, 2.00\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/tools/rust-analyzer/editors/code/src/client.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"0726c2b6eb5667e8f20bb84ebfc451c1b2d9b037c50b29818cfd114c4723e47a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 998 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 33 free functions. The bar is 500 significant lines; this is 498 over it, 2.00\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":"compiler/rustc_driver_impl/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a337dbc99e502193cfa5000659f871d5461c27444c2012c3f319e01f0130a03"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/attrs.rs: FileTooLong \u2014 998 significant 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 498 over it, 2.00\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/tools/rust-analyzer/crates/hir-def/src/attrs.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fabbc0400c5586d4595e8db3c6ec7ec1beb8caf125f3a90f12181575f56c32fc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: interpret/validity.rs: FileTooLong \u2014 997 significant 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 71% of them inside a single declaration: ValidityVisitor (3 blocks, 349-1609). The bar is 500 significant lines; this is 497 over it, 1.99\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":"compiler/rustc_const_eval/src/interpret/validity.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bc00e276cac3297cbcbd311546d271cd2a3dbb4acc1f16ace9646d4556f6151"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/main_loop.rs: FileTooLong \u2014 997 significant 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 88% of them inside a single declaration: GlobalState (176-1482). The bar is 500 significant lines; this is 497 over it, 1.99\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/tools/rust-analyzer/crates/rust-analyzer/src/main_loop.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"acf59b48f1343f8910dff0565f0f635c7af882b17b4b396cfa139b6661397ced"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ty/mod.rs: FileTooLong \u2014 995 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 55 free functions. The bar is 500 significant lines; this is 495 over it, 1.99\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/tools/clippy/clippy_utils/src/ty/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"332f78772919cbc65525e03b337ce767f4c12b7f3b02888f1b0b3dcb37700812"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AttributeKind.encode_cross_crate: MethodTooLong \u2014 encode_cross_crate runs 199 significant 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 99 over it, 1.99\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":"compiler/rustc_attr_ir/src/encode_cross_crate.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"bef9dbe9023208c3f3f2350b6143c5251623b27b6524d014780a503a369f1242"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: core/session.rs: FileTooLong \u2014 994 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 90% of them inside a single declaration: Session (4 blocks, 39-1805). The bar is 500 significant lines; this is 494 over it, 1.99\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/bootstrap/src/core/session.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c29220011d6a9701aabd68b3b0bb06c194045d368c4ca2545d79360a23f1b45"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/resolver.rs: FileTooLong \u2014 989 significant 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 489 over it, 1.98\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/resolver.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eedfb9cc46d492be4119b0154945bfc96fd273e25283a7cb8185903e9208d974"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/target_features.rs: FileTooLong \u2014 987 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 487 over it, 1.97\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_target/src/target_features.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc054fff19e48023e6110b21e88cfd1db1638285ca12e5422e338e6eee26454d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: generate/case_list.rs: FileTooLong \u2014 985 significant 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 485 over it, 1.97\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/compiler-builtins/libm-test/src/generate/case_list.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"12fda0448185d2316cf4835ffed618dd3ec185b7052fc3575e4cb39a3c3327ca"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FnCtxt.check_argument_types: MethodTooLong \u2014 check_argument_types runs 197 significant 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 97 over it, 1.97\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/fn_ctxt/checks.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"70c45c5faeb6a9104d8aecdd565f152e63a290c1ba58c106d1352f116210aa7f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SerializedSearchIndex.union: MethodTooLong \u2014 union runs 197 significant 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 97 over it, 1.97\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/render/search_index.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"54de0c0aafab28f1e03cce5c23f468fd2665cf77158343f7510bf365aef9ec79"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ExprCollector.lower_inline_asm: MethodTooLong \u2014 lower_inline_asm runs 197 significant 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 97 over it, 1.97\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/expr_store/lower/asm.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"94c7c866721e56594d8b08f72b62ee4a1c002ca0e7427b45036f7a19c362621f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: build_steps/tool.rs: FileTooLong \u2014 975 significant 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 475 over it, 1.95\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/build_steps/tool.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"438bfcc6c6de68d491850d59650ab417f3bf249f7542d8ee732667c13849c393"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RoaringBitmap.constructor: MethodTooLong \u2014 constructor runs 195 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 95 over it, 1.95\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/stringdex.js"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"3237f81b42f4cd99272d9e54aabc7c047a08b740436f89de8e4c7f9ac210d18e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: fmt/mod.rs: FileTooLong \u2014 972 significant 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 472 over it, 1.94\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/fmt/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b440d028ade0f81cc41b2b65164f82a59ce48af41cb9698227214e7a2352092e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/storage.rs: FileTooLong \u2014 972 significant 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 472 over it, 1.94\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/tt/src/storage.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef1e7fd1dad132f5d9c827e1aaff0ea15cb4242fcb7bfbbddc06725ac59d6366"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: next_solver/ty.rs: FileTooLong \u2014 971 significant 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 87% of them inside a single declaration: Ty (12 blocks, 55-1416). The bar is 500 significant lines; this is 471 over it, 1.94\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/tools/rust-analyzer/crates/hir-ty/src/next_solver/ty.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb5ce8a3c4ce922bc38b161356d18e61724ea350a087b7290690665459859780"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ty/util.rs: FileTooLong \u2014 970 significant 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 470 over it, 1.94\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/ty/util.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1fa70481acb1e473e8456b3e6bdf47ff98d0c189dac1f7a5c558b1570835c85"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 970 significant 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 470 over it, 1.94\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a6984cce41ed6edd90a195e165afb91e8028231758f86c8a09c4118a743ebdf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/builtin.rs: FileTooLong \u2014 969 significant 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 469 over it, 1.94\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_lint_defs/src/builtin.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a55cb43f5a9e28e5e92e9c43f17df9e4dd2e459753927f7821246340a0052c92"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: html/highlight.rs: FileTooLong \u2014 967 significant 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 467 over it, 1.93\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/highlight.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6cd999c84e57181fbfccd213c890535a038b166bdb418a22f4bdb761306ff25"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: CStore: TooManyMethods \u2014 58 methods, declared across 2 files: src/creader.rs (47), decoder/cstore_impl.rs (11). The bar is 30 methods; this is 28 over it, 1.93\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":"compiler/rustc_metadata/src/creader.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"006fd76ea74f4d4954564f20d89fac6da0e71e9ce0d827bbc15992c453b05cab"}},{"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/tools/miri/src/machine.rs"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"5908c3980b1d1b4621b251cd3bf3babf0866326b0fbe2a742d0fa4d628254a1d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/hygiene.rs: FileTooLong \u2014 965 significant 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 465 over it, 1.93\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_span/src/hygiene.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dda1e5fe3848431c63972ac4a6282ab247a8667b09ee2077b78a37d4bbded9cb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: InlineAsmClobberAbi.clobbered_regs: MethodTooLong \u2014 clobbered_regs 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":"compiler/rustc_target/src/asm/mod.rs"},"region":{"startLine":1129}}}],"partialFingerprints":{"codehealthFindingId/v1":"7143266c17685c207ed9ec75d766756e11da029aef6b07796b7d269e30e8d8e7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypeErrCtxt.note_error_origin: MethodTooLong \u2014 note_error_origin 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":"compiler/rustc_trait_selection/src/error_reporting/infer/mod.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c4bcc43aaa541c18eb2f0185fcd6e073e0c284fac86edf46c1f7a0e108ce577"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: libm::math::powf::powf: FunctionTooLong \u2014 libm::math::powf::powf 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":"library/compiler-builtins/libm/src/math/powf.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a2277d0b59d4fb995e6001aa70b570e540619cd6b07308c5c780d9c3a50580c"}},{"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/tools/miri/src/diagnostics.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"d00321cfe16fe192ceed5340f047b5e8d9c10994b56f452bc355cf1cafc7b4aa"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: commands.viewMemoryLayout: FunctionTooLong \u2014 viewMemoryLayout runs 193 significant lines (blank, comment-only and punctuation-only lines excluded) 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/tools/rust-analyzer/editors/code/src/commands.ts"},"region":{"startLine":1342}}}],"partialFingerprints":{"codehealthFindingId/v1":"a821d42c77e39fe0461663912f4bcf33e0a2630498aeb41282a22e1e06a82225"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: interpret/memory.rs: FileTooLong \u2014 963 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 81% of them inside a single declaration: InterpCx (5 blocks, 179-1722). The bar is 500 significant lines; this is 463 over it, 1.93\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":"compiler/rustc_const_eval/src/interpret/memory.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"177a8d50e3d492dce2d62698a830303f0ac31690252ac13712608615b88c17ce"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: collections/linked_list.rs: FileTooLong \u2014 963 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 463 over it, 1.93\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/alloc/src/collections/linked_list.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b59b3d8d531443d2923c7b801f76691a02d93a609c0c59ff9cb8bfd34f605970"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustc_codegen_cranelift::abi::codegen_terminator_call: FunctionTooLong \u2014 rustc_codegen_cranelift::abi::codegen_terminator_call 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":"compiler/rustc_codegen_cranelift/src/abi/mod.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"3694a77f3c22c87ab3403ce231f1014e28273c36e80f071cdb28c1d9dddd0d90"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustc_codegen_llvm::va_arg::emit_va_arg: FunctionTooLong \u2014 rustc_codegen_llvm::va_arg::emit_va_arg 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":"compiler/rustc_codegen_llvm/src/va_arg.rs"},"region":{"startLine":1070}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc95d50145a35ce167fa2c5117d91c5da097f1d2b393fd1d19b1600dfbb63031"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustc_hir_analysis::check::compare_impl_item::collect_return_position_impl_trait_in_trait_tys: FunctionTooLong \u2014 rustc_hir_analysis::check::compare_impl_item::collect_return_position_impl_trait_in_trait_tys 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":"compiler/rustc_hir_analysis/src/check/compare_impl_item.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"02ce9a42756fb9a33023f07d662f0f68fa62d6392804bf0b52189198f2e53874"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Resolver.resolve_ident_in_scope: MethodTooLong \u2014 resolve_ident_in_scope 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":"compiler/rustc_resolve/src/ident.rs"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"18ad1edc072f126ffc96d024927f47abe30b8172f16110eefcab04f869e19978"}},{"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/tools/miri/src/shims/math.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd220da1808833e498266ce82947cd3b4a75d3933f1dc51aa98b4456c95cf6f3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: hir_def::hir::format_args::parse: FunctionTooLong \u2014 hir_def::hir::format_args::parse 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/tools/rust-analyzer/crates/hir-def/src/hir/format_args.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"462054f14d7e0e5e59140d753db14c5d89a6e2b4662ffdaf6eefbfc7710afde1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: commands.viewMemoryLayout.\u003Creturned closure\u003E: FunctionTooLong \u2014 viewMemoryLayout.\u003Creturned closure\u003E runs 192 significant lines (blank, comment-only and punctuation-only lines excluded) 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/tools/rust-analyzer/editors/code/src/commands.ts"},"region":{"startLine":1343}}}],"partialFingerprints":{"codehealthFindingId/v1":"a62d26bba1ecfa81af047b47a2b28c3743c3dff09e01433bb23bf4672ae00536"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/hvx.rs: FileTooLong \u2014 957 significant 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 457 over it, 1.91\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":"library/stdarch/crates/stdarch-gen-hexagon/src/hvx.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfb555268a03ee9a7d1509218d9c6b7b0e57562bb422673b1c4359b1feb30a99"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: diagnostics/region_errors.rs: FileTooLong \u2014 954 significant 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 454 over it, 1.91\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":"compiler/rustc_borrowck/src/diagnostics/region_errors.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"df19aeae28ca52f046a1265c385080eda847cc42ccd02c0005137645cad1cba5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ast/make.rs: FileTooLong \u2014 953 significant 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 149 free functions. The bar is 500 significant lines; this is 453 over it, 1.91\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/tools/rust-analyzer/crates/syntax/src/ast/make.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca344d5e4b46e389665d82de4333356790e4eee9adef6925ec0c08993b34a3a4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RustcPatCtxt.lower_pat: MethodTooLong \u2014 lower_pat runs 190 significant 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 90 over it, 1.90\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":"compiler/rustc_pattern_analysis/src/rustc.rs"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dfdf4568961aa0e697073c7c40e6de233eb5b79113aabc58a94dc1cd3ec1d56"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustc_trait_selection::traits::project::assemble_candidates_from_impls: FunctionTooLong \u2014 rustc_trait_selection::traits::project::assemble_candidates_from_impls runs 190 significant 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 90 over it, 1.90\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":"compiler/rustc_trait_selection/src/traits/project.rs"},"region":{"startLine":976}}}],"partialFingerprints":{"codehealthFindingId/v1":"af43e26abe29d0351b16f22856dc16c5d7b13b4b4151fcca4c6c37972206e32c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: handlers/generate_function.rs: FileTooLong \u2014 948 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 31 free functions. The bar is 500 significant lines; this is 448 over it, 1.90\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/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_function.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"73f55e818a145e0d76b6aa86c423e33b4d3151c181bd58929caf48fc05bbcf60"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/types.rs: FileTooLong \u2014 947 significant 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 447 over it, 1.89\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/tools/rustfmt/src/types.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bdfdd11a6d61fd582a884e2f5ae9d175e9b21d878da32a9fcc06760c55c6a41"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LateResolutionVisitor.resolve_item: MethodTooLong \u2014 resolve_item runs 189 significant 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 89 over it, 1.89\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/late.rs"},"region":{"startLine":2981}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8cae5d65ba0c89139e979fa7ae8b8549f99f1e52543aa78652595884167c137"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: hir_expand::fixup::fixup_syntax: FunctionTooLong \u2014 hir_expand::fixup::fixup_syntax runs 189 significant 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 89 over it, 1.89\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-expand/src/fixup.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"7206ba33fc5f4de911b49e4da35c324f2105270a50bb06e8a14cb72131ebd73c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/diagnostics.rs: FileTooLong \u2014 941 significant 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 441 over it, 1.88\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_builtin_macros/src/diagnostics.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f7f46d800382f31a7cd1a9d4f9062a35e6ab706c34efe4f8372652360b1516f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/liveness.rs: FileTooLong \u2014 938 significant 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 438 over it, 1.88\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/liveness.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"13d192c8b68d93b9b4a237f39cbc8f5a4ef6dc302a8230dfaffe2eb2f45bde7e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/creader.rs: FileTooLong \u2014 936 significant 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: CStore (3 blocks, 58-1504). The bar is 500 significant lines; this is 436 over it, 1.87\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":"compiler/rustc_metadata/src/creader.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"080a7e3cd218469efc0af445c69accee7be857ac607b670cd0dfe0dc907cc441"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustc_codegen_ssa::back::link::raw_dylib::create_elf_raw_dylib_stub: FunctionTooLong \u2014 rustc_codegen_ssa::back::link::raw_dylib::create_elf_raw_dylib_stub runs 187 significant 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 87 over it, 1.87\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/back/link/raw_dylib.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1b5480aac6690009ae6d08a77e3f72f71cde288d19948f072d4dd2c9dec4f06"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustdoc::clean::clean_middle_ty: FunctionTooLong \u2014 rustdoc::clean::clean_middle_ty runs 187 significant 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 87 over it, 1.87\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/clean/mod.rs"},"region":{"startLine":2136}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ca9bf107ea57547a5df391f9a2868e132cac0042da1aa85fa6584173e2681af"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Handle: TooManyMethods \u2014 56 methods, declared across 4 files: btree/node.rs (36), btree/navigate.rs (13), btree/fix.rs (4), btree/remove.rs (3). The bar is 30 methods; this is 26 over it, 1.87\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/alloc/src/collections/btree/node.rs"},"region":{"startLine":830}}}],"partialFingerprints":{"codehealthFindingId/v1":"929b7eb5da48308c79421218a2ec626e8dadf0742ccbfeb6b9ecc652d73befc1"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: WrongNumberOfGenericArgs: ClassTooLong \u2014 746 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 36 methods, 3 blocks, lines 12-1233. The bar is 400 significant lines; this is 346 over it, 1.87\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":"compiler/rustc_hir_analysis/src/diagnostics/wrong_number_of_generic_args.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"736de9823b10609d243e5aeb6355c3d51413859c0bca853229233afb5bac45c0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lower/path.rs: FileTooLong \u2014 931 significant 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 68% of them inside a single declaration: PathLoweringContext (2 blocks, 58-1005). The bar is 500 significant lines; this is 431 over it, 1.86\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/tools/rust-analyzer/crates/hir-ty/src/lower/path.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aca93489567bc85b9cff8c432aca52066d363870e1b4310195725e9458bf43b3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/search.rs: FileTooLong \u2014 931 significant 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 65% of them inside a single declaration: FindUsages (2 blocks, 441-1376). The bar is 500 significant lines; this is 431 over it, 1.86\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/tools/rust-analyzer/crates/ide-db/src/search.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"91f981f9443e0c0259cef324694a1e2513e1ff83cdf65633295f7fc4db1eaa31"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Llvm.run: MethodTooLong \u2014 run runs 186 significant 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 86 over it, 1.86\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/bootstrap/src/core/build_steps/llvm.rs"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"71521f383ac12431195b694fd1cd567d74689539f85bb84bd41536156d79f779"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: opt_dist::execute_pipeline: FunctionTooLong \u2014 opt_dist::execute_pipeline runs 186 significant 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 86 over it, 1.86\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/tools/opt-dist/src/main.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"205cf740ad2cb3188f14866a40e8798f4d12d5a33a9fdecdc563e6e96e8a57ee"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: str/pattern.rs: FileTooLong \u2014 929 significant 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 429 over it, 1.86\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/str/pattern.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b913823604ea6273967dd10f4109b4abca96d2e5a61e523bd3863f5202b1fcf3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Ty.rewrite_result: MethodTooLong \u2014 rewrite_result runs 185 significant 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 85 over it, 1.85\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/tools/rustfmt/src/types.rs"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"95ec3035cf446aeb322ce5553e66268daf97b7cad421c72c07dd15cbf05263b7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: btree/node.rs: FileTooLong \u2014 922 significant 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 422 over it, 1.84\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":"library/alloc/src/collections/btree/node.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6694fa631e8bb315daebb3261c42e0d361b4da17e41ba236407ca0095d1b114e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/passes.rs: FileTooLong \u2014 921 significant 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 421 over it, 1.84\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":"compiler/rustc_interface/src/passes.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6381f4579c88015877841da8976c751a27c3f6d1a962c6aee3c26cb467db2134"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: bootstrap/bootstrap.py: FileTooLong \u2014 920 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 420 over it, 1.84\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/bootstrap/bootstrap.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"408a158240c2a9fc46897594052e0014fbadcb837002c906ee739e9e801fde32"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: x86/sse.rs: FileTooLong \u2014 920 significant 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 106 free functions. The bar is 500 significant lines; this is 420 over it, 1.84\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":"library/stdarch/crates/core_arch/src/x86/sse.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"43a09fc8e847beaad125d15c4c7a0abcb3406ac190e3e754f9e8300c0fc36d6a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: clippy_lints::doc::check_doc: FunctionTooLong \u2014 clippy_lints::doc::check_doc runs 184 significant 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 84 over it, 1.84\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/tools/clippy/clippy_lints/src/doc/mod.rs"},"region":{"startLine":1133}}}],"partialFingerprints":{"codehealthFindingId/v1":"d73a2d622508bb705ddef461aae222ab3850406ed246760c0d5c363e3b1237a3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ide_db::prime_caches::parallel_prime_caches: FunctionTooLong \u2014 ide_db::prime_caches::parallel_prime_caches runs 184 significant 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 84 over it, 1.84\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/tools/rust-analyzer/crates/ide-db/src/prime_caches.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"cef29011e834bfcf7c5de581c2d9c45d67c1a8c9aa0da04311ceb4d04ab4a4a3"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ThirPrinter: ClassTooLong \u2014 735 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 21 methods, 3 blocks, lines 29-1016. The bar is 400 significant lines; this is 335 over it, 1.84\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":"compiler/rustc_mir_build/src/thir/print.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"0618fc8a8870cace0b2a03e9359a6900b23ec891450e155f27e210b9c31bf1c0"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: AstValidator: TooManyMethods \u2014 55 methods. The bar is 30 methods; this is 25 over it, 1.83\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":"compiler/rustc_ast_passes/src/ast_validation.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef330efdb877c0308350283c91f1fd94006352bf6c285594bbe9ed15b1c6f401"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TypeckResults: TooManyMethods \u2014 55 methods. The bar is 30 methods; this is 25 over it, 1.83\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":"compiler/rustc_middle/src/ty/typeck_results.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf0259e7c9b2484b8256f82a2a11e5be71f897968e9436cf5e563f002e9d4df6"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ItemScope: TooManyMethods \u2014 55 methods. The bar is 30 methods; this is 25 over it, 1.83\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/tools/rust-analyzer/crates/hir-def/src/item_scope.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d9b15c585abe4316bbfeb4fbfd5925cad1634962e99da900267215649c511b9"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: rustfmt_nightly::utils: TooManyFunctions \u2014 55 free functions. The bar is 30 free functions; this is 25 over it, 1.83\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/tools/rustfmt/src/utils.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7b1c22aeda4e9ba683e000a9228e0017261319dbb2a1bf7bfc40cdb1ac75410"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TyLoweringContext: ClassTooLong \u2014 733 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 44 methods, 3 blocks, lines 226-1398. The bar is 400 significant lines; this is 333 over it, 1.83\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/tools/rust-analyzer/crates/hir-ty/src/lower.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"22f1ef8794092375f8a042d3d544c6b27485cbe482cc712bdccccca31e0703f8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: select/candidate_assembly.rs: FileTooLong \u2014 916 significant 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 98% of them inside a single declaration: SelectionContext (29-1579). The bar is 500 significant lines; this is 416 over it, 1.83\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/traits/select/candidate_assembly.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b31d268dda0118c4d9d6809484e48d19d6fbc724b7b0a1844e1d1d9ce99363c1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EncodeContext.encode_crate_root: MethodTooLong \u2014 encode_crate_root runs 183 significant 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 83 over it, 1.83\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_metadata/src/rmeta/encoder.rs"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ea3e0d50911432f697e3bb2f3bcd6f242503c1e7f8f47e41ec8ba71739e222b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: compiletest::directives::needs::prepare_needs_conditions: FunctionTooLong \u2014 compiletest::directives::needs::prepare_needs_conditions runs 183 significant 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 83 over it, 1.83\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/compiletest/src/directives/needs.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"faa1b4442bf2b7039f80fc87902943a7a13d563fd6b687dbcbf7af0c25b94196"}},{"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/tools/miri/src/shims/windows/foreign_items.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7880b5e0addd078f0e296199df60c75068106ed7e15bf19d693cd4319b9bbfb1"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ProjectWorkspace: ClassTooLong \u2014 728 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 19 methods, 3 blocks, lines 57-1104. The bar is 400 significant lines; this is 328 over it, 1.82\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/tools/rust-analyzer/crates/project-model/src/workspace.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8f922f396208baac3fa08d59217b9ed2bf6f9d34497893dbb612598f8f89b19"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: State.print_expr: MethodTooLong \u2014 print_expr 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":"compiler/rustc_hir_pretty/src/lib.rs"},"region":{"startLine":1572}}}],"partialFingerprints":{"codehealthFindingId/v1":"7498ca04e6a87fb0b8bfa25067205420855dc022ea697ab3ffb6b346a270ff29"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: InlineAsmCtxt.check_asm_operand_type: MethodTooLong \u2014 check_asm_operand_type 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":"compiler/rustc_hir_typeck/src/inline_asm.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"446425a7993b9e3203110e17f498a9817651e88321b3611c7fdd6164bfdb532b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EncodeContext.encode_def_ids: MethodTooLong \u2014 encode_def_ids 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":"compiler/rustc_metadata/src/rmeta/encoder.rs"},"region":{"startLine":1486}}}],"partialFingerprints":{"codehealthFindingId/v1":"8beca405c48918855e87ea670d6908dd1dc5d89af56829f5c6fe205f9d1839c8"}},{"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/tools/miri/src/shims/unix/fs.rs"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"c39e080654e626d1c118c39b49fd243a484ea69d1928cad9be1992c44023ca31"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ide_assists::handlers::add_missing_match_arms::add_missing_match_arms: FunctionTooLong \u2014 ide_assists::handlers::add_missing_match_arms::add_missing_match_arms 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/tools/rust-analyzer/crates/ide-assists/src/handlers/add_missing_match_arms.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"72e619224bb8acca56e0727d2f9343a1bc91825ccb83802b0db15367b76c05e3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: neon/mod.rs: FileTooLong \u2014 905 significant 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 405 over it, 1.81\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/arm_shared/neon/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8d4524f97bf2cc26c7f8e279618adf42311ca6902c8ae2f6da77ca21489b693"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mir/visit.rs: FileTooLong \u2014 904 significant 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 404 over it, 1.81\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/mir/visit.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6c7c27aee20865e2a0df34502464e632ffaa6f8f7f9e6261e55369f601a478d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: back/write.rs: FileTooLong \u2014 902 significant 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 402 over it, 1.80\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":"compiler/rustc_codegen_llvm/src/back/write.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b12c7672327e300c832b37f38c0930c9af3aa555b17bffa78365cb4ba8ebdf9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ide_completion::context::analysis::expand: FunctionTooLong \u2014 ide_completion::context::analysis::expand runs 180 significant 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 80 over it, 1.80\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/tools/rust-analyzer/crates/ide-completion/src/context/analysis.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d1ca48be594c69bac2c581c844d674b8e0df964015a9d46960e5d6f8caadd0c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ide::inlay_hints::adjustment::hints: FunctionTooLong \u2014 ide::inlay_hints::adjustment::hints runs 180 significant 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 80 over it, 1.80\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/tools/rust-analyzer/crates/ide/src/inlay_hints/adjustment.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"63646ae264cdf169e73116cb92b5dcdb20820766028c4e6844cfbf682775462e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GlobalState.switch_workspaces: MethodTooLong \u2014 switch_workspaces runs 180 significant 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 80 over it, 1.80\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/tools/rust-analyzer/crates/rust-analyzer/src/reload.rs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e3b37bf2cb8830fe0c50b925362b90357e61ee3448c94b3298348591f94f1e5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: infer/pat.rs: FileTooLong \u2014 898 significant 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 88% of them inside a single declaration: InferenceContext (240-1732). The bar is 500 significant lines; this is 398 over it, 1.80\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/tools/rust-analyzer/crates/hir-ty/src/infer/pat.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a051752766ac887f93a49919bc24b1deb079fe78b67e747822594f1b303a4340"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/op.rs: FileTooLong \u2014 897 significant 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 85% of them inside a single declaration: FnCtxt (27-1167). The bar is 500 significant lines; this is 397 over it, 1.79\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":"compiler/rustc_hir_typeck/src/op.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c19f6c5d96ca4ba67222c6186b477bd2ac1104b35a872e65038b8b704b4f5696"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Scip.run: MethodTooLong \u2014 run runs 179 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 79 over it, 1.79\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/cli/scip.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"359b4125a52ff81f80ff5d279ca8ae3ecfacd37f02b521f942758e02c3653dc5"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ExprUseVisitor: ClassTooLong \u2014 713 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 43 methods, 3 blocks, lines 407-1762. The bar is 400 significant lines; this is 313 over it, 1.78\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/infer/closure/analysis/expr_use_visitor.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"86a02dc676ec4c8847d6f6681cb8df7c7dd2f4a75e365157697baeb6060df423"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/demand.rs: FileTooLong \u2014 891 significant 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 98% of them inside a single declaration: FnCtxt (19-1339). The bar is 500 significant lines; this is 391 over it, 1.78\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":"compiler/rustc_hir_typeck/src/demand.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"25dbcd608070117070a1ccb1e897aaccd4ea71bd3b9609db5ad9b7c0b0b7d9f3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Classifier.advance: MethodTooLong \u2014 advance runs 178 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 78 over it, 1.78\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/highlight.rs"},"region":{"startLine":1060}}}],"partialFingerprints":{"codehealthFindingId/v1":"67630715b6adc91e18dfeef626a8b3fe849acc3569ede24609d2442674c8e90e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustdoc::html::render::print_item::item_module: FunctionTooLong \u2014 rustdoc::html::render::print_item::item_module runs 178 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 78 over it, 1.78\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/render/print_item.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1d0e3cf8a291c2028e51efd2429d12b4c5cd809b45a0500dea67a454743eef9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustfmt_nightly::lists::write_list: FunctionTooLong \u2014 rustfmt_nightly::lists::write_list runs 178 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 78 over it, 1.78\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/lists.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"72fce714d794fc1b22e3d21c77aa0342a3b8ff7a62df7f7f1737d4eeb5f16bf0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/mpfloat.rs: FileTooLong \u2014 887 significant 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 387 over it, 1.77\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/compiler-builtins/libm-test/src/mpfloat.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"54c4ddb481d3b64ae51929838b67d3738fd4505d458bafa06c23cd409caca5fb"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ProbeContext: ClassTooLong \u2014 709 significant 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, 4 blocks, lines 48-2082. The bar is 400 significant lines; this is 309 over it, 1.77\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/tools/rust-analyzer/crates/hir-ty/src/method_resolution/probe.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d1c1e968392995cfe140b7ff6dfb3b509075645a8095275ecafab5b2bacce9d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lexer/mod.rs: FileTooLong \u2014 886 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 90% of them inside a single declaration: Lexer (2 blocks, 125-1301). The bar is 500 significant lines; this is 386 over it, 1.77\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":"compiler/rustc_parse/src/lexer/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ad3a8322d10efd17612e98b3501d618825bdc96e4237d444e8cceb92c03cacf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 885 significant 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 385 over it, 1.77\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_errors/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"db4facb1f99c0420d6e40fda4c5efb24b8326eb0543739946f73cd0c9f45b0b0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustc_hir_analysis::collect::type_of::type_of: FunctionTooLong \u2014 rustc_hir_analysis::collect::type_of::type_of runs 177 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 77 over it, 1.77\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/collect/type_of.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bb2513bf49b2dc6eb6ce92a5c09b8c3a2c73a21f135be539b64083559db6323"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TypeChecker: ClassTooLong \u2014 707 significant 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, 3 blocks, lines 578-1685. The bar is 400 significant lines; this is 307 over it, 1.77\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":"compiler/rustc_mir_transform/src/validate.rs"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ab0a98b0770027c43a8a181a62ea2091632d4b4c0d65f01e4b62d53af53ad45"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: AdtDef: TooManyMethods \u2014 53 methods, declared across 2 files: ty/adt.rs (44), ty/def.rs (9). The bar is 30 methods; this is 23 over it, 1.77\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. Most of these members implement adt.AdtDef (52 of 52 members), so moving them onto a smaller type would remove them from that contract rather than reduce it. To reduce it, split the contract instead: give each cohesive group of operations its own smaller interface and its own implementing type. Where the contract has to stay whole, move the work behind these members into collaborator types, so what is left here is a forward per member rather than a responsibility per member."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/ty/adt.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"7459c47c8bc038443dbcb029b2c7ea88050353df4276af863a965a4dd5588fd1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Box: TooManyMethods \u2014 53 methods, declared across 2 files: src/boxed.rs (48), boxed/convert.rs (5). The bar is 30 methods; this is 23 over it, 1.77\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":"library/alloc/src/boxed.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaf830bd919d4738c259e0cd9548d779a5b4b1738a095e70c19a6b6378cc6cb5"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: core_arch::amdgpu: TooManyFunctions \u2014 53 free functions. The bar is 30 free functions; this is 23 over it, 1.77\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":"library/stdarch/crates/core_arch/src/amdgpu/mod.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"58ff0852314c864d0fee892ab0fcd720da9c6d21f53720c53896f44c54686598"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ValidityVisitor: ClassTooLong \u2014 705 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 15 methods, 3 blocks, lines 349-1609. The bar is 400 significant lines; this is 305 over it, 1.76\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":"compiler/rustc_const_eval/src/interpret/validity.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c756db03eef788a8c866f5373c6fe17d0b05187f7c1c0e03e014829e4f3d674"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: json/conversions.rs: FileTooLong \u2014 881 significant 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 381 over it, 1.76\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/json/conversions.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"edca8719de95312472708ec3aff42afd897bf385191a538f9cef71c630a7f8d4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: infer/coerce.rs: FileTooLong \u2014 876 significant 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 376 over it, 1.75\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/tools/rust-analyzer/crates/hir-ty/src/infer/coerce.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f79ef8066994e0383fb839793406db01a55a3780c5ca11be7c9b4dd0e2ab16cf"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CoerceMany.coerce_inner: MethodTooLong \u2014 coerce_inner runs 175 significant 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 75 over it, 1.75\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":"compiler/rustc_hir_typeck/src/coercion.rs"},"region":{"startLine":1703}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f4d7a2bf7c85ad7286ea2f6775137f2b5eb78798e93e6b53b0223c52eeac064"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mbe::expander::matcher::match_loop_inner: FunctionTooLong \u2014 mbe::expander::matcher::match_loop_inner runs 175 significant 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 75 over it, 1.75\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/tools/rust-analyzer/crates/mbe/src/expander/matcher.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eea03f8d96f1a1de93a1ef11ef023274cf8bb09ad02f852f42eeeb5b234c60b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: interpret/intrinsics.rs: FileTooLong \u2014 871 significant 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 96% of them inside a single declaration: InterpCx (84-1393). The bar is 500 significant lines; this is 371 over it, 1.74\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":"compiler/rustc_const_eval/src/interpret/intrinsics.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffcefe80f9640fd3c67aad9325d544159f332f192f2b806c65f0607203691255"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: State.print_item: MethodTooLong \u2014 print_item runs 174 significant 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 74 over it, 1.74\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":"compiler/rustc_hir_pretty/src/lib.rs"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b6d6e5bd9e89b1185bdce83e87d0c2b3f00e78b932ab4faa8ac7b1c02d0e11a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/macros.rs: FileTooLong \u2014 867 significant 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 88% of them inside a single declaration: Resolver (2 blocks, 178-1318). The bar is 500 significant lines; this is 367 over it, 1.73\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":"compiler/rustc_resolve/src/macros.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5b94fb67c87cc3730230991e3dbd2598eaf9836a8dbfa1fcd0d18f7e9e3657a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Scalar: TooManyMethods \u2014 52 methods. The bar is 30 methods; this is 22 over it, 1.73\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":"compiler/rustc_middle/src/mir/interpret/value.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"344714c342fd004bcf547d05c830bc83722b3850797b17a0d4bf9fb37bc40745"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: assembly/mod.rs: FileTooLong \u2014 866 significant 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 62% of them inside a single declaration: EvalCtxt (2 blocks, 479-1434). The bar is 500 significant lines; this is 366 over it, 1.73\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":"compiler/rustc_next_trait_solver/src/solve/assembly/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"715a24b07b954c9e06c3aaa3d87b2cd953f4b20ffbff6d2d4ea16a25492660c6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustc_codegen_ssa::back::link::linker_with_args: FunctionTooLong \u2014 rustc_codegen_ssa::back::link::linker_with_args runs 173 significant 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 73 over it, 1.73\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":"compiler/rustc_codegen_ssa/src/back/link.rs"},"region":{"startLine":2910}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6dcde845e151b7ef1230ba6de50d2bafe0e1d1d962bb3265e6ef3c504b4983e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FnCtxt.note_source_of_type_mismatch_constraint: MethodTooLong \u2014 note_source_of_type_mismatch_constraint runs 173 significant 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 73 over it, 1.73\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":"compiler/rustc_hir_typeck/src/demand.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"e37b8435bea1535fb4c4a000347642701589cd1a47408bd87693eab5bdb6cf17"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: libm::math::pow::pow: FunctionTooLong \u2014 libm::math::pow::pow runs 173 significant 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 73 over it, 1.73\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":"library/compiler-builtins/libm/src/math/pow.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbb80e1c461d56c3507a8b8b4a161f3c587a7f861524deb1883e2353ab639f00"}},{"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/tools/miri/src/intrinsics/x86/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae3c21eeb4a93906c7c61b763e2a86cb49fee2794a7001f16a235f71bbfec38f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: analysis/expr_use_visitor.rs: FileTooLong \u2014 860 significant 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: ExprUseVisitor (3 blocks, 407-1762). The bar is 500 significant lines; this is 360 over it, 1.72\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/tools/rust-analyzer/crates/hir-ty/src/infer/closure/analysis/expr_use_visitor.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f030e742909c1d417037206df825c4e2443a5c518f53f451e83fee7adcf62d20"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WfPredicates.visit_ty: MethodTooLong \u2014 visit_ty runs 171 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 71 over it, 1.71\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/traits/wf.rs"},"region":{"startLine":775}}}],"partialFingerprints":{"codehealthFindingId/v1":"23371fcff221dc1490f3516722ad73979a36de5288e444de763bde286747c5e7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: intrinsic/llvm.rs: FileTooLong \u2014 854 significant 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 354 over it, 1.71\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":"compiler/rustc_codegen_gcc/src/intrinsic/llvm.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b22e0080572b61cef20cfdc2feb28a05c26dfb86a0dfecf6bb46f6b189d761fe"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Printer: ClassTooLong \u2014 681 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 18 methods, 3 blocks, lines 450-1411. The bar is 400 significant lines; this is 281 over it, 1.70\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/tools/rust-analyzer/crates/hir-def/src/expr_store/pretty.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee34fec1a49657be6d82a2078695fe5d5cde001174d4746adf05f76216b7e40c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: GlobalState: TooManyMethods \u2014 51 methods, declared across 4 files: src/main_loop.rs (18), src/global_state.rs (16), src/reload.rs (13), lsp/utils.rs (4). The bar is 30 methods; this is 21 over it, 1.70\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/tools/rust-analyzer/crates/rust-analyzer/src/global_state.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"b80d50ae7e15cf51c245cbe4586c4ba3d78aba2b8ae904f51e0cecfc7be0d44f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: TestProps: TooManyFields \u2014 51 stored fields beside 6 methods. The bar is 30 stored fields; this is 21 over it, 1.70\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/tools/compiletest/src/directives.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ea2ba85101afb957e5d3fa6fa446a153790a657a09a01bbc0aa5d05b53f606a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/directives.rs: FileTooLong \u2014 849 significant 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 349 over it, 1.70\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/tools/compiletest/src/directives.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"81b8f4d6e4527ff60ecbadfe7c56027d8c5a527a26ace622bedabad6273fc006"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: attributes/rustc_internal.rs: FileTooLong \u2014 846 significant 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 346 over it, 1.69\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_attr_parsing/src/attributes/rustc_internal.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d0c2aba77c2c6a723977ceb05d4ffd3fb0f45a204192e73153bc3cf092020bb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/bit_set.rs: FileTooLong \u2014 845 significant 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 345 over it, 1.69\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_index/src/bit_set.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c3525443c123f99e78f0454873a229a1fbafe6c58e879043d7b3c7a6b3e70f3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ty/tys.rs: FileTooLong \u2014 845 significant 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 345 over it, 1.69\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_public/src/ty/tys.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"afdbac9fd09922c1e8bc24922a2dd350d039daa8140fc499d12d902f4bf47e0f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Parser.expected_one_of_not_found: MethodTooLong \u2014 expected_one_of_not_found runs 169 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 69 over it, 1.69\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/diagnostics.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dc4c61830764ba50eb98d253aa721e7dda26a772bf48a4d0947fffbf2eb02b9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ide_assists::handlers::extract_variable::extract_variable: FunctionTooLong \u2014 ide_assists::handlers::extract_variable::extract_variable runs 169 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 69 over it, 1.69\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/extract_variable.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"c30ef8a3f21785eff098d22a1a975e371e8491db3b8d30a76ffe1e4570b76edf"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ide_diagnostics::semantic_diagnostics: FunctionTooLong \u2014 ide_diagnostics::semantic_diagnostics runs 169 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 69 over it, 1.69\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-diagnostics/src/lib.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3559291fddf70b9c1656d53a4c11c9c171cb200210ec81e2d9da737e3a80649"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: select/confirmation.rs: FileTooLong \u2014 843 significant 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 98% of them inside a single declaration: SelectionContext (32-1299). The bar is 500 significant lines; this is 343 over it, 1.69\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":"compiler/rustc_trait_selection/src/traits/select/confirmation.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a718d653930637eef64f6e599dfbb29d564be35da5dc3d623027fb07ca5b2bd2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ty/layout.rs: FileTooLong \u2014 842 significant 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 342 over it, 1.68\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/ty/layout.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b051c9181eac7fbca2cc34e9e9b9d8410594ca435c71818507653e03f6001250"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: riscv_shared/p.rs: FileTooLong \u2014 841 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 105 free functions. The bar is 500 significant lines; this is 341 over it, 1.68\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/riscv_shared/p.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad32415304a81cbbb9e92b9929f34eb368b8a3df0e82ef093007a79d084e67a5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ProbeContext.consider_probe: MethodTooLong \u2014 consider_probe runs 168 significant 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 68 over it, 1.68\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/method/probe.rs"},"region":{"startLine":2000}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fee62967a98417f6e695a02473225b1ff8c2a98e8b804ab4cdd803a3e2e9802"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NiceRegionError.report_trait_placeholder_mismatch: MethodTooLong \u2014 report_trait_placeholder_mismatch runs 168 significant 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 68 over it, 1.68\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/error_reporting/infer/nice_region_error/placeholder_error.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"772d05b453e72ce3022585cec66fdc4d24fb3b097142f956a32c58036c201812"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/shim.rs: FileTooLong \u2014 838 significant 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 338 over it, 1.68\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/shim.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9378fecf70a86370019b66c8fa68133c866a28b1214ff424b368f8ce39f8a3e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FnCtxt.probe_op: MethodTooLong \u2014 probe_op runs 167 significant 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 67 over it, 1.67\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":"compiler/rustc_hir_typeck/src/method/probe.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"0932652dc0e5e001093f3ab55815469d7b94c653a1bdf6b39a0cb08344344f6c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: clippy_utils::ast_utils::eq_item_kind: FunctionTooLong \u2014 clippy_utils::ast_utils::eq_item_kind runs 167 significant 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 67 over it, 1.67\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/tools/clippy/clippy_utils/src/ast_utils/mod.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"479733f2be62026feb26ec97525157e5b57b6d0adb0d9acce335e52ad6724089"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Validator: TooManyMethods \u2014 50 methods. The bar is 30 methods; this is 20 over it, 1.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/tools/jsondoclint/src/validator.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbdc6f626a762ea6f82633bd98258dda3f298440ee467cf1820fd27874df496f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: stable/ty.rs: FileTooLong \u2014 831 significant 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 331 over it, 1.66\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":"compiler/rustc_public/src/unstable/convert/stable/ty.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aede8d4dfea052a8f850f8ea4115b9d7c959d6870645226ffecb5e73082c24bc"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustc_builtin_macros::autodiff::llvm_enzyme::expand_with_mode: FunctionTooLong \u2014 rustc_builtin_macros::autodiff::llvm_enzyme::expand_with_mode runs 166 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 66 over it, 1.66\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_builtin_macros/src/autodiff.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"4115dd9f31bd3dd18432756d782d935ed981f2cbee89d440ce4b1b8a430d66a1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustc_driver_impl::print_crate_info: FunctionTooLong \u2014 rustc_driver_impl::print_crate_info runs 166 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 66 over it, 1.66\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_driver_impl/src/lib.rs"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"fee5f1a977fbfee62e8f6f3ce9f2e144a417fd1762f646e7f1b1b4a19724cd27"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FnCtxt.report_method_error: MethodTooLong \u2014 report_method_error runs 166 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 66 over it, 1.66\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/method/suggest.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ef3f1b7e4336b8788e3026606df7aee680743bd3586d33e3bfd6d4a96491c30"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FnCtxt.report_no_match_method_error: MethodTooLong \u2014 report_no_match_method_error runs 166 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 66 over it, 1.66\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/method/suggest.rs"},"region":{"startLine":1233}}}],"partialFingerprints":{"codehealthFindingId/v1":"056329c1e623e5a3301ba03464b4a666030376c731366b7bef6429fd02cf264e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ExprCollector.collect_pat: MethodTooLong \u2014 collect_pat runs 166 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 66 over it, 1.66\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/expr_store/lower.rs"},"region":{"startLine":2918}}}],"partialFingerprints":{"codehealthFindingId/v1":"0488353196bfe112700b387f7ac76a69b56e65d7e007fe38d363e9399592c323"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: diagnostics/move_errors.rs: FileTooLong \u2014 829 significant 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 329 over it, 1.66\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":"compiler/rustc_borrowck/src/diagnostics/move_errors.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dd9c0fae9458680a6ab862a9f42bf715d4fb892da97476a7d538204245c3a9f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 829 significant 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 329 over it, 1.66\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/tools/clippy/clippy_lints/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f52b04000cd33308254107e8ff4c290a69e7f060f1f6e4c9cca51949bace9f8e"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Methods: ClassTooLong \u2014 663 significant 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, 4 blocks, lines 5250-6181. The bar is 400 significant lines; this is 263 over it, 1.66\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/tools/clippy/clippy_lints/src/methods/mod.rs"},"region":{"startLine":5250}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc8356edca6b7aaafa8746696f4d9861c376fec6035854967afb676e80bf88d3"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: CastCheck: ClassTooLong \u2014 662 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 17 methods, 2 blocks, lines 74-1317. The bar is 400 significant lines; this is 262 over it, 1.66\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":"compiler/rustc_hir_typeck/src/cast.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"1711a3ced29a150202a857098fb6571a0f362063d9a3e34542ccee15ee553026"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/consts.rs: FileTooLong \u2014 827 significant 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 327 over it, 1.65\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_utils/src/consts.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1f6720d4a7e82ce7eda822332f656d6df78caee14fa1ca7e4215850e4aa2cfc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: librustdoc/lib.rs: FileTooLong \u2014 826 significant 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 326 over it, 1.65\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3eaf403b1c5f8fd490c63afbf7baad39ceceb486753129ca7abcf8180c5d004"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustc_hir_analysis::hir_ty_lowering::generics::check_generic_arg_count: FunctionTooLong \u2014 rustc_hir_analysis::hir_ty_lowering::generics::check_generic_arg_count runs 165 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 65 over it, 1.65\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/hir_ty_lowering/generics.rs"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeefb4d1367b024ad0bc74a5cf9f94641b7da1e86da3f187937cf1226485202e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/base.rs: FileTooLong \u2014 824 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 324 over it, 1.65\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/src/base.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e332214e7331915aea2c2d92902c9d45e566ed09ed02bd418f33692602ac245"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/inline.rs: FileTooLong \u2014 823 significant 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 323 over it, 1.65\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/inline.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fef700070987a46f6c8ad8b59803c1754753ab139cc69118730dd02b402e31a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: libm::math::rem_pio2_large::rem_pio2_large: FunctionTooLong \u2014 libm::math::rem_pio2_large::rem_pio2_large runs 164 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 64 over it, 1.64\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/compiler-builtins/libm/src/math/rem_pio2_large.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"5db1eca6870d296b7569230806af5308a2d91c9b85ac552608a90f7b3d1e884b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/visit.rs: FileTooLong \u2014 819 significant 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 319 over it, 1.64\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ast/src/visit.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"63a2f7dd8d94e3972219d81491a7b2063cf6a75eca964e4ca5262f8fd6546da6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: region_infer/region_context.rs: FileTooLong \u2014 819 significant 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 319 over it, 1.64\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/region_infer/region_context.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1db5d88e80c53a6128b22124e6f3a302344680ff0f0e119d2e03ed53e45d0f9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/unused.rs: FileTooLong \u2014 819 significant 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 319 over it, 1.64\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_lint/src/unused.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0307372000dcc2f022a6569f9b088a7ffdca4d612c3332220c378be0ff619c7b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mir/mod.rs: FileTooLong \u2014 817 significant 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 317 over it, 1.63\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":"compiler/rustc_middle/src/mir/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"649e173b7cfd94a6350ea6cac5014d955fad8fff8e2554275fe84fc19a88173f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: GlobalState: TooManyFields \u2014 49 stored fields beside 51 methods. The bar is 30 stored fields; this is 19 over it, 1.63\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/tools/rust-analyzer/crates/rust-analyzer/src/global_state.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7009a94e4fe93cfeebeb5533f26696430e73056c29cd313abf97a00e37eacb0"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: rustc_codegen_llvm::llvm: TooManyFunctions \u2014 49 free functions. The bar is 30 free functions; this is 19 over it, 1.63\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":"compiler/rustc_codegen_llvm/src/llvm/mod.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"d22bb9566c4fbaf35027e72bb8f817efee63ee8f1410ce739a7d5fabfa65f327"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Item: TooManyMethods \u2014 49 methods. The bar is 30 methods; this is 19 over it, 1.63\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/librustdoc/clean/types.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"5337b3c041ea0e56f2c83a3465454a2c6749cd1580effaec37c74903b6f8790c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/int.rs: FileTooLong \u2014 816 significant 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: Builder (21-816). The bar is 500 significant lines; this is 316 over it, 1.63\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":"compiler/rustc_codegen_gcc/src/int.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8a15449c4d7f05f53f442a1e8be3d6f1e58fe1e2ae2a35ff9780ec160dab159"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AttributeParser.parse_attribute_list: MethodTooLong \u2014 parse_attribute_list runs 163 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 63 over it, 1.63\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_attr_parsing/src/interface.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"baaca0ab53b8ff736259b6cbe18c90f9c4314249e1c65f7941fb93b9f8c48125"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/cast.rs: FileTooLong \u2014 814 significant 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: CastCheck (2 blocks, 74-1317). The bar is 500 significant lines; this is 314 over it, 1.63\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":"compiler/rustc_hir_typeck/src/cast.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"14f54865f665bd29ffbb466e41937915768855c4ac94b85622ce7012b7627d1e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/expr_store.rs: FileTooLong \u2014 811 significant 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 311 over it, 1.62\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/expr_store.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2ae5b03ae2a34aae1e7075c4f524dd85c9608fb0e8c90550b405c0b31bea111"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: RustcPatCtxt: ClassTooLong \u2014 648 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 15 methods, 4 blocks, lines 78-1048. The bar is 400 significant lines; this is 248 over it, 1.62\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":"compiler/rustc_pattern_analysis/src/rustc.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"a82906d84f61cc0563037af0e9189f1d37bace4ad3128bfc4fe5be3802625cf1"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SerializedSearchIndex: ClassTooLong \u2014 648 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 10 methods, 2 blocks, lines 37-902. The bar is 400 significant lines; this is 248 over it, 1.62\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/librustdoc/html/render/search_index.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ad8123c2b4a4adb8b383996e147e837748d291176377ebfa611e4f6c3330581"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustc_const_eval::check_consts::ops::build_error_for_const_call: FunctionTooLong \u2014 rustc_const_eval::check_consts::ops::build_error_for_const_call runs 162 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 62 over it, 1.62\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_const_eval/src/check_consts/ops.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"c004ddabfa39953f0829aa7ca22de09ba8e9b5428e00fe754325b34481361d53"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FnCtxt.report_binop_fulfillment_errors: MethodTooLong \u2014 report_binop_fulfillment_errors runs 162 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 62 over it, 1.62\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/op.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"b89c64d25afa658de895207a67b7d214c12222d88c4fba2bf0e03383a73205df"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Builder.ast_block_stmts: MethodTooLong \u2014 ast_block_stmts runs 162 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 62 over it, 1.62\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_build/src/builder/block.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd6ea99af3b0fb2c3fef60a0ef41aec693948631e5ac0a6beca608b0646afae7"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Builder: ClassTooLong \u2014 646 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 43 methods, 4 blocks, lines 45-1767. The bar is 400 significant lines; this is 246 over it, 1.62\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/bootstrap/src/core/builder/mod.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"05a9a6a53ae78121c4a6f5cf3e40cda5bae43b23a88e364bc59965fa348149f5"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: EvalContextExt: ClassTooLong \u2014 646 significant 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 246 over it, 1.62\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/tools/miri/src/shims/unix/socket.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff833926c548626cc1b8484cf656e4a82c54ffe39c6e3a0e00fcddf7c1aa89d8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FnCtxt.check_tupled_arguments: MethodTooLong \u2014 check_tupled_arguments runs 161 significant 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 61 over it, 1.61\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/fn_ctxt/checks.rs"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"e91b8a23e204cf85a7b677abb9bdc12836651c6c5ec9172728d0cdd0f7144773"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: InterPat.lower_thir_pat: MethodTooLong \u2014 lower_thir_pat runs 161 significant 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 61 over it, 1.61\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_build/src/builder/matches/match_pair.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"807653a8c6cdbeffc4dd092375b99476b2092c89c8b62b631fe1c5381e2f1451"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustc_mir_build::thir::pattern::check_match::report_non_exhaustive_match: FunctionTooLong \u2014 rustc_mir_build::thir::pattern::check_match::report_non_exhaustive_match runs 161 significant 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 61 over it, 1.61\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_build/src/thir/pattern/check_match.rs"},"region":{"startLine":1250}}}],"partialFingerprints":{"codehealthFindingId/v1":"08a7a95e9e836e78f4ec9bbfa04d1cd123c18bad361f660efa42ef13bea86524"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: InferenceContext.infer_closure: MethodTooLong \u2014 infer_closure runs 161 significant 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 61 over it, 1.61\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/infer/closure.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fad0477c2af8d4a6a3d3ef4b4bf188d8147afbd2381c81f94b9224a9a9bcc48"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: str/iter.rs: FileTooLong \u2014 804 significant 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 304 over it, 1.61\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":"library/core/src/str/iter.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1010f2a580c61a5ba86d991e44ee21750532d562fd2da55a16396159cec0a3f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/format.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":"compiler/rustc_builtin_macros/src/format.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe7fc5d1ecf24dfe878044370c40fbcb13df944c0534f9178465b7f69a228109"}},{"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/tools/miri/src/shims/unix/tcp_socket.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c607e611f29432a1b6fbfdedd750c0885604c5bae96874593568ccdabbb02612"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/utils.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), declaring 56 free functions. 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/tools/rust-analyzer/crates/ide-assists/src/utils.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab4498edade5f2de8e68cb308b8c1229ae533cdfc9b9d6b5a4eee8b690e2a6fe"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: GenericCx: TooManyMethods \u2014 48 methods, declared across 4 files: src/type_.rs (22), src/context.rs (15), src/common.rs (6), src/declare.rs (5). The bar is 30 methods; this is 18 over it, 1.60\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":"compiler/rustc_codegen_llvm/src/context.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"63793de805fb01e24403cd1b5736f0044e7eae01d4194dae3be6b26dd8d246b4"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Socket: TooManyMethods \u2014 48 methods. The bar is 30 methods; this is 18 over it, 1.60\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":"library/std/src/sys/net/connection/socket/unix.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"fff0769af77a453a6372fcd72ed8ac9c727aee8500e93d6c760eed8d1a80522f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustc_builtin_macros::format_foreign::printf::parse_next_substitution: FunctionTooLong \u2014 rustc_builtin_macros::format_foreign::printf::parse_next_substitution runs 160 significant 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 60 over it, 1.60\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":"compiler/rustc_builtin_macros/src/format_foreign/printf/mod.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff672325b7288a71215e7b48d981e6cead800bb6bceba8194679b48991b13b79"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustc_expand::placeholders::placeholder: FunctionTooLong \u2014 rustc_expand::placeholders::placeholder runs 160 significant 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 60 over it, 1.60\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":"compiler/rustc_expand/src/placeholders.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"75d04baf4c0daf03ba1e1ea58ea116e470b4a80e0f31ee1c639e01f635142c4b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustdoc::passes::lint::html_tags::visit_item: FunctionTooLong \u2014 rustdoc::passes::lint::html_tags::visit_item runs 160 significant 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 60 over it, 1.60\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/librustdoc/passes/lint/html_tags.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc1438b7e263464851d118d554aba660fbc13d234dda242ab983981b35d7d979"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SpanlessHash.hash_expr: MethodTooLong \u2014 hash_expr runs 160 significant 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 60 over it, 1.60\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/tools/clippy/clippy_utils/src/hir_utils.rs"},"region":{"startLine":1181}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b5cd1f7235d911b47211fe78ff723d3930d85920f0b60520015675a646ea810"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: hir_expand::cfg_process::macro_input_callback: FunctionTooLong \u2014 hir_expand::cfg_process::macro_input_callback runs 160 significant 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 60 over it, 1.60\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/tools/rust-analyzer/crates/hir-expand/src/cfg_process.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b6bc2b8ffe7648b9f2424b958eb78bd28204bd256dedaad18333232e1c8e141"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/callee.rs: FileTooLong \u2014 799 significant 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 88% of them inside a single declaration: FnCtxt (90-1239). The bar is 500 significant lines; this is 299 over it, 1.60\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":"compiler/rustc_hir_typeck/src/callee.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"143bb3fba2b5165e15e4a4bb3fd4b407077d1c1395b74a3a6e4e737cb4b3e1dc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/base.rs: FileTooLong \u2014 796 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 296 over it, 1.59\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":"compiler/rustc_expand/src/base.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8db46fc5aef96781f0ee6f8f54da74ebff997dafe6a7846db5decccfc1c684de"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PathLoweringContext: ClassTooLong \u2014 636 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 25 methods, 2 blocks, lines 58-1005. The bar is 400 significant lines; this is 236 over it, 1.59\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/tools/rust-analyzer/crates/hir-ty/src/lower/path.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8e13fc69d30d0eea6e63cb78c6955976565f3fcbd1a84aa30ef9006f7cb3103"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ModCollector: ClassTooLong \u2014 636 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 12 methods, 2 blocks, lines 1884-2782. The bar is 400 significant lines; this is 236 over it, 1.59\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/tools/rust-analyzer/crates/hir-def/src/nameres/collector.rs"},"region":{"startLine":1884}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac45b031ccb90493f052044a26af01a3fed5fc227b843ea9ae1b5cb0cba444f0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypeChecker.visit_projection_elem: MethodTooLong \u2014 visit_projection_elem 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":"compiler/rustc_mir_transform/src/validate.rs"},"region":{"startLine":668}}}],"partialFingerprints":{"codehealthFindingId/v1":"508392ab5a38beacdc27942acb6b0dad82de3eed22a409cb8935dfc7dacc3b65"}},{"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/tools/miri/src/shims/unix/solarish/foreign_items.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcd815172eef58fc3a88b804303f5cf74cb55321ad9b699bd3cbf3b7068e68c0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Expr.gen_source_code: MethodTooLong \u2014 gen_source_code 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/tools/rust-analyzer/crates/hir/src/term_search/expr.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"603ef23de276dd8a9ff28916b2df143e0e18e210cbc383b6740cee0e36b1fdf4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: intrinsics/llvm_aarch64.rs: FileTooLong \u2014 793 significant 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 293 over it, 1.59\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":"compiler/rustc_codegen_cranelift/src/intrinsics/llvm_aarch64.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b19d5fb00dee20ac50fd56cf0cde55694bf47e0278dbc71c0e0b2da4de235938"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/stability.rs: FileTooLong \u2014 793 significant 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 293 over it, 1.59\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":"compiler/rustc_passes/src/stability.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f0bb7929458d4bd86913989af6faf4ea67ba6b6f298717f46d5041928df0aa7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LoweringContext.lower_ty: MethodTooLong \u2014 lower_ty runs 158 significant 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 58 over it, 1.58\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":"compiler/rustc_ast_lowering/src/lib.rs"},"region":{"startLine":1534}}}],"partialFingerprints":{"codehealthFindingId/v1":"e35c66ccca9bb23983d7087eea50bc9a7e6a9f247be5710bb91586fddde3d673"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: hir_def::expr_store::lower::path::lower_path: FunctionTooLong \u2014 hir_def::expr_store::lower::path::lower_path runs 158 significant 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 58 over it, 1.58\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/tools/rust-analyzer/crates/hir-def/src/expr_store/lower/path.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"81cf84a42971c9d7373de0fff40eb464dcec10ddb29a8b28816db5cdf13b8f0c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AnalysisStats.run_term_search: MethodTooLong \u2014 run_term_search runs 158 significant 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 58 over it, 1.58\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/tools/rust-analyzer/crates/rust-analyzer/src/cli/analysis_stats.rs"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"3760a31c2bd593175435b3c1e851b3a85d79a70a6bd39849d0b4a3670f6a85d1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/signatures.rs: FileTooLong \u2014 786 significant 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 286 over it, 1.57\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/tools/rust-analyzer/crates/hir-def/src/signatures.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3739ce930d8ffa18aa96fbd653fd72a43a35556ef348570c42131cac3fda06f4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: builder/mod.rs: FileTooLong \u2014 785 significant 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 285 over it, 1.57\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":"compiler/rustc_mir_build/src/builder/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"36b241748bf596437d89be4415ed4d95ef42946ae8bbed52fc65dd0f5203eec1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/data_structures.rs: FileTooLong \u2014 784 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 284 over it, 1.57\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":"compiler/rustc_attr_ir/src/data_structures.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"27756b25e12fd48ea27320dd6a2de745417b200f430d0f50fe017f99a5af0d2b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: EncodeContext: TooManyMethods \u2014 47 methods. The bar is 30 methods; this is 17 over it, 1.57\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":"compiler/rustc_metadata/src/rmeta/encoder.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f13cfc222834f5a8146b5a0034d61549fd9deb9cc6620e218b74c874b7c954a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: unix/unix.rs: FileTooLong \u2014 781 significant 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 65% of them inside a single declaration: Command (54-958). The bar is 500 significant lines; this is 281 over it, 1.56\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":"library/std/src/sys/process/unix/unix.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"529d9ce342b1f47210d467d18d1be10ea0b6477e14f43f1cb300a6c12f62fa04"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: coroutine/mod.rs: FileTooLong \u2014 780 significant 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 280 over it, 1.56\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":"compiler/rustc_mir_transform/src/coroutine/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5d3090b8f256b217180bf31eaf07c040816e2d5c188c845f6c30fee828e192a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/dereference.rs: FileTooLong \u2014 780 significant 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 63% of them inside a single declaration: Dereferencing (3 blocks, 154-1303). The bar is 500 significant lines; this is 280 over it, 1.56\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/tools/clippy/clippy_lints/src/dereference.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf1bdd7cf496c7583bce3a5cc6ae1c24369f0b87811d341d461fff479e06ea21"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: UndefinedBehaviorInfo.fmt: MethodTooLong \u2014 fmt runs 156 significant 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 56 over it, 1.56\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":"compiler/rustc_middle/src/mir/interpret/error.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"969d571bf81bcf36ead3fcbfc34c65f2d07bc48d6043881a9e45eb6a463bc707"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rust_analyzer::lsp::to_proto::completion_item: FunctionTooLong \u2014 rust_analyzer::lsp::to_proto::completion_item runs 156 significant 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 56 over it, 1.56\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/tools/rust-analyzer/crates/rust-analyzer/src/lsp/to_proto.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"88aec20623ef084023c2d8a8d39628d2613db25865248314ed5ab4b8c35599fb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: search_graph/mod.rs: FileTooLong \u2014 778 significant 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 278 over it, 1.56\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":"compiler/rustc_type_ir/src/search_graph/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b43b6b562106b004cb1f36780053557bfc5317c3e9641f2a0fbddcee5d9037da"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: intrinsics/simd.rs: FileTooLong \u2014 775 significant 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 275 over it, 1.55\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":"compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c720a8e7e93a74e63a2ac04d9b85f48f687258dec590eb2705a822cbc049912"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: diagnostics/wrong_number_of_generic_args.rs: FileTooLong \u2014 775 significant 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 96% of them inside a single declaration: WrongNumberOfGenericArgs (3 blocks, 12-1233). The bar is 500 significant lines; this is 275 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":"compiler/rustc_hir_analysis/src/diagnostics/wrong_number_of_generic_args.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e179a53598836624a9ade2664510ccfb826f276d00cface173b0db251edffc8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: unix/socket.rs: FileTooLong \u2014 775 significant 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-1295). The bar is 500 significant lines; this is 275 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/tools/miri/src/shims/unix/socket.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"28169efd4c300dc8098c7400ea94afb69cb88b2ab1c7ae1f5664377dc68c889e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustc_codegen_ssa::codegen_attrs::process_builtin_attrs: FunctionTooLong \u2014 rustc_codegen_ssa::codegen_attrs::process_builtin_attrs 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":"compiler/rustc_codegen_ssa/src/codegen_attrs.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c1e58e06ea2af21d88e8c8ce24abf06255535a16b6f4b2591ea8e58aefe36a9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustc_codegen_ssa::mir::naked_asm::prefix_and_suffix: FunctionTooLong \u2014 rustc_codegen_ssa::mir::naked_asm::prefix_and_suffix 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":"compiler/rustc_codegen_ssa/src/mir/naked_asm.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd5a519298e674168a1172bea98e8b0ffc1d6069dbaa199011b7284a9835ddd7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: libm::math::exp2m1f::cr_exp2m1f: FunctionTooLong \u2014 libm::math::exp2m1f::cr_exp2m1f 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":"library/compiler-builtins/libm/src/math/exp2m1f.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"31eb07261638200440d8d532d140e9ba84f43d67d6d66cd81227d1004a2ff417"}},{"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/tools/miri/src/borrow_tracker/stacked_borrows/mod.rs"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"db24438d4901f3e5b3f377f7424dbc84e9f9d66646791a59416c5612dee750fe"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: InferenceContext.analyze_closure: MethodTooLong \u2014 analyze_closure 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/tools/rust-analyzer/crates/hir-ty/src/infer/closure/analysis.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"73bf97ec05ba67b9d6b9dd3c907b62a9ec947ee5ab73e6e8fd8038fa8102bff6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/check_unsafety.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). The bar is 500 significant lines; this is 274 over it, 1.55\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":"compiler/rustc_mir_build/src/check_unsafety.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9468a0d0a9e11bab81f5580ed3477006c5b46c08abcf9a7b9f13d024e88e9043"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: InferCtxt: ClassTooLong \u2014 618 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 175 methods, 4 blocks, lines 244-1925. The bar is 400 significant lines; this is 218 over it, 1.55\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":"compiler/rustc_infer/src/infer/mod.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"30c24d3b19d0c908d62b111a7bef85b529c5d1b36964c3a462c6b6606b0a9284"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/defs.rs: FileTooLong \u2014 772 significant 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 272 over it, 1.54\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-db/src/defs.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a5d9eafb8b61da28cd683ab1922d5993d5fc112148238161805e05bfc9123e2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: const_eval/machine.rs: FileTooLong \u2014 771 significant 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 77% of them inside a single declaration: CompileTimeMachine (4 blocks, 48-1280). The bar is 500 significant lines; this is 271 over it, 1.54\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":"compiler/rustc_const_eval/src/const_eval/machine.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"df9959b3644610f6b8110ca45f48dca69fa203dc91511fc2b452048d760f739d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/va_arg.rs: FileTooLong \u2014 770 significant 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 270 over it, 1.54\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/va_arg.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8065df5478b3d59483b76b1cf97291f255d8c5e5237c5f291d3388968a04744"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustc_ast_lowering::format::expand_format_args: FunctionTooLong \u2014 rustc_ast_lowering::format::expand_format_args runs 154 significant 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 54 over it, 1.54\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":"compiler/rustc_ast_lowering/src/format.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"a90ba2a72e12ed247e57d30d904a34054fa9b8b3bbb0f7484174b0141567627e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustc_borrowck::places_conflict::place_projection_conflict: FunctionTooLong \u2014 rustc_borrowck::places_conflict::place_projection_conflict runs 154 significant 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 54 over it, 1.54\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":"compiler/rustc_borrowck/src/places_conflict.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"eee5da5d35e6fc69b248704dc131ee429122ff43f35b763ecebfff8777be79ab"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: VnState.eval_to_const_inner: MethodTooLong \u2014 eval_to_const_inner runs 154 significant 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 54 over it, 1.54\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":"compiler/rustc_mir_transform/src/gvn.rs"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5e219e36cf2ccb9069ffb0137e9544d4e0ad724ece068f11d3cc43b3ccc1f58"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LateResolutionVisitor.smart_resolve_path_fragment: MethodTooLong \u2014 smart_resolve_path_fragment runs 154 significant 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 54 over it, 1.54\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":"compiler/rustc_resolve/src/late.rs"},"region":{"startLine":4872}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1cd1e95fc4401279742b95bef1786a36bc2cc87eca3e9f18b20e3f6caf4162b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: builder/cargo.rs: FileTooLong \u2014 769 significant 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 269 over it, 1.54\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/builder/cargo.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab8ac964eff51350d8c09957f700f6c12b64e6eed3435310aebe021ce7fd3183"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mir/rvalue.rs: FileTooLong \u2014 767 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 90% of them inside a single declaration: FunctionCx (22-1073). The bar is 500 significant lines; this is 267 over it, 1.53\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":"compiler/rustc_codegen_ssa/src/mir/rvalue.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cad9d3b85057d076e1b3826c9cb08f2a3ee7f97c36d87233c20756fa5e9af47"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Options: TooManyFields \u2014 46 stored fields beside 1 method. The bar is 30 stored fields; this is 16 over it, 1.53\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/librustdoc/config.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8a9e30c863c9caa19296397b3131dbb8f286a4a11094b804e45ab49a1384a30"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: CONTEXT: TooManyFields \u2014 46 stored fields. The bar is 30 stored fields; this is 16 over it, 1.53\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":"library/std/src/sys/pal/windows/c/windows_sys.rs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec600051108b6a09a66d9203fce464c11db4dbf3ccf4e2adc73a21c48dd3db5b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ast/node_ext.rs: FileTooLong \u2014 765 significant 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 265 over it, 1.53\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/tools/rust-analyzer/crates/syntax/src/ast/node_ext.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cb09dcb0c1aacdac26cf59bf02d6b83a1b723227ab6153cf06e4873b536ec24"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: y::main: FunctionTooLong \u2014 y::main runs 153 significant 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 53 over it, 1.53\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/build_system/main.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"63ea60ce9134ea50ba3b6809841c9742ee3bfa86211d46373e52869e5651d164"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: InterpCx.init_fn_call: MethodTooLong \u2014 init_fn_call runs 153 significant 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 53 over it, 1.53\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_const_eval/src/interpret/call.rs"},"region":{"startLine":758}}}],"partialFingerprints":{"codehealthFindingId/v1":"f141937572bf5f1eaf3c2fb7ea9dcddf2d420222111577365281bdc570dddae7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/region_constraint.rs: FileTooLong \u2014 764 significant 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 264 over it, 1.53\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":"compiler/rustc_type_ir/src/region_constraint.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cc796ee3ea05d14535df367ee0bd441e6ce31a42e27dbd3c8d4e74834250585"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: render/write_shared.rs: FileTooLong \u2014 764 significant 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 264 over it, 1.53\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/librustdoc/html/render/write_shared.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1184880a91b1566d896478cedc47053ab98d0fcb220d5ae885573ca954ce80d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/context.rs: FileTooLong \u2014 761 significant 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 261 over it, 1.52\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":"compiler/rustc_codegen_llvm/src/context.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"142eb3d9555eaec90adb2744d4e39c2e601526ab3c368d7b92e9d321d4363674"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/boxed.rs: FileTooLong \u2014 761 significant 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 79% of them inside a single declaration: Box (43 blocks, 308-2708). The bar is 500 significant lines; this is 261 over it, 1.52\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":"library/alloc/src/boxed.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f283ade3f94a5130f49635406ad5036131690f79d8ce9923af4398bb41ab2ba1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: InterpCx.init_stack_frame: MethodTooLong \u2014 init_stack_frame runs 152 significant 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 52 over it, 1.52\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_const_eval/src/interpret/call.rs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0e6e8299c2f99f63c6558f3294e61801029aef35c1e5404faa63745d6a12655"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypeErrCtxt.report_fulfillment_errors: MethodTooLong \u2014 report_fulfillment_errors runs 152 significant 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 52 over it, 1.52\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/error_reporting/traits/mod.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"9780c9c206a4e528cae376f99acfbbc23e5fbce65574eef75192d47d3fcacb1c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CacheBuilder.fold_item: MethodTooLong \u2014 fold_item runs 152 significant 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 52 over it, 1.52\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/formats/cache.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"16c11c9569b29ffe93197e1c75007a4a5ee1559d2b247fc56f5c716c4611406d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: clippy_utils::is_never_expr: FunctionTooLong \u2014 clippy_utils::is_never_expr runs 152 significant 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 52 over it, 1.52\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_utils/src/lib.rs"},"region":{"startLine":3021}}}],"partialFingerprints":{"codehealthFindingId/v1":"badad72cbacd91a16aa73bff81f3700202f0be4ae825b1eb819df055e90afd5d"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: FindUsages: ClassTooLong \u2014 606 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 20 methods, 2 blocks, lines 441-1376. The bar is 400 significant lines; this is 206 over it, 1.52\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/tools/rust-analyzer/crates/ide-db/src/search.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"c95bd6c7c440056728823cdf64a529fd0f55074b9bd50f10d2e68f0857123df1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: thir/print.rs: FileTooLong \u2014 757 significant 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: ThirPrinter (3 blocks, 29-1016). The bar is 500 significant lines; this is 257 over it, 1.51\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":"compiler/rustc_mir_build/src/thir/print.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9d582e089aa3577c362e7d31fdf125b3c2e362824173355c50874ed977e9119"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/visitor.rs: FileTooLong \u2014 757 significant 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 257 over it, 1.51\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/visitor.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"df691424e9565643ac28378ac8e2715cfba5b10172b5324071497ef8fd338add"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/imports.rs: FileTooLong \u2014 756 significant 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 256 over it, 1.51\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/imports.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"58f198bdedad8126d3581b55b50bbb32ef5bbccab3a1626523297855544c751a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Box: ClassTooLong \u2014 604 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 53 methods, 43 blocks, lines 308-2708. The bar is 400 significant lines; this is 204 over it, 1.51\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":"library/alloc/src/boxed.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a4107750ad7077f0af49f8b59844bc6038a551bfdeec732b141caf7589720c2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustc_hir_analysis::check::compare_impl_item::refine::check_refining_return_position_impl_trait_in_trait: FunctionTooLong \u2014 rustc_hir_analysis::check::compare_impl_item::refine::check_refining_return_position_impl_trait_in_trait runs 151 significant 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 51 over it, 1.51\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/check/compare_impl_item/refine.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8e4126b035f1f69db238c5ff2274186d3de8107389cf0f44934e9542b908764"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LateResolutionVisitor.make_base_error: MethodTooLong \u2014 make_base_error runs 151 significant 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 51 over it, 1.51\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/late/diagnostics.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"072967affd067e65a72f40511a893cb5fc7c127a5465d585b65b49d5828eeb55"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustdoc::doctest::make::parse_source: FunctionTooLong \u2014 rustdoc::doctest::make::parse_source runs 151 significant 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 51 over it, 1.51\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/doctest/make.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"169db9e6bfde00a8d02bd8a0497d451254697f479fa629d13e1f84b903a242af"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/base.rs: FileTooLong \u2014 754 significant 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 254 over it, 1.51\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/base.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c34bb9408a144840ddb6c481034b6d50ce0be00219ea3903ac4c05f26e045016"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ast_utils/mod.rs: FileTooLong \u2014 754 significant 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 61 free functions. The bar is 500 significant lines; this is 254 over it, 1.51\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_utils/src/ast_utils/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"09f8a3f440b8faa29a4d415c14beeb6f5cd844ad12c0f1ecf13e945456e934d5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/context.rs: FileTooLong \u2014 752 significant 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 252 over it, 1.50\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":"compiler/rustc_attr_parsing/src/context.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd55124fce96cfa94420fd6a5879022e715cd58e114f1bc079af5f023a698aec"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ClientCapabilities: TooManyMethods \u2014 45 methods. The bar is 30 methods; this is 15 over it, 1.50\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/tools/rust-analyzer/crates/rust-analyzer/src/lsp/capabilities.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"427a384cb786e700b40c928dfa545d1b413c75170d724f5d8cfb72d5f1e89525"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Builder.gcc_icmp: MethodTooLong \u2014 gcc_icmp runs 150 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 50 over it, 1.50\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_gcc/src/int.rs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"33926e2be690c2059f168097accebeb01c996571cd105e2029c115ed12d7a21b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Builder.dbg_scope_fn: MethodTooLong \u2014 dbg_scope_fn runs 150 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 50 over it, 1.50\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/debuginfo/mod.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dc5792f49ca5345de3b7fe6b1dd56e55c421ae47e3b2e10cc9d9369ec88da5e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ValidityVisitor.check_safe_pointer: MethodTooLong \u2014 check_safe_pointer runs 150 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 50 over it, 1.50\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_const_eval/src/interpret/validity.rs"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6067abb859db53cea41bed7bbce57b0c0a0857cfe62c37bfff210563af4bd04"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/token.rs: FileTooLong \u2014 749 significant 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 249 over it, 1.50\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":"compiler/rustc_ast/src/token.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b2eb98228300623c52fbdfd637133a490fce1e7ed382e93c172c415a62bbc9f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/diagnostic.rs: FileTooLong \u2014 747 significant 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: Diag (6 blocks, 354-1295). The bar is 500 significant lines; this is 247 over it, 1.49\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":"compiler/rustc_errors/src/diagnostic.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9307b48fd12f1dfcb332f96f2aaa70e76b7827a4b8d267a6a7da1b2daa9fad69"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustc_codegen_gcc::intrinsic::llvm::adjust_intrinsic_return_value: FunctionTooLong \u2014 rustc_codegen_gcc::intrinsic::llvm::adjust_intrinsic_return_value runs 149 significant 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 49 over it, 1.49\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":"compiler/rustc_codegen_gcc/src/intrinsic/llvm.rs"},"region":{"startLine":823}}}],"partialFingerprints":{"codehealthFindingId/v1":"310773321a32ede77745d4cd1430d8ed22eb628a8bd03396ccc3fb58b1b40023"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Evaluator.create_memory_map: MethodTooLong \u2014 create_memory_map runs 149 significant 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 49 over it, 1.49\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/tools/rust-analyzer/crates/hir-ty/src/mir/eval.rs"},"region":{"startLine":2217}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e15c13312ae3f9b44615578bc4562e34151124d374c61e0de83d072cd6ff360"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ide::inlay_hints::lifetime::hints_: FunctionTooLong \u2014 ide::inlay_hints::lifetime::hints_ runs 149 significant 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 49 over it, 1.49\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/tools/rust-analyzer/crates/ide/src/inlay_hints/lifetime.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"d69e0bb5a343b87ebcd177702f88913268b26ca1fdac0c578dc0176e009a127c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ide::syntax_highlighting::highlight::highlight_def: FunctionTooLong \u2014 ide::syntax_highlighting::highlight::highlight_def runs 149 significant 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 49 over it, 1.49\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/tools/rust-analyzer/crates/ide/src/syntax_highlighting/highlight.rs"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc1d3f2603945bbbb5d6cc47d706b49d1252a6d55c5d265e19b2e4c4cdf17387"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: CompileTimeMachine: ClassTooLong \u2014 595 significant 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, 4 blocks, lines 48-1280. The bar is 400 significant lines; this is 195 over it, 1.49\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_const_eval/src/const_eval/machine.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2f3d2f33525223332f07bdffcc9c000a2e7f561f2faa7736bb886c98d63cc8f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lang_item.rs: FileTooLong \u2014 742 significant 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 242 over it, 1.48\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/tools/rust-analyzer/crates/hir-def/src/lang_item.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"269ffef946f5d22efd71ad5d15f20348763e5cefc04b6c3a41df9e2f52ef592e"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: FnCallDiagCtxt: ClassTooLong \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), 15 methods, 3 blocks, lines 2287-3188. The bar is 400 significant lines; this is 193 over it, 1.48\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":"compiler/rustc_hir_typeck/src/fn_ctxt/checks.rs"},"region":{"startLine":2287}}}],"partialFingerprints":{"codehealthFindingId/v1":"38a57dbaf34c9c5246fc035c8c48c9d437ce28552d1a26d15a87c31f064b08a7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/rustc.rs: FileTooLong \u2014 741 significant 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 87% of them inside a single declaration: RustcPatCtxt (4 blocks, 78-1048). The bar is 500 significant lines; this is 241 over it, 1.48\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":"compiler/rustc_pattern_analysis/src/rustc.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b36b2b6c5bf67ce11b5d5152467d93f4f800690b8361bcefe0cf415218bf782"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: HirEqInterExpr: ClassTooLong \u2014 592 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 32 methods, 2 blocks, lines 153-1028. The bar is 400 significant lines; this is 192 over it, 1.48\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/tools/clippy/clippy_utils/src/hir_utils.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"728c2cd79de74c57f612a0d48268d5acd757993e0eafe4af32b0883b04a002ed"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/asm.rs: FileTooLong \u2014 740 significant 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 240 over it, 1.48\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":"compiler/rustc_codegen_gcc/src/asm.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4b2c6931d69df312fafa60aaae171f1984d40d46d0d27b02c9a9c31ce00f66a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustc_codegen_llvm::debuginfo::metadata::enums::cpp_like::build_variant_struct_wrapper_type_di_node: FunctionTooLong \u2014 rustc_codegen_llvm::debuginfo::metadata::enums::cpp_like::build_variant_struct_wrapper_type_di_node runs 148 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 48 over it, 1.48\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/debuginfo/metadata/enums/cpp_like.rs"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"3751297028d0dc60ee7ca090e88b7ff501f5daff9b6036db9fd24f869cfc6355"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CrateError.report: MethodTooLong \u2014 report runs 148 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 48 over it, 1.48\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_metadata/src/locator.rs"},"region":{"startLine":1084}}}],"partialFingerprints":{"codehealthFindingId/v1":"0300f0b87f34dd521d688e12d29a8224e2e457996ef3d6d5ba2c74a992f1d852"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LateResolutionVisitor.resolve_elided_lifetimes_in_path: MethodTooLong \u2014 resolve_elided_lifetimes_in_path runs 148 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 48 over it, 1.48\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/late.rs"},"region":{"startLine":2331}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b984bbd5ea4118941722af89e40f138372927b46358d47078566dae9bd49295"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustdoc::main_args: FunctionTooLong \u2014 rustdoc::main_args runs 148 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 48 over it, 1.48\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/lib.rs"},"region":{"startLine":826}}}],"partialFingerprints":{"codehealthFindingId/v1":"6da801d2c9dddacd36fb08f7d0300f40ae3fe7b31c733b0be043a50845bf3c27"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: hir_ty::next_solver::consts::valtree::allocation_to_const: FunctionTooLong \u2014 hir_ty::next_solver::consts::valtree::allocation_to_const runs 148 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 48 over it, 1.48\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/next_solver/consts/valtree.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb2f9dfc34f77a157b5eb1312149bc3bc1616cd33716ad793a59270927ad5cd4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: solve/normalizes_to.rs: FileTooLong \u2014 738 significant 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: NormalizesTo (162-1104). The bar is 500 significant lines; this is 238 over it, 1.48\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":"compiler/rustc_next_trait_solver/src/solve/normalizes_to.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c7c047695825b0d616ab0a69753a560cd8e8331e3491a7f5b63f42b027af50d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/ty_kind.rs: FileTooLong \u2014 737 significant 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 237 over it, 1.47\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_type_ir/src/ty_kind.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"509ce3aa184847f3a3a85eff3a8b14834175596b2495294021b842cf533854f6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: librustdoc/config.rs: FileTooLong \u2014 737 significant 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 71% of them inside a single declaration: Options (3 blocks, 64-994). The bar is 500 significant lines; this is 237 over it, 1.47\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/librustdoc/config.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a3a18b8815071756076bf5718677143d8190f3b72acbd753e28f863b2585972"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: dep_graph/graph.rs: FileTooLong \u2014 735 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 235 over it, 1.47\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/dep_graph/graph.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8423ed8f63db97f0b1c51ead0e4e8f427e7cc6d585c1e25cc139c8512d2abb33"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DocParser.parse_single_doc_attr_item: MethodTooLong \u2014 parse_single_doc_attr_item runs 147 significant 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 47 over it, 1.47\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":"compiler/rustc_attr_parsing/src/attributes/doc.rs"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"64f5c2479eec191bef6ad7ac3dd432c37bf1a1cde06ef528d8e1e654a4164973"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustc_builtin_macros::autodiff::llvm_enzyme::gen_enzyme_decl: FunctionTooLong \u2014 rustc_builtin_macros::autodiff::llvm_enzyme::gen_enzyme_decl runs 147 significant 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 47 over it, 1.47\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":"compiler/rustc_builtin_macros/src/autodiff.rs"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"38886a03c72f55f492915176c5e515f4a41dd8cb4974feef60a85e050bbac634"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustc_codegen_llvm::asm::reg_to_llvm: FunctionTooLong \u2014 rustc_codegen_llvm::asm::reg_to_llvm runs 147 significant 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 47 over it, 1.47\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":"compiler/rustc_codegen_llvm/src/asm.rs"},"region":{"startLine":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cede5e1fbdb98e89566a9bf4e0f97b690b80989a664d81ab1231f4eac40f11a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SubdiagnosticVariant.from_attr: MethodTooLong \u2014 from_attr runs 147 significant 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 47 over it, 1.47\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":"compiler/rustc_macros/src/diagnostics/utils.rs"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6338babde77bb96201615dbe41507811dad33bcb99f2517f074f0e2a46a3d45"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: UnsafeOpKind.emit_requires_unsafe_err: MethodTooLong \u2014 emit_requires_unsafe_err runs 147 significant 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 47 over it, 1.47\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":"compiler/rustc_mir_build/src/check_unsafety.rs"},"region":{"startLine":840}}}],"partialFingerprints":{"codehealthFindingId/v1":"5041bbb12b7f2b978c140f1af3e9ed41158c5b2e2ecdce19ecbacee076fb0055"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: compiletest::cli::parse_config: FunctionTooLong \u2014 compiletest::cli::parse_config runs 147 significant 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 47 over it, 1.47\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/tools/compiletest/src/cli.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"fda8e6575995f79cca4f8d898e0b8e1b3c014695303aec7f0840ca265bf35b0d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: state/item.rs: FileTooLong \u2014 734 significant 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 98% of them inside a single declaration: State (20-949). The bar is 500 significant lines; this is 234 over it, 1.47\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":"compiler/rustc_ast_pretty/src/pprust/state/item.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"69a491ac83297a126c383bb434709c31d57c3bd4583a0d7b81031022f11231f8"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ExprUseVisitor: TooManyMethods \u2014 44 methods. The bar is 30 methods; this is 14 over it, 1.47\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":"compiler/rustc_hir_typeck/src/expr_use_visitor.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f02d7c861c9f0ff7cafa52147fc65e3afcdb00e6980ad6fcbae151a7ce79f40"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TyLoweringContext: TooManyMethods \u2014 44 methods. The bar is 30 methods; this is 14 over it, 1.47\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/tools/rust-analyzer/crates/hir-ty/src/lower.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfdd69aeedadd91f624759444e79a8e2afce560159c12d2ef60e2f29ad9132b3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/types.rs: FileTooLong \u2014 733 significant 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 233 over it, 1.47\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_lint/src/types.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"12fc84f7e6b85fdb5377813d0dbd846e57987ddcafcb7479b651467e2c8581ca"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: extra_checks/mod.rs: FileTooLong \u2014 731 significant 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 231 over it, 1.46\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/tools/tidy/src/extra_checks/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"62232a0a8aac7c34397fcc2488a9a81fde69f8720dcdec955d9a82682fb3e748"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: collect/clauses_of.rs: FileTooLong \u2014 730 significant 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 230 over it, 1.46\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":"compiler/rustc_hir_analysis/src/collect/clauses_of.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9981760341af6bb91726e4bd97b4269afa274ced78367246b3dbb1de45b95bbb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustc_builtin_macros::asm::validate_asm_args: FunctionTooLong \u2014 rustc_builtin_macros::asm::validate_asm_args runs 146 significant 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 46 over it, 1.46\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":"compiler/rustc_builtin_macros/src/asm.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d1bf4c309891b3d71035d03fe4e8f40b6479aa11de39001fef689e79de6b447"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Coerce: ClassTooLong \u2014 583 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 21 methods, 3 blocks, lines 72-1178. The bar is 400 significant lines; this is 183 over it, 1.46\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":"compiler/rustc_hir_typeck/src/coercion.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc92b30fbdc414098ab5112c2747145d1c1a89cf28f1aefbcbcb810309472848"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Resolver: ClassTooLong \u2014 582 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 43 methods, 4 blocks, lines 44-1183. The bar is 400 significant lines; this is 182 over it, 1.46\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/tools/rust-analyzer/crates/hir-def/src/resolver.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdb5ef6b19ea769f99e2e0e5b4e36629a89b3f2efcca6f093f142a8b27ca0585"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: core/download.rs: FileTooLong \u2014 727 significant 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 227 over it, 1.45\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/download.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e933ab28c86ae0902da94f6bb48a9843dfa7641c20c9e276d4343ad7a3b8013f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/diagnostics.rs: FileTooLong \u2014 726 significant 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 226 over it, 1.45\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_passes/src/diagnostics.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"517a170a0b98130c183c7ae5f6e3248c646b913893ad850a123c622d960a12e3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/source_map.rs: FileTooLong \u2014 726 significant 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 226 over it, 1.45\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_span/src/source_map.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2506e23a6a14f3f6f362b41458cf2e226c6dfb2a45e3ab6fec1132c06a42edb2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SizeSkeleton.compute_inner: MethodTooLong \u2014 compute_inner runs 145 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 45 over it, 1.45\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/ty/layout.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0452660934497cbb5e2ef2110d20f47b8837679712b409d86f4fd7d38db76e2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: std_detect::detect::os::x86::detect_features: FunctionTooLong \u2014 std_detect::detect::os::x86::detect_features runs 145 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 45 over it, 1.45\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std_detect/src/detect/os/x86.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"235f573c099e8093ff6871f954278e7a749d03bd814f84ddbb2dcd5a85efaefc"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustc_codegen_llvm::builder::gpu_offload::gen_call_handling: FunctionTooLong \u2014 rustc_codegen_llvm::builder::gpu_offload::gen_call_handling runs 144 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 44 over it, 1.44\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/builder/gpu_offload.rs"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0f44dbe181338cc1acc40fd8d5ae7ce693cd58f2f24fb2caf5de639e9c2ffc3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustc_llvm::initialize_available_targets: FunctionTooLong \u2014 rustc_llvm::initialize_available_targets runs 144 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 44 over it, 1.44\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_llvm/src/lib.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"8972652e24af8e99047ae7f34d3842eaab5c6359879c9a9d4b191f342731a2b8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: hir_ty::lower::path::substs_from_args_and_bindings: FunctionTooLong \u2014 hir_ty::lower::path::substs_from_args_and_bindings runs 144 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 44 over it, 1.44\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/lower/path.rs"},"region":{"startLine":1156}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f64f9e903afe77255ca8699f9f277262c475aca3256ed128dba9afa0700a4f1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: types/improper_ctypes.rs: FileTooLong \u2014 718 significant 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 218 over it, 1.44\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":"compiler/rustc_lint/src/types/improper_ctypes.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e844206cb48502691488744d2eacdd377b18b3798df66a6ec26ef20d23e3c4c1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: infer/note_and_explain.rs: FileTooLong \u2014 718 significant 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 98% of them inside a single declaration: TypeErrCtxt (19-1057). The bar is 500 significant lines; this is 218 over it, 1.44\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":"compiler/rustc_trait_selection/src/error_reporting/infer/note_and_explain.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"43923b9485af5a0a9821d95c534de95b0325872e6bef2ca25bace04f44edba49"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Builder: TooManyMethods \u2014 43 methods, declared across 4 files: builder/mod.rs (38), build_steps/toolstate.rs (2), builder/cargo.rs (2), build_steps/tool.rs (1). The bar is 30 methods; this is 13 over it, 1.43\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/bootstrap/src/core/builder/mod.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba2faf4d8538c38a3d0c680a207cf2684f1dac36c243929e93ac98a4c754a4bc"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Resolver: TooManyMethods \u2014 43 methods. The bar is 30 methods; this is 13 over it, 1.43\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/resolver.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3f7eb265e6b5d68247819a75da9716d68aa2b599e33d06b11cd59e9f16d2918"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ExprUseVisitor: TooManyMethods \u2014 43 methods. The bar is 30 methods; this is 13 over it, 1.43\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/infer/closure/analysis/expr_use_visitor.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ac3c55b9d9b55be45a2f59b495f9936dc3322e413d6dd9b3b509929b26bb9fe"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SourceToDefCtx: TooManyMethods \u2014 43 methods. The bar is 30 methods; this is 13 over it, 1.43\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir/src/semantics/source_to_def.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"c70dc515e77f69563fb2b5e460f030cc4fb214390108dd948d77b5948f6ea9de"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: FamousDefs: TooManyMethods \u2014 43 methods. The bar is 30 methods; this is 13 over it, 1.43\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-db/src/famous_defs.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"47e8dfe33441a05379cd27e73e915dcb76cb1af49982a8a96527a961bb57fc77"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: closure/analysis.rs: FileTooLong \u2014 715 significant 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 215 over it, 1.43\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/infer/closure/analysis.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5872aa71f882a59c1ed20e832b2f3c13d16df4f8d29f02dcbf8e57fc68a8d2c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: InterpCx.binary_int_op: MethodTooLong \u2014 binary_int_op runs 143 significant 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 43 over it, 1.43\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":"compiler/rustc_const_eval/src/interpret/operator.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1f9b5566d990bc52628879522e56746a8d9286898308261d8aacfec2ca93d7e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustc_hir_analysis::check::intrinsic::intrinsic_operation_unsafety: FunctionTooLong \u2014 rustc_hir_analysis::check::intrinsic::intrinsic_operation_unsafety runs 143 significant 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 43 over it, 1.43\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":"compiler/rustc_hir_analysis/src/check/intrinsic.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"d216df2b10ec4495eba4093160238f38e26a3102f9711438dd111b4378b25171"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustc_lint::unused::must_use::emit_must_use_untranslated: FunctionTooLong \u2014 rustc_lint::unused::must_use::emit_must_use_untranslated runs 143 significant 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 43 over it, 1.43\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":"compiler/rustc_lint/src/unused/must_use.rs"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0eca6f179a780dbb311272fc29835d7eb41f15b6733e646f186c1e5c0c15b88"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Builder.expr_as_place: MethodTooLong \u2014 expr_as_place runs 143 significant 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 43 over it, 1.43\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":"compiler/rustc_mir_build/src/builder/expr/as_place.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a9fc34120034d39a988d55d3607e0fc67d108c2286b7adeb4653ac011471db4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Builder.choose_bucket_for_candidate: MethodTooLong \u2014 choose_bucket_for_candidate runs 143 significant 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 43 over it, 1.43\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":"compiler/rustc_mir_build/src/builder/matches/buckets.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff74bc7fb2ea2cd207cca1955581a4c75a27f32c31af2a8f73e92a353480063a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Resolver.check_unused: MethodTooLong \u2014 check_unused runs 143 significant 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 43 over it, 1.43\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":"compiler/rustc_resolve/src/check_unused.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"0679bba2df1898772134435212788693d0520bf5862edd5243b5c4fdd1383e68"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Resolver.finalize_macro_resolutions: MethodTooLong \u2014 finalize_macro_resolutions runs 143 significant 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 43 over it, 1.43\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":"compiler/rustc_resolve/src/macros.rs"},"region":{"startLine":907}}}],"partialFingerprints":{"codehealthFindingId/v1":"34ff3d46560607d58129cd4736b53937dce57e1133df73cd297752466e1cb423"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: bootstrap::core::build_steps::llvm::configure_cmake: FunctionTooLong \u2014 bootstrap::core::build_steps::llvm::configure_cmake runs 143 significant 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 43 over it, 1.43\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/bootstrap/src/core/build_steps/llvm.rs"},"region":{"startLine":883}}}],"partialFingerprints":{"codehealthFindingId/v1":"9016677f1415f8e8df503483adf962cc132dfe48f3da29bb2c0d594a63217769"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Dereferencing.report: MethodTooLong \u2014 report runs 143 significant 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 43 over it, 1.43\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/tools/clippy/clippy_lints/src/dereference.rs"},"region":{"startLine":1098}}}],"partialFingerprints":{"codehealthFindingId/v1":"7be64f3a75bec9fc5c12caa33a8f9d92f218bd44f3c3e863f2c67e45a3f3ea15"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SymbolCollector.collect_from_module: MethodTooLong \u2014 collect_from_module runs 143 significant 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 43 over it, 1.43\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/tools/rust-analyzer/crates/hir/src/symbols.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1bb65befc4127ea5b26be02fa9002758773288a642703586f9252002612d811"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CargoWorkspace.new: MethodTooLong \u2014 new runs 143 significant 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 43 over it, 1.43\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/tools/rust-analyzer/crates/project-model/src/cargo_workspace.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"2150e41f19d13b38c78c63687f6af4488d9a40a9fd0707ca3d81a78cbd92c3f9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: msg/flat.rs: FileTooLong \u2014 713 significant 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 213 over it, 1.43\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/proc-macro-api/src/legacy_protocol/msg/flat.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"41d2259521ef20be771a3bdc0ef1ff56c4673166de5f0610a92d85c7bd2c6a90"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: traits/wf.rs: FileTooLong \u2014 711 significant 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 72% of them inside a single declaration: WfPredicates (3 blocks, 217-1303). The bar is 500 significant lines; this is 211 over it, 1.42\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":"compiler/rustc_trait_selection/src/traits/wf.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a04cf1acc2b65fbcbae53fb428628d380330e21064c5ced1e96b3dab0c30a04"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: imports/import_assets.rs: FileTooLong \u2014 711 significant 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 211 over it, 1.42\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/tools/rust-analyzer/crates/ide-db/src/imports/import_assets.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9fb46539674c40f8cc47978c3813e69416c10132b2e5c0c8d3ddd7e93ee51fa"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/partitioning.rs: FileTooLong \u2014 710 significant 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 210 over it, 1.42\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":"compiler/rustc_monomorphize/src/partitioning.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2181d77cc32439cb458c845605072e8ba2b81ea35561bd39e593e570db0ee80"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CheckLoopVisitor.visit_expr: MethodTooLong \u2014 visit_expr runs 142 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 42 over it, 1.42\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/loops.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"002ace27b3c91a6ced52072e362f41536ec6b1171fed47c882c12d267306547e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SelectionContext.winnow_candidates: MethodTooLong \u2014 winnow_candidates runs 142 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 42 over it, 1.42\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/traits/select/mod.rs"},"region":{"startLine":1721}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7b69c05f4e81cc03a598da495cbf64a6cdf6771ce3bf43861bfda1c8b5e661d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ide_assists::handlers::generate_new::generate_new: FunctionTooLong \u2014 ide_assists::handlers::generate_new::generate_new runs 142 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 42 over it, 1.42\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_new.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2867888430691b158ec430ea704b036f91cd7768824294157bd71ac714f0fc1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/layout.rs: FileTooLong \u2014 705 significant 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 205 over it, 1.41\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":"compiler/rustc_ty_utils/src/layout.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"072f846752dea250af392777d56790fe209ca162e07569c21c5e25e89a5f90dd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustc_codegen_llvm::asm::llvm_fixup_input: FunctionTooLong \u2014 rustc_codegen_llvm::asm::llvm_fixup_input 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":"compiler/rustc_codegen_llvm/src/asm.rs"},"region":{"startLine":1171}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc0d0e2fe61b7f3841bcf408a235c6e909030559e3f6ac552aaee4042c78f3ad"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustc_hir_analysis::check::compare_impl_item::check_region_late_boundedness: FunctionTooLong \u2014 rustc_hir_analysis::check::compare_impl_item::check_region_late_boundedness 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":"compiler/rustc_hir_analysis/src/check/compare_impl_item.rs"},"region":{"startLine":1294}}}],"partialFingerprints":{"codehealthFindingId/v1":"f43313474ba3e9170c66dff8a3047c3ce390e55a300fac12fab967404de4dd19"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LateResolutionVisitor.with_const_and_generic_param_rib: MethodTooLong \u2014 with_const_and_generic_param_rib 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":"compiler/rustc_resolve/src/late.rs"},"region":{"startLine":3267}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a3c23e940e347548c93bbc6e93d981f03aeef0cb208a39d2c1d1cdaf7ab034d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: intrinsic_test::loongarch::types::parse_intrinsic_type: FunctionTooLong \u2014 intrinsic_test::loongarch::types::parse_intrinsic_type 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":"library/stdarch/crates/intrinsic-test/src/loongarch/types.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f88820004cc8d61f700bdc251a3f8bb19624475ad353dd6d2582acc5d307177"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: main.register_type_impls: FunctionTooLong \u2014 register_type_impls runs 141 significant lines (blank, comment-only and punctuation-only lines excluded) 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/librustdoc/html/static/js/main.js"},"region":{"startLine":941}}}],"partialFingerprints":{"codehealthFindingId/v1":"036d0f5215d1fb15b02faf8ca2e18c7b9f3535ae997e96f564f493028ffe87e7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: HirEqInterExpr.eq_expr: MethodTooLong \u2014 eq_expr 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/tools/clippy/clippy_utils/src/hir_utils.rs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa6b561a669e8574d04383eb2f6fb4574d58b570ebe92b714790c4a2c124091a"}},{"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/tools/miri/src/diagnostics.rs"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"4008b07131e18b272737afdb11bc63fdf33dddcdc7ba2d6b3c99015d5158b275"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/reload.rs: FileTooLong \u2014 704 significant 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 87% of them inside a single declaration: GlobalState (68-979). The bar is 500 significant lines; this is 204 over it, 1.41\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/tools/rust-analyzer/crates/rust-analyzer/src/reload.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f439ae57b09e78a71d7416535b6aad69482ca0451dc9daeee65f440b2696da1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/navigation_target.rs: FileTooLong \u2014 703 significant 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 203 over it, 1.41\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/tools/rust-analyzer/crates/ide/src/navigation_target.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f33996c5c7b504b76dcca5780787c0bf3baa57ca73a244f82df23a1f69a7ad61"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/display.rs: FileTooLong \u2014 702 significant 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 202 over it, 1.40\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/tools/rust-analyzer/crates/hir/src/display.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"749b154e6604cad806a018198660eab063c29d15097a1d31917b7e2cc6ae1244"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Printer: TooManyMethods \u2014 42 methods. The bar is 30 methods; this is 12 over it, 1.40\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":"compiler/rustc_ast_pretty/src/pp.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"938829677e9f37be01febc59498a3c458998e62027096c321954407d87eafa70"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ProbeContext: TooManyMethods \u2014 42 methods. The bar is 30 methods; this is 12 over it, 1.40\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":"compiler/rustc_hir_typeck/src/method/probe.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"da77cce65d3a466a45cffb171bad610ce355ec7760b79b268c8651a80055febb"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: core_arch::x86::avx512cd: TooManyFunctions \u2014 42 free functions. The bar is 30 free functions; this is 12 over it, 1.40\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":"library/stdarch/crates/core_arch/src/x86/avx512cd.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9a55f11e608fd60a4b1f7448a0993a2b89abca7add59bbe0924e23c9b185e1b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DefMap: TooManyMethods \u2014 42 methods, declared across 3 files: src/nameres.rs (28), nameres/path_resolution.rs (12), nameres/attr_resolution.rs (2). The bar is 30 methods; this is 12 over it, 1.40\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/tools/rust-analyzer/crates/hir-def/src/nameres.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"137587cddc135770b2fb45c60df50594591fb121fb8f46db60d6dbc22a2d99f9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: state/expr.rs: FileTooLong \u2014 700 significant 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: State (16-972). The bar is 500 significant lines; this is 200 over it, 1.40\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":"compiler/rustc_ast_pretty/src/pprust/state/expr.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bef7e504a32d966ff8e11946f1d92462ce192abf5a5610a9bbb9c95729eff45"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Session.new: MethodTooLong \u2014 new runs 140 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 40 over it, 1.40\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/session.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"b47b60e339edc17499c9cb054cd728b47ccf420580c7b77630d739b78bd8abbf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: interpret/place.rs: FileTooLong \u2014 698 significant 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 67% of them inside a single declaration: InterpCx (387-1187). The bar is 500 significant lines; this is 198 over it, 1.40\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":"compiler/rustc_const_eval/src/interpret/place.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed4fefe3380c2c347dd0468c8f80e900de486e692f9c85e1cfba78779c01fae1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/locator.rs: FileTooLong \u2014 698 significant 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 198 over it, 1.40\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":"compiler/rustc_metadata/src/locator.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2b0a5a06a9afc1dd7fb7bec3dd46747b58a5b5fba6a3aea63e02962187c52ca"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/binder.rs: FileTooLong \u2014 695 significant 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 195 over it, 1.39\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":"compiler/rustc_type_ir/src/binder.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c8a9b42c2e2ec82701ebd3e266914c88e369cca9361e9c203f26331d5634a61"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/fs.rs: FileTooLong \u2014 695 significant 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 195 over it, 1.39\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":"library/std/src/fs.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"358e2d75cd29284b5f3e8d9023bfd8c158aa3ddf9b3762771f8d561472bb3036"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustc_codegen_llvm::attributes::llfn_attrs_from_instance: FunctionTooLong \u2014 rustc_codegen_llvm::attributes::llfn_attrs_from_instance runs 139 significant 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 39 over it, 1.39\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":"compiler/rustc_codegen_llvm/src/attributes.rs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4cb585f3aa1c55cd357a92015b1f16dcfc7222dbdd1079d5a76f9961aa89906"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustdoc::clean::inline::build_impl: FunctionTooLong \u2014 rustdoc::clean::inline::build_impl runs 139 significant 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 39 over it, 1.39\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/librustdoc/clean/inline.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fd5cdedda45054b3f242db41a80c1f7c616d7a58012d97b45aca1550940c6bf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: infer/suggest.rs: FileTooLong \u2014 694 significant 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 96% of them inside a single declaration: TypeErrCtxt (2 blocks, 40-1035). The bar is 500 significant lines; this is 194 over it, 1.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":"compiler/rustc_trait_selection/src/error_reporting/infer/suggest.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1140d2d6d5056ee2edfe965b234131ca5b6a6d0650c36caf9146357395047a20"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/context.rs: FileTooLong \u2014 692 significant 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 192 over it, 1.38\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/tools/rust-analyzer/crates/ide-completion/src/context.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7da4e9fa7adf8f4c1beeb5bd59dacd193a10ea073f0350e738c42c051ba7651f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: hir_ty_lowering/dyn_trait.rs: FileTooLong \u2014 690 significant 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 190 over it, 1.38\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":"compiler/rustc_hir_analysis/src/hir_ty_lowering/dyn_trait.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf23a8ecc4bd91693021ed4a2cee052fc6493ff478831a9afa1b3103b4681884"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: builtin/fn_macro.rs: FileTooLong \u2014 690 significant 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 190 over it, 1.38\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/tools/rust-analyzer/crates/hir-expand/src/builtin/fn_macro.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"453c1c93cdab2bd3f07e34f4f76ce7cb97a93215778348c015b727adda740f25"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CodegenCx.new: MethodTooLong \u2014 new runs 138 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 38 over it, 1.38\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_gcc/src/context.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"90efdb6f6cdb6a53d271ca8691124bc43a16c829375db9d3342cdf790e4bd6ca"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustdoc::passes::lint::unescaped_backticks::visit_item: FunctionTooLong \u2014 rustdoc::passes::lint::unescaped_backticks::visit_item runs 138 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 38 over it, 1.38\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/passes/lint/unescaped_backticks.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"e16716db7ca6c8796d875217f7986d04e2b8c80cf677ecb2bd4165d057355af3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DefCollector.record_resolved_import: MethodTooLong \u2014 record_resolved_import runs 138 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 38 over it, 1.38\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/nameres/collector.rs"},"region":{"startLine":882}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dc7ed35415c148b99be67f364e14cd2cc7b7d2039fccc37a7a71c8e90240c93"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CommentRewrite.handle_line: MethodTooLong \u2014 handle_line runs 138 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 38 over it, 1.38\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/comment.rs"},"region":{"startLine":713}}}],"partialFingerprints":{"codehealthFindingId/v1":"b48db5ffbf3c87b1887d646891a9fdecf33ef94aaac1a2d6919e71b8dae5ecc3"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: AnyDiagnostic: ClassTooLong \u2014 551 significant 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 151 over it, 1.38\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir/src/diagnostics.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce95c5c0cc6e40162e37f72058d30f7b5bc2479da586f54181d74e412b50eeba"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: bootstrap::core::build_steps::format::format: FunctionTooLong \u2014 bootstrap::core::build_steps::format::format runs 137 significant 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 37 over it, 1.37\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/build_steps/format.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"685cacf14db2cc59356b7acaae01aca9d5e669b33b7e012fcb36000af7bf641e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustdoc::html::markdown::markdown_links: FunctionTooLong \u2014 rustdoc::html::markdown::markdown_links runs 137 significant 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 37 over it, 1.37\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/markdown.rs"},"region":{"startLine":1819}}}],"partialFingerprints":{"codehealthFindingId/v1":"66b3807b59cd6b246c1ed18995bdca0c117aef02fa94340bb48dc07defbd3a2d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: clippy_lints::eta_reduction::check_closure: FunctionTooLong \u2014 clippy_lints::eta_reduction::check_closure runs 137 significant 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 37 over it, 1.37\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/eta_reduction.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"0849311bb6db86e600d3a5826cb7373b96a5ea8200375c5d5d1e26a3f65aa4ae"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TyLoweringContext.lower_dyn_trait: MethodTooLong \u2014 lower_dyn_trait runs 137 significant 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 37 over it, 1.37\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/lower.rs"},"region":{"startLine":1034}}}],"partialFingerprints":{"codehealthFindingId/v1":"436ea3f5f4bc9fa556e14b432543cc97267e1d2307d080335621e7060c237eb2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ide_assists::handlers::generate_delegate_methods::generate_delegate_methods: FunctionTooLong \u2014 ide_assists::handlers::generate_delegate_methods::generate_delegate_methods runs 137 significant 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 37 over it, 1.37\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_delegate_methods.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"39be2d412d5d08845136953fb9eb5f141d86d5ae842260c82f06b430a2d12270"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GlobalState.process_changes: MethodTooLong \u2014 process_changes runs 137 significant 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 37 over it, 1.37\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/global_state.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"eec001bad04f81ff26037bacd7cc2697d5bf1bb061f7550fdbf14530548644c1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Token: TooManyMethods \u2014 41 methods. The bar is 30 methods; this is 11 over it, 1.37\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ast/src/token.rs"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2bb27b1f10f6226b62c8ae5a11348cb45e8b28f8a54baf4e95abb431a2c8377"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Diag: TooManyMethods \u2014 41 methods. The bar is 30 methods; this is 11 over it, 1.37\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_errors/src/diagnostic.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"152972d1992ce10b760e210b71d8d3dd059e95148d33ae5d46ab91d2f45d7913"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: core_arch::riscv_shared: TooManyFunctions \u2014 41 free functions. The bar is 30 free functions; this is 11 over it, 1.37\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/riscv_shared/mod.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca2e4f027e02aa72b728e89dbdb5aad7e8a0211b0b81a8308a9e113af7f9a8ef"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: InferenceTable: TooManyMethods \u2014 41 methods, declared across 3 files: infer/unify.rs (38), infer/autoderef.rs (2), src/method_resolution.rs (1). The bar is 30 methods; this is 11 over it, 1.37\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/infer/unify.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee859bec0b2d88d9bfe412c5a5e2d7696325b93772caca38c78ca97ed59cda86"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: fn_ctxt/adjust_fulfillment_errors.rs: FileTooLong \u2014 683 significant 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 183 over it, 1.37\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/fn_ctxt/adjust_fulfillment_errors.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"64a3558be6c0e9d211be64daa90f19c8bf1d2e161316a1c5c1015c1365b8b277"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: interpret/call.rs: FileTooLong \u2014 682 significant 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 95% of them inside a single declaration: InterpCx (55-1227). The bar is 500 significant lines; this is 182 over it, 1.36\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":"compiler/rustc_const_eval/src/interpret/call.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3bc2d03ec88b2e12d1410a4b1340bc9216ff176755029e25d3b72127c528e82"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mir/statement.rs: FileTooLong \u2014 682 significant 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 182 over it, 1.36\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":"compiler/rustc_middle/src/mir/statement.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"89b4ab11e5715553a6db04a735792c4e0252dfd026afb04f659bdcba5d2a33ed"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: stable/mir.rs: FileTooLong \u2014 682 significant 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 182 over it, 1.36\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":"compiler/rustc_public/src/unstable/convert/stable/mir.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab34bbac0147cc069f1ad88c5dad49e0e961dff2ed1637da1ceef5261a820bc3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/v0.rs: FileTooLong \u2014 681 significant 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: V0SymbolMangler (3 blocks, 230-1066). The bar is 500 significant lines; this is 181 over it, 1.36\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":"compiler/rustc_symbol_mangling/src/v0.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5adb955f71c4c591d0d5f173101ef459490bf06592a10819de7ff48be4257c45"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FnCtxt.suggest_unwrapping_inner_self: MethodTooLong \u2014 suggest_unwrapping_inner_self 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":"compiler/rustc_hir_typeck/src/method/suggest.rs"},"region":{"startLine":3272}}}],"partialFingerprints":{"codehealthFindingId/v1":"07a80cca998347e9a281be244c345ad2ff38f7b0cbbd6c81c5d41400ab89a614"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MoveDataBuilder.move_path_for: MethodTooLong \u2014 move_path_for 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":"compiler/rustc_mir_dataflow/src/move_paths/builder.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"224142f3ae744933195c8417f5952753a8b7120bba1111c2f92bd7348c9999cc"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: bootstrap::core::config::toml::rust::check_incompatible_options_for_ci_rustc: FunctionTooLong \u2014 bootstrap::core::config::toml::rust::check_incompatible_options_for_ci_rustc 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/bootstrap/src/core/config/toml/rust.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"405725b86e74fce0942e171ce1a4c8f20aeea614031366e9a29ccc8cdd46aa83"}},{"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/tools/miri/src/borrow_tracker/tree_borrows/mod.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecc0161802b41d31e8a4ac3627be587d64bc1ccea06bc7d025dd680f20aae18d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 679 significant 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 179 over it, 1.36\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/tools/rust-analyzer/crates/syntax-bridge/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dc33a713fbdf2e57bba450c5bc8391a7e2b9c3d9371992ea2eca98fd0c86324"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: infer/mod.rs: FileTooLong \u2014 677 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 67% of them inside a single declaration: InferCtxt (2 blocks, 231-1279). The bar is 500 significant lines; this is 177 over it, 1.35\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3453d7d7b5ef9e09132a7b4f77406c1a3a02b4d135efbab3321885dac46454e5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustc_builtin_macros::deriving::coerce_pointee::expand_derive_coerce_pointee: FunctionTooLong \u2014 rustc_builtin_macros::deriving::coerce_pointee::expand_derive_coerce_pointee runs 135 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 35 over it, 1.35\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_builtin_macros/src/deriving/coerce_pointee.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcdba8b674b823eb2d357c4c313053a192a2359a1f55028ee3af4eb20afbb59d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustc_codegen_ssa::mir::arg_local_refs: FunctionTooLong \u2014 rustc_codegen_ssa::mir::arg_local_refs runs 135 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 35 over it, 1.35\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/mir/mod.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bcf10941db2666181e1036ac14b4e9d913c4686580fc8ed7799ac5662daa44d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustc_mir_transform::shim::build_call_shim: FunctionTooLong \u2014 rustc_mir_transform::shim::build_call_shim runs 135 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 35 over it, 1.35\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/shim.rs"},"region":{"startLine":781}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4b2727736c91b7b10df8e88ce518f5ddc35fe8c453bea73de2108e477de90cc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Parser.parse_path_segment_with_path_span: MethodTooLong \u2014 parse_path_segment_with_path_span runs 135 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 35 over it, 1.35\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/path.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd68eae02a93df177a898088fe840add31585a7a6c1045642abf11b82509b4b5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: bootstrap::bin::rustc::main: FunctionTooLong \u2014 bootstrap::bin::rustc::main runs 135 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 35 over it, 1.35\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/bin/rustc.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"2987bb4b981243ae06f8a4c1769eedf25945764ce26368a2aa08e45ba5919ff1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ExprCollector.maybe_collect_expr_as_pat: MethodTooLong \u2014 maybe_collect_expr_as_pat runs 135 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 35 over it, 1.35\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/expr_store/lower.rs"},"region":{"startLine":2086}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb38242f10216c966cbea1e10966b7641e8319f11a8ffbbab5fc28a27018dafe"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rust_analyzer::handlers::notification::run_flycheck: FunctionTooLong \u2014 rust_analyzer::handlers::notification::run_flycheck runs 135 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 35 over it, 1.35\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/handlers/notification.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaa327669517c2e9c85e72f294218aa0ec2413df26c837e27437bf1af0f3a55b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/value_and_place.rs: FileTooLong \u2014 672 significant 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 172 over it, 1.34\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/src/value_and_place.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6bd64ddf491f579d5a73cfa0b3a576f732e0c19f19bba8e3933731a38c4c01a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lasx/portable.rs: FileTooLong \u2014 672 significant 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 38 free functions. The bar is 500 significant lines; this is 172 over it, 1.34\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/loongarch64/lasx/portable.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3fbc454b88fee10b2a4eab0a070f31b5e9688931d5957d721dad34bdc1a022f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: diagnostics/region_name.rs: FileTooLong \u2014 671 significant 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 171 over it, 1.34\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/diagnostics/region_name.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eca3dd9101243d46333d5f5a53fd36690e42849b2449c35b646971364f8bde1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: assembly/structural_traits.rs: FileTooLong \u2014 671 significant 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 171 over it, 1.34\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_next_trait_solver/src/solve/assembly/structural_traits.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3f0ba3801e6ff875e97d35580dc16816ad5d437409fe73c57f23b1f0d89e1e8"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: LinkCollector: ClassTooLong \u2014 536 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 14 methods, 4 blocks, lines 255-1708. The bar is 400 significant lines; this is 136 over it, 1.34\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/librustdoc/passes/collect_intra_doc_links.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f2527ae90ba2a889b6481109afc872ab052c056abb68f718733cf5aeb69439a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: coherence/builtin.rs: FileTooLong \u2014 670 significant 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 170 over it, 1.34\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/coherence/builtin.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"babf615508dc9c400bcdf69baccd557f45956a75d6a47f445153fc65fa0cfced"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LateResolutionVisitor.resolve_expr: MethodTooLong \u2014 resolve_expr runs 134 significant 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 34 over it, 1.34\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":"compiler/rustc_resolve/src/late.rs"},"region":{"startLine":5512}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbec75eeaf55d1c82bb20e83f5fc6df4552c39880a01af15f2f4d8bd8ea1395f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ProjectWorkspace.to_roots: MethodTooLong \u2014 to_roots runs 134 significant 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 34 over it, 1.34\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/tools/rust-analyzer/crates/project-model/src/workspace.rs"},"region":{"startLine":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"92544a7a1bbf2b536556f09a728caab2c227124c80f2ee02c1085df316fecb0a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rust_analyzer::lsp::capabilities::server_capabilities: FunctionTooLong \u2014 rust_analyzer::lsp::capabilities::server_capabilities runs 134 significant 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 34 over it, 1.34\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/tools/rust-analyzer/crates/rust-analyzer/src/lsp/capabilities.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4c3c132a4a0856603f5f8c87e4c4ccc314e6c9ca29d7362466da35ee69bf809"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/writeback.rs: FileTooLong \u2014 669 significant 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 74% of them inside a single declaration: WritebackCx (4 blocks, 100-899). The bar is 500 significant lines; this is 169 over it, 1.34\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":"compiler/rustc_hir_typeck/src/writeback.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5b518c354e25f2d3af455a54eac693a6ba2cf91852cd92cba8d9f4becdc29fb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lsp/ext.rs: FileTooLong \u2014 669 significant 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 169 over it, 1.34\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/lsp/ext.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"126ce7e2107d6758edb3366894f23726c61853ce397b2f75e17731c3ea330760"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Parser: ClassTooLong \u2014 535 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 482 methods, 3 blocks, lines 201-1035. The bar is 400 significant lines; this is 135 over it, 1.34\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":"compiler/rustc_parse_format/src/lib.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6d5bd1da1fec6ced9f9da57f731b75d2f04a3e811f62252c05cca60e9851ccf"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: VnState: TooManyMethods \u2014 40 methods. The bar is 30 methods; this is 10 over it, 1.33\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/gvn.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b7e6f48e2ba811eda12693f73cfde30238c8db66c15f762c9fcbdf68a69ac43"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/flycheck.rs: FileTooLong \u2014 666 significant 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 166 over it, 1.33\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/tools/rust-analyzer/crates/rust-analyzer/src/flycheck.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"966bc290ac6717648c6ed29ab55049f202f4ff45b983883e4bb3952ec8bb7668"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FnCtxt.check_expr_closure: MethodTooLong \u2014 check_expr_closure runs 133 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 33 over it, 1.33\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/closure.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f75808cbeab841bae394e49e73727857296f25a9f013f53355a87347a73fb6f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: InlineAsmCtxt.check_asm: MethodTooLong \u2014 check_asm runs 133 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 33 over it, 1.33\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/inline_asm.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"1362816fff994a21645ea35d40294c493ae0a78dd5b5d30fe5bdcbfcbdd98e1a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AssignmentResult.report_fully_unused: MethodTooLong \u2014 report_fully_unused runs 133 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 33 over it, 1.33\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/liveness.rs"},"region":{"startLine":961}}}],"partialFingerprints":{"codehealthFindingId/v1":"23eaf33ec683dde91253d5592b462163e806e7c83770af96f2941056a6a0cec1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DefCollector.build_reduced_graph_for_use_tree: MethodTooLong \u2014 build_reduced_graph_for_use_tree runs 133 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 33 over it, 1.33\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/build_reduced_graph.rs"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"333b7679cb52ce17fed822005f8a926fb78342ad800d5887d2254cdd7347f6a3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: clippy_lints::loops::never_loop::never_loop_expr: FunctionTooLong \u2014 clippy_lints::loops::never_loop::never_loop_expr runs 133 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 33 over it, 1.33\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/loops/never_loop.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"df7f9bb35c1e9294a88c7d37fb78024f1ae9b5b4298f072589a0164c7d893a83"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PathLoweringContext.substs_from_args_and_bindings: MethodTooLong \u2014 substs_from_args_and_bindings runs 133 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 33 over it, 1.33\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/lower/path.rs"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee03e4e2de14fc7a3add2a124b20e96383c0daed8c204ee8f88c215fb9d47eeb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/chains.rs: FileTooLong \u2014 662 significant 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 162 over it, 1.32\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/tools/rustfmt/src/chains.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"612e04f94b9220e9d918253d9a1eb7aeed0d94fbfde381d2b5d7c6d97c653058"}},{"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":"src/tools/miri/priroda/src/frontend/dap.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"6705399eccc17649f48520af1b35056237a6d373441f20f8aa440b8fa0febcf3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: imports/merge_imports.rs: FileTooLong \u2014 660 significant 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 160 over it, 1.32\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/tools/rust-analyzer/crates/ide-db/src/imports/merge_imports.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5d25ccb489d449bef6259424cb042bb02e7635de2b19d8e7a1c084c049bf8ba"}},{"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/tools/miri/src/machine.rs"},"region":{"startLine":697}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7416beee7cac194eed012c138c7dccd5bf96268eed9a8de4f4cc9443db0e7de"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Options: ClassTooLong \u2014 526 significant 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, 3 blocks, lines 64-994. The bar is 400 significant lines; this is 126 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":"src/librustdoc/config.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"f72a39a184f150a9b2a03cc91ded04bc9d0f07df82f433432d4e40945c9bd430"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Intrinsic: ClassTooLong \u2014 524 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 11 methods, 3 blocks, lines 893-1832. The bar is 400 significant lines; this is 124 over it, 1.31\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/stdarch-gen-arm/src/intrinsic.rs"},"region":{"startLine":893}}}],"partialFingerprints":{"codehealthFindingId/v1":"15c7f4c4cfee4bd341b68d7a34d7dd9b0f9fbcdcc7e05aaddcf7cdf415dbf8a7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: traits/fulfill.rs: FileTooLong \u2014 655 significant 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 67% of them inside a single declaration: FulfillProcessor (3 blocks, 281-1031). The bar is 500 significant lines; this is 155 over it, 1.31\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":"compiler/rustc_trait_selection/src/traits/fulfill.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8567a3bef8d254d506ee54ac3e4235a151769eff9b7ccf19cbc040e4fea0d88a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustc_codegen_cranelift::inline_asm::codegen_inline_asm_terminator: FunctionTooLong \u2014 rustc_codegen_cranelift::inline_asm::codegen_inline_asm_terminator runs 131 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 31 over it, 1.31\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/src/inline_asm.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ae31899db412e0185fcf4a51aed0d8e8518c4afdf2394d6217f51817d39ebf2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DropCtxt.build_pin_poll_yield_loop: MethodTooLong \u2014 build_pin_poll_yield_loop runs 131 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 31 over it, 1.31\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/elaborate_drop.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"5610de12e5718ddb9d453baee87871516ffb6c27acd9a13f890d2b4d9482a60a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DeepRejectCtxt.types_may_unify_inner: MethodTooLong \u2014 types_may_unify_inner runs 131 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 31 over it, 1.31\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_type_ir/src/fast_reject.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1e91a007cfc8afca5e55daaaa1271a67447d1743ba5f4e574a3bcece5bf8c86"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: clippy_lints::methods::manual_inspect::check: FunctionTooLong \u2014 clippy_lints::methods::manual_inspect::check runs 131 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 31 over it, 1.31\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/methods/manual_inspect.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"d70a394e7a1358dd73d7cd62895c39504e6fd5b950d1b337ffb8f83791e2feb1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: hir_ty::next_solver::default_types: FunctionTooLong \u2014 hir_ty::next_solver::default_types runs 131 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 31 over it, 1.31\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/next_solver.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"160696ef7dd8e66e9eac329b967289e700024893106dbb2662e450f441722c1b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: tt::storage::encode: FunctionTooLong \u2014 tt::storage::encode runs 131 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 31 over it, 1.31\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/tt/src/storage.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"339582bb0f1d5cb950d1b0c470389a4ca75d40535bc3423adaab2fd42f46d7da"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: rustdoc-json-types/lib.rs: FileTooLong \u2014 654 significant 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 154 over it, 1.31\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/rustdoc-json-types/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"be3e411a4769fa69e7de3aaf75e999ce96131e78b720df4d435bad2638339609"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/thin_map.rs: FileTooLong \u2014 652 significant 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 152 over it, 1.30\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/stdx/src/thin_map.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b39536e71475e35041fbf6d6abc8c6dd0918af86e3bc869318e4dcd7e6388df"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Diag: ClassTooLong \u2014 521 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 41 methods, 6 blocks, lines 354-1295. The bar is 400 significant lines; this is 121 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":"compiler/rustc_errors/src/diagnostic.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1abc5a18250c2a2c8a46be485afef12a967beb00bfee98ee70338e92c6e2f4b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TypeChecker: TooManyMethods \u2014 39 methods, declared across 4 files: type_check/mod.rs (21), type_check/canonical.rs (13), type_check/input_output.rs (3), type_check/relate_tys.rs (2). The bar is 30 methods; this is 9 over it, 1.30\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/type_check/mod.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf043a0e77c5674f2d45acaacda8da84dbc405fa56bbec5766fb1a57e74afc2f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DropCtxt: 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":"compiler/rustc_mir_transform/src/elaborate_drop.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"38c43596bbcf94f44e5c8176eab1d3157e751023a75b3db0fb697bcb208b27f1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Command: 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":"library/std/src/sys/process/unix/common.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"802797cf09b111518d0a90b655ef8de5527fc546d20b913bfa9859a80e0871f8"}},{"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":"src/tools/miri/priroda/src/debugger.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3857b0aec9b958803d90040e8c150d71899eb5ecd7de116cd594ed948670573"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: InferenceResult: 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":"src/tools/rust-analyzer/crates/hir-ty/src/infer.rs"},"region":{"startLine":760}}}],"partialFingerprints":{"codehealthFindingId/v1":"300347bb0705f28784c5d1ef5a5e3b3fd4b2f633e4b7b49ad34703eda537fb7d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ProbeContext: 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":"src/tools/rust-analyzer/crates/hir-ty/src/method_resolution/probe.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f81c32b2610ca7b7f19e320381755bba0f729f14391e78780affbcac8948acc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LoweringContext.lower_trait_item: MethodTooLong \u2014 lower_trait_item runs 130 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 30 over it, 1.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ast_lowering/src/item.rs"},"region":{"startLine":810}}}],"partialFingerprints":{"codehealthFindingId/v1":"97abf8e5ffa5ef059a748abcbdf2ad9f433e1eeba8bd984203ee6af7f89be82b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustc_attr_parsing::check_cfg::unexpected_cfg_name: FunctionTooLong \u2014 rustc_attr_parsing::check_cfg::unexpected_cfg_name runs 130 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 30 over it, 1.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_attr_parsing/src/check_cfg.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1a556fb04160aebc56fd88295df3624add466ef028c62280116f399ea004411"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustc_codegen_llvm::asm::llvm_fixup_output: FunctionTooLong \u2014 rustc_codegen_llvm::asm::llvm_fixup_output runs 130 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 30 over it, 1.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/asm.rs"},"region":{"startLine":1374}}}],"partialFingerprints":{"codehealthFindingId/v1":"75019787f657798f452c4d174d916ccfc54ef54c6dd963154b8c5cbcb7f6c265"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustc_codegen_llvm::back::write::codegen: FunctionTooLong \u2014 rustc_codegen_llvm::back::write::codegen runs 130 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 30 over it, 1.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/back/write.rs"},"region":{"startLine":971}}}],"partialFingerprints":{"codehealthFindingId/v1":"1312dfe50de4d08d1eafd2d06df2a29e0c5f6727554e5d75c3266cae5217e2f6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustc_hir_analysis::coherence::builtin::coerce_unsized_info: FunctionTooLong \u2014 rustc_hir_analysis::coherence::builtin::coerce_unsized_info runs 130 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 30 over it, 1.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/coherence/builtin.rs"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"63828991b9402c44a00d3540282d943f221576739c8055663731032c66613772"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ExprUseVisitor.cat_pattern: MethodTooLong \u2014 cat_pattern runs 130 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 30 over it, 1.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/expr_use_visitor.rs"},"region":{"startLine":1590}}}],"partialFingerprints":{"codehealthFindingId/v1":"43d983670f3c65a238589ce9d6f4603e991812bb88ce7489bc622f7589f2dd37"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustc_interface::interface::parse_check_cfg: FunctionTooLong \u2014 rustc_interface::interface::parse_check_cfg runs 130 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 30 over it, 1.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_interface/src/interface.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"f28abd0d9eb82c8d35c0f8d670ea414a5d3221011862de910d3ac1f70cdd6494"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: InferenceContext.try_find_coercion_lub: MethodTooLong \u2014 try_find_coercion_lub runs 130 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 30 over it, 1.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/infer/coerce.rs"},"region":{"startLine":926}}}],"partialFingerprints":{"codehealthFindingId/v1":"a015487507a34e3313fefc28b5c47347d72b36ca5c56ccf3dfd427fce0df840f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mir/operand.rs: FileTooLong \u2014 649 significant 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 149 over it, 1.30\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/mir/operand.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf970778bf4d6d0b3a909014fd8322b556ce9606fc0ab6ee1d00253f06b2dfac"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: RoaringBitmap: ClassTooLong \u2014 519 significant lines (blank, comment-only and punctuation-only lines excluded), 14 methods. The bar is 400 significant lines; this is 119 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":"src/librustdoc/html/static/js/stringdex.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"8953c24bc9d0d340ee32fc1df2abb0ec5afadfe8ec1a10511885bab9006fc688"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustc_monomorphize::collector::collect_items_rec: FunctionTooLong \u2014 rustc_monomorphize::collector::collect_items_rec runs 129 significant 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 29 over it, 1.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":"compiler/rustc_monomorphize/src/collector.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecd223494f480709706c4e56f301d2fb1adf71b3450f6f9374e0be72465b3d2b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LateResolutionVisitor.resolve_impl_item: MethodTooLong \u2014 resolve_impl_item runs 129 significant 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 29 over it, 1.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":"compiler/rustc_resolve/src/late.rs"},"region":{"startLine":3844}}}],"partialFingerprints":{"codehealthFindingId/v1":"f53c89feae96270b9ac44668c19da52415d1b2e921c8a214d7be5fee2eb65a4c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DocSearch.parseQuery: MethodTooLong \u2014 parseQuery runs 129 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 29 over it, 1.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/librustdoc/html/static/js/search.js"},"region":{"startLine":1407}}}],"partialFingerprints":{"codehealthFindingId/v1":"8094d1c5e6475f79cd44f753d04d2424dd6b5c33769f41b9da202823de6df8ec"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Evaluator.interpret_mir: MethodTooLong \u2014 interpret_mir runs 129 significant 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 29 over it, 1.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/tools/rust-analyzer/crates/hir-ty/src/mir/eval.rs"},"region":{"startLine":796}}}],"partialFingerprints":{"codehealthFindingId/v1":"57775522f8a6b2a45830748135ab850f75307b23cb255c6c694ca4636ef2d004"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ide_assists::utils::gen_trait_fn_body::gen_partial_eq: FunctionTooLong \u2014 ide_assists::utils::gen_trait_fn_body::gen_partial_eq runs 129 significant 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 29 over it, 1.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/tools/rust-analyzer/crates/ide-assists/src/utils/gen_trait_fn_body.rs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"95fd1acff42608262485806ba9ecce4ddd074ed2e8fe2f2f7dbc57e1f74ebef6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: clean/cfg.rs: FileTooLong \u2014 643 significant 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 143 over it, 1.29\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/librustdoc/clean/cfg.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cee25f072bd3cef6fd9379c0f5e8c428e3c1dbaf25708d0d9bc1b59b00532de9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 642 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 74% of them inside a single declaration: Cursor (2 blocks, 424-1291). The bar is 500 significant lines; this is 142 over it, 1.28\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":"compiler/rustc_lexer/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"88945b4d57480f2b5e5501272109ae8391d5df4380b5a7a2494959fb7c5c85aa"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: WfPredicates: ClassTooLong \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), 14 methods, 3 blocks, lines 217-1303. The bar is 400 significant lines; this is 113 over it, 1.28\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":"compiler/rustc_trait_selection/src/traits/wf.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"21904392d52a1f8b41bdc3eedf539938cf30b2c7adae2ef9550fb0a0436bbf1d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lists.rs: FileTooLong \u2014 640 significant 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 140 over it, 1.28\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/tools/rustfmt/src/lists.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cbf1fcdfcd7e29ba50d0d7cb596c3de105135aa98c80c9c387b635f4a42fffa"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CrateInfo.new: MethodTooLong \u2014 new runs 128 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 28 over it, 1.28\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/base.rs"},"region":{"startLine":1017}}}],"partialFingerprints":{"codehealthFindingId/v1":"48daf55f9b25e7e145445be56d173a0e54133a97ebdbd51a426e5ccc46e28a6c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WrongNumberOfGenericArgs.suggest_removing_args_or_generics: MethodTooLong \u2014 suggest_removing_args_or_generics runs 128 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 28 over it, 1.28\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/diagnostics/wrong_number_of_generic_args.rs"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3bc4edf48e7b6d0365518bee215b5576ecf872d56156ab66117f9c0903063a1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ProbeContext.consider_probe: MethodTooLong \u2014 consider_probe runs 128 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 28 over it, 1.28\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/method_resolution/probe.rs"},"region":{"startLine":1567}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc45accaf8fe5ce6c8eec8bf09f57767b5064cb79b1da8726fa456b423d9535f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: project_model::workspace::cargo_to_crate_graph: FunctionTooLong \u2014 project_model::workspace::cargo_to_crate_graph runs 128 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 28 over it, 1.28\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/project-model/src/workspace.rs"},"region":{"startLine":1264}}}],"partialFingerprints":{"codehealthFindingId/v1":"533942fd660dac4779e6b4d72b10b7a319ac06d6d9ddfed19ea9249c8fd7e348"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: enums/cpp_like.rs: FileTooLong \u2014 639 significant 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 139 over it, 1.28\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":"compiler/rustc_codegen_llvm/src/debuginfo/metadata/enums/cpp_like.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4384d10707a8b47f13306a20763b84ab59ff4e4870ceadf4ca2b450c065af29c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: abi/mod.rs: FileTooLong \u2014 636 significant 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 136 over it, 1.27\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":"compiler/rustc_codegen_cranelift/src/abi/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f9585715f47363452efdab08d016e842f73bd46e605842dcd2c239348995d1e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/dataflow_const_prop.rs: FileTooLong \u2014 636 significant 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 136 over it, 1.27\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":"compiler/rustc_mir_transform/src/dataflow_const_prop.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cb733ecc185b32868a9fbe5cf134336ae364b74941778a5c29b3fe453c9535e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: std_detect::detect::os::linux::riscv::detect_features: FunctionTooLong \u2014 std_detect::detect::os::linux::riscv::detect_features runs 127 significant 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 27 over it, 1.27\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std_detect/src/detect/os/linux/riscv.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a17ac97909d4a37714e13ce5ca04f1f58036d54f4dab6f2ebf53995ebf8dc11"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SerializedSearchIndex.sort: MethodTooLong \u2014 sort runs 127 significant 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 27 over it, 1.27\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/render/search_index.rs"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ba4fe595f4746089bfc39b281c09ed49846a2d00fcec7810c6993a91c58a98f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: clippy_dev::fmt::fmt_conf: FunctionTooLong \u2014 clippy_dev::fmt::fmt_conf runs 127 significant 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 27 over it, 1.27\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_dev/src/fmt.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ec1c0f6656547acc1037e942dfec146cda75dcd7ae19c3a40edce3f2ab01d8a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TupleArrayConversions.check_expr: MethodTooLong \u2014 check_expr runs 127 significant 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 27 over it, 1.27\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/tuple_array_conversions.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"cde07c6dc39266695bea24cc503fffdb48653cec1f4392cb02802998922d9c19"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Evaluator.patch_addresses: MethodTooLong \u2014 patch_addresses runs 127 significant 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 27 over it, 1.27\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/mir/eval.rs"},"region":{"startLine":2396}}}],"partialFingerprints":{"codehealthFindingId/v1":"108e9ae37ed1e03b016986581c1b628375cc554e075a936fdda629444927c6a8"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: core_arch::x86::avx512bf16: TooManyFunctions \u2014 38 free functions. The bar is 30 free functions; this is 8 over it, 1.27\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512bf16.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4041c0bc430444a9baf00d68bcc048d379222fde2f837be4ef44cc657690a9f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SyntaxContext: TooManyMethods \u2014 38 methods, declared across 2 files: src/hygiene.rs (20), src/hygiene.rs (18). The bar is 30 methods; this is 8 over it, 1.27\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/tools/rust-analyzer/crates/span/src/hygiene.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac320c8738579d248c9605a424b6df4aedde7066f553dc8406f19d09b1480019"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Flags: TooManyFields \u2014 38 stored fields beside 2 methods. The bar is 30 stored fields; this is 8 over it, 1.27\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/config/flags.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b0ab5629f0eeab4dda782b313e6ebee65a26b3aeba83bdd1c0bc73738564e0d"}},{"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/tools/miri/src/eval.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"931c32357bfe442e262b134523330974f161e271dba4266f565a1cec571236b9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: infer/closure.rs: FileTooLong \u2014 633 significant 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 95% of them inside a single declaration: InferenceContext (51-1169). The bar is 500 significant lines; this is 133 over it, 1.27\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/tools/rust-analyzer/crates/hir-ty/src/infer/closure.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ada1efb3e31986d3bd941cf4ef86aaefc70589278a3ae7c56f5ca3c283c5440"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/inline_asm.rs: FileTooLong \u2014 630 significant 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 61% of them inside a single declaration: InlineAssemblyGenerator (2 blocks, 297-878). The bar is 500 significant lines; this is 130 over it, 1.26\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":"compiler/rustc_codegen_cranelift/src/inline_asm.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b893d8c698bb16a3f3f65ef110514688dc282264092883298bc701bd32d21625"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: interpret/error.rs: FileTooLong \u2014 630 significant 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 130 over it, 1.26\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/mir/interpret/error.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"acb221bc865f26732ddb0e011bd5adc6e8e9e8b016f4115591e8c0e7b3e917dc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/move_elimination.rs: FileTooLong \u2014 630 significant 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 130 over it, 1.26\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/move_elimination.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7c6bc168a87a78bc4f5d20b6f119f21ba64e1c3742270a75c37eb74e0f93644"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TargetDataLayout.parse_from_llvm_datalayout_string: MethodTooLong \u2014 parse_from_llvm_datalayout_string runs 126 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 26 over it, 1.26\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_abi/src/lib.rs"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfb3204e3f52ad709767269fb90dc5e0430964392026c09f8c616a8195d7f1a0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FnCtxt.annotate_alternative_method_deref: MethodTooLong \u2014 annotate_alternative_method_deref runs 126 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 26 over it, 1.26\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/demand.rs"},"region":{"startLine":952}}}],"partialFingerprints":{"codehealthFindingId/v1":"3146cf24134d58513ffb2bb73348ccb17d1569f05f9b6768c17427c83b3e1121"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: UnsafeOpKind.emit_unsafe_op_in_unsafe_fn_lint: MethodTooLong \u2014 emit_unsafe_op_in_unsafe_fn_lint runs 126 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 26 over it, 1.26\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_build/src/check_unsafety.rs"},"region":{"startLine":671}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff516ea84e86c0ce228ea487c8f8f1491c7c454a631a3c8081767b0f50a23a66"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustc_ty_utils::consts::recurse_build: FunctionTooLong \u2014 rustc_ty_utils::consts::recurse_build runs 126 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 26 over it, 1.26\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ty_utils/src/consts.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"68bd5fe268b7265b09ebd545e106470e69cd1346974c7106c94f4a07ac795bd4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustdoc::json::conversions::maybe_from_hir_attr: FunctionTooLong \u2014 rustdoc::json::conversions::maybe_from_hir_attr runs 126 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 26 over it, 1.26\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/json/conversions.rs"},"region":{"startLine":1055}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4458e302968935e5ec29629b37974a794ee581ed5bd20eced2d856e5b136afc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MacroCallId.expand_speculative: MethodTooLong \u2014 expand_speculative runs 126 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 26 over it, 1.26\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-expand/src/lib.rs"},"region":{"startLine":783}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f71d0e037aca0f9c936348cc06154f69cb6ca3db1648ad4636a45a69b939b65"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: tt::storage::decode: FunctionTooLong \u2014 tt::storage::decode runs 126 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 26 over it, 1.26\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/tt/src/storage.rs"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"883043b41bee9dfdf166c77449b0767602f90bfe90b64cdf2a6d99189a3a3e30"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: attributes/codegen_attrs.rs: FileTooLong \u2014 627 significant 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 127 over it, 1.25\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_attr_parsing/src/attributes/codegen_attrs.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"539a6828baef4dcff66c92438102625238867b353c4d61aa3ff02e1719d5554b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: intrinsics/simd.rs: FileTooLong \u2014 627 significant 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 95% of them inside a single declaration: InterpCx (17-854). The bar is 500 significant lines; this is 127 over it, 1.25\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":"compiler/rustc_const_eval/src/interpret/intrinsics/simd.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e83d823419dc94894eff05f24d3d8d9e892eaca7921b10331e65c3b5dcaa9c0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: syntax_highlighting/highlight.rs: FileTooLong \u2014 627 significant 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 127 over it, 1.25\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/syntax_highlighting/highlight.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5096d685157dc517ce19b5c96f352bbc2ee602d5c426127aa09a0374b80e383c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: parser/function.rs: FileTooLong \u2014 626 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 126 over it, 1.25\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/function.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3af45ef98948938e36dda7c09ef78a5727d327bd2c5c02631fc27a6eeff89e1a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LoweringContext.make_lowered_await: MethodTooLong \u2014 make_lowered_await runs 125 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 25 over it, 1.25\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ast_lowering/src/expr.rs"},"region":{"startLine":1006}}}],"partialFingerprints":{"codehealthFindingId/v1":"de76e7bf833f560b2590c5c350e3d57bfa0f340ad02282c8513b2f74186b1158"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypeErrCtxt.on_unimplemented_components: MethodTooLong \u2014 on_unimplemented_components runs 125 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 25 over it, 1.25\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/error_reporting/traits/on_unimplemented.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce861423b3c1a1d8ab5406077b1ddb19f7b0d06c95438d1b2cbd3649e22914ba"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: InlineNeighborsTree.decode: MethodTooLong \u2014 decode runs 125 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 25 over it, 1.25\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/stringdex.js"},"region":{"startLine":2597}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd2fa7a89569c7dc1fba3534e78e426d58896e750d091aec4cc0498d7f5a26cf"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Matches.check_expr: MethodTooLong \u2014 check_expr runs 125 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 25 over it, 1.25\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/matches/mod.rs"},"region":{"startLine":1055}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2a7566eef6cecbcc6f01c9ef7a6a6b4e77f286e1eeaadd759d19d2d0338e9fc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DiagnosticsCollector.collect_impl: MethodTooLong \u2014 collect_impl runs 125 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 25 over it, 1.25\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir/src/diagnostics.rs"},"region":{"startLine":953}}}],"partialFingerprints":{"codehealthFindingId/v1":"abe33030e39b7b2c3b8ab91a14ca3c4dcfac013cd30efe126b842b3854823b74"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: bootstrap/configure.py: FileTooLong \u2014 624 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 124 over it, 1.25\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/configure.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bc0322f6afd513d3a12e9cbd729b84d9821d652821bee15832cddff89db5680"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/inlay_hints.rs: FileTooLong \u2014 624 significant 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 124 over it, 1.25\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/inlay_hints.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"71648e1ae2463d8cd8310ca60032c9616509524d06f1db377215679e0fb4db44"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: V0SymbolMangler: ClassTooLong \u2014 499 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 10 methods, 3 blocks, lines 230-1066. The bar is 400 significant lines; this is 99 over it, 1.25\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_symbol_mangling/src/v0.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"d97f4e6c2c84feff6f4226e70fd0d313787bacd1ce6898fb93d6b6f98b9cee4a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/jump_threading.rs: FileTooLong \u2014 623 significant 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 123 over it, 1.25\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/jump_threading.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c56c9b9b17fb0b2419e5ae258f30c7604a190621d59dec555d0ef9f63f9ed622"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mir/body.rs: FileTooLong \u2014 623 significant 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 123 over it, 1.25\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_public/src/mir/body.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5c6cfd2ee5641cd698e831d647b5f105d33226733bc97a080dd0b3ad1bfddd3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/sugg.rs: FileTooLong \u2014 623 significant 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 123 over it, 1.25\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_utils/src/sugg.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ab207d79f2626aed4a3f1158e1bf8ec9999cb88d6e4796154bb4fd35b2b0c83"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/item_scope.rs: FileTooLong \u2014 623 significant 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: ItemScope (4 blocks, 125-904). The bar is 500 significant lines; this is 123 over it, 1.25\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/tools/rust-analyzer/crates/hir-def/src/item_scope.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4212c95936b179d5bfcad624f69bc1c47aad66d7b5742abe86d22689d5970bed"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 622 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 122 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/tools/rust-analyzer/crates/ide-diagnostics/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cb7f39764e65665bcf126b76cdc0396c3088d59b4f6b1387e25f6a1dbe30fbd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/common.rs: FileTooLong \u2014 621 significant 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 121 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/tools/compiletest/src/common.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f949203966b56da68316e0717f3d186da38b50aca2227f600f99f03a4f0f4031"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: attributes/doc.rs: FileTooLong \u2014 620 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 73% of them inside a single declaration: DocParser (3 blocks, 256-982). The bar is 500 significant lines; this is 120 over it, 1.24\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_attr_parsing/src/attributes/doc.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a678033ea86e8fa9e5688ad85e9af9ad03a808b5f52c8b59c3ecd1289ba5e60c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 620 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 86% of them inside a single declaration: Parser (3 blocks, 201-1035). The bar is 500 significant lines; this is 120 over it, 1.24\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse_format/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb728dac864d102bf3f8a56042ef0399cb9847a7961526e7ca922bc01bbef49d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: InterpCx.cast: MethodTooLong \u2014 cast 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":"compiler/rustc_const_eval/src/interpret/cast.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"99d3e80e20ad53f1fbf21e6809e7467ecb2815b7a93b4eeacd86d6b0ca270138"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustc_hir_analysis::collect::clauses_of::gather_explicit_clauses_of: FunctionTooLong \u2014 rustc_hir_analysis::collect::clauses_of::gather_explicit_clauses_of 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":"compiler/rustc_hir_analysis/src/collect/clauses_of.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"19c10a962e3fee8021a637f0457f6b59d6ece71baf29b22dd953791189e8d306"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustdoc::clean::clean_middle_assoc_item: FunctionTooLong \u2014 rustdoc::clean::clean_middle_assoc_item 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/librustdoc/clean/mod.rs"},"region":{"startLine":1386}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a48f7b5bc7cc730914c67bb826186630ee5b567513075e40175de28accfc46d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustdoc::html::render::render_call_locations: FunctionTooLong \u2014 rustdoc::html::render::render_call_locations 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/librustdoc/html/render/mod.rs"},"region":{"startLine":2783}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0e9908b6369ed43487c923369866bfeb06b9e6d8f166e390bf6928de1d3d942"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SerializedSearchIndex.write_to: MethodTooLong \u2014 write_to 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/librustdoc/html/render/search_index.rs"},"region":{"startLine":763}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c1c84d6c274767ece95cb7f90418ea9dd8c4afe7fc5748d24942675033ac748"}},{"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/tools/miri/src/intrinsics/x86/sse2.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"6908ebca5852f5efb62a8e067b0fd10dbf26f55e84be6568d4a434822d0047fd"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ScriptSource.parse: MethodTooLong \u2014 parse 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/tools/rust-analyzer/crates/parser/src/frontmatter.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd951d733ccadfa2649a58adc84a9e7f0547481f7c96ddd51430286a335936f5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: diagnostics/explain_borrow.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":"compiler/rustc_borrowck/src/diagnostics/explain_borrow.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1aa6c565c1c10b1dae1d5ac70ce5602c93853976cdce4ea60b682505667198f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: thread/unix.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":"library/std/src/sys/thread/unix.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"66932064635318a5b83ce90c25c7fb2afe961b90c9ee6794c0a640e5c4549dd2"}},{"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/tools/miri/src/shims/unix/sync.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d492f3e8676bd808bb616ec4b4346b343d273be2ca9ec24cba7a24e0b541f39c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.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/tools/rust-analyzer/lib/smol_str/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"435260f5ec88e7820dfaaff4803a614b113554e8736eaf7c8ff1c80edf33c7f8"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Dereferencing: ClassTooLong \u2014 494 significant 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, 3 blocks, lines 154-1303. The bar is 400 significant lines; this is 94 over it, 1.24\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/tools/clippy/clippy_lints/src/dereference.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"2223cec59f988fa76c30ed4acff2c003ac44dedf3bb2f64e07e52040ddac1685"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/value_analysis.rs: FileTooLong \u2014 617 significant 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 117 over it, 1.23\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_dataflow/src/value_analysis.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"88c3c197d2b4b40eb3831069febad9711fc18e17f45013092b3c23f7692b3895"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: BinaryHeap: TooManyMethods \u2014 37 methods. The bar is 30 methods; this is 7 over it, 1.23\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/alloc/src/collections/binary_heap/mod.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcc1d26d643a6cce49bfca1fa385aaec055106deae339063551290f194bb434e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: LinkedList: TooManyMethods \u2014 37 methods. The bar is 30 methods; this is 7 over it, 1.23\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/alloc/src/collections/linked_list.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0676af5f444acd30a06b1150bb2570f0459e63b4b5e555f76f4387934d3b1cf"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: UdpSocket: TooManyMethods \u2014 37 methods. The bar is 30 methods; this is 7 over it, 1.23\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/net/connection/motor.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"71cd3da5fd5661ec3fb386d852096529bad641ac71dfa67ecc0bdf6520646a14"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: UdpSocket: TooManyMethods \u2014 37 methods. The bar is 30 methods; this is 7 over it, 1.23\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/net/connection/socket/mod.rs"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"44ca70967d891874844ba9a278fca14dcb4393bcf74b41488aa063adc853128d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: UdpSocket: TooManyMethods \u2014 37 methods. The bar is 30 methods; this is 7 over it, 1.23\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/net/connection/wasip1.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"35dc6b7642d1f6285c261c8569607e238c6e70b6b1a653275cf7f4fb44860d7f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: bootstrap::utils::helpers: TooManyFunctions \u2014 37 free functions. The bar is 30 free functions; this is 7 over it, 1.23\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/utils/helpers.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"606cfd1de3b259840d7f8bc7b31d10049d8526ddf3e8075141825ac09bcf54e7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/types.rs: FileTooLong \u2014 616 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 116 over it, 1.23\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_config/src/types.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e45829058ca9f5f4d688d504dd762029919142fc46b1b0ee250c80c8b94a8780"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/input.rs: FileTooLong \u2014 616 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 116 over it, 1.23\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/base-db/src/input.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"333773b3853dcad949326213d89db8120e1e286cd44d7005a914e1323b611dfb"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: WritebackCx: ClassTooLong \u2014 492 significant 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 100-899. The bar is 400 significant lines; this is 92 over it, 1.23\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/writeback.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"9000b00b59d636cd83dc02d0363e1b612c1a7d60af15ece9fb16aa20e79b3452"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: LayoutCalculator: ClassTooLong \u2014 492 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 11 methods, 2 blocks, lines 173-967. The bar is 400 significant lines; this is 92 over it, 1.23\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_abi/src/layout.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"77b83b21cf7c5ffc5cf77cb99573ff44ffa85ba45c299b7222af17ad51794449"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/layout.rs: FileTooLong \u2014 615 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 80% of them inside a single declaration: LayoutCalculator (2 blocks, 173-967). The bar is 500 significant lines; this is 115 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":"compiler/rustc_abi/src/layout.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a105f52522164926d60d902b8c35683126c4afdb3c04196cd037215df14e3a07"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: check/intrinsic.rs: FileTooLong \u2014 615 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 115 over it, 1.23\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/check/intrinsic.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0483f5db1f9ec21037edfbb7c7aee5d98638cbb5b3b2bd80e1ded192275d5404"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FnAbi.apply_attrs_llfn: MethodTooLong \u2014 apply_attrs_llfn runs 123 significant 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 23 over it, 1.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":"compiler/rustc_codegen_llvm/src/abi.rs"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eb00e137d4016337488d8e3a03e68cee44eac69bc718cca70b2ba5ea61b9bd9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustc_hir_analysis::check::compare_impl_item::compare_number_of_method_arguments: FunctionTooLong \u2014 rustc_hir_analysis::check::compare_impl_item::compare_number_of_method_arguments runs 123 significant 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 23 over it, 1.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":"compiler/rustc_hir_analysis/src/check/compare_impl_item.rs"},"region":{"startLine":1779}}}],"partialFingerprints":{"codehealthFindingId/v1":"d886e6e26d76f49a21cdcf2c345ad819541717bf1f01849efa0489f57b3357e6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustc_incremental::persist::fs::garbage_collect_session_directories: FunctionTooLong \u2014 rustc_incremental::persist::fs::garbage_collect_session_directories runs 123 significant 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 23 over it, 1.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":"compiler/rustc_incremental/src/persist/fs.rs"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"55ee2473fd34e1ce28741346a3941727b0ae163b0565f11290347e1d20e76c8b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Ty.ty_and_layout_field: MethodTooLong \u2014 ty_and_layout_field runs 123 significant 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 23 over it, 1.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":"compiler/rustc_middle/src/ty/layout.rs"},"region":{"startLine":852}}}],"partialFingerprints":{"codehealthFindingId/v1":"95c6459265709d830f8e2a7c52838fca5e6fa481cd9b6291506a040d87a4c365"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Builder.break_const_continuable_scope: MethodTooLong \u2014 break_const_continuable_scope runs 123 significant 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 23 over it, 1.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":"compiler/rustc_mir_build/src/builder/scope.rs"},"region":{"startLine":869}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dc9580752df4bac9eeac2b9ae7de93f11a5cc5a47e1a8b9affc41bea6f17892"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CfgChecker.visit_terminator: MethodTooLong \u2014 visit_terminator runs 123 significant 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 23 over it, 1.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":"compiler/rustc_mir_transform/src/validate.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4b2371f6189102cb290ec4aabb9694b3f963dee571d134ba99512c267158aad"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NormalizesTo.consider_impl_candidate: MethodTooLong \u2014 consider_impl_candidate runs 123 significant 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 23 over it, 1.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":"compiler/rustc_next_trait_solver/src/solve/normalizes_to.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"b70c87794d1cc8a6f1a193f8951a2567a88da189a26b0ac4f7076903fdd3652e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: std::sys::thread::unix::available_parallelism: FunctionTooLong \u2014 std::sys::thread::unix::available_parallelism runs 123 significant 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 23 over it, 1.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":"library/std/src/sys/thread/unix.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"da370d7373cba9a100b6f9a608d1caac9ec977e8d9cf2542208a405956ebbba6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: hir_expand::eager::eager_macro_recur: FunctionTooLong \u2014 hir_expand::eager::eager_macro_recur runs 123 significant 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 23 over it, 1.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/tools/rust-analyzer/crates/hir-expand/src/eager.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"13626c973339fcdab801764f902a97108371b9cea7a8e9fe42f7b4e99f29d1dc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Expander.expand: MethodTooLong \u2014 expand runs 123 significant 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 23 over it, 1.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/tools/rust-analyzer/crates/load-cargo/src/lib.rs"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f66281f714ec58e50f0044a687bdaa7b65888105cc267f0763cabc0524a8c6f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: render/sidebar.rs: FileTooLong \u2014 614 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 114 over it, 1.23\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/render/sidebar.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"930bfc82dd11c0388ee133a9921f02f2f2b6a74c23a0999696d5588fcd36dde8"}},{"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/tools/miri/src/shims/foreign_items.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"937da237df700fcaed45ad59ba7e4547d9ec35d90cf34dccffcb4d5de22ebfa2"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PrintVisitor: ClassTooLong \u2014 491 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 19 methods, 2 blocks, lines 215-874. The bar is 400 significant lines; this is 91 over it, 1.23\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/utils/author.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"1be07bc3a30294cfd5511bccd69376ebdbffb569579539f3dc67adf84cd62d17"}},{"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/tools/miri/src/concurrency/thread.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e84bc5ab6dba6bee73451b1629bedd34f95df38b51a6fe902904a03e5679f2d"}},{"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/tools/miri/src/diagnostics.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbf5efc38e6e3187e2fed522a19a8369e9e0896bf21788b40a5484d44635b23c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: proc_macro::quote::quote: FunctionTooLong \u2014 proc_macro::quote::quote runs 122 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 22 over it, 1.22\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/proc_macro/src/quote.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c131ab69ad37a8706cc08ba989be7622ac5f7e7dd82a7c206bf19882dd267e8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: clippy_lints::casts::unnecessary_cast::check: FunctionTooLong \u2014 clippy_lints::casts::unnecessary_cast::check runs 122 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 22 over it, 1.22\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/casts/unnecessary_cast.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c8ad3c42306653c7b48b8211806a84e974de648a84bc91f87d0f5033cfa9af3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: process/uefi.rs: FileTooLong \u2014 608 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 108 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":"library/std/src/sys/process/uefi.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7face5217f3db351b7ad447c5bec255005ca41a57d34b1a8dd138a843baa203f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: back/symbol_export.rs: FileTooLong \u2014 606 significant 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 106 over it, 1.21\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":"compiler/rustc_codegen_ssa/src/back/symbol_export.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6181a4f95bec44a8acf9403fd49a987679121f281ade3362ddddaff839b50d50"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: doc/mod.rs: FileTooLong \u2014 606 significant 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 106 over it, 1.21\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/tools/clippy/clippy_lints/src/doc/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"60efcf911dbd62a1e058d27e81f5d58f85b6218f0b2755c51fce54e3526ae9d5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: expander/matcher.rs: FileTooLong \u2014 606 significant 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 106 over it, 1.21\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/tools/rust-analyzer/crates/mbe/src/expander/matcher.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac644c29960b2f1b7a93855a758b4bca4b0ffb025f90f7379077f6b3b5d927b2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SccsConstruction.walk_unvisited_node: MethodTooLong \u2014 walk_unvisited_node runs 121 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 21 over it, 1.21\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_data_structures/src/graph/scc/mod.rs"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"444355e3642de973680f8266404b64fcac78e02a44b8efac5bc2d40783fbf85c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustc_hir_analysis::check::wfcheck::check_where_clauses: FunctionTooLong \u2014 rustc_hir_analysis::check::wfcheck::check_where_clauses runs 121 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 21 over it, 1.21\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/check/wfcheck.rs"},"region":{"startLine":1447}}}],"partialFingerprints":{"codehealthFindingId/v1":"689e06bb467e8e66c61e2a1d977aec812e4d90d63b968a6fa55f831456d6288e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustc_interface::passes::write_out_deps: FunctionTooLong \u2014 rustc_interface::passes::write_out_deps runs 121 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 21 over it, 1.21\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_interface/src/passes.rs"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0c3984ff1f7e0dc636a5958d2af74f188b448aeb35fa618101cc046a68fb99f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SelectionContext.confirm_builtin_unsize_candidate: MethodTooLong \u2014 confirm_builtin_unsize_candidate runs 121 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 21 over it, 1.21\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/traits/select/confirmation.rs"},"region":{"startLine":983}}}],"partialFingerprints":{"codehealthFindingId/v1":"a68744b7a490e9f68899e208b970c300ce65e3622b5554e91c3ee80bef6403fa"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Ctx.transform_path_: MethodTooLong \u2014 transform_path_ runs 121 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 21 over it, 1.21\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-db/src/path_transform.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d92fe77f867f2c863c6a21ae9c29be9e96b8b93b37ccd543c1094ddc21b76fa"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rust_analyzer::handlers::request::run_rustfmt: FunctionTooLong \u2014 rust_analyzer::handlers::request::run_rustfmt runs 121 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 21 over it, 1.21\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/handlers/request.rs"},"region":{"startLine":2405}}}],"partialFingerprints":{"codehealthFindingId/v1":"43d7cad7d8230f198a01589be7fda573620e8eaaa7d1424dff8d74626d280ebb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustfmt_nightly::macros::rewrite_macro_inner: FunctionTooLong \u2014 rustfmt_nightly::macros::rewrite_macro_inner runs 121 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 21 over it, 1.21\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/macros.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"51dc3ea1545e29d61ca20f584e170221ade43fb801b247fad8e7b6132f46082f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: StatCollector: ClassTooLong \u2014 483 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 4 methods, 4 blocks, lines 57-803. The bar is 400 significant lines; this is 83 over it, 1.21\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":"compiler/rustc_passes/src/input_stats.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"4571fe3e158c9f7609752f031632f156315bd618b173bc1b63a20333f58d9a9f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: query/on_disk_cache.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). The bar is 500 significant lines; this is 103 over it, 1.21\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":"compiler/rustc_middle/src/query/on_disk_cache.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f084f8f9ad2d0f2add8de7433d7b7c24edc986ac9e403661b5ba654d9ea9513"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: expr/into.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 97% of them inside a single declaration: Builder (22-949). 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":"compiler/rustc_mir_build/src/builder/expr/into.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6af82e8bb240e87634350fbdc09e3d4d8028cc14bafcfbabc9c7b0e43a58abcd"}},{"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/tools/miri/src/helpers.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c560229647de2d7d72b9b485b6f6e54869c5bf2ff665b500ea270e9f66e6ba1e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/promote_consts.rs: FileTooLong \u2014 602 significant 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 102 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":"compiler/rustc_mir_transform/src/promote_consts.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d3c8bbf49eec1347079ce30b4a9ee5d7ccdda591f95ce4c9a9ab89ca8c9660c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 601 significant 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: Analysis (2 blocks, 244-978). The bar is 500 significant lines; this is 101 over it, 1.20\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/tools/rust-analyzer/crates/ide/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eaf3d8f6bd3bc0a0d5f46bfcb54fb0a67deaec37cc73b896412869d94304cdf"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: WrongNumberOfGenericArgs: TooManyMethods \u2014 36 methods. The bar is 30 methods; this is 6 over it, 1.20\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/diagnostics/wrong_number_of_generic_args.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"1638e13657792813de69af7bc6995a3658653bf6b2e321fc8164b5569fd49277"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: File: TooManyMethods \u2014 36 methods. The bar is 30 methods; this is 6 over it, 1.20\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/fs/windows.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6a5b73ed3038dda1ca62b08b1bdc215c13372f9ce82dee9d665f8d65169c60b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: UdpSocket: TooManyMethods \u2014 36 methods. The bar is 30 methods; this is 6 over it, 1.20\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/net/connection/xous/udp.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"22725237834127c2b54d1b2a6be272ec676b5ab45182b2b6960edb3cf70e828a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Completions: TooManyMethods \u2014 36 methods. The bar is 30 methods; this is 6 over it, 1.20\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-completion/src/completions.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b80cc6a752a3bbd9e95670b38b304e47e7b983a8536b40cfc62d0b81e8a49de"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/global_state.rs: FileTooLong \u2014 600 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 69% of them inside a single declaration: GlobalState (3 blocks, 84-821). The bar is 500 significant lines; this is 100 over it, 1.20\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/tools/rust-analyzer/crates/rust-analyzer/src/global_state.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eca0d647908a3a78161affcff95f6dffb4ac0f88641609573ed2903d9872fe09"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LoweringContext.lower_fn_decl: MethodTooLong \u2014 lower_fn_decl runs 120 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 20 over it, 1.20\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ast_lowering/src/lib.rs"},"region":{"startLine":1935}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c849f7504436006a8173ae34d21edfe8bc5da9bc794f7ff52fef6f0dc8d4541"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustc_codegen_ssa::back::symbol_export::exported_generic_symbols_provider_local: FunctionTooLong \u2014 rustc_codegen_ssa::back::symbol_export::exported_generic_symbols_provider_local runs 120 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 20 over it, 1.20\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/back/symbol_export.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a9546f34f863891934ffea6cdf7cf0f4625fa10de80a8f5aa87b3befc94bd9c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ImproperCTypesVisitor.visit_type: MethodTooLong \u2014 visit_type runs 120 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 20 over it, 1.20\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_lint/src/types/improper_ctypes.rs"},"region":{"startLine":784}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f3f9e0db0494ecbde02f91aacb6e4c6cc4172d6cea723efe05c02ba7eee437e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustc_middle::thir::visit::walk_expr: FunctionTooLong \u2014 rustc_middle::thir::visit::walk_expr runs 120 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 20 over it, 1.20\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/thir/visit.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"0be80bfa7fadf165f7a8d0f4dd846f518c81cfd3ee12c6750bdf38d9c5cd4ce0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: utils/author.rs: FileTooLong \u2014 599 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 82% of them inside a single declaration: PrintVisitor (2 blocks, 215-874). The bar is 500 significant lines; this is 99 over it, 1.20\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/tools/clippy/clippy_lints/src/utils/author.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e068411ef949179e836cf4c33cd18b2c0137b35a52dd9bdf2dd74cacce8908c1"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: MarkSymbolVisitor: ClassTooLong \u2014 479 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 21 methods, 3 blocks, lines 172-966. The bar is 400 significant lines; this is 79 over it, 1.20\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_passes/src/dead.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f805f2e43f30619a0330f47257530faf2c6663d674e7610fa2e367267dd69cc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: clean/inline.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/librustdoc/clean/inline.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"607f7bc0fa1f331636d0602deb8020b1597275c289d5fe3509c54d0b61a4e9d9"}},{"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/tools/miri/src/borrow_tracker/tree_borrows/tree.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"87bab903b15d4f3ca5ee245899bd049ca7bf6c0c87edf1cbf25f18ac6e0364a5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: traits/ambiguity.rs: FileTooLong \u2014 597 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 80% of them inside a single declaration: TypeErrCtxt (176-918). The bar is 500 significant lines; this is 97 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":"compiler/rustc_trait_selection/src/error_reporting/traits/ambiguity.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"64064918e750e1436733b448200dee366ff4121decba72be17c963edf476d731"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: math/exp2m1.rs: FileTooLong \u2014 597 significant 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 97 over it, 1.19\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/compiler-builtins/libm/src/math/exp2m1.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ee9c66834a39a0eeefe5273dca4d9b9535dc2271efab9a239c692596005908c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: socket/mod.rs: FileTooLong \u2014 597 significant 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 97 over it, 1.19\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/net/connection/socket/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"004226bd979148ce63b67ade9b70f15de10cb2dba7f37a6f4260865cbc2f28da"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: builtin/coerce_shared.rs: FileTooLong \u2014 596 significant 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 96 over it, 1.19\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/coherence/builtin/coerce_shared.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"17f203c34454a56ab245461f0bb7b3dc78bedcf051aa1f5a51e6abe2b84c9079"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/thir.rs: FileTooLong \u2014 596 significant 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 96 over it, 1.19\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/thir.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"199170eb866c9391a08c82db5d2901acf76a336e8953af959fa937c84fcedd77"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: convert/internal.rs: FileTooLong \u2014 596 significant 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 96 over it, 1.19\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_public/src/unstable/convert/internal.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"df912fef444dcd2603c5526ea98de1faa0f452e013187af83474a05cf8db58b3"}},{"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/tools/miri/src/shims/unix/tcp_socket.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"400a6660918c6fa262d5946cf0e88ce28b8b84eb3bc8e12a2ccf12cd9ae66ee9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/levels.rs: FileTooLong \u2014 595 significant 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 68% of them inside a single declaration: LintLevelsBuilder (5 blocks, 292-997). The bar is 500 significant lines; this is 95 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":"compiler/rustc_lint/src/levels.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a5eb7254a7128af77c1fa83e26f3666410a3e089dffb482060d7e39d4c18e82"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustc_codegen_ssa::back::link::link_binary: FunctionTooLong \u2014 rustc_codegen_ssa::back::link::link_binary runs 119 significant 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 19 over it, 1.19\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":"compiler/rustc_codegen_ssa/src/back/link.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"05a98ffc539d0c5abadf2799100e927f22688a9de974b703142af84eeef54dca"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Checker.visit_terminator: MethodTooLong \u2014 visit_terminator runs 119 significant 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 19 over it, 1.19\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":"compiler/rustc_const_eval/src/check_consts/check.rs"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad692e86784258ea9382d69dd834fad3e3dbb84bd9925914f8a5fba9aa7d9c20"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ValidityVisitor.visit_value: MethodTooLong \u2014 visit_value runs 119 significant 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 19 over it, 1.19\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":"compiler/rustc_const_eval/src/interpret/validity.rs"},"region":{"startLine":1363}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9540372496b6ad907deb2d0881e34e2f29b8565b4c39e50eb397c1629b7a706"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: State.print_pat: MethodTooLong \u2014 print_pat runs 119 significant 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 19 over it, 1.19\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":"compiler/rustc_hir_pretty/src/lib.rs"},"region":{"startLine":2029}}}],"partialFingerprints":{"codehealthFindingId/v1":"28561b93784ee03ec852c7a57615df53c358d5060c6ba42fed966e1bf56c0955"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FnCtxt.report_invalid_callee: MethodTooLong \u2014 report_invalid_callee runs 119 significant 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 19 over it, 1.19\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":"compiler/rustc_hir_typeck/src/callee.rs"},"region":{"startLine":927}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cd9b862762d74e97873a9062ab3cd1301c50e88f9681fae7eb2a6723397e5a4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AutoTraitFinder.evaluate_nested_obligations: MethodTooLong \u2014 evaluate_nested_obligations runs 119 significant 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 19 over it, 1.19\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":"compiler/rustc_trait_selection/src/traits/auto_trait.rs"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab0efd0f8265e1c4aa1ca4c5adba0f2a5588a56aa7adf878a0ccc9ab1c7d2961"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Evaluator.allocate_valtree_in_heap: MethodTooLong \u2014 allocate_valtree_in_heap runs 119 significant 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 19 over it, 1.19\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/tools/rust-analyzer/crates/hir-ty/src/mir/eval.rs"},"region":{"startLine":1809}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f6481a97ac4d26ee2b9ce9cec3fbb3fda5e71a77e18378bc2fb10eeb8ddf498"}},{"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":"src/tools/miri/priroda/src/frontend/dap.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"34ee823fcd46540712f33b24f67187b3ae2f21f028896cfdfc0accf0f7c6cbf8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/mir.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). The bar is 500 significant lines; this is 93 over it, 1.19\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/mir.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f48865f9358f065f4914a67ba095bad302ebfa1b9c10f323a841cd475c730b1"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ItemScope: ClassTooLong \u2014 474 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 55 methods, 4 blocks, lines 125-904. The bar is 400 significant lines; this is 74 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/tools/rust-analyzer/crates/hir-def/src/item_scope.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1fefdeb2fb706de53f5c904d8075f2c6ffc065aae1cd7e96df2542f0e9fae62"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: hir_ty_lowering/bounds.rs: FileTooLong \u2014 592 significant 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 92 over it, 1.18\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":"compiler/rustc_hir_analysis/src/hir_ty_lowering/bounds.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7e9e611e70b0ac0cd568d07ac27790f4795b1a62f85b846499f0c5982b16d88"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: next_solver/predicate.rs: FileTooLong \u2014 592 significant 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 92 over it, 1.18\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/tools/rust-analyzer/crates/hir-ty/src/next_solver/predicate.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9abdb1e0be55fd1411e1776cb568a46f3d07dbaa51e478164e9cba58ff5a97a4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: binary_heap/mod.rs: FileTooLong \u2014 591 significant 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 91 over it, 1.18\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":"library/alloc/src/collections/binary_heap/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"68857804166b03dbd520ef9e000c42f002219290dc828a0a92fc66484ca41790"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Cursor: ClassTooLong \u2014 472 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 33 methods, 2 blocks, lines 424-1291. The bar is 400 significant lines; this is 72 over it, 1.18\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_lexer/src/lib.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"df85eded863909f7c1120e9692afa430f684624ca8fda7637515de2260a2c762"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypeChecker.visit_terminator: MethodTooLong \u2014 visit_terminator runs 118 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 18 over it, 1.18\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/type_check/mod.rs"},"region":{"startLine":739}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1009e6e900a0ed0ae86d0a41cc1cececd4a681130c50992545f5a55aa1f2ac5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustdoc::html::format::fmt_type: FunctionTooLong \u2014 rustdoc::html::format::fmt_type runs 118 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 18 over it, 1.18\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/format.rs"},"region":{"startLine":1116}}}],"partialFingerprints":{"codehealthFindingId/v1":"27e794aff25eed75289389a7ff4588c94d7275099c8a55ab28229ac95b605040"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: project_model::workspace::project_json_to_crate_graph: FunctionTooLong \u2014 project_model::workspace::project_json_to_crate_graph runs 118 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 18 over it, 1.18\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/project-model/src/workspace.rs"},"region":{"startLine":1107}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f91fc00df7a9fd205f35940fe78e38494889dc595eba21b2fcb025ce7704288"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 589 significant 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 89 over it, 1.18\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/tools/rustfmt/check_diff/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a48882451f87a27d5d5111d43b2c731e08d52d239f3bf7f0db36b86edb3440f8"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: MatchVisitor: ClassTooLong \u2014 471 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 15 methods, 3 blocks, lines 85-757. The bar is 400 significant lines; this is 71 over it, 1.18\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_build/src/thir/pattern/check_match.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"e05e4c3be4e166227bd644a1b987fab4b7f532068bbc01a076b93ab3ba9ecceb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/closure.rs: FileTooLong \u2014 588 significant 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 95% of them inside a single declaration: FnCtxt (46-1097). The bar is 500 significant lines; this is 88 over it, 1.18\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":"compiler/rustc_hir_typeck/src/closure.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1f298c70591b76a6eeb0bf0cfd1c62d7915ffe8dfce13a6d00d7d8b9d3d7245"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: utils/exec.rs: FileTooLong \u2014 588 significant 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 88 over it, 1.18\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/bootstrap/src/utils/exec.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fc952c2455e68ba9fcea9ad4d3df3bc199d1d1e12def607cfb1ce62e7720136"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/utils.rs: FileTooLong \u2014 587 significant 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 87 over it, 1.17\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/tools/clippy/clippy_dev/src/utils.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fd316d31bb29f0b4ce43dc0809b1321ff30e21656a92641e8006329be20bea6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mbe/transcribe.rs: FileTooLong \u2014 586 significant 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 86 over it, 1.17\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":"compiler/rustc_expand/src/mbe/transcribe.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4702586b48b4161c36f8c282f6032a227fd1c06be66f5a035580523b9baccc9d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 586 significant 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 86 over it, 1.17\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":"compiler/rustc_lint/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c37e6cbdae3df2d9430ed0d49727a9a40795485e3443f19e9c7d91de1075858"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/known_panics_lint.rs: FileTooLong \u2014 586 significant 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 72% of them inside a single declaration: ConstPropagator (7 blocks, 67-851). The bar is 500 significant lines; this is 86 over it, 1.17\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":"compiler/rustc_mir_transform/src/known_panics_lint.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec59dfb8e87b6cf3c535cc9fae7a20a0516a587f9cc766e6cdcab70ca66e5dc0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: x86_64/amx.rs: FileTooLong \u2014 586 significant 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 57 free functions. The bar is 500 significant lines; this is 86 over it, 1.17\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":"library/stdarch/crates/core_arch/src/x86_64/amx.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5cff4da20245b146f6efa0bc9042efc72c16b26657e9662b36a37e9b14a424d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/method_resolution.rs: FileTooLong \u2014 586 significant 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 86 over it, 1.17\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/tools/rust-analyzer/crates/hir-ty/src/method_resolution.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb652d02f364412dfca8c337edd2eb5dda69e82ee7bbb9c5c16b2d52e7f454dd"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: InlineAssemblyGenerator.generate_asm_wrapper: MethodTooLong \u2014 generate_asm_wrapper 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":"compiler/rustc_codegen_cranelift/src/inline_asm.rs"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"c36ea3a99c328faf0d0f64098d9c9bba2b8d368ee4aa15aec4cbadd3821b7cde"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TerminatorCodegenHelper.do_call: MethodTooLong \u2014 do_call 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":"compiler/rustc_codegen_ssa/src/mir/block.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"8481546f80c472f7f3cdaf27879e44142f1cbabfe2a9a7ace9f584dc7bc7fc7f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FunctionCx.codegen_terminator: MethodTooLong \u2014 codegen_terminator 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":"compiler/rustc_codegen_ssa/src/mir/block.rs"},"region":{"startLine":1657}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf77cd151c8b8a3a4db333618cabc148ee456860e1feb8446d43ccc9623b8cca"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustc_hir_analysis::check::compare_impl_item::compare_method_clause_entailment: FunctionTooLong \u2014 rustc_hir_analysis::check::compare_impl_item::compare_method_clause_entailment 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":"compiler/rustc_hir_analysis/src/check/compare_impl_item.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"767b8e303db88fe5f2f68b1d9e3af619c71d12f997a32279e48eceaabeb4e091"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustc_hir_analysis::coherence::orphan::orphan_check_impl: FunctionTooLong \u2014 rustc_hir_analysis::coherence::orphan::orphan_check_impl 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":"compiler/rustc_hir_analysis/src/coherence/orphan.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"88a18056c39b285a6fa4740eb28a26a59fe687cb498f3d5602464027106328ff"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustc_hir_analysis::hir_ty_lowering::generics::lower_generic_args: FunctionTooLong \u2014 rustc_hir_analysis::hir_ty_lowering::generics::lower_generic_args 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":"compiler/rustc_hir_analysis/src/hir_ty_lowering/generics.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"806d93090aed77da45660cd610b6b1da9da171e903b8d1cdc27ea985586f2cba"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CStore.report_target_modifiers_extended: MethodTooLong \u2014 report_target_modifiers_extended 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":"compiler/rustc_metadata/src/creader.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dc4bd131982c17ccc73db496fd60257f58975904599bcd8c00e07ff127cb38b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LateResolutionVisitor.suggest_using_enum_variant: MethodTooLong \u2014 suggest_using_enum_variant 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":"compiler/rustc_resolve/src/late/diagnostics.rs"},"region":{"startLine":3603}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc359c562cfae7b0f346d0db5f99e8c19a786250f7f2518b529f88535555ec69"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: clippy_lints::loops::needless_range_loop::check: FunctionTooLong \u2014 clippy_lints::loops::needless_range_loop::check 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":"src/tools/clippy/clippy_lints/src/loops/needless_range_loop.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"11c5fe58b40bc07e0f768468667c827902ec5a0df3653c633aeade71f609dd7c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: clippy_lints::operators::op_ref::check: FunctionTooLong \u2014 clippy_lints::operators::op_ref::check 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":"src/tools/clippy/clippy_lints/src/operators/op_ref.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a59c4ae04e4be801db42864a9084db9e9e5b728cb555b9bb18d755af06535fd"}},{"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":"src/tools/miri/cargo-miri/src/phases.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4a24365e76a806e903e330418bf403cbed20fd37294b457d320a3814bfc658e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: hir_def::attrs::match_attr_flags: FunctionTooLong \u2014 hir_def::attrs::match_attr_flags 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":"src/tools/rust-analyzer/crates/hir-def/src/attrs.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"92652241f51c4765c891e3b3ddbcb3bd5e3dd13aa1fd8caa0105ad7cb5ffacbc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: InferenceContext.check_call_arguments: MethodTooLong \u2014 check_call_arguments 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":"src/tools/rust-analyzer/crates/hir-ty/src/infer/expr.rs"},"region":{"startLine":1920}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b72cfce1745008c36c5b7036aa92b8d740f91b4e9eb54954869a86f7843ba52"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FindUsages.search: MethodTooLong \u2014 search 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":"src/tools/rust-analyzer/crates/ide-db/src/search.rs"},"region":{"startLine":929}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d37b746731f7a2aa5415d01de31eac240ca6672814614433807f2608f3fda13"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ide::file_structure::structure_node: FunctionTooLong \u2014 ide::file_structure::structure_node 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":"src/tools/rust-analyzer/crates/ide/src/file_structure.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"4069278b655d039922853978cb25a19414b1c0a30d6ed8c95bafc154288f67e6"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Binder: TooManyMethods \u2014 35 methods, declared across 3 files: src/binder.rs (14), src/ty_kind.rs (12), src/predicate.rs (9). The bar is 30 methods; this is 5 over it, 1.17\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_type_ir/src/binder.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"a307f6e8bca407e7549422b7897fb0f50902928aced5d4b59f9d9b5a30f7d7d8"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Formatter: TooManyMethods \u2014 35 methods. The bar is 30 methods; this is 5 over it, 1.17\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/fmt/mod.rs"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"6acd5d35c403d9070edc5d2bd1ec27352f9ab444d56a5ece148db3e119c70731"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: UdpSocket: TooManyMethods \u2014 35 methods. The bar is 30 methods; this is 5 over it, 1.17\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/net/udp.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d03a71feb9008c86246eb61023da7a5fe24fb01a360cdddbe8504f1d71d9f88"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: UdpSocket: TooManyMethods \u2014 35 methods. The bar is 30 methods; this is 5 over it, 1.17\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/net/connection/sgx.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a5abd2434036a1179bc522a019a5da98222a5907a78bb6ac2c55b5619700023"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: UdpSocket: TooManyMethods \u2014 35 methods. The bar is 30 methods; this is 5 over it, 1.17\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/net/connection/uefi/mod.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2d6b3a041c158c00c462304a6f43622fdf55d7b76875cea5e5b8c88853674ea"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: UdpSocket: TooManyMethods \u2014 35 methods. The bar is 30 methods; this is 5 over it, 1.17\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/net/connection/unsupported.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccfae4b200f5c3a1c26bb042d87a8ad782a8e4a5ef677157031b7378e892892d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Semantics: TooManyMethods \u2014 35 methods. The bar is 30 methods; this is 5 over it, 1.17\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir/src/semantics.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"78a0e3cd53b7c3e66acf25fccb3b980ba1c82159dec14c3ddde701838262d571"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/undocumented_unsafe_blocks.rs: FileTooLong \u2014 581 significant 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 81 over it, 1.16\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/undocumented_unsafe_blocks.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"568ac170843c670ade05788b827e58852ad4dc9ed6cc695fbf70c104f2950c7f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LoweringContext.lower_path_segment: MethodTooLong \u2014 lower_path_segment 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":"compiler/rustc_ast_lowering/src/path.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac5563fa0a9876babd54c381a3fd0af2527935f581eb6e44c5ba06a9ce11c52c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MirBorrowckCtxt.consume_rvalue: MethodTooLong \u2014 consume_rvalue 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":"compiler/rustc_borrowck/src/lib.rs"},"region":{"startLine":1475}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bc1cef7ecefd079b400eaef68258500feb0ca7cae43910482c9503462c33847"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Lexer.cook_lexer_literal: MethodTooLong \u2014 cook_lexer_literal 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":"compiler/rustc_parse/src/lexer/mod.rs"},"region":{"startLine":820}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a286e39e1533c8a3697412ea81efc2493d3bfb8f9dec4c50dbcd6d31224e854"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: libm::math::jn::jn: FunctionTooLong \u2014 libm::math::jn::jn 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":"library/compiler-builtins/libm/src/math/jn.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"d54ce2101d8d38e28746686e8f620cf71b4850a7c38a71c808897113265650ae"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: libm::math::lgamma_r::lgamma_r: FunctionTooLong \u2014 libm::math::lgamma_r::lgamma_r 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":"library/compiler-builtins/libm/src/math/lgamma_r.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fd3af60719d3884c77026c5286f2fad19b8dd31dd23a0afe2ab631b8e03d23b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: libm::math::lgammaf_r::lgammaf_r: FunctionTooLong \u2014 libm::math::lgammaf_r::lgammaf_r 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":"library/compiler-builtins/libm/src/math/lgammaf_r.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7a6ac1a9670176879de9ada3ce6d84edcaf0f8bf088d215504c29c0577ed618"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SerializedSearchIndex.load: MethodTooLong \u2014 load 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/librustdoc/html/render/search_index.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"94afb022b09f5150c2815571925667b4d3f35948791a07114f6681b09277177b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Directive.check: MethodTooLong \u2014 check 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/tools/jsondocck/src/directive.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b83a1457210aac1185241acbe2d1df3b66f18c16ba9c93752d0315604ceb79d"}},{"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/tools/miri/src/borrow_tracker/tree_borrows/diagnostics.rs"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1d6f7f7bfc8556b1b27c5ada2096d1455f1ec8e2dad6917f74cba109b05462d"}},{"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/tools/miri/src/shims/windows/fs.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"07df996f3f450d1248406c9b14ac7e349e2f83c988e39f4bdb64024c10df9c6d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Resolver.resolve_path_in_value_ns_with_prefix_info: MethodTooLong \u2014 resolve_path_in_value_ns_with_prefix_info 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/tools/rust-analyzer/crates/hir-def/src/resolver.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3bc6fa2b6999726633f368d8eb979ee39b4f8453886238593ad23d4c607546d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: InferenceContext.check_record_expr_fields: MethodTooLong \u2014 check_record_expr_fields 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/tools/rust-analyzer/crates/hir-ty/src/infer/expr.rs"},"region":{"startLine":968}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad2a15bc3e1f5d418268701dbd6b412d947daedd2215998d04883edb31010e01"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Evaluator.exec_extern_c: MethodTooLong \u2014 exec_extern_c 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/tools/rust-analyzer/crates/hir-ty/src/mir/eval/shim.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7fc6189a5f00fafa16770078458e4b12b8db65943774a83a78e2a6ab2da59bf"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ide_assists::handlers::extract_function::extract_function: FunctionTooLong \u2014 ide_assists::handlers::extract_function::extract_function 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/tools/rust-analyzer/crates/ide-assists/src/handlers/extract_function.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ef4d04f85563379ef9b32592828fe26c5a3ce94a6ff0be3bdf247bd9724d164"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: process/windows.rs: FileTooLong \u2014 578 significant 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 78 over it, 1.16\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/process/windows.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1a409024944f2b053a2557e556650cc8521c87d492029fe98b78f32a6d1416f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/overflow.rs: FileTooLong \u2014 576 significant 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 76 over it, 1.15\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/overflow.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6023dea744968afff76657d247262aa1cbf33ad5da29451513322708f57ddc1e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lifetimes.rs: FileTooLong \u2014 575 significant 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 75 over it, 1.15\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/lifetimes.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d1285f68f3e9475ffe139f36c26e42d338e3407ac0fb8d8581de5b7b5b35e7c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: methods/needless_collect.rs: FileTooLong \u2014 575 significant 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 75 over it, 1.15\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/methods/needless_collect.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8107d6b7d83594375cff4f7cb3e0a5e0456ddcfefc2f9017c436f2c0dbcaf010"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustc_codegen_llvm::va_arg::emit_x86_64_sysv64_va_arg: FunctionTooLong \u2014 rustc_codegen_llvm::va_arg::emit_x86_64_sysv64_va_arg 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":"compiler/rustc_codegen_llvm/src/va_arg.rs"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d58aaa5446b9118baa81fcb5ae1e9ee97af8f051aacc2639e6dd5a7bf1bd96d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FunctionCx.codegen_rvalue: MethodTooLong \u2014 codegen_rvalue 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":"compiler/rustc_codegen_ssa/src/mir/rvalue.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"83991ecddc15cc076170550d871c1c86a96770ff115dec816624e3180fadd862"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DropCtxt.build_async_drop: MethodTooLong \u2014 build_async_drop 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":"compiler/rustc_mir_transform/src/elaborate_drop.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aa5bde3bceea7527ed42f6f966c17bdce7611f9bbb194d857995365b2232f26"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AssignmentResult.find_dead_assignments: MethodTooLong \u2014 find_dead_assignments 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":"compiler/rustc_mir_transform/src/liveness.rs"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"7435a654b645fdf14508d7ea94d9e3b588b306234c68c6eb455a51e712d2b257"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DefCollector.build_reduced_graph_for_item: MethodTooLong \u2014 build_reduced_graph_for_item 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":"compiler/rustc_resolve/src/build_reduced_graph.rs"},"region":{"startLine":826}}}],"partialFingerprints":{"codehealthFindingId/v1":"21ce26f4612eb02192fb0237f7b213abc6a4e69cf8c3fa2930748580109682fd"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LateResolutionVisitor.resolve_anonymous_lifetime: MethodTooLong \u2014 resolve_anonymous_lifetime 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":"compiler/rustc_resolve/src/late.rs"},"region":{"startLine":2037}}}],"partialFingerprints":{"codehealthFindingId/v1":"04549877c1dafd6c76aa3106ae9208c8a7057910b9ee7d4cdabb7c56751e90e5"}},{"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/tools/miri/src/shims/unix/fs.rs"},"region":{"startLine":1066}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cf0440eb6fff86913ff464d8f609e2e3e1818e60c9e7025b55e44703b88742f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CharClasses.next: MethodTooLong \u2014 next 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/tools/rustfmt/src/comment.rs"},"region":{"startLine":1394}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a5db6ae26b47b0b3c6731de9d6cab8d8ebee9dc41c1428e022f0d668e359e71"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: dep_graph/serialized.rs: FileTooLong \u2014 574 significant 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 74 over it, 1.15\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/dep_graph/serialized.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f592e02dc331c92032377561b1e9d2cc7443f6b0bb07f800240deb52099bc368"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: traits/dyn_compatibility.rs: FileTooLong \u2014 572 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 72 over it, 1.14\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/traits/dyn_compatibility.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"24c5ad3f8466204f61e0b5c9aabfde793aa1febb9ad6e690116da89ee0607f83"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: InferCtxt: ClassTooLong \u2014 456 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 111 methods, 2 blocks, lines 231-1279. The bar is 400 significant lines; this is 56 over it, 1.14\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/mod.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"104600c5991f4c7eadf012e2ef6550dd3cf45ddd7f3b667d905e79e30a91ff9f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/visitors.rs: FileTooLong \u2014 570 significant 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 70 over it, 1.14\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_utils/src/visitors.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb98fb42c4db7fc046b8e2f2a9aa1886d7b95fb514c21e38f5cf9f48f6baf562"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/completions.rs: FileTooLong \u2014 570 significant 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: Completions (2 blocks, 57-636). The bar is 500 significant lines; this is 70 over it, 1.14\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/tools/rust-analyzer/crates/ide-completion/src/completions.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbc3455cc257103c60108f7876027a85daf8a8b2ac9e763c9801e150b95fc930"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustc_hir_analysis::check::check::check_impl_items_against_trait: FunctionTooLong \u2014 rustc_hir_analysis::check::check::check_impl_items_against_trait runs 114 significant 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 14 over it, 1.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/check/check.rs"},"region":{"startLine":1300}}}],"partialFingerprints":{"codehealthFindingId/v1":"6994442220a43cd083f1d0d9655cf1f173777dd947e004b34d6a5f03dabea82a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TokenType.from_u32: MethodTooLong \u2014 from_u32 runs 114 significant 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 14 over it, 1.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/token_type.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"e56ef215b00fb4bd41e6540608590da70d03516fa5bea84fa197a07d4ec04629"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LateResolutionVisitor.suggest_assoc_type_from_bounds: MethodTooLong \u2014 suggest_assoc_type_from_bounds runs 114 significant 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 14 over it, 1.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/late/diagnostics.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"88ebc30418b22480b0582071295f38382488d9f849e023e902b54b62223cfba4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LateResolutionVisitor.smart_resolve_report_errors: MethodTooLong \u2014 smart_resolve_report_errors runs 114 significant 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 14 over it, 1.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/late/diagnostics.rs"},"region":{"startLine":671}}}],"partialFingerprints":{"codehealthFindingId/v1":"0118a8e0c4cfaa1be9baabaf0fd6d1885bfca7b0eb5eaef6c4443bef68bbc0fb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustc_ty_utils::abi::fn_sig_for_fn_abi: FunctionTooLong \u2014 rustc_ty_utils::abi::fn_sig_for_fn_abi runs 114 significant 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 14 over it, 1.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ty_utils/src/abi.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b7af5ee4bf67b9357ea01b4ca7a4b20465eef2821710b755aafb9dc9da45cb4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustc_type_ir::relate::structurally_relate_tys: FunctionTooLong \u2014 rustc_type_ir::relate::structurally_relate_tys runs 114 significant 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 14 over it, 1.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_type_ir/src/relate.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f9d5d0700da873c830c94acc2d8f4fbf7dd99523d7c73498f7184e1ba3aa232"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: std_detect::detect::os::windows::aarch64::detect_features: FunctionTooLong \u2014 std_detect::detect::os::windows::aarch64::detect_features runs 114 significant 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 14 over it, 1.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std_detect/src/detect/os/windows/aarch64.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7d4ccd4b61a9986e2289064b91dace19e4803cc6c43276cbec8981d0528b815"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: clippy_lints::matches::collapsible_match::check_arm: FunctionTooLong \u2014 clippy_lints::matches::collapsible_match::check_arm runs 114 significant 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 14 over it, 1.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/matches/collapsible_match.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"242c246c848fcb803911e6e07cf947a05fdcf95790ac6071527369b6bf2ffbf5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: clippy_lints::matches::match_wild_enum::check: FunctionTooLong \u2014 clippy_lints::matches::match_wild_enum::check runs 114 significant 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 14 over it, 1.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/matches/match_wild_enum.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"73ac54bc57f096a2b10834b87a5ed2259aab68cc4bfb9cb822677ca465f774a5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: hir_ty::mir::lower::mir_body_for_closure_query: FunctionTooLong \u2014 hir_ty::mir::lower::mir_body_for_closure_query runs 114 significant 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 14 over it, 1.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/mir/lower.rs"},"region":{"startLine":1998}}}],"partialFingerprints":{"codehealthFindingId/v1":"60a8fcc91a6f2dfc6c1c5beb11658514154aea89efda2ddacf573a4259e3214d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: hir::source_analyzer::resolve_hir_path_: FunctionTooLong \u2014 hir::source_analyzer::resolve_hir_path_ runs 114 significant 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 14 over it, 1.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir/src/source_analyzer.rs"},"region":{"startLine":1873}}}],"partialFingerprints":{"codehealthFindingId/v1":"84783371f41ef6533dac0841cfbab9f08e261a052639c4683db27af0963f06ba"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: unicode_table_generator::load_data: FunctionTooLong \u2014 unicode_table_generator::load_data runs 114 significant 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 14 over it, 1.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/unicode-table-generator/src/main.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"e603cb6302155ab1daeccf04aaee949ac4a3954bb9a70d1b1fe35c831e2b95b1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/ast_id.rs: FileTooLong \u2014 569 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 69 over it, 1.14\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/span/src/ast_id.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"188464a6665307e63ab04f76f2f90a8275c1fd7b09532eef4599e816ba56b344"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: solve/mod.rs: FileTooLong \u2014 568 significant 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 68 over it, 1.14\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_type_ir/src/solve/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4db68b2bc1ca9f08978befe44c535e819004262942c7e93450f2c6b0904fdb0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/process.rs: FileTooLong \u2014 568 significant 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 68 over it, 1.14\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/process.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2999ee7dc8a480484b35c753e901c5a8054b88b1150e52f8f04054e5aee8bb80"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lower/pattern_matching.rs: FileTooLong \u2014 568 significant 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 96% of them inside a single declaration: MirLowerCtx (56-744). The bar is 500 significant lines; this is 68 over it, 1.14\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/tools/rust-analyzer/crates/hir-ty/src/mir/lower/pattern_matching.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"52f369ad482f068e6ce17d4ea184ad233b194d054384ab1cf6e1db3bd1886d55"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: context/impl_interner.rs: FileTooLong \u2014 567 significant 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 84% of them inside a single declaration: TyCtxt (32-767). The bar is 500 significant lines; this is 67 over it, 1.13\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/ty/context/impl_interner.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ffca3cc200cc64ad16e05b8324d607d9724c29cf2b2df86183f8e2a8d7e8d4a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: parser/path.rs: FileTooLong \u2014 567 significant 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 95% of them inside a single declaration: Parser (65-1056). The bar is 500 significant lines; this is 67 over it, 1.13\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/path.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"29396e9ed797bd17fecef8c61d9b762eb223f56ebdb2321602a572c00a6db3f4"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: y::utils: TooManyFunctions \u2014 34 free functions, declared across 2 files: src/utils.rs (30), build_system/utils.rs (4). The bar is 30 free functions; 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":"compiler/rustc_codegen_cranelift/build_system/utils.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"72c977f2112e6dcbe92e99346a47c0fbf97896859a534138363613fdd4afb8fb"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ScalarInt: TooManyMethods \u2014 34 methods. The bar is 30 methods; this is 4 over it, 1.13\u00D7 the bar. Most of these members implement int.ScalarInt (34 of 34 members), so moving them onto a smaller type would remove them from that contract rather than reduce it. To reduce it, split the contract instead: give each cohesive group of operations its own smaller interface and its own implementing type. Where the contract has to stay whole, move the work behind these members into collaborator types, so what is left here is a forward per member rather than a responsibility per member."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/ty/consts/int.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"867feeefc0d8ed874e5dc28a69f690eee2595148f177b4c9109d9f9d280595d1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TyKind: TooManyMethods \u2014 34 methods. The bar is 30 methods; this is 4 over it, 1.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_public/src/ty/tys.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"5739f2902db040f325a7eb4f19ca3d68aa263ed2209f68d11fa5185edfd51c64"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Const: TooManyMethods \u2014 34 methods. The bar is 30 methods; this is 4 over it, 1.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_type_ir/src/sty/consts.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aa343aa4c461eac6aac27284cfd557acade6d91ec9558f517e10e54161eedb5"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: core::ptr: TooManyFunctions \u2014 34 free functions. The bar is 30 free functions; this is 4 over it, 1.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/ptr/mod.rs"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"a837ed9e86a2554dca56b8f935199d005201c55b270bbf935e1a501586ba8be8"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: core_arch::loongarch64::lsx::portable: TooManyFunctions \u2014 34 free functions. The bar is 30 free functions; this is 4 over it, 1.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/loongarch64/lsx/portable.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"5207fd7c5992dd6e2209674adf5d784f1d072a61492c29d27cfdc6c59519d42c"}},{"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/tools/miri/src/concurrency/genmc/mod.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2200a9c5bb3c3d7052184a6a4b0c7e17509e6a3a77db62a3bfc92cd5d9e49d7"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: RenderOptions: TooManyFields \u2014 34 stored fields beside 1 method. The bar is 30 stored fields; this is 4 over it, 1.13\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/librustdoc/config.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5155899408936a6bd28ee3c6a102bbc39bb59ccc6c63df6d6709ceffc9c4070"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: StaticFiles: TooManyFields \u2014 34 stored fields. The bar is 30 stored fields; this is 4 over it, 1.13\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/librustdoc/html/static_files.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"075d04811cd9a680b2357547d2bd6f300fa6f0335918a70c54266d529d437a22"}},{"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/tools/miri/src/helpers.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"df1854381cff2be38fa1aa70c886a5fc670cb0102240f6dcb960e6be9a78a9f2"}},{"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/tools/miri/src/concurrency/genmc/mod.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"3985f14e240c7b85701bd6c1729ae08f7adbb031ed991e4ec271d8105444281e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FnCtxt.suggest_use_shadowed_binding_with_method: MethodTooLong \u2014 suggest_use_shadowed_binding_with_method 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":"compiler/rustc_hir_typeck/src/method/suggest.rs"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"32a0d30a71fcf8c52b6ec54957083e2937812b50e72ec3a78e523c6fb18ee86d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustc_interface::passes::configure_and_expand: FunctionTooLong \u2014 rustc_interface::passes::configure_and_expand 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":"compiler/rustc_interface/src/passes.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cacc42391696f135d3de9bca94752eb743ce049a4287c3fb4fe80a11dfd825f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: V0SymbolMangler.print_type: MethodTooLong \u2014 print_type 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":"compiler/rustc_symbol_mangling/src/v0.rs"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"80bf98a6359833eb2b0c26af0092603750527f39846d0079a09a414ff9a3104c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: bootstrap::cli_main::main: FunctionTooLong \u2014 bootstrap::cli_main::main 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/bootstrap/src/cli_main.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"9698eba5c2dc0b918fc90a0624c1f64e40dbbd096ae5affb27230749fb261634"}},{"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/tools/miri/src/intrinsics/x86/avx512.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"f422745bcd94dd73f28136707a14787b71516f9dab3a7442899a4ce123ef2ac5"}},{"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/tools/miri/src/shims/unix/freebsd/foreign_items.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6c83acec2d68e628731667396c59ea7ecc2bb59d97701ddc68db950a1fcc149"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NotifyActor.run: MethodTooLong \u2014 run 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/tools/rust-analyzer/crates/vfs-notify/src/lib.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cb8a1d197c6e0c07164ba57b5b4671785b62db94fee509d745a3aab1708c50e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/proc_macro_server.rs: FileTooLong \u2014 563 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 63 over it, 1.13\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":"compiler/rustc_expand/src/proc_macro_server.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ad3b3e805223f1fc0222e403aaadc0858827067f3bee1e07fee6a34befa57f6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: traits/mod.rs: FileTooLong \u2014 563 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 63 over it, 1.13\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":"compiler/rustc_trait_selection/src/error_reporting/traits/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"485a5481ea9b117bc1727b74f05b508a7b25c356e7b3fd7b07c17128fd9e6bae"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DocParser: ClassTooLong \u2014 450 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 9 methods, 3 blocks, lines 256-982. The bar is 400 significant lines; this is 50 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":"compiler/rustc_attr_parsing/src/attributes/doc.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f00ed7e6eeafa6264c77bcb694bef5c574e96109f12c35d81a3370f88036567"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/usefulness.rs: FileTooLong \u2014 562 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 62 over it, 1.12\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_pattern_analysis/src/usefulness.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0569ea80b90cd4ca238ce7e9e6b938ed4113e96c50b7fe080f7974d0acc37dbb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/registry.rs: FileTooLong \u2014 562 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 62 over it, 1.12\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_thread_pool/src/registry.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2b070cc0ec582d60c1a9a4bbe793850821b764fd23f2d63936705c472c43bd1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/conf.rs: FileTooLong \u2014 562 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 62 over it, 1.12\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_config/src/conf.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c542a00f1e3dddb02584ed811c723f9b2438b78e8619263989574895dd64d958"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: x86/sse41.rs: FileTooLong \u2014 561 significant 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 59 free functions. The bar is 500 significant lines; this is 61 over it, 1.12\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/sse41.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d248d44e82573151de1dbeb965e3ddde40b25691b451fdf216cc28d81ef3bc14"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: AttrFlags: 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), 24 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/tools/rust-analyzer/crates/hir-def/src/attrs.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"b45b84f9f6b50d1c79a5fd6a1cdb5781e22f317047c0557374fd0ec0f83e62a4"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Checker: 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), 11 methods, 4 blocks, lines 124-953. 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":"compiler/rustc_const_eval/src/check_consts/check.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"11815308e6d869c4f37eb2f5b8062a58b50c28292e4bf25a6e3097c67856a076"}},{"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/tools/miri/src/shims/windows/fs.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9cf063bae3ce706e9169a911572eb9b581c83d0813ae429a2b9c9f751bdb93f"}},{"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/tools/miri/src/shims/foreign_items.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"22162d742ab27b4636a35eee5ed80a34ab6dc2235550eab6131ceaf1b0c910c7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: interpret/operand.rs: FileTooLong \u2014 560 significant 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 60 over it, 1.12\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_const_eval/src/interpret/operand.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fc04533ee4d5d690aecf716b1760bc7ed16788fc9079d15992691d0e460685e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LoweringContext.lower_expr_to_const_arg_direct: MethodTooLong \u2014 lower_expr_to_const_arg_direct runs 112 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 12 over it, 1.12\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ast_lowering/src/lib.rs"},"region":{"startLine":2888}}}],"partialFingerprints":{"codehealthFindingId/v1":"82df1b26f9a94fd48fb22b8760b4507da851f8555a7816d7938a381cc841259e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FnCtxt.report_failed_method_call_on_numerical_infer_var: MethodTooLong \u2014 report_failed_method_call_on_numerical_infer_var runs 112 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 12 over it, 1.12\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/method/suggest.rs"},"region":{"startLine":2982}}}],"partialFingerprints":{"codehealthFindingId/v1":"3383c971d5a24e864ce683448586ba227fb6bf6c940f1432d3ed23e90f8fbdf9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustc_lint::lifetime_syntax::emit_mismatch_diagnostic: FunctionTooLong \u2014 rustc_lint::lifetime_syntax::emit_mismatch_diagnostic runs 112 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 12 over it, 1.12\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_lint/src/lifetime_syntax.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"47cd95738ce5aa9da5ba2028a026288e317842918f9bce37bded6f97e641be62"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Builder.stmt_expr: MethodTooLong \u2014 stmt_expr runs 112 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 12 over it, 1.12\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_build/src/builder/expr/stmt.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f69eb7fe153ca0cdee8081a4d5ab74f50a45231b302b88e51dbb5f3dc77ac8a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustc_resolve::rustdoc::source_span_for_markdown_range_inner: FunctionTooLong \u2014 rustc_resolve::rustdoc::source_span_for_markdown_range_inner runs 112 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 12 over it, 1.12\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/rustdoc.rs"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"051697a190d728c0ba78b1f3abf51100a93630f017604b565d9f3f23b9fe9074"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SolverDelegate.compute_goal_fast_path: MethodTooLong \u2014 compute_goal_fast_path runs 112 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 12 over it, 1.12\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/solve/delegate.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"de448df4ff1436e181457f8eecbb1ac0f4d67c107e424edb9155f272ed9d1039"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: clippy_lints::loops::explicit_iter_loop::is_ref_iterable: FunctionTooLong \u2014 clippy_lints::loops::explicit_iter_loop::is_ref_iterable runs 112 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 12 over it, 1.12\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/loops/explicit_iter_loop.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"811088c45adc9220cc9c0b3187c56e74775c8330a503b212b8ad31b69bf3b77b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Printer.print_mod_item: MethodTooLong \u2014 print_mod_item runs 112 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 12 over it, 1.12\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/item_tree/pretty.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"3744a91a4d73fb41e247bd9d73a86dc320c0afedf8962b1b85c046241e83c108"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ide_assists::handlers::generate_delegate_trait::generate_impl: FunctionTooLong \u2014 ide_assists::handlers::generate_delegate_trait::generate_impl runs 112 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 12 over it, 1.12\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_delegate_trait.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"12e37c74c65f55b71fd3d463fc24af89aed79992058a75cc1251b6d91e15299e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AnalysisStats.run_body_lowering: MethodTooLong \u2014 run_body_lowering runs 112 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 12 over it, 1.12\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/cli/analysis_stats.rs"},"region":{"startLine":1162}}}],"partialFingerprints":{"codehealthFindingId/v1":"45b83acded250ed7f1243297c02a78132e5b6e6fecb35d1ef14c7d60343ac112"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rust_analyzer::lsp::to_proto::code_lens: FunctionTooLong \u2014 rust_analyzer::lsp::to_proto::code_lens runs 112 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 12 over it, 1.12\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/lsp/to_proto.rs"},"region":{"startLine":1759}}}],"partialFingerprints":{"codehealthFindingId/v1":"42155d6fbc50e8cf6af02b741f2335986a800ad40a89bb5117cab94b86318e2b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: tidy::main: FunctionTooLong \u2014 tidy::main runs 112 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 12 over it, 1.12\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/tidy/src/main.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"913e8f01d908be9db7062067cf71f3cfbac5eba932c775db0cffc8ce70fea1b4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/non_copy_const.rs: FileTooLong \u2014 559 significant 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: NonCopyConst (3 blocks, 256-891). The bar is 500 significant lines; this is 59 over it, 1.12\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/tools/clippy/clippy_lints/src/non_copy_const.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3962d8cb1bf676894facd022afedefa8e63a9282242ec646636aa26b0dd91cd1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/rename.rs: FileTooLong \u2014 558 significant 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 58 over it, 1.12\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/rename.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e65d3db750e2271588cb52deaa6ebad2c131d32297e4fb082e263f8a78c3c47e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/internal.rs: FileTooLong \u2014 557 significant 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 57 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":"compiler/rustc_lint/src/internal.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"db9ce439f12ea25f76ee16ad1836f2d26499b04bd5796d681dcf741c62fdfb72"}},{"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/tools/miri/src/borrow_tracker/stacked_borrows/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"887d6060261d2c99b1d9ffa8212a9638d47597a5ca483bb5eb406cd6222d460d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CodegenCx.codegen_static_item: MethodTooLong \u2014 codegen_static_item 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":"compiler/rustc_codegen_llvm/src/consts.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"89447d486bf57cab75b40f99b61705006446771577b47fd53c9e22a486bd40fb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FnCtxt.note_candidates_on_method_error: MethodTooLong \u2014 note_candidates_on_method_error 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":"compiler/rustc_hir_typeck/src/method/suggest.rs"},"region":{"startLine":2442}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a659861177802478340a7fccfe771326fd0c05f1df41780074fc581250d0dff"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ConstAnalysis.handle_assign: MethodTooLong \u2014 handle_assign 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":"compiler/rustc_mir_transform/src/dataflow_const_prop.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1a4594b51aa200fdc4d7b80c6df10556d91fb56a8336b0f998154a651344983"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustc_mir_transform::shim::make_shim: FunctionTooLong \u2014 rustc_mir_transform::shim::make_shim 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":"compiler/rustc_mir_transform/src/shim.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6ae5da9d98cbb412d8e969d783d8ca3c6fd3fe94b657c9c1f848e3261c999ea"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TransformTy.fold_ty: MethodTooLong \u2014 fold_ty 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":"compiler/rustc_sanitizers/src/cfi/typeid/itanium_cxx_abi/transform.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3aff2369599d918ec0679a64863529559bb759a43e53a2239edab822e55ed1a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: libm::math::generic::fma::fma_round: FunctionTooLong \u2014 libm::math::generic::fma::fma_round 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":"library/compiler-builtins/libm/src/math/generic/fma.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"30210e610a66386866cede6df77016c60cc3f0322002fbad7e7c1033d69e169d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: assert_instr_macro::assert_instr: FunctionTooLong \u2014 assert_instr_macro::assert_instr 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":"library/stdarch/crates/assert-instr-macro/src/lib.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"63076244bbbc9f150c93fed6ebb1e7559615f183972520189cabb518d52f5978"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LangString.parse: MethodTooLong \u2014 parse 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/librustdoc/html/markdown.rs"},"region":{"startLine":1264}}}],"partialFingerprints":{"codehealthFindingId/v1":"caabc75c8d000b899014263438e624a21cc90b33eacaf59873cbb963f1e66aa6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: clippy_lints::transmute::transmute_undefined_repr::check: FunctionTooLong \u2014 clippy_lints::transmute::transmute_undefined_repr::check 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/tools/clippy/clippy_lints/src/transmute/transmute_undefined_repr.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fc1933800fec43c1ae6d1e9af54679dfac0af3be0641c48f16286e818000e56"}},{"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/tools/miri/src/intrinsics/x86/avx2.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cf69f506ef3e426dcd8bb387dc9d00d21933edc0673438f16f5ebaa6bf2eb2e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MirLowerCtx.lower_expr_as_place_without_adjust: MethodTooLong \u2014 lower_expr_as_place_without_adjust 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/tools/rust-analyzer/crates/hir-ty/src/mir/lower/as_place.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"a14fb9aad2de0b1b4347f9b7e97d87c145f721ec3096fa275693636003542e74"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ide::syntax_highlighting::highlight::punctuation: FunctionTooLong \u2014 ide::syntax_highlighting::highlight::punctuation 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/tools/rust-analyzer/crates/ide/src/syntax_highlighting/highlight.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"a42de73413433458970b61267b5383492d3a9fa31e95385d2763b7d39acf4488"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AnalysisStats.run_ide_things: MethodTooLong \u2014 run_ide_things 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/tools/rust-analyzer/crates/rust-analyzer/src/cli/analysis_stats.rs"},"region":{"startLine":1329}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bc1ee2aba94e11284903b5036dd438ef8a2d377cab8cc578f87b053d05cbfc8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: syntax_bridge::prettify_macro_expansion::prettify_macro_expansion: FunctionTooLong \u2014 syntax_bridge::prettify_macro_expansion::prettify_macro_expansion 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/tools/rust-analyzer/crates/syntax-bridge/src/prettify_macro_expansion.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f2e7df4b9b4a62177e1df412f0386e0f016208baa476855040812f11101af80"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustfmt_nightly::types::join_bounds_inner: FunctionTooLong \u2014 rustfmt_nightly::types::join_bounds_inner 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/tools/rustfmt/src/types.rs"},"region":{"startLine":1166}}}],"partialFingerprints":{"codehealthFindingId/v1":"84debda325ced1f6bd96fa7a069a0b26dc26883fd3182f39efb50823fd898e6a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SearchGraph: ClassTooLong \u2014 443 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 21 methods, 3 blocks, lines 622-1503. The bar is 400 significant lines; this is 43 over it, 1.11\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":"compiler/rustc_type_ir/src/search_graph/mod.rs"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac099701011b355d64700eba1ff80236a7020a59aa7ffd01bd2c8a0c08419abe"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: methods/unnecessary_to_owned.rs: FileTooLong \u2014 552 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 52 over it, 1.10\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/methods/unnecessary_to_owned.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"115c12baddc140b119ec2d470af69b466b375f13763f8052b3e1846101ece987"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: CompilerInterface: ClassTooLong \u2014 441 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 100 methods, 2 blocks, lines 76-895. The bar is 400 significant lines; this is 41 over it, 1.10\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":"compiler/rustc_public/src/compiler_interface.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"423f76eabb01eac845b46f7eb1d7ba43000afa530da6408b1d0bf8f40141c65f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: FulfillProcessor: ClassTooLong \u2014 441 significant 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, 3 blocks, lines 281-1031. The bar is 400 significant lines; this is 41 over it, 1.10\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":"compiler/rustc_trait_selection/src/traits/fulfill.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3bd4a81d738e5ed79b9816a8d74e9ce5bb2c2fb41a8214826e36cc6698a8ddd"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Analysis: ClassTooLong \u2014 440 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 79 methods, 2 blocks, lines 244-978. The bar is 400 significant lines; this is 40 over it, 1.10\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/tools/rust-analyzer/crates/ide/src/lib.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5249ce87e594363d6e2e2a79afa0d68455d372ddb82d22b6a81f773460a3350"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Cursor: TooManyMethods \u2014 33 methods. The bar is 30 methods; this is 3 over it, 1.10\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":"compiler/rustc_lexer/src/lib.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"48d77409db22ae2a3b8dd1f30b35e1443b4b3f601be691074d827b69743aa118"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: GenericArgs: TooManyMethods \u2014 33 methods. The bar is 30 methods; this is 3 over it, 1.10\u00D7 the bar. Most of these members implement generic_args.GenericArgs (33 of 33 members), so moving them onto a smaller type would remove them from that contract rather than reduce it. To reduce it, split the contract instead: give each cohesive group of operations its own smaller interface and its own implementing type. Where the contract has to stay whole, move the work behind these members into collaborator types, so what is left here is a forward per member rather than a responsibility per member."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/ty/generic_args.rs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"78e74ca463673472c4569413b666a1b802b9589a65500208972c9f1825b013aa"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DefCollector: TooManyMethods \u2014 33 methods, declared across 2 files: src/build_reduced_graph.rs (27), src/def_collector.rs (6). The bar is 30 methods; this is 3 over it, 1.10\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":"compiler/rustc_resolve/src/def_collector.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2b75f616b76798eca5851473f5965ebfbb36a7a323d56493b1c2848b8045fb3"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TcpStream: TooManyMethods \u2014 33 methods. The bar is 30 methods; this is 3 over it, 1.10\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":"library/std/src/sys/net/connection/xous/tcpstream.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"e950a3e1727411cbe2c1a123cd386cb3ac823365a0619d9d7bb5815a86d8b3e3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LoweringContext.lower_qpath: MethodTooLong \u2014 lower_qpath 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":"compiler/rustc_ast_lowering/src/path.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e384052e528d1087410fc563f4ba5fac3bb8be5e13b7f946ec03ad5f5f0f889"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustc_hir_analysis::check::wfcheck::check_gat_where_clauses: FunctionTooLong \u2014 rustc_hir_analysis::check::wfcheck::check_gat_where_clauses 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":"compiler/rustc_hir_analysis/src/check/wfcheck.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba24ddff84c4ace4c67b22eb0bea49d78e2027bdb2a1acff8c4b777c9e5eda47"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustc_hir_analysis::coherence::builtin::visit_implementation_of_dispatch_from_dyn: FunctionTooLong \u2014 rustc_hir_analysis::coherence::builtin::visit_implementation_of_dispatch_from_dyn 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":"compiler/rustc_hir_analysis/src/coherence/builtin.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f2e67971a545195e45f48c9da3226b258deadb0f9d29ae5de9b0c058d64d91b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustc_lint::foreign_modules::structurally_same_type_impl: FunctionTooLong \u2014 rustc_lint::foreign_modules::structurally_same_type_impl 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":"compiler/rustc_lint/src/foreign_modules.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"28a54f140539716f74cccd0e2e11363d650781f5a9a5c72371c424942463b24e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LateResolutionVisitor.suggest_introducing_lifetime_filtered: MethodTooLong \u2014 suggest_introducing_lifetime_filtered 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":"compiler/rustc_resolve/src/late/diagnostics.rs"},"region":{"startLine":4323}}}],"partialFingerprints":{"codehealthFindingId/v1":"f92757d9d5277ddafd07647f5af7462ca9287a9ee31be2140a40693fa50a0106"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Context.init: MethodTooLong \u2014 init 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/librustdoc/html/render/context.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c551a23fbe4acdc9230cc20612497de27878203b056455d826f858f24e89616"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EvalContextExt.emulate_x86_sse42_intrinsic: MethodTooLong \u2014 emulate_x86_sse42_intrinsic 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/tools/miri/src/intrinsics/x86/sse42.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fa8920d8cac293cb3791c89901c251549cc0fa7d67f1223f3109e9765dc637e"}},{"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/tools/miri/src/shims/unix/linux_like/sync.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dd28d021a0470ad1e6ec01d0466228d05faed986e5305eca60cc610cf298ef9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ExprUseVisitor.walk_expr: MethodTooLong \u2014 walk_expr 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/tools/rust-analyzer/crates/hir-ty/src/infer/closure/analysis/expr_use_visitor.rs"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1aaf90d24926a45be2595227e7df0376e377aba0d0f59969234a00797b09b23"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ExprUseVisitor.cat_pattern: MethodTooLong \u2014 cat_pattern 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/tools/rust-analyzer/crates/hir-ty/src/infer/closure/analysis/expr_use_visitor.rs"},"region":{"startLine":1496}}}],"partialFingerprints":{"codehealthFindingId/v1":"53b83fe6c35a6cde86f062b9e68ab262cb0c10eef88811b7ac4e829ea4bf0711"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/token_stream.rs: FileTooLong \u2014 549 significant 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 62% of them inside a single declaration: TokenStream (6 blocks, 20-667). The bar is 500 significant lines; this is 49 over it, 1.10\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/tools/rust-analyzer/crates/proc-macro-srv/src/token_stream.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bb08c06bc3e470682eca85d4c0c5f00716e2174350f6492a113f624638c6503"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ConfirmContext: ClassTooLong \u2014 438 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 16 methods, 3 blocks, lines 37-836. The bar is 400 significant lines; this is 38 over it, 1.10\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":"compiler/rustc_hir_typeck/src/method/confirm.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"525b702c52dd1d4b9036c96b040f5c562640810dbecfb1cb1823091378f86b16"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: check_consts/check.rs: FileTooLong \u2014 547 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 82% of them inside a single declaration: Checker (4 blocks, 124-953). The bar is 500 significant lines; this is 47 over it, 1.09\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":"compiler/rustc_const_eval/src/check_consts/check.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d93661dc355b9ede1cb5d3b909e87487dbfc4afcc2b1fb4e307e02ee07ee6a9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/nameres.rs: FileTooLong \u2014 547 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 47 over it, 1.09\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/nameres.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d91110050e2cb49d999e79a4d85cedb1b146f8c07710c1e226ec422ada43d645"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/render.rs: FileTooLong \u2014 547 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 47 over it, 1.09\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-completion/src/render.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebe43a2407c27e515f1e5b5bb963d9e500031ce2f65c929dcfed1a2165d50736"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/rename.rs: FileTooLong \u2014 546 significant 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 46 over it, 1.09\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-db/src/rename.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ed9fb86b102b730769415a13a502d9c0ea812b6d1263847e33690f722aae692"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/hover.rs: FileTooLong \u2014 546 significant 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 46 over it, 1.09\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/hover.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"55e892bbadf30291244dfeffcda2ad9566c0a3712d2cbb96415f9657b670711d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: num/wrapping.rs: FileTooLong \u2014 545 significant 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 45 over it, 1.09\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/num/wrapping.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec8bed99d25ecdd6304e77216fcab8ab9205524394b0a192b96458fda9df63be"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: bin/main.rs: FileTooLong \u2014 545 significant 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 45 over it, 1.09\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/bin/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd059acb768b3dd74f312beffb81e26735e5888b732eda7087b49d28a05b5e7e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustc_attr_parsing::attributes::repr::parse_repr: FunctionTooLong \u2014 rustc_attr_parsing::attributes::repr::parse_repr runs 109 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_attr_parsing/src/attributes/repr.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"61f146da166c9171f0726d9a9f22ee04c8da9b50f12decebb8687963dc3e3ab7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustc_codegen_ssa::mir::codegen_mir: FunctionTooLong \u2014 rustc_codegen_ssa::mir::codegen_mir runs 109 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/mir/mod.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fc9ea09b508a9c0baaff57190476c0a0bb75b7dd8448b5275fd88ff5faf1304"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: InterpCx.eval_terminator: MethodTooLong \u2014 eval_terminator runs 109 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_const_eval/src/interpret/step.rs"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"89b827a2f1d5fd443c97ea77fb120c59f9e11f969ee8f5a772961deba4a13539"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ValidityVisitor.try_visit_primitive: MethodTooLong \u2014 try_visit_primitive runs 109 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_const_eval/src/interpret/validity.rs"},"region":{"startLine":853}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fecd771983f7bcc050d3f439da00c05d3b97a444e8bbaf11468f8f6bed385aa"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustc_middle::lint::emit_lint_base: FunctionTooLong \u2014 rustc_middle::lint::emit_lint_base runs 109 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/lint.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0afbf09f6c91609d2ae94e36258c8ea26e3e5004c06bbe769c1817982e714e1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NiceRegionError.explain_actual_impl_that_was_found: MethodTooLong \u2014 explain_actual_impl_that_was_found runs 109 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/error_reporting/infer/nice_region_error/placeholder_error.rs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"b629f1dcd590306ab550c93a1e6bea05313c6406d620bf205c307059616c954d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: libm::math::exp2m1::exp2m1_accurate: FunctionTooLong \u2014 libm::math::exp2m1::exp2m1_accurate runs 109 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/compiler-builtins/libm/src/math/exp2m1.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"b889b6aa560aedee3d8e7f63b043f10af5caca6e50c6e222d0d7fa7e03162dc4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ide_db::imports::import_assets::trait_applicable_items: FunctionTooLong \u2014 ide_db::imports::import_assets::trait_applicable_items runs 109 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-db/src/imports/import_assets.rs"},"region":{"startLine":775}}}],"partialFingerprints":{"codehealthFindingId/v1":"928279bb215b2a66c2fa9362824605c4fc827501daf2aac7d66e7f77fc69f7a9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: proc_macro_srv_cli::main_loop::run_old: FunctionTooLong \u2014 proc_macro_srv_cli::main_loop::run_old runs 109 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/proc-macro-srv-cli/src/main_loop.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"179d9a7e1d87cdaae97b5d97bf0eef7c0aae7ee6c697aa92c62d0a000956f7bd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/profiling.rs: FileTooLong \u2014 543 significant 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 43 over it, 1.09\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_data_structures/src/profiling.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7394cddbbae6933a883d3354e087780703665b4deb5407147b25e16aaf4f181"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DiagnosticsCollector: ClassTooLong \u2014 434 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 23 methods, 2 blocks, lines 748-1443. The bar is 400 significant lines; this is 34 over it, 1.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/tools/rust-analyzer/crates/hir/src/diagnostics.rs"},"region":{"startLine":748}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1670d45707bf516977686382dd994e347b68c1b524e267d4ff49a3a7214d1e2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: traits/mod.rs: FileTooLong \u2014 542 significant 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 42 over it, 1.08\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/traits/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"76f0e9c2999775ecf1691793a43671cb7d2b03b366e8ec6b26a9d77f33a96f8d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/interner.rs: FileTooLong \u2014 542 significant 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 72% of them inside a single declaration: Interner (50-578). The bar is 500 significant lines; this is 42 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":"compiler/rustc_type_ir/src/interner.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"626ad5ba8ec16310780aa2fb92b89afc494b42c8be5cc0658d359d928a931c28"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/diagnostics.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). The bar is 500 significant lines; this is 40 over it, 1.08\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_metadata/src/diagnostics.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cf8e9761d673060fc7f698a6b6598a6a68120e43157ac545010a86595da31c2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ty/instance.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). The bar is 500 significant lines; this is 40 over it, 1.08\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/ty/instance.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"40b7f38daf56e6064cc61159c2021fda3afe3332768d48f83fa7f59bbb572d9e"}},{"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-823). 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/tools/miri/src/shims/windows/fs.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1d7946eafea816e4402fd087d370d7e3d84070a8c5e8c3c1545daed8e74bdaa"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/highlight_related.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). The bar is 500 significant lines; this is 40 over it, 1.08\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/highlight_related.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"11586a2245bd40df5b86db8f33b925fe2dfcd3649df02e45708591b60591f087"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustc_hir_typeck::method::probe::method_autoderef_steps: FunctionTooLong \u2014 rustc_hir_typeck::method::probe::method_autoderef_steps 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":"compiler/rustc_hir_typeck/src/method/probe.rs"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"b26527a433094d9e0702ce0c8af7715343ae861cd0fe40c5ad1281d923151286"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SelectionContext.match_upcast_principal: MethodTooLong \u2014 match_upcast_principal 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":"compiler/rustc_trait_selection/src/traits/select/mod.rs"},"region":{"startLine":2466}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f76c653a3cde7fd4bada9ab20367b281b0540063387bd15e87ddaf6b9b1be9d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: libm::math::cbrt::cbrt_round: FunctionTooLong \u2014 libm::math::cbrt::cbrt_round 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":"library/compiler-builtins/libm/src/math/cbrt.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"fea1f7a4d1141db149c2c249240d56ff68a7b4cfa659779449573d10776641f5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Crate.run_clippy_lints: MethodTooLong \u2014 run_clippy_lints 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/tools/clippy/lintcheck/src/main.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf22ae64824ceffac1583a6cccc9dcc7124c7438dc70305d0ad1452aa444d153"}},{"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/tools/miri/src/intrinsics/x86/avx.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"8da8d20d811cf443c7517d8a1558a0f8fd6314ec1eeacd3a3db44dd1e46afd27"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DbInterner.for_each_relevant_impl: MethodTooLong \u2014 for_each_relevant_impl 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/tools/rust-analyzer/crates/hir-ty/src/next_solver/interner.rs"},"region":{"startLine":1440}}}],"partialFingerprints":{"codehealthFindingId/v1":"79a770f64243ab00ec3e3240cb34fd6cfcf215c724226bc6e159e508a7e9f084"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ide::syntax_highlighting::highlight::highlight_name_ref: FunctionTooLong \u2014 ide::syntax_highlighting::highlight::highlight_name_ref 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/tools/rust-analyzer/crates/ide/src/syntax_highlighting/highlight.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8dc711e2a38b2e427c46b62702af31750d10cdcee8921c3713d0af14af3fde3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: build_steps/check.rs: FileTooLong \u2014 538 significant 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 38 over it, 1.08\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/build_steps/check.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3170cea4d530b3f4733df96013abd7b36750e6982d8b7971b115c96cacdc3b2c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lint/html_tags.rs: FileTooLong \u2014 538 significant 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 38 over it, 1.08\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/passes/lint/html_tags.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a06d31f981609454faac5f7dbdfd9fa670c2f31a7b51049ac8684824c0e7f63e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: handlers/extract_module.rs: FileTooLong \u2014 538 significant 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 38 over it, 1.08\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/extract_module.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"78074a9852f066b4939bdc63651f35e42f6dfd0baa7bc8a836b07a0c2a576912"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: expressions/atom.rs: FileTooLong \u2014 538 significant 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 38 over it, 1.08\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/parser/src/grammar/expressions/atom.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a24831eb5699f64ae0dada120748cb7d878c87c15b0dfa36d1478f918a1a014"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/session_diagnostics.rs: FileTooLong \u2014 537 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 37 over it, 1.07\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/session_diagnostics.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1e940772b6d3b52cc240a0ee735515c2d4086768439a78452185906467efb63"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: LinkedList: ClassTooLong \u2014 429 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 37 methods, 21 blocks, lines 51-2365. The bar is 400 significant lines; this is 29 over it, 1.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/alloc/src/collections/linked_list.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"5069b053f79542b91abaf30affe20ac8b6cba3086cc3f438ae7ec4cd5cb0f82f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Extended: ClassTooLong \u2014 429 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 0 methods, 2 blocks, lines 1875-2417. The bar is 400 significant lines; this is 29 over it, 1.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/build_steps/dist.rs"},"region":{"startLine":1875}}}],"partialFingerprints":{"codehealthFindingId/v1":"422ed5ba8d46ac0bbecfcb5f10f09a1095b67d8eb820ee5a59dff475e7a28dd5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MirBorrowckCtxt.check_movable_place: MethodTooLong \u2014 check_movable_place 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":"compiler/rustc_borrowck/src/lib.rs"},"region":{"startLine":1899}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c1be1922fea3bfb7a77f750d4a0432dc0f0d9517c867e791d60f0f6147a6d3f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustc_codegen_gcc::asm::dummy_output_type: FunctionTooLong \u2014 rustc_codegen_gcc::asm::dummy_output_type 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":"compiler/rustc_codegen_gcc/src/asm.rs"},"region":{"startLine":820}}}],"partialFingerprints":{"codehealthFindingId/v1":"5351e3410b5100681f7e65c34137014b165107ef89cc2ce159451795150afa15"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ArArchiveBuilder.build_inner: MethodTooLong \u2014 build_inner 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":"compiler/rustc_codegen_ssa/src/back/archive.rs"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"40f7765aea03eae6c2982b73b9f0c1ec362882aaa41b340244f4555bb0548d78"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustc_codegen_ssa::back::link::link_staticlib: FunctionTooLong \u2014 rustc_codegen_ssa::back::link::link_staticlib 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":"compiler/rustc_codegen_ssa/src/back/link.rs"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca6f87b341d9da2db18788774c8035aea3b696440c89ebd8801a14c159ec3008"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ThirPrinter.print_pat_kind: MethodTooLong \u2014 print_pat_kind 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":"compiler/rustc_mir_build/src/thir/print.rs"},"region":{"startLine":729}}}],"partialFingerprints":{"codehealthFindingId/v1":"32d674ca407a77fb277618f2ac9b4987a2cb3536b60ed31be9d8c01b5c08f206"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustc_next_trait_solver::solve::assembly::structural_traits::extract_tupled_inputs_and_output_from_async_callable: FunctionTooLong \u2014 rustc_next_trait_solver::solve::assembly::structural_traits::extract_tupled_inputs_and_output_from_async_callable 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":"compiler/rustc_next_trait_solver/src/solve/assembly/structural_traits.rs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"02f87e5c9e029b266c1a497bc8e8462cc66b179fe80dcbbacaa47bb6bfb0eaaf"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Parser.collect_tokens: MethodTooLong \u2014 collect_tokens 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":"compiler/rustc_parse/src/parser/attr_wrapper.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9fd9a45098573af4c4432c2be566c2d6edd3c549260618adeb869be999a6c0f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Resolver.smart_resolve_macro_path: MethodTooLong \u2014 smart_resolve_macro_path 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":"compiler/rustc_resolve/src/macros.rs"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"51fe76d22dde9b5340e4f4b31ff13e3bb15e679e3d3767952d7513ff705aa6d8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: libm_macros::validate: FunctionTooLong \u2014 libm_macros::validate 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":"library/compiler-builtins/crates/libm-macros/src/lib.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"22b865d1cf43b0bdf7f25b589ae4208d5649aff31f68d12e40c8b23ad58deef4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustdoc::clean::inline::try_inline: FunctionTooLong \u2014 rustdoc::clean::inline::try_inline 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":"src/librustdoc/clean/inline.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e57c9e23b586f432234b9ea5ea9a9071f6229a84fae15efad2f064a99f58dc8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ConstEvalCtxt.fetch_path: MethodTooLong \u2014 fetch_path 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":"src/tools/clippy/clippy_utils/src/consts.rs"},"region":{"startLine":817}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fea68bff0b16289f01a73f42d783d7649c935655e1bffa72ea5b84c44a1d5bc"}},{"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":"src/tools/miri/cargo-miri/src/setup.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bf0bde8d22a6eeb378e2e169d4f46918dd3d6a84e9f8364f770192eb17cc598"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Canonicalized.canonicalize: MethodTooLong \u2014 canonicalize 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":"src/tools/unicode-table-generator/src/raw_emitter.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"d465a9c20eeaced9f9be96c9d53402b84b2ca5f7fed6664e0f369c284459fa74"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/abi.rs: FileTooLong \u2014 534 significant 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 34 over it, 1.07\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/abi.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"498b5884f9d11badd1aebe6991321d22da5b547daa271483eaa6108b70d1e096"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/hir.rs: FileTooLong \u2014 534 significant 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 34 over it, 1.07\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/hir.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b58c2daf7ccdef1e57b3fcfad321e32c012d95a3ae3a4b3d7e00c092653bcd46"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Builder: TooManyMethods \u2014 32 methods, declared across 3 files: src/builder.rs (30), debuginfo/mod.rs (1), src/intrinsic.rs (1). The bar is 30 methods; this is 2 over it, 1.07\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":"compiler/rustc_codegen_llvm/src/llvm/ffi.rs"},"region":{"startLine":718}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb3afd57ef1da27493ddffb0d543739016771fd732e52ab35eb917b1bbb157bc"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: rustc_incremental::persist::fs: TooManyFunctions \u2014 32 free functions. The bar is 30 free functions; this is 2 over it, 1.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_incremental/src/persist/fs.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ca102fbe76224fdd7f6e3df82c61f346598070e9c0a305adba699fc62a49151"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ParseCtxt: TooManyMethods \u2014 32 methods, declared across 3 files: parse/instruction.rs (19), custom/parse.rs (11), custom/mod.rs (2). The bar is 30 methods; this is 2 over it, 1.07\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":"compiler/rustc_mir_build/src/builder/custom/mod.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aab4c7adecac8ec97691a92f9e568c78db2139abb9da0d9b50d5913d96075ab"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TcpStream: TooManyMethods \u2014 32 methods. The bar is 30 methods; this is 2 over it, 1.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/net/connection/motor.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"0271e4deb2bd54611a3fa968ec1355d4c401051ff97083fc9a8f787ffa882d37"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TcpStream: TooManyMethods \u2014 32 methods. The bar is 30 methods; this is 2 over it, 1.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/net/connection/socket/mod.rs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0c9ea9840c4f720de8669b3ebb1f3ef81899d8aeb758af0c9a6c4bd357d6843"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TcpStream: TooManyMethods \u2014 32 methods. The bar is 30 methods; this is 2 over it, 1.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/net/connection/wasip1.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfaaae9c9748a6dda4bb1affafdb9df170f598cd082fc59880de586617bb3ef8"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: core_arch::x86::fma: TooManyFunctions \u2014 32 free functions. The bar is 30 free functions; this is 2 over it, 1.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/fma.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"08ba84ddd692d5f7094b5ee9cb25126a16e4525b66bb596261623a3341ff3587"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: HirEqInterExpr: TooManyMethods \u2014 32 methods. The bar is 30 methods; this is 2 over it, 1.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_utils/src/hir_utils.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebc6b14a37f54216e3001166a338dae2247d7771a729dcdc7295bccdd203b853"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: InlineAsmCtxt: ClassTooLong \u2014 426 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 7 methods, 2 blocks, lines 22-662. The bar is 400 significant lines; this is 26 over it, 1.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/inline_asm.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4099476c4cac20d4155220d02f219a7f3afa01c869bc2b8ecfe0af47709b6d2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: x86/avx512vnni.rs: FileTooLong \u2014 532 significant 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 68 free functions. The bar is 500 significant lines; this is 32 over it, 1.06\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512vnni.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0edbae5b00437c893fc3552c9346bd1a23177623d714973665d61af97b661c5d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustc_ast_passes::feature_gate::check_crate: FunctionTooLong \u2014 rustc_ast_passes::feature_gate::check_crate 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":"compiler/rustc_ast_passes/src/feature_gate.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcdcba3411c2ec958bd4f073c9b133a8bc0ec8413727ee23a9a47f1c350cefda"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustc_codegen_llvm::asm::llvm_fixup_output_type: FunctionTooLong \u2014 rustc_codegen_llvm::asm::llvm_fixup_output_type 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":"compiler/rustc_codegen_llvm/src/asm.rs"},"region":{"startLine":1558}}}],"partialFingerprints":{"codehealthFindingId/v1":"387f9e14a867f77cbeaef2e39021375924cd84445890783c3d8f8e0ca7c4d7d4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustc_hir_analysis::check::entry::check_main_fn_ty: FunctionTooLong \u2014 rustc_hir_analysis::check::entry::check_main_fn_ty 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":"compiler/rustc_hir_analysis/src/check/entry.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f446069a0fd4ff05bda9fe56fe4af9f63da34f8350018dc9b5607ba4179cd17"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EvalCtxt.evaluate_goal_raw: MethodTooLong \u2014 evaluate_goal_raw 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":"compiler/rustc_next_trait_solver/src/solve/eval_ctxt/mod.rs"},"region":{"startLine":800}}}],"partialFingerprints":{"codehealthFindingId/v1":"10548bf4a668f1d3b250488062544b890dfb0c88702885b63c3afbd4bab66efb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Resolver.visit_scopes: MethodTooLong \u2014 visit_scopes 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":"compiler/rustc_resolve/src/ident.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"6073075ff5ecda6a930e8b2ba9dacb18a71e4836461d0305aaecdace2454f335"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustdoc::html::render::print_item::item_variants: FunctionTooLong \u2014 rustdoc::html::render::print_item::item_variants 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/librustdoc/html/render/print_item.rs"},"region":{"startLine":1794}}}],"partialFingerprints":{"codehealthFindingId/v1":"e63660ab6f927d44546652b5103cee1c8e560ce0a954282f86ab356f4d3d78f0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: clippy_lints::matches::match_same_arms::check: FunctionTooLong \u2014 clippy_lints::matches::match_same_arms::check 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/tools/clippy/clippy_lints/src/matches/match_same_arms.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"6075b49e3bfeeaeec1d901b3fed0cb9d7e8fa80fc745e08615effa6247f346a2"}},{"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/tools/miri/src/shims/unix/freebsd/sync.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf6b6e1f097e0ee89b5935bd38aad1cfa25e5d540b301d24504bd49e11c5f7b3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: tidy::features::collect_lang_features_in: FunctionTooLong \u2014 tidy::features::collect_lang_features_in 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/tools/tidy/src/features.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"53dbac7bb606e4e49a01a0c4e2c680eda21ec01c9d4b29a269e4ddbe81e0a871"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: next_solver/util.rs: FileTooLong \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). The bar is 500 significant lines; this is 29 over it, 1.06\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/next_solver/util.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"65e8d310c1f6b6066b9b137ce9ec444e5d9a719e5b460f723c63dd3d6f82c70c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/signature_help.rs: FileTooLong \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). The bar is 500 significant lines; this is 29 over it, 1.06\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/signature_help.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa75f574f83dca16c390cc896174150ab0891456f35ab69c8185fd5259e1f40f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/cargo_workspace.rs: FileTooLong \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). The bar is 500 significant lines; this is 29 over it, 1.06\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/project-model/src/cargo_workspace.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"24c5bc3cb17e6e750ef44b1cdba04f22f30d79a82e01b69f9296923683905c8f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ConstPropagator: ClassTooLong \u2014 423 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 17 methods, 7 blocks, lines 67-851. The bar is 400 significant lines; this is 23 over it, 1.06\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/known_panics_lint.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"74de45a1495116426d8491e1e8b0fb48fef5ab82e9942d7da2d01d3af8c6fba4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/tokenstream.rs: FileTooLong \u2014 527 significant 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 27 over it, 1.05\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ast/src/tokenstream.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ed1918014eebc8397aa8d007c50d877c9453130c2a5e1b4b368e1c9054e78c3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: next_solver/generic_arg.rs: FileTooLong \u2014 527 significant 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 27 over it, 1.05\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/next_solver/generic_arg.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5bf2e4d31747af0af806db6c90a894176a304a69b5ccf72f6011b133bcbce22"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DeclValidator: ClassTooLong \u2014 421 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 21 methods, 2 blocks, lines 125-776. The bar is 400 significant lines; this is 21 over it, 1.05\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/tools/rust-analyzer/crates/hir-ide/src/diagnostics/decl_check.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"37958034b46a885a0f5259dfd4cafe3068c14d351d5e02788312d7b33388202d"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: LexicalResolver: ClassTooLong \u2014 421 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 15 methods, 2 blocks, lines 132-954. The bar is 400 significant lines; this is 21 over it, 1.05\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":"compiler/rustc_infer/src/infer/lexical_region_resolve/mod.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"846e695afe8e8641be31cdec5e327f63905543dc43600ff379b2a009a2b23b65"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/universal_regions.rs: FileTooLong \u2014 526 significant 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 26 over it, 1.05\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/universal_regions.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bd61723028c6d099411f462168b675831e86490e0010f765e8056374ce58770"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/input_stats.rs: FileTooLong \u2014 526 significant 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: StatCollector (4 blocks, 57-803). The bar is 500 significant lines; this is 26 over it, 1.05\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":"compiler/rustc_passes/src/input_stats.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5335fc6e90516f3f3f1711de00918980ba208f179c16db54fca1d4d53e66f087"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/autodiff.rs: FileTooLong \u2014 525 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 25 over it, 1.05\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_builtin_macros/src/autodiff.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7deb20b571ac86a6a03b80cecbbe7854ce75818a2de4c5b1bee3b91e3565df6c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustc_codegen_cranelift::main_shim::maybe_create_entry_wrapper: FunctionTooLong \u2014 rustc_codegen_cranelift::main_shim::maybe_create_entry_wrapper 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":"compiler/rustc_codegen_cranelift/src/main_shim.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"45a9d5354b559f2c16a70fca702b33c3261e2380c02fa387ba6e659e88d288b0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustc_codegen_gcc::asm::modifier_to_gcc: FunctionTooLong \u2014 rustc_codegen_gcc::asm::modifier_to_gcc 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":"compiler/rustc_codegen_gcc/src/asm.rs"},"region":{"startLine":1065}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cdacb2d7ff486f28bbe22b31a9a33e4fa14a20aca028e65f0535d8ecd2dceff"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustc_codegen_ssa::back::link::report_linker_output: FunctionTooLong \u2014 rustc_codegen_ssa::back::link::report_linker_output 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":"compiler/rustc_codegen_ssa/src/back/link.rs"},"region":{"startLine":1061}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a731fb65c21fef8474e50e663f5b40b4b40c29c3316f25f16f520bc636a3d2c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: libm::math::jnf::jnf: FunctionTooLong \u2014 libm::math::jnf::jnf 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":"library/compiler-builtins/libm/src/math/jnf.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"8da2bd0183dfb1dfe7fed397d03eea25e1f1496a518b77ab0b42f0b0f2ebdb10"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: libm::math::rem_pio2::rem_pio2: FunctionTooLong \u2014 libm::math::rem_pio2::rem_pio2 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":"library/compiler-builtins/libm/src/math/rem_pio2.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"c46e31adfb63571338ed9526d60709c96f8125561de486dc2e7337730e1c876c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: clippy_lints::ifs::branches_sharing_code::scan_block_for_eq: FunctionTooLong \u2014 clippy_lints::ifs::branches_sharing_code::scan_block_for_eq 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":"src/tools/clippy/clippy_lints/src/ifs/branches_sharing_code.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cfcbd382996d8dcb30793b69209f1089b4644aba32f3bb4797314e9603a8218"}},{"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":"src/tools/miri/cargo-miri/src/phases.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"d76f938e7816ad996d2f7da955ab7123543a3c3933057ebef80808203cf33295"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: hir_expand::builtin::derive_macro::parse_adt_from_syntax: FunctionTooLong \u2014 hir_expand::builtin::derive_macro::parse_adt_from_syntax 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":"src/tools/rust-analyzer/crates/hir-expand/src/builtin/derive_macro.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"5772732ec843479a55e1dc726e63614ef1135b2cba8928531f2b8410253d7f7d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MirEvalError.pretty_print: MethodTooLong \u2014 pretty_print 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":"src/tools/rust-analyzer/crates/hir-ide/src/mir_pretty/errors.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"d68edc024b00b405cff1a371737b14b9c2a7cf95b4b241cd0cfae9911c6a0509"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ModResolver.find_external_module: MethodTooLong \u2014 find_external_module 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":"src/tools/rustfmt/src/modules.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"8153999ce6f5eea9f553a5ebc514ebf6e96b7a554d6383f5f29b4c28000d7db8"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Context: ClassTooLong \u2014 419 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 11 methods, 4 blocks, lines 49-809. The bar is 400 significant lines; this is 19 over it, 1.05\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/librustdoc/html/render/context.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e763dc0eb13783e9414f01840d61815ae972346508b0c1fb364207c5289f9da"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: NonCopyConst: ClassTooLong \u2014 419 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 7 methods, 3 blocks, lines 256-891. The bar is 400 significant lines; this is 19 over it, 1.05\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/tools/clippy/clippy_lints/src/non_copy_const.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1c458f6ecdcc6ffd5fdd68acdbddb959ec36a666d957d03a315661526562e5a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: BuilderMethods: ClassTooLong \u2014 418 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 139 methods. The bar is 400 significant lines; this is 18 over it, 1.05\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":"compiler/rustc_codegen_ssa/src/traits/builder.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"696b9066a760056b1c739a35db83685928693a52682f70b1ff01f55b5d868857"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: builder/gpu_offload.rs: FileTooLong \u2014 522 significant 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 22 over it, 1.04\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/builder/gpu_offload.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6124258a4818d2498076fcc388f80f9f1e067f99dc3cac9a2f9eb63a130d2c9f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/compiler_interface.rs: FileTooLong \u2014 520 significant 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 85% of them inside a single declaration: CompilerInterface (2 blocks, 76-895). The bar is 500 significant lines; this is 20 over it, 1.04\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_public/src/compiler_interface.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f26fd5c5c7c7e535283550dcd80aa8ad6d7d4a55af642d3a225392c88a796ea9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: fs/uefi.rs: FileTooLong \u2014 520 significant 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 20 over it, 1.04\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/fs/uefi.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcc3429ac06484300250ae2a8fcae1593cc198941c1170b35ce614f3d8c76d99"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustc_mir_transform::coroutine::by_move_body::coroutine_by_move_body_def_id: FunctionTooLong \u2014 rustc_mir_transform::coroutine::by_move_body::coroutine_by_move_body_def_id runs 104 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/coroutine/by_move_body.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"98dd170f989d9b323ee6c9c9c62e99c95d6e0c470c61cc9d7ef34b48bbe16191"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PathSource.is_expected: MethodTooLong \u2014 is_expected runs 104 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/late.rs"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"85b9204ebba62c1d5f4eea3c7cdd1479d7a6ae164194ff4c589ba98a34f88cf9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WfPredicates.visit_const: MethodTooLong \u2014 visit_const runs 104 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/traits/wf.rs"},"region":{"startLine":1139}}}],"partialFingerprints":{"codehealthFindingId/v1":"dacd6ef32c67da09efeae14b8d1ac6bdb5ba7d6e455428dbad38f5fa2f8971b7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: core::num::imp::flt2dec::strategy::grisu::format_shortest_opt: FunctionTooLong \u2014 core::num::imp::flt2dec::strategy::grisu::format_shortest_opt runs 104 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/num/imp/flt2dec/strategy/grisu.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"e11e8f63790e8f2cf8acf2ae0bd0e0de955cb8fe302457c07b268dd609061ddd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: clippy_lints::methods::needless_collect::check: FunctionTooLong \u2014 clippy_lints::methods::needless_collect::check runs 104 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/methods/needless_collect.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"33a53bbcd648af170face0664523b7a99291f264fb1cbc6e7ff0e5adee6316a9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ide_completion::context::analysis::analyze: FunctionTooLong \u2014 ide_completion::context::analysis::analyze runs 104 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-completion/src/context/analysis.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"5167fae28ad07451dba7699b564d6acd4dfbd490f041901ebe1d6870cd8bf66f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GlobalState.current_status: MethodTooLong \u2014 current_status runs 104 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/reload.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd41820acd71b080f6d43aebb532ca5501479f4b9e758aedf150faf29c13884c"}},{"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":"src/tools/miri/priroda/src/debugger.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"a95806d3902b99b9f15fbfc72e605f6ea09f0b42474a21e2a2f050a31a1f9be0"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: AsciiChar: 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), 24 methods, 4 blocks, lines 61-1236. 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":"library/core/src/ascii/ascii_char.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9522c16954145c6c8cff0b130f3b3f9f4e70674bfc8b450f332fdb764152755"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/consts.rs: FileTooLong \u2014 518 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 67% of them inside a single declaration: CodegenCx (2 blocks, 283-925). The bar is 500 significant lines; this is 18 over it, 1.04\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/consts.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"119ca6b02aa64fe6cbe2cbba63f418fc3885c27ab7f0d06905ad5f74f0730974"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lexical_region_resolve/mod.rs: FileTooLong \u2014 518 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 81% of them inside a single declaration: LexicalResolver (2 blocks, 132-954). The bar is 500 significant lines; this is 18 over it, 1.04\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_infer/src/infer/lexical_region_resolve/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a42d8ce55287d9e893d5dbca6e030ca442e11794ca7bf46cef844b445bbfab6d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Body: TooManyMethods \u2014 31 methods. The bar is 30 methods; this is 1 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/mir/mod.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"f02e98ddca4f61151de0ec996a5a0457b65cb80f0c8c65dfae0aaa9f346fe33a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Lexer: TooManyMethods \u2014 31 methods, declared across 2 files: lexer/mod.rs (24), lexer/tokentrees.rs (7). The bar is 30 methods; this is 1 over it, 1.03\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/lexer/mod.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"e517c5ba6edd59a35a16fb40d0c0e43d5139f7ca6e2c6254bb2324c931399486"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: core::intrinsics::mir: TooManyFunctions \u2014 31 free functions. The bar is 30 free functions; this is 1 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/intrinsics/mir.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5a5f55e0bdc0428d2c9385bd2315c94bb60d22379435014e7c0a56ec79170f4"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TcpStream: TooManyMethods \u2014 31 methods. The bar is 30 methods; this is 1 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/net/connection/uefi/mod.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"c776d9bc3a1437386a7cd9831d7d7d9271361105cc68c3cef2d47d76130aefb5"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: core_arch::aarch64::neon: TooManyFunctions \u2014 31 free functions. The bar is 30 free functions; this is 1 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/aarch64/neon/mod.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dad22e1838ad01eabefb15a41513336ca775f9ed6b96151c751e25cc57d34d0"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: clippy_utils::source: TooManyFunctions \u2014 31 free functions. The bar is 30 free functions; this is 1 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_utils/src/source.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c88a09892b48b8f8601e7ef964f09aa5df3486cb28fcbfdf74070b4a32b58d8"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Ctx: TooManyMethods \u2014 31 methods, declared across 2 files: item_tree/lower.rs (30), item_tree/attrs.rs (1). The bar is 30 methods; this is 1 over it, 1.03\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/item_tree/lower.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"d33e69050b79ed5c31cf59518dad8529a33a32376e634c6c2bd9b00a891f26d3"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: ModuleConfig: TooManyFields \u2014 31 stored fields beside 3 methods. The bar is 30 stored fields; this is 1 over it, 1.03\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":"compiler/rustc_codegen_ssa/src/back/write.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2f77b94604745017be26f3abe63524d6fc84be7329b33162f52a4558174ce78"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: ARM64_NT_CONTEXT_0_0: TooManyFields \u2014 31 stored fields. The bar is 30 stored fields; this is 1 over it, 1.03\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":"library/std/src/sys/pal/windows/c/windows_sys.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"f41037c14898539185d3ce7366c6efc50809a26c849f5ca26b68b4079c14309e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: ARM64_NT_CONTEXT_0_0: TooManyFields \u2014 31 stored fields. The bar is 30 stored fields; this is 1 over it, 1.03\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":"library/std/src/sys/pal/windows/c/windows_sys.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"c679b7d10b1818dfd6cc724c54f10954c80b006c9c2aae5241309cfd38bf83b5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: infer/unify.rs: FileTooLong \u2014 516 significant 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 16 over it, 1.03\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/infer/unify.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"638cbbcfa220b7b7adf7fb3159fbc8101d8a2ab039c96980699fbc6118c4fd78"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: GlobalState: ClassTooLong \u2014 412 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 51 methods, 3 blocks, lines 84-821. The bar is 400 significant lines; this is 12 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/global_state.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5b3cbd3beec0ab004a2ce119e555aee90970253eef65f800f90ae4d66e66081"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/constructor.rs: FileTooLong \u2014 515 significant 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 15 over it, 1.03\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_pattern_analysis/src/constructor.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fa77957a85dc48f59228287f58fd3a0019a7c35659f2a15a9b581c97d539c43"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LoweringContext.lower_impl_item: MethodTooLong \u2014 lower_impl_item runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ast_lowering/src/item.rs"},"region":{"startLine":1064}}}],"partialFingerprints":{"codehealthFindingId/v1":"83abac17c9aa2f1aa669e3511d750e30e2fef4e87759d2834c6703467a13765a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Context.manage_cond_expr: MethodTooLong \u2014 manage_cond_expr runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_builtin_macros/src/assert/context.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dfb2798471a37878dd6bbf0e3abaa49e092165f77101742f13034078ff8750a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CPlace.write_cvalue_maybe_transmute: MethodTooLong \u2014 write_cvalue_maybe_transmute runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/src/value_and_place.rs"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc1301be5050f71ba53714712a355f0208af5a2d2044b5ae688dbe7869aff19b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DiagCtxtInner.emit_diagnostic: MethodTooLong \u2014 emit_diagnostic runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_errors/src/lib.rs"},"region":{"startLine":1145}}}],"partialFingerprints":{"codehealthFindingId/v1":"76c92e2021eb224756a9707f5fbe348b5bd7606e28a857b594c6531ac9201646"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustc_hir_analysis::check::compare_impl_item::report_trait_method_mismatch: FunctionTooLong \u2014 rustc_hir_analysis::check::compare_impl_item::report_trait_method_mismatch runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/check/compare_impl_item.rs"},"region":{"startLine":1001}}}],"partialFingerprints":{"codehealthFindingId/v1":"e68cc34e0a3bc870ca91cf0a4cec76124d09af32f33f9276a596fcfabc5c215a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: V0SymbolMangler.print_const: MethodTooLong \u2014 print_const runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_symbol_mangling/src/v0.rs"},"region":{"startLine":771}}}],"partialFingerprints":{"codehealthFindingId/v1":"a15ad36f50b19267c582b35ab32882937e0cb38b76f629722c62eb2e1caceb1f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: compiler_builtins::float::add::add: FunctionTooLong \u2014 compiler_builtins::float::add::add runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/compiler-builtins/compiler-builtins/src/float/add.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"50673de5431caf4ffe96296ac96b582d5f3c0283ae71cefc20b7061ef7a0992f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: bootstrap::core::build_steps::compile::run_cargo: FunctionTooLong \u2014 bootstrap::core::build_steps::compile::run_cargo runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/build_steps/compile.rs"},"region":{"startLine":2678}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9187d41798c5ca342e89f3cbe042eead6c40d06a8fea2d2626ec2a7ac4a3ab2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: OmpOffload.run: MethodTooLong \u2014 run runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/build_steps/llvm.rs"},"region":{"startLine":1336}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc4dd32077ebf2cd418dc499e4775844b8dd50cd3b28578d9d43584a6eb9d230"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: clippy_lints::matches::match_single_binding::check: FunctionTooLong \u2014 clippy_lints::matches::match_single_binding::check runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/matches/match_single_binding.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"8127101a2de9a6d90d821b7795763699d2f81b08dbe1d1de0a2c3c6a7262238b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: clippy_lints::needless_borrows_for_generic_args::needless_borrow_count: FunctionTooLong \u2014 clippy_lints::needless_borrows_for_generic_args::needless_borrow_count runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/needless_borrows_for_generic_args.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"467aaa2f5634b28948a568c2c059051e59e160fc9697451de26d86b9944bc9f9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ExpressionStoreBuilder.finish: MethodTooLong \u2014 finish runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/expr_store.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6ae3e55cb44c87d12f285170f0956fa6f22953cbc250989eed0b9dfcaf81aab"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: InferenceContext.resolve_all: MethodTooLong \u2014 resolve_all runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/infer.rs"},"region":{"startLine":1644}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bd778624504c4dcdcd0c94963fd08093641594c82e57c4792bf0032e48716aa"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TyLoweringContext.lower_ty_ext: MethodTooLong \u2014 lower_ty_ext runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/lower.rs"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"aadb0ff5076954d3d21b94e7e67f8f517da652cc554eda2f5aa36ff9ad3e14bc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ProjectFolders.new: MethodTooLong \u2014 new runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/load-cargo/src/lib.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d31e09d50cd5cf35ae41bc5889c13e1a57905498307879a5a4b8f679d4bcb61"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: parser/token_type.rs: FileTooLong \u2014 514 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 68% of them inside a single declaration: TokenType (2 blocks, 19-424). The bar is 500 significant lines; this is 14 over it, 1.03\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/token_type.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ec76cf3960a9378a573cf4688de025f3e34995061f0419be63d87689de7c937"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: attr/mod.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). The bar is 500 significant lines; this is 13 over it, 1.03\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ast/src/attr/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2c9ec96d6d3816b214b6af13b7f551493ab9ca3dca1c3c36996f010cb869d19"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mir/terminator.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). The bar is 500 significant lines; this is 13 over it, 1.03\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/mir/terminator.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"87cfbf2d1eda9b88339d23d9c44d68fc7411af3fa5fe06bb7c1676da82d23fab"}},{"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":"src/tools/miri/priroda/src/debugger.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a31df2d1c0ac285a9280b701f882cce3c0b17c31f7a527c0d8bc415ed99cd5b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: itanium_cxx_abi/encode.rs: FileTooLong \u2014 512 significant 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 12 over it, 1.02\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_sanitizers/src/cfi/typeid/itanium_cxx_abi/encode.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb053814df3c07e67b57e8b7e601f13e0a4c3b9830d42f319aa84e4f791c71de"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/matching.rs: FileTooLong \u2014 511 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 72% of them inside a single declaration: Matcher (2 blocks, 100-649). The bar is 500 significant lines; this is 11 over it, 1.02\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/tools/rust-analyzer/crates/ide-ssr/src/matching.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"39ef4a2a7c33cf5c72b37490e685ab854fdcd9c86f99d63499079ebf33bc4917"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ConstEvalCtxt: ClassTooLong \u2014 408 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 20 methods, 2 blocks, lines 559-1144. The bar is 400 significant lines; this is 8 over it, 1.02\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/tools/clippy/clippy_utils/src/consts.rs"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"b783980477d6a96e58dfbe426a4e4dee6dd952cdef6b563cb62a243c7c47a958"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: AutoTraitFinder: ClassTooLong \u2014 408 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 11 methods, 2 blocks, lines 48-936. The bar is 400 significant lines; this is 8 over it, 1.02\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":"compiler/rustc_trait_selection/src/traits/auto_trait.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ef2eb1f39dbb0fdb02a67e5d4e9b19d92a63840c8447c791768cb1de0c49fd7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: debuginfo/type_names.rs: FileTooLong \u2014 510 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 10 over it, 1.02\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/debuginfo/type_names.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bbb9ca75b3adfaa4734d5f1bbfde7ae39d3be3ebe47687171db462999649a02"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: render/context.rs: FileTooLong \u2014 510 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 82% of them inside a single declaration: Context (4 blocks, 49-809). The bar is 500 significant lines; this is 10 over it, 1.02\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/librustdoc/html/render/context.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"64cab882be69ff4c479776856f134c58ac87fa0d0cf70ac5c38b26d8fa8d96f3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LoweringContext.destructure_assign_mut: MethodTooLong \u2014 destructure_assign_mut runs 102 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ast_lowering/src/expr.rs"},"region":{"startLine":1321}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5e09f59d7dc61026f8d2ef6b7281357187e2e2be852217332542a4f50581560"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LoweringContext.lower_expr_for: MethodTooLong \u2014 lower_expr_for runs 102 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ast_lowering/src/expr.rs"},"region":{"startLine":1775}}}],"partialFingerprints":{"codehealthFindingId/v1":"387cde18eff3c9ae9ece34e68c5d96b8540a562dd98b627ed9a4dbbbf9988566"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: InherentOverlapChecker.check_item: MethodTooLong \u2014 check_item runs 102 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/coherence/inherent_impls_overlap.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"7768c047a47ab70cdc5ee5d1bebde4f1f429a411fe5ad30db8b31fb379638597"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ExprUseVisitor.walk_expr: MethodTooLong \u2014 walk_expr runs 102 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/expr_use_visitor.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b718266254daf73acf778eb532596f4bd296ae897086ed3e5b98973d3491621"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FnCtxt.report_unexpected_variant_res: MethodTooLong \u2014 report_unexpected_variant_res runs 102 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/lib.rs"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6720eaf7096ec8961d4a1747080c248f1b8a60488ac582bad13c9b51229d333"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Cursor.advance_token: MethodTooLong \u2014 advance_token runs 102 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_lexer/src/lib.rs"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f1eb7af574870187e913f93fbaac6e5a0a0fa6c6bc769695bf4675d90f39966"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustc_mir_transform::ref_prop::compute_replacement: FunctionTooLong \u2014 rustc_mir_transform::ref_prop::compute_replacement runs 102 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/ref_prop.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e764592abc18a128ec1622d3c2e11fe2145b2998c69a0f4a8e622ea9f1bc32d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EvalCtxt.normalize_opaque_type: MethodTooLong \u2014 normalize_opaque_type runs 102 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_next_trait_solver/src/solve/project_goals/opaque_types.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5557d34dcd49e54c6ce0f5cd4c53154e70b1ea1bf353108cfdb8cfa26806010"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypeErrCtxt.cmp_fn_sig: MethodTooLong \u2014 cmp_fn_sig runs 102 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/error_reporting/infer/mod.rs"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"81c88f9f911b05f3b65f743e03d84bb08a4db4c63dca08a549e79f4e0aa05a40"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AtHwcap.cache: MethodTooLong \u2014 cache runs 102 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std_detect/src/detect/os/linux/aarch64.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"af78a1d97b65465c7f3385c68e2e4360f6bc7b790c097bd806cabcc44273a611"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CI.run: MethodTooLong \u2014 run runs 102 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/build_steps/clippy.rs"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"6302ed2708da335d6ab83e8c0a1a51dbd9aa8c3413869c15221bc9559caef6a7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Checker.check_url: MethodTooLong \u2014 check_url runs 102 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/linkchecker/main.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5887f28b44e751b363a55f7edce5669af42c7b5e0156a444e442ef4e77ebd11"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CrateGraphBuilder.set_in_db: MethodTooLong \u2014 set_in_db runs 102 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/base-db/src/input.rs"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ac9c411e6c964f2e60d472153958b9a693a24f4a4408e42f174c0815921aeac"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ExprCollector.lower_type_ref: MethodTooLong \u2014 lower_type_ref runs 102 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/expr_store/lower.rs"},"region":{"startLine":746}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c739b37b8d90619af8643e9ee96df2888e581078d638c19eb7ac78d676f7b80"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: hir_ty::lower::resolve_type_param_assoc_type_shorthand: FunctionTooLong \u2014 hir_ty::lower::resolve_type_param_assoc_type_shorthand runs 102 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/lower.rs"},"region":{"startLine":2114}}}],"partialFingerprints":{"codehealthFindingId/v1":"41d6dd83b069c11dbdbf002e6e42202e54967a2f48003e36c22c98ce579c94e8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ide_assists::utils::gen_trait_fn_body::gen_debug_impl: FunctionTooLong \u2014 ide_assists::utils::gen_trait_fn_body::gen_debug_impl runs 102 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/utils/gen_trait_fn_body.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"77556d7b38cc97afb4308d8fd29e7a9203056d16bfec8acda752c90b7f8d5534"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ide::signature_help::signature_help_for_call: FunctionTooLong \u2014 ide::signature_help::signature_help_for_call runs 102 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/signature_help.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"de925259c1ae1211e7387849f9ea7e9e127d7823d68c654ae32608fc5e29c3f6"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: FileDesc: ClassTooLong \u2014 407 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 17 methods, 10 blocks, lines 60-712. The bar is 400 significant lines; this is 7 over it, 1.02\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":"library/std/src/sys/fd/unix.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5e41c6c17c94ee2155ceaedaeeb91d3656f37781d8a065571855c3127189562"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: UnsafetyVisitor: ClassTooLong \u2014 407 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 6 methods, 3 blocks, lines 21-620. The bar is 400 significant lines; this is 7 over it, 1.02\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":"compiler/rustc_mir_build/src/check_unsafety.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"a92d583c568c92d98db939a3dcf7a16e47aaa07132e3578fff8c0ea27ee78754"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: decoder/cstore_impl.rs: FileTooLong \u2014 508 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 8 over it, 1.02\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_metadata/src/rmeta/decoder/cstore_impl.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e254c91f54292d7363fab93bc052f88381ce8dc86d374f3edbb486c90d1a223d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 508 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 8 over it, 1.02\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f182b8efe809c722f961ac3803b930bb80d194d2dad9676a1d0b9be3f3a6ee4a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/manual_clamp.rs: FileTooLong \u2014 508 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 8 over it, 1.02\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/manual_clamp.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cf0bf1f9bf701aa18343dab1b4cd073101bc1f0335520ea665fdd1c851fc859"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/runnables.rs: FileTooLong \u2014 508 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 8 over it, 1.02\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/runnables.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f42887bed67e33fa8c0f7f91a27c3f0cebb6b47c888584f102690457a9a66fc3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: syntax_editor/edit_algo.rs: FileTooLong \u2014 508 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 8 over it, 1.02\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/syntax/src/syntax_editor/edit_algo.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a689ec00095ce21d542d6355583d7f384b1e3364734a788301680ae2d0c00e8"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: LintLevelsBuilder: ClassTooLong \u2014 406 significant 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, 5 blocks, lines 292-997. The bar is 400 significant lines; this is 6 over it, 1.02\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":"compiler/rustc_lint/src/levels.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"31037df1def066cf28de99387c88b522e2f6483f4b2bffc9ee6734252ce504c6"}},{"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/tools/miri/src/concurrency/genmc/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb27aca51697c15c226a53daba0803196c8f238a62b4bacdf2fae2c4f0de7d70"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: diagnostics/decl_check.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 83% of them inside a single declaration: DeclValidator (2 blocks, 125-776). 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/tools/rust-analyzer/crates/hir-ide/src/diagnostics/decl_check.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c47730332d707367d5c4b09182ea8604fd40397a7e5e8f16978f3f5d0567f647"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Socket: ClassTooLong \u2014 405 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 48 methods, 9 blocks, lines 32-666. The bar is 400 significant lines; this is 5 over it, 1.01\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":"library/std/src/sys/net/connection/socket/unix.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb9cd38de802895d8b591df61207d0dd652d65250046928d4b9ba5d69a521678"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: attrs/docs.rs: FileTooLong \u2014 506 significant 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 6 over it, 1.01\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/attrs/docs.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc5edff487b4b9506e2637615afa242943af74f33fb25bc990bc450f6ce14d7d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: handlers/generate_delegate_trait.rs: FileTooLong \u2014 506 significant 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 6 over it, 1.01\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_delegate_trait.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e46a5aeda2d7bf0df925d3abf21e5c1308fe6e03a4eed1585bcaf12ad16423ba"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/diagnostics.rs: FileTooLong \u2014 505 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 5 over it, 1.01\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ast_lowering/src/diagnostics.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f8d0d334aa0dd18896f476e353c67e469b9cc9ff66612e07978b702a01a0fcf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: region_constraints/mod.rs: FileTooLong \u2014 505 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 5 over it, 1.01\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_infer/src/infer/region_constraints/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6820ee9c881f6bc201233a30b82ccab34226ab4931945da288ae7b8057ca86dc"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustc_attr_parsing::check_cfg::unexpected_cfg_value: FunctionTooLong \u2014 rustc_attr_parsing::check_cfg::unexpected_cfg_value runs 101 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_attr_parsing/src/check_cfg.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"68fce56ffca88441e3ead89ff5ed85c0672bf73fa720be2d1b5519e1e9d1b102"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustc_codegen_gcc::back::write::codegen: FunctionTooLong \u2014 rustc_codegen_gcc::back::write::codegen runs 101 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_gcc/src/back/write.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e65858e18a48d48cc0a3eddba4d050a9d0baada93eb48905e3bbe75d3e18691"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustc_hir_analysis::diagnostics::remove_or_use_generic::suggest_to_remove_or_use_generic: FunctionTooLong \u2014 rustc_hir_analysis::diagnostics::remove_or_use_generic::suggest_to_remove_or_use_generic runs 101 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/diagnostics/remove_or_use_generic.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff9016b5821e9e8083b63eacba590b88026073d04ac0efb5564728bba46b4183"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LintLevelsBuilder.add_hir_inner: MethodTooLong \u2014 add_hir_inner runs 101 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_lint/src/levels.rs"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce8d7f5b3511689030abdfe504536d74f173b4c339284ff1309248f91bdad7c7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustc_metadata::dependency_format::calculate_type: FunctionTooLong \u2014 rustc_metadata::dependency_format::calculate_type runs 101 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_metadata/src/dependency_format.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"d96ee81cff7c58e669bb97d7af67f3033f3388cdabda6a08d0197ff9e5dc9520"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Builder.build_binary_op: MethodTooLong \u2014 build_binary_op runs 101 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_build/src/builder/expr/as_rvalue.rs"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eab063ed15eb75c731f365fa1d642fa88fb1362e3b09873d3645ba030caa4aa"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Validator.validate_rvalue: MethodTooLong \u2014 validate_rvalue runs 101 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/promote_consts.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac4feb80c0b793e71e491eb9f46774c75092e5335a4c12bc8fb531b7edff4bf3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NiceRegionError.try_report_placeholder_conflict: MethodTooLong \u2014 try_report_placeholder_conflict runs 101 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/error_reporting/infer/nice_region_error/placeholder_error.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cb77fba6501af3c8c84d21a6d6d0d8d90ec1a6e2a81b620ea6b05676be48fdd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustdoc::html::render::print_item::print_item: FunctionTooLong \u2014 rustdoc::html::render::print_item::print_item runs 101 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/render/print_item.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4ad744431e813e4bf5f71fe973136aa83c35203c0205b75b11b0aad3c301c2c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Printer.print_pat: MethodTooLong \u2014 print_pat runs 101 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/expr_store/pretty.rs"},"region":{"startLine":896}}}],"partialFingerprints":{"codehealthFindingId/v1":"b851a5b6fb4d8882873d24e509baf5d675f0ddc306c24fdfb726acc06eb8f353"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: hir_ide::display::render_const_scalar_from_valtree_inner: FunctionTooLong \u2014 hir_ide::display::render_const_scalar_from_valtree_inner runs 101 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ide/src/display.rs"},"region":{"startLine":1094}}}],"partialFingerprints":{"codehealthFindingId/v1":"2791cb934013aa0806315be78023d53aeb7e7bdd84fd4c80d89d528a31a25bff"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: hir_ide::display::write_bounds_like_dyn_trait: FunctionTooLong \u2014 hir_ide::display::write_bounds_like_dyn_trait runs 101 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ide/src/display.rs"},"region":{"startLine":2099}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf3549acc35e18d7b8a657e732c2c714e3f05623a7698282ac029fe460669605"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: InferenceContext.compute_min_captures: MethodTooLong \u2014 compute_min_captures runs 101 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/infer/closure/analysis.rs"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"261f28a3c73c85e421bacad661497f1eb2bbbd41379fe1b66658a337138232e4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: hir_ty::infer::coerce::coerce: FunctionTooLong \u2014 hir_ty::infer::coerce::coerce runs 101 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/infer/coerce.rs"},"region":{"startLine":1443}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8b3b56d6b42ccfaaca5edf64384cb2ea083c5347cfdaea0ccdd3fa562a0306a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: InferenceContext.infer_mut_expr_without_adjust: MethodTooLong \u2014 infer_mut_expr_without_adjust runs 101 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/infer/mutability.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ccc51b9f53f206db02fbbae08bcb86a5bb446d8385cb00db0d04c312f85035d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: InferenceContext.infer_pat_inner: MethodTooLong \u2014 infer_pat_inner runs 101 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/infer/pat.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"5464a34d6277079e0661f05931787969a85dc26245e19b0c0a07ad64e18e310a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ide_assists::handlers::add_turbo_fish::add_turbo_fish: FunctionTooLong \u2014 ide_assists::handlers::add_turbo_fish::add_turbo_fish runs 101 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/add_turbo_fish.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"a16f51c08437fa1da2f6328f3ada28063c76e6e2b1381bbe23ab36ec108683f7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: callconv/mod.rs: FileTooLong \u2014 504 significant 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 4 over it, 1.01\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_target/src/callconv/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"76740655d3b1d597c00c1e0a0bab78faa5c269e853eaf0abcff8e7799baf6e7a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/doc_links.rs: FileTooLong \u2014 504 significant 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 4 over it, 1.01\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/doc_links.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"48100105f0bb082bf37a75f0eb6e5057cb84d2dd08253803cbc470f93d4de627"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 504 significant 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 4 over it, 1.01\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/load-cargo/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"904e3fa993376b81005406db2c984630e66cfa031794558757d4c678adada6b1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: attributes/link_attrs.rs: FileTooLong \u2014 502 significant 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 2 over it, 1.00\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":"compiler/rustc_attr_parsing/src/attributes/link_attrs.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f24d0f8ecc95c8ed288a056cfa9ecbc8ee13116951336cd74bb35ce352ce2e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (4 members, 22 shared lines): library/stdarch/crates/core_arch/src/x86/avx2.rs:2787-2839 | library/stdarch/crates/core_arch/src/x86/avx2.rs:2994-3046 | library/stdarch/crates/core_arch/src/x86/avx512bw.rs:11865-11950 | library/stdarch/crates/core_arch/src/x86/avx512bw.rs:11961-12046 \u2014 These 4 members are variants of one another: a block of 22 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx2.rs"},"region":{"startLine":2787}}}],"partialFingerprints":{"codehealthFindingId/v1":"094e5f2aec9c34bf742e38fa4b36af4e6e2dcfdc374ff3561d7d344dca15b507"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (4 members, 21 shared lines): library/stdarch/crates/core_arch/src/x86/avx2.rs:2787-2839 | library/stdarch/crates/core_arch/src/x86/avx2.rs:2994-3046 | library/stdarch/crates/core_arch/src/x86/avx512bw.rs:11961-12046 | library/stdarch/crates/core_arch/src/x86/sse2.rs:703-734 \u2014 These 4 members are variants of one another: a block of 21 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx2.rs"},"region":{"startLine":2787}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d69197599c7435acff6373fc69390d64dfe6c2c2dd83250a2871e00cb20dc87"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (4 members, 17 shared lines): library/compiler-builtins/libm/src/math/j0.rs:285-314 | library/compiler-builtins/libm/src/math/j0f.rs:222-251 | library/compiler-builtins/libm/src/math/j1.rs:277-306 | library/compiler-builtins/libm/src/math/j1f.rs:221-250 \u2014 These 4 members are variants of one another: a block of 17 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/compiler-builtins/libm/src/math/j0.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b585ef684ebb96998a9ee04f0f8357b134ad463c9cdca2db151542e2f0d5b4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (4 members, 17 shared lines): library/compiler-builtins/libm/src/math/j0.rs:397-426 | library/compiler-builtins/libm/src/math/j0f.rs:334-363 | library/compiler-builtins/libm/src/math/j1.rs:389-418 | library/compiler-builtins/libm/src/math/j1f.rs:333-362 \u2014 These 4 members are variants of one another: a block of 17 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/compiler-builtins/libm/src/math/j0.rs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c9204336274f86213325cfb9ac39a8ff5144887494936e2ba047813c8bb35fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (4 members, 15 shared lines): library/stdarch/crates/core_arch/src/x86/avx512f.rs:25092-25121 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:25175-25196 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:25396-25425 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:25479-25500 \u2014 These 4 members are variants of one another: a block of 15 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":25092}}}],"partialFingerprints":{"codehealthFindingId/v1":"05b1475c99311d0453ac3f0763369dde9f0cc5a1a41172bc2ac286bfb0841de2"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (4 members, 12 shared lines): library/stdarch/crates/core_arch/src/x86/avx512f.rs:25092-25121 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:25250-25271 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:25396-25425 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:25554-25575 \u2014 These 4 members are variants of one another: a block of 12 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":25092}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a75eb6dfea070f5b5e733b384c6425c2aaa55433ae6d231be8d78fa04b27ce4"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (3 members, 9 shared lines): library/stdarch/crates/core_arch/src/x86/avx512f.rs:22821-22847 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:24619-24646 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:24780-24806 \u2014 These 3 members are variants of one another: a block of 9 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 3 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 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":22821}}}],"partialFingerprints":{"codehealthFindingId/v1":"cebcc60dc4eeba8b180d38b111b706e16cc546973673df00c92291ef79a71e5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (107 shared lines): compiler/rustc_builtin_macros/src/format.rs:174-705 | src/tools/rust-analyzer/crates/hir-def/src/hir/format_args.rs:181-450 \u2014 These two members are variants of one another: 107 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_builtin_macros/src/format.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"68feecbcc32f320109bf91c92d9f82abd8a91ff9811d1f86613da3c9ee3f8965"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (91 shared lines): library/compiler-builtins/libm/src/math/lgamma_r.rs:171-323 | library/compiler-builtins/libm/src/math/lgammaf_r.rs:106-258 \u2014 These two members are variants of one another: 91 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/compiler-builtins/libm/src/math/lgamma_r.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"80854f9fd9f39318582b4cdcf0a46dfdc034e791965fcc2eb0f71edf355d9d60"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (88 shared lines): compiler/rustc_target/src/callconv/loongarch.rs:288-395 | compiler/rustc_target/src/callconv/riscv.rs:293-401 \u2014 These two members are variants of one another: 88 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_target/src/callconv/loongarch.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d733ab6ba5c1f18255a1ebcd405752a0743c5a6237db4145de333ae00e48712"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (85 shared lines): compiler/rustc_ast_lowering/src/format.rs:285-537 | src/tools/rust-analyzer/crates/hir-def/src/expr_store/lower/format_args.rs:114-419 \u2014 These two members are variants of one another: 85 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ast_lowering/src/format.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"e07fcbc47fc73486b441e0a6f8ac741f9370e68403649ab815915d7a50084a31"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (77 shared lines): compiler/rustc_codegen_llvm/src/asm.rs:1177-1371 | compiler/rustc_codegen_llvm/src/asm.rs:1380-1555 \u2014 These two members are variants of one another: 77 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/asm.rs"},"region":{"startLine":1177}}}],"partialFingerprints":{"codehealthFindingId/v1":"c62bc53980edb0290be84f3e8bd9492f0c4132fce58115d8e4873a6b1a0abf75"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (62 shared lines): src/librustdoc/passes/lint/redundant_explicit_links.rs:195-300 | src/librustdoc/passes/lint/redundant_explicit_links.rs:313-435 \u2014 These two members are variants of one another: 62 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/passes/lint/redundant_explicit_links.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"659e7141dc569f973c2181a2b44202050d36d3cc706890d138dd73180c555851"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (50 shared lines): compiler/rustc_codegen_llvm/src/intrinsic.rs:1334-1502 | compiler/rustc_codegen_llvm/src/intrinsic.rs:1510-1593 \u2014 These two members are variants of one another: 50 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/intrinsic.rs"},"region":{"startLine":1334}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc726fc32ad10d1b3c1bcc13e17e5a00c91d62605e5c507cf4f2c1ed7241169b"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (46 shared lines): library/std/src/sys/process/unix/common.rs:499-578 | library/std/src/sys/process/unsupported.rs:139-198 \u2014 These two members are variants of one another: 46 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/process/unix/common.rs"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"50610aee9c5b76f6ef8b5693113074b581fe96c3faec61edc414fb2d3a439f11"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (43 shared lines): compiler/rustc_trait_selection/src/traits/auto_trait.rs:550-642 | src/librustdoc/clean/auto_trait.rs:230-376 \u2014 These two members are variants of one another: 43 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/traits/auto_trait.rs"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cfb6bfb0b16a13b42e3224a7a0ad5aa0b3b6d4eb0788ba923a4cf6173cd3618"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (43 shared lines): compiler/rustc_trait_selection/src/solve/fulfill/derive_errors.rs:424-557 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/errors.rs:535-681 \u2014 These two members are variants of one another: 43 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/solve/fulfill/derive_errors.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"2613ccc8dda43d3bf24a16fb0ad132422b9e664bb5a059f7f94618fd634a78c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (41 shared lines): src/tools/rust-analyzer/crates/hir/src/term_search/tactics.rs:411-508 | src/tools/rust-analyzer/crates/hir/src/term_search/tactics.rs:603-687 \u2014 These two members are variants of one another: 41 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir/src/term_search/tactics.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9c37d34f7ff881f8d2e41f594868c9617cc9cf30438429464f533b8ba4a31b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (36 shared lines): library/std/src/sys/net/connection/xous/tcplistener.rs:47-107 | library/std/src/sys/net/connection/xous/udp.rs:36-108 \u2014 These two members are variants of one another: 36 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/net/connection/xous/tcplistener.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"afe5077f6ec4cd4e698928114b95e9070c52afa162a2174b55b738a13609c3f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (34 shared lines): library/std/src/sys/pal/uefi/helpers.rs:136-188 | library/std/src/sys/pal/uefi/helpers.rs:190-242 \u2014 These two members are variants of one another: 34 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/pal/uefi/helpers.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"521257afcc709598286c4863dc82da1a277ff121164058d7eb6aee5f13da7148"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (26 shared lines): compiler/rustc_middle/src/query/keys.rs:409-462 | compiler/rustc_middle/src/ty/print/mod.rs:307-354 \u2014 These two members are variants of one another: 26 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/query/keys.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dcccfcf56074e3d57a6a511fae269386b6f0b996f72df296dfd68363f86ee69"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (19 shared lines): src/tools/rust-analyzer/crates/hir-ty/src/consteval.rs:133-184 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/ty.rs:690-719 \u2014 These two members are variants of one another: 19 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/consteval.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f0349a06b04062e0335a754fb69d513f03bcd209283d4ca433151e81b63cd77"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): src/tools/rust-analyzer/crates/proc-macro-srv/src/token_stream.rs:697-731 | src/tools/rust-analyzer/crates/tt/src/lib.rs:435-484 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/proc-macro-srv/src/token_stream.rs"},"region":{"startLine":697}}}],"partialFingerprints":{"codehealthFindingId/v1":"61f7d8a125f3e60f745f4dc1889ecb2c1bcdb8f60ff9c52f838d4e1ee2f126b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (39 corresponding lines): library/core/src/slice/sort/shared/smallsort.rs:423-461 | library/core/src/slice/sort/shared/smallsort.rs:472-530 \u2014 These two members are one piece of code written twice and then edited apart: 39 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/slice/sort/shared/smallsort.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd6ac520c733c2bc6b4a86844159bbc5e5e5d05fc96733ab8740fd12749aada5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512bw.rs:8866-8895 | library/stdarch/crates/core_arch/src/x86/avx512bw.rs:9136-9165 \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":"library/stdarch/crates/core_arch/src/x86/avx512bw.rs"},"region":{"startLine":8866}}}],"partialFingerprints":{"codehealthFindingId/v1":"abbb90e6f0e6e5ed1b79317500d50039ce9c1c2eea50866a44f86a28964e1721"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512f.rs:28967-28986 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:29113-29130 \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":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":28967}}}],"partialFingerprints":{"codehealthFindingId/v1":"2290b20d6372944a4b7cc0c780adc5b94d9e19c44e559cbcbc92da981938def8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): src/tools/miri/priroda/src/frontend/dap.rs:488-531 | src/tools/miri/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":"src/tools/miri/priroda/src/frontend/dap.rs"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9a702f511f70c9a12aedab9b2b32769eb0f0c2c6bba192305bb8532f340a7b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512f.rs:26383-26416 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:26601-26632 \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":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":26383}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1701a6b892b1d459b758aeee088c14a230005d0ecac3007e09c16f6422ecdfc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx2.rs:345-366 | library/stdarch/crates/core_arch/src/x86/avx2.rs:377-407 \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":"library/stdarch/crates/core_arch/src/x86/avx2.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbfef0920df8ba9a87e679fa81c4bbd805980f6a97e5fd067e6bd19c7a1b953b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx2.rs:181-252 | library/stdarch/crates/core_arch/src/x86/ssse3.rs:111-160 \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":"library/stdarch/crates/core_arch/src/x86/avx2.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb5bc9d7042c61d46cc6765480e9c29225127834d641eba1da0c0533f2469d98"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): library/compiler-builtins/libm/src/math/j1.rs:165-198 | library/compiler-builtins/libm/src/math/j1f.rs:114-142 \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":"library/compiler-builtins/libm/src/math/j1.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"b55e0131250a1404ebae5c9a4d41a1bf8e0481897346b7a84bcea1a4ffb41dad"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): src/tools/rust-analyzer/crates/ide/src/interpret.rs:24-59 | src/tools/rust-analyzer/crates/ide/src/view_mir.rs:14-28 \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/tools/rust-analyzer/crates/ide/src/interpret.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fde7c471ca974aaf09099448cfb3d99a50f7309acc87f73acfe380abc94b8c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1568-1597 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1724-1743 \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/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs"},"region":{"startLine":1568}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6e7728da031df7dd008cdf4e3570cfae78874a23cc71afcf289bba0f6846d04"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512bw.rs:8735-8756 | library/stdarch/crates/core_arch/src/x86/avx512bw.rs:9005-9026 \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":"library/stdarch/crates/core_arch/src/x86/avx512bw.rs"},"region":{"startLine":8735}}}],"partialFingerprints":{"codehealthFindingId/v1":"823cbeace9c3670aa82021e58361e0c17803aee78b2c453600a825c0f02b104d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): compiler/rustc_infer/src/infer/at.rs:463-479 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/at.rs:237-253 \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":"compiler/rustc_infer/src/infer/at.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceffda6b4c54e8bd90417b5c4cfe8e6e98d84ab568ce709d5fdd8b801a350eb6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512dq.rs:1966-1977 | library/stdarch/crates/core_arch/src/x86/avx512dq.rs:2184-2196 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512dq.rs"},"region":{"startLine":1966}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa5e480a0bc8d1a583f6ca6d56d9a4dd0f0f7c136f3b4965f92f5dec9e0cb9fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): src/etc/debugger_tester/gdb/check_gdb.py:32-68 | src/etc/debugger_tester/lldb/check_lldb.py:39-80 \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/etc/debugger_tester/gdb/check_gdb.py"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e21fd69371afe6cf5ae9edb4e7d8ff9059dabdf6cb881daddcd648517e1c30f"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (19 members, 50\u002B identical tokens): src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:54-64 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:195-205 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:314-326 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:563-576 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:601-611 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1058-1068 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1083-1094 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1096-1109 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1115-1125 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1127-1137 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1139-1150 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1184-1196 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1217-1229 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1302-1312 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1359-1369 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1371-1385 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1506-1516 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:2231-2240 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:2280-2290 \u2014 These 19 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 19 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 19 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aa507234d49c8a1d1a00e01ad2ac0f899d8fcf1acf2f91e84014be19379c871"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (18 members, 50\u002B identical tokens): src/tools/miri/src/intrinsics/aarch64.rs:14-415 | src/tools/miri/src/intrinsics/x86/avx.rs:17-243 | src/tools/miri/src/intrinsics/x86/avx512.rs:233-266 | src/tools/miri/src/intrinsics/x86/gfni.rs:12-64 | src/tools/miri/src/intrinsics/x86/gfni.rs:78-127 | src/tools/miri/src/intrinsics/x86/mod.rs:306-326 | src/tools/miri/src/intrinsics/x86/mod.rs:336-354 | src/tools/miri/src/intrinsics/x86/mod.rs:515-557 | src/tools/miri/src/intrinsics/x86/mod.rs:581-603 | src/tools/miri/src/intrinsics/x86/mod.rs:864-896 | src/tools/miri/src/intrinsics/x86/mod.rs:910-943 | src/tools/miri/src/intrinsics/x86/mod.rs:1024-1056 | src/tools/miri/src/intrinsics/x86/mod.rs:1171-1199 | src/tools/miri/src/intrinsics/x86/mod.rs:1220-1249 | src/tools/miri/src/intrinsics/x86/mod.rs:1263-1287 | src/tools/miri/src/intrinsics/x86/mod.rs:1361-1387 | src/tools/miri/src/intrinsics/x86/mod.rs:1519-1539 | src/tools/miri/src/intrinsics/x86/sse41.rs:13-163 \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/tools/miri/src/intrinsics/aarch64.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce753ee1283e286b8f472da5af646a9baa116b6811db8f795b712783e975881e"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (10 members, 50\u002B identical tokens): src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:207-217 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:876-886 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:933-943 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:949-959 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:978-988 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1332-1344 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1346-1357 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1407-1421 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1456-1473 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1599-1610 \u2014 These 10 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 10 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 10 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8dad55914466ee6f31ef80162e3bc450b3f7888311a76aebf5ad1920f141c17"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (8 members, 50\u002B identical tokens): library/std/src/os/xous/ffi.rs:141-174 | library/std/src/os/xous/ffi.rs:241-275 | library/std/src/os/xous/ffi.rs:413-446 | library/std/src/os/xous/ffi.rs:459-493 | library/std/src/os/xous/ffi.rs:503-537 | library/std/src/os/xous/ffi.rs:540-577 | library/std/src/os/xous/ffi.rs:580-613 | library/std/src/os/xous/ffi.rs:623-658 \u2014 These 8 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 8 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 8 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/os/xous/ffi.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"250c9b66298880b0e7f345a278e65cda11e9ed94fb41efa236e525b3e28de58a"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (8 members, 50\u002B identical tokens): library/stdarch/crates/core_arch/src/x86/avx512fp16.rs:5668-5679 | library/stdarch/crates/core_arch/src/x86/avx512fp16.rs:5705-5716 | library/stdarch/crates/core_arch/src/x86/avx512fp16.rs:6183-6194 | library/stdarch/crates/core_arch/src/x86/avx512fp16.rs:6220-6231 | library/stdarch/crates/core_arch/src/x86/avx512fp16.rs:6689-6700 | library/stdarch/crates/core_arch/src/x86/avx512fp16.rs:6726-6737 | library/stdarch/crates/core_arch/src/x86/avx512fp16.rs:7203-7214 | library/stdarch/crates/core_arch/src/x86/avx512fp16.rs:7240-7251 \u2014 These 8 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 8 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 8 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512fp16.rs"},"region":{"startLine":5668}}}],"partialFingerprints":{"codehealthFindingId/v1":"a11f3674dd2afb0ba5748402371b48cffe57225c493d970a4611270876316128"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (7 members, 50\u002B identical tokens): src/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_blanket_trait_impl.rs:62-151 | src/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_default_from_new.rs:50-95 | src/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_delegate_methods.rs:54-238 | src/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_enum_is_method.rs:46-100 | src/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_enum_projection_method.rs:123-179 | src/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_impl.rs:14-29 | src/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_single_field_struct_from.rs:47-155 \u2014 These 7 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 7 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 7 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_blanket_trait_impl.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"760299674b5bb3dcac2d6f2008298632986d0597a9a689e893ac8a3c40f750ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): compiler/rustc_next_trait_solver/src/placeholder.rs:250-280 | compiler/rustc_next_trait_solver/src/placeholder.rs:282-312 | compiler/rustc_next_trait_solver/src/placeholder.rs:314-341 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/util.rs:632-667 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/util.rs:669-699 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/util.rs:701-728 \u2014 These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_next_trait_solver/src/placeholder.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"b639073ce6b924019bbe6967b3ac5e80c65ac626e0548a61e2b82fa37f3a8497"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): library/std_detect/src/detect/os/freebsd/arm.rs:16-36 | library/std_detect/src/detect/os/freebsd/powerpc.rs:14-29 | library/std_detect/src/detect/os/linux/arm.rs:7-34 | library/std_detect/src/detect/os/linux/mips.rs:7-23 | library/std_detect/src/detect/os/linux/powerpc.rs:17-45 | library/std_detect/src/detect/os/openbsd/powerpc.rs:17-32 \u2014 These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std_detect/src/detect/os/freebsd/arm.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aef0a96d7d97756ce41ee2f29c5192ba228501f743c3e45caf167d14402a7c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): library/stdarch/crates/core_arch/src/x86/avx512dq.rs:1450-1458 | library/stdarch/crates/core_arch/src/x86/avx512dq.rs:1635-1645 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:26473-26484 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:26538-26547 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:26689-26698 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:26752-26761 \u2014 These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512dq.rs"},"region":{"startLine":1450}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca3deb2c91ee4fb6ebd2184f89332a26c098eee69ea7a0016573cfabafd79e30"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): src/librustdoc/html/markdown.rs:1436-1464 | src/librustdoc/html/markdown.rs:1517-1548 | src/librustdoc/html/markdown.rs:1561-1595 | src/librustdoc/html/markdown.rs:1599-1629 | src/librustdoc/html/markdown.rs:1648-1703 | src/librustdoc/html/markdown.rs:1727-1746 \u2014 These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/markdown.rs"},"region":{"startLine":1436}}}],"partialFingerprints":{"codehealthFindingId/v1":"53bb93534991a8e9cc8612bceb8df71094e130deb42d5275f0e9a9b731a1f9d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:120-136 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:459-470 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:746-756 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:758-768 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:888-910 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:2006-2019 \u2014 These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2339405caf501647915ea6f4bd044ac1fe1be71dd695226c17dc7f597ec629f"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): library/std/src/sys/fs/unix.rs:1325-1347 | library/std/src/sys/fs/unix.rs:1349-1371 | library/std/src/sys/fs/unix.rs:1373-1407 | library/std/src/sys/fs/unix.rs:1409-1443 | library/std/src/sys/fs/unix.rs:1445-1467 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/fs/unix.rs"},"region":{"startLine":1325}}}],"partialFingerprints":{"codehealthFindingId/v1":"884f2bf746d94a6811f53ab588478920a219d46d65200e2363999e2014d213b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): library/stdarch/crates/core_arch/src/loongarch64/lasx/portable.rs:272-287 | library/stdarch/crates/core_arch/src/loongarch64/lasx/portable.rs:291-302 | library/stdarch/crates/core_arch/src/loongarch64/lasx/portable.rs:306-315 | library/stdarch/crates/core_arch/src/loongarch64/lsx/portable.rs:178-189 | library/stdarch/crates/core_arch/src/loongarch64/lsx/portable.rs:193-202 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/loongarch64/lasx/portable.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"975513009c62a14951a4d2caa5880f01b53df1ea5d2f61b99c073756d6992c79"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): src/tools/rust-analyzer/crates/ide/src/highlight_related.rs:311-388 | src/tools/rust-analyzer/crates/ide/src/highlight_related.rs:394-459 | src/tools/rust-analyzer/crates/ide/src/highlight_related.rs:494-584 | src/tools/rust-analyzer/crates/ide/src/highlight_related.rs:589-660 | src/tools/rust-analyzer/crates/ide/src/highlight_related.rs:790-821 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/highlight_related.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"d34ee195d911d2b4f58abba4455fcaa50bd9a53da95166b419613539e7d70e34"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs:71-88 | compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs:120-139 | compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs:147-169 | compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs:178-198 \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":"compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"543e13de31da850917689b3a000ab7eb9878dc60a4a9076806b9b1d163c1ccba"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): compiler/rustc_const_eval/src/interpret/stack.rs:515-599 | compiler/rustc_middle/src/ty/sty.rs:1955-2002 | compiler/rustc_next_trait_solver/src/solve/assembly/structural_traits.rs:125-196 | compiler/rustc_trait_selection/src/traits/select/mod.rs:2033-2087 \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":"compiler/rustc_const_eval/src/interpret/stack.rs"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"e65aec90a4c7b6a995a97af98dd87444cb8fba1c86448990e618ab8cf23c9b43"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): compiler/rustc_macros/src/type_foldable.rs:4-65 | compiler/rustc_type_ir_macros/src/lib.rs:134-213 | src/tools/rust-analyzer/crates/macros/src/lib.rs:92-157 | src/tools/rust-analyzer/crates/macros/src/lib.rs:207-240 \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":"compiler/rustc_macros/src/type_foldable.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d940633408b986e1d9996de76809990d9d12766443fb6745cee38de693a2b66"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): compiler/rustc_next_trait_solver/src/solve/assembly/structural_traits.rs:206-283 | compiler/rustc_next_trait_solver/src/solve/trait_goals.rs:768-852 | compiler/rustc_trait_selection/src/traits/effects.rs:353-446 | compiler/rustc_trait_selection/src/traits/select/mod.rs:2089-2169 \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":"compiler/rustc_next_trait_solver/src/solve/assembly/structural_traits.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"04a443d61393da40567b7d3d339ad5d2175604472793eae3c67ce6ccf59e58ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): compiler/rustc_next_trait_solver/src/solve/trait_goals.rs:544-564 | compiler/rustc_next_trait_solver/src/solve/trait_goals.rs:569-589 | compiler/rustc_next_trait_solver/src/solve/trait_goals.rs:594-612 | compiler/rustc_next_trait_solver/src/solve/trait_goals.rs:617-637 \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":"compiler/rustc_next_trait_solver/src/solve/trait_goals.rs"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"409c78230ec3cbb830a2d6244d026dc6ddd2f7034fa9d7337d6947249c42ccd6"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): compiler/rustc_passes/src/check_attr.rs:555-588 | compiler/rustc_passes/src/check_attr.rs:598-641 | compiler/rustc_passes/src/check_attr.rs:644-676 | compiler/rustc_passes/src/check_attr.rs:678-728 \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":"compiler/rustc_passes/src/check_attr.rs"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b7676a41e8431dee1ff4849b3b3a0ba74d6e2b4d93ee8128ea74d6c75f1150e"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): compiler/rustc_trait_selection/src/traits/project.rs:1393-1443 | compiler/rustc_trait_selection/src/traits/project.rs:1449-1490 | compiler/rustc_trait_selection/src/traits/project.rs:1496-1535 | compiler/rustc_trait_selection/src/traits/project.rs:1541-1588 \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":"compiler/rustc_trait_selection/src/traits/project.rs"},"region":{"startLine":1393}}}],"partialFingerprints":{"codehealthFindingId/v1":"02d6c66956f4969ab67f2e1be417ba49a44a27dad7e871fe3bc53deef5482cce"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): library/alloc/src/boxed.rs:1056-1071 | library/alloc/src/boxed.rs:1094-1109 | library/alloc/src/boxed.rs:1192-1207 | library/alloc/src/boxed.rs:1235-1250 \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":"library/alloc/src/boxed.rs"},"region":{"startLine":1056}}}],"partialFingerprints":{"codehealthFindingId/v1":"d816169235e0f02f475a88f751257aecf5ec714133f3e6e84143b57ae02823a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): library/core/src/num/imp/flt2dec/mod.rs:368-409 | library/core/src/num/imp/flt2dec/mod.rs:443-481 | library/core/src/num/imp/flt2dec/mod.rs:537-585 | library/core/src/num/imp/flt2dec/mod.rs:614-685 \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":"library/core/src/num/imp/flt2dec/mod.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf2654a095e380cb446615ee9e68ff7293184a63a3e1cb2bff331310bde39131"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): library/std/src/sync/nonpoison/rwlock.rs:674-687 | library/std/src/sync/nonpoison/rwlock.rs:899-912 | library/std/src/sync/poison/rwlock.rs:808-821 | library/std/src/sync/poison/rwlock.rs:1034-1047 \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":"library/std/src/sync/nonpoison/rwlock.rs"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf20fb75166e160222612b9d8d30044bdd8fd9b00d90e10359518af7aaeb6e3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): library/std/src/sys/env/hermit.rs:12-46 | library/std/src/sys/env/solid.rs:19-54 | library/std/src/sys/env/unix.rs:73-110 | library/std/src/sys/env/wasi.rs:38-72 \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":"library/std/src/sys/env/hermit.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a868a59511e1245fe0c158c51c4e3d81084a58e13b3e7f4bcd48af547da67d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): library/stdarch/crates/core_arch/src/x86/avx2.rs:937-953 | library/stdarch/crates/core_arch/src/x86/avx2.rs:981-997 | library/stdarch/crates/core_arch/src/x86/avx2.rs:1007-1023 | library/stdarch/crates/core_arch/src/x86/avx2.rs:1051-1067 \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":"library/stdarch/crates/core_arch/src/x86/avx2.rs"},"region":{"startLine":937}}}],"partialFingerprints":{"codehealthFindingId/v1":"0030324d75489e2f1ab5a3612c67ab492a4c4a285c255f1cb2e721742e1e2f7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): library/stdarch/crates/core_arch/src/x86/avx512f.rs:4193-4203 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:4445-4455 | library/stdarch/crates/core_arch/src/x86/avx512fp16.rs:7359-7369 | library/stdarch/crates/core_arch/src/x86/avx512fp16.rs:7422-7435 \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":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":4193}}}],"partialFingerprints":{"codehealthFindingId/v1":"488e257f341c9c521cd2cff51fcf59a50aef73b731b02ce9fa642586c5030c80"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): library/stdarch/crates/core_arch/src/x86/avx512f.rs:38028-38039 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:38110-38121 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:38192-38203 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:38274-38285 \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":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":38028}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dcd8a4c0d040e8e71ef7041b8de67b0f8f2a286a18da1e6a74ed829685a9025"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): library/stdarch/crates/core_arch/src/x86/avx512f.rs:38069-38080 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:38151-38162 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:38233-38244 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:38315-38326 \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":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":38069}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fb6b301d43bc88c0f969c8f35c06b46e9332c13bca796e5fa94b5d65a3f8ee2"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): library/stdarch/crates/core_arch/src/x86/avx512fp16.rs:1630-1641 | library/stdarch/crates/core_arch/src/x86/avx512fp16.rs:1971-1982 | library/stdarch/crates/core_arch/src/x86/avx512fp16.rs:2312-2323 | library/stdarch/crates/core_arch/src/x86/avx512fp16.rs:2653-2664 \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":"library/stdarch/crates/core_arch/src/x86/avx512fp16.rs"},"region":{"startLine":1630}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d9c2f47deac0edffe90e4c8383dfc19c663123db574cad50b736ca0b42b5d7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): library/stdarch/crates/core_arch/src/x86/avx512fp16.rs:5602-5613 | library/stdarch/crates/core_arch/src/x86/avx512fp16.rs:6117-6128 | library/stdarch/crates/core_arch/src/x86/avx512fp16.rs:6623-6634 | library/stdarch/crates/core_arch/src/x86/avx512fp16.rs:7137-7148 \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":"library/stdarch/crates/core_arch/src/x86/avx512fp16.rs"},"region":{"startLine":5602}}}],"partialFingerprints":{"codehealthFindingId/v1":"81586b1f0018b5e1e57eb8a9811576983a2ee9c7e46afdd5047679cacb84c865"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): library/stdarch/crates/core_arch/src/x86/avx512fp16.rs:5742-5754 | library/stdarch/crates/core_arch/src/x86/avx512fp16.rs:6249-6261 | library/stdarch/crates/core_arch/src/x86/avx512fp16.rs:6763-6775 | library/stdarch/crates/core_arch/src/x86/avx512fp16.rs:7277-7289 \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":"library/stdarch/crates/core_arch/src/x86/avx512fp16.rs"},"region":{"startLine":5742}}}],"partialFingerprints":{"codehealthFindingId/v1":"e86340b29455bafa6ab5bf260d227f3ba930bb75dab000142191fe05125a1fc4"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): library/stdarch/crates/core_arch/src/x86/avx512fp16.rs:11292-11304 | library/stdarch/crates/core_arch/src/x86/avx512fp16.rs:11348-11360 | library/stdarch/crates/core_arch/src/x86/avx512fp16.rs:11402-11414 | library/stdarch/crates/core_arch/src/x86/avx512fp16.rs:11456-11468 \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":"library/stdarch/crates/core_arch/src/x86/avx512fp16.rs"},"region":{"startLine":11292}}}],"partialFingerprints":{"codehealthFindingId/v1":"7287ad0d244e489de5d7b6c81ba0890bcfca8f05c0dbdc5f00a1b80d9fe9e353"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): library/stdarch/crates/core_arch/src/x86/kl.rs:271-278 | library/stdarch/crates/core_arch/src/x86/kl.rs:294-301 | library/stdarch/crates/core_arch/src/x86/kl.rs:317-324 | library/stdarch/crates/core_arch/src/x86/kl.rs:340-347 \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":"library/stdarch/crates/core_arch/src/x86/kl.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"9490bd7b84d6992ea8318d6a170867fe23f85cb613aff1ec269070f88a9b2d56"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): src/tools/clippy/clippy_lints/src/arbitrary_source_item_ordering.rs:281-305 | src/tools/clippy/clippy_lints/src/arbitrary_source_item_ordering.rs:311-339 | src/tools/clippy/clippy_lints/src/arbitrary_source_item_ordering.rs:345-392 | src/tools/clippy/clippy_lints/src/arbitrary_source_item_ordering.rs:396-487 \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/tools/clippy/clippy_lints/src/arbitrary_source_item_ordering.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"000983f90bae410d34057307f7ade225c413f0c1cee8ca7318fe62a973a43ab2"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): src/tools/miri/src/intrinsics/x86/mod.rs:790-811 | src/tools/miri/src/intrinsics/x86/mod.rs:821-844 | src/tools/miri/src/intrinsics/x86/mod.rs:1171-1199 | src/tools/miri/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/tools/miri/src/intrinsics/x86/mod.rs"},"region":{"startLine":790}}}],"partialFingerprints":{"codehealthFindingId/v1":"2752cc6a29443c8e41aa19c15690598b59109451f9a846d8c5b66c778791e534"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): src/tools/miri/src/shims/unix/freebsd/foreign_items.rs:21-184 | src/tools/miri/src/shims/unix/linux/foreign_items.rs:41-401 | src/tools/miri/src/shims/unix/macos/foreign_items.rs:29-457 | src/tools/miri/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/tools/miri/src/shims/unix/freebsd/foreign_items.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"da6b560a665db7a1366afcddd488159636b43c9db20d7df6ddc0285744205e94"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): src/tools/miri/src/shims/unix/fs.rs:885-929 | src/tools/miri/src/shims/unix/linux_like/epoll.rs:88-200 | src/tools/miri/src/shims/unix/socket.rs:716-748 | src/tools/miri/src/shims/unix/socket.rs:757-830 \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/tools/miri/src/shims/unix/fs.rs"},"region":{"startLine":885}}}],"partialFingerprints":{"codehealthFindingId/v1":"3941bdf531ae0245984a2cd3551959abe52222b75bebb0f061456518d832683d"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): src/tools/miri/src/shims/unix/fs.rs:1779-1792 | src/tools/miri/src/shims/unix/fs.rs:1794-1810 | src/tools/miri/src/shims/unix/fs.rs:1818-1837 | src/tools/miri/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/tools/miri/src/shims/unix/fs.rs"},"region":{"startLine":1779}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2a78295ac873ada57a2532d9863e7653d4b6fc4dbafa2174f3f0a9f679fb5d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): src/tools/rust-analyzer/crates/hir-ide/src/diagnostics/decl_check.rs:322-392 | src/tools/rust-analyzer/crates/hir-ide/src/diagnostics/decl_check.rs:415-480 | src/tools/rust-analyzer/crates/hir-ide/src/diagnostics/decl_check.rs:503-570 | src/tools/rust-analyzer/crates/hir-ide/src/diagnostics/decl_check.rs:573-643 \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/tools/rust-analyzer/crates/hir-ide/src/diagnostics/decl_check.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdb719904945fc2d337c3ad3d9fc4ba8f8f7f08ca230d2d4bc0ee0c150bd9850"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): src/tools/rust-analyzer/crates/hir-ide/src/diagnostics/expr.rs:627-663 | src/tools/rust-analyzer/crates/hir-ide/src/diagnostics/expr.rs:670-700 | src/tools/rust-analyzer/crates/hir/src/source_analyzer.rs:2181-2206 | src/tools/rust-analyzer/crates/hir/src/source_analyzer.rs:2213-2238 \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/tools/rust-analyzer/crates/hir-ide/src/diagnostics/expr.rs"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae9bd1a814fb60106489b41c042a47ddd89896c0200647a3edaae4b31a502e9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): src/tools/rust-analyzer/crates/ide-db/src/imports/merge_imports.rs:871-900 | src/tools/rust-analyzer/crates/ide-db/src/imports/merge_imports.rs:905-936 | src/tools/rustfmt/src/sort.rs:18-51 | src/tools/rustfmt/src/sort.rs:56-87 \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/tools/rust-analyzer/crates/ide-db/src/imports/merge_imports.rs"},"region":{"startLine":871}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5edbd91a0ab9ff67d3d21c78412e3548d149f66070c5e1f1ad56ac10852a1ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): src/tools/rust-analyzer/crates/ide/src/hover/render.rs:66-153 | src/tools/rust-analyzer/crates/ide/src/hover/render.rs:161-217 | src/tools/rust-analyzer/crates/ide/src/hover/render.rs:273-306 | src/tools/rust-analyzer/crates/ide/src/hover/render.rs:977-1028 \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/tools/rust-analyzer/crates/ide/src/hover/render.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cb1ae3dec9f12e6c21d7d300776874b1394db6f0c672c83b731b365794622a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): src/tools/rust-analyzer/crates/rust-analyzer/src/cli/analysis_stats.rs:1498-1512 | src/tools/rust-analyzer/crates/rust-analyzer/src/cli/analysis_stats.rs:1514-1528 | src/tools/rust-analyzer/crates/rust-analyzer/src/cli/analysis_stats.rs:1535-1550 | src/tools/rust-analyzer/crates/rust-analyzer/src/cli/analysis_stats.rs:1556-1571 \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/tools/rust-analyzer/crates/rust-analyzer/src/cli/analysis_stats.rs"},"region":{"startLine":1498}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b00d1e5736ed3060b66c5f3b3fc71cc9b9e90f98d8744f41916860498b09d53"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): src/tools/rust-analyzer/crates/syntax/src/syntax_editor/edits.rs:58-66 | src/tools/rust-analyzer/crates/syntax/src/syntax_editor/edits.rs:70-82 | src/tools/rust-analyzer/crates/syntax/src/syntax_editor/edits.rs:86-100 | src/tools/rust-analyzer/crates/syntax/src/syntax_editor/edits.rs:104-112 \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/tools/rust-analyzer/crates/syntax/src/syntax_editor/edits.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd523d3604c81c915a892ee46f3fe9eceb0626176e33e38afca7e65ed597af09"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (111 corresponding lines): compiler/rustc_codegen_gcc/src/asm.rs:820-942 | compiler/rustc_codegen_llvm/src/asm.rs:1030-1140 \u2014 These two members are one piece of code written twice and then edited apart: 111 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_gcc/src/asm.rs"},"region":{"startLine":820}}}],"partialFingerprints":{"codehealthFindingId/v1":"5990ee1a53d609a778f2d6c7d44e382ea3831cebffe9f5546dca960ecc3b1653"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (1 corresponding lines): src/bootstrap/src/core/config/toml/install.rs:11-11 | src/bootstrap/src/core/config/toml/pgo.rs:23-23 \u2014 These two members are one piece of code written twice and then edited apart: 1 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one 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/bootstrap/src/core/config/toml/install.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f58da017990828182fedc3e1f42c9444787b3889a14494ef8aee50c2388ec3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (156 corresponding lines): compiler/rustc_hir_typeck/src/coercion.rs:566-739 | src/tools/rust-analyzer/crates/hir-ty/src/infer/coerce.rs:545-700 \u2014 These two members are one piece of code written twice and then edited apart: 156 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/coercion.rs"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbf2538da5e19fec859995096cf32545e18349342d37a54bbd43b2d131a85c58"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 22\u002B corresponding lines): library/stdarch/crates/core_arch/src/loongarch64/lsx/portable.rs:218-239 | library/stdarch/crates/core_arch/src/loongarch64/lsx/portable.rs:243-264 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:28840-28911 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 22 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/loongarch64/lsx/portable.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"88ccf4033d0f292f2fec18e07d767680eb9d2826ee6d3ba1be59c181e2c40ba6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (108 corresponding lines): compiler/rustc_codegen_gcc/src/asm.rs:1069-1191 | compiler/rustc_codegen_llvm/src/asm.rs:919-1026 \u2014 These two members are one piece of code written twice and then edited apart: 108 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_gcc/src/asm.rs"},"region":{"startLine":1069}}}],"partialFingerprints":{"codehealthFindingId/v1":"80aea7337feeba74886bd591ac1b387d79ca375664584dafaf12b85d348f0439"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (112 corresponding lines): library/compiler-builtins/compiler-builtins/src/mem/impls.rs:113-224 | library/compiler-builtins/compiler-builtins/src/mem/impls.rs:227-343 \u2014 These two members are one piece of code written twice and then edited apart: 112 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/compiler-builtins/compiler-builtins/src/mem/impls.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"b323ea703b4df78d1637a87740323fb918cdcceb68461eb29163303517736864"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (84 corresponding lines): compiler/rustc_codegen_gcc/src/int.rs:79-183 | compiler/rustc_codegen_gcc/src/int.rs:704-787 \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":"compiler/rustc_codegen_gcc/src/int.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fb92f9559325bdd7656415c6b5be9b0ff69bf7d9b409b2b56ff263f2d722998"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (116 corresponding lines): compiler/rustc_infer/src/infer/canonical/query_response.rs:420-540 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/canonical/instantiate.rs:331-446 \u2014 These two members are one piece of code written twice and then edited apart: 116 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_infer/src/infer/canonical/query_response.rs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9b21c476126e116626f900b1e5dd2634a32d6d2156459b11944aa56eed29527"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (186 corresponding lines): compiler/rustc_hir_typeck/src/upvar.rs:884-1069 | src/tools/rust-analyzer/crates/hir-ty/src/infer/closure/analysis.rs:731-923 \u2014 These two members are one piece of code written twice and then edited apart: 186 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/upvar.rs"},"region":{"startLine":884}}}],"partialFingerprints":{"codehealthFindingId/v1":"241bb269aa43699fecea6bb5f053455789812a5a94e910e6a6fafe55ed91e967"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (173 corresponding lines): library/compiler-builtins/libm/src/math/jn.rs:43-249 | library/compiler-builtins/libm/src/math/jnf.rs:20-192 \u2014 These two members are one piece of code written twice and then edited apart: 173 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/compiler-builtins/libm/src/math/jn.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d2fdeb24aa82e0bb7f7554ada6828ebf41c55fd46701c6d8d294758fb37ff61"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (90 corresponding lines): compiler/rustc_ast_pretty/src/pprust/state.rs:1768-1872 | compiler/rustc_hir_pretty/src/lib.rs:1481-1570 \u2014 These two members are one piece of code written twice and then edited apart: 90 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ast_pretty/src/pprust/state.rs"},"region":{"startLine":1768}}}],"partialFingerprints":{"codehealthFindingId/v1":"386a3c6cbe063bcaeb077a3323ea77aa64f090b661b5c403ef899694e6738419"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (67 corresponding lines): library/std/src/sys/net/connection/xous/tcplistener.rs:113-179 | library/std/src/sys/net/connection/xous/udp.rs:121-192 \u2014 These two members are one piece of code written twice and then edited apart: 67 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/net/connection/xous/tcplistener.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"da9a064d7dd2874ff670988addd946bfb518128f241eda2ced3bb2f80997f2c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (140 corresponding lines): compiler/rustc_hir_typeck/src/method/probe.rs:638-801 | src/tools/rust-analyzer/crates/hir-ty/src/method_resolution/probe.rs:377-516 \u2014 These two members are one piece of code written twice and then edited apart: 140 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/method/probe.rs"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"346d1d3431c5d744e3ce0476bfb9448871c9ae313034034255708ce5fd727016"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (106 corresponding lines): compiler/rustc_borrowck/src/lib.rs:887-992 | compiler/rustc_borrowck/src/polonius/legacy/loan_invalidations.rs:94-208 \u2014 These two members are one piece of code written twice and then edited apart: 106 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/lib.rs"},"region":{"startLine":887}}}],"partialFingerprints":{"codehealthFindingId/v1":"be4b0d01227b7b62064d9d1160bbfdc5d9bcc51c498f1afd70ae1ccf9b3688d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (98 corresponding lines): library/stdarch/crates/stdarch-gen-loongarch/src/main.rs:154-251 | library/stdarch/crates/stdarch-gen-loongarch/src/main.rs:620-857 \u2014 These two members are one piece of code written twice and then edited apart: 98 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/stdarch-gen-loongarch/src/main.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"a39738af2157c54b89e501d2e6876b396728efe0fd90df2d70284118f001fff4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (104 corresponding lines): compiler/rustc_target/src/callconv/loongarch.rs:44-148 | compiler/rustc_target/src/callconv/riscv.rs:50-153 \u2014 These two members are one piece of code written twice and then edited apart: 104 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_target/src/callconv/loongarch.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"858456444314525b2ebdd60107a57b261d71249a8839e97377ffa570db0902d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (159 corresponding lines): compiler/rustc_hir_typeck/src/pat.rs:2800-2983 | src/tools/rust-analyzer/crates/hir-ty/src/infer/pat.rs:1363-1521 \u2014 These two members are one piece of code written twice and then edited apart: 159 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/pat.rs"},"region":{"startLine":2800}}}],"partialFingerprints":{"codehealthFindingId/v1":"512757618b0adfd8c2ff1c4d7cd80be59cfbe384adc07a46749b56d77f52d145"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (74 corresponding lines): src/tools/rust-analyzer/crates/proc-macro-api/src/legacy_protocol/msg/flat.rs:504-582 | src/tools/rust-analyzer/crates/proc-macro-api/src/legacy_protocol/msg/flat.rs:652-725 \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/tools/rust-analyzer/crates/proc-macro-api/src/legacy_protocol/msg/flat.rs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d64feddce27c037cfff8475762dd411d92901621b39ce25205b3f363f106794"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (92 corresponding lines): library/compiler-builtins/libm/src/math/remquo.rs:2-95 | library/compiler-builtins/libm/src/math/remquof.rs:2-93 \u2014 These two members are one piece of code written twice and then edited apart: 92 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/compiler-builtins/libm/src/math/remquo.rs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bea2fe311496498c1a5acf26b1e694b5a47d410094dbb7efa1b1487d4c76143"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (83 corresponding lines): compiler/rustc_next_trait_solver/src/solve/assembly/structural_traits.rs:790-872 | compiler/rustc_trait_selection/src/traits/effects.rs:452-548 \u2014 These two members are one piece of code written twice and then edited apart: 83 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_next_trait_solver/src/solve/assembly/structural_traits.rs"},"region":{"startLine":790}}}],"partialFingerprints":{"codehealthFindingId/v1":"3850013f7b714fd923bece187aae238d1e5cc8bbe18e55dc6cf0d5d49d9ac60a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (102 corresponding lines): compiler/rustc_infer/src/infer/canonical/canonicalizer.rs:332-433 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/canonical/canonicalizer.rs:328-430 \u2014 These two members are one piece of code written twice and then edited apart: 102 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_infer/src/infer/canonical/canonicalizer.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"26bb7da759a5daf32e4cb6077f63dcef71c1e685209106af7499859ac2cc5d51"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (146 corresponding lines): src/etc/debugger_tester/gdb/check_gdb.py:130-275 | src/etc/debugger_tester/lldb/check_lldb.py:202-375 \u2014 These two members are one piece of code written twice and then edited apart: 146 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one 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/etc/debugger_tester/gdb/check_gdb.py"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"831ac93e81beab43ef1d543e6a6644d2bd86728f3bde838a3017aec076c4ea3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (74 corresponding lines): src/tools/miri/src/shims/unix/virtual_socket.rs:542-639 | src/tools/miri/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/tools/miri/src/shims/unix/virtual_socket.rs"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"a90dd8d50fb1aa8ded06d78739076495e06efd5502730884f6829ce002a7f9b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (44 corresponding lines): src/tools/rust-analyzer/crates/hir-ty/src/next_solver/ty.rs:983-1030 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/ty.rs:1034-1077 \u2014 These two members are one piece of code written twice and then edited apart: 44 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/next_solver/ty.rs"},"region":{"startLine":983}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7df5f79fa9b9ab94926d4b6b60e6eb41006accbd916cdd7402cc6bbf830dd32"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (95 corresponding lines): compiler/rustc_hir_analysis/src/collect/item_bounds.rs:130-228 | src/tools/rust-analyzer/crates/hir-ty/src/lower.rs:2379-2473 \u2014 These two members are one piece of code written twice and then edited apart: 95 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/collect/item_bounds.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3517e2006145fe7d45df6f091cb200265f111fc82e3bbc4229bf05ac3247ce3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (100 corresponding lines): library/compiler-builtins/libm/src/math/expm1.rs:32-134 | library/compiler-builtins/libm/src/math/expm1f.rs:35-134 \u2014 These two members are one piece of code written twice and then edited apart: 100 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/compiler-builtins/libm/src/math/expm1.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeab6349de4ce695c59937e97170d1c2dbd13c44e4a3a733a9cb1eab2e987df0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (115 corresponding lines): compiler/rustc_infer/src/infer/relate/generalize.rs:493-607 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/relate/generalize.rs:434-550 \u2014 These two members are one piece of code written twice and then edited apart: 115 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_infer/src/infer/relate/generalize.rs"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5f11959852205fa99ff6505f0485cebf289a6696b6eb2a997a3b2a8e76d82f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (74 corresponding lines): library/compiler-builtins/libm/src/math/log10.rs:34-116 | library/compiler-builtins/libm/src/math/log2.rs:32-105 \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":"library/compiler-builtins/libm/src/math/log10.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fe37c9cbd49202391bfe5a609392fa9f4afd89218bd4071f6aabe0af7a6dbcd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (87 corresponding lines): src/tools/miri/src/shims/windows/fs.rs:579-670 | src/tools/miri/src/shims/windows/fs.rs:684-770 \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/tools/miri/src/shims/windows/fs.rs"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"9760dc10b9d10da5b266d3462fd5f9e66046ee4d6fe5b32a2bdbbc55e1e9ccab"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (54 corresponding lines): compiler/rustc_codegen_cranelift/scripts/rustc-clif.rs:7-60 | compiler/rustc_codegen_cranelift/scripts/rustdoc-clif.rs:7-60 \u2014 These two members are one piece of code written twice and then edited apart: 54 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/scripts/rustc-clif.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"18077e2937e90e34b6225aaf56b72a779d7219333063aed81ff742d57835bb74"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (88 corresponding lines): library/std/src/sys/fs/unix.rs:1564-1651 | library/std/src/sys/fs/unix.rs:2165-2258 \u2014 These two members are one piece of code written twice and then edited apart: 88 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/fs/unix.rs"},"region":{"startLine":1564}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e58210d9e2b8227c0127dc1b05ad66261b9afe48dc42d9d35bc5a4dc344d217"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (131 corresponding lines): compiler/rustc_hir_typeck/src/coercion.rs:428-558 | src/tools/rust-analyzer/crates/hir-ty/src/infer/coerce.rs:356-537 \u2014 These two members are one piece of code written twice and then edited apart: 131 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/coercion.rs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"06c92ca2434abe803977730c426bfcf37b0e07aad2e78559f0a11ff2d3e0adda"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (65 corresponding lines): src/tools/clippy/clippy_lints_internal/src/repeated_is_diagnostic_item.rs:266-330 | src/tools/clippy/clippy_lints_internal/src/repeated_is_diagnostic_item.rs:332-396 \u2014 These two members are one piece of code written twice and then edited apart: 65 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one 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/tools/clippy/clippy_lints_internal/src/repeated_is_diagnostic_item.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"358b1933784876ad7a88497c1bee85a5094f4c4c65ca38857ac485ba0a5b5904"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (81 corresponding lines): src/tools/clippy/clippy_utils/src/ast_utils/mod.rs:514-594 | src/tools/clippy/clippy_utils/src/ast_utils/mod.rs:596-680 \u2014 These two members are one piece of code written twice and then edited apart: 81 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one 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/tools/clippy/clippy_utils/src/ast_utils/mod.rs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ad4316383e858a2713954cc1064a7a595b03ea86b19aeb4d932e3a132864e59"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (54 corresponding lines): compiler/rustc_macros/src/extension.rs:15-68 | src/tools/rust-analyzer/crates/macros/src/extension.rs:17-71 \u2014 These two members are one piece of code written twice and then edited apart: 54 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_macros/src/extension.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"85b67e9df6ed48513fbd2892b44e931137e1b3556b921864e74d0d65edd18c3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (53 corresponding lines): src/tools/rust-analyzer/crates/hir-expand/src/builtin/derive_macro.rs:1011-1063 | src/tools/rust-analyzer/crates/hir-expand/src/builtin/derive_macro.rs:1069-1126 \u2014 These two members are one piece of code written twice and then edited apart: 53 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one 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/tools/rust-analyzer/crates/hir-expand/src/builtin/derive_macro.rs"},"region":{"startLine":1011}}}],"partialFingerprints":{"codehealthFindingId/v1":"24f6d1b29263ca6230a639eb40fe421a318a8e6c4104e41819559e6f6b34b03d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (75 corresponding lines): library/compiler-builtins/libm/src/math/log1p.rs:68-142 | library/compiler-builtins/libm/src/math/log1pf.rs:23-97 \u2014 These two members are one piece of code written twice and then edited apart: 75 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/compiler-builtins/libm/src/math/log1p.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"c969b67659af10828a18d6dc477ed85d2044774861c093461b361f507b71410b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (55 corresponding lines): compiler/rustc_codegen_gcc/src/intrinsic/mod.rs:1185-1240 | compiler/rustc_codegen_gcc/src/intrinsic/mod.rs:1249-1303 \u2014 These two members are one piece of code written twice and then edited apart: 55 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_gcc/src/intrinsic/mod.rs"},"region":{"startLine":1185}}}],"partialFingerprints":{"codehealthFindingId/v1":"252d39111883022370620a6730843de4dc976b3023825bc324bd4ab790fd7ab9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (56 corresponding lines): src/tools/rust-analyzer/crates/hir-def/src/visibility.rs:159-214 | src/tools/rust-analyzer/crates/hir-def/src/visibility.rs:225-280 \u2014 These two members are one piece of code written twice and then edited apart: 56 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/visibility.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f6cc2d2920600c5b05a39252dffd935db63ad9bf2fb531545eacd88387765ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (58 corresponding lines): src/tools/compiletest/src/runtest/compute_diff.rs:23-80 | src/tools/rustfmt/src/rustfmt_diff.rs:180-246 \u2014 These two members are one piece of code written twice and then edited apart: 58 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one 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/tools/compiletest/src/runtest/compute_diff.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"b388c4f088e0fafdc5fb0ab7ece37620245bc8bc677e189993900ce24936a78a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (56 corresponding lines): compiler/rustc_codegen_ssa/src/back/symbol_edit.rs:188-243 | compiler/rustc_codegen_ssa/src/back/symbol_edit.rs:360-426 \u2014 These two members are one piece of code written twice and then edited apart: 56 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/back/symbol_edit.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"37b5e79bb51dc459d01991fc0f6611d66cbd19a998939feb95c9638530e19e0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (84 corresponding lines): src/tools/miri/src/shims/unix/fd.rs:481-577 | src/tools/miri/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/tools/miri/src/shims/unix/fd.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"bef26869ee2b629608e92e872d9788130073bf4b17be2297702ccf61416dbb15"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): compiler/rustc_target/src/asm/mod.rs:363-403 | compiler/rustc_target/src/asm/mod.rs:673-712 \u2014 These two members are one piece of code written twice and then edited apart: 40 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_target/src/asm/mod.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ca7c10705e367175d629282a552e3e453e13dcdf045fdba45b3da067133e6a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (80 corresponding lines): src/tools/miri/src/shims/unix/virtual_socket.rs:341-420 | src/tools/miri/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/tools/miri/src/shims/unix/virtual_socket.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7f45f64e4466b8c0b5f2a4c61b7a15650107ac59ea08062737c61ee9be3f0d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (45 corresponding lines): src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:342-386 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1918-1969 \u2014 These two members are one piece of code written twice and then edited apart: 45 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"f751578fe5494adfb4e477a7bb2c4e9c457ec5b8ba75c9c11c2bab150901a781"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (77 corresponding lines): compiler/rustc_infer/src/infer/relate/generalize.rs:659-748 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/relate/generalize.rs:592-668 \u2014 These two members are one piece of code written twice and then edited apart: 77 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_infer/src/infer/relate/generalize.rs"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"171a762ee0cf8eeedfc22a358098afd207c49c839f007b97e93179aba8515d53"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (56 corresponding lines): compiler/rustc_macros/src/type_visitable.rs:6-61 | src/tools/rust-analyzer/crates/macros/src/lib.rs:35-90 \u2014 These two members are one piece of code written twice and then edited apart: 56 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_macros/src/type_visitable.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"72ec8d72d10e5f13f8e4fe3b61fd1d5bccbdcb00ddd29971e415e83ca8adc9fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (58 corresponding lines): library/stdarch/crates/stdarch-gen-arm/src/assert_instr.rs:116-173 | library/stdarch/crates/stdarch-gen-arm/src/assert_instr.rs:246-309 \u2014 These two members are one piece of code written twice and then edited apart: 58 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/stdarch-gen-arm/src/assert_instr.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae108eb6c6d4dfcca69e94a35b4586c1d2fc8ac3d47c8e4caa425f5bcbbbc5d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): src/librustdoc/clean/cfg.rs:350-381 | src/librustdoc/clean/cfg.rs:393-425 \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/librustdoc/clean/cfg.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"c96890a0039c7e985c7243994b51a30c2e2115841cdc2b519b1a84392fcd31c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (58 corresponding lines): src/tools/rust-analyzer/crates/hir/src/lib.rs:5438-5508 | src/tools/rust-analyzer/crates/hir/src/lib.rs:5547-5604 \u2014 These two members are one piece of code written twice and then edited apart: 58 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one 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/tools/rust-analyzer/crates/hir/src/lib.rs"},"region":{"startLine":5438}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9b7820008ad82d57b44dd1980a54e4434254d1ba51de9b23e632baeb58a03d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): compiler/rustc_middle/src/ty/inhabitedness/inhabited_predicate.rs:183-207 | compiler/rustc_middle/src/ty/inhabitedness/inhabited_predicate.rs:209-233 \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":"compiler/rustc_middle/src/ty/inhabitedness/inhabited_predicate.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"a56becef3d7748801a20659210984a41872931a504303b391207790ecceacc11"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (64 corresponding lines): library/compiler-builtins/libm/src/math/atan2.rs:51-115 | library/compiler-builtins/libm/src/math/atan2f.rs:27-90 \u2014 These two members are one piece of code written twice and then edited apart: 64 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/compiler-builtins/libm/src/math/atan2.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa4894bf7c40e7f2e45b760dbc457ca8243f29aac0bbb10ab1eebffb4b726064"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): src/tools/clippy/clippy_lints/src/manual_retain.rs:123-173 | src/tools/clippy/clippy_lints/src/manual_retain.rs:181-214 \u2014 These two members are one piece of code written twice and then edited apart: 34 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/manual_retain.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"1da83f0cae251faa988727cdf92700150c65f929d2601483dfc417aa8eaddaca"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (62 corresponding lines): library/alloc/src/collections/btree/node.rs:1626-1687 | library/alloc/src/collections/btree/node.rs:1690-1752 \u2014 These two members are one piece of code written twice and then edited apart: 62 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/alloc/src/collections/btree/node.rs"},"region":{"startLine":1626}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc30d364ae9bf501c025ff1df0463d7006de16d374bd074deca870a3b6e52c0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): src/bootstrap/src/core/download.rs:205-244 | src/bootstrap/src/core/download.rs:626-678 \u2014 These two members are one piece of code written twice and then edited apart: 40 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/download.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"e04745a3e73ceee5b62b1d35eede9a977801757313b81b3918d27d56394a6321"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (50 corresponding lines): src/tools/rust-analyzer/crates/ide/src/inlay_hints/lifetime.rs:74-131 | src/tools/rust-analyzer/crates/ide/src/inlay_hints/lifetime.rs:139-188 \u2014 These two members are one piece of code written twice and then edited apart: 50 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/inlay_hints/lifetime.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4bb34aae917962413ac70579f8f17ec764e51be923e9baf8aa356311009e798"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (57 corresponding lines): library/core/src/str/pattern.rs:1185-1249 | library/core/src/str/pattern.rs:1302-1358 \u2014 These two members are one piece of code written twice and then edited apart: 57 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/str/pattern.rs"},"region":{"startLine":1185}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa3a1f0f647eb418205cf0b1c2195e61efe30a5060df28d5bae58d5b0d5878e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (45 corresponding lines): compiler/rustc_middle/src/ty/sty.rs:2066-2111 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/ty.rs:378-422 \u2014 These two members are one piece of code written twice and then edited apart: 45 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/ty/sty.rs"},"region":{"startLine":2066}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ced5c8fc38445d635684ac45b41fe08fbdc66e8a736e690ea49262005985ff4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (42 corresponding lines): compiler/rustc_type_ir/src/interner.rs:658-699 | compiler/rustc_type_ir/src/interner.rs:712-765 \u2014 These two members are one piece of code written twice and then edited apart: 42 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_type_ir/src/interner.rs"},"region":{"startLine":658}}}],"partialFingerprints":{"codehealthFindingId/v1":"8660bfcf2c46e948e1feb47eb1113a148d6f87637293fe4948bb10a2468c6c15"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (50 corresponding lines): compiler/rustc_codegen_cranelift/src/abi/pass_mode.rs:100-153 | compiler/rustc_codegen_cranelift/src/abi/pass_mode.rs:155-204 \u2014 These two members are one piece of code written twice and then edited apart: 50 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/src/abi/pass_mode.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"babf3241cd26bfd8495929732859dbb3e86bf13ab0a8309e3f3b9f7a7679ef31"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (64 corresponding lines): library/compiler-builtins/libm/src/math/atan.rs:67-131 | library/compiler-builtins/libm/src/math/atanf.rs:45-108 \u2014 These two members are one piece of code written twice and then edited apart: 64 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/compiler-builtins/libm/src/math/atan.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"818b0e0c128f257cb14888eac15fe1b9711f7c2a34641574861f3bef9de821ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (70 corresponding lines): library/std/src/sync/mpmc/array.rs:124-193 | library/std/src/sync/mpmc/array.rs:215-285 \u2014 These two members are one piece of code written twice and then edited apart: 70 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sync/mpmc/array.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"66ccaa5e932f692c055150c7024f9e62ddd37ec8e90b7abda5394ef756caa4e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): compiler/rustc_codegen_cranelift/src/unsize.rs:79-111 | compiler/rustc_codegen_ssa/src/base.rs:226-263 \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":"compiler/rustc_codegen_cranelift/src/unsize.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8fdb15212e3b437ca066b3d3dc786c1d945b8547d5b85d8b19fada17f522ad2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (59 corresponding lines): compiler/rustc_infer/src/infer/canonical/canonicalizer.rs:594-652 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/canonical/canonicalizer.rs:580-638 \u2014 These two members are one piece of code written twice and then edited apart: 59 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_infer/src/infer/canonical/canonicalizer.rs"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"e392b377c4c28ee44625c668205a10df9ba1ae52a684671395ff69148defd433"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (56 corresponding lines): compiler/rustc_codegen_gcc/src/type_of.rs:190-252 | compiler/rustc_codegen_llvm/src/type_of.rs:223-278 \u2014 These two members are one piece of code written twice and then edited apart: 56 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_gcc/src/type_of.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f727ab8966c96edf62b60840a6e487d7e6693eb8a539d3c9254fff299b1f051"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (41 corresponding lines): src/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_deref.rs:45-85 | src/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_deref.rs:87-128 \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/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_deref.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"7271cb163375bffe2ca599357a04e5ce7be811fd76b57bac7c73dfeb5e600956"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): src/tools/clippy/clippy_utils/src/visitors.rs:111-143 | src/tools/clippy/clippy_utils/src/visitors.rs:151-193 \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/tools/clippy/clippy_utils/src/visitors.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8fd90efe5c638c0088cbc9d6c15b4999c0ba63b996fcad7294c89a79b887f7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): src/tools/rust-analyzer/crates/ide-assists/src/handlers/expand_rest_pattern.rs:171-211 | src/tools/rust-analyzer/crates/ide-assists/src/handlers/expand_rest_pattern.rs:233-272 \u2014 These two members are one piece of code written twice and then edited apart: 40 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/expand_rest_pattern.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e24df72310328fd13b723cb04223491a8bbd646a5eb65ed9389d63f2b4366c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (45 corresponding lines): compiler/rustc_codegen_gcc/src/common.rs:291-337 | compiler/rustc_codegen_llvm/src/common.rs:408-452 \u2014 These two members are one piece of code written twice and then edited apart: 45 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_gcc/src/common.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"7896f838e18509ef26d58a6f252e2d7f2fbe2a1a434aa971e3af436a0da01def"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (72 corresponding lines): src/tools/miri/src/shims/unix/tcp_socket.rs:1128-1199 | src/tools/miri/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/tools/miri/src/shims/unix/tcp_socket.rs"},"region":{"startLine":1128}}}],"partialFingerprints":{"codehealthFindingId/v1":"933d3e958e1a79a016ef3467e6f2d5c14b6ab3bb002f35073b5223577d8014c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (54 corresponding lines): compiler/rustc_expand/src/mbe/macro_rules.rs:235-288 | compiler/rustc_expand/src/mbe/macro_rules.rs:442-507 \u2014 These two members are one piece of code written twice and then edited apart: 54 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_expand/src/mbe/macro_rules.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8558f308769a1ba3bfa5fef6a89d5fcdd61107148c9f09749d92c01a0d58048"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (53 corresponding lines): compiler/rustc_hir_typeck/src/pat.rs:3105-3157 | src/tools/rust-analyzer/crates/hir-ty/src/infer/pat.rs:1602-1654 \u2014 These two members are one piece of code written twice and then edited apart: 53 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/pat.rs"},"region":{"startLine":3105}}}],"partialFingerprints":{"codehealthFindingId/v1":"08fe21843318e2f18153bf8f27c7debd279d0698d93cb00fb7c64e76a2aaa61c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): compiler/rustc_infer/src/infer/mod.rs:1537-1573 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/mod.rs:1110-1144 \u2014 These two members are one piece of code written twice and then edited apart: 35 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_infer/src/infer/mod.rs"},"region":{"startLine":1537}}}],"partialFingerprints":{"codehealthFindingId/v1":"deaf99201019e3c1c51c7efc0571b64978feb4c62c0a3c4a692f2c5e37ba8af6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (49 corresponding lines): compiler/rustc_next_trait_solver/src/normalize.rs:99-147 | compiler/rustc_next_trait_solver/src/normalize.rs:150-198 \u2014 These two members are one piece of code written twice and then edited apart: 49 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_next_trait_solver/src/normalize.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f070a187eea855ae8838ced8c93ce7c86069869fbc56a5a7a75e9aadbf6047b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (69 corresponding lines): compiler/rustc_trait_selection/src/solve/inspect/analyse.rs:243-312 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/inspect.rs:337-405 \u2014 These two members are one piece of code written twice and then edited apart: 69 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/solve/inspect/analyse.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bdadaf614adfedbefbf8e9d556955166216ee362279a806b831e1967dc6a5b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (43 corresponding lines): compiler/rustc_ast_pretty/src/pprust/state/item.rs:545-593 | compiler/rustc_hir_pretty/src/lib.rs:924-966 \u2014 These two members are one piece of code written twice and then edited apart: 43 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ast_pretty/src/pprust/state/item.rs"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d33b0d4022996e8f4fbf16bc025ab627a01ff4d872cadfedc02b17349c4da71"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (42 corresponding lines): compiler/rustc_middle/src/mir/pretty.rs:935-978 | compiler/rustc_public/src/mir/pretty.rs:127-168 \u2014 These two members are one piece of code written twice and then edited apart: 42 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/mir/pretty.rs"},"region":{"startLine":935}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d1ad9e1535387575602b4c2ea4c0a38a6793a8b98ea82d3c6dabc7d7ce75882"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (49 corresponding lines): compiler/rustc_codegen_llvm/src/consts.rs:743-791 | compiler/rustc_codegen_llvm/src/consts.rs:801-865 \u2014 These two members are one piece of code written twice and then edited apart: 49 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/consts.rs"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"a82e8835b0bf199be495775d758ec01f6d2035f1ce559ecb7773b5d4908a48fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): src/tools/miri/src/intrinsics/x86/mod.rs:1069-1102 | src/tools/miri/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/tools/miri/src/intrinsics/x86/mod.rs"},"region":{"startLine":1069}}}],"partialFingerprints":{"codehealthFindingId/v1":"a197b0af94d4b175aa9d8ab810dd2fff8b5308182f06fc4fa57cd1b5ccaece6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (46 corresponding lines): src/tools/clippy/clippy_dev/src/deprecate_lint.rs:17-62 | src/tools/clippy/clippy_dev/src/deprecate_lint.rs:64-114 \u2014 These two members are one piece of code written twice and then edited apart: 46 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_dev/src/deprecate_lint.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"55f645617f90c0f7592eceef79d54286c5d43bda26f78124667e6cf76a17c19a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 32\u002B corresponding lines): src/tools/rust-analyzer/crates/syntax/src/ast/token_ext.rs:264-295 | src/tools/rust-analyzer/crates/syntax/src/ast/token_ext.rs:308-339 | src/tools/rust-analyzer/crates/syntax/src/ast/token_ext.rs:354-387 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 32 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/syntax/src/ast/token_ext.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbd09f35f761ecf5f21efd0853af8c934aca4033475c016a6f64c9f163913085"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (73 corresponding lines): src/tools/rust-analyzer/lib/line-index/src/lib.rs:266-349 | src/tools/rust-analyzer/lib/line-index/src/lib.rs:376-448 \u2014 These two members are one piece of code written twice and then edited apart: 73 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one 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/tools/rust-analyzer/lib/line-index/src/lib.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2cb0417c57a30fcc6fb9256dac12a8115c8f89862198b017809a93361c600f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (46 corresponding lines): library/std/src/sys/pal/sgx/abi/usercalls/alloc.rs:402-447 | library/std/src/sys/pal/sgx/abi/usercalls/alloc.rs:464-513 \u2014 These two members are one piece of code written twice and then edited apart: 46 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/pal/sgx/abi/usercalls/alloc.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fe1d94d4ea0b48c77c44e6b45b90f126fe818a32a9541a2cdad93784c23a641"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): compiler/rustc_codegen_gcc/src/int.rs:190-232 | compiler/rustc_codegen_gcc/src/int.rs:274-310 \u2014 These two members are one piece of code written twice and then edited apart: 37 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_gcc/src/int.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd2349b1f0b9e9ab5c788a7151b0e027a2453a6842b41d32139d32f6d3ff781a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (52 corresponding lines): compiler/rustc_middle/src/ty/sty.rs:2012-2064 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/ty.rs:325-376 \u2014 These two members are one piece of code written twice and then edited apart: 52 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/ty/sty.rs"},"region":{"startLine":2012}}}],"partialFingerprints":{"codehealthFindingId/v1":"11186a1eeaf5576304ebc5fac21630a598078adcd6f3b1af3ff6453cd82b5dc5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (39 corresponding lines): src/tools/rust-analyzer/crates/hir/src/lib.rs:3320-3358 | src/tools/rust-analyzer/crates/hir/src/lib.rs:3361-3399 \u2014 These two members are one piece of code written twice and then edited apart: 39 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir/src/lib.rs"},"region":{"startLine":3320}}}],"partialFingerprints":{"codehealthFindingId/v1":"da3c58ba80e595745ab8c37507115d5fd4d12e473a46a5c50dc4f750e7c1457f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (68 corresponding lines): library/alloc/src/str.rs:966-1037 | src/tools/rust-analyzer/lib/smol_str/src/lib.rs:859-926 \u2014 These two members are one piece of code written twice and then edited apart: 68 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/alloc/src/str.rs"},"region":{"startLine":966}}}],"partialFingerprints":{"codehealthFindingId/v1":"11652299fa6a47f84a92692c95a314a881701f37fcb10b09793e22f1ce031164"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): library/compiler-builtins/libm/src/math/erf.rs:187-215 | library/compiler-builtins/libm/src/math/erff.rs:97-126 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/compiler-builtins/libm/src/math/erf.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae0e132d9d27a9b7a3be73428869683562aeaa1a263c4245e3b8905db8ce40ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): compiler/rustc_hir_typeck/src/closure.rs:294-333 | src/tools/rust-analyzer/crates/hir-ty/src/infer/closure.rs:374-419 \u2014 These two members are one piece of code written twice and then edited apart: 40 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/closure.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"8564a13c56922057e10c733c5322716b0c58f18698919c8e458af55844459802"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (39 corresponding lines): src/tools/rust-analyzer/crates/proc-macro-api/src/bidirectional_protocol.rs:161-199 | src/tools/rust-analyzer/crates/proc-macro-api/src/legacy_protocol.rs:86-142 \u2014 These two members are one piece of code written twice and then edited apart: 39 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/proc-macro-api/src/bidirectional_protocol.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ec389326d7493d795442596778f047135e98db30f16785ff867d29931940e0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (47 corresponding lines): library/std/src/sync/mpmc/zero.rs:166-215 | library/std/src/sync/mpmc/zero.rs:235-281 \u2014 These two members are one piece of code written twice and then edited apart: 47 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sync/mpmc/zero.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a7d01ca147242b817d9d04d202d9e67b46d548530241ec45e5df559dc88622d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (43 corresponding lines): compiler/rustc_codegen_cranelift/src/inline_asm.rs:785-828 | compiler/rustc_codegen_cranelift/src/inline_asm.rs:835-877 \u2014 These two members are one piece of code written twice and then edited apart: 43 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/src/inline_asm.rs"},"region":{"startLine":785}}}],"partialFingerprints":{"codehealthFindingId/v1":"97ee6d5bea645eb99b3d0e5cbe75f36899e07f637567e0552e8c5e7728fd42e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): src/tools/rust-analyzer/crates/ide-diagnostics/src/handlers/field_shorthand.rs:31-70 | src/tools/rust-analyzer/crates/ide-diagnostics/src/handlers/field_shorthand.rs:77-116 \u2014 These two members are one piece of code written twice and then edited apart: 40 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-diagnostics/src/handlers/field_shorthand.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"79eb8c7ce6f2f2c172a0b474814d4f9ff1ece36e8e4e6d13a17edbf517e86e0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (51 corresponding lines): compiler/rustc_trait_selection/src/solve/select.rs:155-205 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/select.rs:381-431 \u2014 These two members are one piece of code written twice and then edited apart: 51 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/solve/select.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"f10a4f2bf84a092b2b738428a281bd799927f62435465f25796abf75a42d5443"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 44\u002B corresponding lines): compiler/rustc_codegen_llvm/src/builder.rs:474-525 | compiler/rustc_codegen_llvm/src/builder.rs:1444-1494 | compiler/rustc_codegen_llvm/src/builder.rs:1922-1965 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 44 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":"compiler/rustc_codegen_llvm/src/builder.rs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"f57dbba696d215dc5be0989b606b1e056204d37121a7ecd5cb45a3c9f3615fc2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): src/tools/clippy/clippy_lints/src/operators/assign_op_pattern.rs:130-154 | src/tools/clippy/clippy_lints/src/operators/assign_op_pattern.rs:156-180 \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/tools/clippy/clippy_lints/src/operators/assign_op_pattern.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae473a42881db9846ebf9f8b99b94074287c46d35669c43cf3a9381fced3e44b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): src/tools/rust-analyzer/crates/hir/src/lib.rs:4218-4246 | src/tools/rust-analyzer/crates/hir/src/lib.rs:4248-4282 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir/src/lib.rs"},"region":{"startLine":4218}}}],"partialFingerprints":{"codehealthFindingId/v1":"d74dd47c749c360d93cf6e0769d2ffd370afb6a3e86414c7034de1e9b2ef2f91"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (45 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512bw.rs:9636-9680 | library/stdarch/crates/core_arch/src/x86/avx512bw.rs:9805-9849 \u2014 These two members are one piece of code written twice and then edited apart: 45 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512bw.rs"},"region":{"startLine":9636}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d423b996c899506bec8b46d5bd2d30a66dc15fdb2a453eb9aa94afcf3d87269"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): library/alloc/src/task.rs:180-224 | library/alloc/src/task.rs:401-440 \u2014 These two members are one piece of code written twice and then edited apart: 40 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/alloc/src/task.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"84e4d86a99203e7820b2674d5cd42f4db8f533230ada0ddf133816382e21bd4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (46 corresponding lines): compiler/rustc_codegen_cranelift/src/unsize.rs:25-70 | compiler/rustc_codegen_ssa/src/base.rs:165-217 \u2014 These two members are one piece of code written twice and then edited apart: 46 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/src/unsize.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"586ecd2ce615aba9ea1e0da1cfa7baba92d912f6957ac9280e46484298952db8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (43 corresponding lines): compiler/rustc_infer/src/infer/canonical/canonicalizer.rs:664-708 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/canonical/canonicalizer.rs:650-692 \u2014 These two members are one piece of code written twice and then edited apart: 43 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_infer/src/infer/canonical/canonicalizer.rs"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f2311221f7cccebb9c08f4484c4b9a3adca4bd8286d66cc97c4a2fc6da49c57"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (70 corresponding lines): library/compiler-builtins/libm/src/math/exp.rs:85-156 | library/compiler-builtins/libm/src/math/expf.rs:34-103 \u2014 These two members are one piece of code written twice and then edited apart: 70 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/compiler-builtins/libm/src/math/exp.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba24ca32c64584df26492f4f4e970ff65c6e133315873aba8b50dc4e000ee913"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): src/tools/rust-analyzer/crates/ide-assists/src/handlers/expand_glob_import.rs:44-79 | src/tools/rust-analyzer/crates/ide-assists/src/handlers/expand_glob_import.rs:102-140 \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/tools/rust-analyzer/crates/ide-assists/src/handlers/expand_glob_import.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1d39a6cdd3036ea369bd76a90aa2c4a9cf49a87b2484b88515a092a29bce226"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (72 corresponding lines): compiler/rustc_hir_typeck/src/method/probe.rs:2423-2494 | src/tools/rust-analyzer/crates/hir-ty/src/method_resolution/probe.rs:1913-1984 \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":"compiler/rustc_hir_typeck/src/method/probe.rs"},"region":{"startLine":2423}}}],"partialFingerprints":{"codehealthFindingId/v1":"88bed0a662cf147c9ee74aa445b9d722919195fd94c8ab34490dc900bd448fa8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (52 corresponding lines): library/std/src/sys/net/connection/socket/hermit.rs:54-105 | library/std/src/sys/net/connection/socket/unix.rs:174-237 \u2014 These two members are one piece of code written twice and then edited apart: 52 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/net/connection/socket/hermit.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"88f70d3cb4b5d0b17e0c6d6ad3c6f22140cd736bc2bdf41ce89ccaf35f38e80c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (49 corresponding lines): compiler/rustc_hir_typeck/src/coercion.rs:2228-2277 | src/tools/rust-analyzer/crates/hir-ty/src/infer/coerce.rs:1621-1669 \u2014 These two members are one piece of code written twice and then edited apart: 49 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/coercion.rs"},"region":{"startLine":2228}}}],"partialFingerprints":{"codehealthFindingId/v1":"e886cabb11a830c0859cbf9a63ed1298f21c96bb3440bf49d121a06a46aa7289"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (49 corresponding lines): compiler/rustc_infer/src/infer/canonical/canonicalizer.rs:536-584 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/canonical/canonicalizer.rs:525-574 \u2014 These two members are one piece of code written twice and then edited apart: 49 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_infer/src/infer/canonical/canonicalizer.rs"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"c464930da68983941804231f7a6dfd585ca9c633a77af71536f132248c48c3db"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (56 corresponding lines): compiler/rustc_borrowck/src/dataflow.rs:186-252 | compiler/rustc_borrowck/src/dataflow.rs:299-354 \u2014 These two members are one piece of code written twice and then edited apart: 56 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/dataflow.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c74ffcbb5878e58fd61e66ac841d9ff43700cf1ce52e09b22bfc5f9a535bec6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (63 corresponding lines): compiler/rustc_target/src/callconv/loongarch.rs:214-276 | compiler/rustc_target/src/callconv/riscv.rs:219-281 \u2014 These two members are one piece of code written twice and then edited apart: 63 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_target/src/callconv/loongarch.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"2387fd0096c6e4ca09ba92c7e446f66c3a8565552e60d7c4f8145b4cbcefec47"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (45 corresponding lines): src/tools/rust-analyzer/crates/hir/src/symbols.rs:491-538 | src/tools/rust-analyzer/crates/hir/src/symbols.rs:540-584 \u2014 These two members are one piece of code written twice and then edited apart: 45 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir/src/symbols.rs"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"50f3c0dd775540137a6a72258973391138f7cd459b7c182696e237d2181f1c72"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): src/tools/rust-analyzer/crates/ide-completion/src/render/const_.rs:17-46 | src/tools/rust-analyzer/crates/ide-completion/src/render/type_alias.rs:29-68 \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":"src/tools/rust-analyzer/crates/ide-completion/src/render/const_.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"afde28b58a0f350edd5bfe538eebb8cc90a7ab14d550973fe6e913c66d20b4b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (52 corresponding lines): compiler/rustc_infer/src/infer/canonical/canonicalizer.rs:435-486 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/canonical/canonicalizer.rs:432-483 \u2014 These two members are one piece of code written twice and then edited apart: 52 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_infer/src/infer/canonical/canonicalizer.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"5edbb2fe763a494f6f28919da05c0cc746ad5f079d48bbe8fad0dc206ff0c7ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (41 corresponding lines): compiler/rustc_trait_selection/src/solve/select.rs:45-85 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/select.rs:285-325 \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":"compiler/rustc_trait_selection/src/solve/select.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"213c55ce017c8e3a53acfc7aed2ab177ce4b54245861ee685d7a3365842b0b91"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (46 corresponding lines): compiler/rustc_trait_selection/src/solve/select.rs:94-150 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/select.rs:334-379 \u2014 These two members are one piece of code written twice and then edited apart: 46 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/solve/select.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6d7eb35b7c9e9460e52080179df1f9e0cf876cae51fd46c8a4288c86c13be0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (41 corresponding lines): library/compiler-builtins/libm/src/math/log.rs:75-118 | library/compiler-builtins/libm/src/math/logf.rs:26-66 \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":"library/compiler-builtins/libm/src/math/log.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"91eafe91a32997a2851a8a40e04fa1b2f5c8dbe4972b2364da85e9a17a79ed61"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): compiler/rustc_infer/src/infer/canonical/query_response.rs:580-616 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/canonical/instantiate.rs:487-514 \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":"compiler/rustc_infer/src/infer/canonical/query_response.rs"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"549c730a0e451e666280c0d4527d89efda495739a490a08eff4cb3446951a7f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (59 corresponding lines): src/tools/rustfmt/src/parse/macros/cfg_if.rs:30-100 | src/tools/rustfmt/src/parse/macros/cfg_select.rs:46-104 \u2014 These two members are one piece of code written twice and then edited apart: 59 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/parse/macros/cfg_if.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"542f7939d33716e83ea47c9f010025d09476d9ac7b6f67c11651095d6d0e88b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): compiler/rustc_codegen_gcc/src/builder.rs:1165-1197 | compiler/rustc_codegen_llvm/src/builder.rs:1662-1691 \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":"compiler/rustc_codegen_gcc/src/builder.rs"},"region":{"startLine":1165}}}],"partialFingerprints":{"codehealthFindingId/v1":"af4a896222be5f97d0b502e78beb8c8995c22ae65c80498971aed931f891c0c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): src/tools/clippy/clippy_utils/src/consts.rs:333-359 | src/tools/clippy/clippy_utils/src/consts.rs:386-415 \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/tools/clippy/clippy_utils/src/consts.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"323d83da64480c0e178142e6fb03d2d3089b324889d979c4f17fb7dacf97afac"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (39 corresponding lines): src/tools/clippy/clippy_utils/src/visitors.rs:618-667 | src/tools/clippy/clippy_utils/src/visitors.rs:807-845 \u2014 These two members are one piece of code written twice and then edited apart: 39 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_utils/src/visitors.rs"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"1304bdc00eff6d925d2a74c20a4e87d4a96e452109562a5373ad166d68fcc42c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (51 corresponding lines): src/etc/debugger_tester/gdb/check_gdb.py:72-122 | src/etc/debugger_tester/lldb/check_lldb.py:86-144 \u2014 These two members are one piece of code written twice and then edited apart: 51 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/etc/debugger_tester/gdb/check_gdb.py"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"56b44a91eaa55c66185f7161510c9a37ed9b9e845148d9767eb1898a71e75683"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): compiler/rustc_middle/src/ty/util.rs:1191-1224 | compiler/rustc_middle/src/ty/util.rs:1244-1277 \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":"compiler/rustc_middle/src/ty/util.rs"},"region":{"startLine":1191}}}],"partialFingerprints":{"codehealthFindingId/v1":"6144acc24fcdbb3b1eaad48c87bae54459f237adbc2c0aa3a3d3730cdf5a4217"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (42 corresponding lines): compiler/rustc_codegen_ssa/src/back/write.rs:1853-1908 | compiler/rustc_codegen_ssa/src/back/write.rs:1919-1960 \u2014 These two members are one piece of code written twice and then edited apart: 42 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/back/write.rs"},"region":{"startLine":1853}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e1b2e29440d383470d1b147119180eac2fc734b3aec829648e51ac0f9c614e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): src/tools/rust-analyzer/crates/hir-ty/src/consteval.rs:209-241 | src/tools/rust-analyzer/crates/hir-ty/src/consteval.rs:247-279 \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/tools/rust-analyzer/crates/hir-ty/src/consteval.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dba6afd8d5c98db18b10f1bca3f025afc40a8fdb131abae9f56256d2368d64e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (46 corresponding lines): src/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_comment_from_or_to_doc.rs:36-81 | src/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_comment_from_or_to_doc.rs:83-137 \u2014 These two members are one piece of code written twice and then edited apart: 46 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_comment_from_or_to_doc.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"becbdd99958fb9d9cc1668f9d87cedcacb8fc30ef4638326426b9103e07db84a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (81 corresponding lines): compiler/rustc_hir_typeck/src/callee.rs:377-457 | src/tools/rust-analyzer/crates/hir-ty/src/infer/callee.rs:266-354 \u2014 These two members are one piece of code written twice and then edited apart: 81 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/callee.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"636ca77c9a90e68275da88af401396908b41b15c8484b776cc3a54bb61b1d656"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): src/tools/clippy/clippy_lints/src/manual_pop_if.rs:203-231 | src/tools/clippy/clippy_lints/src/manual_pop_if.rs:359-391 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/manual_pop_if.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"f53a52336ea47b12186d9c48ea5fe365acf1cab707659625099d9a4688b7e789"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (48 corresponding lines): compiler/rustc_infer/src/infer/snapshot/fudge.rs:185-233 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/snapshot/fudge.rs:179-226 \u2014 These two members are one piece of code written twice and then edited apart: 48 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_infer/src/infer/snapshot/fudge.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"5da00c4f3f32f0e01ceab91d9640bdac57e79c8f30b724e2ab145cad12215312"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (60 corresponding lines): compiler/rustc_trait_selection/src/traits/vtable.rs:317-376 | compiler/rustc_trait_selection/src/traits/vtable.rs:388-454 \u2014 These two members are one piece of code written twice and then edited apart: 60 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/traits/vtable.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"752b6890045d33b99ab2dc2a843432dd8e00f7bdca431d78e2991227d804a52b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): src/tools/clippy/clippy_utils/src/ty/mod.rs:837-872 | src/tools/clippy/clippy_utils/src/ty/mod.rs:874-913 \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/tools/clippy/clippy_utils/src/ty/mod.rs"},"region":{"startLine":837}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cb201493014366b1aa4a958043fe1c72b20e27a9db04a4df6b4de509c349cec"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): compiler/rustc_type_ir/src/transmute.rs:75-100 | compiler/rustc_type_ir/src/transmute.rs:106-131 \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":"compiler/rustc_type_ir/src/transmute.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c1a499ea8b4c2184a2c8fd7e67726d9f8a3e7748aa046a63f77c8fff81144f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): src/tools/rust-analyzer/crates/ide/src/inlay_hints.rs:90-124 | src/tools/rust-analyzer/crates/ide/src/inlay_hints.rs:139-170 \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/tools/rust-analyzer/crates/ide/src/inlay_hints.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"1144579ead9755eb7d932009c24e0c55166d9ec8b041509411360ca756308c88"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): compiler/rustc_hir_pretty/src/lib.rs:990-1016 | compiler/rustc_hir_pretty/src/lib.rs:1018-1041 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_pretty/src/lib.rs"},"region":{"startLine":990}}}],"partialFingerprints":{"codehealthFindingId/v1":"235aa4c6b71e852857627fbf3c16299bb7f464e8add37e3b16a8e00a510f8694"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (43 corresponding lines): library/compiler-builtins/libm/src/math/acos.rs:63-112 | library/compiler-builtins/libm/src/math/acosf.rs:37-79 \u2014 These two members are one piece of code written twice and then edited apart: 43 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/compiler-builtins/libm/src/math/acos.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"d56bcbb7e6b434f036c084b2e11c97c73d839252a6a6338e420af424dae7ec87"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): library/compiler-builtins/libm/src/math/exp2m1.rs:621-656 | library/compiler-builtins/libm/src/math/exp2m1.rs:660-692 \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":"library/compiler-builtins/libm/src/math/exp2m1.rs"},"region":{"startLine":621}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcc2eb0c7db9bf535060d87da529b0e4589005e7654658591bffe88bc53143a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): src/tools/clippy/clippy_lints/src/functions/must_use.rs:64-98 | src/tools/clippy/clippy_lints/src/functions/must_use.rs:100-138 \u2014 These two members are one piece of code written twice and then edited apart: 35 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/functions/must_use.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bc3df338f76e8392d7bfc392b9a4e66e1fa9a6f10f2bc782c47422092e8d443"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): src/tools/rust-analyzer/crates/hir/src/semantics/child_by_source.rs:58-82 | src/tools/rust-analyzer/crates/hir/src/semantics/child_by_source.rs:86-109 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir/src/semantics/child_by_source.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fceddffde873bbb8aeaf824bb7b7f17fa8721e3b7f1a283e61c7861b04df78a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (42 corresponding lines): compiler/rustc_index/src/bit_set.rs:630-671 | compiler/rustc_index/src/bit_set.rs:680-728 \u2014 These two members are one piece of code written twice and then edited apart: 42 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_index/src/bit_set.rs"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"77573f5606dcfd851a21ea5b3dfe4c4220629cb0ad197c52e4f84a0a9b038fe6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (46 corresponding lines): src/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_bool_to_enum.rs:348-394 | src/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_tuple_return_type_to_struct.rs:184-229 \u2014 These two members are one piece of code written twice and then edited apart: 46 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_bool_to_enum.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"401d33d1609312cb704e5d85d1b80550f18812a9d9d58a27a1042ca127831279"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (46 corresponding lines): compiler/rustc_lint/src/nonstandard_style.rs:89-138 | src/tools/rust-analyzer/crates/stdx/src/lib.rs:146-191 \u2014 These two members are one piece of code written twice and then edited apart: 46 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_lint/src/nonstandard_style.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"134e04534f3766b0e061eda475a3c38366b091381b2e489498f288fc2ee80475"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (39 corresponding lines): library/std/src/sys/pal/windows/handle.rs:252-296 | library/std/src/sys/pal/windows/handle.rs:304-342 \u2014 These two members are one piece of code written twice and then edited apart: 39 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/pal/windows/handle.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e62db494969df7728a1c881369c8039fc31bc1b013a9da20849a5230cd90bbb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 22\u002B corresponding lines): src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:164-193 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:396-435 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1537-1558 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1795-1839 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1865-1902 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 22 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"f173e726a2b84a58516c0ecf1e3c64351e6ffde799ab7252a5c778e41760887a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): src/tools/rust-analyzer/crates/ide/src/runnables.rs:363-397 | src/tools/rust-analyzer/crates/ide/src/runnables.rs:453-488 \u2014 These two members are one piece of code written twice and then edited apart: 35 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/runnables.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"da1aa7ebff3d4efb66fc160db74fe718a93716304e1e6e480f1fc2ca9ac0885b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): src/tools/rust-analyzer/crates/hir/src/source_analyzer.rs:187-223 | src/tools/rust-analyzer/crates/hir/src/source_analyzer.rs:232-273 \u2014 These two members are one piece of code written twice and then edited apart: 37 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir/src/source_analyzer.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"e71865cdcdee574685767841bc8ddb1066e8e2768aa240ac4921a215feaac829"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): compiler/rustc_hir_typeck/src/coercion.rs:1141-1177 | src/tools/rust-analyzer/crates/hir-ty/src/infer/coerce.rs:827-856 \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":"compiler/rustc_hir_typeck/src/coercion.rs"},"region":{"startLine":1141}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2f44af57ce9e05f8d6547969bd624cbf257932aee32a4fc8a9393a571efe55a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): library/stdarch/crates/intrinsic-test/src/arm/types.rs:9-39 | library/stdarch/crates/intrinsic-test/src/arm/types.rs:41-74 \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":"library/stdarch/crates/intrinsic-test/src/arm/types.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f6d7fe03c10a5432b21b761a86eef0265446242274bbaa7756c76f5ecf06485"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (46 corresponding lines): library/alloc/src/rcs/arc.rs:2408-2453 | library/alloc/src/rcs/rc.rs:2503-2548 \u2014 These two members are one piece of code written twice and then edited apart: 46 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/alloc/src/rcs/arc.rs"},"region":{"startLine":2408}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2682720b0c03634ac939df4a4cb5dadb772ad3c01f9dc11478278c10de7ce0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (42 corresponding lines): compiler/rustc_ast_pretty/src/pprust/state/expr.rs:902-947 | compiler/rustc_hir_pretty/src/lib.rs:2234-2275 \u2014 These two members are one piece of code written twice and then edited apart: 42 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ast_pretty/src/pprust/state/expr.rs"},"region":{"startLine":902}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b2a21ce62a85945ec5671da87463c1299a6a40c97ba5a01f349bce075ebf023"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (44 corresponding lines): library/core/src/str/pattern.rs:1252-1297 | library/core/src/str/pattern.rs:1361-1404 \u2014 These two members are one piece of code written twice and then edited apart: 44 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/str/pattern.rs"},"region":{"startLine":1252}}}],"partialFingerprints":{"codehealthFindingId/v1":"f778cf9eafd6896f6669da2a2b75953d8bd13722696b6d82eeafbeb38f99f2d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): src/tools/rust-analyzer/crates/hir-def/src/import_map.rs:459-493 | src/tools/rust-analyzer/crates/ide-db/src/symbol_index.rs:549-579 \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/tools/rust-analyzer/crates/hir-def/src/import_map.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"c96b1f28b8639c2e66ee225011c4d325fa568b1d332e701d91990473b1b52a24"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 29\u002B corresponding lines): src/tools/rust-analyzer/crates/hir-ty/src/consteval.rs:459-491 | src/tools/rust-analyzer/crates/hir-ty/src/consteval.rs:498-533 | src/tools/rust-analyzer/crates/hir-ty/src/consteval.rs:538-566 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 29 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/tools/rust-analyzer/crates/hir-ty/src/consteval.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c8610309cabbff7db93a48756ec9181e59dbe9983fe89c8262362a9b7cd1191"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): compiler/rustc_codegen_gcc/src/int.rs:974-1005 | compiler/rustc_codegen_gcc/src/int.rs:1024-1059 \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":"compiler/rustc_codegen_gcc/src/int.rs"},"region":{"startLine":974}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa819f81a68256b01b18d25d3e8863a963f65ae243b45d5dba932a553478b147"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 37\u002B corresponding lines): src/tools/rust-analyzer/crates/proc-macro-api/src/legacy_protocol/msg/flat.rs:132-168 | src/tools/rust-analyzer/crates/proc-macro-api/src/legacy_protocol/msg/flat.rs:208-244 | src/tools/rust-analyzer/crates/proc-macro-api/src/legacy_protocol/msg/flat.rs:250-286 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 37 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/tools/rust-analyzer/crates/proc-macro-api/src/legacy_protocol/msg/flat.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"820a55589d4de34208c531670718428d0d8afb37e637e1fdaff4187f9864b7e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): src/tools/clippy/clippy_lints/src/non_copy_const.rs:715-755 | src/tools/clippy/clippy_lints/src/non_copy_const.rs:757-790 \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":"src/tools/clippy/clippy_lints/src/non_copy_const.rs"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfd423b4e76e0d1f24d828b8fb64a27d22978b9f5c7e8f640be6e021c643eeda"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): src/tools/rust-analyzer/crates/ide-completion/src/completions/attribute/diagnostic.rs:14-52 | src/tools/rust-analyzer/crates/ide-completion/src/completions/attribute/repr.rs:12-42 \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/tools/rust-analyzer/crates/ide-completion/src/completions/attribute/diagnostic.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"96efaf31af77280c3abe71189b7a61d14d35bdc25bac83a9565f6f2fbe4c7f91"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): src/tools/rust-analyzer/crates/rust-analyzer/src/handlers/request.rs:1922-1956 | src/tools/rust-analyzer/crates/rust-analyzer/src/handlers/request.rs:1961-1993 \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/tools/rust-analyzer/crates/rust-analyzer/src/handlers/request.rs"},"region":{"startLine":1922}}}],"partialFingerprints":{"codehealthFindingId/v1":"d438567b53ceff4fedd379ca59b33c8933203d081ef07129ada590a466e313cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): compiler/rustc_infer/src/infer/snapshot/undo_log.rs:65-93 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/snapshot/undo_log.rs:64-87 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_infer/src/infer/snapshot/undo_log.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e88bcabdab4a342482dde13ebde3db1fb013a8317868a0e7304f50deda77252"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): src/tools/rust-analyzer/crates/ide-assists/src/handlers/move_from_mod_rs.rs:23-50 | src/tools/rust-analyzer/crates/ide-assists/src/handlers/move_to_mod_rs.rs:23-50 \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/tools/rust-analyzer/crates/ide-assists/src/handlers/move_from_mod_rs.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"aae372ef9bda44a1df025680e538a813ab3cf7a90bf51346d65a9435027cb6fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): compiler/rustc_type_ir/src/inherent.rs:176-209 | compiler/rustc_type_ir/src/ty_kind.rs:399-435 \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":"compiler/rustc_type_ir/src/inherent.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"77bed243bdcb0714918eeb460402ab99abb08bd11faeec8f6ae984bada75712e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): src/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_impl.rs:48-77 | src/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_impl.rs:96-129 \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":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_impl.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e308bedd98bc21eb0ccb1a8ec9db7c5c7d1837ae42eff3815fe98f478c64913"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (52 corresponding lines): compiler/rustc_trait_selection/src/solve/fulfill/derive_errors.rs:88-148 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/errors.rs:188-239 \u2014 These two members are one piece of code written twice and then edited apart: 52 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/solve/fulfill/derive_errors.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"afed1ad5fd31e7de95764f585499614f3d4e8a213910ca271618f40f23652dd0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (56 corresponding lines): compiler/rustc_hir_typeck/src/closure.rs:532-589 | src/tools/rust-analyzer/crates/hir-ty/src/infer/closure.rs:646-701 \u2014 These two members are one piece of code written twice and then edited apart: 56 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/closure.rs"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d9d6ba7bf0a864b17b0c81b8308ffdd94ea4a8dcc77a6a5ad98950fae2eb648"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (44 corresponding lines): library/alloc/src/collections/vec_deque/splice.rs:59-103 | library/alloc/src/vec/splice.rs:55-98 \u2014 These two members are one piece of code written twice and then edited apart: 44 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/alloc/src/collections/vec_deque/splice.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ccd4713e086991d55a5361e95d2ce38163de4fcd8838b272cff17dd305b9410"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): src/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_for_to_while_let.rs:119-148 | src/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_iter_for_each_to_for.rs:161-190 \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":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_for_to_while_let.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"458b3211c9ba6331181fe66bac97aff67d22bf5ddbaf7bbe94304d8e547eaaff"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): src/tools/rust-analyzer/xtask/src/codegen/diagnostics_docs.rs:32-58 | src/tools/rust-analyzer/xtask/src/codegen/feature_docs.rs:31-57 \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/tools/rust-analyzer/xtask/src/codegen/diagnostics_docs.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"f674f633d6db679b54150e879d5a550422b5403412a7db266d332b7cd4da1878"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 38\u002B corresponding lines): library/compiler-builtins/libm/src/math/erf.rs:223-260 | library/compiler-builtins/libm/src/math/erf.rs:268-314 | library/compiler-builtins/libm/src/math/erff.rs:134-171 | library/compiler-builtins/libm/src/math/erff.rs:179-226 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 38 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":"library/compiler-builtins/libm/src/math/erf.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4bb5ef4dcd807ac3f2c06b75402ff8ebea5bba1f5da170300ff6ae1bd29a9e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (41 corresponding lines): src/bootstrap/src/core/build_steps/compile.rs:1704-1744 | src/bootstrap/src/core/build_steps/compile.rs:1773-1818 \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/bootstrap/src/core/build_steps/compile.rs"},"region":{"startLine":1704}}}],"partialFingerprints":{"codehealthFindingId/v1":"bed1c3b5c4be0f33f656f4ca7b8a30b355541e2271eea87e098b151571ba6f40"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): compiler/rustc_hir_analysis/src/check/compare_eii.rs:543-571 | compiler/rustc_hir_analysis/src/check/compare_impl_item.rs:1519-1537 \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":"compiler/rustc_hir_analysis/src/check/compare_eii.rs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"de8fd4285fcc6a1b7c99f5fc6aba59831b05073d6cb9f78ade0201f808edac17"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): src/tools/rust-analyzer/crates/proc-macro-srv/src/token_stream.rs:525-567 | src/tools/rust-analyzer/crates/tt/src/lib.rs:666-690 \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/tools/rust-analyzer/crates/proc-macro-srv/src/token_stream.rs"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"b22962cde3aa4e406d9a3abd5861be2df10ea04242aec013749b15786c7f37dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (70 corresponding lines): compiler/rustc_infer/src/infer/relate/type_relating.rs:282-351 | compiler/rustc_type_ir/src/relate/solver_relating.rs:268-338 \u2014 These two members are one piece of code written twice and then edited apart: 70 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_infer/src/infer/relate/type_relating.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfb0fe9978cf9ad9718f5dc05ffeae95d3164cdf0181cd1fa8d829ef3745d210"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): compiler/rustc_middle/src/ty/cast.rs:50-73 | src/tools/rust-analyzer/crates/hir-ty/src/mir/lower.rs:1979-1995 \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":"compiler/rustc_middle/src/ty/cast.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"243efa3a9d0d7f27d452dd8f57c8291249950f9ff6a26a642edece92b6fa4c5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (56 corresponding lines): library/compiler-builtins/libm/src/math/cosf.rs:31-86 | library/compiler-builtins/libm/src/math/sinf.rs:31-96 \u2014 These two members are one piece of code written twice and then edited apart: 56 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/compiler-builtins/libm/src/math/cosf.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ccba304fc844d0e62d753d9369bf5fb2e1ca5378ac764ba0983753524dd44bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): compiler/rustc_codegen_llvm/src/debuginfo/mod.rs:488-525 | compiler/rustc_codegen_llvm/src/debuginfo/mod.rs:535-575 \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":"compiler/rustc_codegen_llvm/src/debuginfo/mod.rs"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"42d1e1e525c4678a1a27d5a50d91db7c66ce19f0939a9a12bff8c7bcd66d249f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): compiler/rustc_hir/src/hir.rs:1535-1551 | compiler/rustc_hir/src/hir.rs:1563-1578 \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":"compiler/rustc_hir/src/hir.rs"},"region":{"startLine":1535}}}],"partialFingerprints":{"codehealthFindingId/v1":"850921a4a74c0b7f46d7971062b24dbd21e921623880b94a577cd9b2f5ac1bb2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): compiler/rustc_mir_build/src/builder/scope.rs:545-581 | compiler/rustc_mir_build/src/builder/scope.rs:595-634 \u2014 These two members are one piece of code written twice and then edited apart: 37 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_build/src/builder/scope.rs"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"a900d56127570213b6ed79b53fd3328c3221737ec427374e4d46e6a735c974d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): compiler/rustc_ast_pretty/src/pprust/state/expr.rs:293-344 | compiler/rustc_hir_pretty/src/lib.rs:1420-1448 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ast_pretty/src/pprust/state/expr.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"f135aa87fc1ef84fb3c7384d2a446dc1a11cc31811ed00a867e861d876956093"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): compiler/rustc_trait_selection/src/traits/util.rs:224-263 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/util.rs:735-779 \u2014 These two members are one piece of code written twice and then edited apart: 40 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/traits/util.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"75c0e0e1597c3eba26d7d4bf6ecac33e276c458e7b8e2cfe633f80bd18f082a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (41 corresponding lines): src/tools/miri/src/shims/unix/fd.rs:377-419 | src/tools/miri/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/tools/miri/src/shims/unix/fd.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"948438439e688b971d19fba77ad33b19fb98e7dfa4b91e073fd572a7b3119e5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): src/tools/miri/src/shims/unix/tcp_socket.rs:607-644 | src/tools/miri/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/tools/miri/src/shims/unix/tcp_socket.rs"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"c06219d0be6e91127a42f237e5c128862af6d88395a4741c34f9cf455720dff7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): library/std/src/sys/net/connection/uefi/tcp4.rs:204-240 | library/std/src/sys/net/connection/uefi/tcp4.rs:289-323 \u2014 These two members are one piece of code written twice and then edited apart: 35 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/net/connection/uefi/tcp4.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d1c1ec2cfa4a65bc56ff110f80982cde3020b6cc3b78c5a54c443987e11e459"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): src/tools/miri/src/shims/unix/fd.rs:690-725 | src/tools/miri/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/tools/miri/src/shims/unix/fd.rs"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bfabb973f2c84ecb5fd8d31e7b8ad946c9f1129a3710e9d6a057ac3799adf3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): src/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_named_struct_to_tuple_struct.rs:288-316 | src/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_tuple_struct_to_named_struct.rs:346-370 \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/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_named_struct_to_tuple_struct.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f3ca6d854d7e37c865858ee243e1337728fb7082dc27c700fd97423258f63ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 17\u002B corresponding lines): compiler/rustc_codegen_gcc/src/intrinsic/llvm.rs:14-30 | compiler/rustc_codegen_gcc/src/intrinsic/llvm.rs:34-51 | compiler/rustc_codegen_gcc/src/intrinsic/llvm.rs:67-85 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 17 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_gcc/src/intrinsic/llvm.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e7c9661632bd5ef08c2b1293ec5afe7fbc8249da8313a2c143404f63ba495e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (47 corresponding lines): compiler/rustc_hir_typeck/src/callee.rs:1251-1304 | src/tools/rust-analyzer/crates/hir-ty/src/infer/callee.rs:544-590 \u2014 These two members are one piece of code written twice and then edited apart: 47 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/callee.rs"},"region":{"startLine":1251}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dd7031eb3737caca29ec266dac5bb746967c000d686ab93e7dad570b54410d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): library/alloc/src/collections/vec_deque/into_iter.rs:80-116 | library/alloc/src/collections/vec_deque/into_iter.rs:203-236 \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":"library/alloc/src/collections/vec_deque/into_iter.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"31541f74e3577bb7dd51aa1febea7e0cab4c7c7a46560f64bec17d00a1c26beb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): library/stdarch/crates/intrinsic-test/src/loongarch/types.rs:5-35 | library/stdarch/crates/intrinsic-test/src/loongarch/types.rs:37-65 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/intrinsic-test/src/loongarch/types.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"204fe0daa18aaae5b78493b1d29f27c7e3bfeeec4cf2760b18f35e1133b5dd9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (55 corresponding lines): compiler/rustc_hir_typeck/src/method/probe.rs:2298-2352 | src/tools/rust-analyzer/crates/hir-ty/src/method_resolution/probe.rs:1799-1854 \u2014 These two members are one piece of code written twice and then edited apart: 55 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/method/probe.rs"},"region":{"startLine":2298}}}],"partialFingerprints":{"codehealthFindingId/v1":"55948969a71c99bf11033432050533dacfbfc1aa3811d8478a1f711e175d69a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 34\u002B corresponding lines): library/std/src/os/xous/ffi.rs:22-55 | library/std/src/os/xous/ffi.rs:84-119 | library/std/src/os/xous/ffi.rs:188-225 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 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":"library/std/src/os/xous/ffi.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"54bfdb1e530c2eb61e347618159469520d5333b5c47b2c62a2f6515c99dc1033"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): src/tools/rust-analyzer/crates/proc-macro-srv-cli/src/main_loop.rs:289-320 | src/tools/rust-analyzer/crates/proc-macro-srv-cli/src/main_loop.rs:325-354 \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":"src/tools/rust-analyzer/crates/proc-macro-srv-cli/src/main_loop.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e00cb431c039dfcb38c3f0ddbbe718dce0d5531aa4bd3c5dbbcd6fd3062344d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): library/compiler-builtins/libm/src/math/j0.rs:169-206 | library/compiler-builtins/libm/src/math/j0f.rs:114-144 \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":"library/compiler-builtins/libm/src/math/j0.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"1557dbf76a01eab102bbd49e41c0be99cc48f4eb20dd8c9c5c906d8f9a616be3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): src/tools/rust-analyzer/crates/syntax/src/syntax_editor/edits.rs:213-242 | src/tools/rust-analyzer/crates/syntax/src/syntax_editor/edits.rs:372-393 \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/tools/rust-analyzer/crates/syntax/src/syntax_editor/edits.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6264567a817ecccc7ad391e8179d4e04fcb56a3673796406ac3e80da6e588f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): src/tools/clippy/clippy_lints/src/doc/include_in_doc_without_cfg.rs:9-44 | src/tools/clippy/clippy_lints/src/large_include_file.rs:87-125 \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/tools/clippy/clippy_lints/src/doc/include_in_doc_without_cfg.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"43211d2b97c33194c5a2bcf11e2be526b2879ce53b2507047f41c34f03a7d385"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): src/tools/rust-analyzer/crates/hir-def/src/item_tree/lower.rs:67-100 | src/tools/rust-analyzer/crates/hir-def/src/item_tree/lower.rs:102-126 \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/tools/rust-analyzer/crates/hir-def/src/item_tree/lower.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1c88828084860de6e19c40aadeabda5ec61007e558d0e450003ae6ed1d09005"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:668-687 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1481-1504 \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/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs"},"region":{"startLine":668}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcdee26f57267c0615d5886fca1cb18ee9a7b3c2fe2c48ef1a1ff1112e81bfe1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): src/tools/miri/src/machine.rs:1695-1726 | src/tools/miri/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/tools/miri/src/machine.rs"},"region":{"startLine":1695}}}],"partialFingerprints":{"codehealthFindingId/v1":"74c3f25709b5ca209bf88ca38f4bdb9d6d43460f6d9a3b1651df057b55d7e07e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): src/tools/clippy/clippy_config/src/types.rs:161-192 | src/tools/clippy/clippy_config/src/types.rs:196-228 \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/tools/clippy/clippy_config/src/types.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"022f932c577b2c64a5d35587298e7b3ef491e83bb5fb88bbe6f1e008e9ce7498"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): compiler/rustc_parse/src/diagnostics.rs:1542-1589 | compiler/rustc_parse/src/diagnostics.rs:1608-1647 \u2014 These two members are one piece of code written twice and then edited apart: 40 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/diagnostics.rs"},"region":{"startLine":1542}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5b5e079aa960dfd2f6c90ee4c8edc2324bfd227d01500eaa828020cac00bfb2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): library/compiler-builtins/libm/src/math/hypotf.rs:4-41 | library/compiler-builtins/libm/src/math/relaxed/hypotf64.rs:19-72 \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":"library/compiler-builtins/libm/src/math/hypotf.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c76165c4b972caa4baf17e5bc47eb1d60fb2e81fcf8439bb4837dee9bf0c1d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 39\u002B corresponding lines): library/std/src/sync/mpmc/array.rs:323-361 | library/std/src/sync/mpmc/array.rs:375-415 | library/std/src/sync/mpmc/list.rs:426-466 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 39 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":"library/std/src/sync/mpmc/array.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"87800515791d2d18c74497d31233374e288192ad6cea8cf3641aa5cc5a4b36df"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (53 corresponding lines): library/core/src/slice/sort/select.rs:73-144 | library/core/src/slice/sort/unstable/quicksort.rs:28-80 \u2014 These two members are one piece of code written twice and then edited apart: 53 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/slice/sort/select.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca08ead5b0c474467bdb86931d81c40c6e7a90beb5766cfbc8c33da2d254ab1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 35\u002B corresponding lines): library/alloc/src/vec/into_iter.rs:331-365 | library/alloc/src/vec/into_iter.rs:473-511 | library/core/src/iter/adapters/copied.rs:212-250 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 35 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":"library/alloc/src/vec/into_iter.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ee28e1154d4d477aa9d896d9d1ca377e9d127b087a626b21e90255774e3795a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): src/tools/rust-analyzer/crates/cfg/src/lib.rs:201-235 | src/tools/rust-analyzer/crates/cfg/src/lib.rs:244-280 \u2014 These two members are one piece of code written twice and then edited apart: 35 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/cfg/src/lib.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9aeaf6d24d8dadd0690ae497be0804a291a4530243cffcd79abbeb8f0a5b09e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 34\u002B corresponding lines): src/tools/miri/src/shims/unix/tcp_socket.rs:976-1009 | src/tools/miri/src/shims/unix/tcp_socket.rs:1083-1117 | src/tools/miri/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/tools/miri/src/shims/unix/tcp_socket.rs"},"region":{"startLine":976}}}],"partialFingerprints":{"codehealthFindingId/v1":"358da9d8943a5ad383d9ff8758be7985ac9dd61cbed9f087ded41dafa81542ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): library/std/src/process.rs:2470-2492 | library/std/src/sys/process/mod.rs:54-77 \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":"library/std/src/process.rs"},"region":{"startLine":2470}}}],"partialFingerprints":{"codehealthFindingId/v1":"03082c758f0616b5de491a4f063b20bf7af4b24b400aefabaa37b6f8c4188acf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): src/tools/clippy/clippy_utils/src/ty/mod.rs:1233-1262 | src/tools/clippy/clippy_utils/src/ty/mod.rs:1396-1427 \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":"src/tools/clippy/clippy_utils/src/ty/mod.rs"},"region":{"startLine":1233}}}],"partialFingerprints":{"codehealthFindingId/v1":"a55f5b5ca7036482c7c68e61f3d7d6301226937bca5901daebc8e9402999368c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): src/tools/rust-analyzer/crates/ide-db/src/helpers.rs:39-58 | src/tools/rust-analyzer/crates/ide-db/src/helpers.rs:64-83 \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/tools/rust-analyzer/crates/ide-db/src/helpers.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea0e63e1b33e852b40e2f29ffda8a8a5969269a2bb3a18b0dcfcd022c4dab920"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): src/tools/rustfmt/check_diff/src/lib.rs:319-354 | src/tools/rustfmt/check_diff/src/lib.rs:362-397 \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/tools/rustfmt/check_diff/src/lib.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"81e894654264b020ebbd041e911496455ba3e6c5148d2484854c2244dcc4d2a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): compiler/rustc_codegen_gcc/build_system/src/fuzz.rs:164-193 | compiler/rustc_codegen_gcc/build_system/src/fuzz.rs:196-227 \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":"compiler/rustc_codegen_gcc/build_system/src/fuzz.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"75868ba46d8a9a1d92b60ad356f69e5e5b9d17742bbaa24cdddde08a6c557ab0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): src/tools/clippy/clippy_lints/src/empty_with_brackets.rs:292-314 | src/tools/clippy/clippy_lints/src/empty_with_brackets.rs:316-335 \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/tools/clippy/clippy_lints/src/empty_with_brackets.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"ece78a57e1c8305d0118fc1380ba2ad82b4642fdbaa9f86a74ca829358f918e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): src/tools/miri/src/shims/unix/socket.rs:458-490 | src/tools/miri/src/shims/unix/socket.rs:869-910 \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/tools/miri/src/shims/unix/socket.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"209d60e47c02d5a1638b468d5b4edd047b34143f15453ba4e85a4fd7c82fffe8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): src/tools/rust-analyzer/crates/hir-def/src/resolver.rs:805-842 | src/tools/rust-analyzer/crates/hir-def/src/resolver.rs:853-892 \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/tools/rust-analyzer/crates/hir-def/src/resolver.rs"},"region":{"startLine":805}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd93d9a94b3db97502893cc30cf696be49b461d249b68992568e9c18d6a59a1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): library/compiler-builtins/libm/src/math/j0.rs:114-153 | library/compiler-builtins/libm/src/math/j0f.rs:67-98 \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":"library/compiler-builtins/libm/src/math/j0.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"350727414761b2cc8f57181f5349cebf47f00de0d3360602e98bd73d234cad43"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): src/tools/clippy/clippy_dev/src/utils.rs:469-492 | src/tools/clippy/clippy_dev/src/utils.rs:495-522 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_dev/src/utils.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"968275182d11d3e20c3642130132a8b7296a2e599543995fb10b2c71db0465f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): compiler/rustc_attr_parsing/src/attributes/rustc_dump.rs:139-178 | compiler/rustc_attr_parsing/src/attributes/rustc_dump.rs:315-343 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_attr_parsing/src/attributes/rustc_dump.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa795d668aad1d4789aa8f37895181a14d64cb8e1e776719047f46586d99e03d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): compiler/rustc_builtin_macros/src/deriving/clone.rs:112-164 | compiler/rustc_builtin_macros/src/deriving/eq.rs:52-89 \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":"compiler/rustc_builtin_macros/src/deriving/clone.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb846de7fe22b31e3dae073bd657843d1c04ad8d630ecbf3462ed950611cc5a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): compiler/rustc_infer/src/infer/region_constraints/mod.rs:785-809 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/region_constraints/mod.rs:544-564 \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":"compiler/rustc_infer/src/infer/region_constraints/mod.rs"},"region":{"startLine":785}}}],"partialFingerprints":{"codehealthFindingId/v1":"15a23e7cfbf976ea0b781210a2cce11cffbbd3b02284c67db6b620eabe9b9df9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (41 corresponding lines): library/alloc/src/boxed/thin.rs:230-275 | library/alloc/src/boxed/thin.rs:279-319 \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":"library/alloc/src/boxed/thin.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"75d3848edbbdb38f62c8bc4f35ccd88e062c026b307b9eb9e593943340575a1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): src/tools/rust-analyzer/crates/hir-def/src/signatures.rs:177-210 | src/tools/rust-analyzer/crates/hir-def/src/signatures.rs:253-287 \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":"src/tools/rust-analyzer/crates/hir-def/src/signatures.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"1985c5cac6a8b64ef3c1a4146b96f51cd3aefa34b8d4555bdc8eaffcb5082a95"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): src/tools/clippy/clippy_dev/src/utils.rs:657-677 | src/tools/clippy/clippy_dev/src/utils.rs:682-703 \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/tools/clippy/clippy_dev/src/utils.rs"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"183056c205475ab3cf8ecf6471622d7e1901e673460c69359750fbff9408a47f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): src/tools/clippy/clippy_lints/src/derive/derive_ord_xor_partial_ord.rs:18-54 | src/tools/clippy/clippy_lints/src/derive/derived_hash_with_manual_eq.rs:17-51 \u2014 These two members are one piece of code written twice and then edited apart: 35 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/derive/derive_ord_xor_partial_ord.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"378282de70a489dea3397270642c03d761b15b5b6d27375c6a983461bf5c7cac"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): src/tools/miri/src/concurrency/weak_memory.rs:504-536 | src/tools/miri/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/tools/miri/src/concurrency/weak_memory.rs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"cea36368cddefda584282845b8a2a643226bf313dd184748eb0cca599b8b54de"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): compiler/rustc_hir_typeck/src/coercion.rs:163-212 | src/tools/rust-analyzer/crates/hir-ty/src/infer/coerce.rs:159-187 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/coercion.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b042c1f1d78e542102a078c088b41da92cb7ee5ef07892d018b08c1a9230198"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): compiler/rustc_trait_selection/src/solve/inspect/analyse.rs:98-133 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/inspect.rs:161-193 \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":"compiler/rustc_trait_selection/src/solve/inspect/analyse.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e6fcc42e20494e011514b047ab21453b4775cf9768e59004848a29f8deb9f38"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): src/tools/miri/src/shims/unix/fs.rs:1234-1264 | src/tools/miri/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/tools/miri/src/shims/unix/fs.rs"},"region":{"startLine":1234}}}],"partialFingerprints":{"codehealthFindingId/v1":"310ea51cf526f73166cc21bc3e9b7f07c9d62dd58738fe165b5b037b6f96fcd0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (41 corresponding lines): compiler/rustc_const_eval/src/interpret/operand.rs:791-831 | compiler/rustc_const_eval/src/interpret/place.rs:604-644 \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":"compiler/rustc_const_eval/src/interpret/operand.rs"},"region":{"startLine":791}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cf58b5d7dbea19e4a568c77f5008d0e5b52937e3a799ee3e982e1e2274e7304"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): library/compiler-builtins/libm/src/math/modf.rs:2-35 | library/compiler-builtins/libm/src/math/modff.rs:2-34 \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":"library/compiler-builtins/libm/src/math/modf.rs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"798d2a8b57e581f246ac094ac76b7e2485adf08cd9c872370914585239d0dd43"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): library/compiler-builtins/libm/src/math/nextafter.rs:2-37 | library/compiler-builtins/libm/src/math/nextafterf.rs:2-37 \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":"library/compiler-builtins/libm/src/math/nextafter.rs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"74274240a5247b65aa3bbcbb97e9a37a78bc8878ae4c0175e47d2b398902b1bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): library/std/src/sys/fs/uefi.rs:713-737 | library/std/src/sys/fs/uefi.rs:758-787 \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":"library/std/src/sys/fs/uefi.rs"},"region":{"startLine":713}}}],"partialFingerprints":{"codehealthFindingId/v1":"246836e666839e7c55fd3b0cf5d4d4ff1c07192f45d4870e1aa0f51f501f9c3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 25\u002B corresponding lines): src/tools/miri/src/shims/unix/fs.rs:931-956 | src/tools/miri/src/shims/unix/fs.rs:959-984 | src/tools/miri/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/tools/miri/src/shims/unix/fs.rs"},"region":{"startLine":931}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8dbeee75477f1e433aef48fe708e28fbc0c2323f4c2aacf31ccd9fff68ec577"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): src/tools/miri/src/shims/io_error.rs:358-393 | src/tools/miri/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/tools/miri/src/shims/io_error.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"1041013a6ddd14b5f95144fcceec826381cd2473141a119272869ea1d2626d57"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): src/tools/rust-analyzer/crates/ide-assists/src/handlers/flip_or_pattern.rs:24-40 | src/tools/rust-analyzer/crates/ide-assists/src/handlers/flip_trait_bound.rs:20-42 \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/tools/rust-analyzer/crates/ide-assists/src/handlers/flip_or_pattern.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"76f5f64d0c124c47e64d2780345c04a34eb6e3f389f58bbcd99e74ad9d2b5003"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): src/tools/rustfmt/src/header.rs:82-105 | src/tools/rustfmt/src/utils.rs:57-76 \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/tools/rustfmt/src/header.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee6bdc4491b16a5a45be9ac27a4d97ca42e2ac9aa6b530d9a95b39026fb35128"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): compiler/rustc_next_trait_solver/src/solve/trait_goals.rs:402-434 | compiler/rustc_next_trait_solver/src/solve/trait_goals.rs:440-484 \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":"compiler/rustc_next_trait_solver/src/solve/trait_goals.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"5abe4e34fe5d12def5a611ccee70777b91584d74f83b0c680cba419b3e204869"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): library/compiler-builtins/libm/src/math/j1.rs:118-146 | library/compiler-builtins/libm/src/math/j1f.rs:68-95 \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":"library/compiler-builtins/libm/src/math/j1.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"b83f16b5bc3c74abef94954fa051a1bc8300d4876d8727c273dce0dbf33e06bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): src/tools/clippy/clippy_utils/src/consts.rs:310-329 | src/tools/clippy/clippy_utils/src/consts.rs:363-382 \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/tools/clippy/clippy_utils/src/consts.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"895bd84148615730714721422fb7db111750c943cf665042bae3fd6e1cbeffba"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): src/tools/rust-analyzer/crates/hir-def/src/item_scope.rs:366-378 | src/tools/rust-analyzer/crates/hir-def/src/item_scope.rs:385-421 \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/tools/rust-analyzer/crates/hir-def/src/item_scope.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"e88983d6a10387a7f6e78eee89a0fdec587195240d549ff1a5f528da55fbbb34"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): src/tools/rust-analyzer/crates/hir-ty/src/infer/expr.rs:74-97 | src/tools/rust-analyzer/crates/hir-ty/src/infer/expr.rs:289-314 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/infer/expr.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"593d09b56c128045658c715cb7b30219f27491e26c93521496477f2e2133ef13"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): compiler/rustc_macros/src/extension.rs:83-116 | src/tools/rust-analyzer/crates/macros/src/extension.rs:86-117 \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":"compiler/rustc_macros/src/extension.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd3ac2167fb8a6d53b7edc3c04bae294af40828aac78fac578b9371f4b057a39"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): compiler/rustc_mir_dataflow/src/impls/precise_liveness.rs:575-596 | compiler/rustc_mir_transform/src/dest_prop.rs:446-471 \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":"compiler/rustc_mir_dataflow/src/impls/precise_liveness.rs"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e94996123bb4c7b010946ac5c78a83e400a99b91a8eb3a7dab06b97e50fde3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): library/std/src/sys/sync/thread_parking/pthread.rs:46-88 | library/std/src/sys/sync/thread_parking/pthread.rs:93-132 \u2014 These two members are one piece of code written twice and then edited apart: 40 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/sync/thread_parking/pthread.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9d20a53116ff5f20b452499733c81f1a51b08921efee783d945940658a1f9cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): compiler/rustc_hir_typeck/src/fallback.rs:278-314 | src/tools/rust-analyzer/crates/hir-ty/src/infer/fallback.rs:395-432 \u2014 These two members are one piece of code written twice and then edited apart: 37 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/fallback.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeb922d3e9c708e7edb61085e9ba2acd9b2ef9bc444da70f90d5c57d90b64c48"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): compiler/rustc_hir_analysis/src/check/wfcheck.rs:1179-1202 | compiler/rustc_hir_analysis/src/check/wfcheck.rs:1204-1227 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/check/wfcheck.rs"},"region":{"startLine":1179}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5c089bbb7949de416f2798adaa37a3e61fb51afe6ce95156fb757a71270488e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): compiler/rustc_trait_selection/src/solve/fulfill/derive_errors.rs:317-339 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/errors.rs:449-471 \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":"compiler/rustc_trait_selection/src/solve/fulfill/derive_errors.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"81e06297b95dd88d6ece27cd3ff56cc36ecd687c6dbd84fc15594c61898d0e67"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): src/tools/miri/src/concurrency/data_race.rs:1222-1253 | src/tools/miri/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/tools/miri/src/concurrency/data_race.rs"},"region":{"startLine":1222}}}],"partialFingerprints":{"codehealthFindingId/v1":"f511b1fb5a1a80dac6f49f702b1f577a920c632c93597e2bafef62553f9a7176"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): src/tools/rust-analyzer/crates/hir-ty/src/next_solver/def_id.rs:246-265 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/def_id.rs:272-291 \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/tools/rust-analyzer/crates/hir-ty/src/next_solver/def_id.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"625a4305b4d2981469f8c08cead05bcddea5c6612e817ec0dc930060e7e1cf02"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 18\u002B corresponding lines): src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:528-545 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:994-1021 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1027-1052 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1235-1252 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 18 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/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"b89ab7cf669ff7d6111fe5a50f2de2e2f4a63edbe818ecfea775605eed009809"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): compiler/rustc_span/src/analyze_source_file.rs:265-298 | src/tools/rust-analyzer/lib/line-index/src/lib.rs:473-511 \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":"compiler/rustc_span/src/analyze_source_file.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d2435d52c62114d08776a7c7f09ca85708deec36e062b5a30a53f97bc88542f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (41 corresponding lines): library/alloc/src/rcs/arc.rs:828-881 | library/alloc/src/rcs/rc.rs:804-844 \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":"library/alloc/src/rcs/arc.rs"},"region":{"startLine":828}}}],"partialFingerprints":{"codehealthFindingId/v1":"f84c0b96a6486d86f7b13da0b26dffeaf249414679331e542027f17991474ae1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): compiler/rustc_infer/src/infer/relate/generalize.rs:286-311 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/relate/generalize.rs:230-258 \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":"compiler/rustc_infer/src/infer/relate/generalize.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ab963ddbdccde28d083e86e1d9292b0563ed6bd28ad1dd3cd549180ee69134c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): src/tools/miri/src/shims/unix/fs.rs:810-837 | src/tools/miri/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/tools/miri/src/shims/unix/fs.rs"},"region":{"startLine":810}}}],"partialFingerprints":{"codehealthFindingId/v1":"d273f41d7a5bc9a385cc7c95628022a6d8f5e58b0367411dc9188cd46a6b5718"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): library/std/src/alloc.rs:184-222 | library/std/src/alloc.rs:276-311 \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":"library/std/src/alloc.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f7882639d1b5be009bbcf00f266984f821dc3615d93638c91e1141a022fe626"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 23\u002B corresponding lines): library/std/src/sys/fs/hermit.rs:370-392 | library/std/src/sys/fs/solid.rs:282-304 | library/std/src/sys/fs/unix.rs:1183-1211 \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":"library/std/src/sys/fs/hermit.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4e24bf1f7ad61941491c68a196b2d9f2d99b507cec0fe13793acb21ceaa603e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): src/tools/miri/src/shims/unix/env.rs:144-170 | src/tools/miri/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/tools/miri/src/shims/unix/env.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"03b038a92ad5800c9f4c9a00928ea92084ea8ed1a9b70d003f1d8d45d6fe3b28"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): compiler/rustc_borrowck/src/type_check/relate_tys.rs:195-232 | compiler/rustc_borrowck/src/type_check/relate_tys.rs:238-270 \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":"compiler/rustc_borrowck/src/type_check/relate_tys.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b50a2c96e38f5b51378171eb0b6500f5b761af920734392cffa9bd9e2dace95"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (48 corresponding lines): compiler/rustc_infer/src/infer/canonical/canonicalizer.rs:160-207 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/canonical/canonicalizer.rs:165-212 \u2014 These two members are one piece of code written twice and then edited apart: 48 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_infer/src/infer/canonical/canonicalizer.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"3be17fd7fc1689a495be8c760cb740679e0a54827eb2d2b27eb31a38af656c02"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 33\u002B corresponding lines): compiler/rustc_middle/src/ty/layout.rs:84-130 | src/tools/rust-analyzer/crates/hir-ty/src/layout/adt.rs:123-155 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/util.rs:180-215 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 33 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":"compiler/rustc_middle/src/ty/layout.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8d472874c8266fcf66f2a5cc9858be3f8be1afc6b2aaf2d133e4d455b82915a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx2.rs:2555-2583 | library/stdarch/crates/core_arch/src/x86/avx2.rs:2596-2624 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx2.rs"},"region":{"startLine":2555}}}],"partialFingerprints":{"codehealthFindingId/v1":"1903db502477bb190bdcc0da6146df4bffc44f8c8d7f7acc7c6587064bfe1fd1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512bw.rs:4428-4446 | library/stdarch/crates/core_arch/src/x86/avx512bw.rs:4794-4812 \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":"library/stdarch/crates/core_arch/src/x86/avx512bw.rs"},"region":{"startLine":4428}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3314c5e80b25d6c4b9e44e2eb9026bc36698d4b6bfc73f6b6a935b9ac913cea"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512bw.rs:4489-4507 | library/stdarch/crates/core_arch/src/x86/avx512bw.rs:4855-4873 \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":"library/stdarch/crates/core_arch/src/x86/avx512bw.rs"},"region":{"startLine":4489}}}],"partialFingerprints":{"codehealthFindingId/v1":"113d9fad4110a048fc151d9f724f0f0b112b88cefc15bdfdf0a794db26da9771"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512bw.rs:4550-4568 | library/stdarch/crates/core_arch/src/x86/avx512bw.rs:4916-4934 \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":"library/stdarch/crates/core_arch/src/x86/avx512bw.rs"},"region":{"startLine":4550}}}],"partialFingerprints":{"codehealthFindingId/v1":"24c4c65299810295d428fa3416625c461fc0f76a1443ce03049816ccd9e930e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512bw.rs:4611-4629 | library/stdarch/crates/core_arch/src/x86/avx512bw.rs:4977-4995 \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":"library/stdarch/crates/core_arch/src/x86/avx512bw.rs"},"region":{"startLine":4611}}}],"partialFingerprints":{"codehealthFindingId/v1":"740b45436c332fa35871e711f09925fd8c5979461ae12948d131e33ee74d0a5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512bw.rs:4672-4690 | library/stdarch/crates/core_arch/src/x86/avx512bw.rs:5038-5056 \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":"library/stdarch/crates/core_arch/src/x86/avx512bw.rs"},"region":{"startLine":4672}}}],"partialFingerprints":{"codehealthFindingId/v1":"eed25ae6449405f5ce3a178a583651a65b352b47d6716de4d84a18684c7078cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512bw.rs:4733-4751 | library/stdarch/crates/core_arch/src/x86/avx512bw.rs:5099-5117 \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":"library/stdarch/crates/core_arch/src/x86/avx512bw.rs"},"region":{"startLine":4733}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a8856e4c6f5f5b6963ceeaa876fdff8ff387e2db509c382d2a832b6d5bdf566"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512f.rs:32712-32730 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:33333-33351 \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":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":32712}}}],"partialFingerprints":{"codehealthFindingId/v1":"da6a685866c70c496eaed0c4f1326114bc2984ff495f47b3a5116c987987fe7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512f.rs:32776-32794 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:33397-33415 \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":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":32776}}}],"partialFingerprints":{"codehealthFindingId/v1":"a932a7dc081677dd52354a796366c3b765de1a8831cdb63fda148dd14156f52e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512f.rs:32837-32855 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:33458-33476 \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":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":32837}}}],"partialFingerprints":{"codehealthFindingId/v1":"a498a78c6b67196df5d51d999bafa643e0dfc73fb1eb590e7a6058a0d8499481"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512f.rs:33954-33972 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:34575-34593 \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":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":33954}}}],"partialFingerprints":{"codehealthFindingId/v1":"c39ef5175bd9bae370baf2f076f558f9895ff025705802ef93226f82ed7262ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512f.rs:34018-34036 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:34639-34657 \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":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":34018}}}],"partialFingerprints":{"codehealthFindingId/v1":"79421140af9eaa629dca3aebfdf2d934582ff53b0b00ebd5964c48693fd61344"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512f.rs:34079-34097 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:34700-34718 \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":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":34079}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c28b405d25706dd290df67365227093b093558e43749c93311137f6f49a842c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 24\u002B corresponding lines): src/tools/clippy/clippy_utils/src/res.rs:129-152 | src/tools/clippy/clippy_utils/src/res.rs:180-206 | src/tools/clippy/clippy_utils/src/res.rs:214-248 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 24 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_utils/src/res.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"957987db47afaf74334ed9489e571d076dd931a37fb44b57b700f03beefd3371"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): src/tools/rust-analyzer/crates/hir-ty/src/next_solver/normalize.rs:178-202 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/normalize.rs:204-228 \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/tools/rust-analyzer/crates/hir-ty/src/next_solver/normalize.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1e3e92d787a0af0f9ce2ba08381142379358b2b03c630a3cd17364cfc44ed02"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 21\u002B corresponding lines): library/std/src/sys/net/connection/uefi/tcp4.rs:161-181 | library/std/src/sys/net/connection/uefi/tcp4.rs:246-266 | library/std/src/sys/net/connection/uefi/tcp4.rs:329-350 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 21 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/net/connection/uefi/tcp4.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"036d8694fc54e9878ed32d0942c6e49c0d7e55257adb53a956f20725d7bc3803"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (42 corresponding lines): src/bootstrap/src/core/build_steps/check.rs:580-622 | src/bootstrap/src/core/build_steps/check.rs:658-699 \u2014 These two members are one piece of code written twice and then edited apart: 42 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/build_steps/check.rs"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"d14047adc9b20bd8559386db1817417209dedb2a60df4189a3fbc5d5f606e609"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): src/tools/miri/src/shims/unix/tcp_socket.rs:270-307 | src/tools/miri/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/tools/miri/src/shims/unix/tcp_socket.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"b814070f725c57086b2b71d554cd7743f0ad1314c81707f44d380650eb653131"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): src/tools/run-make-support/src/fs.rs:262-287 | src/tools/run-make-support/src/fs.rs:295-320 \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/tools/run-make-support/src/fs.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"886c711b53af7afb8015cf03d8e75387f09c5c61c3385b52bd2955b6b017a56c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): compiler/rustc_infer/src/infer/relate/generalize.rs:411-444 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/relate/generalize.rs:351-385 \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":"compiler/rustc_infer/src/infer/relate/generalize.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"d43e2d898d120cee592464cef1f927ab8ae204721e72b7e476f5046163a58302"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (44 corresponding lines): compiler/rustc_trait_selection/src/traits/normalize.rs:189-245 | compiler/rustc_trait_selection/src/traits/normalize.rs:249-292 \u2014 These two members are one piece of code written twice and then edited apart: 44 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/traits/normalize.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a1dd4ec5243489840787443463174b513793066459a469ddc22a8cc2918b06d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): library/compiler-builtins/libm-test/src/num.rs:20-47 | library/compiler-builtins/libm-test/src/num.rs:50-78 \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":"library/compiler-builtins/libm-test/src/num.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"07a03db2699b097a7eff4eda653758d6ea62fa2b531717f45d4e858e8199502d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (43 corresponding lines): library/compiler-builtins/libm/src/math/generic/ceil.rs:13-63 | library/compiler-builtins/libm/src/math/generic/floor.rs:13-55 \u2014 These two members are one piece of code written twice and then edited apart: 43 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/compiler-builtins/libm/src/math/generic/ceil.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"8230cd1afa1826f2f1f5b58098e8539d48b84c9a36eed6bda91e6eb892c8a95a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): src/tools/miri/src/shims/unix/mem.rs:144-174 | src/tools/miri/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/tools/miri/src/shims/unix/mem.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"aead1714c710e9cc354b12ecadb6e6cdbf5ff7c01be44b03ad961804a9610c18"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): compiler/rustc_middle/src/ty/generic_args.rs:726-751 | compiler/rustc_middle/src/ty/generic_args.rs:753-773 \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":"compiler/rustc_middle/src/ty/generic_args.rs"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"c12e00b07cc67e4b6f866e46e1e88c7fc587bec0eebefd141367108e5047bad1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): compiler/rustc_trait_selection/src/traits/dyn_compatibility.rs:317-343 | src/tools/rust-analyzer/crates/hir-ty/src/dyn_compatibility.rs:140-164 \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":"compiler/rustc_trait_selection/src/traits/dyn_compatibility.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1551bfe76b4460d9bb97e87f53d7e5e8d2ae32dcc0cecdb51e25c0c9cdd4c0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:642-660 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1157-1169 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1279-1300 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe62ce003eba0b1a411a1c39ce0d0e81e1a3a214fc338acbabb3d7eb9c3e0291"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): compiler/rustc_codegen_cranelift/src/value_and_place.rs:260-276 | compiler/rustc_codegen_cranelift/src/value_and_place.rs:762-783 \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":"compiler/rustc_codegen_cranelift/src/value_and_place.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f02b3fe42b113d74ae4bacb4a30e06771d3605c68a478862aacee6cb6279ebc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): compiler/rustc_hir_typeck/src/coercion.rs:893-914 | compiler/rustc_hir_typeck/src/coercion.rs:948-981 \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":"compiler/rustc_hir_typeck/src/coercion.rs"},"region":{"startLine":893}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc83e074989f90e8cc25c6fce1dd9a71085c2ada9f11ad65a34e756d3f55c963"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): compiler/rustc_trait_selection/src/solve/fulfill/derive_errors.rs:286-305 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/errors.rs:415-437 \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":"compiler/rustc_trait_selection/src/solve/fulfill/derive_errors.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"8697a22d995e02fb39f0a140930691c5a6951bc6b5d3476db0615a607b83fffd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): library/proc_macro/src/lib.rs:1681-1710 | library/proc_macro/src/lib.rs:1754-1777 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/proc_macro/src/lib.rs"},"region":{"startLine":1681}}}],"partialFingerprints":{"codehealthFindingId/v1":"e12169884811247deb004130aea852d3e5edf28487c8aa732733013e1d8fbdfc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): compiler/rustc_hir_analysis/src/collect/type_of.rs:291-332 | compiler/rustc_hir_analysis/src/collect/type_of.rs:337-368 \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":"compiler/rustc_hir_analysis/src/collect/type_of.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"497b8f6c643831b86c36d0d7f66118fe1ac858c61bf4fab04ed86852486e6efc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): compiler/rustc_sanitizers/src/cfi/typeid/itanium_cxx_abi/transform.rs:454-473 | compiler/rustc_sanitizers/src/cfi/typeid/itanium_cxx_abi/transform.rs:717-736 \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":"compiler/rustc_sanitizers/src/cfi/typeid/itanium_cxx_abi/transform.rs"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1afcc730a0ce5551bcd8d0995a1094618e61f0aacbdef47b33236dd59f732eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): src/tools/clippy/clippy_lints/src/manual_clamp.rs:264-298 | src/tools/clippy/clippy_lints/src/manual_clamp.rs:564-601 \u2014 These two members are one piece of code written twice and then edited apart: 35 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/manual_clamp.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a2d231e239a95f211a1d509c300ef2aee6e2bcad4fea13387bb355f52dd5305"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): compiler/rustc_middle/src/ty/util.rs:1630-1650 | compiler/rustc_middle/src/ty/util.rs:1666-1689 \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":"compiler/rustc_middle/src/ty/util.rs"},"region":{"startLine":1630}}}],"partialFingerprints":{"codehealthFindingId/v1":"2335827aaeb57903448308c5e47486bab0d2feec50998ffef2ba808bf7fdaf74"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): compiler/rustc_trait_selection/src/solve/fulfill/derive_errors.rs:204-236 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/errors.rs:334-370 \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":"compiler/rustc_trait_selection/src/solve/fulfill/derive_errors.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"e850f0fa102ec92e724d94987260a451a198bf377e3a35cdf3513764d2f5ae69"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): src/tools/rust-analyzer/crates/rust-analyzer/src/handlers/request.rs:1998-2023 | src/tools/rust-analyzer/crates/rust-analyzer/src/handlers/request.rs:2070-2091 \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/tools/rust-analyzer/crates/rust-analyzer/src/handlers/request.rs"},"region":{"startLine":1998}}}],"partialFingerprints":{"codehealthFindingId/v1":"7975c845e931f230140b6e72b453168d6de0464e3581f47f1ce96eb949c3902c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): src/tools/rust-analyzer/crates/span/src/map.rs:155-183 | src/tools/rust-analyzer/crates/syntax/src/lib.rs:211-239 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/span/src/map.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"287ecca5e8d47ab6bd1a113942c283c1e9355ddb190bf68d988f1482e4e0806c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:961-976 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:2338-2355 \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/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs"},"region":{"startLine":961}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac6ca58a0d1dfd540350d29868c7f1bb64dfe40fc2ea0bd86b001c37c4e4e9dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): compiler/rustc_ast_pretty/src/pprust/state/expr.rs:17-43 | compiler/rustc_hir_pretty/src/lib.rs:1139-1165 \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":"compiler/rustc_ast_pretty/src/pprust/state/expr.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"016d92f70930ff450f637d83849b3f4f54f2d3634d0223f330274d16c9bfd2a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): src/tools/rust-analyzer/crates/ide-assists/src/handlers/apply_demorgan.rs:261-280 | src/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_iter_for_each_to_for.rs:210-231 \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/tools/rust-analyzer/crates/ide-assists/src/handlers/apply_demorgan.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"d121d390f798d32865d4c822a7bfceefa372ba3c3e6497738a854ef979f9212b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): compiler/rustc_infer/src/infer/region_constraints/mod.rs:930-954 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/region_constraints/mod.rs:684-705 \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":"compiler/rustc_infer/src/infer/region_constraints/mod.rs"},"region":{"startLine":930}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc5cd60f1a1380408f355f711f00e0333d9ca2a466c425260771bae315940ba3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 22\u002B corresponding lines): library/std/src/sys/net/connection/socket/hermit.rs:198-223 | library/std/src/sys/net/connection/socket/solid.rs:270-291 | library/std/src/sys/net/connection/socket/unix.rs:380-401 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 22 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/net/connection/socket/hermit.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3d2eb5c9065be5427d1cd79ede598ef25817e89bdfb8cac2bb1297f313ca070"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): src/tools/miri/src/shims/unix/socket.rs:316-338 | src/tools/miri/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/tools/miri/src/shims/unix/socket.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ad4d78ac05cf4b6ff1c88cef6a3dc1efc7f0eb845188f7b7c6a2265d9eac282"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): src/tools/run-make-support/src/obj.rs:205-232 | src/tools/run-make-support/src/obj.rs:260-282 \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/tools/run-make-support/src/obj.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"184fc78153aad43cb0b9a785ed774fb3cbf74d96baf412eb19b50c4181490e9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): src/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_getter_or_setter.rs:38-75 | src/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_getter_or_setter.rs:180-215 \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/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_getter_or_setter.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea513a6f81d78adc26023103cd89be5f8b87d7d8a8ea40fb337ffc0ef9ca3fda"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): src/tools/rust-analyzer/crates/ide-diagnostics/src/handlers/unresolved_field.rs:27-53 | src/tools/rust-analyzer/crates/ide-diagnostics/src/handlers/unresolved_method.rs:22-50 \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/tools/rust-analyzer/crates/ide-diagnostics/src/handlers/unresolved_field.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"87e44c4c53db78d2307588a6fc036370fc94e25cab85d4a73ce72a464fe163d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): compiler/rustc_hir/src/def.rs:824-839 | compiler/rustc_hir/src/def.rs:841-856 \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":"compiler/rustc_hir/src/def.rs"},"region":{"startLine":824}}}],"partialFingerprints":{"codehealthFindingId/v1":"5da6024e106511645cd19a48275602b51f959396936dabc6576573baa1395451"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): compiler/rustc_infer/src/infer/at.rs:69-92 | compiler/rustc_infer/src/infer/at.rs:97-124 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_infer/src/infer/at.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"eabd3986dd43254d1f1dafa7257eb9db7fbc226603e18d381cb4c1e3405562f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): compiler/rustc_next_trait_solver/src/solve/eval_ctxt/mod.rs:339-366 | compiler/rustc_next_trait_solver/src/solve/eval_ctxt/mod.rs:384-415 \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":"compiler/rustc_next_trait_solver/src/solve/eval_ctxt/mod.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bc1aa14b7d47873d9eb5661d71c6d19f0ac4755bbbcbc74915414652eba5890"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): library/core/src/str/iter.rs:702-737 | library/core/src/str/iter.rs:743-782 \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":"library/core/src/str/iter.rs"},"region":{"startLine":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"bca70846cc6156d5ae95db41b0f6130e8ed045615d5418c7be34ee4b12174ef3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): library/std/src/sys/net/connection/socket/unix.rs:116-151 | library/std/src/sys/pipe/unix.rs:8-40 \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":"library/std/src/sys/net/connection/socket/unix.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4f2146a3b4eeab7f58ef684eead3473524a95c441f15e13efa58d982fde0e96"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): library/alloc/src/boxed.rs:795-811 | library/alloc/src/boxed.rs:840-857 \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":"library/alloc/src/boxed.rs"},"region":{"startLine":795}}}],"partialFingerprints":{"codehealthFindingId/v1":"acbe88ce0f1c52bd7fe12893709ebffc6d7a2d8919f584a060c028b7dcf00e49"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): library/compiler-builtins/libm/src/math/asinh.rs:11-36 | library/compiler-builtins/libm/src/math/asinhf.rs:11-35 \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":"library/compiler-builtins/libm/src/math/asinh.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd5a7b28dbc49d9fced922da6393d9430e7c3d0b3a9f7bc0f58c26619601cd6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): src/tools/rust-analyzer/crates/ide-completion/src/completions/snippet.rs:16-49 | src/tools/rust-analyzer/crates/ide-completion/src/completions/snippet.rs:56-118 \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":"src/tools/rust-analyzer/crates/ide-completion/src/completions/snippet.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ceeb2b446297c8c3377316039aa6dbb12687c9f538fb2d585e83db6b03f0474"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): compiler/rustc_ast/src/util/parser.rs:166-194 | compiler/rustc_hir_pretty/src/lib.rs:2733-2759 \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":"compiler/rustc_ast/src/util/parser.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bfb2f07f3de631fa80496d30be715c4d919d8e638862f3b7aa1c6169efea072"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): compiler/rustc_lint/src/for_loops_over_fallibles.rs:117-131 | src/tools/clippy/clippy_utils/src/higher.rs:38-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":"compiler/rustc_lint/src/for_loops_over_fallibles.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"d543e51ee26ea7fbe0c3c67b9fb411fb12032167be565fb9a0b587b66710df3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): compiler/rustc_mir_build/src/builder/scope.rs:1588-1614 | compiler/rustc_mir_build/src/builder/scope.rs:1647-1674 \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":"compiler/rustc_mir_build/src/builder/scope.rs"},"region":{"startLine":1588}}}],"partialFingerprints":{"codehealthFindingId/v1":"719aacf2bbfe11f4b753cfd641da15ea47d68569996ab4d48829733b75878811"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): compiler/rustc_trait_selection/src/solve/normalize.rs:132-153 | compiler/rustc_trait_selection/src/solve/normalize.rs:155-179 \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":"compiler/rustc_trait_selection/src/solve/normalize.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"370f832e1ab5d76604aa4b70645cea280ac161c60dac91b1c6a6407c3b9de230"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): src/tools/clippy/clippy_lints/src/reserve_after_initialization.rs:72-97 | src/tools/clippy/clippy_lints/src/reserve_after_initialization.rs:99-123 \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/tools/clippy/clippy_lints/src/reserve_after_initialization.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"847a64ca60bc29f848e42520969f21459275bf260ee34bc489988937edb3d909"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): src/tools/clippy/clippy_lints/src/undocumented_unsafe_blocks.rs:699-728 | src/tools/clippy/clippy_lints/src/undocumented_unsafe_blocks.rs:763-795 \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":"src/tools/clippy/clippy_lints/src/undocumented_unsafe_blocks.rs"},"region":{"startLine":699}}}],"partialFingerprints":{"codehealthFindingId/v1":"07ae76a2855c9c808c7cfa9f1c3b59b4552d370210faf370691bc0728b7636e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): src/etc/debugger_tester/common.py:637-684 | src/etc/debugger_tester/lldb/check_lldb.py:163-196 \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":"src/etc/debugger_tester/common.py"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"5308efc95a32ca2a11c337b2838fdc43ea49805ba57bbb25a4860bb44869d569"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): library/std/src/sys/time/uefi.rs:196-214 | library/std/src/sys/time/uefi.rs:217-233 \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":"library/std/src/sys/time/uefi.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a17fed62165ad8e1c2754bf4011dcf7709b29445f4c8d39c99bf36036a9c2be"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): src/tools/rust-analyzer/crates/ide-diagnostics/src/handlers/type_mismatch.rs:388-405 | src/tools/rust-analyzer/crates/ide-diagnostics/src/handlers/type_mismatch.rs:412-429 \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/tools/rust-analyzer/crates/ide-diagnostics/src/handlers/type_mismatch.rs"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c5b4d43b8508b51cfd10bf975baf51fd825bae8deaf732d073ef1b4cc744a83"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): compiler/rustc_target/src/callconv/loongarch.rs:416-445 | compiler/rustc_target/src/callconv/riscv.rs:421-450 \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":"compiler/rustc_target/src/callconv/loongarch.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"06417d0b28eff58b7335d46df8e93cbb6c54fa2dfde69e7ce0031e5653d4bf67"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 17\u002B corresponding lines): compiler/rustc_codegen_cranelift/src/value_and_place.rs:210-226 | compiler/rustc_codegen_cranelift/src/value_and_place.rs:235-253 | compiler/rustc_codegen_cranelift/src/value_and_place.rs:709-726 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 17 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/src/value_and_place.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d377f2f7962c3a1a8216d5a7ea96eadc41ee002aeb56d4b133d54794bade14f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 23\u002B corresponding lines): compiler/rustc_hir_analysis/src/collect/item_bounds.rs:264-292 | compiler/rustc_hir_analysis/src/collect/item_bounds.rs:294-316 | compiler/rustc_hir_analysis/src/collect/item_bounds.rs:318-341 | src/tools/rust-analyzer/crates/hir-ty/src/lower.rs:2509-2537 | src/tools/rust-analyzer/crates/hir-ty/src/lower.rs:2539-2561 | src/tools/rust-analyzer/crates/hir-ty/src/lower.rs:2563-2586 \u2014 These 6 members are one piece of code written 6 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 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/collect/item_bounds.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"010a3823527a5650bf340b9d2572ce22b268de8d02e2fd81b0b957155bed0532"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): compiler/rustc_infer/src/infer/mod.rs:854-885 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/mod.rs:673-703 \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":"compiler/rustc_infer/src/infer/mod.rs"},"region":{"startLine":854}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f683784dfbc4df2731f129a8dd14c77bb3ead534edd5598bd7cf66e607d22a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): compiler/rustc_pattern_analysis/src/rustc.rs:284-301 | src/tools/rust-analyzer/crates/hir-ide/src/diagnostics/match_check/pat_analysis.rs:321-346 \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":"compiler/rustc_pattern_analysis/src/rustc.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"547e1b218a8cc0c09ea8c77305d226e74f10495a552c92160d58941f444b1499"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): library/alloc/src/collections/btree/node.rs:1027-1052 | library/alloc/src/collections/btree/node.rs:1097-1121 \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":"library/alloc/src/collections/btree/node.rs"},"region":{"startLine":1027}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c40c77407ce6c4559070bdf9b656c6df3d02366fe53c27593581d1a3779513e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): src/tools/rust-analyzer/crates/hir/src/semantics.rs:1160-1179 | src/tools/rust-analyzer/crates/hir/src/semantics.rs:1186-1205 \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/tools/rust-analyzer/crates/hir/src/semantics.rs"},"region":{"startLine":1160}}}],"partialFingerprints":{"codehealthFindingId/v1":"02565a13dca19db998ef17318919faee97884e178cb3771c5e9ecca93c83482a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): src/tools/rust-analyzer/crates/syntax/src/ast/edit.rs:90-105 | src/tools/rust-analyzer/crates/syntax/src/ast/edit.rs:107-123 \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/tools/rust-analyzer/crates/syntax/src/ast/edit.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"c56364add39d1245f012986b40110c55e97cf24cd215039ec7259f62439ce098"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): compiler/rustc_middle/src/mir/visit.rs:659-681 | compiler/rustc_public/src/mir/visit.rs:353-381 \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":"compiler/rustc_middle/src/mir/visit.rs"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc249caa654dfc4a3e8b3b725464bacb1394143d49559c1f91e8c71201f9b7ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): library/std/src/sys/pal/sgx/abi/usercalls/mod.rs:19-37 | library/std/src/sys/pal/sgx/abi/usercalls/mod.rs:68-84 \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":"library/std/src/sys/pal/sgx/abi/usercalls/mod.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"89a7bc7e65c86de4d55f7ce97eb888f31f3c9df9dd6b72339452acf9a07a8aa6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): src/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_named_struct_to_tuple_struct.rs:159-174 | src/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_tuple_struct_to_named_struct.rs:148-165 \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/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_named_struct_to_tuple_struct.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecc7154bba0fadec79a6b88a08cd5797beeabb9ec23bd461b88b5e2794c235f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (41 corresponding lines): library/core/src/str/pattern.rs:481-521 | library/core/src/str/pattern.rs:548-595 \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":"library/core/src/str/pattern.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"829bc7a913bc6130a7e74a7a723292df4170cbade38730b322b2fbcec0abbaa0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): src/tools/rust-analyzer/crates/ide-completion/src/completions/postfix.rs:526-546 | src/tools/rust-analyzer/crates/ide-completion/src/completions/snippet.rs:137-156 \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/tools/rust-analyzer/crates/ide-completion/src/completions/postfix.rs"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fb485bcdaf6204a0d33be694470a7b86788f7c780824ff183dc3a4155bc066f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): compiler/rustc_middle/src/ty/layout.rs:30-44 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/util.rs:130-145 \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":"compiler/rustc_middle/src/ty/layout.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"324db5e1e7822f3901a112d808ac1d6a3505629b9a550b82b8fd9b26a7208048"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): compiler/rustc_ty_utils/src/representability.rs:105-124 | src/tools/rust-analyzer/crates/hir-ty/src/representability.rs:117-136 \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":"compiler/rustc_ty_utils/src/representability.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec0d36e9d99caec865c2d1cf05ca488b1362fc33bce4b74741d70ccd30ddc32c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): library/alloc/src/collections/linked_list.rs:371-406 | library/alloc/src/collections/linked_list.rs:426-462 \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":"library/alloc/src/collections/linked_list.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"4702ae1265b1c8111d3aa36ccf2733a42cb7080ad9cc44c415cf81142c5b07ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): library/core/src/str/pattern.rs:1781-1813 | library/core/src/str/pattern.rs:1827-1864 \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":"library/core/src/str/pattern.rs"},"region":{"startLine":1781}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dfaef125da20874908f6bc2b29d43165233b232d674e0c853ff423b326921cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): src/tools/rust-analyzer/crates/ide/src/syntax_highlighting/escape.rs:36-61 | src/tools/rust-analyzer/crates/ide/src/syntax_highlighting/escape.rs:67-90 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/syntax_highlighting/escape.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e1f7b685f20088bce513c24e59472c698f5e9efc9c5c3ccb71e81fee7619468"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): compiler/rustc_middle/src/ty/generic_args.rs:230-250 | compiler/rustc_middle/src/ty/mod.rs:648-665 \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":"compiler/rustc_middle/src/ty/generic_args.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae20d9d50e6bf03b977f0f7394af60071d8ce27d7194ebf262f712b92a891e52"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): library/stdarch/crates/stdarch-gen-arm/src/assert_instr.rs:86-109 | library/stdarch/crates/stdarch-gen-arm/src/assert_instr.rs:206-239 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/stdarch-gen-arm/src/assert_instr.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"3da427137cd1f12b7f26b026965bece9f8c768d3ae632d7d937699d53f278197"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): src/librustdoc/clean/cfg.rs:54-79 | src/librustdoc/clean/cfg.rs:81-102 \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/librustdoc/clean/cfg.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"8acc1de5ac8167e320dd93164ce730e6d8298ee0743bbbf093f37ad7605fa371"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): src/tools/run-make-support/src/external_deps/c_build.rs:26-47 | src/tools/run-make-support/src/external_deps/c_build.rs:82-98 \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/tools/run-make-support/src/external_deps/c_build.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f192f76e5c1e6947002db609b836b6fd1e0c1348141481edebaa305f38471a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): compiler/rustc_attr_parsing/src/diagnostics.rs:1600-1626 | compiler/rustc_attr_parsing/src/diagnostics.rs:1633-1660 \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":"compiler/rustc_attr_parsing/src/diagnostics.rs"},"region":{"startLine":1600}}}],"partialFingerprints":{"codehealthFindingId/v1":"71c7f8e6e543fb9e0f4b602b8ccaa1cc866c71f70a0ba8ca803aca8202b55acb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): compiler/rustc_borrowck/src/borrowck_errors.rs:55-94 | compiler/rustc_borrowck/src/borrowck_errors.rs:199-233 \u2014 These two members are one piece of code written twice and then edited apart: 35 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/borrowck_errors.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc5b1ba5b2c26a487373d875f318031fa696d0283b9a9c74bbdddb78b178590e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): compiler/rustc_middle/src/ty/sty.rs:330-360 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/consts.rs:197-227 \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":"compiler/rustc_middle/src/ty/sty.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5b9214ba6931e919561a7808213999a9347e857bad198e7259151593ba85dd3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): library/std/src/sys/process/unix/fuchsia.rs:166-194 | library/std/src/sys/process/unix/fuchsia.rs:196-229 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/process/unix/fuchsia.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"6152baa3d7a4950ed1859d1c94041058b25f7dd6e65ae37eb10d22e958b1b5c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): src/tools/rust-analyzer/crates/hir/src/display.rs:412-425 | src/tools/rust-analyzer/crates/hir/src/display.rs:429-442 \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/tools/rust-analyzer/crates/hir/src/display.rs"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc8bdb702787139c0c7bfe91a46b2ac4128a9f23e4e4de5b280b30d36a90fb83"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): src/tools/rust-analyzer/crates/ide-db/src/syntax_helpers/node_ext.rs:178-202 | src/tools/rust-analyzer/crates/ide-db/src/syntax_helpers/node_ext.rs:206-231 \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/tools/rust-analyzer/crates/ide-db/src/syntax_helpers/node_ext.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"7958e5941195dc17df30ac76d3c24e31b5e4c6134d08ab15f00d6aca9b25ad58"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 25\u002B corresponding lines): src/tools/rust-analyzer/crates/intern/src/intern.rs:48-72 | src/tools/rust-analyzer/crates/intern/src/intern.rs:75-99 | src/tools/rust-analyzer/crates/intern/src/intern_slice.rs:52-87 \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/tools/rust-analyzer/crates/intern/src/intern.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f4023fca2808e485230bce8aae54bf64a797237a5460cef7854cb23f4af856a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 25\u002B corresponding lines): src/tools/rust-analyzer/crates/proc-macro-api/src/legacy_protocol/msg/flat.rs:174-198 | src/tools/rust-analyzer/crates/proc-macro-api/src/legacy_protocol/msg/flat.rs:292-316 | src/tools/rust-analyzer/crates/proc-macro-api/src/legacy_protocol/msg/flat.rs:323-347 \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/tools/rust-analyzer/crates/proc-macro-api/src/legacy_protocol/msg/flat.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"d23c0043cf11bd798af0f1ffbfb9aa2ee6876ef0b6ba120a277ad40f2c07f9be"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): src/etc/lldb_providers.py:425-456 | src/etc/lldb_providers.py:460-492 \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/etc/lldb_providers.py"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"a084535b60253c9bd8461385f7e569d7f4e3ca8734b9ef643e429a140a2d8d99"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): compiler/rustc_hir_typeck/src/writeback.rs:396-425 | compiler/rustc_hir_typeck/src/writeback.rs:427-449 \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":"compiler/rustc_hir_typeck/src/writeback.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e5c1bcc705a1ae19fe790cd27580fd6f782f4ddb8359f81e2fb4cb1a74b1b18"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): compiler/rustc_lint/src/internal.rs:176-196 | src/tools/clippy/clippy_lints/src/methods/unnecessary_to_owned.rs:519-534 \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":"compiler/rustc_lint/src/internal.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"16200cce6eb49998d238911ba5a35193a915e127e14c014cfedc25d7738c233e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): src/tools/rust-analyzer/crates/ide-db/src/use_trivial_constructor.rs:16-39 | src/tools/rust-analyzer/crates/ide-db/src/use_trivial_constructor.rs:47-70 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-db/src/use_trivial_constructor.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"e490353fa2259dc2259aca7e32254a2c849a6f438a1ec4f4b1ecdad32a4ad629"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): src/tools/rust-analyzer/crates/rust-analyzer/src/config.rs:3650-3671 | src/tools/rust-analyzer/crates/rust-analyzer/src/config.rs:3678-3699 \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/tools/rust-analyzer/crates/rust-analyzer/src/config.rs"},"region":{"startLine":3650}}}],"partialFingerprints":{"codehealthFindingId/v1":"337b4f36df9dfab190ee8e39d835f4f233496943dbf1eea2ac208c4b3e2be708"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): compiler/rustc_data_structures/src/flock.rs:25-49 | src/librustdoc/html/render/write_shared/flock.rs:21-40 \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":"compiler/rustc_data_structures/src/flock.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e2cad568a13f213645ca782180bd2f09ac3310c67cc019adec6f206bd9d4c30"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): compiler/rustc_hir_typeck/src/pat.rs:670-710 | src/tools/rust-analyzer/crates/hir-ty/src/infer/pat.rs:536-564 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/pat.rs"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b58041f683b6d164e28a694d54aecbc0ac619f279e4d368cd3eb9812153e34b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): compiler/rustc_infer/src/infer/canonical/query_response.rs:194-221 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/canonical/instantiate.rs:245-264 \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":"compiler/rustc_infer/src/infer/canonical/query_response.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6756fb07807d732f91ab713c49f1fc2fe1a911b2d83f3e33989ab603eae9b7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): compiler/rustc_trait_selection/src/solve/inspect/analyse.rs:143-175 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/inspect.rs:198-237 \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":"compiler/rustc_trait_selection/src/solve/inspect/analyse.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3af2dc9067677287a2673c6878402e998bdfedb0d6d332c5fb46de509d0b8b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): compiler/rustc_trait_selection/src/traits/mod.rs:138-155 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/errors.rs:70-86 \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":"compiler/rustc_trait_selection/src/traits/mod.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"970eb0d56e1304c95fcd08ee5da6ca3315680f4811c4d8676640a28c7588c706"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 18\u002B corresponding lines): compiler/rustc_data_structures/src/flock/unix.rs:97-116 | compiler/rustc_data_structures/src/flock/unix.rs:120-138 | src/librustdoc/html/render/write_shared/flock.rs:51-68 | src/librustdoc/html/render/write_shared/flock.rs:73-91 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 18 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":"compiler/rustc_data_structures/src/flock/unix.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"307060fc674b65d1859fc89acbc678d0c7341501d386e134675381124ef79e15"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): compiler/rustc_infer/src/infer/relate/generalize.rs:614-652 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/relate/generalize.rs:553-589 \u2014 These two members are one piece of code written twice and then edited apart: 37 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_infer/src/infer/relate/generalize.rs"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"db5b03c403d1765fa000dd1e5aa2e6d66e8b0b45b15d235ef8ec766fe165e697"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): compiler/rustc_serialize/src/serialize.rs:99-121 | compiler/rustc_serialize/src/serialize.rs:128-148 \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":"compiler/rustc_serialize/src/serialize.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e0bc05eebb6849a12802b2eb8108f31825a89be9a70c827061b95407289300f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): compiler/rustc_target/src/callconv/aarch64.rs:24-44 | compiler/rustc_target/src/callconv/arm.rs:17-35 \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":"compiler/rustc_target/src/callconv/aarch64.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"230cc8e9b1da386da93a39748c400da4a7b632773e927b325f7b6ca5fd804a87"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): library/alloc/src/collections/btree/navigate.rs:596-616 | library/alloc/src/collections/btree/navigate.rs:625-644 \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":"library/alloc/src/collections/btree/navigate.rs"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb00d9a0d6b7baf347dbcb62bce39c8f98ab20519e9152406e89caa9f58e6a1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): library/core/src/iter/adapters/take.rs:95-113 | library/core/src/iter/adapters/take_while.rs:74-97 \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":"library/core/src/iter/adapters/take.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"351c4a825ae6ca128fb03f60e72e8219fd2988df6bf5b0abff1b2f4de932664b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): src/tools/miri/src/shims/time.rs:460-482 | src/tools/miri/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/tools/miri/src/shims/time.rs"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"09a530d79ac6d6c41abdd7a1f256aa0efe39beae5cecc9f627252c478bf1da32"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): compiler/rustc_hir_typeck/src/op.rs:1325-1354 | src/tools/rust-analyzer/crates/hir-ty/src/infer/op.rs:460-479 \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":"compiler/rustc_hir_typeck/src/op.rs"},"region":{"startLine":1325}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a380e87432483994689463ad0a8f73d39b72b0d1d91a756f2359cd296ad2cb7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): compiler/rustc_thread_pool/src/scope/mod.rs:562-579 | compiler/rustc_thread_pool/src/scope/mod.rs:636-652 \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":"compiler/rustc_thread_pool/src/scope/mod.rs"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d413511d3fd131a8f86f62d2f70b8518192148d8d0915c0252942d64ead21b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): compiler/rustc_type_ir/src/fold.rs:652-677 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/interner.rs:2043-2067 \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":"compiler/rustc_type_ir/src/fold.rs"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"9214cfe78ece5b01311f952ebb935779e1a86ea36e4d9617ef0240ec91d42ff5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): compiler/rustc_infer/src/infer/snapshot/fudge.rs:249-270 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/snapshot/fudge.rs:242-263 \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":"compiler/rustc_infer/src/infer/snapshot/fudge.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecc31262dd68f46c546c3173a6cee3b12d87d61b48db126db0b5205a66e5ffa0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): library/alloc/src/rcs/arc.rs:4899-4917 | library/alloc/src/rcs/rc.rs:4478-4496 \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":"library/alloc/src/rcs/arc.rs"},"region":{"startLine":4899}}}],"partialFingerprints":{"codehealthFindingId/v1":"67f5d058dccab6679b40b48d0486481c9e389f384155455e534b4d23b6f9518d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): library/std/src/sys/pal/sgx/abi/usercalls/mod.rs:118-130 | library/std/src/sys/pal/sgx/abi/usercalls/mod.rs:134-152 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/pal/sgx/abi/usercalls/mod.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a2e34027286128106e742ecb32f6eed4cd938754e152bad07c28ac150d8d0f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): src/bootstrap/src/core/build_steps/clippy.rs:192-223 | src/bootstrap/src/core/build_steps/clippy.rs:278-317 \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/bootstrap/src/core/build_steps/clippy.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ac9074edd1108724a2c03854a7ba9a2159ea1676509a814756de0600796d5fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): src/bootstrap/src/core/build_steps/dist.rs:1684-1713 | src/bootstrap/src/core/build_steps/dist.rs:1758-1793 \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":"src/bootstrap/src/core/build_steps/dist.rs"},"region":{"startLine":1684}}}],"partialFingerprints":{"codehealthFindingId/v1":"07dc05f815c00d475f058b7e3cb0c741edb93ab45bcade72e36748bc9eba108c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): src/tools/miri/src/shims/unix/macos/sync.rs:386-414 | src/tools/miri/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/tools/miri/src/shims/unix/macos/sync.rs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"a14167e62b422086ac12f200f18d441687e8f8784e1d9ce3c7f59198f2883e8c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): compiler/rustc_attr_ir/src/target.rs:174-195 | compiler/rustc_attr_ir/src/target.rs:368-386 \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":"compiler/rustc_attr_ir/src/target.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"b237464897aaf46868d9aebf29974300f068cbbc44be8f86946eee1e8374cfa7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): compiler/rustc_codegen_gcc/src/builder.rs:1446-1461 | compiler/rustc_codegen_gcc/src/builder.rs:1471-1487 | compiler/rustc_codegen_gcc/src/builder.rs:1496-1510 \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":"compiler/rustc_codegen_gcc/src/builder.rs"},"region":{"startLine":1446}}}],"partialFingerprints":{"codehealthFindingId/v1":"675a091ae93bb73176b64ecae475ebfbbc7d8e7ba152fa6c01ce29edb9623a19"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): compiler/rustc_middle/src/ty/predicate.rs:231-247 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/predicate.rs:59-76 \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":"compiler/rustc_middle/src/ty/predicate.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c2c8c43966bc3888f3573fa49b19aaa5d03c95fc30d9780f165d91094215256"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 33\u002B corresponding lines): library/compiler-builtins/libm/src/math/j0.rs:62-100 | library/compiler-builtins/libm/src/math/j1.rs:62-103 | library/compiler-builtins/libm/src/math/j1f.rs:21-53 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 33 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":"library/compiler-builtins/libm/src/math/j0.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d5e54efe01a34aa38e25a38d4d085a8e0ab771e4c593803609dac38cd7bac67"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): src/tools/rust-analyzer/crates/hir-expand/src/builtin/derive_macro.rs:459-483 | src/tools/rust-analyzer/crates/hir-expand/src/builtin/derive_macro.rs:616-638 \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/tools/rust-analyzer/crates/hir-expand/src/builtin/derive_macro.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5b20eb98e90fb6cbba7579216696c7a584627b4539faa0e23d8692660a301f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): src/tools/rust-analyzer/crates/ide-assists/src/handlers/raw_string.rs:27-46 | src/tools/rust-analyzer/crates/ide-assists/src/handlers/raw_string.rs:63-83 \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/tools/rust-analyzer/crates/ide-assists/src/handlers/raw_string.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"988dc9ecd940fe72988c3cf0f6fa08820e5bd76f2064bc8df3261387d7d50449"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): compiler/rustc_hir_analysis/src/check/compare_eii.rs:331-362 | compiler/rustc_hir_analysis/src/check/compare_impl_item.rs:1151-1189 \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":"compiler/rustc_hir_analysis/src/check/compare_eii.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"f52d27bc4bd7e500e38f1890faab69ecc0f6a0fd6d542f93e18a65b7b877cf6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): compiler/rustc_hir_typeck/src/upvar.rs:2637-2661 | src/tools/rust-analyzer/crates/hir-ty/src/infer/closure/analysis.rs:1451-1481 \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":"compiler/rustc_hir_typeck/src/upvar.rs"},"region":{"startLine":2637}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e5800eeb903aeb29634977593e91db7c6678b44d117e13f2383ad20fa25d7d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 14\u002B corresponding lines): compiler/rustc_type_ir/src/sty/consts.rs:303-318 | compiler/rustc_type_ir/src/sty/consts.rs:320-335 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/consts.rs:301-314 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/consts.rs:318-331 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_type_ir/src/sty/consts.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c63d7dd7918ec3250e5f1b05d15d296cf6e8ffb37580a5035948047fd0c5700"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): src/tools/clippy/clippy_lints/src/pathbuf_init_then_push.rs:153-172 | src/tools/clippy/clippy_lints/src/vec_init_then_push.rs:177-198 \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/tools/clippy/clippy_lints/src/pathbuf_init_then_push.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"86ad0735422723b705c1f1ec9b526f77c27df115c68ebe4a1ce0a39076b80324"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): src/tools/clippy/clippy_utils/src/ty/mod.rs:698-710 | src/tools/clippy/clippy_utils/src/ty/mod.rs:715-733 \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/tools/clippy/clippy_utils/src/ty/mod.rs"},"region":{"startLine":698}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd5a10ad55654ae8b2d8383762e0925d49be293cfe4186ec566eb5be80f96b93"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 25\u002B corresponding lines): src/tools/miri/src/concurrency/sync.rs:323-352 | src/tools/miri/src/concurrency/sync.rs:415-439 | src/tools/miri/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/tools/miri/src/concurrency/sync.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"08baa7edb40ba1ff2709ab4da57b8c25e0bb582816a6da08a7a3245a97a47c0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): compiler/rustc_borrowck/src/diagnostics/mod.rs:606-625 | compiler/rustc_borrowck/src/diagnostics/mod.rs:629-648 \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":"compiler/rustc_borrowck/src/diagnostics/mod.rs"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"00430f900e847530abd7919aacf4a5ca9845708956ee9fff27f986086e82e156"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): compiler/rustc_codegen_llvm/src/llvm/enzyme_ffi.rs:449-479 | compiler/rustc_codegen_llvm/src/llvm/offload_ffi.rs:91-114 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/llvm/enzyme_ffi.rs"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"a69cc2b89ce3ba04f9e76f4f0a154b71e2942932b73c14e1919bdc92638b2e6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 15\u002B corresponding lines): library/stdarch/crates/core_arch/src/wasm32/simd128.rs:2275-2293 | library/stdarch/crates/core_arch/src/wasm32/simd128.rs:2305-2323 | library/stdarch/crates/core_arch/src/wasm32/simd128.rs:2619-2633 | library/stdarch/crates/core_arch/src/wasm32/simd128.rs:2645-2659 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/wasm32/simd128.rs"},"region":{"startLine":2275}}}],"partialFingerprints":{"codehealthFindingId/v1":"686b996c905c95b16e8095a16b6d6f73304b45ed646868601ccb4f365bbeef8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 22\u002B corresponding lines): compiler/rustc_next_trait_solver/src/placeholder.rs:117-138 | compiler/rustc_next_trait_solver/src/placeholder.rs:140-162 | compiler/rustc_next_trait_solver/src/placeholder.rs:164-185 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 22 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_next_trait_solver/src/placeholder.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"acaa106c34d452d88153d27d23399056cab175e85bd62bbbaa8d0d93440abd5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): library/alloc/src/collections/vec_deque/mod.rs:1474-1504 | library/alloc/src/collections/vec_deque/mod.rs:1528-1561 \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":"library/alloc/src/collections/vec_deque/mod.rs"},"region":{"startLine":1474}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f4d21386586584cc6a2034c0b0df96cb6e17b3aa42aa0e2f3fed43764179912"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): src/tools/run-make-support/src/obj.rs:126-141 | src/tools/run-make-support/src/obj.rs:161-175 \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/tools/run-make-support/src/obj.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"768daa6ed24dd6d9f8ba6781414c602834dc85b3c1a92e8e42cb2eb089067ad9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:617-635 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:863-874 \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/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"a620619c0304e499cd9e6742a83cde7114404941963d0ca510903920120dc24e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): library/compiler-builtins/libm/src/math/arch/x86/fma.rs:10-37 | library/compiler-builtins/libm/src/math/arch/x86/fma.rs:39-66 \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":"library/compiler-builtins/libm/src/math/arch/x86/fma.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ba298a6a33dbf86ccd53d8c9186a76f6a2c2e3047a17c3cf35ec5fd7fe85d4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): library/std/src/sys/stdio/xous.rs:20-33 | library/std/src/sys/stdio/xous.rs:47-60 \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":"library/std/src/sys/stdio/xous.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"5abcc32d21e9cd9245f1d7fe9c63d80afc8c6e919ccdcef55269da5138dabe52"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): src/tools/rust-analyzer/xtask/src/publish/notes.rs:202-224 | src/tools/rust-analyzer/xtask/src/publish/notes.rs:226-247 \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/tools/rust-analyzer/xtask/src/publish/notes.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f8867d90ef6c50b05b47e0bb10058b547c57186c4476b63e6af8e3caad3f7bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): compiler/rustc_hir_typeck/src/op.rs:162-192 | src/tools/rust-analyzer/crates/hir-ty/src/infer/op.rs:125-156 \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":"compiler/rustc_hir_typeck/src/op.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"c48c8406294146d79d4c19d5603bd41a77a59de70831b85d3d3082471014ff9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): library/compiler-builtins/libm-test/src/precision.rs:258-283 | library/compiler-builtins/libm-test/src/precision.rs:301-327 \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":"library/compiler-builtins/libm-test/src/precision.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1fa6a1b8f1066f4c1c64034cea5d4ad0dd4c88dbf6c0c870908c45dc08d9b57"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): src/tools/rust-analyzer/crates/hir-ty/src/mir/eval.rs:2913-2933 | src/tools/rust-analyzer/crates/hir-ty/src/mir/lower.rs:1843-1863 \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/tools/rust-analyzer/crates/hir-ty/src/mir/eval.rs"},"region":{"startLine":2913}}}],"partialFingerprints":{"codehealthFindingId/v1":"770745071a5afbe5929cd541d48ab5e5b9283bcf55094818d9eab0f3d2a1cfee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): src/tools/rustfmt/src/modules.rs:151-168 | src/tools/rustfmt/src/modules.rs:173-190 \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/tools/rustfmt/src/modules.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b8eb559d8766513bdd79b7dfd8b1f8975a5d27964b2fb4c8bfe3aeac117a936"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): compiler/rustc_codegen_gcc/src/intrinsic/mod.rs:781-803 | compiler/rustc_codegen_llvm/src/abi.rs:324-345 \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":"compiler/rustc_codegen_gcc/src/intrinsic/mod.rs"},"region":{"startLine":781}}}],"partialFingerprints":{"codehealthFindingId/v1":"0976f426d9aacf7e938c7c7e8593eb55b384c3434c13ee01f5048fddf2dc6e37"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): compiler/rustc_codegen_llvm/src/builder.rs:1015-1044 | compiler/rustc_codegen_llvm/src/builder.rs:1046-1062 \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":"compiler/rustc_codegen_llvm/src/builder.rs"},"region":{"startLine":1015}}}],"partialFingerprints":{"codehealthFindingId/v1":"70313ec9706db821725d71f8e04c92e0982468aaf76b55069ec1568fb4ce9889"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): compiler/rustc_metadata/src/rmeta/encoder.rs:966-998 | compiler/rustc_metadata/src/rmeta/encoder.rs:1080-1115 \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":"compiler/rustc_metadata/src/rmeta/encoder.rs"},"region":{"startLine":966}}}],"partialFingerprints":{"codehealthFindingId/v1":"522f6be8e30d24618b7c9f5ec5eabf70b786fb38403c05be0c6ff27385609298"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): compiler/rustc_middle/src/mir/terminator.rs:635-653 | compiler/rustc_middle/src/mir/terminator.rs:656-674 \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":"compiler/rustc_middle/src/mir/terminator.rs"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"68802da308c06b420ea5e3a4e019106ebb1aeb8745d62f0d8a93e786fa78c5f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): library/alloc/src/vec/into_iter.rs:371-398 | library/alloc/src/vec/into_iter.rs:406-427 \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":"library/alloc/src/vec/into_iter.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"9797988e4c8665a0b560caecc398cd60b250d56b062349ab670084cd7cae7695"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): src/tools/miri/src/borrow_tracker/tree_borrows/wildcard.rs:195-221 | src/tools/miri/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/tools/miri/src/borrow_tracker/tree_borrows/wildcard.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"16f866845f34d0d8c63eef79fcb088ed8b9aa8219cd0f199bfa0ed4af4c9d759"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): src/tools/rust-analyzer/crates/hir-expand/src/lib.rs:1426-1440 | src/tools/rust-analyzer/crates/hir-expand/src/lib.rs:1449-1463 \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/tools/rust-analyzer/crates/hir-expand/src/lib.rs"},"region":{"startLine":1426}}}],"partialFingerprints":{"codehealthFindingId/v1":"f791a08223cab74af23ffad93a11fdf346e5ad548929b1f85d1cc3df5606c49b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): src/tools/rust-analyzer/crates/hir-ty/src/lower.rs:1665-1683 | src/tools/rust-analyzer/crates/hir-ty/src/lower.rs:1697-1714 \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/tools/rust-analyzer/crates/hir-ty/src/lower.rs"},"region":{"startLine":1665}}}],"partialFingerprints":{"codehealthFindingId/v1":"258645764c7a1f54a8be379247bdec6441236fd8b784476b0eab7cbdb31ed269"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): src/tools/rust-analyzer/crates/hir/src/lib.rs:3903-3919 | src/tools/rust-analyzer/crates/hir/src/lib.rs:3921-3936 \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/tools/rust-analyzer/crates/hir/src/lib.rs"},"region":{"startLine":3903}}}],"partialFingerprints":{"codehealthFindingId/v1":"b495376dd8bc51866fd135c91707d2165e44922aad8eaa8f910748693d330c80"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): src/tools/rust-analyzer/crates/ide/src/doc_links/intra_doc_links.rs:16-36 | src/tools/rust-analyzer/crates/ide/src/doc_links/intra_doc_links.rs:38-52 \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/tools/rust-analyzer/crates/ide/src/doc_links/intra_doc_links.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e21dfcf1e9b9b23ca86f9745ad53df5da67ae670dfff9fe5bd03b92a05c5ec6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): src/tools/rust-analyzer/crates/syntax/src/validation.rs:401-412 | src/tools/rust-analyzer/crates/syntax/src/validation.rs:415-426 \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/tools/rust-analyzer/crates/syntax/src/validation.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ec6eac67cce18b0a92dbb2dc54b2237872714d6af0a33f649b6656a54adcd68"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): compiler/rustc_ast/src/ast.rs:171-191 | compiler/rustc_ast/src/ast.rs:195-211 \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":"compiler/rustc_ast/src/ast.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"8885afe0239ae81c2eb611027222154b650ed311c0e2431c094f684d265fa274"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): compiler/rustc_hir_typeck/src/closure.rs:1015-1051 | src/tools/rust-analyzer/crates/hir-ty/src/infer/closure.rs:1091-1126 \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":"compiler/rustc_hir_typeck/src/closure.rs"},"region":{"startLine":1015}}}],"partialFingerprints":{"codehealthFindingId/v1":"98031a0c80ee60f43937c5eccecde121974f30a1323dced3ee4ba2d993d9017c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): compiler/rustc_hir_typeck/src/method/probe.rs:2722-2756 | src/tools/rust-analyzer/crates/hir-ty/src/method_resolution/probe.rs:2095-2125 \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":"compiler/rustc_hir_typeck/src/method/probe.rs"},"region":{"startLine":2722}}}],"partialFingerprints":{"codehealthFindingId/v1":"83c9470d6d17f5f4fae345d23c9cef28652e9e17b6664e020c490da504550183"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (41 corresponding lines): compiler/rustc_infer/src/infer/region_constraints/mod.rs:419-459 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/region_constraints/mod.rs:325-367 \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":"compiler/rustc_infer/src/infer/region_constraints/mod.rs"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"82d4a7359ba9ee0e27c2caa8addb78b3901c52f33718d924aa9e0c80fdc62496"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): src/tools/miri/src/intrinsics/math.rs:48-64 | src/tools/miri/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/tools/miri/src/intrinsics/math.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"5642b28a47c5c3e4b0501e3d91a91bd6baabe85d8847587c1a2795bee76a31b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): src/tools/rustfmt/src/modules.rs:196-222 | src/tools/rustfmt/src/modules.rs:228-252 \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/tools/rustfmt/src/modules.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"70ff0984aff14e270d6fdd0d4e81a006573833c0390061fcdbfcff68b3e9786b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): compiler/rustc_lint/src/late.rs:95-117 | compiler/rustc_lint/src/late.rs:194-216 \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":"compiler/rustc_lint/src/late.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"6925bde238bf72c09ba9e4d037852538dc6093d393037d72faefc388e1e8d7db"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 21\u002B corresponding lines): library/core/src/fmt/builders.rs:156-180 | library/core/src/fmt/builders.rs:380-400 | library/core/src/fmt/builders.rs:530-550 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 21 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/fmt/builders.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"cba2aa5bb73dbff0a66062b38bdab273e97f4c83e782f2bdcc7eba773d47a576"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:441-457 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:705-720 \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/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"37aea55eb949104409e78fbac53f05c150f8d52ec43dc4fd8ede25d51105e595"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): library/std/src/sys/process/unix/unix.rs:1033-1048 | library/std/src/sys/process/unix/unix.rs:1050-1070 \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":"library/std/src/sys/process/unix/unix.rs"},"region":{"startLine":1033}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b1ae75025135752ce3ad9d3f0967f7b671061e12d4d037612fb196da6a08753"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): src/tools/miri/src/concurrency/genmc/mod.rs:648-673 | src/tools/miri/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/tools/miri/src/concurrency/genmc/mod.rs"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"475e0c94e7b58f1c27133cd80b91f35ce602489e2a02d6549a9e4ff4e388cad6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): compiler/rustc_arena/src/lib.rs:212-246 | compiler/rustc_arena/src/lib.rs:573-593 \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":"compiler/rustc_arena/src/lib.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"8acfa5f22de9a251745f60f970eff002dfb9a77afa8b3fb858ab0563e112509c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): compiler/rustc_next_trait_solver/src/solve/trait_goals.rs:343-369 | compiler/rustc_next_trait_solver/src/solve/trait_goals.rs:374-396 \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":"compiler/rustc_next_trait_solver/src/solve/trait_goals.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"e027c7eea1f31ada2097bd003abbe30d3bc11b6afcd2cc57c73f467530d39161"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): library/std/src/sys/process/uefi.rs:699-721 | library/std/src/sys/process/uefi.rs:723-745 \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":"library/std/src/sys/process/uefi.rs"},"region":{"startLine":699}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a47ce62d62351d88204eeb7569ce457dab8393d566e9d1e0c8d2042059f499b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/tools/miri/src/shims/os_str.rs:144-153 | src/tools/miri/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/tools/miri/src/shims/os_str.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4b31607d28d02cb885c2d52e010882fe2747c784103609d028b8dff7ed997dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 23\u002B corresponding lines): src/tools/miri/src/shims/time.rs:324-348 | src/tools/miri/src/shims/time.rs:350-375 | src/tools/miri/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/tools/miri/src/shims/time.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceba89122e950b6cf9145acd7bcf2b69f70a22750dedad855103dd8f7bcc8923"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): src/tools/miri/src/shims/unix/fs.rs:82-101 | src/tools/miri/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/tools/miri/src/shims/unix/fs.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0c8461a134b171e54d5e3f196bee9638fc6b751b48fb5bf7875f5c0bfae8ec9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 18\u002B corresponding lines): compiler/rustc_builtin_macros/src/asm.rs:584-601 | compiler/rustc_builtin_macros/src/asm.rs:607-625 | compiler/rustc_builtin_macros/src/asm.rs:631-652 | compiler/rustc_builtin_macros/src/format.rs:1167-1186 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 18 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":"compiler/rustc_builtin_macros/src/asm.rs"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8883d239fb56e0432e87f41e70e581e0f461fd5ac1c062e81bf8249beef0942"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): library/alloc/src/rcs/arc.rs:2351-2371 | library/alloc/src/rcs/rc.rs:2448-2468 \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":"library/alloc/src/rcs/arc.rs"},"region":{"startLine":2351}}}],"partialFingerprints":{"codehealthFindingId/v1":"10a3613ef6f756b6a285e1e3310eb519ad1abc719352c3dfba6e8b916c118013"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 11\u002B corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512f.rs:34771-34782 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:34885-34896 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:35038-35048 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:35193-35203 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":34771}}}],"partialFingerprints":{"codehealthFindingId/v1":"f47e8cab9fb2c6ac90e9805bcefc9ad2f275ba33d0555171753c26674873bc05"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): src/tools/clippy/clippy_lints/src/casts/needless_type_cast.rs:60-84 | src/tools/clippy/clippy_lints/src/casts/needless_type_cast.rs:90-115 \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/tools/clippy/clippy_lints/src/casts/needless_type_cast.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"6afd8e4a070572b857d15c3b3eb9f5d56b6c1ba5e22ba1a40c6b3a2092e6f36a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): src/tools/rust-analyzer/crates/syntax/src/algo.rs:77-90 | src/tools/rust-analyzer/crates/syntax/src/algo.rs:92-110 \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/tools/rust-analyzer/crates/syntax/src/algo.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dd213af386c50216c86a3854f555d3b7c8fd5c9ec0c542ff2ae04f91a615236"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): compiler/rustc_codegen_cranelift/src/codegen_f16_f128.rs:24-41 | compiler/rustc_codegen_cranelift/src/codegen_f16_f128.rs:43-60 \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":"compiler/rustc_codegen_cranelift/src/codegen_f16_f128.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f471bdc09291aaa2a5ff1d37a3bda99433ba4345d2a6415e8d25c3ee77b6dc7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): compiler/rustc_codegen_ssa/src/back/link.rs:216-239 | compiler/rustc_codegen_ssa/src/back/link.rs:245-271 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/back/link.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdd6e91d1b02a43fcafda428846c2cd2e27fab52f1e5af2c62c384d935541b31"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): compiler/rustc_middle/src/ty/generic_args.rs:175-195 | compiler/rustc_middle/src/ty/mod.rs:752-767 \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":"compiler/rustc_middle/src/ty/generic_args.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c5658ee96265b244537adf554316109ca420283ce6dac99eec6a79cab8fa093"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): library/portable-simd/crates/core_simd/src/swizzle.rs:85-112 | library/portable-simd/crates/core_simd/src/swizzle.rs:123-150 \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":"library/portable-simd/crates/core_simd/src/swizzle.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"c225a1bca46d4dd4bb79917db5d58e3f390c458ab4097a37c3bf5a3535aa0111"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512dq.rs:1820-1841 | library/stdarch/crates/core_arch/src/x86/avx512dq.rs:2035-2058 \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":"library/stdarch/crates/core_arch/src/x86/avx512dq.rs"},"region":{"startLine":1820}}}],"partialFingerprints":{"codehealthFindingId/v1":"3644e8cda6c9589d236bab6937952cdf0bef1ce2fdcf9a669f0e31c4fa3c0de6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 19\u002B corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512f.rs:22964-22982 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:23107-23125 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:23237-23255 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:24938-24956 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 19 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":22964}}}],"partialFingerprints":{"codehealthFindingId/v1":"71d6cd043cc309589d6ee38bf0e942501a7ba65259962ed8851e458e97b88aae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): src/librustdoc/passes/strip_hidden.rs:15-45 | src/librustdoc/passes/strip_private.rs:10-47 \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/librustdoc/passes/strip_hidden.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc92b889a5ca4b321bec84d7e3720094449d84a3c44ab23cbac350e85062b35f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): src/tools/rust-analyzer/crates/base-db/src/lib.rs:406-431 | src/tools/rust-analyzer/crates/stdx/src/panic_context.rs:18-40 \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/tools/rust-analyzer/crates/base-db/src/lib.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"62a80153e5b163343b7044636c53c1dfdb1fb2d481078e15ce11009b9519e7bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): src/tools/rust-analyzer/crates/hir-def/src/attrs.rs:741-762 | src/tools/rust-analyzer/crates/hir-def/src/attrs.rs:1205-1223 \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/tools/rust-analyzer/crates/hir-def/src/attrs.rs"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"bad9e892de3388aeaa4db5e5963b65d894f168acc9fb4ac12f2e786dbcc83beb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1974-1986 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1992-2004 \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/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs"},"region":{"startLine":1974}}}],"partialFingerprints":{"codehealthFindingId/v1":"71d7a5f5f2967873fbb8882ac59f079e580c27a1ece77f4d5dca35ac4fdcbbdd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): compiler/rustc_hir_typeck/src/upvar.rs:2346-2370 | src/tools/rust-analyzer/crates/hir-ty/src/infer/closure/analysis.rs:1322-1346 \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":"compiler/rustc_hir_typeck/src/upvar.rs"},"region":{"startLine":2346}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac0c2a1a4c9b0e9fc290ccdba9118f99f5d8d05fada170e4f448745aaec706c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): library/alloc/src/collections/vec_deque/extract_if.rs:74-105 | library/alloc/src/vec/extract_if.rs:68-100 \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":"library/alloc/src/collections/vec_deque/extract_if.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a8f8470a78c35e354d069c8e837a15a636d5cbf019f752ca3459dc7d41b7910"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): library/compiler-builtins/crates/util/src/main.rs:367-381 | library/compiler-builtins/crates/util/src/main.rs:390-406 \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":"library/compiler-builtins/crates/util/src/main.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"42b72d889edec1a7f2d1d532b3d95921710969db67013a73b92a08caad82c0f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): library/compiler-builtins/libm/src/math/atanh.rs:9-33 | library/compiler-builtins/libm/src/math/atanhf.rs:9-33 \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":"library/compiler-builtins/libm/src/math/atanh.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4368c40e899bee5b21c278b6fd3678ba87b68f232337f819580f2bb10cd6d5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): src/bootstrap/src/core/build_steps/dist.rs:1579-1595 | src/bootstrap/src/core/build_steps/dist.rs:1627-1645 | src/bootstrap/src/core/build_steps/dist.rs:1855-1866 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/build_steps/dist.rs"},"region":{"startLine":1579}}}],"partialFingerprints":{"codehealthFindingId/v1":"1360ee41513c360b68ca5149eed30fa5270da787c0ad6609db6187384b7375ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): src/tools/clippy/clippy_config/src/types.rs:103-122 | src/tools/clippy/clippy_config/src/types.rs:336-362 \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/tools/clippy/clippy_config/src/types.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2c16a93ff708c91de6691e089dd7089fdafd02fd38bc53509b4670506d7454a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): compiler/rustc_hir_typeck/src/method/probe.rs:1007-1037 | src/tools/rust-analyzer/crates/hir-ty/src/method_resolution/probe.rs:1034-1057 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/method/probe.rs"},"region":{"startLine":1007}}}],"partialFingerprints":{"codehealthFindingId/v1":"889a7063ee69211fbb668aaee4d40178ea3daa1481ce15d724f2a01fd3ba16ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): compiler/rustc_hir_typeck/src/pat.rs:838-871 | src/tools/rust-analyzer/crates/hir-ty/src/infer/pat.rs:683-716 \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":"compiler/rustc_hir_typeck/src/pat.rs"},"region":{"startLine":838}}}],"partialFingerprints":{"codehealthFindingId/v1":"c182c0845e20a7d782c05c8e127af9ff18d8da2c168564959eb934e5866909e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): compiler/rustc_hir_typeck/src/writeback.rs:537-547 | compiler/rustc_hir_typeck/src/writeback.rs:549-562 \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":"compiler/rustc_hir_typeck/src/writeback.rs"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"67372d5dcb8e077640bb6f700f8fd6a13cb9a6ea69ac06abe7c0187c82fc8e69"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): compiler/rustc_infer/src/infer/mod.rs:1128-1146 | compiler/rustc_infer/src/infer/mod.rs:1154-1183 \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":"compiler/rustc_infer/src/infer/mod.rs"},"region":{"startLine":1128}}}],"partialFingerprints":{"codehealthFindingId/v1":"282786fbb056e49b7ac12841074069124233db11ada65c13d47cb2056781fbf8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): compiler/rustc_infer/src/infer/relate/lattice.rs:97-118 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/relate/lattice.rs:109-127 \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":"compiler/rustc_infer/src/infer/relate/lattice.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"49bf8613e58a89a1e580a1765ec44b621dc7e5a88dcf71ec03e2c817154a4cd9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): library/core/src/slice/iter.rs:843-861 | library/core/src/slice/iter.rs:882-907 \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":"library/core/src/slice/iter.rs"},"region":{"startLine":843}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7644a2361b5a21ebb96d716ba7320e38124c277b6c5bd97363df005d102e1ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): library/stdarch/crates/intrinsic-test/src/common/gen_c.rs:21-59 | library/stdarch/crates/intrinsic-test/src/common/gen_rust.rs:329-359 \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":"library/stdarch/crates/intrinsic-test/src/common/gen_c.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"47afecb086ba69a077f83bfc4ff0767cb85dcb7ff0d0fc4af65998e1eeecbe90"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): src/tools/clippy/clippy_utils/src/mir/possible_borrower.rs:43-63 | src/tools/clippy/clippy_utils/src/mir/possible_origin.rs:25-39 \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/tools/clippy/clippy_utils/src/mir/possible_borrower.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"134228751eb2158b927ae2acc9b33480d34eae0d064bfd14e596f0d68e8951bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): compiler/rustc_borrowck/src/diagnostics/mod.rs:921-935 | compiler/rustc_borrowck/src/diagnostics/mod.rs:949-965 \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":"compiler/rustc_borrowck/src/diagnostics/mod.rs"},"region":{"startLine":921}}}],"partialFingerprints":{"codehealthFindingId/v1":"98cb433c31a66e2bbfda4a1018e38e490088b1046b17836b8e825a02ca1c272e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): compiler/rustc_middle/src/ty/predicate.rs:356-451 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/predicate.rs:889-909 \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":"compiler/rustc_middle/src/ty/predicate.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd0baade9b9d7e9e4a6952a5ac678259780dc31e114cc92739343391304132ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): compiler/rustc_trait_selection/src/solve/fulfill/derive_errors.rs:396-413 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/errors.rs:505-524 \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":"compiler/rustc_trait_selection/src/solve/fulfill/derive_errors.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"e226ff5eb9fa8bac79ec5507dd1cd4525cc708779ff37f06c9da6530e4a040de"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): src/tools/clippy/clippy_lints/src/functions/result.rs:54-64 | src/tools/clippy/clippy_lints/src/functions/result.rs:72-84 \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/tools/clippy/clippy_lints/src/functions/result.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"005008bbf7197b2d5bb7767308c29eac58b4c5d955cc5e180f2e9ad71c4e34c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): src/tools/clippy/clippy_lints/src/pathbuf_init_then_push.rs:134-151 | src/tools/clippy/clippy_lints/src/vec_init_then_push.rs:157-175 \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/tools/clippy/clippy_lints/src/pathbuf_init_then_push.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"8384f1232875b7682af3c5842fd9db4597a5687b5b52fecf0f3e5339b90f3e20"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 18\u002B corresponding lines): src/tools/rust-analyzer/crates/ide/src/navigation_target.rs:688-705 | src/tools/rust-analyzer/crates/ide/src/navigation_target.rs:760-777 | src/tools/rust-analyzer/crates/ide/src/navigation_target.rs:784-809 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 18 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/tools/rust-analyzer/crates/ide/src/navigation_target.rs"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"31caaf30c4284d4e32ad511415425039640570e6ca2b7bd91a67393ee5bebd01"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): compiler/rustc_codegen_ssa/src/mir/operand.rs:887-902 | compiler/rustc_codegen_ssa/src/mir/operand.rs:909-923 \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":"compiler/rustc_codegen_ssa/src/mir/operand.rs"},"region":{"startLine":887}}}],"partialFingerprints":{"codehealthFindingId/v1":"61bcb87b495b57540bf6e7fdc5a40899801e3cdf9735543c12c2822af3905cc9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): compiler/rustc_index/src/interval.rs:289-310 | compiler/rustc_index/src/interval.rs:313-328 \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":"compiler/rustc_index/src/interval.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"73038be0d5e0d2032d905f3cde11cee26c2e8b36580f55cf2193b86264347826"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): library/compiler-builtins/libm/src/math/exp10.rs:11-29 | library/compiler-builtins/libm/src/math/exp10f.rs:11-29 \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":"library/compiler-builtins/libm/src/math/exp10.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeed84a7e46ac09c3033a56563e6cfe7f4aa9160b0bac6623e370ad27fb473df"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): src/tools/rust-analyzer/crates/hir-def/src/lang_item.rs:176-194 | src/tools/rust-analyzer/crates/hir-def/src/lang_item.rs:201-215 \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/tools/rust-analyzer/crates/hir-def/src/lang_item.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bd1ed81a7777939d83273808e26b5973ae769f4ea42c2434ac50e8f95798229"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): library/std/src/sys/fs/windows.rs:452-472 | library/std/src/sys/fs/windows.rs:474-494 \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":"library/std/src/sys/fs/windows.rs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"97d16659d4e5feb661e08c3c6568080a9c67e6a05eee46603c0fcff471e5cfcf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512bw.rs:4396-4413 | library/stdarch/crates/core_arch/src/x86/avx512bw.rs:4762-4779 \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":"library/stdarch/crates/core_arch/src/x86/avx512bw.rs"},"region":{"startLine":4396}}}],"partialFingerprints":{"codehealthFindingId/v1":"08d7c7fe279cbc2b9a3287ab5c8e3dfceef26c6a6c0810aebe12d835094a1a96"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512bw.rs:4457-4474 | library/stdarch/crates/core_arch/src/x86/avx512bw.rs:4823-4840 \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":"library/stdarch/crates/core_arch/src/x86/avx512bw.rs"},"region":{"startLine":4457}}}],"partialFingerprints":{"codehealthFindingId/v1":"28721accb1701e90b350be1509bdec73cfa42e8e1d8ac3452ab0303871fbc4ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512bw.rs:4518-4535 | library/stdarch/crates/core_arch/src/x86/avx512bw.rs:4884-4901 \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":"library/stdarch/crates/core_arch/src/x86/avx512bw.rs"},"region":{"startLine":4518}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fab19547c5693f99460bc72a1ea45648319faff107ccede6dfec54ac5a84339"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512bw.rs:4579-4596 | library/stdarch/crates/core_arch/src/x86/avx512bw.rs:4945-4962 \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":"library/stdarch/crates/core_arch/src/x86/avx512bw.rs"},"region":{"startLine":4579}}}],"partialFingerprints":{"codehealthFindingId/v1":"c52e36cc3b65a204e29eff124a142deba72e050ced12fc8d73f5ea67fd111394"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512bw.rs:4640-4657 | library/stdarch/crates/core_arch/src/x86/avx512bw.rs:5006-5023 \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":"library/stdarch/crates/core_arch/src/x86/avx512bw.rs"},"region":{"startLine":4640}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4e243569a4f8b7eff5fa84042bf7c3a8199fe6da8cf39c4314e39bdc23fabcf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512bw.rs:4701-4718 | library/stdarch/crates/core_arch/src/x86/avx512bw.rs:5067-5084 \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":"library/stdarch/crates/core_arch/src/x86/avx512bw.rs"},"region":{"startLine":4701}}}],"partialFingerprints":{"codehealthFindingId/v1":"008d9104d0be506b65a960e175662a365d326e85a39c43350050a34fd800ee34"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512f.rs:32680-32697 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:33301-33318 \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":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":32680}}}],"partialFingerprints":{"codehealthFindingId/v1":"420208d4dd212eb29e1bf1a782c72c9de9e3092f3d879b15aea008ef9cf6c399"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512f.rs:32744-32761 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:33365-33382 \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":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":32744}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e0c632d39956bbeb6e0682df02b2a129d2f55650039688722e1b2b431562f67"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512f.rs:32805-32822 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:33426-33443 \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":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":32805}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7684c560b4e209a593e3e9080cf5ec8b1637fc3ff8e3bacb366f47f184bc1ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512f.rs:33922-33939 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:34543-34560 \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":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":33922}}}],"partialFingerprints":{"codehealthFindingId/v1":"776bed474bee056befe22041edbf0fa01841b5aa46b993c9aeeef2efda7f579c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512f.rs:33986-34003 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:34607-34624 \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":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":33986}}}],"partialFingerprints":{"codehealthFindingId/v1":"71446ebe6270d55a8dd8b42d414046577087cd138dc6e2fdab9159c42aeae41e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512f.rs:34047-34064 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:34668-34685 \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":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":34047}}}],"partialFingerprints":{"codehealthFindingId/v1":"544a97447bb945010e5501e90dd4014a2e5a059380e5cad7220c4318d7296c9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): src/tools/rust-analyzer/crates/hir/src/source_analyzer.rs:537-547 | src/tools/rust-analyzer/crates/hir/src/source_analyzer.rs:553-570 \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/tools/rust-analyzer/crates/hir/src/source_analyzer.rs"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"41305aeb7d5504c3b095b344f2df73532cdbf7f8501314e04859c50d371da325"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): src/tools/rust-analyzer/crates/ide-completion/src/render/pattern.rs:179-201 | src/tools/rust-analyzer/crates/ide-completion/src/render/pattern.rs:208-230 \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/tools/rust-analyzer/crates/ide-completion/src/render/pattern.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a2ac4c964aaf2ed1578be497c5bdde5f4b4125767060a1443577a69425beb2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): compiler/rustc_hir_typeck/src/upvar.rs:2238-2253 | compiler/rustc_hir_typeck/src/upvar.rs:2256-2271 \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":"compiler/rustc_hir_typeck/src/upvar.rs"},"region":{"startLine":2238}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3967598d3789935476f054d8e4cacee1688b94cd0103bd8fbad273871ca1213"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): compiler/rustc_type_ir/src/binder.rs:258-278 | compiler/rustc_type_ir/src/binder.rs:280-298 \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":"compiler/rustc_type_ir/src/binder.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffeb54b58d9019ef0163016c5caada6cf54d918a0374b90a23a49aa4e6d32c14"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): library/alloc/src/collections/btree/search.rs:256-271 | library/alloc/src/collections/btree/search.rs:286-301 \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":"library/alloc/src/collections/btree/search.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"e21dc71ef3eb62c3380aa2831f2120f86619ff50157085b8594d9b9818863e1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): library/alloc/src/collections/btree/set.rs:1953-1978 | library/alloc/src/collections/btree/set.rs:2054-2075 \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":"library/alloc/src/collections/btree/set.rs"},"region":{"startLine":1953}}}],"partialFingerprints":{"codehealthFindingId/v1":"663525ab376edaa61a379d78f1eecd7a0f4b0179d7874cd35228d30638251d6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): library/std/src/sys/process/windows/child_pipe.rs:244-261 | library/std/src/sys/process/windows/child_pipe.rs:263-286 \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":"library/std/src/sys/process/windows/child_pipe.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"23a14d5b686ccaf7a2365d45a520c941d77b664551846c58b94c524a6910fdcb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): src/tools/compiletest/src/directives/cfg.rs:42-57 | src/tools/compiletest/src/directives/cfg.rs:62-79 \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/tools/compiletest/src/directives/cfg.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6f7b4cd382d99e4de711479482647d95d3de344933d39f1644d313bb41156b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): compiler/rustc_ast/src/format.rs:94-115 | src/tools/rust-analyzer/crates/hir-def/src/hir/format_args.rs:470-491 \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":"compiler/rustc_ast/src/format.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc70035719ab78a8205e08b8a638bd7e41621bd4c2d730f56625d21f11f22c5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): compiler/rustc_hir_typeck/src/method/confirm.rs:381-416 | src/tools/rust-analyzer/crates/hir-ty/src/method_resolution/confirm.rs:316-344 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/method/confirm.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"23a47daf98ea65b71d6d81680505615a0be5e51d1c4ee961cf63736d436d4409"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): library/compiler-builtins/libm/src/math/cos.rs:49-77 | library/compiler-builtins/libm/src/math/sin.rs:48-82 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/compiler-builtins/libm/src/math/cos.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"044d7910c24af5fa484adc93b76883447f775f57d76c239b872433556dc4d377"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): library/compiler-builtins/libm/src/math/cosh.rs:9-36 | library/compiler-builtins/libm/src/math/coshf.rs:9-36 \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":"library/compiler-builtins/libm/src/math/cosh.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"48b63f64c751d52410e2d4304077f70e2412b2f50ebc7aa6038b38de6b6c0ac6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): library/std/src/fs.rs:353-362 | library/std/src/fs.rs:396-406 \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":"library/std/src/fs.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f31a52f1108c09b4a7869a6645789e48a60b1c734e2b03f599db2d5cbf9dbcd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512f.rs:25325-25342 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:25629-25646 \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":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":25325}}}],"partialFingerprints":{"codehealthFindingId/v1":"db1d74dd23f67c517e582c86e1368b9aa7e61d5890b7d8f7f027f36eee19863b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): src/tools/rust-analyzer/crates/hir/src/lib.rs:5927-5939 | src/tools/rust-analyzer/crates/hir/src/lib.rs:5941-5953 \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/tools/rust-analyzer/crates/hir/src/lib.rs"},"region":{"startLine":5927}}}],"partialFingerprints":{"codehealthFindingId/v1":"30c4fbd60aae311a1ccf3ccce22f31dba21969c9391df4928502d3d04711a707"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): src/tools/rust-analyzer/crates/parser/src/grammar/expressions/atom.rs:772-801 | src/tools/rust-analyzer/crates/parser/src/grammar/items/traits.rs:84-102 \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/tools/rust-analyzer/crates/parser/src/grammar/expressions/atom.rs"},"region":{"startLine":772}}}],"partialFingerprints":{"codehealthFindingId/v1":"e936739bfbd190219f60a74cabd713dd266663a356720002a42610917e872665"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): src/etc/gdb_trim_paths.py:20-45 | src/etc/lldb_trim_paths.py:21-44 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/etc/gdb_trim_paths.py"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"a72288ac20402220623f63c32a7661b76431ca6d35fae3b5e6233affb4e94d56"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): compiler/rustc_target/src/callconv/aarch64.rs:83-109 | compiler/rustc_target/src/callconv/arm.rs:41-72 \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":"compiler/rustc_target/src/callconv/aarch64.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fe0aca64191c331a2d1f79e81cdb9312ac9f61f66568e81e597ff0d90cf975b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): src/tools/miri/src/shims/unix/socket.rs:1249-1267 | src/tools/miri/src/shims/unix/socket.rs:1276-1294 \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/tools/miri/src/shims/unix/socket.rs"},"region":{"startLine":1249}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a8c9f4facdcee4aa33bad37c9efb2d2d4cf8dc0bc341232db18ca944814f78a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): src/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_from_impl_for_enum.rs:156-167 | src/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_single_field_struct_from.rs:226-236 \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/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_from_impl_for_enum.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f542d4be11f25716af02761c72c82d853b39d655e750b65cd2290f8ddb29f51"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): compiler/rustc_hir_typeck/src/fn_ctxt/inspect_obligations.rs:112-146 | src/tools/rust-analyzer/crates/hir-ty/src/infer/unify.rs:214-235 \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":"compiler/rustc_hir_typeck/src/fn_ctxt/inspect_obligations.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"a675159f4086926051417f21ce8c3b2f69747f2e85f08d476275357e84f22347"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): compiler/rustc_hir_typeck/src/upvar.rs:2097-2118 | src/tools/rust-analyzer/crates/hir-ty/src/infer/closure/analysis.rs:1099-1120 \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":"compiler/rustc_hir_typeck/src/upvar.rs"},"region":{"startLine":2097}}}],"partialFingerprints":{"codehealthFindingId/v1":"b71dad3ca5a41a65f86a55dfac57338121af77a68796f4629dbd21b3301362b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): compiler/rustc_infer/src/infer/mod.rs:987-999 | compiler/rustc_next_trait_solver/src/solve/eval_ctxt/mod.rs:1207-1219 \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":"compiler/rustc_infer/src/infer/mod.rs"},"region":{"startLine":987}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e3cf1ec7230fc07cd6553d538801a575765a935a6a2e3f3e65b042d3a1cc7d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): compiler/rustc_middle/src/ty/mod.rs:1464-1504 | compiler/rustc_middle/src/ty/mod.rs:1549-1573 \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":"compiler/rustc_middle/src/ty/mod.rs"},"region":{"startLine":1464}}}],"partialFingerprints":{"codehealthFindingId/v1":"3915a4684dba0fabb12a7a7b0a3f028f4ffb1f2f633c59c3a0e486a318b8855f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): compiler/rustc_parse/src/parser/expr.rs:1870-1881 | compiler/rustc_parse/src/parser/expr.rs:1887-1898 \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":"compiler/rustc_parse/src/parser/expr.rs"},"region":{"startLine":1870}}}],"partialFingerprints":{"codehealthFindingId/v1":"89d3ec285f500bf56ac121cfd1ee44afbdea56d06f2599793dfa12b9027af7f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): compiler/rustc_parse/src/parser/expr/diagnostics.rs:116-132 | compiler/rustc_parse/src/parser/expr/diagnostics.rs:135-147 \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":"compiler/rustc_parse/src/parser/expr/diagnostics.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"804bfc0374237840964238701632feb1ddd8a9f1d653a1b0c87df78e8144e828"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): library/std/src/sync/poison/mutex.rs:706-721 | library/std/src/sync/poison/rwlock.rs:709-724 \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":"library/std/src/sync/poison/mutex.rs"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ec59f35d9392f305d75d9823bfd0b085c579ee6f45a1f093e9a55378b25aa98"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512f.rs:25939-25952 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:29042-29057 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:29186-29199 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":25939}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a3468a7b4f4f32a8db1a81871ed927e4f25da2df62d5190ef84bf73a1b057cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): src/librustdoc/html/markdown.rs:1751-1767 | src/librustdoc/html/markdown.rs:1772-1790 \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/librustdoc/html/markdown.rs"},"region":{"startLine":1751}}}],"partialFingerprints":{"codehealthFindingId/v1":"0237221de10d27e586a38af97bd9622ad0e684c10d8ee2a6d7de547573ed29db"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): src/librustdoc/passes/propagate_doc_cfg.rs:34-47 | src/librustdoc/passes/propagate_doc_cfg.rs:51-66 \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/librustdoc/passes/propagate_doc_cfg.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"a52d3e7014374077610949a5768783bd84ceda14c909964a18980fa07ae8f019"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): src/tools/rust-analyzer/crates/hir-ty/src/next_solver/generic_arg.rs:108-125 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/generic_arg.rs:128-144 \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/tools/rust-analyzer/crates/hir-ty/src/next_solver/generic_arg.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c92c6560b75dd8dcc56fad82ce84ad068677f265b13548dae622d4f53ed9f33"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): src/tools/rust-analyzer/crates/hir/src/source_analyzer.rs:1630-1649 | src/tools/rust-analyzer/crates/hir/src/source_analyzer.rs:1671-1690 \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/tools/rust-analyzer/crates/hir/src/source_analyzer.rs"},"region":{"startLine":1630}}}],"partialFingerprints":{"codehealthFindingId/v1":"82026645fe9ef30ca27ed3b3e259fceea713f30348eefd72e0109ecef8a66481"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): compiler/rustc_hir_typeck/src/intrinsicck.rs:280-294 | compiler/rustc_hir_typeck/src/intrinsicck.rs:296-309 \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":"compiler/rustc_hir_typeck/src/intrinsicck.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"a47bda0e68ecf65d34f66afb17aca235963f4cf009311b2605196c704bc44ea5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): compiler/rustc_hir_typeck/src/upvar.rs:2125-2150 | src/tools/rust-analyzer/crates/hir-ty/src/infer/closure/analysis.rs:1127-1152 \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":"compiler/rustc_hir_typeck/src/upvar.rs"},"region":{"startLine":2125}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f376897e35bf2d9dfa0f226b0d82532e9e7f8a0e145b7ab1888302337c226a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): compiler/rustc_infer/src/infer/snapshot/fudge.rs:148-163 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/snapshot/fudge.rs:141-157 \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":"compiler/rustc_infer/src/infer/snapshot/fudge.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"63bc692de949782d8ab8af18b9902db271f21c1e8d3d5fce8dd0fa01e76e8712"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): src/tools/clippy/clippy_utils/src/str_utils.rs:213-227 | src/tools/clippy/clippy_utils/src/str_utils.rs:239-258 \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/tools/clippy/clippy_utils/src/str_utils.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3546f38abac53f13e8100e845d2d522f221d9d8c18688f6e8d3885cdfc74dd2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): src/tools/rust-analyzer/crates/hir-def/src/nameres.rs:349-366 | src/tools/rust-analyzer/crates/hir-def/src/nameres.rs:789-803 \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/tools/rust-analyzer/crates/hir-def/src/nameres.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"66d8836bf37318fc788b78e2eb6cbdfadc1b0d35a707b44da47ee933db929ee8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): compiler/rustc_hir_typeck/src/method/probe.rs:1621-1648 | src/tools/rust-analyzer/crates/hir-ty/src/method_resolution/probe.rs:1405-1428 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/method/probe.rs"},"region":{"startLine":1621}}}],"partialFingerprints":{"codehealthFindingId/v1":"489ed75d4a063e32556c2c052a572e628f6ef9d1aeef20460d08a4921be0dff9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): compiler/rustc_infer/src/infer/canonical/instantiate.rs:91-108 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/canonical/instantiate.rs:133-150 \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":"compiler/rustc_infer/src/infer/canonical/instantiate.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a3986c5c2596e2d35e77ea42ed1b7c703aabb29697de7c5ca2acbb10126545c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 25\u002B corresponding lines): compiler/rustc_infer/src/infer/type_variable.rs:391-418 | compiler/rustc_infer/src/infer/unify_key.rs:155-179 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/unify_key.rs:153-178 \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":"compiler/rustc_infer/src/infer/type_variable.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"516b1b810f52ed070fb3500f38790ed87bdba04037d44610e18a2b551d46e197"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): library/compiler-builtins/libm/src/math/erf.rs:175-185 | library/compiler-builtins/libm/src/math/erff.rs:86-95 \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":"library/compiler-builtins/libm/src/math/erf.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b00e0fc14903fe046385ff195353713f29e6c4151349af1ac45134397b4209d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): src/tools/clippy/clippy_lints/src/casts/cast_sign_loss.rs:290-329 | src/tools/clippy/clippy_lints/src/casts/cast_sign_loss.rs:339-363 \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/tools/clippy/clippy_lints/src/casts/cast_sign_loss.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"97679009ce9fe0f1ab75d2b1bdacb93b0d9864453b0524ca90b99a1b26c00ffa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): src/tools/clippy/clippy_lints/src/extra_unused_type_parameters.rs:258-274 | src/tools/clippy/clippy_lints/src/extra_unused_type_parameters.rs:276-290 \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/tools/clippy/clippy_lints/src/extra_unused_type_parameters.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"76f4b0802508364f6ef2a95dc4652fe651fe4d704597c5c907d45d15f056684a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): compiler/rustc_abi/src/lib.rs:2316-2346 | compiler/rustc_errors/src/annotate_snippet_emitter_writer.rs:52-80 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_abi/src/lib.rs"},"region":{"startLine":2316}}}],"partialFingerprints":{"codehealthFindingId/v1":"255095789a9c7c5ffb64a52e1f2cddc22f528a9301cb023aef5682890a9c6fcd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): compiler/rustc_middle/src/ty/layout.rs:1499-1521 | compiler/rustc_middle/src/ty/layout.rs:1538-1559 \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":"compiler/rustc_middle/src/ty/layout.rs"},"region":{"startLine":1499}}}],"partialFingerprints":{"codehealthFindingId/v1":"156ff205e727a13a863bfb4a166e4e647e14e1a3f670a0dee2595eb79a80b889"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): src/tools/clippy/clippy_dev/src/edit_lints.rs:226-240 | src/tools/clippy/clippy_dev/src/edit_lints.rs:242-255 \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/tools/clippy/clippy_dev/src/edit_lints.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"16c249280251bfc1ffbd230596aafefb2f5a8efd0a3c6a4e2f0e143cc64ba28f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): src/tools/rust-analyzer/crates/hir-ty/src/lower.rs:1504-1522 | src/tools/rust-analyzer/crates/hir-ty/src/lower.rs:1836-1853 \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/tools/rust-analyzer/crates/hir-ty/src/lower.rs"},"region":{"startLine":1504}}}],"partialFingerprints":{"codehealthFindingId/v1":"42cbf0b912cdff2eb67220fc7318719bfb8c5be40b82c22b059f8e27f0737643"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): src/tools/rust-analyzer/lib/smol_str/src/lib.rs:1052-1073 | src/tools/rust-analyzer/lib/smol_str/src/lib.rs:1076-1100 \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/tools/rust-analyzer/lib/smol_str/src/lib.rs"},"region":{"startLine":1052}}}],"partialFingerprints":{"codehealthFindingId/v1":"913d1dba957cf00f6eade7ccb5e75e54861d874e76d6bbf069ce62195b8d65c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): compiler/rustc_expand/src/proc_macro.rs:43-57 | compiler/rustc_expand/src/proc_macro.rs:71-87 \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":"compiler/rustc_expand/src/proc_macro.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"900e18fe5780d1c22c5dd9bc2198f6b50d40adffd32d20342ae9de3954f213fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): compiler/rustc_type_ir/src/universe.rs:109-131 | compiler/rustc_type_ir/src/universe.rs:133-149 \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":"compiler/rustc_type_ir/src/universe.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f6e45a46c6355e499275ee556b1dbe97df53940376fc802cb7643273f4ca696"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 17\u002B corresponding lines): library/core/src/slice/iter.rs:1769-1788 | library/core/src/slice/iter.rs:2110-2126 | library/core/src/slice/iter.rs:2580-2598 | library/core/src/slice/iter.rs:2934-2953 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 17 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/slice/iter.rs"},"region":{"startLine":1769}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce04ff36c67f4b459875d084d443b0ad30c7544d6dcf300442f2b95c1d2032c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 19\u002B corresponding lines): library/std/src/sys/env/solid.rs:56-74 | library/std/src/sys/env/unix.rs:112-130 | library/std/src/sys/env/wasi.rs:74-92 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 19 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/env/solid.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6012b32bc4de97b25f7e530842f2e3a730a56f238dc02ba743c94b5acbcb6ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): library/std/src/sys/fs/hermit.rs:357-368 | library/std/src/sys/fs/solid.rs:271-280 \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":"library/std/src/sys/fs/hermit.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ae5d000e4c8b330f770feecbe2265047ced9d9949942ce419e4af499f74b26c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): library/std/src/sys/net/connection/uefi/tcp4.rs:183-198 | library/std/src/sys/net/connection/uefi/tcp4.rs:268-283 \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":"library/std/src/sys/net/connection/uefi/tcp4.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eefda08092b1639d6bbbfb1db6574592b61339fae80a650549b694b5cddf3ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): library/compiler-builtins/libm/src/math/support/big.rs:136-156 | library/compiler-builtins/libm/src/math/support/big.rs:162-183 \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":"library/compiler-builtins/libm/src/math/support/big.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"844bb4aa5c5597707790767097af360a6abb669343a426ae7899b44ecd26ac45"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): library/core/src/num/imp/bignum.rs:146-162 | library/core/src/num/imp/bignum.rs:181-194 \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":"library/core/src/num/imp/bignum.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae4aecbfe8499db071e4f445b155b162a84cec52fd06badb3c342c9e05cf2c1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): library/core/src/str/pattern.rs:738-753 | library/core/src/str/pattern.rs:758-773 \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":"library/core/src/str/pattern.rs"},"region":{"startLine":738}}}],"partialFingerprints":{"codehealthFindingId/v1":"00bc0e160d9a7ceedc53c090d5c235c330fb47843c00f5a9545a4967be341767"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): src/tools/clippy/clippy_lints/src/missing_doc.rs:196-212 | src/tools/clippy/clippy_lints/src/missing_doc.rs:214-233 \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/tools/clippy/clippy_lints/src/missing_doc.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ac889371835ce3df2ecde41c4fcda35fcd3b13300764c08997b727b13a05a01"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): src/tools/clippy/clippy_lints/src/pathbuf_init_then_push.rs:174-185 | src/tools/clippy/clippy_lints/src/reserve_after_initialization.rs:125-142 | src/tools/clippy/clippy_lints/src/vec_init_then_push.rs:200-218 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/pathbuf_init_then_push.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ec89ba9df7e12b1e872399d786b7987832539b2f7cdb35f866d155359656e34"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 11\u002B corresponding lines): src/tools/rust-analyzer/crates/hir/src/source_analyzer.rs:1512-1522 | src/tools/rust-analyzer/crates/hir/src/source_analyzer.rs:1528-1539 | src/tools/rust-analyzer/crates/hir/src/source_analyzer.rs:1545-1556 | src/tools/rust-analyzer/crates/hir/src/source_analyzer.rs:1562-1573 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir/src/source_analyzer.rs"},"region":{"startLine":1512}}}],"partialFingerprints":{"codehealthFindingId/v1":"904ac43569692074178baa2c706e3dd4907c53ecd3065390acb002d119da4056"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): src/tools/rust-analyzer/crates/syntax/src/ast/make.rs:1380-1392 | src/tools/rust-analyzer/crates/syntax/src/ast/make.rs:1400-1412 \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/tools/rust-analyzer/crates/syntax/src/ast/make.rs"},"region":{"startLine":1380}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e798ee1c74345afcb05c50a0637626af225509af8d60675b5a1ff93c7b2969b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): compiler/rustc_hir_typeck/src/upvar.rs:2733-2750 | src/tools/rust-analyzer/crates/hir-ty/src/infer/closure/analysis.rs:1547-1564 \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":"compiler/rustc_hir_typeck/src/upvar.rs"},"region":{"startLine":2733}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e760f5ade82504f1fc864af035ef33d72f23c5206e1fcc000a0e52dc96c3a1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): compiler/rustc_public/src/compiler_interface.rs:221-233 | compiler/rustc_public/src/compiler_interface.rs:235-247 \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":"compiler/rustc_public/src/compiler_interface.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd6cbea75b0c5d6c4d92c089ae167af65dd949a7a6f02703423fc22472031c5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): compiler/rustc_ty_utils/src/needs_drop.rs:482-497 | compiler/rustc_ty_utils/src/needs_drop.rs:502-516 \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":"compiler/rustc_ty_utils/src/needs_drop.rs"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"edcaa574f7ccdec310dd2908e909673ddb466e31d5635885e37d0df60989a282"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): compiler/rustc_type_ir/src/sty/consts.rs:339-351 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/consts.rs:270-282 \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":"compiler/rustc_type_ir/src/sty/consts.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a06b1011f883cde1e9d2d1c911794e11495c923aadd0ded90a9e34e23738295"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): library/compiler-builtins/compiler-builtins/src/float/conv.rs:123-134 | library/compiler-builtins/compiler-builtins/src/float/conv.rs:181-192 \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":"library/compiler-builtins/compiler-builtins/src/float/conv.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eab94121f171ae48bd23bbf3ff2c3113b230b77d9cc79512b0f2b474d8c1a5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): library/core/src/str/pattern.rs:454-479 | library/core/src/str/pattern.rs:528-546 \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":"library/core/src/str/pattern.rs"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b762bd0d09e73cdff4a3f0cdd2d8fa7be63f994eb0233e2a1a18329014b73e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): src/tools/clippy/clippy_lints/src/methods/map_unwrap_or.rs:186-201 | src/tools/clippy/clippy_lints/src/option_if_let_else.rs:295-306 \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/tools/clippy/clippy_lints/src/methods/map_unwrap_or.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"da753d0cec9c52512c20eb64a5da8d919a0215f65be3fe52cf3b1eefd370587d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): src/tools/rust-analyzer/crates/hir/src/lib.rs:469-483 | src/tools/rust-analyzer/crates/hir/src/lib.rs:486-499 | src/tools/rust-analyzer/crates/hir/src/lib.rs:501-514 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir/src/lib.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"e78e28a36ca2af850bc2cbb993e919d0f32a51252aa0349655ba310334a8543f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): compiler/rustc_hir_typeck/src/coercion.rs:873-884 | compiler/rustc_hir_typeck/src/coercion.rs:917-928 \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":"compiler/rustc_hir_typeck/src/coercion.rs"},"region":{"startLine":873}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecbc27e604872f74ee66062f80a2807b4fa4985844ab9d3a380c0a11567bd8de"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): compiler/rustc_hir_typeck/src/expr_use_visitor.rs:1481-1497 | src/tools/rust-analyzer/crates/hir-ty/src/infer/closure/analysis/expr_use_visitor.rs:1432-1448 \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":"compiler/rustc_hir_typeck/src/expr_use_visitor.rs"},"region":{"startLine":1481}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dc6a4dbb8afd1e6bb5a9ded5ba5fff09d41f4c74fc2d7d9dc00ca0cea0848c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): compiler/rustc_mir_transform/src/coroutine/mod.rs:750-760 | compiler/rustc_mir_transform/src/coroutine/mod.rs:796-808 \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":"compiler/rustc_mir_transform/src/coroutine/mod.rs"},"region":{"startLine":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb97b83c3a60b0e5cf2fa0bbc9d779bdcba496e5923248c55d4a8bf97ea5cf46"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): library/compiler-builtins/libm/src/math/lgamma_r.rs:149-168 | library/compiler-builtins/libm/src/math/tgamma.rs:31-53 \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":"library/compiler-builtins/libm/src/math/lgamma_r.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"39f18269f1a2382ca5269250dc8d7ed9086a683d79b1d0b99043456077246864"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 17\u002B corresponding lines): library/core/src/fmt/builders.rs:248-265 | library/core/src/fmt/builders.rs:461-478 | library/core/src/fmt/builders.rs:728-745 | library/core/src/fmt/builders.rs:943-959 | library/core/src/fmt/builders.rs:1337-1356 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 17 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/fmt/builders.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"217a96bbad20a104c32ff3b6865ff9945c79611db6bbc41921f5f4ccbe318d46"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/tools/clippy/clippy_lints/src/loops/mut_range_bound.rs:85-96 | src/tools/clippy/clippy_lints/src/loops/mut_range_bound.rs:98-107 \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/tools/clippy/clippy_lints/src/loops/mut_range_bound.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"711e9c3d06e50b9479664e83c0eb2323ed182e1e36b4d4ad185693d57283b723"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): src/tools/miri/src/concurrency/vector_clock.rs:315-345 | src/tools/miri/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/tools/miri/src/concurrency/vector_clock.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffeb9f6cbf12a807477f0c1c9d189b8738fdf5716e765406bd59425bd850ea78"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): compiler/rustc_ast/src/attr/version.rs:29-35 | compiler/rustc_attr_parsing/src/attributes/util.rs:16-27 | compiler/rustc_macros/src/current_version.rs:31-38 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ast/src/attr/version.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e5f39dc9199bdd02781a58d1da33b5a39b156cf5392d803e759547e43124354"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): compiler/rustc_attr_parsing/src/attributes/link_attrs.rs:397-410 | compiler/rustc_attr_parsing/src/attributes/link_attrs.rs:437-452 \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":"compiler/rustc_attr_parsing/src/attributes/link_attrs.rs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"7637da515eb498a610f4be1670e8de8cc5622c01859f0c4d8da6f0772b38cb26"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): compiler/rustc_hir_typeck/src/closure.rs:483-504 | src/tools/rust-analyzer/crates/hir-ty/src/infer/closure.rs:600-618 \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":"compiler/rustc_hir_typeck/src/closure.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"f278d8fb4491bc30ccc26db84a9fa7541c34e377007489537434f1e1550849dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): compiler/rustc_middle/src/ty/pattern.rs:18-33 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/interner.rs:768-783 \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":"compiler/rustc_middle/src/ty/pattern.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"822f0fad1d86183822b88709793eca89f30559df04de87b8a852b1ea9da464e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): compiler/rustc_parse/src/parser/expr/diagnostics.rs:154-164 | compiler/rustc_parse/src/parser/expr/diagnostics.rs:171-182 \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":"compiler/rustc_parse/src/parser/expr/diagnostics.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"76e9ad4753c0e7eaa7f98632f55a159358ddbdf273b12230047e790e41d08fae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): compiler/rustc_trait_selection/src/solve/fulfill.rs:277-299 | compiler/rustc_trait_selection/src/solve/fulfill.rs:304-320 \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":"compiler/rustc_trait_selection/src/solve/fulfill.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff02db9801eac3935f224c3bda325ff7c2d34ad1f508f334c344bfa91df3be5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): library/core/src/slice/iter.rs:460-477 | library/core/src/slice/iter.rs:497-514 \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":"library/core/src/slice/iter.rs"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fde8fc88159c53199aaf04950b216ed845ea6c40fc8146318028531c2eadee4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): library/std/src/sys/fs/common.rs:37-55 | library/std/src/sys/fs/solid.rs:576-595 \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":"library/std/src/sys/fs/common.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"b66a76acde9d6970a67d32c7ea2a78728d5f088a39ca83803e3f6aeaf8338f79"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): src/librustdoc/clean/cfg.rs:227-244 | src/librustdoc/clean/cfg.rs:317-331 \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/librustdoc/clean/cfg.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"91f162bca4747faa3ce75953277f6e30eacc55b171f6c0d54cff9ca4ce91bebf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): src/tools/miri/src/shims/native_lib/trace/parent.rs:573-596 | src/tools/miri/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/tools/miri/src/shims/native_lib/trace/parent.rs"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"2657be3bcd52b8485826f9520c43bebb5c23fb417fd7262ac82862b12eb02cff"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): src/tools/miri/src/shims/unix/socket.rs:1075-1092 | src/tools/miri/src/shims/unix/socket.rs:1105-1122 \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/tools/miri/src/shims/unix/socket.rs"},"region":{"startLine":1075}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b7c6a1f1203c227b88750ecc9cb1ec1d5f72101421f18994466c87f746ba092"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): src/tools/rust-analyzer/crates/hir-def/src/expr_store.rs:790-807 | src/tools/rust-analyzer/crates/hir-def/src/expr_store.rs:825-842 \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/tools/rust-analyzer/crates/hir-def/src/expr_store.rs"},"region":{"startLine":790}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a6ab8c35911640317773e66b0c2b6db18db92605ceeb06127be141fac9fe41f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): src/tools/rust-analyzer/crates/ide-db/src/search.rs:161-176 | src/tools/rust-analyzer/crates/ide-db/src/search.rs:179-193 \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/tools/rust-analyzer/crates/ide-db/src/search.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bbef717941871c0395eafd933e66409caa57d7c3ead648b0b6312b86b990c0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): src/tools/rust-analyzer/crates/stdx/src/thin_map.rs:901-919 | src/tools/rust-analyzer/crates/stdx/src/thin_map.rs:922-945 | src/tools/rust-analyzer/crates/stdx/src/thin_map.rs:948-961 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/stdx/src/thin_map.rs"},"region":{"startLine":901}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fb010dbe1ce7f16874ec80be0082a371a556ea6890533186b7ba585a9341a1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 11\u002B corresponding lines): compiler/rustc_hir/src/hir.rs:4934-4944 | compiler/rustc_hir/src/hir.rs:4946-4956 | compiler/rustc_hir/src/hir.rs:5155-5168 | compiler/rustc_hir/src/hir.rs:5183-5193 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir/src/hir.rs"},"region":{"startLine":4934}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3e0f8bead16a7d29aecbf97b39076e7bfb7e55af9fcf35e2acc030fe1216d3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): compiler/rustc_lint/src/unused/must_use.rs:433-463 | src/tools/clippy/clippy_utils/src/lib.rs:1792-1808 \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":"compiler/rustc_lint/src/unused/must_use.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb896e256ba917f71f66e1a844ae672a734b1ae03564a8c29185b24d527cb49b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): library/std/src/os/xous/ffi.rs:297-321 | library/std/src/os/xous/ffi.rs:326-349 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/os/xous/ffi.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bb1306f2449b28fb7afcc38f392c30a02b085a305ad9d397c9f0f1b2fadd394"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): library/std/src/sys/net/connection/socket/hermit.rs:161-176 | library/std/src/sys/net/connection/socket/solid.rs:229-244 | library/std/src/sys/net/connection/socket/unix.rs:326-344 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/net/connection/socket/hermit.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"a03451ad64a522836a1262569114b2680495d7d5ea4c2e0f3c9e7e6a7d0da342"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): src/tools/clippy/clippy_lints/src/non_std_lazy_statics.rs:261-286 | src/tools/clippy/clippy_utils/src/lib.rs:2124-2151 \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/tools/clippy/clippy_lints/src/non_std_lazy_statics.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"463916169368edfc0bf291a172adb4a7f9d4e62d9be2ee6c33e6fff704d13849"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): src/tools/rust-analyzer/crates/hir-ty/src/lower.rs:1720-1735 | src/tools/rust-analyzer/crates/hir-ty/src/lower.rs:1741-1756 \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/tools/rust-analyzer/crates/hir-ty/src/lower.rs"},"region":{"startLine":1720}}}],"partialFingerprints":{"codehealthFindingId/v1":"de6c645dcfe9baaa59d699874461316686f07a37447ea8c898f449f88308a381"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): compiler/rustc_hir_typeck/src/writeback.rs:451-465 | compiler/rustc_hir_typeck/src/writeback.rs:764-776 | compiler/rustc_hir_typeck/src/writeback.rs:778-790 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/writeback.rs"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cd0ba89103fecc6f6aceac571129b03e1b256d43b0b7bcd00f2fb0a987f1eff"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): compiler/rustc_middle/src/ty/generic_args.rs:780-808 | compiler/rustc_middle/src/ty/generic_args.rs:810-824 \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":"compiler/rustc_middle/src/ty/generic_args.rs"},"region":{"startLine":780}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9b97088a2b093740aeee8173af5235fe0a22f7433e3c4347601a2513fb896ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): compiler/rustc_parse_format/src/lib.rs:904-923 | compiler/rustc_parse_format/src/lib.rs:1015-1034 \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":"compiler/rustc_parse_format/src/lib.rs"},"region":{"startLine":904}}}],"partialFingerprints":{"codehealthFindingId/v1":"439c33f192ed41d72739422638aca6f73b9e04007ec54b23ddc22ba0419153c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): src/bootstrap/src/core/session.rs:1570-1585 | src/bootstrap/src/core/session.rs:1606-1623 \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/bootstrap/src/core/session.rs"},"region":{"startLine":1570}}}],"partialFingerprints":{"codehealthFindingId/v1":"81aa7311a873cfe9f59872c6e541293423bf919ce1857a70714a3be2f715dca1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): src/tools/rust-analyzer/crates/ide/src/inlay_hints.rs:725-738 | src/tools/rust-analyzer/crates/ide/src/inlay_hints.rs:740-753 \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/tools/rust-analyzer/crates/ide/src/inlay_hints.rs"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"b694f8205c31bc42a43a7ce0f9dce73308d8ac0dace6365f7554ac1cbfc652d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 13\u002B corresponding lines): src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:547-561 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:826-840 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1387-1400 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1637-1649 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"91957ac367aaff6fd8b69bda8ffca0f8c93de120bdde73aeb712d33467baf48f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): compiler/rustc_ast_pretty/src/pprust/state.rs:1276-1297 | compiler/rustc_hir_pretty/src/lib.rs:1962-1978 \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":"compiler/rustc_ast_pretty/src/pprust/state.rs"},"region":{"startLine":1276}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1792f1f790ad049ffb085b360b5164d271e1e6ec29a403091c9cbb2ee167b56"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): compiler/rustc_hir_typeck/src/upvar.rs:2381-2404 | src/tools/rust-analyzer/crates/hir-ty/src/infer/closure/analysis.rs:1354-1376 \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":"compiler/rustc_hir_typeck/src/upvar.rs"},"region":{"startLine":2381}}}],"partialFingerprints":{"codehealthFindingId/v1":"7877b976f297888a82b52907c901c702346f9af0a6c6297fcc91b1f654f2c2a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): library/stdarch/crates/core_arch/src/arm/neon.rs:64-74 | library/stdarch/crates/core_arch/src/arm/neon.rs:126-136 \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":"library/stdarch/crates/core_arch/src/arm/neon.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c256fe0315dad41a9ac39b667fbe98412e8f6c5d5b63145e5d792fe37cbd5f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): src/tools/rust-analyzer/crates/hir-ty/src/mir.rs:184-195 | src/tools/rust-analyzer/crates/hir-ty/src/mir.rs:200-211 \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/tools/rust-analyzer/crates/hir-ty/src/mir.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"027d29e2fdd88c907272e501e63cdfa71750ce92394d36f0e4363a418005b620"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): src/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_enum_is_method.rs:107-127 | src/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_enum_projection_method.rs:186-208 \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/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_enum_is_method.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"93cb7391c7e3982eb3ea43a36a0c28dd2d5653475da6767ac35ae29a676162a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (7 members, 12\u002B corresponding lines): src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:586-599 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:791-802 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:808-820 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1070-1081 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1654-1665 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1704-1717 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1748-1761 \u2014 These 7 members are one piece of code written 7 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 7 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b701f453ad6760254fa483a89c3b68e536eddf8f998dc2b0b00e1fd5de8229d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:778-789 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:920-931 \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/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs"},"region":{"startLine":778}}}],"partialFingerprints":{"codehealthFindingId/v1":"e27647fcdf91b46f3c63bba62691166164ee1f6889f0547013765a9fe9d01bf9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): src/tools/rust-analyzer/xtask/src/codegen/diagnostics_docs.rs:11-22 | src/tools/rust-analyzer/xtask/src/codegen/feature_docs.rs:11-21 \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/tools/rust-analyzer/xtask/src/codegen/diagnostics_docs.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"eec5db5781607ee8551cc436440b5a3b1d9cd8891d0670a14bd5343f3f6a4186"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): src/tools/rustfmt/src/modules/visitor.rs:44-72 | src/tools/rustfmt/src/modules/visitor.rs:104-131 \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/tools/rustfmt/src/modules/visitor.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"2824c395ba09671aaf4acee121503296cd5fbd846b9ccf3ea09c46e58d6b609f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): src/tools/rustfmt/src/vertical.rs:45-62 | src/tools/rustfmt/src/vertical.rs:83-99 \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/tools/rustfmt/src/vertical.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"55d29cce1758e26a774c6b38a90c4bbd4d11b5077cc00332929d6de0744b768f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): compiler/rustc_borrowck/src/lib.rs:1873-1897 | compiler/rustc_borrowck/src/polonius/legacy/loan_invalidations.rs:422-446 \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":"compiler/rustc_borrowck/src/lib.rs"},"region":{"startLine":1873}}}],"partialFingerprints":{"codehealthFindingId/v1":"982362f08c817d39d7c5e156e28f7faaa21647bb447edab338b30484ca6f79eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): compiler/rustc_codegen_gcc/src/intrinsic/mod.rs:1153-1161 | compiler/rustc_codegen_gcc/src/intrinsic/mod.rs:1169-1177 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_gcc/src/intrinsic/mod.rs"},"region":{"startLine":1153}}}],"partialFingerprints":{"codehealthFindingId/v1":"75b158b8e9fb1e8c9a6ba993f7db0e284d83efffa50c1191da69b551c79cae23"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): compiler/rustc_hir_typeck/src/upvar.rs:2321-2337 | src/tools/rust-analyzer/crates/hir-ty/src/infer/closure/analysis.rs:1300-1316 \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":"compiler/rustc_hir_typeck/src/upvar.rs"},"region":{"startLine":2321}}}],"partialFingerprints":{"codehealthFindingId/v1":"cce2e1ae1f961ba82cfbfb9740a03370b85457146512dbbed5ebd8097c920b32"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): compiler/rustc_index/src/interval.rs:149-169 | compiler/rustc_index/src/interval.rs:173-199 \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":"compiler/rustc_index/src/interval.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbb77117f0af9b4fd1bb560a5343694a56f5107f45fdb229a9ba32a4dd094db3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): compiler/rustc_middle/src/ty/inhabitedness/inhabited_predicate.rs:282-292 | compiler/rustc_middle/src/ty/inhabitedness/inhabited_predicate.rs:294-304 \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":"compiler/rustc_middle/src/ty/inhabitedness/inhabited_predicate.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"b55932e8bf22042a7bd9a502b76977fb1eb2bb5e2214596ebb1cacabf59e9574"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): compiler/rustc_type_ir/src/solve/mod.rs:949-968 | compiler/rustc_type_ir/src/solve/mod.rs:970-998 \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":"compiler/rustc_type_ir/src/solve/mod.rs"},"region":{"startLine":949}}}],"partialFingerprints":{"codehealthFindingId/v1":"16b51c60854d01d50d59dba1272af3ad58e69397fc40fcd2fd149eec2b97ed91"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): library/alloc/src/collections/vec_deque/mod.rs:340-361 | library/alloc/src/collections/vec_deque/mod.rs:365-390 \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":"library/alloc/src/collections/vec_deque/mod.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"86c72cf115cb2a763bcc106e0c9101d4b606e712269e4974b5b183b646222304"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 20\u002B corresponding lines): library/std/src/sys/fd/unix.rs:281-300 | library/std/src/sys/fd/unix.rs:303-327 | library/std/src/sys/fd/unix.rs:499-523 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 20 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":"library/std/src/sys/fd/unix.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebae81dc6a1c36ec0bff56ab239157b89b6a9b5757b31e48e61cae2beb59b1f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 9\u002B corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512fp16.rs:11258-11266 | library/stdarch/crates/core_arch/src/x86/avx512fp16.rs:11314-11322 | library/stdarch/crates/core_arch/src/x86/avx512fp16.rs:11369-11378 | library/stdarch/crates/core_arch/src/x86/avx512fp16.rs:11423-11432 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512fp16.rs"},"region":{"startLine":11258}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c6ef2c4fbe33fc0c34ec0ea870bee8a23ef6fe5e7e0e1d1e959a4dab76a7e22"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): src/tools/clippy/clippy_lints/src/operators/arithmetic_side_effects.rs:295-309 | src/tools/clippy/clippy_lints/src/operators/numeric_arithmetic.rs:70-87 \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/tools/clippy/clippy_lints/src/operators/arithmetic_side_effects.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0291d064ae87792e0f162e7a6bc2b391003caad99e332955822d7d9cff40860"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): src/tools/miri/src/shims/panic.rs:11-27 | src/tools/miri/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/tools/miri/src/shims/panic.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eaf3e3584119941cc2152c07422d3f7b098b6b56c0a175b471a3a47b75d7457"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 12\u002B corresponding lines): src/tools/rust-analyzer/crates/rust-analyzer/src/handlers/request.rs:447-462 | src/tools/rust-analyzer/crates/rust-analyzer/src/handlers/request.rs:841-853 | src/tools/rust-analyzer/crates/rust-analyzer/src/handlers/request.rs:901-913 | src/tools/rust-analyzer/crates/rust-analyzer/src/handlers/request.rs:918-929 \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/tools/rust-analyzer/crates/rust-analyzer/src/handlers/request.rs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e618b5630a396fa63051a09811aa4cb84ec0b314d0b62d34fa9a2878b0e9780"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): compiler/rustc_hir_typeck/src/expr_use_visitor.rs:1832-1846 | src/tools/rust-analyzer/crates/hir-ty/src/infer/closure/analysis/expr_use_visitor.rs:1712-1726 \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":"compiler/rustc_hir_typeck/src/expr_use_visitor.rs"},"region":{"startLine":1832}}}],"partialFingerprints":{"codehealthFindingId/v1":"a17e41113f87f9278b13b347ef331963c7b8d613807269749fbfd0c6a265a5c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): compiler/rustc_middle/src/ty/util.rs:1105-1114 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/ty.rs:231-240 \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":"compiler/rustc_middle/src/ty/util.rs"},"region":{"startLine":1105}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e480aa2a3fbcb7bf35d677d3d05274648c729acaf7836b74785df2ef19a81a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): library/alloc/src/collections/btree/navigate.rs:470-485 | library/alloc/src/collections/btree/navigate.rs:504-519 \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":"library/alloc/src/collections/btree/navigate.rs"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"b199b38478b099434c9716af7f5f95f8fc5f61323acaab1b90101c46e6b0661c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): library/core/src/iter/adapters/enumerate.rs:203-218 | library/core/src/iter/adapters/enumerate.rs:224-239 \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":"library/core/src/iter/adapters/enumerate.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"51311ffab98ae9690f2718f250e96f551c45ce783c5109ea7142f77ed84310f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 14\u002B corresponding lines): library/core/src/slice/iter.rs:3033-3046 | library/core/src/slice/iter.rs:3079-3092 | library/core/src/slice/iter.rs:3141-3155 | library/core/src/slice/iter.rs:3174-3188 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/slice/iter.rs"},"region":{"startLine":3033}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b6754868bd71a962711a05a0f597d2685952aa7c85b1e8c569907d0e9fd5d7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): library/std/src/sys/stdio/windows.rs:402-427 | library/std/src/sys/stdio/windows.rs:429-466 \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":"library/std/src/sys/stdio/windows.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c7443f1e6deaa989623982ce79600857b93176fcf3a14a1048972b4a9271980"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx2.rs:963-971 | library/stdarch/crates/core_arch/src/x86/avx2.rs:1033-1041 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx2.rs"},"region":{"startLine":963}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5f1653d157fb243051fa7a3ac04e36de38aaa6c4c9bfd47f0f6d231b508bc08"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 9\u002B corresponding lines): library/stdarch/crates/core_arch/src/x86/ssse3.rs:171-179 | library/stdarch/crates/core_arch/src/x86/ssse3.rs:190-198 | library/stdarch/crates/core_arch/src/x86/ssse3.rs:228-236 | library/stdarch/crates/core_arch/src/x86/ssse3.rs:248-256 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/ssse3.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"be7a29e6e47fb144866568f058c4ccc9add6983a0848543502447ebeb7bc1dd1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): src/tools/compiletest/src/directives.rs:1176-1193 | src/tools/compiletest/src/directives.rs:1195-1217 \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/tools/compiletest/src/directives.rs"},"region":{"startLine":1176}}}],"partialFingerprints":{"codehealthFindingId/v1":"1574805fd9670e699b703c17130d18bf53214c2553bedfbf6ec5bdb0f46c1ce6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): compiler/rustc_attr_parsing/src/attributes/codegen_attrs.rs:135-151 | compiler/rustc_attr_parsing/src/attributes/link_attrs.rs:43-61 \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":"compiler/rustc_attr_parsing/src/attributes/codegen_attrs.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f16174317a760c087e1fb61f8a463179edc6539938a4bd5f5274c229007d88b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): compiler/rustc_codegen_gcc/src/consts.rs:250-263 | compiler/rustc_codegen_llvm/src/consts.rs:348-363 \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":"compiler/rustc_codegen_gcc/src/consts.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"10573031e84078a14b464d5f00d2727376be51d548559ee38c3831694f21f906"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): compiler/rustc_sanitizers/src/cfi/typeid/itanium_cxx_abi/transform.rs:759-769 | compiler/rustc_sanitizers/src/cfi/typeid/itanium_cxx_abi/transform.rs:784-794 \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":"compiler/rustc_sanitizers/src/cfi/typeid/itanium_cxx_abi/transform.rs"},"region":{"startLine":759}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbb98dd1971634a198521961dadf90bf8a09622126170eee61f0167173d70f41"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 14\u002B corresponding lines): library/core/src/fmt/float.rs:44-57 | library/core/src/fmt/float.rs:70-85 | library/core/src/fmt/float.rs:117-131 | library/core/src/fmt/float.rs:144-160 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/fmt/float.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"915356cfe4e3c02fff5db19957d2fd7c4a030792845d65243117aaae6d5039b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): library/core/src/iter/adapters/enumerate.rs:111-126 | library/core/src/iter/adapters/enumerate.rs:132-147 \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":"library/core/src/iter/adapters/enumerate.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"671aec38db2563cebcdee20ebef80a8d34c050db0c55aac9f37d7e76a9d19c10"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): library/core/src/iter/adapters/intersperse.rs:37-55 | library/core/src/iter/adapters/intersperse.rs:146-164 \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":"library/core/src/iter/adapters/intersperse.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"30e5db977941ea2519323b5c1d36735830c59352dbdfce5c75b2b14cd4593c2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): src/tools/clippy/clippy_lints/src/lifetimes.rs:720-742 | src/tools/clippy/clippy_lints/src/lifetimes.rs:744-763 \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/tools/clippy/clippy_lints/src/lifetimes.rs"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"d22a1b12c194c968b28bb92178f14078974854717d46d958377f3a42ecae380d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/tools/rust-analyzer/crates/span/src/map.rs:58-66 | src/tools/rust-analyzer/crates/span/src/map.rs:74-85 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/span/src/map.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ad4764260aae6392d0e3a907066257126e251a36e579453113877bd98af700b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): compiler/rustc_codegen_gcc/src/builder.rs:2302-2316 | compiler/rustc_codegen_gcc/src/builder.rs:2332-2346 \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":"compiler/rustc_codegen_gcc/src/builder.rs"},"region":{"startLine":2302}}}],"partialFingerprints":{"codehealthFindingId/v1":"526be6978f48195ca1febd663cdd5f591d0f246a1682624d3389071c65011fa2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): compiler/rustc_const_eval/src/interpret/memory.rs:1020-1032 | compiler/rustc_const_eval/src/interpret/memory.rs:1039-1052 \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":"compiler/rustc_const_eval/src/interpret/memory.rs"},"region":{"startLine":1020}}}],"partialFingerprints":{"codehealthFindingId/v1":"709f875f6b70c7699b85955505f3a3cc47873c93dfa21d2ba2527321516fa03b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): compiler/rustc_data_structures/src/profiling.rs:286-298 | compiler/rustc_data_structures/src/profiling.rs:328-358 | compiler/rustc_data_structures/src/profiling.rs:392-407 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_data_structures/src/profiling.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"7df561258f80e35ed93652afafbd905d587469888efabf9968220c77066476a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): compiler/rustc_infer/src/infer/region_constraints/mod.rs:811-825 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/region_constraints/mod.rs:566-580 \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":"compiler/rustc_infer/src/infer/region_constraints/mod.rs"},"region":{"startLine":811}}}],"partialFingerprints":{"codehealthFindingId/v1":"fffabf1b75a31424960e77c3a9c8418f727a0c33f4a67a7bfce6ee67a6f014d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): compiler/rustc_type_ir/src/fold.rs:592-609 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/fold.rs:100-120 \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":"compiler/rustc_type_ir/src/fold.rs"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5855f6dc80b8c1f7ae9bfa4a375729173780caea4e8e8f4cb48c21ca2af105c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): library/compiler-builtins/libm/src/math/acosh.rs:11-27 | library/compiler-builtins/libm/src/math/acoshf.rs:11-27 \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":"library/compiler-builtins/libm/src/math/acosh.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"d54148cb083466b81a28981edb548f37a00c3c096e6b842e93e13188598a176a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): library/core/src/iter/adapters/chain.rs:132-147 | library/core/src/iter/adapters/chain.rs:218-233 \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":"library/core/src/iter/adapters/chain.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"06975ad7411b5fd618212a63f837cc2351b4907efee876295ea7e6d2916a07aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): src/tools/compiletest/src/debuggers.rs:104-119 | src/tools/compiletest/src/debuggers.rs:125-140 \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/tools/compiletest/src/debuggers.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"14e41e53cabfb9e57c5faa172b2de0724927d843823d47bbdf12e131289205ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:472-482 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1518-1528 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:2357-2371 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"3559b26168d6970fb2ce0949f6668f1dbf8d838d9ac8516c9bf446b0041e78fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:2021-2031 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:2033-2043 \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/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs"},"region":{"startLine":2021}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac2ffc6967bf2939499bbd7679401336c7430c1a7c4d0f03ac1b5469d086b256"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): src/tools/rust-analyzer/lib/line-index/src/lib.rs:147-161 | src/tools/rust-analyzer/lib/line-index/src/lib.rs:164-178 \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/tools/rust-analyzer/lib/line-index/src/lib.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3a1992384ecf2d4ea1a2d646a27b2f14f03d98f318c67ce5919617012ad1035"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): compiler/rustc_builtin_macros/src/deriving/reborrow.rs:19-28 | compiler/rustc_builtin_macros/src/deriving/reborrow.rs:36-56 \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":"compiler/rustc_builtin_macros/src/deriving/reborrow.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"6be7a9581a9176b1c1f77bcda229252f30dfa6e8fa2b935f04fdcf6b8c59c085"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): library/compiler-builtins/compiler-builtins/src/mem/impls.rs:71-85 | library/compiler-builtins/compiler-builtins/src/mem/impls.rs:93-110 \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":"library/compiler-builtins/compiler-builtins/src/mem/impls.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c2958577e43d7d77ec746db1488a336831b3e70caa239ccdb18bcd87afd6903"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 17\u002B corresponding lines): library/core/src/iter/adapters/step_by.rs:307-324 | library/core/src/iter/adapters/step_by.rs:329-346 | library/core/src/iter/adapters/step_by.rs:371-387 | library/core/src/iter/adapters/step_by.rs:394-410 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 17 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/iter/adapters/step_by.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9fe77188bb5d0630d5fb5dab07e64ff268a261089095c67f6dcfa127f0e05c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512bw.rs:12308-12317 | library/stdarch/crates/core_arch/src/x86/avx512bw.rs:12326-12335 \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":"library/stdarch/crates/core_arch/src/x86/avx512bw.rs"},"region":{"startLine":12308}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f2e179ac6b2161283a0841d07490a239a9e8e695b1b07ff4c03a81cf8a518ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): src/tools/clippy/clippy_utils/src/ty/type_certainty/certainty.rs:46-53 | src/tools/clippy/clippy_utils/src/ty/type_certainty/certainty.rs:60-77 \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/tools/clippy/clippy_utils/src/ty/type_certainty/certainty.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e1c14a43b39a56dcc5974c43a552ada223e0af8ee92042fbd2868e084522438"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): src/tools/miri/src/concurrency/init_once.rs:90-114 | src/tools/miri/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/tools/miri/src/concurrency/init_once.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7d9cbb65f466cdf22bc9c7733dbc372add424f0dc29388bddce95123cd4f14d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): src/tools/rust-analyzer/crates/hir-def/src/visibility.rs:47-63 | src/tools/rust-analyzer/crates/hir-def/src/visibility.rs:70-93 \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/tools/rust-analyzer/crates/hir-def/src/visibility.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebf43bf85c82e299bb5b3503cb12e7c3be5686402ba7547ae622f7bcd935a6af"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): src/tools/rust-analyzer/crates/rust-analyzer/src/diagnostics.rs:91-102 | src/tools/rust-analyzer/crates/rust-analyzer/src/diagnostics.rs:131-147 \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/tools/rust-analyzer/crates/rust-analyzer/src/diagnostics.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9002cda876c064ddf52f8e249bc222df8b99a6958123803c61d0e11140d8c1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): compiler/rustc_ast_pretty/src/pprust/state/expr.rs:361-379 | compiler/rustc_hir_pretty/src/lib.rs:1460-1474 \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":"compiler/rustc_ast_pretty/src/pprust/state/expr.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a4df1bc85fadea6b60827fe59f9502fadb7cbe39653768eb64c358f451a3971"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): compiler/rustc_errors/src/lib.rs:599-612 | compiler/rustc_errors/src/lib.rs:622-638 \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":"compiler/rustc_errors/src/lib.rs"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"79b3a1b50292e7188f7e23f3eb833fc59216edda1fbaee2f855f57f97aa8ce39"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): compiler/rustc_hir_typeck/src/method/probe.rs:1699-1719 | src/tools/rust-analyzer/crates/hir-ty/src/method_resolution/probe.rs:1438-1456 \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":"compiler/rustc_hir_typeck/src/method/probe.rs"},"region":{"startLine":1699}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5b9f6bb73979d5e7ffd9b4f5b91f3f01f594820054ebe9b5621b99fad4d36cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 24\u002B corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512bw.rs:10728-10751 | library/stdarch/crates/core_arch/src/x86/avx512bw.rs:10761-10784 | library/stdarch/crates/core_arch/src/x86/avx512bw.rs:10794-10817 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 24 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512bw.rs"},"region":{"startLine":10728}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2058a7f6c4631cebea8792875cdc73c51d1af51def88e99f6c7fa2cbbb80f6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): src/tools/rust-analyzer/crates/hir-ty/src/infer/unify.rs:369-385 | src/tools/rust-analyzer/crates/hir-ty/src/infer/unify.rs:391-409 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/infer/unify.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"727b37096a8eb5316b416891d855c5fe86fc084a871b7d57b0c5285ea54743f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): src/tools/rust-analyzer/crates/tt/src/storage.rs:173-184 | src/tools/rust-analyzer/crates/tt/src/storage.rs:706-718 \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/tools/rust-analyzer/crates/tt/src/storage.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"78b66cb8e10d6c1428b9ac50cbf863d8c1733fe594c80331659fd4646693d8ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): src/etc/htmldocck.py:242-253 | src/etc/htmldocck.py:256-272 \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/etc/htmldocck.py"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"062365da3360a7edf4803dced89f759dccd3cf03911d8596f50b1e60d9c3aa95"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): compiler/rustc_infer/src/infer/at.rs:143-165 | compiler/rustc_infer/src/infer/at.rs:181-196 | compiler/rustc_infer/src/infer/at.rs:334-356 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_infer/src/infer/at.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"525e58dbc25fe65c01c67676a087380dec4d7f8a239184435457498bab786c40"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): compiler/rustc_middle/src/ty/pattern.rs:35-49 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/interner.rs:785-799 \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":"compiler/rustc_middle/src/ty/pattern.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb3ba69b94d533253a8f74ce0d2cc0fcf5814b47180094b5ce191dd27e167faa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): compiler/rustc_mir_build/src/thir/print.rs:203-212 | compiler/rustc_mir_build/src/thir/print.rs:689-698 \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":"compiler/rustc_mir_build/src/thir/print.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"bed70d1c7c16a64c363a449f6b103a58cfb5bdd7ce6a7b4d8c6ec3147340e801"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): library/compiler-builtins/libm/src/math/support/float_traits.rs:255-274 | library/compiler-builtins/libm/src/math/support/float_traits.rs:277-296 \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":"library/compiler-builtins/libm/src/math/support/float_traits.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe05294dcf5974e0e7b11fae73bfe31dee3440815c73f07a27d8e01ab95cc8e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): library/core/src/slice/iter.rs:725-743 | library/core/src/slice/iter.rs:763-782 \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":"library/core/src/slice/iter.rs"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"42cb82f6ddcbe00811ba016ad29fcc28cdfa1ea57350121795ea12e4593fb489"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): library/std/src/sync/mpmc/zero.rs:142-159 | library/std/src/sync/mpmc/zero.rs:218-232 \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":"library/std/src/sync/mpmc/zero.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"0501a335a3ad84a1a226e46d5f173420c38ddf49e4011b40b18de5e75ad3e59b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): library/std/src/sys/sync/thread_parking/windows7.rs:106-129 | library/std/src/sys/sync/thread_parking/windows7.rs:134-159 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/sync/thread_parking/windows7.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"531caae690ff8d69197dd79fef29f91fbebaa2df61ceb0bef79cfc76a605724b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): src/tools/clippy/clippy_utils/src/lib.rs:271-283 | src/tools/clippy/clippy_utils/src/lib.rs:286-298 \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/tools/clippy/clippy_utils/src/lib.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"117056cd5857eafd426f18c25a2164ecce09083daa04860ae962c5335b680dff"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): src/tools/miri/src/shims/unix/thread.rs:45-66 | src/tools/miri/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/tools/miri/src/shims/unix/thread.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"75dbb72f5787b12a1bb356c01f4a6131e0a0c5fb4232c65a75ae898db95aa40f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): src/tools/rust-analyzer/crates/ide/src/inlay_hints/extern_block.rs:39-49 | src/tools/rust-analyzer/crates/ide/src/inlay_hints/extern_block.rs:57-67 \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/tools/rust-analyzer/crates/ide/src/inlay_hints/extern_block.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ac23b755f286928fe2c1a7c4cb7b0247232ca6cdaa8f9401cead19d01441a0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): compiler/rustc_session/src/options.rs:1355-1380 | compiler/rustc_structures/src/sanitizer_set.rs:132-150 \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":"compiler/rustc_session/src/options.rs"},"region":{"startLine":1355}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f9d94b93981d65a965f4be10b5ca7cfe641bb3018a5eef56a8ff74ed3b83604"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): compiler/rustc_target/src/callconv/csky.rs:11-30 | compiler/rustc_target/src/callconv/csky.rs:35-57 \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":"compiler/rustc_target/src/callconv/csky.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"3188eccb0437eec43fc352c9fbb874f9c2f0d5baed54c293061822d79dc6506a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): library/alloc/src/collections/btree/navigate.rs:225-236 | library/alloc/src/collections/btree/navigate.rs:240-251 \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":"library/alloc/src/collections/btree/navigate.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd050d6b486dacd8f341a79877d0b8de8e5663ed3b17fafeafbf45e303f2dae1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): library/core/src/slice/raw.rs:124-141 | library/core/src/slice/raw.rs:179-196 \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":"library/core/src/slice/raw.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"c577ec44cccbe08aeb2fd4b3dce4e564e6e73668fb92c8857f9f12536b276d5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): library/stdarch/crates/core_arch/src/x86/avx2.rs:3359-3370 | library/stdarch/crates/core_arch/src/x86/avx2.rs:3415-3426 | library/stdarch/crates/core_arch/src/x86/avx512bw.rs:8508-8521 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx2.rs"},"region":{"startLine":3359}}}],"partialFingerprints":{"codehealthFindingId/v1":"48087ebe3b702fb8f737d306396c03dd91590406a95afa72aeef1a516b9a9bb6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): src/tools/compiletest/src/read2.rs:303-318 | src/tools/rust-analyzer/crates/stdx/src/process.rs:222-235 \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/tools/compiletest/src/read2.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb59ceaea88fa1de08c28b3a91d8e392d9a61c6a1b0f9ebeff0b65986a250257"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): src/tools/miri/src/shims/unix/sync.rs:222-246 | src/tools/miri/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/tools/miri/src/shims/unix/sync.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed712e0cdfc871e122aa3ea591bfd3f6b303c1a30770c7358aea9e4b50fcbcb8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): src/tools/rust-analyzer/crates/ide-assists/src/handlers/introduce_named_lifetime.rs:132-146 | src/tools/rust-analyzer/crates/ide-assists/src/handlers/introduce_named_lifetime.rs:191-205 \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/tools/rust-analyzer/crates/ide-assists/src/handlers/introduce_named_lifetime.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ddd817a8410279e334649a132f31e72e126e08c7145586c034fb1d400cb7d75"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/tools/rust-analyzer/crates/tt/src/storage.rs:120-129 | src/tools/rust-analyzer/crates/tt/src/storage.rs:161-170 \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/tools/rust-analyzer/crates/tt/src/storage.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"f48bfb3a289b6ea851a9d167303b49b16402284117c50659f11a1bfe9a801f1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): compiler/rustc_attr_parsing/src/attributes/codegen_attrs.rs:163-179 | compiler/rustc_attr_parsing/src/attributes/codegen_attrs.rs:191-207 \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":"compiler/rustc_attr_parsing/src/attributes/codegen_attrs.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfe66b4858bc824e557ad76f89e81358036bd5833582cfd12f9cd21a8558290a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): compiler/rustc_borrowck/src/diagnostics/bound_region_errors.rs:215-228 | compiler/rustc_borrowck/src/diagnostics/bound_region_errors.rs:266-288 | compiler/rustc_borrowck/src/diagnostics/bound_region_errors.rs:313-326 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/diagnostics/bound_region_errors.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ea24fbeebafdf24e1e47d485ddce22b34a74de5a6a8d068074e1f9378512b7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): compiler/rustc_infer/src/infer/relate/lattice.rs:231-247 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/relate/lattice.rs:202-217 \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":"compiler/rustc_infer/src/infer/relate/lattice.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab0068bc196e3d33fb4c5f912ca5d38feac17b92f8fb0c8760c2d5a34a3d8e3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): compiler/rustc_span/src/hygiene.rs:225-236 | compiler/rustc_span/src/hygiene.rs:249-261 \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":"compiler/rustc_span/src/hygiene.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c30e7ccc944dc27b410f7901423707e1995b9e3e74fa9fb60ba990dca9cff04"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): library/compiler-builtins/compiler-builtins/src/sync/arm_linux.rs:105-120 | library/compiler-builtins/compiler-builtins/src/sync/arm_linux.rs:123-142 \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":"library/compiler-builtins/compiler-builtins/src/sync/arm_linux.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"35fe68afe70408c7926ad0539d063d1e44ea2b2831627fd8542c8ed925d99784"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): library/core/src/str/iter.rs:1513-1528 | library/core/src/wtf8.rs:582-597 \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":"library/core/src/str/iter.rs"},"region":{"startLine":1513}}}],"partialFingerprints":{"codehealthFindingId/v1":"16ec5308d562301193afd3f12815bf287c820bf73acde5a34285b393d4017902"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): library/std/src/sync/mpmc/array.rs:196-212 | library/std/src/sync/mpmc/array.rs:288-306 \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":"library/std/src/sync/mpmc/array.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"933fe5405fa80fe8737dea471a3f07ad1ab7f8142fbbe8e1ed1a08755c95a6bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): library/std/src/sys/fs/uefi.rs:700-711 | library/std/src/sys/fs/uefi.rs:739-756 \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":"library/std/src/sys/fs/uefi.rs"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"def71d7196ed2724444408a721ddc29a31e7a3bbe5aca8a9786bf9824cd9374a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): library/std/src/sys/stdio/uefi.rs:23-37 | library/std/src/sys/stdio/windows.rs:39-53 \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":"library/std/src/sys/stdio/uefi.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a39cc957268847dfd7ef0951604f9a802b1e29b8a7e32a2fd28d53369eb027c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): src/tools/rust-analyzer/crates/hir-ty/src/mir/eval.rs:2041-2056 | src/tools/rust-analyzer/crates/hir-ty/src/mir/eval.rs:2058-2070 \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/tools/rust-analyzer/crates/hir-ty/src/mir/eval.rs"},"region":{"startLine":2041}}}],"partialFingerprints":{"codehealthFindingId/v1":"cad1c8ab654cdc03f9ecd1011b697a76273cbfc14e94fcb3b355135a7371bbc3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): src/tools/rust-analyzer/crates/hir-ty/src/next_solver/interner.rs:1185-1197 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/interner.rs:1199-1212 \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/tools/rust-analyzer/crates/hir-ty/src/next_solver/interner.rs"},"region":{"startLine":1185}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c3bea1b67bacee5c606447f278eb1115eb01d40cb60a05e21b84fe38a6c0c1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): src/tools/rust-analyzer/crates/syntax/src/ast/make.rs:245-255 | src/tools/rust-analyzer/crates/syntax/src/ast/make.rs:262-272 \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/tools/rust-analyzer/crates/syntax/src/ast/make.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d6e75ba335d500879d5b0c96f4972462ba44cd652e5c057c60327184e411fa7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): src/tools/rust-analyzer/crates/tt/src/iter.rs:173-186 | src/tools/rust-analyzer/crates/tt/src/iter.rs:250-266 \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/tools/rust-analyzer/crates/tt/src/iter.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea6123bdee56ce2102fbe7241d96e462b49ded9d23cfc32025b37c2767a1afcb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): compiler/rustc_codegen_cranelift/build_system/rustc_info.rs:24-35 | compiler/rustc_codegen_cranelift/build_system/rustc_info.rs:37-48 | compiler/rustc_codegen_cranelift/build_system/rustc_info.rs:50-61 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/build_system/rustc_info.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"931a24fb426cce5d8c0867859434ffc76c1c66ab1293af40ed06014b8492f569"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): compiler/rustc_const_eval/src/check_consts/check.rs:701-720 | compiler/rustc_mir_transform/src/coroutine/mod.rs:1322-1340 \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":"compiler/rustc_const_eval/src/check_consts/check.rs"},"region":{"startLine":701}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b25c5e7578fa701d8fc6e2f81a4592f03d0f368d43efc2a41a15956797468d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): compiler/rustc_infer/src/infer/snapshot/fudge.rs:235-247 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/snapshot/fudge.rs:228-240 \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":"compiler/rustc_infer/src/infer/snapshot/fudge.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"039cb9f47617eac6a5c18e9c07eb413d3e510ce8905c2b0f5b9e6ba57c5df89b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): compiler/rustc_middle/src/mir/interpret/mod.rs:584-600 | compiler/rustc_public/src/mir/alloc.rs:55-67 | compiler/rustc_public/src/mir/alloc.rs:70-82 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/mir/interpret/mod.rs"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ff4ff2ca512017f7d1c0a5fd9499c1088b80b9607262f4bc0bb433d4225aea1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): compiler/rustc_middle/src/ty/sty.rs:1523-1536 | compiler/rustc_middle/src/ty/sty.rs:1541-1558 \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":"compiler/rustc_middle/src/ty/sty.rs"},"region":{"startLine":1523}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b0204cff734eab6a8bb2df3e57781ead347e542f9cc00d430bebdad4f433a07"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): compiler/rustc_ty_utils/src/needs_drop.rs:20-39 | compiler/rustc_ty_utils/src/needs_drop.rs:44-63 \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":"compiler/rustc_ty_utils/src/needs_drop.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"c71fe32514cb42129b3074ee221fb20f4967f8b636600399d4bfb44a307e931d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): library/alloc/src/borrow.rs:496-507 | library/alloc/src/borrow.rs:513-524 \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":"library/alloc/src/borrow.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2436f6314c96fae868a4a5c91f2e215fd9bc31980e5222d96201c389155b9a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): library/std/src/sys/fs/uefi.rs:656-676 | library/std/src/sys/fs/uefi.rs:683-698 \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":"library/std/src/sys/fs/uefi.rs"},"region":{"startLine":656}}}],"partialFingerprints":{"codehealthFindingId/v1":"a532ebb7cc986952ef741654904f899b6da3fb3217b9ddae6d197827803740b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): src/tools/clippy/clippy_lints/src/semicolon_block.rs:83-117 | src/tools/clippy/clippy_lints/src/semicolon_block.rs:119-152 \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":"src/tools/clippy/clippy_lints/src/semicolon_block.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a89969b05a9e24d12282925ea3a5faa580f1f452ec75118d1eb9e648f2cac1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 17\u002B corresponding lines): src/tools/tidy/src/extra_checks/rustdoc_js.rs:52-68 | src/tools/tidy/src/extra_checks/rustdoc_js.rs:89-105 | src/tools/tidy/src/extra_checks/rustdoc_js.rs:107-123 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 17 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/tidy/src/extra_checks/rustdoc_js.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"b942041b9509beb6fb469137981b69e3393787e0dd20a91b4736a5fab2ebc2dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): compiler/rustc_codegen_cranelift/src/pretty_clif.rs:124-137 | compiler/rustc_codegen_cranelift/src/pretty_clif.rs:143-156 \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":"compiler/rustc_codegen_cranelift/src/pretty_clif.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"237face43a0d994fc90de83aa979c91c5e0aabe9c1ee22611137814e7d09a7e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): compiler/rustc_codegen_llvm/src/builder.rs:1141-1165 | compiler/rustc_codegen_llvm/src/builder.rs:1175-1190 \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":"compiler/rustc_codegen_llvm/src/builder.rs"},"region":{"startLine":1141}}}],"partialFingerprints":{"codehealthFindingId/v1":"b82ce8a46182892ad160dc375025e0ed295a7eb7b82e44d910f9a58e9ec3ee0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): compiler/rustc_hir/src/hir.rs:3855-3874 | compiler/rustc_type_ir/src/ty_kind.rs:990-1010 \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":"compiler/rustc_hir/src/hir.rs"},"region":{"startLine":3855}}}],"partialFingerprints":{"codehealthFindingId/v1":"c85f08420591612b77ba72849f77abca232a4aa829aad1ce7cfa8e6c8c947080"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): compiler/rustc_hir_typeck/src/expr_use_visitor.rs:1165-1182 | src/tools/rust-analyzer/crates/hir-ty/src/infer/closure/analysis/expr_use_visitor.rs:1192-1209 \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":"compiler/rustc_hir_typeck/src/expr_use_visitor.rs"},"region":{"startLine":1165}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7c3ee41fd7e33e112d91b7f0ede6c0ce9edb29e3fb4e3f7e1d1bfe3bd0a4797"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): compiler/rustc_lint/src/late.rs:286-296 | compiler/rustc_lint/src/late.rs:298-309 \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":"compiler/rustc_lint/src/late.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"da01e20b30bab0aa61b4427c3e3f67f35f526f4edca630d94191a864a78aa77d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): compiler/rustc_middle/src/traits/solve.rs:65-85 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/opaques.rs:104-121 \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":"compiler/rustc_middle/src/traits/solve.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0338b302d3a292bf5cf22e1c6897a62d101869e7f6b7c6e9a3b3d2250f4487f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): compiler/rustc_middle/src/ty/generics.rs:458-466 | compiler/rustc_middle/src/ty/generics.rs:478-484 \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":"compiler/rustc_middle/src/ty/generics.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebdf7c54bc389c51a95e9797c563dcf561a6ce8f60f9a27bae609c1f54ea5284"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): compiler/rustc_mir_dataflow/src/impls/precise_liveness.rs:185-201 | compiler/rustc_mir_dataflow/src/impls/precise_liveness.rs:208-231 \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":"compiler/rustc_mir_dataflow/src/impls/precise_liveness.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e650b316375778a49308289065874d2fd9300de08c4c6a0b20de97a3bb63ce3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 13\u002B corresponding lines): library/core/src/slice/iter.rs:1600-1612 | library/core/src/slice/iter.rs:1951-1963 | library/core/src/slice/iter.rs:2414-2427 | library/core/src/slice/iter.rs:2765-2780 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/slice/iter.rs"},"region":{"startLine":1600}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bf7f83a93344eea5b3b5d6b6888cb0c0df9d58a2bfa7d1be96628a0175b94b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 12\u002B corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512f.rs:42616-42627 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:42642-42653 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:42668-42679 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:42767-42779 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:42795-42807 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:42823-42835 \u2014 These 6 members are one piece of code written 6 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 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":42616}}}],"partialFingerprints":{"codehealthFindingId/v1":"72bf3b2bda23c8642cecebca0a5919d1677e423ce697ea02a87b782b5eaec8a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 12\u002B corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512f.rs:42689-42700 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:42715-42726 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:42741-42752 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:42850-42862 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:42878-42890 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:42906-42918 \u2014 These 6 members are one piece of code written 6 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 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":42689}}}],"partialFingerprints":{"codehealthFindingId/v1":"33a432de3f42304bab5b401668c5436e5d23e255f997cfcc32e7df5ae2e80057"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): src/tools/clippy/clippy_lints/src/casts/fn_to_numeric_cast.rs:10-32 | src/tools/clippy/clippy_lints/src/casts/fn_to_numeric_cast_with_truncation.rs:10-31 \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/tools/clippy/clippy_lints/src/casts/fn_to_numeric_cast.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"0168bbd78c771b078fa5e31f204356ee314234cb99808d15ddf3a5838d50e673"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): src/tools/miri/src/shims/unix/fs.rs:1670-1684 | src/tools/miri/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/tools/miri/src/shims/unix/fs.rs"},"region":{"startLine":1670}}}],"partialFingerprints":{"codehealthFindingId/v1":"e27b0dedd41c6840dbb9053d08846a275a9d3026362b8711b950198c509fc66a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): src/tools/miri/src/shims/unix/sync.rs:423-436 | src/tools/miri/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/tools/miri/src/shims/unix/sync.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"24d8040c28c2fa2bcf966e339eef2f7a63a939d3a3e79e1b7be76a666fd227fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): src/tools/rust-analyzer/crates/hir-ty/src/infer/place_op.rs:194-216 | src/tools/rust-analyzer/crates/hir-ty/src/infer/place_op.rs:224-249 \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/tools/rust-analyzer/crates/hir-ty/src/infer/place_op.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"30616c42c73e97bac1213cac2411c0ee76747f7f0922a80b04693344635b5041"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): compiler/rustc_builtin_macros/src/proc_macro_harness.rs:129-145 | compiler/rustc_builtin_macros/src/proc_macro_harness.rs:147-163 \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":"compiler/rustc_builtin_macros/src/proc_macro_harness.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"9287ea9b0c5b21737cd49ee9a6c970cc15184921f3b4a4b2e746fbd4e85e68bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): compiler/rustc_infer/src/infer/region_constraints/mod.rs:889-897 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/region_constraints/mod.rs:643-651 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_infer/src/infer/region_constraints/mod.rs"},"region":{"startLine":889}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c1fe59cc8ee9af8cab704429527513bf320f0b8c5c39f345e2db2eed4fe3b9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): compiler/rustc_middle/src/ty/consts/valtree.rs:113-121 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/consts/valtree.rs:54-63 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/ty/consts/valtree.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"5730c8084aaafd954e25bd0775074c4fc8a76614ec8ca7b60ccbeda4e97a281d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): compiler/rustc_type_ir/src/relate.rs:308-320 | compiler/rustc_type_ir/src/relate.rs:328-340 \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":"compiler/rustc_type_ir/src/relate.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"776f66d7535ee51d45a955a9b7eb85c7ce093e48164371d57fbf19d6b60587a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): library/alloc/src/collections/linked_list.rs:1807-1830 | library/alloc/src/collections/linked_list.rs:1837-1857 \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":"library/alloc/src/collections/linked_list.rs"},"region":{"startLine":1807}}}],"partialFingerprints":{"codehealthFindingId/v1":"784b54933aed3adaaf7a0669ae381cccdaedb5e83ad8864b6d9638d31d5e3c79"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): library/alloc/src/rcs/arc.rs:4211-4225 | library/alloc/src/rcs/rc.rs:3176-3190 \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":"library/alloc/src/rcs/arc.rs"},"region":{"startLine":4211}}}],"partialFingerprints":{"codehealthFindingId/v1":"e74f15f4a41aeb84808d89706a716c06f22fbdf1154a506e1b39db1eb3c03acc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): library/compiler-builtins/builtins-test/src/mem.rs:151-162 | library/compiler-builtins/builtins-test/src/mem.rs:164-175 \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":"library/compiler-builtins/builtins-test/src/mem.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfc82fd9a5cdd36e7051d6faf301be4084def49f5ee3a8ad4b8c7bb735ddb510"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): library/compiler-builtins/compiler-builtins/src/float/conv.rs:80-92 | library/compiler-builtins/compiler-builtins/src/float/conv.rs:136-147 | library/compiler-builtins/compiler-builtins/src/float/conv.rs:195-206 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/compiler-builtins/compiler-builtins/src/float/conv.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4a43fe0f2cdd037f06f06da9fa00378d3de6217249d647004d04e2f97b99e2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 17\u002B corresponding lines): library/compiler-builtins/libm/src/math/arch/i586/rounding.rs:1-26 | library/compiler-builtins/libm/src/math/arch/i586/rounding.rs:28-53 | library/compiler-builtins/libm/src/math/arch/i586/rounding.rs:57-73 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 17 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/compiler-builtins/libm/src/math/arch/i586/rounding.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c693ad12d33bea2d2ce9ac1c0397a38245d7326f1b813ee97f6eea698f5ea9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): library/core/src/slice/iter.rs:1530-1542 | library/core/src/slice/iter.rs:2363-2376 \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":"library/core/src/slice/iter.rs"},"region":{"startLine":1530}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5be463d4c3f291b2679787a06f73b3a02193e4b1c7d703cf7fc86c0be33d9c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): library/std/src/sys/thread_local/guard/aix.rs:8-30 | library/std/src/sys/thread_local/guard/apple.rs:9-32 \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":"library/std/src/sys/thread_local/guard/aix.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7fcffe353a996a1c59af07c60fc571d0983e0b2de5ca6cc84e649159e9f8936"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): library/stdarch/crates/stdarch-gen-arm/src/matching.rs:76-89 | library/stdarch/crates/stdarch-gen-arm/src/matching.rs:130-143 \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":"library/stdarch/crates/stdarch-gen-arm/src/matching.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"99e118ec795630bd32386c63efcde8889b96ce0a3f1a59428865b91922d0b368"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): library/stdarch/crates/stdarch-gen-hexagon/src/hvx.rs:1609-1619 | library/stdarch/crates/stdarch-gen-hexagon/src/scalar.rs:630-640 \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":"library/stdarch/crates/stdarch-gen-hexagon/src/hvx.rs"},"region":{"startLine":1609}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6f91fba1eb89dc18fe3b98e7805f968a25dc13d862f024bb618e1ef31dd8030"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): src/tools/clippy/clippy_lints/src/bit_width.rs:146-160 | src/tools/clippy/clippy_lints/src/bit_width.rs:162-184 \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/tools/clippy/clippy_lints/src/bit_width.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"d20d586eea60a2fd1b9fddf79e0f8e13ca563ca2a5425d3ca37bd1ab7d610b83"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): src/tools/miri/src/shims/windows/sync.rs:265-280 | src/tools/miri/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/tools/miri/src/shims/windows/sync.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc9d6a3f8bc446bc2272ac034c0d1a3c14706bfa8b54010e8fc13509c08337a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): compiler/rustc_codegen_gcc/src/intrinsic/mod.rs:1481-1492 | compiler/rustc_codegen_llvm/src/intrinsic.rs:1677-1690 \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":"compiler/rustc_codegen_gcc/src/intrinsic/mod.rs"},"region":{"startLine":1481}}}],"partialFingerprints":{"codehealthFindingId/v1":"946d0b0943ecb478294f7ea909e7dbeb6786ad24a2f1ca4a0531b70c8c0fa9b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 24\u002B corresponding lines): compiler/rustc_middle/src/ty/util.rs:1345-1368 | compiler/rustc_middle/src/ty/util.rs:1381-1405 | compiler/rustc_middle/src/ty/util.rs:1416-1447 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 24 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/ty/util.rs"},"region":{"startLine":1345}}}],"partialFingerprints":{"codehealthFindingId/v1":"300b9811798c1a468767ca4d7eef968d07252c660b175c256b696086daf6685b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): compiler/rustc_type_ir/src/binder.rs:775-785 | compiler/rustc_type_ir/src/binder.rs:812-822 \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":"compiler/rustc_type_ir/src/binder.rs"},"region":{"startLine":775}}}],"partialFingerprints":{"codehealthFindingId/v1":"348299fd672251ac32a5b49d28c6d6573f50933d5c12007c4ad6893497f7fc03"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): library/alloc/src/io/buffered/bufwriter.rs:393-421 | library/alloc/src/io/buffered/bufwriter.rs:430-463 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/alloc/src/io/buffered/bufwriter.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"70a612242be2521c4a3128a453100d25734dfd93aa137038a61de03085e447c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): library/compiler-builtins/libm/src/math/sqrt.rs:19-33 | library/compiler-builtins/libm/src/math/sqrt.rs:37-51 \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":"library/compiler-builtins/libm/src/math/sqrt.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cdfec086faf8e9515d6bc7d8c2053c36c81bd5cc09810c38e514eb488ec324f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): library/std_detect/src/detect/os/freebsd/auxvec.rs:48-63 | library/std_detect/src/detect/os/openbsd/auxvec.rs:44-54 \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":"library/std_detect/src/detect/os/freebsd/auxvec.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed4605d90b8d46a26eb2d2c20c76509eab2b0036fb81a11c0fbe0bc16a45dad2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): src/tools/clippy/clippy_dev/src/utils.rs:623-633 | src/tools/clippy/clippy_dev/src/utils.rs:636-646 \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/tools/clippy/clippy_dev/src/utils.rs"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fdbc645cc210c91558a17a3281cabab2583c7075ec4b9cfb5dc76424066e184"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): src/tools/miri/src/shims/files.rs:493-509 | src/tools/miri/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/tools/miri/src/shims/files.rs"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"7678439fd1be0a083f06042a88e3c12d9fef3ad910deb5f0b3680dfbc3c79c58"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): src/tools/rust-analyzer/crates/cfg/src/dnf.rs:126-142 | src/tools/rust-analyzer/crates/cfg/src/dnf.rs:166-182 \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/tools/rust-analyzer/crates/cfg/src/dnf.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f7d474d0480f13e276d15ee6017599ef7f4f2b9da81fa5085ca62232dc39ea9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): src/tools/rust-analyzer/crates/hir-ty/src/infer/closure/analysis.rs:1227-1239 | src/tools/rust-analyzer/crates/hir-ty/src/infer/closure/analysis.rs:1242-1254 \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/tools/rust-analyzer/crates/hir-ty/src/infer/closure/analysis.rs"},"region":{"startLine":1227}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d5a71f5cd647fdbe8bf199fda028ed81eae12defb597464e348e35d66dc7659"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/tools/rust-analyzer/crates/hir/src/has_source.rs:179-188 | src/tools/rust-analyzer/crates/hir/src/has_source.rs:240-249 \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/tools/rust-analyzer/crates/hir/src/has_source.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa39694d4aa23323eb6cfe7923e1d6a3b2824741d1e2a23ec368b50a599f88ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): src/tools/rust-analyzer/crates/syntax/src/validation.rs:326-340 | src/tools/rust-analyzer/crates/syntax/src/validation.rs:342-356 | src/tools/rust-analyzer/crates/syntax/src/validation.rs:358-372 \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/tools/rust-analyzer/crates/syntax/src/validation.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"427730c48b8d4fc683199651781dd9ba94967f804f878aa0be4f775aaf807518"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): compiler/rustc_macros/src/serialize.rs:8-17 | compiler/rustc_macros/src/serialize.rs:131-140 \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":"compiler/rustc_macros/src/serialize.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"03b165059eb832fbb5ce97b562e2e9e203df29811d0726f825e03ce1f6e8dd54"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): compiler/rustc_metadata/src/rmeta/encoder.rs:480-491 | compiler/rustc_metadata/src/rmeta/encoder.rs:503-514 \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":"compiler/rustc_metadata/src/rmeta/encoder.rs"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"5403f009c96a1e6be0378980e18ba9140e5d00f69c270c779e44816630c98084"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): compiler/rustc_metadata/src/rmeta/encoder.rs:520-541 | compiler/rustc_middle/src/query/on_disk_cache.rs:829-850 | compiler/rustc_middle/src/query/on_disk_cache.rs:929-943 \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":"compiler/rustc_metadata/src/rmeta/encoder.rs"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"732fea38f5ec9aad7bf0a6cf422a7997a00d929ea487cb725eeb5aabf0730b0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): compiler/rustc_mir_dataflow/src/impls/initialized.rs:721-733 | compiler/rustc_mir_dataflow/src/impls/initialized.rs:740-753 \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":"compiler/rustc_mir_dataflow/src/impls/initialized.rs"},"region":{"startLine":721}}}],"partialFingerprints":{"codehealthFindingId/v1":"237b0a1bbdda568b666fb45b9a4140453940843f744a8dbd4caed908ba1de5ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): compiler/rustc_mir_dataflow/src/value_analysis.rs:860-878 | compiler/rustc_mir_dataflow/src/value_analysis.rs:887-903 \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":"compiler/rustc_mir_dataflow/src/value_analysis.rs"},"region":{"startLine":860}}}],"partialFingerprints":{"codehealthFindingId/v1":"13bf7fb13488bea1244763af459f9a960eead2bdb96637f704027c6b1558ae16"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): compiler/rustc_type_ir/src/infer_ctxt.rs:285-304 | compiler/rustc_type_ir/src/infer_ctxt.rs:351-367 \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":"compiler/rustc_type_ir/src/infer_ctxt.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"2193a1d53b78e32d81ecbec2933acab09bce4b9982f0fec2bc95719fa3a7c406"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): src/tools/rust-analyzer/crates/ide-assists/src/handlers/merge_imports.rs:90-108 | src/tools/rust-analyzer/crates/ide-assists/src/handlers/merge_imports.rs:114-128 \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/tools/rust-analyzer/crates/ide-assists/src/handlers/merge_imports.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"2edc8176fc2b679c43094a199df33aa17590c880ab3306120f8189a35fee65fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/tools/rustfmt/src/closures.rs:464-474 | src/tools/rustfmt/src/expr.rs:1647-1656 \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/tools/rustfmt/src/closures.rs"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1eed48b162a56954c4366167eec64ce77dd1f5b99ce75ddedba70fc5afb598c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): compiler/rustc_const_eval/src/interpret/operator.rs:32-49 | compiler/rustc_const_eval/src/interpret/operator.rs:51-67 \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":"compiler/rustc_const_eval/src/interpret/operator.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d336cfca4e123968ec0df209253a25e38958bfac75bc5401357ba90e18acc69"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 12\u002B corresponding lines): library/alloc/src/rcs/arc.rs:4425-4436 | library/alloc/src/rcs/arc.rs:4440-4451 | library/alloc/src/rcs/rc.rs:4737-4748 | library/alloc/src/rcs/rc.rs:4752-4763 \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":"library/alloc/src/rcs/arc.rs"},"region":{"startLine":4425}}}],"partialFingerprints":{"codehealthFindingId/v1":"c68418274f144c82bd0cb2fbd441b88698fef6d50fdedde80423da12565bf41b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 16\u002B corresponding lines): library/std/src/sys/fs/unix.rs:1249-1266 | library/std/src/sys/fs/unix.rs:2102-2117 | library/std/src/sys/fs/unix.rs:2119-2134 | library/std/src/sys/fs/unix/dir.rs:156-174 \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":"library/std/src/sys/fs/unix.rs"},"region":{"startLine":1249}}}],"partialFingerprints":{"codehealthFindingId/v1":"e11131ece7395e5f9c490971a9138ef1681a345e7cc02d9feaabac5d7b1f358b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): library/std/src/sys/fs/vexos.rs:324-337 | library/std/src/sys/fs/vexos.rs:352-365 \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":"library/std/src/sys/fs/vexos.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"77672f13306d1f3b99f86a48787443cefbc430bfaaec7cfdd3b281e44a46aefb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): library/std/src/sys/paths/uefi.rs:53-72 | library/std/src/sys/paths/windows.rs:26-57 \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":"library/std/src/sys/paths/uefi.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d64a617d29e169e6cab92341edad4366d1046c216c7b24c07fa1fce34c348b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): src/tools/clippy/clippy_lints/src/matches/manual_filter.rs:204-233 | src/tools/clippy/clippy_lints/src/matches/manual_map.rs:44-75 \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":"src/tools/clippy/clippy_lints/src/matches/manual_filter.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc5be202185ffc9521e32321a288686730cfbe3820cf608967789de6605a58d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): src/tools/rust-analyzer/crates/hir-def/src/attrs.rs:83-97 | src/tools/rust-analyzer/crates/hir-def/src/attrs.rs:99-111 \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/tools/rust-analyzer/crates/hir-def/src/attrs.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6a1ee32cbb7c06351e19299dd1b441d9a2af648a84809e6b73ea4a125460d90"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): src/tools/rust-analyzer/crates/hir/src/lib.rs:4878-4896 | src/tools/rust-analyzer/crates/hir/src/lib.rs:4929-4945 \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/tools/rust-analyzer/crates/hir/src/lib.rs"},"region":{"startLine":4878}}}],"partialFingerprints":{"codehealthFindingId/v1":"f73a2cd1735232969ad50d1d3a6bcac97550b84e9e06823e9ffb3120bc10dd10"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/tools/rust-analyzer/crates/ide-diagnostics/src/handlers/type_mismatch.rs:484-493 | src/tools/rust-analyzer/crates/ide-diagnostics/src/handlers/type_mismatch.rs:495-504 \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/tools/rust-analyzer/crates/ide-diagnostics/src/handlers/type_mismatch.rs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"24db805fed205c95f80bc5419349e6adccf53dd7ed0401710d6bf8ee1bd2e45c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): src/tools/rust-analyzer/crates/proc-macro-api/src/lib.rs:156-166 | src/tools/rust-analyzer/crates/proc-macro-api/src/lib.rs:182-193 \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/tools/rust-analyzer/crates/proc-macro-api/src/lib.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"0417a956585bd8731db2ec4eb2211faf5efb42bf1da19452474fe5f8ebb14f99"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): src/tools/rust-analyzer/crates/syntax/src/ast/edit.rs:139-149 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:101-114 \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/tools/rust-analyzer/crates/syntax/src/ast/edit.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c11d921dbd44f336743f65e57b91513a036479202ff1107dbba2339b43715f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): compiler/rustc_data_structures/src/sso/map.rs:190-201 | compiler/rustc_data_structures/src/sso/map.rs:371-382 \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":"compiler/rustc_data_structures/src/sso/map.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"8752c1fb1eff48cd76ae7fe9b066f86723dfa25870c5de3770b12be7d914e586"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): compiler/rustc_infer/src/infer/region_constraints/mod.rs:899-907 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/region_constraints/mod.rs:653-661 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_infer/src/infer/region_constraints/mod.rs"},"region":{"startLine":899}}}],"partialFingerprints":{"codehealthFindingId/v1":"583137853d7684d88733c7968d6f40640a60366368cbe35163bba3e6440ea93f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): compiler/rustc_infer/src/infer/relate/generalize.rs:460-472 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/relate/generalize.rs:401-413 \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":"compiler/rustc_infer/src/infer/relate/generalize.rs"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ec5ded4217a38b96b807cd312acd8936ce1edc7b9b0bcd4a40cb92ae5e5085b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): compiler/rustc_infer/src/infer/snapshot/fudge.rs:41-56 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/snapshot/fudge.rs:38-51 \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":"compiler/rustc_infer/src/infer/snapshot/fudge.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4257f87c8c525bb34890bd192f990fb7a3a00392f224400f17a29e1ec783553"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): compiler/rustc_middle/src/ty/mod.rs:889-903 | compiler/rustc_middle/src/ty/mod.rs:980-996 \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":"compiler/rustc_middle/src/ty/mod.rs"},"region":{"startLine":889}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ed024ff87edb91db020c6cf31422edefb2c9d0c4b1db438c8a6324fbbbd6870"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): library/compiler-builtins/compiler-builtins/src/int/shift.rs:5-18 | library/compiler-builtins/compiler-builtins/src/int/shift.rs:27-43 | library/compiler-builtins/compiler-builtins/src/int/shift.rs:52-64 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/compiler-builtins/compiler-builtins/src/int/shift.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dc9670e65ebd2e92553b1c4f77abc75425a661d762dc458c81605b0278051f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): library/std/src/sync/reentrant_lock.rs:284-300 | library/std/src/sync/reentrant_lock.rs:331-349 \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":"library/std/src/sync/reentrant_lock.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ccb4c9ac9b8343e7ddd2e8d8cf7b53aa2729a2524df9df7bc927af4fcfdd7f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): library/stdarch/crates/core_arch/src/x86/sse2.rs:1590-1610 | library/stdarch/crates/core_arch/src/x86/sse2.rs:1625-1645 \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":"library/stdarch/crates/core_arch/src/x86/sse2.rs"},"region":{"startLine":1590}}}],"partialFingerprints":{"codehealthFindingId/v1":"64d2b1abc40f16150ba07abd2508dfaaf43d606078ad3c4ded6733b902eafb28"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): src/tools/clippy/clippy_lints/src/returns/let_and_return.rs:70-89 | src/tools/clippy/clippy_utils/src/lib.rs:3433-3446 \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/tools/clippy/clippy_lints/src/returns/let_and_return.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"5225b57b9068a8348179c05273e40ffd6053833eacec2d970bcf784fa51bfaf4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): src/tools/rustfmt/src/parse/macros/cfg_if.rs:15-25 | src/tools/rustfmt/src/parse/macros/cfg_select.rs:29-41 | src/tools/rustfmt/src/parse/macros/cfg_select.rs:232-248 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/parse/macros/cfg_if.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"17e329bed5fa33fe7cddaa0a79d7bf7005d33fa6db1db12a8fe17111287c02c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): compiler/rustc_codegen_ssa/src/back/linker.rs:1593-1607 | compiler/rustc_codegen_ssa/src/back/linker.rs:1942-1955 \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":"compiler/rustc_codegen_ssa/src/back/linker.rs"},"region":{"startLine":1593}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdb79d747d3e1d4dad6f26593a323d72091d0076adf51daa37030d450aa88426"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): compiler/rustc_codegen_ssa/src/mir/intrinsic.rs:25-36 | compiler/rustc_codegen_ssa/src/mir/intrinsic.rs:45-52 \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":"compiler/rustc_codegen_ssa/src/mir/intrinsic.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"e202f3fba19fe11c68dba018c0b99713c7d5a7130ccf01d2bc5d87ba09d107c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): compiler/rustc_middle/src/ty/instance.rs:799-809 | compiler/rustc_middle/src/ty/instance.rs:811-821 \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":"compiler/rustc_middle/src/ty/instance.rs"},"region":{"startLine":799}}}],"partialFingerprints":{"codehealthFindingId/v1":"de966ab883b77615222dbf629393dded792586f36f38460b5b1ce5ea64d83556"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): library/core/src/slice/sort/shared/smallsort.rs:682-707 | library/core/src/slice/sort/shared/smallsort.rs:715-740 \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":"library/core/src/slice/sort/shared/smallsort.rs"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"265c43ba61a329f24878417906fff7c020dbe77be0f789fccc3367c071225784"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): library/std/src/os/unix/net/datagram.rs:70-80 | library/std/src/os/unix/net/stream.rs:88-98 | library/std/src/os/windows/net/stream.rs:43-53 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/os/unix/net/datagram.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6e499f73677bf8cc0828103cb710c5c2eb9f20130b921767b2163993eaddea2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 20\u002B corresponding lines): library/std/src/sync/poison/mutex.rs:825-844 | library/std/src/sync/poison/mutex.rs:932-951 | library/std/src/sync/poison/rwlock.rs:962-981 | library/std/src/sync/poison/rwlock.rs:1107-1126 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 20 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":"library/std/src/sync/poison/mutex.rs"},"region":{"startLine":825}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc8e80d78b7ace749bb3572d74fa185c9e521e24a7473ebbce88626e7f9037ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): library/std/src/sys/net/connection/socket/hermit.rs:225-234 | library/std/src/sys/net/connection/socket/solid.rs:293-302 | library/std/src/sys/net/connection/socket/unix.rs:403-412 \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":"library/std/src/sys/net/connection/socket/hermit.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fec23c7d0655fd1623604fe2ab6c16e169e904c2fb373257dffe608190dbf12"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512f.rs:42095-42105 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:42355-42366 \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":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":42095}}}],"partialFingerprints":{"codehealthFindingId/v1":"21bb32cfdce8f6bbeb481f47ee13d853cc0d9431bce3ea977c56de4fd81cd102"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512f.rs:42225-42235 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:42489-42500 \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":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":42225}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c138720adb1a4292fe9735e6e10ebf39aff0f7f303f73ce053767993ebe20c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): src/tools/miri/src/shims/time.rs:238-253 | src/tools/miri/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/tools/miri/src/shims/time.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"efb934da4cff9267817e1d42902cfbe61a95eaff531ca60adcb5fb200820beae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): src/tools/run-make-support/src/string.rs:24-34 | src/tools/run-make-support/src/string.rs:40-50 \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/tools/run-make-support/src/string.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ffa430274285c75a80ba8c98b66e166c5626275a1517ee93a8f18988161ddc4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 18\u002B corresponding lines): src/tools/rust-analyzer/crates/hir-ty/src/db.rs:379-396 | src/tools/rust-analyzer/crates/hir-ty/src/db.rs:408-426 | src/tools/rust-analyzer/crates/hir-ty/src/db.rs:438-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 18 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/tools/rust-analyzer/crates/hir-ty/src/db.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8f5d2b844bc3500f50a4ceb8109860e899f3a2d9e3143dc8221da87190fc75b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/tools/rust-analyzer/crates/hir/src/has_source.rs:119-125 | src/tools/rust-analyzer/crates/hir/src/has_source.rs:129-135 \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/tools/rust-analyzer/crates/hir/src/has_source.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5fa4b96f2e1b7038b089c71ca5d79040891e16d440948bf208923eb60003079"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): src/tools/rust-analyzer/crates/ide-assists/src/handlers/add_missing_match_arms.rs:548-553 | src/tools/rust-analyzer/crates/ide-assists/src/handlers/add_missing_match_arms.rs:583-590 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/add_missing_match_arms.rs"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"131f8ec290922e4a1718ba9a59e68aa2691d0814dbf61286b31c079840b110d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/tools/rust-analyzer/crates/vfs/src/vfs_path.rs:86-92 | src/tools/rust-analyzer/crates/vfs/src/vfs_path.rs:94-100 \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/tools/rust-analyzer/crates/vfs/src/vfs_path.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9c41a353dc430c22aa7124c6828ad31eedf19c861e0dd329d74a763125c3707"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): compiler/rustc_attr_parsing/src/attributes/prototype.rs:90-106 | compiler/rustc_attr_parsing/src/attributes/prototype.rs:112-131 \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":"compiler/rustc_attr_parsing/src/attributes/prototype.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcb00c19533ad79adcf8682eac5eab342b63aa00485ab35af57d97c5584ec4cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): compiler/rustc_data_structures/src/graph/dominators/mod.rs:378-388 | compiler/rustc_data_structures/src/graph/dominators/mod.rs:396-406 \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":"compiler/rustc_data_structures/src/graph/dominators/mod.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc4599b1168ce8d6dda1222cc5ddde9731058c8d65937f89ef6096dfdb6f6ea4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): compiler/rustc_middle/src/ty/predicate.rs:84-100 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/predicate.rs:230-247 \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":"compiler/rustc_middle/src/ty/predicate.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5b49660ee3c02c8c0f0abc176d5e67b8a0ad8a04c3d91c9c18e547938a647a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): compiler/rustc_span/src/source_map.rs:682-691 | compiler/rustc_span/src/source_map.rs:790-799 \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":"compiler/rustc_span/src/source_map.rs"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"2277ddedcc4d297ef0c223580d75c8be97efefc3312c80b6ab6548de79121338"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): library/core/src/hint.rs:950-956 | library/core/src/hint.rs:987-993 | library/core/src/hint.rs:1024-1030 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/hint.rs"},"region":{"startLine":950}}}],"partialFingerprints":{"codehealthFindingId/v1":"f50fb34301efc6df8564631a4695fba7e3407b852bea09cfc1e6215276554d79"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): library/core/src/iter/adapters/take.rs:131-140 | library/core/src/iter/adapters/take.rs:233-250 \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":"library/core/src/iter/adapters/take.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9cef10cd90f0e591e914efa4aeb1c262626a5d53b3f6dff01a443a6247691bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): library/stdarch/crates/core_arch/src/x86/ssse3.rs:209-217 | library/stdarch/crates/core_arch/src/x86/ssse3.rs:267-275 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/ssse3.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dc1039fc0b0e793f82196d5f7419aa9593447a495f170b021a66e60c50f52ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/bootstrap/src/core/config/config.rs:1648-1659 | src/bootstrap/src/core/config/config.rs:1661-1670 \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/bootstrap/src/core/config/config.rs"},"region":{"startLine":1648}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e4fc0f7c7550a9eb812b35c19814a74c01e11dd8c1d9c2064f1ceac00bd25ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/tools/jsondocck/src/directive.rs:393-402 | src/tools/jsondocck/src/directive.rs:404-413 \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/tools/jsondocck/src/directive.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"27b4a53f5a67765a5bae13b0010b46fb0a05745a2b97432f2421c9ffc2e6efae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): src/tools/rust-analyzer/crates/hir/src/lib.rs:5362-5375 | src/tools/rust-analyzer/crates/hir/src/lib.rs:5518-5532 \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/tools/rust-analyzer/crates/hir/src/lib.rs"},"region":{"startLine":5362}}}],"partialFingerprints":{"codehealthFindingId/v1":"410a2a7a0c20c19650a933aa4ee9d0dd376777613c6bb70618a8c6811b2624c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): src/tools/rust-analyzer/crates/proc-macro-srv-cli/src/main_loop.rs:237-247 | src/tools/rust-analyzer/crates/proc-macro-srv-cli/src/main_loop.rs:274-284 \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/tools/rust-analyzer/crates/proc-macro-srv-cli/src/main_loop.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"8113f3b006a181e4dceb4d6ef6681bb651b25bd0d156b42d466e940add345f1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): src/tools/rust-analyzer/crates/test-utils/src/lib.rs:423-434 | src/tools/rust-analyzer/lib/expect-test/src/lib.rs:730-741 \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/tools/rust-analyzer/crates/test-utils/src/lib.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e972fc5c5bbe9d0f9042d135ef89c00a2bc197714d8c13c44348a3e5fd1bb76"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): compiler/rustc_abi/src/lib.rs:1938-1949 | compiler/rustc_abi/src/lib.rs:1954-1972 \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":"compiler/rustc_abi/src/lib.rs"},"region":{"startLine":1938}}}],"partialFingerprints":{"codehealthFindingId/v1":"038379e247fdc3be0c23830b4e3bd1bfd6127e4550bf0f4418dba6ffbb918e1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): compiler/rustc_ast_pretty/src/pprust/state/item.rs:487-500 | compiler/rustc_ast_pretty/src/pprust/state/item.rs:502-514 | compiler/rustc_ast_pretty/src/pprust/state/item.rs:516-528 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ast_pretty/src/pprust/state/item.rs"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"35e8fa62794872a7c6a4026395bb600c19fb3ab7e2b4e31ff2df2690440005e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): compiler/rustc_hir_typeck/src/writeback.rs:707-720 | compiler/rustc_hir_typeck/src/writeback.rs:741-754 \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":"compiler/rustc_hir_typeck/src/writeback.rs"},"region":{"startLine":707}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b6a18fd547fe774fc4695035b54e63280353a96f7d64c0305f7cd4e49cd89a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): compiler/rustc_middle/src/ty/mod.rs:1221-1235 | compiler/rustc_middle/src/ty/mod.rs:1246-1261 \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":"compiler/rustc_middle/src/ty/mod.rs"},"region":{"startLine":1221}}}],"partialFingerprints":{"codehealthFindingId/v1":"daf73dc1884ecf28a4187a9a6eb2b025bd0897fea4c432b9e0020fe20fe6c2c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): compiler/rustc_parse/src/parser/diagnostics.rs:1795-1805 | compiler/rustc_parse/src/parser/diagnostics.rs:1808-1818 \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":"compiler/rustc_parse/src/parser/diagnostics.rs"},"region":{"startLine":1795}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e53960fbc1843272f303cf49f2666df80b4a359248024b4773153e5a15ac23c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): compiler/rustc_type_ir/src/fold.rs:611-622 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/fold.rs:81-98 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/fold.rs:122-133 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_type_ir/src/fold.rs"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f2623be159176fc7837dab1094e88f256276dd7bd221fe3e804a91bb7d61603"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): library/std/src/sys/fs/windows.rs:1491-1505 | library/std/src/sys/fs/windows/dir.rs:236-252 \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":"library/std/src/sys/fs/windows.rs"},"region":{"startLine":1491}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f2b114b7bdc4c711e6f6bea9d7c3eafd9d5abbd9a2ba78754a2cf780e66ee5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): library/std/src/sys/paths/motor.rs:35-48 | library/std/src/sys/paths/unix.rs:108-122 \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":"library/std/src/sys/paths/motor.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e8194cb581f866de7ef99da5f037294c0789d64fe88ab07fd15a758fedbe567"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 12\u002B corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512f.rs:39571-39582 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:39635-39646 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:39699-39711 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:39766-39778 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:42127-42139 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:42257-42269 \u2014 These 6 members are one piece of code written 6 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 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":39571}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dd97a9d677529018bae139af615f69d910b3eacc6dedf47ad84fa08e1ac4c72"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): src/tools/miri/src/borrow_tracker/stacked_borrows/mod.rs:536-548 | src/tools/miri/src/borrow_tracker/stacked_borrows/mod.rs:557-569 | src/tools/miri/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/tools/miri/src/borrow_tracker/stacked_borrows/mod.rs"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ab972932cec7ca7312e6cdb9878db51635e752f6b02bd668fdc796da3a125d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): src/tools/miri/src/concurrency/vector_clock.rs:347-367 | src/tools/miri/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/tools/miri/src/concurrency/vector_clock.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"5438b71d1c4e2321d6045034830f3396b39079bd967f064b86e01b8ff69eb386"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): src/tools/miri/src/shims/unix/macos/sync.rs:331-358 | src/tools/miri/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/tools/miri/src/shims/unix/macos/sync.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"28f177cf10ca271be5e123d675cd320d290627165ff0c79d98dc7293efe13b48"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): src/tools/rust-analyzer/crates/hir-expand/src/lib.rs:1321-1331 | src/tools/rust-analyzer/crates/hir-expand/src/lib.rs:1340-1350 \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/tools/rust-analyzer/crates/hir-expand/src/lib.rs"},"region":{"startLine":1321}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f83fbac77949daa9a0285afa8cce0a6d38a452a2a22916ac0e5d8e575584df5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): src/tools/rust-analyzer/crates/hir/src/lib.rs:2559-2569 | src/tools/rust-analyzer/crates/hir/src/lib.rs:2572-2582 \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/tools/rust-analyzer/crates/hir/src/lib.rs"},"region":{"startLine":2559}}}],"partialFingerprints":{"codehealthFindingId/v1":"e84df9864ecbff45789836375b04cd826c6c9a246ad364c69e66758dbd64439e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): src/tools/rust-analyzer/crates/ide-diagnostics/src/handlers/remove_trailing_return.rs:15-37 | src/tools/rust-analyzer/crates/ide-diagnostics/src/handlers/remove_unnecessary_else.rs:24-41 \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/tools/rust-analyzer/crates/ide-diagnostics/src/handlers/remove_trailing_return.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"f18a1eecb2ba452b11a069a65c5d8f2b7a9660ba6efb887b9c1dfd8e074b7579"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): compiler/rustc_borrowck/src/region_infer/opaque_types/mod.rs:162-180 | compiler/rustc_hir_analysis/src/collect/type_of/opaque.rs:118-128 \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":"compiler/rustc_borrowck/src/region_infer/opaque_types/mod.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4ff7bff1bef666a99e2716ab00222cf86d5d1bbc1703042299848c7338bfec7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): compiler/rustc_codegen_gcc/example/alloc_system.rs:80-90 | library/std/src/sys/alloc/unix.rs:50-61 \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":"compiler/rustc_codegen_gcc/example/alloc_system.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f5629cb03d5409a1c012093f0d65b362479602e2372baf17b133c9107be4106"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): compiler/rustc_hir_typeck/src/upvar.rs:698-716 | src/tools/rust-analyzer/crates/hir-ty/src/infer/closure/analysis.rs:562-578 \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":"compiler/rustc_hir_typeck/src/upvar.rs"},"region":{"startLine":698}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c111dfb935aa6e1bb355bca0106e0fe0e0136f0a83a86bd7c7ad405bc78acf1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): compiler/rustc_span/src/source_map.rs:761-766 | compiler/rustc_span/src/source_map.rs:779-787 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_span/src/source_map.rs"},"region":{"startLine":761}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5482779a6394cc2ba117da1c23eea5339e9af9358109b1e54aa1569f1891fce"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): library/compiler-builtins/compiler-builtins/src/int/specialized_div_rem/mod.rs:198-215 | library/compiler-builtins/compiler-builtins/src/int/specialized_div_rem/mod.rs:284-301 \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":"library/compiler-builtins/compiler-builtins/src/int/specialized_div_rem/mod.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"8641c2310ef2e0ff90dc1ba8ddffcef00e563454c559c4539cb816164c3271d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): library/core/src/iter/adapters/chain.rs:150-164 | library/core/src/iter/adapters/chain.rs:236-250 \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":"library/core/src/iter/adapters/chain.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"102026b0e7e684eb1c4839c0e9a0df809a2e3d744fd1beb931b15a30be473b67"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 12\u002B corresponding lines): library/core/src/slice/iter.rs:1573-1597 | library/core/src/slice/iter.rs:1753-1766 | library/core/src/slice/iter.rs:2400-2411 | library/core/src/slice/iter.rs:2565-2577 \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":"library/core/src/slice/iter.rs"},"region":{"startLine":1573}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c90864053fe8aac62cdb170a48792f359a42560719b4ddf809d2bdb8029ea28"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): library/core/src/slice/iter.rs:1707-1722 | library/core/src/slice/iter.rs:2523-2539 | library/core/src/slice/iter.rs:2890-2903 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/slice/iter.rs"},"region":{"startLine":1707}}}],"partialFingerprints":{"codehealthFindingId/v1":"6416a89ed7dffc35c5da651a49a82855268fb8636767931399bd9ec960e5c8a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): library/core/src/str/iter.rs:657-674 | library/core/src/str/iter.rs:677-696 \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":"library/core/src/str/iter.rs"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"82a056671cf7677ae5907200c62c02a299b06a7d5d35b94b34fd329a25b1bdfa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): library/std/src/sys/net/connection/socket/mod.rs:816-832 | library/std/src/sys/net/connection/socket/mod.rs:1015-1028 \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":"library/std/src/sys/net/connection/socket/mod.rs"},"region":{"startLine":816}}}],"partialFingerprints":{"codehealthFindingId/v1":"f112762a0d23401a7aa2ae07fb57690aebb429801a8509867b2092fff8c499e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): library/stdarch/crates/intrinsic-test/src/common/argument.rs:95-106 | library/stdarch/crates/intrinsic-test/src/common/argument.rs:113-128 \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":"library/stdarch/crates/intrinsic-test/src/common/argument.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce2f397b5d8d923b2d4f9c26b760f90faf2944d8386c9eee2e457fb0ff52d384"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): src/tools/miri/src/intrinsics/aarch64.rs:440-447 | src/tools/miri/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/tools/miri/src/intrinsics/aarch64.rs"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"15d59a58bd7742e84d1f273dad86c5641e2948c08f099717b8752e6dffd03119"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): src/tools/rust-analyzer/crates/ide-db/src/imports/import_assets.rs:376-388 | src/tools/rust-analyzer/crates/ide-db/src/imports/import_assets.rs:391-403 \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/tools/rust-analyzer/crates/ide-db/src/imports/import_assets.rs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"2374b25bda621b21e63edc7d3423d590419b6489f0c11290a1274de0ce52ea9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): src/tools/rust-analyzer/crates/parser/src/grammar/expressions.rs:654-671 | src/tools/rust-analyzer/crates/parser/src/grammar/items/use_item.rs:87-108 \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/tools/rust-analyzer/crates/parser/src/grammar/expressions.rs"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"45ad0b23093a7e5db546a1baeb2a645a0ba40200499c3b1ccaf593d46dcdd057"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): src/tools/rust-analyzer/crates/rust-analyzer/src/lsp/capabilities.rs:522-533 | src/tools/rust-analyzer/crates/rust-analyzer/src/lsp/capabilities.rs:535-547 \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/tools/rust-analyzer/crates/rust-analyzer/src/lsp/capabilities.rs"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e341edaf8baacd9b1837df0416953de760c8d501b44a940c973da450bf53316"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): src/etc/lldb_providers.py:1157-1172 | src/etc/lldb_providers.py:1324-1334 \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/etc/lldb_providers.py"},"region":{"startLine":1157}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba33397c7f592fbaebc588cbdec9161044552c6df326f93eb48156b09997784c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): compiler/rustc_borrowck/src/lib.rs:682-694 | compiler/rustc_borrowck/src/lib.rs:704-716 \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":"compiler/rustc_borrowck/src/lib.rs"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"455189901b6d621c4c8564c8882534914de0f4ad4efc3463d1cac908c7d9482b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): compiler/rustc_codegen_cranelift/src/constant.rs:233-243 | compiler/rustc_codegen_cranelift/src/vtable.rs:81-88 \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":"compiler/rustc_codegen_cranelift/src/constant.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"14597eb3c4dae2dc6f7518f0f6a2a91d96236d7a394f9a3000c52f590eb3a468"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): compiler/rustc_codegen_gcc/example/alloc_system.rs:66-78 | library/std/src/sys/alloc/unix.rs:25-47 \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":"compiler/rustc_codegen_gcc/example/alloc_system.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"a71531fff4434d609388cacd4c9223920c3b3c780653a9d435ab9dc2a95d974a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): compiler/rustc_codegen_llvm/src/debuginfo/metadata/enums/cpp_like.rs:923-947 | compiler/rustc_codegen_llvm/src/debuginfo/metadata/enums/cpp_like.rs:949-973 \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":"compiler/rustc_codegen_llvm/src/debuginfo/metadata/enums/cpp_like.rs"},"region":{"startLine":923}}}],"partialFingerprints":{"codehealthFindingId/v1":"11c4a88650cdbea843e431f7aaf4235d8819c86263369fea0781c181cac6b8df"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): compiler/rustc_infer/src/infer/mod.rs:170-186 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/mod.rs:165-178 \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":"compiler/rustc_infer/src/infer/mod.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"23ab2cba7cf80d7fcef7dc730e5dcf128fe02e3567d40c4b1471154bf4a7b562"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): compiler/rustc_infer/src/infer/mod.rs:1714-1729 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/mod.rs:1177-1192 \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":"compiler/rustc_infer/src/infer/mod.rs"},"region":{"startLine":1714}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bfd5322feac5abab1ad57906b33c45a156c8fe00df32f6f216201d3621e90be"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): compiler/rustc_infer/src/infer/relate/lattice.rs:202-213 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/relate/lattice.rs:179-189 \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":"compiler/rustc_infer/src/infer/relate/lattice.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"408205df0e9f3a553ad2784ec48a7c1633820b7e7ae25f4d5819fa7d1f53e3a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): library/alloc/src/collections/linked_list.rs:195-211 | library/alloc/src/collections/linked_list.rs:240-256 \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":"library/alloc/src/collections/linked_list.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"189b2186100d3148322f48dbd9a6a3d9e79c4c4f832ead3d78a8ae25e8f0cbcb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): library/alloc/src/collections/vec_deque/mod.rs:3633-3655 | library/alloc/src/collections/vec_deque/mod.rs:3716-3733 \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":"library/alloc/src/collections/vec_deque/mod.rs"},"region":{"startLine":3633}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d521e487171cd76b72b06202d17632df4f715e2c6637c7e3167ba41f0836906"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): library/alloc/src/io/buffered/bufreader.rs:352-364 | library/alloc/src/io/buffered/bufreader.rs:405-416 \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":"library/alloc/src/io/buffered/bufreader.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"58c1ee76cf13f81746ee175aea3c336c06116569f8d998a4b5b76fae88fbd1bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): library/alloc/src/rcs/arc.rs:2319-2331 | library/alloc/src/rcs/rc.rs:2412-2429 \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":"library/alloc/src/rcs/arc.rs"},"region":{"startLine":2319}}}],"partialFingerprints":{"codehealthFindingId/v1":"37d8db62ab19053e57721e12af3b9318d12c95ccb5d36bf96f361742ce66821b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): library/std/src/sync/nonpoison/mutex.rs:545-558 | library/std/src/sync/nonpoison/rwlock.rs:829-846 \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":"library/std/src/sync/nonpoison/mutex.rs"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b2e82484c6a0d51fe360355971ebc409f3d02245dd6183cc62f268874f350ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): library/std/src/sys/fs/unix.rs:1236-1247 | library/std/src/sys/fs/unix/dir.rs:101-109 | library/std/src/sys/fs/unix/dir.rs:122-132 \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":"library/std/src/sys/fs/unix.rs"},"region":{"startLine":1236}}}],"partialFingerprints":{"codehealthFindingId/v1":"4757e973520e5dad1a0e83fe0ab9e001106df837ece06e603d3dc250633ba0b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): library/std/src/sys/pal/itron/time.rs:21-35 | library/std/src/sys/pal/itron/time.rs:39-55 \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":"library/std/src/sys/pal/itron/time.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c9f773edd0d45aa765f043bb4fe54129d06c68dfbeaa08ab07a4bbbfed631c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): src/tools/clippy/clippy_lints/src/matches/needless_match.rs:17-30 | src/tools/clippy/clippy_lints/src/matches/needless_match.rs:51-67 \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/tools/clippy/clippy_lints/src/matches/needless_match.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"b569777b34ace59f86844cdfc0327a4e502096b2151f67444c1e4e7edf2d5e1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): src/tools/rust-analyzer/crates/hir-ty/src/mir/monomorphization.rs:83-90 | src/tools/rust-analyzer/crates/hir-ty/src/mir/monomorphization.rs:92-99 \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/tools/rust-analyzer/crates/hir-ty/src/mir/monomorphization.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ad56492b4886c1c66a2a757c9e9f27a35daf448f1f8e4b9abef9732bf77683b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/tools/rust-analyzer/crates/proc-macro-api/src/legacy_protocol/msg/flat.rs:370-379 | src/tools/rust-analyzer/crates/proc-macro-api/src/legacy_protocol/msg/flat.rs:389-398 \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/tools/rust-analyzer/crates/proc-macro-api/src/legacy_protocol/msg/flat.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c1f66a70b457894e7c1ff5f1a6462bf7a510a250aad0e6d3120ec1706e749ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): compiler/rustc_hir_typeck/src/expr_use_visitor.rs:308-322 | src/tools/rust-analyzer/crates/hir-ty/src/infer/closure/analysis/expr_use_visitor.rs:429-443 \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":"compiler/rustc_hir_typeck/src/expr_use_visitor.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b0094611c47e10dca4fb1e4a72ccf828e257329eea614d9ced40e8973259b9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): compiler/rustc_mir_transform/src/move_elimination.rs:670-679 | compiler/rustc_mir_transform/src/move_elimination.rs:686-696 \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":"compiler/rustc_mir_transform/src/move_elimination.rs"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"170eb743ca63f54fe7e958b746feb11479a906a16c693a79aabf0fe10879ba1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): compiler/rustc_passes/src/canonical_symbols.rs:43-54 | compiler/rustc_passes/src/diagnostic_items.rs:44-55 \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":"compiler/rustc_passes/src/canonical_symbols.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"255455451c3f568470722db90ec366ba14317cf0658ef9428dd378179f36b539"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): compiler/rustc_type_ir/src/solve/mod.rs:1124-1131 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/mod.rs:1310-1317 \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":"compiler/rustc_type_ir/src/solve/mod.rs"},"region":{"startLine":1124}}}],"partialFingerprints":{"codehealthFindingId/v1":"be6e08a976f5f4236acdab98a8fc15874457b293ae7936e8eb896a2b28ac4561"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): library/alloc/src/io/cursor.rs:69-84 | library/alloc/src/io/cursor.rs:86-104 \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":"library/alloc/src/io/cursor.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"7acce3ee904fcc9dd530108ef3243e23f9a7332899075e6a241b2eb44bdcefda"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): library/core/src/ptr/mod.rs:641-658 | library/core/src/ptr/mod.rs:715-729 \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":"library/core/src/ptr/mod.rs"},"region":{"startLine":641}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddbad127c46f97fe849eaa80dec7e0f40eb050a9c8ea91c2341d1c609991ac61"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): library/stdarch/crates/core_arch/src/powerpc/vsx.rs:78-88 | library/stdarch/crates/core_arch/src/x86/avx512dq.rs:1572-1582 | library/stdarch/crates/core_arch/src/x86/avx512dq.rs:1756-1767 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/powerpc/vsx.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"b979bcd4a48826e5d88db36a65ec2677218315eae08fb79c873cec7ec38362f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx.rs:2659-2669 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:16976-16984 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx.rs"},"region":{"startLine":2659}}}],"partialFingerprints":{"codehealthFindingId/v1":"41a432f1757d878555b6d119174d561458dceee2bfbd8405132b1bcbe360291f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512bw.rs:12401-12408 | library/stdarch/crates/core_arch/src/x86/avx512bw.rs:12417-12427 \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":"library/stdarch/crates/core_arch/src/x86/avx512bw.rs"},"region":{"startLine":12401}}}],"partialFingerprints":{"codehealthFindingId/v1":"58a67dd19bb62b4d8bb2ee02934fe6e9fa324e56eb81728d494f821c4078d460"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (7 members, 12\u002B corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512f.rs:39592-39604 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:39614-39625 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:39721-39734 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:39744-39756 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:42161-42174 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:42196-42208 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:42459-42472 \u2014 These 7 members are one piece of code written 7 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 7 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":39592}}}],"partialFingerprints":{"codehealthFindingId/v1":"326f9072c5aeacd9a1c4d2667afe2755ac7a19b1ef2b3df3303155dfc052c809"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (7 members, 12\u002B corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512f.rs:39656-39668 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:39678-39689 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:39788-39801 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:39811-39823 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:42291-42304 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:42326-42338 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:42593-42606 \u2014 These 7 members are one piece of code written 7 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 7 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":39656}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bf7476851270a8eea93aa84274d739d9077e4e077966c6d906d941a9608c0ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): src/tools/rust-analyzer/crates/hir-ty/src/next_solver/consts.rs:54-63 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/predicate.rs:201-215 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/ty.rs:76-85 \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/tools/rust-analyzer/crates/hir-ty/src/next_solver/consts.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"245f7f37e45a4fafc277d216329a493a2ceffd76bea0d2e7cd80c28edd40f9a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/tools/rust-analyzer/crates/intern/src/gc.rs:136-144 | src/tools/rust-analyzer/crates/intern/src/gc.rs:149-157 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/intern/src/gc.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"97e84eca87762688f873c8744f4496a0de8669ce0be03c4be2f7a934778595a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 18\u002B corresponding lines): src/tools/rustfmt/check_diff/src/lib.rs:482-507 | src/tools/rustfmt/check_diff/src/lib.rs:509-526 | src/tools/rustfmt/check_diff/src/lib.rs:528-545 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 18 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/tools/rustfmt/check_diff/src/lib.rs"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"d343f4bdf0eeeb33a0fd23015fbfbd2b4c61809ec68069e619dd7034e0cb4bd1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): compiler/rustc_ast_passes/src/feature_gate.rs:696-712 | compiler/rustc_ast_passes/src/feature_gate.rs:724-744 \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":"compiler/rustc_ast_passes/src/feature_gate.rs"},"region":{"startLine":696}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b37f8a336d9897ffaf2117e76210bf89a831a12469573944eed38ef41591603"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): compiler/rustc_borrowck/src/dataflow.rs:164-179 | compiler/rustc_borrowck/src/dataflow.rs:278-294 \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":"compiler/rustc_borrowck/src/dataflow.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e41712efc72d33c13c9b551c4ec7fdf4e1ce1c918e7b5bbd58e0c50a569221d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): compiler/rustc_codegen_cranelift/src/num.rs:499-506 | compiler/rustc_codegen_cranelift/src/num.rs:508-515 \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":"compiler/rustc_codegen_cranelift/src/num.rs"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"67634e4449d6b7f0a3d9598df1ffb6e593caa3b512d8391110425cc45dd3d4d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): compiler/rustc_hir_analysis/src/coherence/builtin.rs:595-610 | compiler/rustc_hir_analysis/src/coherence/builtin.rs:619-630 \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":"compiler/rustc_hir_analysis/src/coherence/builtin.rs"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba279db9008c1f3fc63fb8ec98d2ec8ac295e47177f5226ef7cfbef5c8fa021b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): compiler/rustc_index/src/slice.rs:138-148 | compiler/rustc_index/src/slice.rs:154-166 \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":"compiler/rustc_index/src/slice.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a0fe464ccddd72c1934baadd00008e91b8ad28c3f16838292e7466e1a82e1c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): compiler/rustc_infer/src/infer/mod.rs:1427-1436 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/mod.rs:1033-1042 \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":"compiler/rustc_infer/src/infer/mod.rs"},"region":{"startLine":1427}}}],"partialFingerprints":{"codehealthFindingId/v1":"51d6e5e8772b688e4386c2bf36827f134a243cb2ac7e87bef57ad029c060cbb1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): compiler/rustc_infer/src/infer/resolve.rs:39-50 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/resolve.rs:41-52 \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":"compiler/rustc_infer/src/infer/resolve.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b1c02510cae74037b1336f23de7d105af58d43e3bc46e37f9a58ebcbd41001c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): compiler/rustc_infer/src/infer/snapshot/fudge.rs:104-122 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/snapshot/fudge.rs:97-115 \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":"compiler/rustc_infer/src/infer/snapshot/fudge.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2bad220d90816354cbf286593065cb7d148a84a39ad9112c42f6126e0b65999"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): compiler/rustc_mir_dataflow/src/impls/initialized.rs:322-341 | compiler/rustc_mir_dataflow/src/impls/initialized.rs:546-562 \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":"compiler/rustc_mir_dataflow/src/impls/initialized.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"d11955f6aea444b6b22d4ffdf01bc7d66c063c2d67efc3a3d3df7e17129eb677"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): compiler/rustc_span/src/lib.rs:2477-2490 | compiler/rustc_span/src/lib.rs:2501-2510 \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":"compiler/rustc_span/src/lib.rs"},"region":{"startLine":2477}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd8957f7ea222a9301b93073765dc90970b26959ffc471fb883540007afc6028"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): library/std/src/sys/pal/unix/stack_overflow/handler_cygwin.rs:45-60 | library/std/src/sys/pal/windows/stack_overflow.rs:14-29 \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":"library/std/src/sys/pal/unix/stack_overflow/handler_cygwin.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fcaa896c2207c07db571e58699ac730b18459bdaa347be17e0e20aa4f80f88c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): src/tools/build-manifest/src/checksum.rs:48-60 | src/tools/build-manifest/src/checksum.rs:62-73 \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/tools/build-manifest/src/checksum.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"8da3f88c43350e366ed806f5366ac9b9357009f4adf6dfbb7a041bfe799c42ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): src/tools/clippy/clippy_lints/src/loops/manual_memcpy.rs:262-272 | src/tools/clippy/clippy_lints/src/loops/manual_memcpy.rs:288-298 \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/tools/clippy/clippy_lints/src/loops/manual_memcpy.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad81439fe19b6fc4cefad1a48bbafc727a525367d1e5baed960fd8afb050c199"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/tools/rust-analyzer/crates/hir-ty/src/infer/closure.rs:340-349 | src/tools/rust-analyzer/crates/hir-ty/src/infer/closure.rs:354-365 \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/tools/rust-analyzer/crates/hir-ty/src/infer/closure.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cd8b10dd885839b38a6d66d1d4fbb32a30d92ff4ba7d2e7bab593e1b592c0aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): src/tools/rust-analyzer/crates/hir/src/lib.rs:5722-5731 | src/tools/rust-analyzer/crates/hir/src/lib.rs:5737-5746 | src/tools/rust-analyzer/crates/hir/src/lib.rs:5748-5757 \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/tools/rust-analyzer/crates/hir/src/lib.rs"},"region":{"startLine":5722}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3a3ffa73ff66404c038ddd75ddec68bfc48a348e24728bf11399e58b3ea2d06"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): compiler/rustc_attr_parsing/src/attributes/cfi_encoding.rs:16-27 | compiler/rustc_attr_parsing/src/attributes/test_attrs.rs:211-221 \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":"compiler/rustc_attr_parsing/src/attributes/cfi_encoding.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"098c5c06dba4c6adbad3e63f005ef0a3c2f4e98ea9ff211b6e2b833ddc95ff37"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): compiler/rustc_codegen_llvm/src/builder.rs:189-197 | compiler/rustc_codegen_llvm/src/builder.rs:947-960 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/builder.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8ce0242f37dbfb10f6e7a5586e706891342b33ea551fc9650ae0727e0dfff76"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): compiler/rustc_infer/src/infer/region_constraints/mod.rs:515-523 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/region_constraints/mod.rs:383-392 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_infer/src/infer/region_constraints/mod.rs"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"29ec8c787c1e2ce3bf93e33d4990dd5db9a5f795409da231f06f3ba9215f16f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): compiler/rustc_target/src/callconv/mod.rs:450-461 | compiler/rustc_target/src/callconv/mod.rs:479-490 \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":"compiler/rustc_target/src/callconv/mod.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fb412fe84df2cb82bb6acf0d38d54bdf33ad1de9ee442f235ac7d6d3e449a60"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): library/alloc/src/io/util.rs:418-430 | library/alloc/src/io/util.rs:454-469 \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":"library/alloc/src/io/util.rs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"15fc401c9d23ef4f3e9de151e554356c50c8d9f4f12fbb39f3e3036fbd10e2b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): library/core/src/fmt/float.rs:90-103 | library/core/src/fmt/float.rs:166-178 | library/core/src/fmt/float.rs:183-203 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/fmt/float.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"924b2b2569d9a0481e9c3f8ada5ad443c02a99c12dbf7b478ec52ae91932742c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): library/core/src/io/write.rs:214-226 | library/core/src/io/write.rs:278-293 | library/std/src/os/wasi/fs.rs:153-168 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/io/write.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"88ae4c94eedb0ba0ce5f22bee3a253a1f32b4d441a09ccdb75573f5a6029d170"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): library/std/src/sys/net/connection/socket/mod.rs:605-618 | library/std/src/sys/net/connection/socket/mod.rs:758-767 | library/std/src/sys/net/connection/socket/mod.rs:1047-1056 \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":"library/std/src/sys/net/connection/socket/mod.rs"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d51f5116dbba0aabd1f087cef7113559dc241b5098159b5894e68752aad240b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): library/std/src/sys/pal/windows/handle.rs:76-90 | library/std/src/sys/pal/windows/handle.rs:101-110 \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":"library/std/src/sys/pal/windows/handle.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"20e5fbea42a5bf6f91f98082dca085118378697c3e7cdce6782b4a76a55d192a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): src/bootstrap/src/core/build_steps/gcc.rs:374-384 | src/bootstrap/src/core/build_steps/llvm.rs:323-333 \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/bootstrap/src/core/build_steps/gcc.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"0002fd3f74fbc403197d5da4a947339b756a5a96da55e558b7f2d42df3f94c76"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): src/tools/compiletest/src/directives/auxiliary.rs:95-112 | src/tools/compiletest/src/directives/auxiliary.rs:114-128 \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/tools/compiletest/src/directives/auxiliary.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fcdf0ea15ee0a7dd3f04f0e9802d42e73f337b2d60992911af98ed6611a9293"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): src/tools/miri/src/concurrency/data_race.rs:1492-1506 | src/tools/miri/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/tools/miri/src/concurrency/data_race.rs"},"region":{"startLine":1492}}}],"partialFingerprints":{"codehealthFindingId/v1":"216d84ae5aac4c38d336baa43572a78e9c9c2b2a8b5d20950b0e7026799a7827"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): src/tools/miri/src/concurrency/genmc/mod.rs:436-453 | src/tools/miri/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/tools/miri/src/concurrency/genmc/mod.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"99382c01136a77a305903d7f394b8ec59c0c8b6910d38a2e7d5f2a3735d73f78"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): src/tools/miri/src/concurrency/sync.rs:356-366 | src/tools/miri/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/tools/miri/src/concurrency/sync.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"af6bb29994836cff3df20f41c6a920445113b97d1523c1d1c697a66fb6cdc285"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): src/tools/rust-analyzer/crates/base-db/src/input.rs:521-537 | src/tools/rust-analyzer/crates/base-db/src/input.rs:777-790 \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/tools/rust-analyzer/crates/base-db/src/input.rs"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"d98bce01b2e068ad9f190392c621f3818f1a2d0bdb2008996ca82a5a59f54791"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (1 corresponding lines): src/tools/rust-analyzer/crates/hir-def/src/lib.rs:914-914 | src/tools/rust-analyzer/crates/hir-def/src/lib.rs:1061-1061 \u2014 These two members are one piece of code written twice and then edited apart: 1 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one 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/tools/rust-analyzer/crates/hir-def/src/lib.rs"},"region":{"startLine":914}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eeb47c4da9bd1ed3d6fb49e62fa89a35f74fee97370d5aeec43612de00b09e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/tools/rust-analyzer/crates/hir-def/src/nameres/collector.rs:683-700 | src/tools/rust-analyzer/crates/hir-def/src/nameres/collector.rs:747-756 \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/tools/rust-analyzer/crates/hir-def/src/nameres/collector.rs"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfadc6476125cea5535820fd136d5634498b5f665a3f61737f92862e56fc3984"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/tools/rust-analyzer/crates/syntax/src/syntax_editor/edits.rs:250-258 | src/tools/rust-analyzer/crates/syntax/src/syntax_editor/edits.rs:266-274 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/syntax/src/syntax_editor/edits.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"5af241068d1c990fb3dcbb323e39017e454ed75b83e543883ac2c9f59b183664"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): compiler/rustc_abi/src/layout/ty.rs:298-312 | compiler/rustc_abi/src/layout/ty.rs:321-335 \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":"compiler/rustc_abi/src/layout/ty.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"00ef29930c07cc03f4a325264aac63b1231766692a80b8761998ad7539f6ab9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): compiler/rustc_builtin_macros/src/source_util.rs:34-42 | compiler/rustc_builtin_macros/src/source_util.rs:49-57 | compiler/rustc_builtin_macros/src/source_util.rs:64-76 \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":"compiler/rustc_builtin_macros/src/source_util.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"1166af5d992d18a51ea4cf3215964fad01c6964e0d9afb187730f77f67bfcb48"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 11\u002B corresponding lines): compiler/rustc_codegen_gcc/src/context.rs:630-643 | compiler/rustc_codegen_gcc/src/context.rs:647-661 | compiler/rustc_codegen_llvm/src/context.rs:1172-1182 | compiler/rustc_codegen_llvm/src/context.rs:1185-1196 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_gcc/src/context.rs"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"a92454792c02b1599075855423df8c2b1972d1f61bd1d5c799cda75a31898f4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): compiler/rustc_hir_pretty/src/lib.rs:565-578 | compiler/rustc_hir_pretty/src/lib.rs:586-600 \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":"compiler/rustc_hir_pretty/src/lib.rs"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"725ad518d1e5a9ef4304eacc591083555a8807eb1c022f043a0f3280fdca6cce"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): compiler/rustc_infer/src/infer/mod.rs:1413-1423 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/mod.rs:1009-1019 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/mod.rs:1021-1029 \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":"compiler/rustc_infer/src/infer/mod.rs"},"region":{"startLine":1413}}}],"partialFingerprints":{"codehealthFindingId/v1":"27a5573933a3532dfd53bd08846ba51fc6399475c04e4e9345ef96fe6947860a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): compiler/rustc_infer/src/infer/mod.rs:1635-1643 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/mod.rs:1149-1157 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_infer/src/infer/mod.rs"},"region":{"startLine":1635}}}],"partialFingerprints":{"codehealthFindingId/v1":"e090a8a8b59ae9874771722e0e8c748310461c517da980ba5a4f0a4ff0f30b7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): library/core/src/io/error/repr_unpacked.rs:33-40 | library/core/src/io/error/repr_unpacked.rs:42-49 \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":"library/core/src/io/error/repr_unpacked.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c0c4b5e88fb70795da7a6c8e32d0de13ec5d40047a06e966e205208226c477a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): library/std/src/sys/fs/uefi.rs:421-432 | library/std/src/sys/fs/uefi.rs:434-444 | library/std/src/sys/fs/uefi.rs:509-519 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/fs/uefi.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c9fe20e6b8dfadd4fbe885c95048dff55eb456bfbc767599cb418265522f4aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): library/std/src/sys/process/unix/unix.rs:1005-1018 | library/std/src/sys/process/unix/unix.rs:1020-1031 \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":"library/std/src/sys/process/unix/unix.rs"},"region":{"startLine":1005}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9b700f1ff8aa1635d1afc99ad04b2925afc30d3c09af9ccc6ebf5a2b4d92f5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): library/stdarch/crates/stdarch-gen-arm/src/predicate_forms.rs:202-223 | library/stdarch/crates/stdarch-gen-arm/src/typekinds.rs:88-102 \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":"library/stdarch/crates/stdarch-gen-arm/src/predicate_forms.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"b417077f522434093afee7004f54c4dba49f53698ffacb804b55d1805f22258e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/tools/clippy/clippy_lints/src/casts/cast_sign_loss.rs:112-121 | src/tools/clippy/clippy_lints/src/casts/cast_sign_loss.rs:127-136 \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/tools/clippy/clippy_lints/src/casts/cast_sign_loss.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3a876b9d3511dc63c967b9813c5687082894f5dc352dd1c9a5f2b9cbff8dbcf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): src/tools/clippy/clippy_lints/src/missing_doc.rs:247-264 | src/tools/clippy/clippy_lints/src/missing_doc.rs:266-281 \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/tools/clippy/clippy_lints/src/missing_doc.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"da8a986f176dc805a1f48e2392815954d3bdf54daa0bd29259bbcd86feb5a57a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): src/tools/clippy/clippy_lints/src/non_expressive_names.rs:401-414 | src/tools/clippy/clippy_lints/src/non_expressive_names.rs:416-429 \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/tools/clippy/clippy_lints/src/non_expressive_names.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7d890fa468143a9f533f3ee734ffba6d70f2761c26e497438d1d78ab1f085c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/tools/clippy/clippy_lints/src/operators/manual_isolate_lowest_one.rs:149-157 | src/tools/clippy/clippy_lints/src/operators/manual_isolate_lowest_one.rs:159-167 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/operators/manual_isolate_lowest_one.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c4e9652d4e9e88cdc72fb6eb82fc59771d0eac9b64276a4494bcf24615afed4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/tools/clippy/clippy_utils/src/sugg.rs:47-53 | src/tools/clippy/clippy_utils/src/sugg.rs:395-401 \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/tools/clippy/clippy_utils/src/sugg.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"123ea306f802d1d841f65044d3da72da0974de5da16a6d1dee9a1bf9bcc7b141"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): src/tools/rust-analyzer/crates/ide-db/src/active_parameter.rs:182-189 | src/tools/rust-analyzer/crates/syntax/src/ast/node_ext.rs:58-65 \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/tools/rust-analyzer/crates/ide-db/src/active_parameter.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"675a3fe6561b89960aa6d547b8f511d03a49a308da99b4d12641dec07f8ab627"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/tools/rust-analyzer/crates/syntax/src/ast/make.rs:491-499 | src/tools/rust-analyzer/crates/syntax/src/ast/make.rs:1007-1015 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/syntax/src/ast/make.rs"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"445bfd2ae2b9d6536d27ae0c1042e74646377a893f31cd0f7253df3c4082b9e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): src/tools/rust-analyzer/crates/syntax/src/parsing.rs:12-19 | src/tools/rust-analyzer/crates/syntax/src/parsing.rs:25-32 \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/tools/rust-analyzer/crates/syntax/src/parsing.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"c629d37d484a94cc89500a931b78b647b76ddc8ca1594d9e1c25441af7670802"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): compiler/rustc_ast_lowering/src/expr.rs:1273-1286 | compiler/rustc_ast_lowering/src/expr.rs:1295-1308 \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":"compiler/rustc_ast_lowering/src/expr.rs"},"region":{"startLine":1273}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dd2597a7295ce69036e6ff0757c98dcf13fda7d142ba0508c8d5ae3d0d18470"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): compiler/rustc_hir/src/hir.rs:4923-4932 | compiler/rustc_hir/src/hir.rs:4985-4994 \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":"compiler/rustc_hir/src/hir.rs"},"region":{"startLine":4923}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9a6506d449da99be0a5ffa6b3577ad1db09b8f89871fb3288e39eb942625d86"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): compiler/rustc_hir_id/src/definitions.rs:509-529 | compiler/rustc_hir_id/src/definitions.rs:531-550 \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":"compiler/rustc_hir_id/src/definitions.rs"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"90270c1a63235592b4e8ae4c74fb1fb5fef1c98ddcc7717df94f459ce158c8f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): compiler/rustc_hir_typeck/src/diverges.rs:42-51 | compiler/rustc_hir_typeck/src/diverges.rs:56-65 \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":"compiler/rustc_hir_typeck/src/diverges.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"178663e1168d027c1cf0ad846792087d007cc4b1c1d0fedb3df11e23c23c138a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): compiler/rustc_middle/src/ty/mod.rs:703-714 | compiler/rustc_type_ir/src/inherent.rs:351-362 | compiler/rustc_type_ir/src/inherent.rs:364-375 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/ty/mod.rs"},"region":{"startLine":703}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c7b67e9e4b19f241a6774eedc50c9ffae39015f2d79c638dacad53a52bd8af7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): compiler/rustc_parse/src/parser/expr.rs:2906-2918 | compiler/rustc_parse/src/parser/ty.rs:1735-1746 \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":"compiler/rustc_parse/src/parser/expr.rs"},"region":{"startLine":2906}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1ddf38c7a29708d3ddb3b6190fecda78c1a584a99f33ae6886937d5d1e1ef2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): compiler/rustc_span/src/span_encoding.rs:194-205 | compiler/rustc_span/src/span_encoding.rs:242-253 | compiler/rustc_span/src/span_encoding.rs:282-299 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_span/src/span_encoding.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"1513beb5d45ef4245513d8602729177950dd5537c42e7461a59d9b94ca4a2a97"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): library/core/src/iter/adapters/fuse.rs:319-332 | library/core/src/iter/adapters/fuse.rs:373-386 \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":"library/core/src/iter/adapters/fuse.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4a6d1326313d67813448eacb84c6a835a518c8e116adc213be42c5e87b163f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): library/core/src/ptr/mod.rs:1828-1848 | library/core/src/ptr/mod.rs:2038-2051 \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":"library/core/src/ptr/mod.rs"},"region":{"startLine":1828}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6f453beb4936042bc7c3e00847b7418e3f6e8f74d2ab1669c2da92db9b17fed"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): library/std/src/sync/mpmc/mod.rs:665-673 | library/std/src/sync/mpmc/mod.rs:1423-1431 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sync/mpmc/mod.rs"},"region":{"startLine":665}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c68ef84ce50c6fc3fb1d183af414c2c7b7cf3bd06694dd31098ec00ec43c696"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): library/std/src/sys/pal/xous/params.rs:188-196 | library/std/src/sys/pal/xous/params.rs:247-255 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/pal/xous/params.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"272b07ab115d1bd9a62a0acb363adc6727e9e2ccfee86bc3b84af796ac1e18df"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): library/std/src/sys/personality/dwarf/mod.rs:36-49 | library/std/src/sys/personality/dwarf/mod.rs:51-68 \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":"library/std/src/sys/personality/dwarf/mod.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea08391c2d2dc5081c42c4c9d77a0ac6a11e64ed6132c4094ed31c093f7e7be2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/bootstrap/src/utils/cache.rs:139-148 | src/bootstrap/src/utils/cache.rs:153-161 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/utils/cache.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec9e437b59239f32e53e583b7e546efb22ba52584298cf80ab77947f3a009004"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): src/librustdoc/clean/mod.rs:1190-1201 | src/librustdoc/clean/mod.rs:1207-1219 \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/librustdoc/clean/mod.rs"},"region":{"startLine":1190}}}],"partialFingerprints":{"codehealthFindingId/v1":"afd0413d8ee27016cf0b2d715dd3e5c300627b4fd18077391eea4a557bb7a318"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): src/librustdoc/html/render/sidebar.rs:854-867 | src/librustdoc/html/render/sidebar.rs:872-885 \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/librustdoc/html/render/sidebar.rs"},"region":{"startLine":854}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e2c49fc3038050e94fce5f2fdb66a8aec53acaa7df2ff9ffa8f9b8301f2a31a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): src/tools/clippy/clippy_lints_internal/src/repeated_is_diagnostic_item.rs:507-518 | src/tools/clippy/clippy_lints_internal/src/repeated_is_diagnostic_item.rs:523-537 \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/tools/clippy/clippy_lints_internal/src/repeated_is_diagnostic_item.rs"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"78865307865b03a249e012373218068c4b305e0ef0e006fed50800c36c559d61"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): src/tools/rust-analyzer/crates/ide-assists/src/handlers/extract_function.rs:1604-1621 | src/tools/rust-analyzer/crates/ide-assists/src/handlers/extract_function.rs:1642-1655 \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/tools/rust-analyzer/crates/ide-assists/src/handlers/extract_function.rs"},"region":{"startLine":1604}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b5253e9ff861dca0cc1ef459992a6bfd319950cd2addac2f08a0f5628a8481c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): compiler/rustc_ast/src/ast.rs:732-746 | compiler/rustc_hir/src/hir.rs:1598-1612 \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":"compiler/rustc_ast/src/ast.rs"},"region":{"startLine":732}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c5af8f2fe0c17c3a57e041bc7c7b72dccc0c7e56d2c1f5ebcd0d12c893fc9c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): compiler/rustc_ast/src/ast.rs:2861-2869 | compiler/rustc_hir/src/hir.rs:3782-3793 | src/tools/rust-analyzer/crates/hir-def/src/hir.rs:588-596 \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":"compiler/rustc_ast/src/ast.rs"},"region":{"startLine":2861}}}],"partialFingerprints":{"codehealthFindingId/v1":"69158f0bb618f5475fb0cb28fe3009f56109d280860c8f6538b30862a34bca98"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): compiler/rustc_ast_lowering/src/expr.rs:1666-1676 | compiler/rustc_ast_lowering/src/item.rs:1249-1258 \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":"compiler/rustc_ast_lowering/src/expr.rs"},"region":{"startLine":1666}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee2f16f73fdc210a6ea5219848ea6952907e9a70f73bcec713e9fb67fe621f8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): compiler/rustc_ast_pretty/src/pp.rs:307-316 | compiler/rustc_ast_pretty/src/pp.rs:329-340 \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":"compiler/rustc_ast_pretty/src/pp.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"daee65beac970897561367a67cda3dfb0e0840a367667e782a9a5262fc2c9fc0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): compiler/rustc_codegen_gcc/example/alloc_system.rs:33-43 | library/std/src/sys/alloc/mod.rs:50-64 \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":"compiler/rustc_codegen_gcc/example/alloc_system.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9e5b1e1030490a37c9f47e43b1e035930ae59cb1b0932a73d2db1cb11b5442e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): compiler/rustc_driver_impl/src/lib.rs:357-368 | src/librustdoc/lib.rs:1088-1099 \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":"compiler/rustc_driver_impl/src/lib.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"01c4234babb59250f10f95754caafa4c53cadf7d6eb3811d6087e5a402aaede0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): compiler/rustc_middle/src/ty/diagnostics.rs:660-674 | compiler/rustc_middle/src/ty/diagnostics.rs:746-761 \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":"compiler/rustc_middle/src/ty/diagnostics.rs"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff27f5fbcb607a61fc060275c355d460c9ef7d2fa1df47c0f1fa569cc1e02924"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): compiler/rustc_parse/src/parser/expr.rs:1709-1721 | compiler/rustc_parse/src/parser/expr.rs:1724-1731 | compiler/rustc_parse/src/parser/expr.rs:1826-1833 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/expr.rs"},"region":{"startLine":1709}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcac87442d030f0106db46b068bcfba3d78875394f5c3943ae6aa7d0a9f5a374"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): compiler/rustc_target/src/callconv/mips64.rs:9-22 | compiler/rustc_target/src/callconv/mod.rs:543-558 \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":"compiler/rustc_target/src/callconv/mips64.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4facceeba9a2088b3e36b60c770b88816f75f8dcd01b827a7cf5675e1531157"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): compiler/rustc_thread_pool/src/sleep/counters.rs:149-168 | compiler/rustc_thread_pool/src/sleep/counters.rs:175-189 \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":"compiler/rustc_thread_pool/src/sleep/counters.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"be89532fc1077e251207b25f280a477ae466406b1e1fb6b2cf7ba70d1eb0d0d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): compiler/rustc_type_ir/src/sty/consts.rs:129-138 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/consts.rs:144-153 \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":"compiler/rustc_type_ir/src/sty/consts.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"723bf9f71d5d161ef4c1a1536a4dca3620b43183e9ade8bf129b06be1faecc5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): library/core/src/num/imp/int_sqrt.rs:253-258 | library/core/src/num/imp/int_sqrt.rs:267-273 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/num/imp/int_sqrt.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"78ae317026850e56cc05879eb5a5521c7cf0d738a707836456cc839a2275020a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): library/std/src/sys/pal/unix/sync/condvar.rs:229-241 | library/std/src/sys/pal/unix/sync/mutex.rs:106-123 \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":"library/std/src/sys/pal/unix/sync/condvar.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c261e62eec1e7222a5e9768e213a573091cbc7c1de00e2ae643f231de5b792b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): src/tools/clippy/clippy_lints/src/casts/cast_sign_loss.rs:218-243 | src/tools/clippy/clippy_lints/src/casts/cast_sign_loss.rs:249-278 \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/tools/clippy/clippy_lints/src/casts/cast_sign_loss.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"80563f8a8a520159a479af5cbcb86ccab449ad11bbb442a36038518a42f122de"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/tools/clippy/clippy_lints/src/min_ident_chars.rs:97-106 | src/tools/clippy/clippy_lints/src/min_ident_chars.rs:108-114 \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/tools/clippy/clippy_lints/src/min_ident_chars.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"c20e4eb971993981ea1b4531beb24b794e2caf5fd834d06019e8e974a005d1a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): src/tools/compiletest/src/read2.rs:332-346 | src/tools/rust-analyzer/crates/stdx/src/process.rs:246-256 \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/tools/compiletest/src/read2.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"fddae468c8cfda5b9bbdd62bb5e89b5977beece6608156b3631061cc52880151"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 19\u002B corresponding lines): src/tools/rust-analyzer/crates/hir-ide/src/diagnostics/decl_check.rs:301-319 | src/tools/rust-analyzer/crates/hir-ide/src/diagnostics/decl_check.rs:394-412 | src/tools/rust-analyzer/crates/hir-ide/src/diagnostics/decl_check.rs:482-500 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 19 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ide/src/diagnostics/decl_check.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cd4c31a629069557952b151025463d52ef197ab000f14542da4981189ef51e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): src/tools/rust-analyzer/crates/hir-ty/src/lower.rs:2715-2728 | src/tools/rust-analyzer/crates/hir-ty/src/lower.rs:2733-2743 \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/tools/rust-analyzer/crates/hir-ty/src/lower.rs"},"region":{"startLine":2715}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c33f616deb21dc365ce5bcccead1b122b9e012a0c0882a76eab0ab49dd377a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): src/tools/rust-analyzer/crates/ide/src/inlay_hints/param_name.rs:191-223 | src/tools/rust-analyzer/crates/ide/src/inlay_hints/param_name.rs:232-254 \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/tools/rust-analyzer/crates/ide/src/inlay_hints/param_name.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"88a123ac79d788068b801c4501c4bdb1ff8fe5307f85fd5e836d78d26481266f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): compiler/rustc_borrowck/src/region_infer/values.rs:118-136 | compiler/rustc_borrowck/src/region_infer/values.rs:139-153 \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":"compiler/rustc_borrowck/src/region_infer/values.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f36b82475f84af10c946b67080f8b64a445a885bc437a0636b62f496725382e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): compiler/rustc_codegen_llvm/src/back/llvm_backend.rs:511-523 | compiler/rustc_codegen_llvm/src/back/llvm_backend.rs:525-537 \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":"compiler/rustc_codegen_llvm/src/back/llvm_backend.rs"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"c518e124150ac9fe2ce9ad55c8ee8262d22d906c0ee978b3f9de877ffe5f344f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): compiler/rustc_const_eval/src/interpret/memory.rs:463-476 | compiler/rustc_const_eval/src/interpret/memory.rs:486-493 \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":"compiler/rustc_const_eval/src/interpret/memory.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"856afca741aaa2f009d4db09487d57c961537206ba073732a8dbc81b99be904d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): compiler/rustc_errors/src/diagnostic.rs:261-271 | compiler/rustc_errors/src/formatting.rs:75-85 \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":"compiler/rustc_errors/src/diagnostic.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"a57a990edfcfde4297105b566dffcb4e7fe2102e5e375b0c034c032d5517b2c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): compiler/rustc_hir_typeck/src/expr_use_visitor.rs:624-633 | src/tools/rust-analyzer/crates/hir-ty/src/infer/closure/analysis/expr_use_visitor.rs:730-740 \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":"compiler/rustc_hir_typeck/src/expr_use_visitor.rs"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f07ef86aab7f6366068faf7b356c5694d2a6c1d4f09c37976c194cbfd2ece69"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): compiler/rustc_infer/src/infer/canonical/query_response.rs:91-117 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/canonical/instantiate.rs:202-224 \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":"compiler/rustc_infer/src/infer/canonical/query_response.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cdf2eef6b0ae13b562b96522c4c444f43c4141f719028e9f943930280a58ed6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): compiler/rustc_middle/src/traits/solve.rs:87-100 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/opaques.rs:122-139 \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":"compiler/rustc_middle/src/traits/solve.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce3eee8ffc63b3dda8f3c6675fb740a63785e2b9911316727077bbb5e23a2fc9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): compiler/rustc_mir_transform/src/inline.rs:64-71 | compiler/rustc_mir_transform/src/inline.rs:88-95 \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":"compiler/rustc_mir_transform/src/inline.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"df75cbe35e12fa557e6e61e10e65628ac88236f98dedc45c405013dee4d18797"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): compiler/rustc_resolve/src/diagnostics/impls.rs:3572-3578 | compiler/rustc_resolve/src/diagnostics/impls.rs:3592-3610 | compiler/rustc_resolve/src/diagnostics/impls.rs:3624-3630 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/diagnostics/impls.rs"},"region":{"startLine":3572}}}],"partialFingerprints":{"codehealthFindingId/v1":"72fa173a66c640a2cbef7c3c8c7f002bcf111806951479d6fb6eb162cf342c67"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): compiler/rustc_resolve/src/effective_visibilities.rs:203-218 | compiler/rustc_resolve/src/effective_visibilities.rs:226-240 \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":"compiler/rustc_resolve/src/effective_visibilities.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3780ea5e06e02eceb8b2a4141ec268173461edffe75dc52dd759ad08c7c0a16"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): compiler/rustc_session/src/options.rs:997-1009 | compiler/rustc_session/src/options.rs:1014-1026 \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":"compiler/rustc_session/src/options.rs"},"region":{"startLine":997}}}],"partialFingerprints":{"codehealthFindingId/v1":"f23e84707da00e28d35f5d7187c01e345b94ee55ea7db5ed30d336f5679c32b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): library/core/src/io/error/repr_bitpacked.rs:169-181 | library/core/src/io/error/repr_bitpacked.rs:184-197 \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":"library/core/src/io/error/repr_bitpacked.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"f31b0a1d010a931bb8b347b79b034eeac53585cf74989d1c831bd933a89a67a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): library/core/src/slice/iter.rs:94-104 | library/core/src/slice/iter.rs:219-244 \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":"library/core/src/slice/iter.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"98bb95ab55d8a620b2490d01836258dbc9d4956f5fc840d0decb0a015dfe6abb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): library/std/src/sync/mpmc/counter.rs:60-68 | library/std/src/sync/mpmc/counter.rs:113-121 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sync/mpmc/counter.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"c67f033479516602bfbee30b8a698271a0b579eaa80fc940ecf112fcf6d5ebc6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): library/std/src/sync/poison/mutex.rs:411-426 | library/std/src/sync/poison/rwlock.rs:327-342 \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":"library/std/src/sync/poison/mutex.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4e9352e95e5c58369fe07d9a8d54c81e7a920200da730817c92d7294fd35015"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): library/std/src/sys/fs/motor.rs:321-325 | library/std/src/sys/fs/motor.rs:387-391 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/fs/motor.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"50daaa26fa247f295022092ae46504731fe749a10b633b313fbb33d18f431854"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 8\u002B corresponding lines): library/std/src/sys/net/connection/xous/tcplistener.rs:198-205 | library/std/src/sys/net/connection/xous/tcpstream.rs:384-391 | library/std/src/sys/net/connection/xous/tcpstream.rs:405-412 | library/std/src/sys/net/connection/xous/udp.rs:379-386 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/net/connection/xous/tcplistener.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfb48dde1201aca94c350593486eff701149f7c10dfb4efcd8d18ff47f3da5bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx.rs:131-145 | library/stdarch/crates/core_arch/src/x86/sse.rs:1045-1059 \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":"library/stdarch/crates/core_arch/src/x86/avx.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1f98bad1337435a7ace9504b29d685aaf9e1b0b78149289ee0abbd1b291948c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512f.rs:11748-11762 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:11771-11785 \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":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":11748}}}],"partialFingerprints":{"codehealthFindingId/v1":"37bed6293ff7e4f827498b5195d763fbf7c2315875a447c0d62490fe8c769535"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/tools/rust-analyzer/crates/hir-def/src/hir/generics.rs:385-393 | src/tools/rust-analyzer/crates/hir-def/src/hir/generics.rs:395-403 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/hir/generics.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"56e529271b26f8b8c8f98c965829b7f12a4258aa62e7acaaf3eb7cad582f3a1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/tools/rust-analyzer/crates/hir-ty/src/infer/cast.rs:459-467 | src/tools/rust-analyzer/crates/hir-ty/src/infer/cast.rs:489-497 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/infer/cast.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7a53741dcff79086b7053a30130c095caea5761474d5fc9ff069f19fea4ce95"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): src/tools/rust-analyzer/crates/hir-ty/src/next_solver/def_id.rs:577-584 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/def_id.rs:628-635 \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/tools/rust-analyzer/crates/hir-ty/src/next_solver/def_id.rs"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a9655ccf3387d98661891a9f67dcc13e031c345b72e20c8fd94f5e00a38d3d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/tools/rust-analyzer/crates/intern/src/gc.rs:32-41 | src/tools/rust-analyzer/crates/intern/src/gc.rs:56-66 \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/tools/rust-analyzer/crates/intern/src/gc.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3f96fb46e19694065e9b89d08845d1b0fda2b766c9b1f1b95584a5a8a85e85c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): src/tools/rust-analyzer/crates/syntax/src/ast/token_ext.rs:491-503 | src/tools/rust-analyzer/crates/syntax/src/ast/token_ext.rs:507-519 \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/tools/rust-analyzer/crates/syntax/src/ast/token_ext.rs"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf9fb313b006f51133a14b1446ab616e6f70934090197716f91c3ee3e2673898"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): compiler/rustc_middle/src/ty/layout.rs:46-56 | compiler/rustc_middle/src/ty/layout.rs:57-67 \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":"compiler/rustc_middle/src/ty/layout.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab6f925bf06e82cb2214e65766d1b12ec44b9a019a9961a9687e33983b3ff66c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): compiler/rustc_middle/src/ty/layout.rs:187-197 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/util.rs:265-274 \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":"compiler/rustc_middle/src/ty/layout.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2e83f630246d64735733812283aa3b1c08c9704ec382a68009dc24c4d96d808"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): compiler/rustc_middle/src/ty/util.rs:121-129 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/util.rs:104-112 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/ty/util.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3b5ce4ccec960fb1d5132e62e20419bd91b38bb33ccf5541ac178015f38e7c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): compiler/rustc_mir_dataflow/src/move_paths/mod.rs:78-86 | compiler/rustc_mir_dataflow/src/move_paths/mod.rs:92-100 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_dataflow/src/move_paths/mod.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"5895688d110589bff80fe56dbbf5f85aa892af33c5150578cf9901657e4d9388"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): compiler/rustc_passes/src/canonical_symbols.rs:74-86 | compiler/rustc_passes/src/diagnostic_items.rs:76-94 \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":"compiler/rustc_passes/src/canonical_symbols.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"d765ebf8f81b686502d43189d4c64e70204123438070578a57ea391fe9c3c3c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): library/alloc/src/collections/btree/navigate.rs:392-403 | library/alloc/src/collections/btree/navigate.rs:413-424 | library/alloc/src/collections/btree/navigate.rs:438-449 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/alloc/src/collections/btree/navigate.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec901e05f6b8ae783ad2a55115da2e47cc173e005447885b845c98001d13b00b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): library/std/src/sys/pal/sgx/abi/mem.rs:54-70 | library/std/src/sys/pal/sgx/abi/mem.rs:77-93 \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":"library/std/src/sys/pal/sgx/abi/mem.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eda3d6cc7e6ba1a0cd324005c67d61948319c0be8400ff045be99f46e278459"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): library/std/src/sys/random/linux.rs:166-172 | library/std/src/sys/random/mod.rs:119-125 \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":"library/std/src/sys/random/linux.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dcd132a2d00b95115237bffa2ca1b40e7fe9e29b98c0c7ee1e5c9ac6bdaadd2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/tools/clippy/clippy_lints/src/methods/map_unwrap_or.rs:162-170 | src/tools/clippy/clippy_lints/src/option_if_let_else.rs:270-278 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/methods/map_unwrap_or.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2a6c5478fc2b43c103132ac9cc5ad5f5a3024d1becb27a71cdff233e6c7856b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): src/tools/rust-analyzer/crates/hir-expand/src/lib.rs:277-287 | src/tools/rust-analyzer/crates/hir-expand/src/lib.rs:1044-1054 \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/tools/rust-analyzer/crates/hir-expand/src/lib.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"df25f3c16acbac384e420605174a3697110615e4d034cdad0e61390963367cc0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): src/tools/rust-analyzer/crates/hir/src/lib.rs:1453-1460 | src/tools/rust-analyzer/crates/hir/src/lib.rs:1463-1470 | src/tools/rust-analyzer/crates/hir/src/lib.rs:1473-1480 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir/src/lib.rs"},"region":{"startLine":1453}}}],"partialFingerprints":{"codehealthFindingId/v1":"100af4d5bc7e83ed2e771065daea5c31884fc35a28b7b117da6c1f1d05f95e9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): src/tools/rust-analyzer/crates/parser/src/grammar/expressions/atom.rs:654-668 | src/tools/rust-analyzer/crates/parser/src/grammar/expressions/atom.rs:865-881 \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/tools/rust-analyzer/crates/parser/src/grammar/expressions/atom.rs"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"086551cadeca924b4a55b285ddf2f29779a3ac52f6f18823949c8fa87b9a14b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/tools/rust-analyzer/crates/proc-macro-api/src/legacy_protocol/msg/flat.rs:361-369 | src/tools/rust-analyzer/crates/proc-macro-api/src/legacy_protocol/msg/flat.rs:380-388 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/proc-macro-api/src/legacy_protocol/msg/flat.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"c87a771ab4a7eaf9b6526154de9f693239f2202df43f0bad38a7230dc488880c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): library/alloc/src/boxed.rs:615-624 | library/alloc/src/boxed.rs:682-691 \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":"library/alloc/src/boxed.rs"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"330b5887e91181d9bdb5fe202dc9a53376f0fcbe80c850e231c5eb5d98fbfd51"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): library/std/src/os/unix/net/listener.rs:183-189 | library/std/src/os/windows/net/listener.rs:145-151 \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":"library/std/src/os/unix/net/listener.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c3c94c704663497e7a4cb56c9feb0cdd80efcef5741b06281da8bd3569dd5e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 11\u002B corresponding lines): library/std/src/os/xous/services/dns.rs:19-29 | library/std/src/os/xous/services/log.rs:66-77 | library/std/src/os/xous/services/net.rs:86-96 | library/std/src/os/xous/services/systime.rs:19-29 | library/std/src/os/xous/services/ticktimer.rs:33-43 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/os/xous/services/dns.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ea340d5890ee540f9c3b4efcc4c3cec0bb711fd57c4299224634aa9ac871089"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): library/std/src/sync/nonpoison/mutex.rs:641-654 | library/std/src/sync/nonpoison/rwlock.rs:968-985 \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":"library/std/src/sync/nonpoison/mutex.rs"},"region":{"startLine":641}}}],"partialFingerprints":{"codehealthFindingId/v1":"6467e12bcaa5a841d61c6aaa5cb242e339c5654c3d99919571450bffb7503538"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): library/std/src/sys/fd/unix.rs:145-154 | library/std/src/sys/fd/unix.rs:243-253 \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":"library/std/src/sys/fd/unix.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"74e881d64a1d4f5d5310edf7a020214e43cf6872d09a9a08c8fbebdb6b4406cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): library/std/src/sys/pal/unix/time.rs:145-156 | library/std/src/sys/pal/unix/time.rs:158-168 \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":"library/std/src/sys/pal/unix/time.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"f08cb4929a11780d7e1a44454ffefe75812bc8e9e312b676d1f31118ef5ab7ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): library/std/src/sys/process/windows.rs:747-757 | library/std/src/sys/process/windows.rs:759-772 \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":"library/std/src/sys/process/windows.rs"},"region":{"startLine":747}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e8b814b17c24ed02be53ef7d0defec387ed0a00431510df7cf81ba676c0fdfc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): library/stdarch/crates/core_arch/src/s390x/vector.rs:363-375 | library/stdarch/crates/core_arch/src/s390x/vector.rs:377-389 \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":"library/stdarch/crates/core_arch/src/s390x/vector.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0f0b536673e49b72c54879d8b529e0ab9381eb8d03ce6f9725588cfea4753d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): src/bootstrap/src/core/build_steps/doc.rs:104-118 | src/bootstrap/src/core/build_steps/doc.rs:1655-1670 | src/bootstrap/src/core/build_steps/doc.rs:1753-1769 \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/bootstrap/src/core/build_steps/doc.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aca05ea08ccfce00252a7d2d1045181f66e1d2673bc9e12184ed2a25076d62b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): src/tools/clippy/clippy_lints_internal/src/collapsible_span_lint_calls.rs:216-235 | src/tools/clippy/clippy_lints_internal/src/collapsible_span_lint_calls.rs:244-263 \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/tools/clippy/clippy_lints_internal/src/collapsible_span_lint_calls.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"fccf1ed137000e679b601064bfdec5ffabe0e573287bf892a4e14139bd1ab1f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): src/tools/miri/src/borrow_tracker/mod.rs:442-456 | src/tools/miri/src/borrow_tracker/mod.rs:464-478 | src/tools/miri/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/tools/miri/src/borrow_tracker/mod.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"70eccc2b0c6d5c0b6857c124399981cf1bef039b0f422087e9235be4f1944a6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): src/tools/miri/src/concurrency/genmc/mod.rs:533-551 | src/tools/miri/src/concurrency/genmc/mod.rs:681-697 | src/tools/miri/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/tools/miri/src/concurrency/genmc/mod.rs"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9ac3e6ba731693a363cefeb6a7de51b182c2fe7c6bbdd4b7ca709e7305e8a4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): src/tools/miri/src/shims/unix/sync.rs:447-461 | src/tools/miri/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/tools/miri/src/shims/unix/sync.rs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"8479cfdc6ecee07c7a1b11511a708ff9c28f1c5a2d08c49db84676b36a519a56"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 11\u002B corresponding lines): src/tools/rust-analyzer/crates/base-db/src/lib.rs:89-99 | src/tools/rust-analyzer/crates/base-db/src/lib.rs:107-118 | src/tools/rust-analyzer/crates/base-db/src/lib.rs:138-149 | src/tools/rust-analyzer/crates/base-db/src/lib.rs:183-198 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/base-db/src/lib.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd350e2b4d8ed1bc2f90c087e715f7c9469d2bb48136a5dc0c4b92b1ecc5d88e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): src/tools/rust-analyzer/crates/hir-ty/src/infer.rs:2163-2173 | src/tools/rust-analyzer/crates/hir-ty/src/infer.rs:2193-2203 \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/tools/rust-analyzer/crates/hir-ty/src/infer.rs"},"region":{"startLine":2163}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cc6a4a4c04c72fceb8251c04a4521cfe9d56a188527afb6152ca75ea5a4d8e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): src/tools/rust-analyzer/crates/hir-ty/src/infer/pat.rs:979-986 | src/tools/rust-analyzer/crates/hir-ty/src/infer/pat.rs:1037-1044 \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/tools/rust-analyzer/crates/hir-ty/src/infer/pat.rs"},"region":{"startLine":979}}}],"partialFingerprints":{"codehealthFindingId/v1":"89f54c3f17fe188c5a38c51afe2ee0afb499701ea1e9182acbade7beb44272fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): src/tools/rust-analyzer/crates/hir/src/lib.rs:3069-3079 | src/tools/rust-analyzer/crates/hir/src/lib.rs:3081-3093 \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/tools/rust-analyzer/crates/hir/src/lib.rs"},"region":{"startLine":3069}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7fc111a404f5f07000fe291da528cd4931f8f092152d41d7d897f831a815f2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/tools/rust-analyzer/crates/ide-assists/src/handlers/add_missing_match_arms.rs:461-467 | src/tools/rust-analyzer/crates/ide-assists/src/handlers/replace_if_let_with_match.rs:366-375 \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/tools/rust-analyzer/crates/ide-assists/src/handlers/add_missing_match_arms.rs"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea9d8a4c3dd161f74e92d43af9ba41c8b3af0aa9bf582eb471dd98d59c98c2e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): compiler/rustc_builtin_macros/src/format_foreign/printf/mod.rs:288-295 | compiler/rustc_builtin_macros/src/format_foreign/shell/mod.rs:55-62 \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":"compiler/rustc_builtin_macros/src/format_foreign/printf/mod.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"919eb95852befe7f10dfde6380024e3ff6d20dfee97a683a6f3b390c58288898"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): compiler/rustc_hir_typeck/src/pat.rs:341-360 | src/tools/rust-analyzer/crates/hir-ty/src/infer/pat.rs:252-271 \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":"compiler/rustc_hir_typeck/src/pat.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"58c22ea9f735987213925bcd9cfe736e92bc922d6359fe34fe7993210112a204"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): compiler/rustc_hir_typeck/src/upvar.rs:2498-2508 | compiler/rustc_hir_typeck/src/upvar.rs:2520-2529 \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":"compiler/rustc_hir_typeck/src/upvar.rs"},"region":{"startLine":2498}}}],"partialFingerprints":{"codehealthFindingId/v1":"b01433aa22d97e988f6991adf89b27cf88cbdd505249ab26e28e36c5bedf3b43"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): compiler/rustc_infer/src/infer/region_constraints/mod.rs:830-837 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/region_constraints/mod.rs:582-591 \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":"compiler/rustc_infer/src/infer/region_constraints/mod.rs"},"region":{"startLine":830}}}],"partialFingerprints":{"codehealthFindingId/v1":"a718d647afcb55b3786cc24ff3feb8e9726a2e750612075fecd91dbb7f94c359"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): compiler/rustc_middle/src/mir/traversal.rs:49-65 | compiler/rustc_middle/src/mir/traversal.rs:359-375 \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":"compiler/rustc_middle/src/mir/traversal.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f93e04eda6437bb764146c545518ccfc0f4ee01c6f62f39e3812fab952a63c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): compiler/rustc_middle/src/ty/util.rs:1116-1122 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/ty.rs:242-248 \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":"compiler/rustc_middle/src/ty/util.rs"},"region":{"startLine":1116}}}],"partialFingerprints":{"codehealthFindingId/v1":"b82fab6b045f5bd973c90771e33b2b854f5f3e364c2e1898b583fb71e026f5b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): library/alloc/src/collections/btree/node.rs:1196-1204 | library/alloc/src/collections/btree/node.rs:1220-1228 | library/alloc/src/collections/btree/node.rs:1263-1272 \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":"library/alloc/src/collections/btree/node.rs"},"region":{"startLine":1196}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fe88c5f3132ddbd01ba0ebc7591a96851c39a1ec1012382ab9679f847b87ef4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): library/alloc/src/collections/vec_deque/mod.rs:1194-1207 | library/alloc/src/collections/vec_deque/mod.rs:1243-1256 \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":"library/alloc/src/collections/vec_deque/mod.rs"},"region":{"startLine":1194}}}],"partialFingerprints":{"codehealthFindingId/v1":"e10717d023ab412133dbd7f92a4f395b86d0bd772b7496be5b04c868615a0a6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): library/alloc/src/rcs/arc.rs:700-714 | library/alloc/src/rcs/arc.rs:923-937 \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":"library/alloc/src/rcs/arc.rs"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"17e624b4feefce408380a0a946a94454dfe237a9eeed8d0d03f3b80e7c3a7aec"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): library/alloc/src/rcs/arc.rs:3382-3399 | library/alloc/src/rcs/rc.rs:3664-3681 \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":"library/alloc/src/rcs/arc.rs"},"region":{"startLine":3382}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6e8c5637b1f3eec1838591a6e480d1ca6262504ae483cb136d184087b0fb044"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): library/core/src/iter/adapters/take.rs:200-211 | library/core/src/iter/adapters/take.rs:218-229 \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":"library/core/src/iter/adapters/take.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"da80a9d20d645709ba82f18f476bb2f5444b85364b6be9fec27474d276fa7b87"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 24\u002B corresponding lines): library/core/src/ptr/mod.rs:1573-1596 | library/core/src/ptr/mod.rs:1710-1751 | library/core/src/ptr/mod.rs:1934-1959 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 24 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/ptr/mod.rs"},"region":{"startLine":1573}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e0c81b984c7b3f276ffe40fe1a0b96d0450ebd3c8fcef8adad4cf0f7b30ac11"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): library/std/src/sys/fd/unix.rs:603-612 | library/std/src/sys/fd/unix.rs:630-643 \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":"library/std/src/sys/fd/unix.rs"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e95310de8d6111061b34918ca043a5e92435c89dcbc655630eec2316301d45c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): library/std/src/sys/process/uefi.rs:266-279 | library/std/src/sys/process/uefi.rs:310-321 \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":"library/std/src/sys/process/uefi.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"04a821e4c27439fb7ace6b1a797f5bde27c447bc13ec7cf44113c584caa3b696"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 10\u002B corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512f.rs:39341-39352 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:39464-39476 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:41583-41592 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:41647-41659 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:41835-41845 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:41901-41914 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":39341}}}],"partialFingerprints":{"codehealthFindingId/v1":"353b421d18b918402ca64b565dbcc362918a837aba34cf27094e1802f6c875ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 10\u002B corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512f.rs:39402-39413 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:39528-39540 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:41709-41718 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:41773-41785 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:41965-41975 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:42031-42044 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":39402}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eadaecf4852fcdfdadb772d8050419f16ed7e17c3d104c4435a9b44f555139c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): library/stdarch/crates/core_arch/src/x86/sse4a.rs:60-66 | library/stdarch/crates/core_arch/src/x86/sse4a.rs:100-106 \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":"library/stdarch/crates/core_arch/src/x86/sse4a.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1a3cc0841500b207e46ff15e991834f0510c8f51c2c77d674adb2a5f0dd87e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): library/stdarch/crates/stdarch-gen-arm/src/typekinds.rs:165-173 | library/stdarch/crates/stdarch-gen-arm/src/typekinds.rs:175-183 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/stdarch-gen-arm/src/typekinds.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0a9f363499fe46d124a77e8d492593cb53424b88cfc68a9c6886407ecfebda0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): src/tools/miri/src/data_structures/dedup_range_map.rs:40-56 | src/tools/miri/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/tools/miri/src/data_structures/dedup_range_map.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"a423669ec1fba8025588a1bb4a4605fabe4d9681469ad4986d4b181c894a6e00"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): src/tools/rust-analyzer/crates/hir-ide/src/display.rs:812-817 | src/tools/rust-analyzer/crates/hir-ide/src/display.rs:1087-1092 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ide/src/display.rs"},"region":{"startLine":812}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ec52ca8bdb5e2bded02b735f8609e4b3a08435326cfb2936bc8d645c95e3e84"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): src/tools/rust-analyzer/crates/hir-ty/src/infer/expr.rs:114-127 | src/tools/rust-analyzer/crates/hir-ty/src/infer/pat.rs:1718-1731 \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/tools/rust-analyzer/crates/hir-ty/src/infer/expr.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"47158d90c42f4acf8bdc84140de5d9dd2ec33967aff7b4a614da586cbf5f3f74"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): compiler/rustc_const_eval/src/util/mod.rs:22-31 | compiler/rustc_const_eval/src/util/mod.rs:36-44 | compiler/rustc_ty_utils/src/consts.rs:16-24 \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":"compiler/rustc_const_eval/src/util/mod.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"bed782e95450fa5b7217aec4832d29a06224c183857777f2e875f85e1c9e7141"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): compiler/rustc_hir_typeck/src/coercion.rs:228-239 | src/tools/rust-analyzer/crates/hir-ty/src/infer/coerce.rs:202-216 \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":"compiler/rustc_hir_typeck/src/coercion.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"74cf3997d825ae987a9eeb624aade1963a00608e469b0ec7341f1a3125da9ecb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): compiler/rustc_hir_typeck/src/expr_use_visitor.rs:602-617 | src/tools/rust-analyzer/crates/hir-ty/src/infer/closure/analysis/expr_use_visitor.rs:712-725 \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":"compiler/rustc_hir_typeck/src/expr_use_visitor.rs"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"36d5796f1f0172d55178bb45078d797f3087560616946d51abbd5e574d1c263d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): compiler/rustc_middle/src/traits/mod.rs:484-498 | compiler/rustc_middle/src/traits/mod.rs:515-525 \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":"compiler/rustc_middle/src/traits/mod.rs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0d34812db222393c86dc73de438f613af401e8be1dea5965cf9a4ee5069f7b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): compiler/rustc_middle/src/ty/generic_args.rs:350-356 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/generic_arg.rs:394-400 \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":"compiler/rustc_middle/src/ty/generic_args.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f4a24c31cf43bbff9e559d597d4e73d3fefb9b2341f31180226fa35334750cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): compiler/rustc_type_ir/src/region_constraint.rs:408-417 | compiler/rustc_type_ir/src/region_constraint.rs:492-501 \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":"compiler/rustc_type_ir/src/region_constraint.rs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3801d20d6e3886d9a252504e5682f21bbed90ad53ac4faaccbabdb0502d957d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 8\u002B corresponding lines): library/std/src/sys/net/connection/xous/tcpstream.rs:345-352 | library/std/src/sys/net/connection/xous/tcpstream.rs:375-382 | library/std/src/sys/net/connection/xous/tcpstream.rs:393-403 | library/std/src/sys/net/connection/xous/udp.rs:367-377 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/net/connection/xous/tcpstream.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"86bdac14003c64ebfed1976a3c10cd01c68a24ace09258dd3e6a3536f945656f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (8 members, 9\u002B corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512fp16.rs:5535-5543 | library/stdarch/crates/core_arch/src/x86/avx512fp16.rs:5633-5642 | library/stdarch/crates/core_arch/src/x86/avx512fp16.rs:6050-6058 | library/stdarch/crates/core_arch/src/x86/avx512fp16.rs:6148-6157 | library/stdarch/crates/core_arch/src/x86/avx512fp16.rs:6556-6564 | library/stdarch/crates/core_arch/src/x86/avx512fp16.rs:6654-6663 | library/stdarch/crates/core_arch/src/x86/avx512fp16.rs:7070-7078 | library/stdarch/crates/core_arch/src/x86/avx512fp16.rs:7168-7177 \u2014 These 8 members are one piece of code written 8 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 8 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512fp16.rs"},"region":{"startLine":5535}}}],"partialFingerprints":{"codehealthFindingId/v1":"58235784ce6364ab0748b02ff680431c5fb5f36905f97f2ad2895529c5ede07e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 11\u002B corresponding lines): library/stdarch/crates/core_arch/src/x86/gfni.rs:270-280 | library/stdarch/crates/core_arch/src/x86/gfni.rs:352-362 | library/stdarch/crates/core_arch/src/x86/gfni.rs:434-444 | library/stdarch/crates/core_arch/src/x86/gfni.rs:520-530 | library/stdarch/crates/core_arch/src/x86/gfni.rs:608-618 | library/stdarch/crates/core_arch/src/x86/gfni.rs:696-706 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/gfni.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"b91e72d5e538201eb871a810b8e04e1b4789cf3045f63472c1ba218483cf3c62"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): library/stdarch/crates/core_arch/src/x86/sse2.rs:1655-1663 | library/stdarch/crates/core_arch/src/x86/sse2.rs:1712-1720 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/sse2.rs"},"region":{"startLine":1655}}}],"partialFingerprints":{"codehealthFindingId/v1":"22c2e10c7bf6e8be87a1259fe83eec2f5d1b8a8f5bb3e0702bdca54e63c39809"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): src/tools/miri/src/shims/unix/linux_like/eventfd.rs:57-69 | src/tools/miri/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/tools/miri/src/shims/unix/linux_like/eventfd.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"64c782578bd22a7962aef4e656f665cbeb49b200fa727dc4228967b2555b041c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/tools/rust-analyzer/crates/hir-ty/src/infer.rs:2246-2254 | src/tools/rust-analyzer/crates/hir-ty/src/mir/lower.rs:1524-1532 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/infer.rs"},"region":{"startLine":2246}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaabfb608cba7804694b531c52d1758b94d67e93de3db171d351489d48370b28"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): src/tools/rust-analyzer/crates/ide-completion/src/completions.rs:232-245 | src/tools/rust-analyzer/crates/ide-completion/src/completions.rs:253-266 \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/tools/rust-analyzer/crates/ide-completion/src/completions.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"a64127218f9800fac028b14524ef53df112adb9ed5a7bcc42d53acb31a090e35"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): src/tools/rust-analyzer/crates/proc-macro-api/src/bidirectional_protocol.rs:100-111 | src/tools/rust-analyzer/crates/proc-macro-api/src/bidirectional_protocol.rs:117-130 | src/tools/rust-analyzer/crates/proc-macro-api/src/bidirectional_protocol.rs:137-148 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/proc-macro-api/src/bidirectional_protocol.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"37b4f6083f68a067c05c00f6935caad9d15ff5f88bee560d19b066273d62535d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/tools/rust-analyzer/crates/syntax-bridge/src/lib.rs:183-191 | src/tools/rust-analyzer/crates/syntax-bridge/src/lib.rs:198-206 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/syntax-bridge/src/lib.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4803afe0bfd951172288879faf51cd17bb80d5de86a3a6045e5824fbbf13e39"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/tools/rust-analyzer/crates/syntax/src/ast/node_ext.rs:1027-1033 | src/tools/rust-analyzer/crates/syntax/src/ast/node_ext.rs:1035-1041 \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/tools/rust-analyzer/crates/syntax/src/ast/node_ext.rs"},"region":{"startLine":1027}}}],"partialFingerprints":{"codehealthFindingId/v1":"808d835194d14be1e94e4db052d4d15f27ba1f43005ce0ddbe0393635be3ea9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/tools/rust-analyzer/crates/syntax/src/syntax_editor.rs:150-158 | src/tools/rust-analyzer/crates/syntax/src/syntax_editor.rs:192-200 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/syntax/src/syntax_editor.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"59b305d2c9b8e75ba17b7772ba0efa55db186fc31ede99027230d418d46dab2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/tools/rust-analyzer/lib/expect-test/src/lib.rs:485-496 | src/tools/rust-analyzer/lib/expect-test/src/lib.rs:497-505 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/lib/expect-test/src/lib.rs"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dd179ccca903de509355aa430ac5f9864675d4ba09ffce1d96726bbd811a5ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): src/tools/rust-analyzer/xtask/src/codegen/grammar.rs:742-754 | src/tools/rust-analyzer/xtask/src/codegen/grammar.rs:756-768 \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/tools/rust-analyzer/xtask/src/codegen/grammar.rs"},"region":{"startLine":742}}}],"partialFingerprints":{"codehealthFindingId/v1":"9781afe57ada7a0a7773d1ab14d04d36540afaed0a96748279ef26495cb73b69"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): compiler/rustc_ast_pretty/src/pprust/state/item.rs:837-853 | compiler/rustc_hir_pretty/src/lib.rs:2517-2531 \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":"compiler/rustc_ast_pretty/src/pprust/state/item.rs"},"region":{"startLine":837}}}],"partialFingerprints":{"codehealthFindingId/v1":"d34822ef2491d509f79f755a2b7d3833a55384110d0ff871da939dea8ccb2274"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): compiler/rustc_hir_analysis/src/check/compare_impl_item.rs:2269-2282 | compiler/rustc_hir_analysis/src/check/compare_impl_item.rs:2462-2469 \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":"compiler/rustc_hir_analysis/src/check/compare_impl_item.rs"},"region":{"startLine":2269}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbd56e0e163e7611595e534298b582ad3d63040cb1b1c9ee724699d6ca7dc8b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): compiler/rustc_mir_transform/src/add_subtyping_projections.rs:59-67 | compiler/rustc_mir_transform/src/deref_separator.rs:88-98 | compiler/rustc_mir_transform/src/move_elimination.rs:953-960 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/add_subtyping_projections.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc4f8fa6f374d898661df2d0097b49723d3e60e37f5750b81499013c5748cbf3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): compiler/rustc_parse_format/src/lib.rs:925-941 | compiler/rustc_parse_format/src/lib.rs:943-958 \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":"compiler/rustc_parse_format/src/lib.rs"},"region":{"startLine":925}}}],"partialFingerprints":{"codehealthFindingId/v1":"6881ef759eb8b19f0009bc71bb9531f8cfdbdf3ccd0808460be7bec3e73bf8fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): compiler/rustc_passes/src/input_stats.rs:249-273 | compiler/rustc_passes/src/input_stats.rs:577-605 \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":"compiler/rustc_passes/src/input_stats.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6db1a082918ad52539fd647cbe3018b1f9629f9013c45fe7acd84936bdba847"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): library/alloc/src/boxed.rs:1270-1281 | library/alloc/src/rcs/arc.rs:1452-1463 | library/alloc/src/rcs/rc.rs:1295-1306 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/alloc/src/boxed.rs"},"region":{"startLine":1270}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbc8693cb8d206d1bdbc6d9b29d42fb0602be98673b54a357c3356e950c62133"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): library/alloc/src/collections/vec_deque/mod.rs:1899-1908 | library/alloc/src/collections/vec_deque/mod.rs:1939-1949 \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":"library/alloc/src/collections/vec_deque/mod.rs"},"region":{"startLine":1899}}}],"partialFingerprints":{"codehealthFindingId/v1":"23c3c1d2b70c8b945a6ecf5c0ebb22f8b4462ee601e922c5225f672608d9ddbf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): library/alloc/src/rcs/arc.rs:4820-4832 | library/alloc/src/rcs/arc.rs:4838-4850 \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":"library/alloc/src/rcs/arc.rs"},"region":{"startLine":4820}}}],"partialFingerprints":{"codehealthFindingId/v1":"78cfb0108e451d6d3d22a5ba1fc8763f56e357c15fa712545fe3022b2147ea3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): library/std/src/sys/env/solid.rs:76-83 | library/std/src/sys/env/unix.rs:132-139 | library/std/src/sys/env/wasi.rs:94-101 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/env/solid.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"79b49c1e4f5fcf83d0375f6e78d17a6f00fecc77f4a4239aea1c2f75848141be"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512bw.rs:11368-11378 | library/stdarch/crates/core_arch/src/x86/avx512bw.rs:11388-11398 \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":"library/stdarch/crates/core_arch/src/x86/avx512bw.rs"},"region":{"startLine":11368}}}],"partialFingerprints":{"codehealthFindingId/v1":"e78363f2693fbc99aa4e651865a66606f12244338898d4f4f17afdc7633edff3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 11\u002B corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512f.rs:38049-38059 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:38131-38141 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:38213-38223 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:38295-38305 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":38049}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcb0a5db5e6fbf99c8039bc1ff2707d7fe31f9d02ec28f84b83f93136fefd802"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 11\u002B corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512f.rs:38090-38100 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:38172-38182 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:38254-38264 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:38336-38346 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":38090}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a95f4d72836786a482ee50d41446259c70cf35fcefb11a1df8a4ab5b511f685"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 11\u002B corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512fp16.rs:1653-1663 | library/stdarch/crates/core_arch/src/x86/avx512fp16.rs:1994-2004 | library/stdarch/crates/core_arch/src/x86/avx512fp16.rs:2335-2345 | library/stdarch/crates/core_arch/src/x86/avx512fp16.rs:2676-2686 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512fp16.rs"},"region":{"startLine":1653}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ef0f21c312d3018bc904c4d6a1a201a02cc3827ff3550c9f664cc71d9b48562"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/tools/clippy/clippy_lints/src/methods/bind_instead_of_map.rs:63-72 | src/tools/clippy/clippy_lints/src/methods/bind_instead_of_map.rs:74-84 \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/tools/clippy/clippy_lints/src/methods/bind_instead_of_map.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fab791241b4e148557b8e61981e7b32a830ac3f464144872f361b03a26e165b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/tools/clippy/clippy_utils/src/ty/mod.rs:510-519 | src/tools/clippy/clippy_utils/src/ty/mod.rs:523-534 \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/tools/clippy/clippy_utils/src/ty/mod.rs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"42d2b84463bd9e3157bf4018206e57fc02b895862cd7b352b862e6b708f38ffe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): src/tools/miri/src/shims/unix/udp_socket.rs:223-240 | src/tools/miri/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/tools/miri/src/shims/unix/udp_socket.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8eae3c06fe7f888ca0e165e1d764a117f628d3d8cdc4f2f8d74cb80a82c1695"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): src/tools/run-make-support/src/path_helpers.rs:49-60 | src/tools/run-make-support/src/path_helpers.rs:92-103 \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/tools/run-make-support/src/path_helpers.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"135584595e3f1dd11f9f7ff2b7211cb9f74de3425a040f0f4698f3c3c447eb2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): src/tools/rust-analyzer/crates/hir-ide/src/diagnostics/decl_check.rs:645-662 | src/tools/rust-analyzer/crates/hir-ide/src/diagnostics/decl_check.rs:683-698 \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/tools/rust-analyzer/crates/hir-ide/src/diagnostics/decl_check.rs"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"65a4d30e7f20ffc7dd88634d7cf90023e252f3faae5e1981a9923fe1a4b22700"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/tools/rust-analyzer/crates/hir-ty/src/mir/monomorphization.rs:244-250 | src/tools/rust-analyzer/crates/hir-ty/src/mir/monomorphization.rs:268-274 \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/tools/rust-analyzer/crates/hir-ty/src/mir/monomorphization.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"3174fe9b4450aa91fe1a2756c4069cad87ee557a44cb9feabd7814c4e2293385"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): src/tools/rust-analyzer/crates/hir/src/lib.rs:4776-4780 | src/tools/rust-analyzer/crates/hir/src/lib.rs:5123-5128 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir/src/lib.rs"},"region":{"startLine":4776}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aa3dda2439cef7f0616284e70691ccb9c8471ad8fc9bc6c5f379c22a45d646c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/tools/rust-analyzer/crates/ide-diagnostics/src/handlers/undeclared_label.rs:7-16 | src/tools/rust-analyzer/crates/ide-diagnostics/src/handlers/unreachable_label.rs:7-16 \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/tools/rust-analyzer/crates/ide-diagnostics/src/handlers/undeclared_label.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"2edee74a1587ac17059a83485255f3f6a37fa3163ef1d147847c284d5b61214f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): src/tools/rust-analyzer/crates/mbe/src/expander/matcher.rs:271-276 | src/tools/rust-analyzer/crates/mbe/src/expander/matcher.rs:294-299 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/mbe/src/expander/matcher.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"6db4b7802a992b4e23ca7ecfb4df18594e08231df53125078800364871c7cdcb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): src/tools/rust-analyzer/crates/parser/src/grammar/items.rs:368-375 | src/tools/rust-analyzer/crates/parser/src/grammar/items.rs:377-384 \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/tools/rust-analyzer/crates/parser/src/grammar/items.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"45a16847aee6a95ea5eb6fbc1950631fcf3ff0c4b72333d0bafd4e9ccea45a29"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 11\u002B corresponding lines): src/tools/rust-analyzer/crates/rust-analyzer/src/lsp/to_proto.rs:1109-1119 | src/tools/rust-analyzer/crates/rust-analyzer/src/lsp/to_proto.rs:1125-1135 | src/tools/rust-analyzer/crates/rust-analyzer/src/lsp/to_proto.rs:1141-1151 | src/tools/rust-analyzer/crates/rust-analyzer/src/lsp/to_proto.rs:1157-1167 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/lsp/to_proto.rs"},"region":{"startLine":1109}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc91697b9eeca434e14d652138b280dfd5ec29239414865997c42aa6bd2fa5dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/tools/rust-analyzer/lib/lsp-server/src/msg.rs:223-231 | src/tools/rust-analyzer/lib/lsp-server/src/msg.rs:248-256 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/lib/lsp-server/src/msg.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fb278ce3f562c6a8f6b18b23657175c3169fbbad24850a8efdd0a33b6416902"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/tools/rustfmt/src/source_map.rs:39-48 | src/tools/rustfmt/src/source_map.rs:60-69 \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/tools/rustfmt/src/source_map.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"d76af35f789285e3d6b16df3caaad80b1a86a9989a7277fcd494c3260164d087"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): compiler/rustc_attr_parsing/src/check_cfg.rs:80-93 | compiler/rustc_attr_parsing/src/check_cfg.rs:95-108 \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":"compiler/rustc_attr_parsing/src/check_cfg.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"d81b9f86f597a7dc3c2631540f1561fe463f32118a128e30c56f0a038fb74d92"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): compiler/rustc_codegen_cranelift/src/common.rs:437-449 | compiler/rustc_codegen_cranelift/src/global_asm.rs:46-58 | compiler/rustc_codegen_gcc/src/context.rs:597-606 \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":"compiler/rustc_codegen_cranelift/src/common.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"854f69ab88164793ec41b4a254ff96595de36428a6315548b3f3ebc96f5d1bbb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 7\u002B corresponding lines): compiler/rustc_index/src/bit_set.rs:1155-1161 | compiler/rustc_index/src/bit_set.rs:1164-1170 | compiler/rustc_index/src/bit_set.rs:1185-1191 | compiler/rustc_mir_dataflow/src/framework/fmt.rs:141-147 \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":"compiler/rustc_index/src/bit_set.rs"},"region":{"startLine":1155}}}],"partialFingerprints":{"codehealthFindingId/v1":"31fc36c8c06a71f007abb030f884b6a898e6e5b11b641d9d6a043e2acccd47be"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): compiler/rustc_infer/src/infer/freshen.rs:66-77 | compiler/rustc_infer/src/infer/freshen.rs:82-93 \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":"compiler/rustc_infer/src/infer/freshen.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"b219296716bfb494bbc95e000f21486d1409a2530ae507e466065c7b42d73847"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): compiler/rustc_metadata/src/rmeta/decoder/cstore_impl.rs:691-701 | compiler/rustc_metadata/src/rmeta/decoder/cstore_impl.rs:726-737 \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":"compiler/rustc_metadata/src/rmeta/decoder/cstore_impl.rs"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"19c358887f45a368c5482c80eeeb8e4ecad0fd17e48d948608d3e6e6e6e4b9e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): compiler/rustc_middle/src/ty/layout.rs:777-785 | compiler/rustc_middle/src/ty/layout.rs:1470-1480 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/ty/layout.rs"},"region":{"startLine":777}}}],"partialFingerprints":{"codehealthFindingId/v1":"971776c965d90d5f5e75e7a91f147e71ebea917abf3231a9a9dae01f243f163d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): compiler/rustc_passes/src/canonical_symbols.rs:57-71 | compiler/rustc_passes/src/diagnostic_items.rs:58-73 \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":"compiler/rustc_passes/src/canonical_symbols.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"f89133b0436d18c138e5387743dbcb90d044d9ed00c7e112656d3b129ed2bf42"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): compiler/rustc_span/src/lib.rs:1202-1212 | compiler/rustc_span/src/lib.rs:1221-1228 | compiler/rustc_span/src/lib.rs:1237-1244 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_span/src/lib.rs"},"region":{"startLine":1202}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a40b486301fac3af7524c8abc5bfc33857ca75418b5aaaf43ef374b2510ce01"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): library/core/src/array/iter/iter_inner.rs:230-243 | library/core/src/array/iter/iter_inner.rs:288-301 \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":"library/core/src/array/iter/iter_inner.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8d8c53830bae4044b4ec22b1f9a06793e870173fdb4393ef0d5ea16f6a82273"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): library/std/src/os/wasi/fs.rs:406-417 | library/std/src/os/wasi/fs.rs:429-439 \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":"library/std/src/os/wasi/fs.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"8265a7e2b447dfcc443630681ff79f6a46bc0090e3d5f9917ab442adc701d2af"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): library/std/src/sys/net/connection/socket/hermit.rs:246-253 | library/std/src/sys/net/connection/socket/solid.rs:314-322 \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":"library/std/src/sys/net/connection/socket/hermit.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"db29e6a25a3cc28f7a6b24bd37724a38b3050e09b16118d1669b02ae73db17c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx.rs:1479-1489 | library/stdarch/crates/core_arch/src/x86/avx2.rs:1813-1821 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx.rs"},"region":{"startLine":1479}}}],"partialFingerprints":{"codehealthFindingId/v1":"718395853c6d16c1572c288892ef3220c0a72ebd773c9115017fef8b6653907c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 10\u002B corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512f.rs:34802-34811 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:34916-34925 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:35066-35075 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:35221-35230 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":34802}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff7da1bd8994634b79d17b58c0878e3ad4eb95b3996782f81aaa6dfe3a25e013"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 11\u002B corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512f.rs:38811-38827 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:38855-38865 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:38892-38908 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:41022-41032 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:41061-41072 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:41100-41110 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":38811}}}],"partialFingerprints":{"codehealthFindingId/v1":"c966ea7a4928368ebce952094f0e663425eb3b555881feee1ff8f8b7c1c9060a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 11\u002B corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512f.rs:38931-38947 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:38975-38985 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:39012-39028 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:41137-41147 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:41176-41187 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:41215-41225 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":38931}}}],"partialFingerprints":{"codehealthFindingId/v1":"25d6b2c9313029a3474a89459c579d831ca76b8cf91225c1c59ea477e31076a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): library/stdarch/crates/stdarch-gen-hexagon/src/hvx.rs:311-323 | library/stdarch/crates/stdarch-gen-hexagon/src/scalar.rs:215-227 \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":"library/stdarch/crates/stdarch-gen-hexagon/src/hvx.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4704357b21be9a9a4e931673942d6b359c8512bb918fc01d883b04b5c6f06d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/tools/clippy/clippy_lints/src/matches/try_err.rs:93-102 | src/tools/clippy/clippy_lints/src/matches/try_err.rs:105-115 \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/tools/clippy/clippy_lints/src/matches/try_err.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf37c8ed2664f19cde2df67df232894e92de64f3684da945e409786dcf5772e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/tools/miri/src/concurrency/data_race.rs:660-666 | src/tools/miri/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/tools/miri/src/concurrency/data_race.rs"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9234c99c7925bcd18b5191f6d484d2fdb1e22011f02adba262241c06da96f03"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 12\u002B corresponding lines): src/tools/miri/src/shims/unix/sync.rs:578-595 | src/tools/miri/src/shims/unix/sync.rs:597-608 | src/tools/miri/src/shims/unix/sync.rs:614-643 | src/tools/miri/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/tools/miri/src/shims/unix/sync.rs"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"082ebf07b4922d1e3953bccb657c2eb29e141fed4a3f0ed8a1e274a556db68d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/tools/rust-analyzer/crates/hir-ty/src/method_resolution.rs:590-596 | src/tools/rust-analyzer/crates/hir-ty/src/method_resolution.rs:706-712 \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/tools/rust-analyzer/crates/hir-ty/src/method_resolution.rs"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"a186a1291377af85d2af8519df7959fd5141edf0a5e0f72ac8bef58d5d47e27d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): src/tools/rust-analyzer/crates/ide-db/src/syntax_helpers/suggest_name.rs:113-124 | src/tools/rust-analyzer/crates/ide-db/src/syntax_helpers/suggest_name.rs:126-138 \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/tools/rust-analyzer/crates/ide-db/src/syntax_helpers/suggest_name.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf954e4fdb9bd2d7296cedb179c0b5dba35e432856cc37cabee4a925f2f478b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/tools/rust-analyzer/crates/ide-db/src/ty_filter.rs:51-60 | src/tools/rust-analyzer/crates/ide-db/src/ty_filter.rs:73-86 \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/tools/rust-analyzer/crates/ide-db/src/ty_filter.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"89bb429ed1bb7c56da76f7d0a49369468c5707ae88d127f1d43f26824bff7855"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/tools/rust-analyzer/crates/parser/src/shortcuts.rs:117-125 | src/tools/rust-analyzer/crates/parser/src/shortcuts.rs:127-135 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/parser/src/shortcuts.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"62d18b333e91f465aee90c43d394d228111a695a75eb054734a65c1d4f859e0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): src/tools/rust-analyzer/crates/syntax/src/ast/node_ext.rs:1043-1053 | src/tools/rust-analyzer/crates/syntax/src/ast/node_ext.rs:1055-1065 \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/tools/rust-analyzer/crates/syntax/src/ast/node_ext.rs"},"region":{"startLine":1043}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b9360f6f95d859f7f712c41cf61c59bc4f52b471b4bb3d872e3e1820b4b01f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): src/tools/rustfmt/src/macros.rs:788-798 | src/tools/rustfmt/src/macros.rs:800-810 \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/tools/rustfmt/src/macros.rs"},"region":{"startLine":788}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a131bd836c89a08f75927661c2f48beb2013820a2a13a5b80513241fd68a86a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): src/etc/lldb_lookup.py:428-442 | src/etc/lldb_lookup.py:450-464 \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/etc/lldb_lookup.py"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"090209745ae6e7278e7910cd2f2294e04b75f02c7d83130feb11bab5534cc0e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): compiler/rustc_codegen_gcc/src/type_.rs:369-375 | compiler/rustc_codegen_llvm/src/type_.rs:129-135 \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":"compiler/rustc_codegen_gcc/src/type_.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"82e9b65310ad23a5942d83b6d32b0f91177fa22f15ceadb69e6b7cd6dc4196f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): compiler/rustc_hir_pretty/src/lib.rs:1368-1377 | compiler/rustc_hir_pretty/src/lib.rs:2193-2205 \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":"compiler/rustc_hir_pretty/src/lib.rs"},"region":{"startLine":1368}}}],"partialFingerprints":{"codehealthFindingId/v1":"df4e603dd9bfc85908a083fe81dbb6a0c8246a3200ae5d61cd2c8ec89b387a06"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): compiler/rustc_middle/src/mir/statement.rs:263-275 | compiler/rustc_middle/src/mir/statement.rs:279-290 \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":"compiler/rustc_middle/src/mir/statement.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d43002f3dc45f7fb6ad6a646ec300cba19aa162e6c2a26a75521f940ad241b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): compiler/rustc_middle/src/ty/consts/kind.rs:48-60 | compiler/rustc_middle/src/ty/consts/kind.rs:121-130 \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":"compiler/rustc_middle/src/ty/consts/kind.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cdff0ba5ee68586f142ca4ddc9ff6773fe4d8ebf70e5419097d7c80eff98bbb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): compiler/rustc_middle/src/ty/generic_args.rs:342-348 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/generic_arg.rs:386-392 \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":"compiler/rustc_middle/src/ty/generic_args.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1c8e4946440a657d3ae2c926ade1f7e509fded67fb8ec927215ee378e44d1ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): compiler/rustc_public/src/compiler_interface.rs:288-296 | compiler/rustc_public/src/compiler_interface.rs:299-307 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_public/src/compiler_interface.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a2784d64a9d13ecc10c4f68780885c33c83e5999dfadd169199942ab2b5d99e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): compiler/rustc_session/src/options.rs:1201-1211 | compiler/rustc_session/src/options.rs:1213-1223 \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":"compiler/rustc_session/src/options.rs"},"region":{"startLine":1201}}}],"partialFingerprints":{"codehealthFindingId/v1":"6139a7a9f4bbe52f233102728be4a6bbb242b1e2f140602c283d1eb3b3111a7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 17\u002B corresponding lines): compiler/rustc_session/src/options.rs:1410-1426 | compiler/rustc_session/src/options.rs:1837-1853 | compiler/rustc_session/src/options.rs:1855-1873 | compiler/rustc_session/src/options.rs:2113-2131 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 17 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_session/src/options.rs"},"region":{"startLine":1410}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d18b01e60283f99ac9de3dbc3f481a49f6ff38383c0d8fea9a171f60d85c47d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): compiler/rustc_trait_selection/src/traits/mod.rs:98-109 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/errors.rs:39-49 \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":"compiler/rustc_trait_selection/src/traits/mod.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5ebf9d9c10fd38c89d8afad9ca8797e3f1f23d8c128c363b565373cdac08136"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): library/alloc/src/collections/linked_list.rs:83-94 | library/alloc/src/collections/linked_list.rs:120-131 \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":"library/alloc/src/collections/linked_list.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"599e9efc1882b8112be920b915bf0a985e48ab9d9d7f88b24c63593a9a0af6a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): library/alloc/src/collections/vec_deque/into_iter.rs:59-69 | library/alloc/src/collections/vec_deque/into_iter.rs:187-197 \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":"library/alloc/src/collections/vec_deque/into_iter.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cced4614413868289e4da5d2b28af30776fb13174999e7593e7d46d6a1fa23a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): library/std/src/os/fortanix_sgx/io.rs:128-137 | library/std/src/os/fortanix_sgx/io.rs:142-150 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/os/fortanix_sgx/io.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5b77296c4bfecba8be33c7e7f263cd30566d4b55e2473d75a9bc3c6ad84f371"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): library/std/src/os/unix/net/datagram.rs:101-110 | library/std/src/os/unix/net/stream.rs:119-127 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/os/unix/net/datagram.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc568a4d0f415dc47081e9c1c0f305ad1f80dc3e154464dd9af5c008a869b15e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): library/std/src/os/unix/net/datagram.rs:535-549 | library/std/src/os/unix/net/datagram.rs:573-585 \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":"library/std/src/os/unix/net/datagram.rs"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf0b96f7da3fd9d88d55ee7b95e577476b11ff271ad3e6442ff5d021a20dfb84"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): library/std/src/sys/env/uefi.rs:109-114 | library/std/src/sys/fs/uefi.rs:800-806 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/env/uefi.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"347c7b4c359b63f117aceac3415a28fce41bd812b9284a3156258e5191858b53"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 5\u002B corresponding lines): library/std/src/sys/fs/uefi.rs:808-812 | library/std/src/sys/fs/uefi.rs:814-822 | library/std/src/sys/fs/uefi.rs:824-828 | library/std/src/sys/net/connection/uefi/tcp4.rs:385-394 | library/std/src/sys/net/connection/uefi/tcp4.rs:421-426 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 5 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/fs/uefi.rs"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e75087176ad57e76a7e5ef4339ab1f44e33e8fb54b7947e2964639ebe13dbef"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): library/stdarch/crates/core_arch/src/powerpc/altivec.rs:4189-4199 | library/stdarch/crates/core_arch/src/powerpc/altivec.rs:4205-4216 \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":"library/stdarch/crates/core_arch/src/powerpc/altivec.rs"},"region":{"startLine":4189}}}],"partialFingerprints":{"codehealthFindingId/v1":"7807f63114b020057dd194a121623aebc8284b053452462fec3d23521e050d3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512dq.rs:1899-1908 | library/stdarch/crates/core_arch/src/x86/avx512dq.rs:2116-2126 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:26004-26015 \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":"library/stdarch/crates/core_arch/src/x86/avx512dq.rs"},"region":{"startLine":1899}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbf0c782c7101a4666029737913765848a63f9f61f8f6561e0f54de081d59544"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 10\u002B corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512f.rs:6947-6956 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:7014-7023 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:7081-7090 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:7148-7157 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:7215-7224 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:7282-7291 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":6947}}}],"partialFingerprints":{"codehealthFindingId/v1":"621d7e80fd5985069d1093ab9776f151f369919ec9148196e3f83add411fd123"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 10\u002B corresponding lines): library/stdarch/crates/core_arch/src/x86/gfni.rs:301-310 | library/stdarch/crates/core_arch/src/x86/gfni.rs:383-392 | library/stdarch/crates/core_arch/src/x86/gfni.rs:465-474 | library/stdarch/crates/core_arch/src/x86/gfni.rs:553-562 | library/stdarch/crates/core_arch/src/x86/gfni.rs:641-650 | library/stdarch/crates/core_arch/src/x86/gfni.rs:729-738 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/gfni.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3b6737fcf503fc3fdf1ae911caea984313a43df3231e5ec6f53723e27957479"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): src/tools/clippy/clippy_lints/src/arbitrary_source_item_ordering.rs:202-214 | src/tools/clippy/clippy_lints/src/arbitrary_source_item_ordering.rs:265-277 \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/tools/clippy/clippy_lints/src/arbitrary_source_item_ordering.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"53dc9091decadd72eea95abb1f291237d2ed5ed3459645201625ac17c8979c56"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): src/tools/clippy/clippy_lints/src/await_holding_invalid.rs:294-299 | src/tools/clippy/clippy_lints/src/entry.rs:762-767 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/await_holding_invalid.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"08f46178fc0fc29c0be0606cac6aaeab7ac78d75ea23a641491454d8144e7801"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): src/tools/clippy/clippy_lints/src/implicit_return.rs:45-58 | src/tools/clippy/clippy_lints/src/implicit_return.rs:60-78 \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/tools/clippy/clippy_lints/src/implicit_return.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"dec4a32f8555d4cc5224a7f3d88af7c1b6434f855fd4b3c89c0a2c14981ce266"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): src/tools/clippy/clippy_lints/src/needless_pass_by_ref_mut.rs:454-470 | src/tools/clippy/clippy_lints/src/needless_pass_by_ref_mut.rs:472-487 | src/tools/clippy/clippy_lints/src/needless_pass_by_ref_mut.rs:514-529 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/needless_pass_by_ref_mut.rs"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"52470107b475dae1fb463dd0ade9bd2e4eee40f32dc35364c4170ab101460861"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): src/tools/clippy/clippy_lints/src/single_component_path_imports.rs:104-112 | src/tools/clippy/clippy_lints/src/single_component_path_imports.rs:114-121 \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/tools/clippy/clippy_lints/src/single_component_path_imports.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cc467fa5e6fcd2791f77ab5fef46867194c5af35fad3feb65009fb2aded19f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): src/tools/clippy/clippy_lints/src/suspicious_operation_groupings.rs:386-398 | src/tools/rust-analyzer/crates/ide/src/highlight_related.rs:662-669 \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/tools/clippy/clippy_lints/src/suspicious_operation_groupings.rs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1b81448955c7a652a10e6365edc806de938f830fc6e70c73250f9c660ff3e62"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): src/tools/rust-analyzer/crates/hir/src/lib.rs:4914-4926 | src/tools/rust-analyzer/crates/hir/src/lib.rs:4951-4965 \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/tools/rust-analyzer/crates/hir/src/lib.rs"},"region":{"startLine":4914}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fafd89b2d2ee10290d2ff4f47e0983adaa322bffc01cd5d308e0092c476c730"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/tools/rust-analyzer/xtask/src/metrics.rs:89-104 | src/tools/rust-analyzer/xtask/src/metrics.rs:121-129 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/xtask/src/metrics.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"439ce1ce06530491193ca3b6df555257c6e0b8cee42d272ca879f0e19a7f1b01"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): compiler/rustc_borrowck/src/region_infer/opaque_types/mod.rs:443-452 | compiler/rustc_middle/src/ty/opaque_types.rs:53-88 \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":"compiler/rustc_borrowck/src/region_infer/opaque_types/mod.rs"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2834e5e1ed3d4662f6a6aab84a32216b659f4fe5630fad6d956b99229bccf80"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): compiler/rustc_data_structures/src/sso/map.rs:258-266 | compiler/rustc_data_structures/src/sso/map.rs:270-277 \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":"compiler/rustc_data_structures/src/sso/map.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6e7f39246943795742400b936c4bc3878b5810a66593c4adc0de1726e6adacf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): compiler/rustc_hir_analysis/src/variance/constraints.rs:187-202 | src/tools/rust-analyzer/crates/hir-ty/src/variance.rs:282-292 \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":"compiler/rustc_hir_analysis/src/variance/constraints.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d502423ddb62f8b1876fd6d07a44e0079bf8e7d76e1570150b5bf99b8219da4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): compiler/rustc_hir_typeck/src/demand.rs:192-198 | compiler/rustc_hir_typeck/src/demand.rs:220-227 \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":"compiler/rustc_hir_typeck/src/demand.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c8058791329e6065176ea9f0e56d0e3af1fc68854ce12d7565b13f72c5bec14"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): compiler/rustc_hir_typeck/src/expr_use_visitor.rs:1561-1572 | compiler/rustc_hir_typeck/src/expr_use_visitor.rs:1576-1582 \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":"compiler/rustc_hir_typeck/src/expr_use_visitor.rs"},"region":{"startLine":1561}}}],"partialFingerprints":{"codehealthFindingId/v1":"c67c6b331ba38d03640e0c3908a94814ca9a9d161bc2b15327b138c794363dcf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): compiler/rustc_mir_transform/src/gvn.rs:443-450 | compiler/rustc_mir_transform/src/gvn.rs:453-463 \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":"compiler/rustc_mir_transform/src/gvn.rs"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"e90a0b1c2d878a7b8598f731d0e8ddb59e13712be71d072804abc5f42a0a05cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 15\u002B corresponding lines): compiler/rustc_mir_transform/src/patch.rs:86-100 | compiler/rustc_mir_transform/src/patch.rs:102-116 | compiler/rustc_mir_transform/src/patch.rs:118-132 | compiler/rustc_mir_transform/src/patch.rs:134-150 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/patch.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"346559ca2c23a5c09127092b2e6dd2288eb2f0312ed54027c50a314a361ea3d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): compiler/rustc_public/src/compiler_interface.rs:703-709 | compiler/rustc_public/src/compiler_interface.rs:735-742 | compiler/rustc_public/src/compiler_interface.rs:843-850 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_public/src/compiler_interface.rs"},"region":{"startLine":703}}}],"partialFingerprints":{"codehealthFindingId/v1":"0566864d693eb040c4a2f8678691a99c3327c59ddcd5329dc8dad4e5c922beff"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): compiler/rustc_trait_selection/src/solve/fulfill.rs:113-121 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/mod.rs:1270-1278 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/solve/fulfill.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"f759d0f1233a6557b760cd9b055db7e6456005397654e344017787f8d8d90a18"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): library/alloc/src/rcs/arc.rs:4350-4370 | library/alloc/src/rcs/rc.rs:3315-3335 \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":"library/alloc/src/rcs/arc.rs"},"region":{"startLine":4350}}}],"partialFingerprints":{"codehealthFindingId/v1":"204bdd4e8f76bedf609c7f47936b13f5df9f48f29e7abac5c9f10627110098a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): library/compiler-builtins/compiler-builtins/src/float/conv.rs:94-103 | library/compiler-builtins/compiler-builtins/src/float/conv.rs:150-159 \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":"library/compiler-builtins/compiler-builtins/src/float/conv.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cd649c4a458c9f766f5a8d63bef351d704c0599ae751fe1b91d509953cd5fa3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): library/core/src/slice/iter.rs:1678-1689 | library/core/src/slice/iter.rs:2493-2505 | library/core/src/slice/iter.rs:2865-2876 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/slice/iter.rs"},"region":{"startLine":1678}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a85db2ee79e085ac7d12ee26358ba5652b83ba333ef1bc186a2ada3cb032604"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): library/proc_macro/src/bridge/server.rs:287-291 | library/proc_macro/src/bridge/server.rs:303-313 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/proc_macro/src/bridge/server.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"69c3d2254d6e93ebabca5537a68d6ee001b5b68560613233a6758a15637a94bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): library/std/src/sync/nonpoison/mutex.rs:440-451 | library/std/src/sync/nonpoison/rwlock.rs:579-590 \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":"library/std/src/sync/nonpoison/mutex.rs"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"afc7a634d1501f1f0456a1e1a6385d2678f94236894450ba080a6092d45f2283"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): library/std/src/sync/poison/mutex.rs:902-916 | library/std/src/sync/poison/rwlock.rs:1069-1083 \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":"library/std/src/sync/poison/mutex.rs"},"region":{"startLine":902}}}],"partialFingerprints":{"codehealthFindingId/v1":"540f0da4ff43fac60a3460eac89670feecef9a46bdda63b5e8a0caffd5a2ba4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): library/std/src/sys/fd/unix.rs:383-392 | library/std/src/sys/fd/unix.rs:440-450 \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":"library/std/src/sys/fd/unix.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbdda109d32daf1378b052da7a8ccdd2ef1f94cd4b7d872cc7fdacdd314e265b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 10\u002B corresponding lines): library/std/src/sys/net/connection/xous/tcpstream.rs:149-160 | library/std/src/sys/net/connection/xous/tcpstream.rs:162-173 | library/std/src/sys/net/connection/xous/udp.rs:331-340 | library/std/src/sys/net/connection/xous/udp.rs:342-351 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/net/connection/xous/tcpstream.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"994de9bf628bcd7cfe5515c790d8004016c5a09d175dbde6abd78917366913aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx2.rs:1131-1139 | library/stdarch/crates/core_arch/src/x86/avx2.rs:1157-1165 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx2.rs"},"region":{"startLine":1131}}}],"partialFingerprints":{"codehealthFindingId/v1":"187cf10155e608583b8aa7dfe5095093fafc737fc3e2b9d07eb9d270e2414f35"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): src/tools/clippy/clippy_dev/src/parse/cursor.rs:293-308 | src/tools/clippy/clippy_dev/src/parse/cursor.rs:313-328 \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/tools/clippy/clippy_dev/src/parse/cursor.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"795a4b43312fa215badb09875ef76a85c6618be7b627854e63a8485a6cc6be70"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): src/tools/clippy/clippy_lints/src/empty_line_after.rs:544-548 | src/tools/clippy/clippy_lints/src/empty_line_after.rs:550-554 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/empty_line_after.rs"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"92e0d396d2d16d4c8209f7cbd11efbf0146f4145026f3a874982bdef6d7ffbf0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): src/tools/clippy/clippy_lints/src/methods/manual_saturating_arithmetic.rs:21-36 | src/tools/clippy/clippy_lints/src/methods/manual_saturating_arithmetic.rs:43-58 \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/tools/clippy/clippy_lints/src/methods/manual_saturating_arithmetic.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ec71c77036612f097b536d38cdc0259b7bb4c602ef6eb7822f2ab9157b6690b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): src/tools/rust-analyzer/crates/ide-assists/src/handlers/sort_items.rs:178-188 | src/tools/rust-analyzer/crates/ide-assists/src/handlers/sort_items.rs:190-200 \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/tools/rust-analyzer/crates/ide-assists/src/handlers/sort_items.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"433a83c3fc8894e9577017fde76f4ef9b20050abad4257495043a51bc0dd6606"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/tools/rust-analyzer/crates/ide-db/src/syntax_helpers/node_ext.rs:45-60 | src/tools/rust-analyzer/crates/ide/src/highlight_related.rs:775-784 \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/tools/rust-analyzer/crates/ide-db/src/syntax_helpers/node_ext.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a49a60107b9d46bd868fc6213bdc5621bb2c8bb6093674120bcbc9879e49692"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): compiler/rustc_data_structures/src/sharded.rs:118-123 | compiler/rustc_data_structures/src/sharded.rs:126-131 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_data_structures/src/sharded.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b82f90c195cbda697f1d5bd53f9c020965e23722765aaf6eaf9e7734b4b8536"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): compiler/rustc_hir_typeck/src/pat.rs:3038-3048 | src/tools/rust-analyzer/crates/hir-ty/src/infer/pat.rs:1534-1544 \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":"compiler/rustc_hir_typeck/src/pat.rs"},"region":{"startLine":3038}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcabfcff6baa13ff32cc78b0675942cb449b19af8ea437918efe8fdbe586167a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): compiler/rustc_mir_build/src/check_tail_calls.rs:212-226 | compiler/rustc_mir_build/src/check_tail_calls.rs:271-285 \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":"compiler/rustc_mir_build/src/check_tail_calls.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"06cedec0bfeb8e7686dbc353e1ed847bfef4366e76b382f1d6568983e320b3b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): compiler/rustc_session/src/parse.rs:115-123 | compiler/rustc_session/src/parse.rs:140-145 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_session/src/parse.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd5def94a506c919368d8a3398c61d2d8189f3c659169210446013bdccd07356"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): library/alloc/src/collections/btree/navigate.rs:818-830 | library/alloc/src/collections/btree/navigate.rs:841-853 \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":"library/alloc/src/collections/btree/navigate.rs"},"region":{"startLine":818}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ced287576b5bd6e00e8a794ab4bc748821862e03f4fe20e62bbd422948e4a2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): library/alloc/src/rcs/rc.rs:3936-3956 | library/alloc/src/rcs/rc.rs:3969-3989 \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":"library/alloc/src/rcs/rc.rs"},"region":{"startLine":3936}}}],"partialFingerprints":{"codehealthFindingId/v1":"b91c6c7ef02b3edced709598dadce6f67cfab5b5a0059881031c9ffba34edbf6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): library/std/src/sys/net/connection/uefi/tcp.rs:17-27 | library/std/src/sys/net/connection/uefi/tcp.rs:29-38 \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":"library/std/src/sys/net/connection/uefi/tcp.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"d388e6281ba338d1de2f87b4501cee12181ae5b998bee7a26d2d6a6aa527b840"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 15\u002B corresponding lines): library/stdarch/crates/core_arch/src/x86/avx.rs:1191-1205 | library/stdarch/crates/core_arch/src/x86/avx2.rs:2365-2381 | library/stdarch/crates/core_arch/src/x86/avx2.rs:2407-2421 | library/stdarch/crates/core_arch/src/x86/sse2.rs:1559-1575 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx.rs"},"region":{"startLine":1191}}}],"partialFingerprints":{"codehealthFindingId/v1":"3759be264dc701622054eefa6a9ec206c80b1f50698c41b580eb9818a3f14ed2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 10\u002B corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512f.rs:6521-6530 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:6545-6554 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:6569-6578 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:10728-10738 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:10754-10764 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:10780-10790 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":6521}}}],"partialFingerprints":{"codehealthFindingId/v1":"da198c1c19b215549d7c752aacff55d79eb7297bb5ac8e0265804c1e622451a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 10\u002B corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512f.rs:6722-6731 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:6746-6755 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:6770-6779 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:10805-10815 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:10831-10841 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:10857-10867 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":6722}}}],"partialFingerprints":{"codehealthFindingId/v1":"261a6627b7b9d496a62e184ac7cbaa7dc01aaf908ce4a0b8322da040a606421c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512f.rs:7336-7351 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:7640-7655 \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":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":7336}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2551fa47f067a10b61163f3d7967fab0cffd4adeb08af7f5d14fdce674d5260"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512f.rs:17339-17347 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:17383-17391 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:17427-17435 \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":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":17339}}}],"partialFingerprints":{"codehealthFindingId/v1":"21ef0b5b54e3f56322e1d069eaf62ebb89ce44e9664206d369eada4865dd2375"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): src/tools/clippy/clippy_utils/src/higher.rs:306-320 | src/tools/clippy/clippy_utils/src/higher.rs:324-341 \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/tools/clippy/clippy_utils/src/higher.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aa6e25e5a060c66357ecc8a489f1bd8420b26c0dbf5b5275d2eba9be35534a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): src/tools/clippy/clippy_utils/src/lib.rs:2258-2268 | src/tools/clippy/clippy_utils/src/lib.rs:2284-2294 \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/tools/clippy/clippy_utils/src/lib.rs"},"region":{"startLine":2258}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8aa3eaa081964e612723d5c6ea352c6fca4278e45ffe56354a66a4de82853a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/tools/miri/src/concurrency/data_race.rs:562-568 | src/tools/miri/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/tools/miri/src/concurrency/data_race.rs"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"311ed0201b8bddeb5e51ad3f32a6c6f0e83620e3697aed906f220802a3fda041"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 7\u002B corresponding lines): src/tools/miri/src/intrinsics/x86/mod.rs:1445-1451 | src/tools/miri/src/intrinsics/x86/mod.rs:1464-1470 | src/tools/miri/src/intrinsics/x86/mod.rs:1483-1489 | src/tools/miri/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/tools/miri/src/intrinsics/x86/mod.rs"},"region":{"startLine":1445}}}],"partialFingerprints":{"codehealthFindingId/v1":"d257e2d1f24c0a748161fed70ad69431da306d573f94cd222e1e56ba7fe22e59"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 16\u002B corresponding lines): src/tools/miri/src/shims/unix/sync.rs:555-572 | src/tools/miri/src/shims/unix/sync.rs:672-689 | src/tools/miri/src/shims/unix/sync.rs:841-857 | src/tools/miri/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/tools/miri/src/shims/unix/sync.rs"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"50144ac69b99fa70538e518b0f6f1d4a9e516f088355dac5177ca78680e860ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/tools/rust-analyzer/crates/hir/src/lib.rs:1901-1909 | src/tools/rust-analyzer/crates/hir/src/lib.rs:5868-5876 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir/src/lib.rs"},"region":{"startLine":1901}}}],"partialFingerprints":{"codehealthFindingId/v1":"327673ec25c75c32c6679a6e34e32e910d16bbe125aec35c9f82e4ce534087cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 5\u002B corresponding lines): src/tools/rust-analyzer/crates/hir/src/semantics/source_to_def.rs:485-489 | src/tools/rust-analyzer/crates/hir/src/semantics/source_to_def.rs:494-498 | src/tools/rust-analyzer/crates/hir/src/semantics/source_to_def.rs:503-507 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 5 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir/src/semantics/source_to_def.rs"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf9baa5d5c293b965f89fd0da41ca64907d9db1f781c41a9cc91a10db81fc716"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 14\u002B corresponding lines): src/tools/rust-analyzer/crates/ide-completion/src/completions.rs:302-315 | src/tools/rust-analyzer/crates/ide-completion/src/completions.rs:323-337 | src/tools/rust-analyzer/crates/ide-completion/src/completions.rs:346-361 | src/tools/rust-analyzer/crates/ide-completion/src/completions.rs:474-489 | src/tools/rust-analyzer/crates/ide-completion/src/completions.rs:497-511 | src/tools/rust-analyzer/crates/ide-completion/src/completions.rs:519-532 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-completion/src/completions.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"3571c9f16052470646f2eba5f375bbd85d24d6ef602a83e2650f0f8b85dacb7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 12\u002B corresponding lines): src/tools/rust-analyzer/crates/parser/src/grammar.rs:128-139 | src/tools/rust-analyzer/crates/parser/src/grammar.rs:141-152 | src/tools/rust-analyzer/crates/parser/src/grammar.rs:154-165 | src/tools/rust-analyzer/crates/parser/src/grammar.rs:167-178 \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/tools/rust-analyzer/crates/parser/src/grammar.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f1a8f93c2c688ddf2fcbfcb7aa826329b78612ea8bd003ccf2bfbb3e4a0f7ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): src/tools/rust-analyzer/crates/parser/src/grammar/expressions/atom.rs:702-709 | src/tools/rust-analyzer/crates/parser/src/grammar/expressions/atom.rs:715-724 \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/tools/rust-analyzer/crates/parser/src/grammar/expressions/atom.rs"},"region":{"startLine":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"898c937286da5e10a9ddb03b829d17c0cf5355c87906d322f190a431679a65f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): src/tools/rust-analyzer/crates/parser/src/grammar/patterns.rs:450-457 | src/tools/rust-analyzer/crates/parser/src/grammar/types.rs:208-218 \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/tools/rust-analyzer/crates/parser/src/grammar/patterns.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"d13909415ce7f60519d80d7d2a239d5f87b7a4aa23f0ffd86f1bead9d00b4af8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): src/tools/rust-analyzer/crates/project-model/src/sysroot.rs:78-85 | src/tools/rust-analyzer/crates/project-model/src/sysroot.rs:98-105 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/project-model/src/sysroot.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"80963257b0f9dc1c2d85a9f83b9698b9c69a5d37abad9a5b4a6106c0e7e7377a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): src/tools/rustfmt/src/modules.rs:607-619 | src/tools/rustfmt/src/modules.rs:621-633 \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/tools/rustfmt/src/modules.rs"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca7fb3b0e29d5738d664e423f4592ea3d16aa88a04e8c1b8d762e29f4d84270b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): compiler/rustc_abi/src/lib.rs:753-763 | compiler/rustc_abi/src/lib.rs:773-783 | compiler/rustc_abi/src/lib.rs:793-801 \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":"compiler/rustc_abi/src/lib.rs"},"region":{"startLine":753}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f366d9038567bc269506e081e2b21e020078612e9967a02428fc6be6ebd4e14"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): compiler/rustc_builtin_macros/src/deriving/const_param_ty.rs:13-26 | compiler/rustc_builtin_macros/src/deriving/copy.rs:13-26 \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":"compiler/rustc_builtin_macros/src/deriving/const_param_ty.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d978b65f26b2c7c0776e7a8ef2fe95014905027430b81e00c91039790400f76"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): compiler/rustc_errors/src/timings.rs:70-80 | compiler/rustc_errors/src/timings.rs:83-92 \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":"compiler/rustc_errors/src/timings.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"51eb945226fa5506eb3faff4d88ef6e45eb6666f222377f837e59b57be1ee57b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): compiler/rustc_infer/src/infer/region_constraints/mod.rs:752-759 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/region_constraints/mod.rs:514-521 \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":"compiler/rustc_infer/src/infer/region_constraints/mod.rs"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"5df5e28b5fce3a601acdddab64355001eaaa3c8943c1eccefc855051c61a778d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): compiler/rustc_target/src/callconv/bpf.rs:39-53 | compiler/rustc_target/src/callconv/m68k.rs:16-30 \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":"compiler/rustc_target/src/callconv/bpf.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4d95ad887c8bd18fdae5c2ff65d909385616f3b8886f774dc27cd7311a04b48"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): compiler/rustc_type_ir/src/solve/mod.rs:723-733 | compiler/rustc_type_ir/src/solve/mod.rs:735-747 \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":"compiler/rustc_type_ir/src/solve/mod.rs"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"348825e7dfc4ad897e1b6cdec7fd9501c819c11e88ef9cac390a27e2f43f390e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (8 members, 10\u002B corresponding lines): library/alloc/src/rcs/arc.rs:1348-1357 | library/alloc/src/rcs/arc.rs:1418-1430 | library/alloc/src/rcs/arc.rs:2377-2386 | library/alloc/src/rcs/arc.rs:2460-2469 | library/alloc/src/rcs/rc.rs:1192-1201 | library/alloc/src/rcs/rc.rs:1261-1273 | library/alloc/src/rcs/rc.rs:2474-2483 | library/alloc/src/rcs/rc.rs:2555-2564 \u2014 These 8 members are one piece of code written 8 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 8 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/alloc/src/rcs/arc.rs"},"region":{"startLine":1348}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cdc406684354a8e2d41de99d16cbc5365b3f49a0fdb514900b1ddd737ac649b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): library/compiler-builtins/libm/src/math/generic/fmaximum.rs:16-28 | library/compiler-builtins/libm/src/math/generic/fminimum.rs:16-28 \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":"library/compiler-builtins/libm/src/math/generic/fmaximum.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b5b15333feb0b7bc31459ebcdf17edde00adcbc40404be4fb070bbada4f0414"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): library/core/src/slice/iter.rs:2379-2387 | library/core/src/slice/iter.rs:2542-2551 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/slice/iter.rs"},"region":{"startLine":2379}}}],"partialFingerprints":{"codehealthFindingId/v1":"695fa58b8e9def25dba8dc4dd8c84e7afaa2ab2159254dbebe26d88dc58e2dd2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): library/std/src/os/windows/net/listener.rs:110-118 | library/std/src/os/windows/net/stream.rs:103-114 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/os/windows/net/listener.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbc45ded02b02f3aae8fe9a125e96b4360d997e5b1042a44c9aa0669dc940511"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 11\u002B corresponding lines): library/std/src/sys/fs/solid.rs:380-392 | library/std/src/sys/fs/solid.rs:426-438 | library/std/src/sys/fs/solid.rs:474-484 | library/std/src/sys/fs/solid.rs:618-628 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/fs/solid.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ccdaa2198024eb6674da05af637772c4e1ca425cf4779af853dcd114d7f5b92"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 6\u002B corresponding lines): library/std/src/sys/net/connection/motor.rs:30-35 | library/std/src/sys/net/connection/motor.rs:188-193 | library/std/src/sys/net/connection/motor.rs:264-269 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 6 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/net/connection/motor.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f070c51eba88d9bd1e5b9a2ee25534daa1b0929f014bb4a451f6077f38ff3d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): library/stdarch/crates/core_arch/src/x86/avx.rs:295-303 | library/stdarch/crates/core_arch/src/x86/avx.rs:314-322 | library/stdarch/crates/core_arch/src/x86/sse3.rs:18-26 \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":"library/stdarch/crates/core_arch/src/x86/avx.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"97f913850b4c53629afa68fc83e0ae1d6a473d3325dbca579a7d3d89f2da1667"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 9\u002B corresponding lines): library/stdarch/crates/core_arch/src/x86/avx2.rs:1082-1090 | library/stdarch/crates/core_arch/src/x86/avx2.rs:1108-1116 | library/stdarch/crates/core_arch/src/x86/avx2.rs:1264-1272 | library/stdarch/crates/core_arch/src/x86/avx2.rs:1290-1298 | library/stdarch/crates/core_arch/src/x86/avx2.rs:1313-1321 | library/stdarch/crates/core_arch/src/x86/avx2.rs:1339-1347 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx2.rs"},"region":{"startLine":1082}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ce1a513c00dc6502b540c792aca7a9539e0ce80ca1419438d70963528f50e19"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): library/stdarch/crates/core_arch/src/x86/avx2.rs:1449-1457 | library/stdarch/crates/core_arch/src/x86/avx2.rs:1475-1483 | library/stdarch/crates/core_arch/src/x86/avx2.rs:1657-1665 \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":"library/stdarch/crates/core_arch/src/x86/avx2.rs"},"region":{"startLine":1449}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e4f59219a4ac6ae248488530c34d0f46f9b28c4dba981b7173c2e582a41e741"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): library/stdarch/crates/core_arch/src/x86/avx2.rs:1498-1506 | library/stdarch/crates/core_arch/src/x86/avx2.rs:1524-1532 | library/stdarch/crates/core_arch/src/x86/avx2.rs:1706-1714 \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":"library/stdarch/crates/core_arch/src/x86/avx2.rs"},"region":{"startLine":1498}}}],"partialFingerprints":{"codehealthFindingId/v1":"45a496e9497d6b221249433c83db12864dd57a447dab593c425d86317b97b648"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512f.rs:6588-6597 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:6612-6621 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:6636-6645 \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":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":6588}}}],"partialFingerprints":{"codehealthFindingId/v1":"461b002b0ebec1d2c112607d5b1015c134b73d0ba006cb5430d3c607689c4567"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512f.rs:6789-6798 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:6813-6822 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:6837-6846 \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":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":6789}}}],"partialFingerprints":{"codehealthFindingId/v1":"1367ceda3ba930085f55078c170e28847450cb2e19cfeb1fac5c59446b99c90a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 10\u002B corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512f.rs:7480-7489 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:7577-7586 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:7784-7793 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:7881-7890 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":7480}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ef95e3b2b94482921b5935405d106256d31cc0b900ac5045389e6d0e1a0542c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): src/bootstrap/src/core/build_steps/tool.rs:1034-1047 | src/bootstrap/src/core/build_steps/tool.rs:1234-1247 | src/bootstrap/src/core/build_steps/tool.rs:1334-1350 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/build_steps/tool.rs"},"region":{"startLine":1034}}}],"partialFingerprints":{"codehealthFindingId/v1":"11933228221661ae285cafeed08e990951d056812514fc35959fef09ebae5771"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 7\u002B corresponding lines): src/tools/rust-analyzer/crates/hir-def/src/expr_store/lower.rs:3555-3561 | src/tools/rust-analyzer/crates/hir-def/src/expr_store/lower.rs:3590-3596 | src/tools/rust-analyzer/crates/hir-def/src/expr_store/lower.rs:3598-3604 | src/tools/rust-analyzer/crates/hir-def/src/expr_store/lower.rs:3606-3612 \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/tools/rust-analyzer/crates/hir-def/src/expr_store/lower.rs"},"region":{"startLine":3555}}}],"partialFingerprints":{"codehealthFindingId/v1":"f91d33f2ea939551f53b3ef14ff051e7fe40b0397638ca5ae3223748a9c2f611"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_blanket_trait_impl.rs:292-300 | src/tools/rust-analyzer/crates/ide-assists/src/handlers/replace_qualified_name_with_use.rs:120-129 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_blanket_trait_impl.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"802835e02b89e20bc096218a2a14107d1fc231a0929952a4cacd30b6da9b1605"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): src/tools/rust-analyzer/crates/ide/src/signature_help.rs:451-465 | src/tools/rust-analyzer/crates/ide/src/signature_help.rs:473-486 \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/tools/rust-analyzer/crates/ide/src/signature_help.rs"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc3be3fb2973f9426602dbea00a7fcba69fbdd29038306eda052d8d2c4717495"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/tools/rust-analyzer/crates/parser/src/grammar.rs:352-360 | src/tools/rust-analyzer/crates/parser/src/grammar.rs:362-370 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/parser/src/grammar.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"94870aae633814608b55d5e16aba57c65eb44cfcfc6ef41356e7f41af74657aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): src/tools/rust-analyzer/crates/parser/src/grammar/expressions.rs:524-531 | src/tools/rust-analyzer/crates/parser/src/grammar/expressions/atom.rs:898-905 \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/tools/rust-analyzer/crates/parser/src/grammar/expressions.rs"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a74a8311e50706c9258c58f9873e6577eaf30b68638febcc868287ef0b362b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/tools/rust-analyzer/crates/proc-macro-api/src/legacy_protocol.rs:51-59 | src/tools/rust-analyzer/crates/proc-macro-api/src/legacy_protocol.rs:65-74 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/proc-macro-api/src/legacy_protocol.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"77cb64335b5c23216aff51cf9363572aa029163683cff3c01759f1c3c54d014c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): compiler/rustc_incremental/src/persist/clean.rs:318-327 | compiler/rustc_incremental/src/persist/clean.rs:329-338 \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":"compiler/rustc_incremental/src/persist/clean.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"f32c3e7316af2a407bd07527582254ecb0f435713c70c0d944398c3d8fdcebca"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): compiler/rustc_infer/src/infer/canonical/canonicalizer.rs:509-524 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/canonical/canonicalizer.rs:498-513 \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":"compiler/rustc_infer/src/infer/canonical/canonicalizer.rs"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b02d8d30a863cc5ee9e457825782fe01e21c4581e948c4fc5be35789b5fd5ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): compiler/rustc_middle/src/mir/mod.rs:466-472 | compiler/rustc_middle/src/mir/mod.rs:476-488 \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":"compiler/rustc_middle/src/mir/mod.rs"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b878cbe50c0fe3f7d7b817d3c72e89a1e0d50758cad0f0ddfde15cce3f07702"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 13\u002B corresponding lines): compiler/rustc_middle/src/ty/generic_args.rs:83-95 | compiler/rustc_middle/src/ty/generic_args.rs:99-116 | compiler/rustc_middle/src/ty/generic_args.rs:118-132 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/generic_arg.rs:709-726 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/generic_arg.rs:728-742 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/ty/generic_args.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"7714b2a1f8f08de875dede7bd6c35b02f8ca73598cb43bc7cee1ab504b7bde8c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): compiler/rustc_middle/src/ty/trait_def.rs:366-375 | compiler/rustc_middle/src/ty/trait_def.rs:377-386 \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":"compiler/rustc_middle/src/ty/trait_def.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4fb4419559c4351000bb44bb7b64dab90118829ac4e9f3d6abaf9614ff9ee91"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): compiler/rustc_type_ir/src/fold.rs:437-447 | compiler/rustc_type_ir/src/fold.rs:449-461 | compiler/rustc_type_ir/src/fold.rs:463-473 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_type_ir/src/fold.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"31a612b86f9bcbc4f759be7befe9798bf51d11711e24c9684279ab5df3f01d75"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): library/std/src/sys/random/getrandom.rs:1-7 | library/std/src/sys/random/hermit.rs:1-7 \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":"library/std/src/sys/random/getrandom.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbbb46470b09b4c9d35a773d5020f86203a993af07fa1ca3b5af8fc0d36a3594"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512bw.rs:10827-10834 | library/stdarch/crates/core_arch/src/x86/avx512bw.rs:10844-10851 | library/stdarch/crates/core_arch/src/x86/avx512bw.rs:10861-10868 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512bw.rs"},"region":{"startLine":10827}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a5c6f51d607722f0d731f48d3ef04920dfa5ee15db2aa7ad1440b20590625f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 10\u002B corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512f.rs:6655-6664 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:6679-6688 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:6703-6712 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:39080-39089 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":6655}}}],"partialFingerprints":{"codehealthFindingId/v1":"67f0304dacc2da7354b9f3467c436430a87f0ebafae7a5a4b3d2c0f4972df0e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 10\u002B corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512f.rs:6856-6865 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:6880-6889 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:6904-6913 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:39165-39174 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":6856}}}],"partialFingerprints":{"codehealthFindingId/v1":"d77152808278e4e1c34a162218dd41d2e2272254d0a9184351e7dbdbd8e0e1d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512f.rs:25762-25770 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:25822-25830 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:25879-25887 \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":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":25762}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f782dbde9908d078972dbd9c3708165601f138e5307f1c73b0a8a7a86ac343e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512f.rs:41242-41251 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:41273-41283 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:41304-41313 \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":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":41242}}}],"partialFingerprints":{"codehealthFindingId/v1":"10f8cd7511325571f2ed2b2583e1fb5d2d59dc0a6a9728a8f45ec582d1a60498"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512f.rs:41330-41339 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:41361-41371 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:41392-41401 \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":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":41330}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8b45cbf166984bf4ea94f6ce10e271bbc1d820bde3302bb86314c36a6178524"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): src/shim_utils/src/shared_helpers.rs:11-23 | src/tools/compiletest/src/util.rs:48-60 \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/shim_utils/src/shared_helpers.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"2731420612100366c75dd6d1bedd45e64de747f737bdfd8bb65ad352875df8ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): compiler/rustc_infer/src/infer/opaque_types/table.rs:39-49 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/opaque_types/table.rs:38-50 \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":"compiler/rustc_infer/src/infer/opaque_types/table.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"18bc03007035e9decee839ec9a95b471c044ac879bf87518b1ef8af854020743"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): compiler/rustc_mir_transform/src/elaborate_drops.rs:416-422 | compiler/rustc_mir_transform/src/elaborate_drops.rs:424-431 \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":"compiler/rustc_mir_transform/src/elaborate_drops.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a99b5cbd32bbd5c4391968368a71fb7f806609c2b72c37126996e15be7653fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 19\u002B corresponding lines): compiler/rustc_type_ir/src/param_env.rs:230-248 | compiler/rustc_type_ir/src/param_env.rs:253-271 | compiler/rustc_type_ir/src/param_env.rs:284-302 | compiler/rustc_type_ir/src/param_env.rs:316-334 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 19 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_type_ir/src/param_env.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a3e1d7e0d174239f1cf353afc80f4d83f9645c47f1517460594c5a1e8c136ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 9\u002B corresponding lines): library/alloc/src/collections/vec_deque/iter.rs:107-116 | library/alloc/src/collections/vec_deque/iter.rs:179-187 | library/alloc/src/collections/vec_deque/iter_mut.rs:172-180 | library/alloc/src/collections/vec_deque/iter_mut.rs:243-251 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/alloc/src/collections/vec_deque/iter.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"86beccf6bd4915c38c0ba226da1c39c208205ca196943a427efbbe06874b5d3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): library/compiler-builtins/builtins-test/src/lib.rs:179-194 | library/compiler-builtins/builtins-test/src/lib.rs:307-319 \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":"library/compiler-builtins/builtins-test/src/lib.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"13827e259c61900ffc39e63445b797e24b37e5c648e490f733a8e8a1fd61c595"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 13\u002B corresponding lines): library/compiler-builtins/libm/src/math/fma.rs:10-22 | library/compiler-builtins/libm/src/math/fma.rs:28-40 | library/compiler-builtins/libm/src/math/rint.rs:18-30 | library/compiler-builtins/libm/src/math/rint.rs:34-47 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/compiler-builtins/libm/src/math/fma.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"dee40217e7a03cdd6d82146776c1eff092e5a367293b01853c8852c91a16be63"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): library/std/src/os/unix/net/listener.rs:48-55 | library/std/src/os/windows/net/listener.rs:53-60 \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":"library/std/src/os/unix/net/listener.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b970d4af8049b898561ce3c64a427c8b489a553ac8d0a50d51de864950294c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 9\u002B corresponding lines): library/std/src/sys/fd/unix.rs:194-209 | library/std/src/sys/fd/unix.rs:211-227 | library/std/src/sys/net/connection/socket/hermit.rs:121-134 | library/std/src/sys/net/connection/socket/solid.rs:183-191 | library/std/src/sys/net/connection/socket/unix.rs:282-295 \u2014 These 5 members are one piece of code written 5 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 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/fd/unix.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6d9735643559e116655af2f7704af59a225e386d58243db2415f77f3d427507"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 11\u002B corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512bw.rs:7173-7183 | library/stdarch/crates/core_arch/src/x86/avx512bw.rs:7219-7229 | library/stdarch/crates/core_arch/src/x86/avx512bw.rs:7265-7275 | library/stdarch/crates/core_arch/src/x86/avx512bw.rs:7543-7553 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512bw.rs"},"region":{"startLine":7173}}}],"partialFingerprints":{"codehealthFindingId/v1":"d86eedc18fe23553d483add6267f9b61801b833e0219d9b8b6de01c07f15986e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 11\u002B corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512f.rs:20481-20491 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:20527-20537 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:20573-20583 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:20639-20649 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:20685-20695 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:20731-20741 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":20481}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5646cc3504f4faee178d7076621db3e0f934875aee995533435de1806c39ccf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/tools/clippy/clippy_lints/src/manual_strip.rs:155-164 | src/tools/clippy/clippy_lints_internal/src/symbols.rs:196-205 \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/tools/clippy/clippy_lints/src/manual_strip.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"28fed563f9f0b13ec31c115ac86a260a11d1e93b2bea0612b83dc9f66d3da124"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): src/tools/miri/src/concurrency/data_race.rs:982-993 | src/tools/miri/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/tools/miri/src/concurrency/data_race.rs"},"region":{"startLine":982}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ce7efb4dce54eae478393a0c9b59c79d9d91156b9ebd2c95c2411f3346823e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 7\u002B corresponding lines): src/tools/rust-analyzer/crates/hir-def/src/item_tree/lower.rs:259-265 | src/tools/rust-analyzer/crates/hir-def/src/item_tree/lower.rs:267-273 | src/tools/rust-analyzer/crates/hir-def/src/item_tree/lower.rs:275-284 | src/tools/rust-analyzer/crates/hir-def/src/item_tree/lower.rs:286-292 | src/tools/rust-analyzer/crates/hir-def/src/item_tree/lower.rs:294-300 | src/tools/rust-analyzer/crates/hir-def/src/item_tree/lower.rs:333-340 \u2014 These 6 members are one piece of code written 6 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 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/item_tree/lower.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b43281c98d27741fc2fef33eb92826baaeaa9e54b03fe79209be36715bebc75"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): src/tools/rust-analyzer/crates/hir/src/lib.rs:1317-1324 | src/tools/rust-analyzer/crates/hir/src/lib.rs:2118-2125 | src/tools/rust-analyzer/crates/hir/src/lib.rs:2199-2206 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir/src/lib.rs"},"region":{"startLine":1317}}}],"partialFingerprints":{"codehealthFindingId/v1":"60a4cc33811c53a6bc35a973e2fd55e0873d48aef0c4ade43c293cd9471ac9e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): src/tools/rust-analyzer/crates/parser/src/parser.rs:388-398 | src/tools/rust-analyzer/crates/parser/src/parser.rs:401-411 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/parser/src/parser.rs"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ac68c4e5bd79e4b929360011bdeea7dc7b8595c392a3aabccd1913655115885"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): compiler/rustc_infer/src/infer/mod.rs:1447-1456 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/mod.rs:1062-1071 \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":"compiler/rustc_infer/src/infer/mod.rs"},"region":{"startLine":1447}}}],"partialFingerprints":{"codehealthFindingId/v1":"9611fdf2c3b3cd50c0539fca4919e6ccd783c545a48213eb4fb7ed4312a2641a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): compiler/rustc_infer/src/infer/region_constraints/mod.rs:879-885 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/region_constraints/mod.rs:633-639 \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":"compiler/rustc_infer/src/infer/region_constraints/mod.rs"},"region":{"startLine":879}}}],"partialFingerprints":{"codehealthFindingId/v1":"493480650bff81d3e0b833e50a53fda978d780d17e5ad950ca1a6eaf1b6886b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): compiler/rustc_middle/src/ty/generics.rs:199-214 | compiler/rustc_middle/src/ty/generics.rs:216-232 \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":"compiler/rustc_middle/src/ty/generics.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"07ef64891a6b0edfa53f91d50cdc66b5b688b8992acfd661efc9624b46c55068"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): compiler/rustc_span/src/lib.rs:352-364 | compiler/rustc_span/src/lib.rs:377-389 \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":"compiler/rustc_span/src/lib.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"18a2a09a7f652b1e79d98209b2328f3b9294c05f04aba25a59513a61955666d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): compiler/rustc_target/src/callconv/hexagon.rs:119-133 | compiler/rustc_target/src/callconv/mips.rs:78-90 | compiler/rustc_target/src/callconv/xtensa.rs:115-128 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_target/src/callconv/hexagon.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"af51a0fd02754190e4909c5ee8b61ffb5c0e7b8846e88f13425c678b1c01ff56"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): library/alloc/src/io/cursor.rs:22-30 | library/alloc/src/io/cursor.rs:60-67 \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":"library/alloc/src/io/cursor.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6e0045d752727ca7381c1e653f3f6f30ace06ccdd68e474b292686d26e6f335"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): library/alloc/src/rcs/arc.rs:5006-5020 | library/alloc/src/rcs/rc.rs:4584-4598 \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":"library/alloc/src/rcs/arc.rs"},"region":{"startLine":5006}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a7a06f7503cbdd38fffb9e7459494070b5d20cdf5b286824db18e3b24eb7bb5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): library/core/src/slice/iter.rs:1913-1923 | library/core/src/slice/iter.rs:2069-2080 | library/core/src/slice/iter.rs:2726-2736 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/slice/iter.rs"},"region":{"startLine":1913}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0ec8190cb5d69ab6ffbc5b42653958ce3c70c9e5b945f1f6e295aa2ef808bce"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): library/std/src/os/unix/net/addr.rs:105-112 | library/std/src/os/windows/net/addr.rs:58-65 \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":"library/std/src/os/unix/net/addr.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"25033766d9c4c8517102e44c93397dd0e153041294a930a2e96e0775030ff188"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): library/std/src/sys/net/connection/xous/tcplistener.rs:241-253 | library/std/src/sys/net/connection/xous/tcpstream.rs:444-453 | library/std/src/sys/net/connection/xous/udp.rs:471-480 \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":"library/std/src/sys/net/connection/xous/tcplistener.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c32811759bb1a370fd53fad20564c4de404d1b243a084686a76149f210a861f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512bw.rs:7194-7204 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:20502-20512 \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":"library/stdarch/crates/core_arch/src/x86/avx512bw.rs"},"region":{"startLine":7194}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc40b49846b8becf9b844994c18dc5501a7b24b7c504d54714321344a8abb913"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512bw.rs:7240-7250 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:20548-20558 \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":"library/stdarch/crates/core_arch/src/x86/avx512bw.rs"},"region":{"startLine":7240}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c60111dd7751b73d3dc9b765f9633ba77b9e6cb3af9bdbc0433a0c9c73ecfb5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512bw.rs:7286-7296 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:20594-20604 \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":"library/stdarch/crates/core_arch/src/x86/avx512bw.rs"},"region":{"startLine":7286}}}],"partialFingerprints":{"codehealthFindingId/v1":"326028f1197904b21e1e7c6ec116477526b3b2e2ed6a918a42d2590bcb546dfe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512bw.rs:7564-7575 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:20660-20670 \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":"library/stdarch/crates/core_arch/src/x86/avx512bw.rs"},"region":{"startLine":7564}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c3e43cfcc161fa5b73618a3ddabe15a9a6ccf8b3847965b48b844136c7534e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (8 members, 7\u002B corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512dq.rs:1264-1270 | library/stdarch/crates/core_arch/src/x86/avx512dq.rs:1311-1317 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:26078-26084 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:26094-26100 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:26185-26191 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:26201-26207 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:28069-28075 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:28450-28456 \u2014 These 8 members are one piece of code written 8 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 8 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512dq.rs"},"region":{"startLine":1264}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0c8206272313bb37f0a58854a13c3dd066e787c2eefe303213c792247a70229"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 10\u002B corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512f.rs:31673-31683 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:31698-31707 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:32008-32018 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:32033-32042 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":31673}}}],"partialFingerprints":{"codehealthFindingId/v1":"7be8b7c2113aa141549c5b89122865a607d2a3c6f2461e0a4d76e97788b03d82"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/tools/clippy/clippy_lints/src/methods/is_empty.rs:49-59 | src/tools/clippy/clippy_utils/src/lib.rs:169-178 \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/tools/clippy/clippy_lints/src/methods/is_empty.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"dafdf61c4316de91c5aa631bb6d6832df287b732d7f55b8332805336b7388f40"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): compiler/rustc_codegen_cranelift/src/value_and_place.rs:475-483 | compiler/rustc_codegen_cranelift/src/value_and_place.rs:486-493 \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":"compiler/rustc_codegen_cranelift/src/value_and_place.rs"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"531b1611d22606f6da32fc4867b22021a75b34a875cb5e4906839601ca522143"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): compiler/rustc_const_eval/src/interpret/stack.rs:617-630 | compiler/rustc_const_eval/src/interpret/stack.rs:687-701 \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":"compiler/rustc_const_eval/src/interpret/stack.rs"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"18299c4059baec9cd380ee85bb5a019f24e7cf0b37210e74e775ddcb9b5ac027"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): compiler/rustc_hir_typeck/src/method/probe.rs:2594-2601 | src/tools/rust-analyzer/crates/hir-ty/src/method_resolution/probe.rs:2018-2027 \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":"compiler/rustc_hir_typeck/src/method/probe.rs"},"region":{"startLine":2594}}}],"partialFingerprints":{"codehealthFindingId/v1":"55e640f92175e0df3509ffbf124bc9d74825f1a3cdf2f8113ba9c374cf2968dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): compiler/rustc_hir_typeck/src/pat.rs:312-326 | src/tools/rust-analyzer/crates/hir-ty/src/infer/pat.rs:223-237 \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":"compiler/rustc_hir_typeck/src/pat.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc982755a87d4c93662dfe6939dc016bbe59a59efe4277541fa2c0ae9ae437ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): compiler/rustc_middle/src/ty/sty.rs:1587-1594 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/ty.rs:573-580 \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":"compiler/rustc_middle/src/ty/sty.rs"},"region":{"startLine":1587}}}],"partialFingerprints":{"codehealthFindingId/v1":"479aa180e1844a9291f0132ffd2837b11fadb0f707af9b98294ac311fcae0d1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 9\u002B corresponding lines): library/std/src/sync/nonpoison/mutex.rs:520-528 | library/std/src/sync/nonpoison/rwlock.rs:799-807 | library/std/src/sync/poison/mutex.rs:795-809 | library/std/src/sync/poison/rwlock.rs:927-941 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sync/nonpoison/mutex.rs"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa78ac38ea0922a6d11f8ab32c84cfea6038dbaafb664f22e43822985e38a519"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 10\u002B corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512f.rs:7377-7386 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:10893-10902 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:10930-10940 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:10967-10976 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":7377}}}],"partialFingerprints":{"codehealthFindingId/v1":"e952e43c30be9e21635521cd395eb3597a17f221f4282bccc132e873953b49ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 10\u002B corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512f.rs:7681-7690 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:11002-11011 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:11039-11049 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:11076-11085 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":7681}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab4750e823ef61b73fc3d3e641d1f600f80034f10239a07c9b3cf2ca7014bd7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): library/stdarch/crates/core_arch/src/x86/bt.rs:27-38 | library/stdarch/crates/core_arch/src/x86_64/bt.rs:27-38 \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":"library/stdarch/crates/core_arch/src/x86/bt.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"803a56052988e2dddafdcc8dbadb0ea8021684934ff444837977d2403b608316"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): src/librustdoc/html/render/print_item.rs:1652-1662 | src/librustdoc/html/render/print_item.rs:2111-2121 \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/librustdoc/html/render/print_item.rs"},"region":{"startLine":1652}}}],"partialFingerprints":{"codehealthFindingId/v1":"9036da8a65add3e8ad172d9fb4f72a9ea1c8ea3f0dfe116e3cd36b24954548cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): src/tools/clippy/clippy_config/src/metadata.rs:45-57 | src/tools/clippy/clippy_dev/src/utils.rs:175-183 | src/tools/clippy/clippy_dev/src/utils.rs:187-195 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 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/tools/clippy/clippy_config/src/metadata.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8cec1a2641a645feb29f4c74c3b7a556d5a6083f85a693ad42bd229c2f08904"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): src/tools/run-make-support/src/assertion_helpers/mod.rs:66-74 | src/tools/run-make-support/src/assertion_helpers/mod.rs:78-86 | src/tools/run-make-support/src/assertion_helpers/mod.rs:94-109 \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/tools/run-make-support/src/assertion_helpers/mod.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c70ef6af8c79db837d34c227af42a0b044dbe920fc4612cf07337a1686a7519"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): compiler/rustc_infer/src/infer/at.rs:420-435 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/at.rs:194-209 \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":"compiler/rustc_infer/src/infer/at.rs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3b2c8757dd9461a832012cc74d49a8ed1a5849e9979902a90091f6b8a518597"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): compiler/rustc_infer/src/infer/region_constraints/mod.rs:869-875 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/region_constraints/mod.rs:623-629 \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":"compiler/rustc_infer/src/infer/region_constraints/mod.rs"},"region":{"startLine":869}}}],"partialFingerprints":{"codehealthFindingId/v1":"eafe82eddfef168d8effb8c272d4c1c7f89494be1dc1c1af69ac0fee97a0d4db"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): compiler/rustc_infer/src/infer/snapshot/fudge.rs:165-172 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/snapshot/fudge.rs:159-166 \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":"compiler/rustc_infer/src/infer/snapshot/fudge.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"227572b45c2a94c5efd79acd7bc43ba46128e7ce02d76a9611f436b7953b4327"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): compiler/rustc_mir_transform/src/remove_storage_markers.rs:16-26 | compiler/rustc_mir_transform/src/remove_place_mention.rs:16-24 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/remove_storage_markers.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"0722997c9b56f95b713b755d97df6a400738b8c7b8c21603fbcd0ae4731757a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): library/alloc/src/collections/vec_deque/drain.rs:244-254 | library/alloc/src/collections/vec_deque/drain.rs:266-276 \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":"library/alloc/src/collections/vec_deque/drain.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"14382baa5dbaf12a008fd5e3f90a92461dbb90dde9604d4b1bf3a2db8cfe08da"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 4\u002B corresponding lines): library/std/src/sys/env/hermit.rs:50-57 | library/std/src/sys/env/sgx.rs:14-20 | library/std/src/sys/env/xous.rs:29-32 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/env/hermit.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdb3bb02cf5ba6dba782eb29ae06140fd8e0b46f1c96ec6db470bb907c6720d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): library/std/src/sys/pal/uefi/helpers.rs:315-322 | library/std/src/sys/pal/uefi/helpers.rs:759-767 \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":"library/std/src/sys/pal/uefi/helpers.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"a60a24bd0c503b01930d7f6b86b9afb140fd7de46a9e0d11febd466843f3e8e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): src/tools/rust-analyzer/crates/hir/src/lib.rs:3751-3761 | src/tools/rust-analyzer/crates/hir/src/lib.rs:3770-3778 | src/tools/rust-analyzer/crates/hir/src/lib.rs:3780-3788 \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/tools/rust-analyzer/crates/hir/src/lib.rs"},"region":{"startLine":3751}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d5dfed5c5be2ddab0f1d86d53cbcb351774ab01206337630713b4e578270e7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): compiler/rustc_ast_pretty/src/pprust/state/expr.rs:138-146 | compiler/rustc_hir_pretty/src/lib.rs:1321-1329 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ast_pretty/src/pprust/state/expr.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"4945f137a17d96bce487ab665632af02863b4d0c36592b0cfa5fcb273640c299"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): compiler/rustc_hir_typeck/src/upvar.rs:2411-2419 | src/tools/rust-analyzer/crates/hir-ty/src/infer/closure/analysis.rs:1380-1389 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/upvar.rs"},"region":{"startLine":2411}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a8af112402293d5fa9122254aedab8719dbd280d2917a0775c3c1f733574f95"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): compiler/rustc_infer/src/infer/mod.rs:397-406 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/mod.rs:276-284 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_infer/src/infer/mod.rs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"22213f15ad3fe947be1b2448c3cee34ace1f2bff72b3d7afe6f17418d60ec57d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): compiler/rustc_infer/src/infer/mod.rs:1226-1233 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/mod.rs:919-926 \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":"compiler/rustc_infer/src/infer/mod.rs"},"region":{"startLine":1226}}}],"partialFingerprints":{"codehealthFindingId/v1":"1166039956182349748c1136a00521c264cf013a2fbb5f486ef82f259e10b315"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): compiler/rustc_macros/src/diagnostics/error.rs:45-54 | compiler/rustc_expand/src/stats.rs:24-33 \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":"compiler/rustc_macros/src/diagnostics/error.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"61b13453db8e74bb254399aab99beb8d71c8fb82aa9ddccbab65174c8b0136b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): compiler/rustc_middle/src/ty/consts/kind.rs:40-46 | compiler/rustc_middle/src/ty/consts/kind.rs:83-91 | compiler/rustc_middle/src/ty/consts/kind.rs:113-119 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/ty/consts/kind.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bc270e2db93b8fd27ffe166963e3f52cc562c8c7e2dc605604c6e6124fc569d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): compiler/rustc_middle/src/ty/print/pretty.rs:2093-2101 | compiler/rustc_middle/src/ty/consts/valtree.rs:248-254 \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":"compiler/rustc_middle/src/ty/print/pretty.rs"},"region":{"startLine":2093}}}],"partialFingerprints":{"codehealthFindingId/v1":"23b59513bd4c59e34a1c058020814d9395faf8fec282e728cce9a7f866c39455"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): compiler/rustc_trait_selection/src/solve/inspect/analyse.rs:407-411 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/inspect.rs:500-504 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/solve/inspect/analyse.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"01053930010984ed421c04ebf14b8fe86da0dee50d0ee6bf531537b1b2ab91cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): library/std/src/sync/poison.rs:340-348 | library/std/src/sync/poison.rs:353-362 | library/std/src/sync/poison.rs:368-376 \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":"library/std/src/sync/poison.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"72c36f8ab8bdd8b03cefad0aed14bae37d3a99bb84c22b9ada0a794a062d7bd5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): library/std/src/sys/paths/wasi.rs:35-41 | library/std/src/sys/paths/unix.rs:54-57 \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":"library/std/src/sys/paths/wasi.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d471f0a955a6fbf339cbdfaf840b65b433dc313dc0a8d866309d9aef0ca25a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): library/std/src/sys/sync/mutex/itron.rs:33-38 | library/std/src/sys/sync/rwlock/solid.rs:28-33 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/sync/mutex/itron.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"a58761be43cdd1941ffaf8ce511dfdf00ab41511ff0143758c77b250095f9b74"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): src/bootstrap/src/utils/exec.rs:463-475 | src/bootstrap/src/utils/exec.rs:478-490 \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/bootstrap/src/utils/exec.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"05d864b64fb7237631cc5222a9e14b2589500b005fe6cfa1ab0b9d628b1eeeee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): src/tools/clippy/clippy_lints/src/methods/unnecessary_to_owned.rs:723-735 | src/tools/clippy/clippy_utils/src/ty/mod.rs:1509-1514 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/methods/unnecessary_to_owned.rs"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"26037e8aef6231f6943f648891d858cc88d83f71d6a7b7df7d95d7f7f31f1827"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/tools/rust-analyzer/crates/hir-ty/src/next_solver/generic_arg.rs:262-268 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/generic_arg.rs:757-763 \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/tools/rust-analyzer/crates/hir-ty/src/next_solver/generic_arg.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ec39f4be45c590bf9dd9d9f137c61ce82c543eb0d693c76ea673df3601b28ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): src/tools/rust-analyzer/crates/hir/src/attrs.rs:156-165 | src/tools/rust-analyzer/crates/hir/src/attrs.rs:168-176 | src/tools/rust-analyzer/crates/hir/src/attrs.rs:197-205 \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/tools/rust-analyzer/crates/hir/src/attrs.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"182f1dd2e39d81fd5ede2f57f4a170116220d5dac96784904c3d18ea8491887b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/tools/rust-analyzer/crates/ide-db/src/helpers.rs:145-153 | src/tools/rust-analyzer/crates/ide/src/static_index.rs:151-161 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-db/src/helpers.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"efebae172c78873032d01c0f1d8b9ba10d4ae0092c3abe05370fc8bf57a4f009"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): compiler/rustc_abi/src/lib.rs:1728-1735 | compiler/rustc_public/src/abi.rs:346-353 \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":"compiler/rustc_abi/src/lib.rs"},"region":{"startLine":1728}}}],"partialFingerprints":{"codehealthFindingId/v1":"f409896a469b49fdac6d56d7a2b711197a1ee4a300efdfcd4e2199e26eca4597"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): compiler/rustc_codegen_llvm/src/builder.rs:1263-1270 | compiler/rustc_codegen_llvm/src/builder.rs:1272-1276 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/builder.rs"},"region":{"startLine":1263}}}],"partialFingerprints":{"codehealthFindingId/v1":"4219207538cdac7036779b31dd7acd0d0f433cbd0eb3a24e9fc85d04c7c3ec20"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): compiler/rustc_middle/src/ty/layout.rs:175-182 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/util.rs:254-260 \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":"compiler/rustc_middle/src/ty/layout.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbd87cf451f2e246e0dc9ae7410b9f771d3bfeaa76fb43177c65233273d27091"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): library/alloc/src/collections/vec_deque/extract_if.rs:50-57 | library/alloc/src/vec/extract_if.rs:41-51 \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":"library/alloc/src/collections/vec_deque/extract_if.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"824765118cd5992009166d65c486a4e0a0e2cc0f019fedf9c2733ed6f644b601"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): library/alloc/src/rcs/arc.rs:3915-3927 | library/alloc/src/rcs/rc.rs:2711-2719 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/alloc/src/rcs/arc.rs"},"region":{"startLine":3915}}}],"partialFingerprints":{"codehealthFindingId/v1":"23b3c6897a36d3fb41345d1a87d495065cd0998132fc3d584107471be9ad9d59"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): library/std/src/sys/pal/sgx/abi/usercalls/alloc.rs:560-569 | library/std/src/sys/pal/sgx/abi/usercalls/alloc.rs:576-585 \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":"library/std/src/sys/pal/sgx/abi/usercalls/alloc.rs"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"ade270b2237b1eeafca22949216b753f7ec855e5c6c532d447d8f4bbddf51d0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): src/tools/clippy/clippy_lints/src/methods/range_zip_with_len.rs:69-80 | src/tools/clippy/clippy_utils/src/lib.rs:1198-1208 \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/tools/clippy/clippy_lints/src/methods/range_zip_with_len.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"926be507a0f32f5c88ffae99e581171cc833358938239ac67841b861fe02c382"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/tools/clippy/clippy_lints/src/question_mark.rs:608-618 | src/tools/clippy/clippy_lints/src/unused_io_amount.rs:275-284 \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/tools/clippy/clippy_lints/src/question_mark.rs"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"290f5ba2862d1d949a86c59d75b3d2ae6c89f84e6c12768b7b432030aa43ade8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (1 corresponding lines): src/tools/run-make-support/src/external_deps/rustc.rs:74-74 | src/tools/run-make-support/src/external_deps/rustdoc.rs:31-31 \u2014 These two members are one piece of code written twice and then edited apart: 1 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one 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/tools/run-make-support/src/external_deps/rustc.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"396f03e068f19d256bb7f457ed15ad2233354ecc1f6c72b42cf209f0a57b0bf4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/tools/rust-analyzer/crates/hir-ty/src/next_solver/util.rs:87-94 | compiler/rustc_middle/src/ty/util.rs:109-115 \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/tools/rust-analyzer/crates/hir-ty/src/next_solver/util.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa46c699affe0aa2c6e4fc70c659df827e303fadc2a22ebad2f91ed7e9471f5f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 12\u002B corresponding lines): src/tools/rust-analyzer/crates/ide-diagnostics/src/handlers/cannot_be_dereferenced.rs:12-23 | src/tools/rust-analyzer/crates/ide-diagnostics/src/handlers/cannot_implicitly_deref_trait_object.rs:12-23 | src/tools/rust-analyzer/crates/ide-diagnostics/src/handlers/cannot_index_into.rs:12-23 | src/tools/rust-analyzer/crates/ide-diagnostics/src/handlers/expected_array_or_slice_pat.rs:12-23 \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/tools/rust-analyzer/crates/ide-diagnostics/src/handlers/cannot_be_dereferenced.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec71a7b085a5db8fc84169be4d6bda01898510d0b63fc9800b4a33deb9b43d21"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): compiler/rustc_attr_parsing/src/attributes/cfg.rs:365-373 | compiler/rustc_attr_parsing/src/validate_attr.rs:87-95 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_attr_parsing/src/attributes/cfg.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7475d0331c90dea6fc0be8897f9bc6a4e7222ff76084dd78f29e5432d9c1e43"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): compiler/rustc_hir_analysis/src/hir_ty_lowering/dyn_trait.rs:1103-1112 | src/tools/rust-analyzer/crates/hir-ty/src/lower.rs:1473-1482 \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":"compiler/rustc_hir_analysis/src/hir_ty_lowering/dyn_trait.rs"},"region":{"startLine":1103}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd6b5ce4c9cef854014f9530d5a9575ea824c02d386714c81c81a1a453e13731"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): compiler/rustc_span/src/edition.rs:123-132 | src/tools/rustfmt/check_diff/src/lib.rs:40-48 | src/tools/rustfmt/src/bin/main.rs:799-807 \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":"compiler/rustc_span/src/edition.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"32c8c616135d5f0545107c53afe9943d3f772db3f9e1786d2b26da32c6c28a99"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): library/std/src/sys/alloc/solid.rs:19-27 | library/std/src/sys/alloc/unix.rs:69-75 \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":"library/std/src/sys/alloc/solid.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"e566df956ea16223fcfd0f6d375686ad48a045d13ae05f94a73de73452d41c29"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): library/std/src/sys/fs/uefi.rs:521-528 | library/std/src/sys/fs/common.rs:57-63 \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":"library/std/src/sys/fs/uefi.rs"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c1feb21a7440036c9493138f2d287b97583e159e116b16f4099e80c4f16d579"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): library/stdarch/crates/core_arch/src/x86/bt.rs:46-57 | library/stdarch/crates/core_arch/src/x86_64/bt.rs:46-57 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/bt.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"cafbc14c311e4b3858ab0fe0d08575e4ada37aba56fdc363dc47cfef378e6420"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): library/stdarch/crates/core_arch/src/x86/bt.rs:65-76 | library/stdarch/crates/core_arch/src/x86_64/bt.rs:65-76 \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":"library/stdarch/crates/core_arch/src/x86/bt.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"60598c54e849cf9803804a316194fbf296d47a08b833cf6a621fb4ba279f5a89"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): library/stdarch/crates/core_arch/src/x86/bt.rs:84-95 | library/stdarch/crates/core_arch/src/x86_64/bt.rs:84-95 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/bt.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"08388d36622c44e06d62c8eb4f5977237eee57b9fdb50e868666e4b9fa56e73e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/build_helper/src/fs/mod.rs:14-20 | src/tools/miri/cargo-miri/src/util.rs:288-295 \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/build_helper/src/fs/mod.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d28395e0041b483b784723ce44974eb83529e3cd4acdd78180ff4590603016e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): src/tools/clippy/clippy_lints/src/question_mark.rs:348-359 | src/tools/clippy/clippy_utils/src/lib.rs:357-368 \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/tools/clippy/clippy_lints/src/question_mark.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"89aaf3776e60c34cb7e7aa3862e045f662cedf3562276a69e6dbdf92e23a60d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): src/tools/rust-analyzer/crates/hir-def/src/nameres.rs:531-538 | src/tools/rust-analyzer/crates/hir-def/src/nameres.rs:548-559 \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/tools/rust-analyzer/crates/hir-def/src/nameres.rs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e25d2e820e354d0d827a9d7a55cfb8bed8cb9f6160b310045dbcff3d1b27a7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): compiler/rustc_attr_ir/src/target.rs:359-366 | compiler/rustc_expand/src/expand.rs:1628-1635 \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":"compiler/rustc_attr_ir/src/target.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"de2408b4e51eecdbfe7b27e14b6ead38fa4b8fcc0ca5b00063cbf10a75e59554"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): compiler/rustc_hir_typeck/src/expr_use_visitor.rs:804-813 | src/tools/rust-analyzer/crates/hir-ty/src/infer/closure/analysis/expr_use_visitor.rs:854-862 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/expr_use_visitor.rs"},"region":{"startLine":804}}}],"partialFingerprints":{"codehealthFindingId/v1":"13d83af308fee69d2de44340fe4e753ef2e932663c8e85bc70c00f4f2c02d09a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): compiler/rustc_infer/src/infer/region_constraints/mod.rs:714-724 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/region_constraints/mod.rs:474-485 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/region_constraints/mod.rs:493-506 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_infer/src/infer/region_constraints/mod.rs"},"region":{"startLine":714}}}],"partialFingerprints":{"codehealthFindingId/v1":"101268c2acc3b1ccc6c6690823b348ff0c58319b50b48819936fd3822fe4d127"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): compiler/rustc_target/src/callconv/avr.rs:59-71 | compiler/rustc_target/src/callconv/wasm.rs:131-142 \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":"compiler/rustc_target/src/callconv/avr.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d804d6ac9cfc3aa01f53f40b37a3fc5e8ea38eba3e0cfa73bbac62ed17c45d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): library/alloc/src/rcs/rc.rs:861-872 | library/alloc/src/rcs/rc.rs:4399-4411 | library/alloc/src/rcs/rc.rs:4417-4429 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/alloc/src/rcs/rc.rs"},"region":{"startLine":861}}}],"partialFingerprints":{"codehealthFindingId/v1":"52e5416204bb60368c5f74bf8a7f3ad8e5f5ad50ab1479d215d7da5ca96d8d73"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): library/std/src/os/unix/net/stream.rs:154-164 | library/std/src/os/unix/net/datagram.rs:134-144 \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":"library/std/src/os/unix/net/stream.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"cca39468eab03abf55ec7c6b75888098933d7ea6154e837c08148bf07ca212d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/tools/clippy/clippy_utils/src/lib.rs:1145-1154 | src/tools/clippy/clippy_utils/src/visitors.rs:850-859 \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/tools/clippy/clippy_utils/src/lib.rs"},"region":{"startLine":1145}}}],"partialFingerprints":{"codehealthFindingId/v1":"63013a40c2120d7e9b078ddfd8be1e435653f0c9abe4541f0bfdc8358a059bdc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): src/tools/rust-analyzer/crates/hir/src/lib.rs:711-719 | src/tools/rust-analyzer/crates/hir/src/lib.rs:721-725 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir/src/lib.rs"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d75cd8d1822295ba995f2119279cf0a51e071d5f26d125691694b5cb20e81bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/tools/rustfmt/src/bin/main.rs:809-818 | src/tools/rustfmt/check_diff/src/lib.rs:71-79 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/bin/main.rs"},"region":{"startLine":809}}}],"partialFingerprints":{"codehealthFindingId/v1":"80e630afb48865bb40772a367b7f1168876e83348c9988b85f59c7b7dfaa15d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): compiler/rustc_hir_typeck/src/expr_use_visitor.rs:1240-1247 | src/tools/rust-analyzer/crates/hir-ty/src/infer/closure/analysis/expr_use_visitor.rs:1251-1258 \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":"compiler/rustc_hir_typeck/src/expr_use_visitor.rs"},"region":{"startLine":1240}}}],"partialFingerprints":{"codehealthFindingId/v1":"aed2197239e72ddf8c1ca0bc0fef527757f3227f1b59a7c58d585e0b93f53266"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): compiler/rustc_infer/src/infer/canonical/instantiate.rs:119-126 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/canonical/instantiate.rs:161-168 \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":"compiler/rustc_infer/src/infer/canonical/instantiate.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d14fd854ef4d62a1472f20308f3be46dea3e94119bf85bc42ae70ccc1bc18ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): compiler/rustc_infer/src/infer/canonical/query_response.rs:558-570 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/canonical/instantiate.rs:464-477 \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":"compiler/rustc_infer/src/infer/canonical/query_response.rs"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1ce306f24de3959adb93d35d7a68feb4fd74f5b238a4ca1763050768af097bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): compiler/rustc_infer/src/infer/opaque_types/table.rs:110-113 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/opaque_types/table.rs:111-114 \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":"compiler/rustc_infer/src/infer/opaque_types/table.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec96806bd8a5ee6bdf7aeb149c92e07e64a4faf314e17a653c98927265b7eba4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): compiler/rustc_infer/src/infer/type_variable.rs:306-309 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/type_variable.rs:237-240 \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":"compiler/rustc_infer/src/infer/type_variable.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8a4acbd8045acaa5908035487151284b0a3c366be6f9d833841bdbe24f8fc77"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): compiler/rustc_mir_transform/src/gvn.rs:2171-2181 | compiler/rustc_mir_transform/src/ref_prop.rs:455-466 \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":"compiler/rustc_mir_transform/src/gvn.rs"},"region":{"startLine":2171}}}],"partialFingerprints":{"codehealthFindingId/v1":"c43ef232a10b1b545b89e1ba987d210a1114629b44f32e3e24a5ebc2dc3282f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): src/tools/clippy/clippy_lints/src/methods/err_expect.rs:39-44 | src/tools/clippy/clippy_lints/src/methods/ok_expect.rs:38-43 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/methods/err_expect.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"463ffd81ead7569b90e2c74bb2a940459cf11756389cb412fa9d29902ec784f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/tools/rust-analyzer/crates/hir-ty/src/infer/coerce.rs:149-157 | src/tools/rust-analyzer/crates/hir-ty/src/infer/unify.rs:423-431 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/infer/coerce.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6484a6da9a26cad8434037933ba6c67c197c690feccdadec07b23e989cde4c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): src/tools/rust-analyzer/crates/parser/src/grammar/attributes.rs:117-127 | src/tools/rust-analyzer/crates/parser/src/grammar/patterns.rs:519-526 \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/tools/rust-analyzer/crates/parser/src/grammar/attributes.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef18a574cd41e93ac79f874884cdd88442a30e9b45514189f8f30002593c4579"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): compiler/rustc_ast/src/ast_traits.rs:178-185 | compiler/rustc_ast/src/attr/mod.rs:61-68 \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":"compiler/rustc_ast/src/ast_traits.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaf771ae4d4b127e1bb08589e003eb708ef69c8ea3f6b3b21d96181f71057483"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): compiler/rustc_ast_pretty/src/pprust/state.rs:973-982 | compiler/rustc_hir_pretty/src/lib.rs:347-354 \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":"compiler/rustc_ast_pretty/src/pprust/state.rs"},"region":{"startLine":973}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a4103a2cad597349f5663c9304ebd674a881dab495cc737dc30b130f76c4f6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): compiler/rustc_hir_typeck/src/method/probe.rs:201-214 | src/tools/rust-analyzer/crates/hir-ty/src/method_resolution/probe.rs:149-162 \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":"compiler/rustc_hir_typeck/src/method/probe.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"41260ce0cb8f960a8ebe2a6baf0b39fcb5274a85e5da1e6371814592d0accd6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): library/alloc/src/io/buffered/bufreader.rs:500-508 | library/alloc/src/io/buffered/bufwriter.rs:691-696 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/alloc/src/io/buffered/bufreader.rs"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"c171f89ae88fa13fe1c9f3d2df9cc09b29a11860fd0d5cfaa3262cb583964659"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 4\u002B corresponding lines): library/std/src/sys/net/connection/socket/hermit.rs:292-295 | library/std/src/sys/net/connection/socket/solid.rs:355-358 | library/std/src/sys/net/connection/socket/unix.rs:614-617 | library/std/src/sys/net/connection/socket/windows.rs:438-441 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/net/connection/socket/hermit.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"9da6ddcb03c29cc47bb2ec23d0b94ca85fa5ca222bae9dc702a3dc556cbd76c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): library/std/src/sys/net/connection/socket/unix.rs:445-449 | library/std/src/sys/net/connection/socket/windows.rs:414-418 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/net/connection/socket/unix.rs"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4523c6ef5ae2d89003844005aac02f1a3715d74215b0713558c6c8a1ad1828a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): library/stdarch/crates/core_arch/src/powerpc/altivec.rs:2980-2998 | library/stdarch/crates/core_arch/src/s390x/vector.rs:1385-1401 \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":"library/stdarch/crates/core_arch/src/powerpc/altivec.rs"},"region":{"startLine":2980}}}],"partialFingerprints":{"codehealthFindingId/v1":"10a1f65c14ba8e1dbf0ce3454aa4a1784d4bb864fe5febaef36108aaf580a64a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): library/stdarch/crates/core_arch/src/powerpc/altivec.rs:2980-3010 | library/stdarch/crates/core_arch/src/s390x/vector.rs:1385-1414 \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":"library/stdarch/crates/core_arch/src/powerpc/altivec.rs"},"region":{"startLine":2980}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cf57018f8ee4871eec1e57a5bfa3c41e95bda00c23ddbeec6a37381d20e7585"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): library/stdarch/crates/core_arch/src/powerpc/altivec.rs:2980-2999 | library/stdarch/crates/core_arch/src/s390x/vector.rs:1385-1402 \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":"library/stdarch/crates/core_arch/src/powerpc/altivec.rs"},"region":{"startLine":2980}}}],"partialFingerprints":{"codehealthFindingId/v1":"21cc54fc33eb759e0baf5e2d2807b9f3c9fe38629c115e1cde54fd9898618a6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): library/stdarch/crates/core_arch/src/powerpc/altivec.rs:2980-3011 | library/stdarch/crates/core_arch/src/s390x/vector.rs:1385-1415 \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":"library/stdarch/crates/core_arch/src/powerpc/altivec.rs"},"region":{"startLine":2980}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f2b609ff59a4329ec434845f5dfbfd5fb4d44591f9b05317c64c5f2ceeeab96"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): library/stdarch/crates/core_arch/src/powerpc/altivec.rs:2980-3000 | library/stdarch/crates/core_arch/src/s390x/vector.rs:1385-1403 \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":"library/stdarch/crates/core_arch/src/powerpc/altivec.rs"},"region":{"startLine":2980}}}],"partialFingerprints":{"codehealthFindingId/v1":"68de45aa9ca6cf8903d706c4f1f0ccc9c0fe0d07ef22e00d59755bb4b715269c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): library/stdarch/crates/core_arch/src/powerpc/altivec.rs:2980-3012 | library/stdarch/crates/core_arch/src/s390x/vector.rs:1385-1416 \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":"library/stdarch/crates/core_arch/src/powerpc/altivec.rs"},"region":{"startLine":2980}}}],"partialFingerprints":{"codehealthFindingId/v1":"af46a4ca3663df9bf7854692767737726e1d2b962f09ea522e0bee545accc580"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/tools/rust-analyzer/crates/hir-def/src/lib.rs:1052-1058 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/def_id.rs:617-623 \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/tools/rust-analyzer/crates/hir-def/src/lib.rs"},"region":{"startLine":1052}}}],"partialFingerprints":{"codehealthFindingId/v1":"046475aa5ef3ad64d8b0635d84fa44ae3948a250e6aa032850d5e8f7483cec35"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs:45-55 | compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs:15-19 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6952dea1f0072f1a6f6cd21d0e15efdc3c88596b43e3814f32a54698efbb9e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): compiler/rustc_codegen_gcc/src/common.rs:225-233 | compiler/rustc_codegen_llvm/src/common.rs:321-329 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_gcc/src/common.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"551fb116a51972dca0fb875f2d5410a5d2f34230f6261a5a1b5542ee515b15b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): compiler/rustc_infer/src/infer/mod.rs:1359-1364 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/mod.rs:992-997 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_infer/src/infer/mod.rs"},"region":{"startLine":1359}}}],"partialFingerprints":{"codehealthFindingId/v1":"101b9928fe43e3fe8ec79b23640ace02fc727fb2a86368001bee960cdc153f5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): compiler/rustc_middle/src/ty/mod.rs:616-621 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/generic_arg.rs:414-419 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/ty/mod.rs"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb6f3dc435c8e7163d4917017566bfd34eca5fd83ea142cba6944e72a056a2af"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): library/stdarch/crates/core_arch/src/loongarch64/mod.rs:17-21 | library/stdarch/crates/core_arch/src/loongarch_shared/mod.rs:8-12 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/loongarch64/mod.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbcd8317b48c08d2bf499e9dc59e84edba90784396c69af174a89e8db8942016"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx2.rs:758-764 | library/stdarch/crates/core_arch/src/x86/sse41.rs:502-508 \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":"library/stdarch/crates/core_arch/src/x86/avx2.rs"},"region":{"startLine":758}}}],"partialFingerprints":{"codehealthFindingId/v1":"00d7898a327f8bb016ad8e5a838870fe0616bdf6293f6a7f2b65e3277c6dcf0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx2.rs:814-820 | library/stdarch/crates/core_arch/src/x86/sse41.rs:469-475 \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":"library/stdarch/crates/core_arch/src/x86/avx2.rs"},"region":{"startLine":814}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8ac1927ba368965ea0ec368fba83aa5b9938d4e5e18e075d9d8d1a99717a0ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx2.rs:844-850 | library/stdarch/crates/core_arch/src/x86/sse41.rs:599-605 \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":"library/stdarch/crates/core_arch/src/x86/avx2.rs"},"region":{"startLine":844}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0b2b8b7a08d3e87a32ba53c135dddb672dacfdfac4b8ff1d316bae461c49687"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx2.rs:902-908 | library/stdarch/crates/core_arch/src/x86/sse41.rs:566-572 \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":"library/stdarch/crates/core_arch/src/x86/avx2.rs"},"region":{"startLine":902}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbfbb79a97e9440833ea86178e4da84c2b9f49ef6455ffbe91265e5129d4caf0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512f.rs:37954-37963 | library/stdarch/crates/core_arch/src/x86/avx512fp16.rs:1182-1190 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":37954}}}],"partialFingerprints":{"codehealthFindingId/v1":"998bb7b287529f89126301b96f6ceab8a70bf535bea09c566b1edf5510a1e41e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): src/tools/rust-analyzer/crates/hir/src/semantics.rs:1648-1652 | src/tools/rust-analyzer/crates/syntax/src/algo.rs:18-22 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir/src/semantics.rs"},"region":{"startLine":1648}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9e64a1a674957ee1ef99dae5eb842ae26e00dbf9419700571cfcf6e17cab09d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): src/etc/gdb_trim_paths.py:13-16 | src/etc/lldb_trim_paths.py:13-17 \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":"src/etc/gdb_trim_paths.py"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"c70242d05152bac716aafbe73b3073c1943fd8fd4c56867b0484b90b761e801a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): compiler/rustc_data_structures/src/sync/worker_local.rs:119-125 | compiler/rustc_thread_pool/src/worker_local.rs:28-34 \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":"compiler/rustc_data_structures/src/sync/worker_local.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9e4dd9faef08a4039d43b8670ad24a104bcc7937a8a6848bec10d15aaa0c819"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): compiler/rustc_infer/src/infer/canonical/canonicalizer.rs:654-659 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/canonical/canonicalizer.rs:640-645 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_infer/src/infer/canonical/canonicalizer.rs"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea8f81f471d4dbf5ad39f4a622b74012f8b9e090404476e0177370758edf2fda"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): library/std/src/sys/env/hermit.rs:63-67 | library/std/src/sys/env/xous.rs:38-42 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/env/hermit.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"b650b85761075ae929f49e9609106877be6020aa2a5d0619725e4cd64cc51b38"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): library/std/src/sys/sync/mutex/futex.rs:68-84 | library/std/src/sys/sync/rwlock/futex.rs:334-344 \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":"library/std/src/sys/sync/mutex/futex.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"798c3988e86995490a03defd5cbc8fa564dbbb2609d39c7ac0493fb8a513238d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/tools/rust-analyzer/crates/rust-analyzer/src/cli/diagnostics.rs:15-24 | src/tools/rust-analyzer/crates/rust-analyzer/src/cli/unresolved_references.rs:13-22 \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/tools/rust-analyzer/crates/rust-analyzer/src/cli/diagnostics.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d39733fcd3a3132314e289a61e5457561f401b205d38cc19ba9afd3c43ccde0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 7\u002B corresponding lines): compiler/rustc_attr_parsing/src/attributes/diagnostic/on_const.rs:42-51 | compiler/rustc_attr_parsing/src/attributes/diagnostic/on_move.rs:42-48 | compiler/rustc_attr_parsing/src/attributes/diagnostic/on_type_error.rs:41-50 | compiler/rustc_attr_parsing/src/attributes/diagnostic/on_unknown.rs:39-45 \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":"compiler/rustc_attr_parsing/src/attributes/diagnostic/on_const.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b3f8a275d3b4bbc74ee89aedfd17177e53d127a52eb3c363a70f673b254076b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): compiler/rustc_trait_selection/src/solve/select.rs:22-31 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/select.rs:264-271 \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":"compiler/rustc_trait_selection/src/solve/select.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"5db8fc04ed4601a4c0806218353d6cd871616ee85e2f58fad375b7746c1b8a20"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): library/alloc/src/rcs/arc.rs:1857-1866 | library/alloc/src/rcs/rc.rs:1684-1693 \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":"library/alloc/src/rcs/arc.rs"},"region":{"startLine":1857}}}],"partialFingerprints":{"codehealthFindingId/v1":"89cda31190b0fc7d1b75de9937e58e93b26c48c913277a7c8220f7f7af5edb09"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): library/core/src/slice/iter.rs:1112-1124 | library/core/src/str/iter.rs:949-961 \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":"library/core/src/slice/iter.rs"},"region":{"startLine":1112}}}],"partialFingerprints":{"codehealthFindingId/v1":"54aa02cb1fe276c9e141b2d7dd3c7c164ac1de45f1e3e197e7f51243399f8f56"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): library/std/src/sys/net/connection/socket/hermit.rs:48-52 | library/std/src/sys/net/connection/socket/solid.rs:123-127 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/net/connection/socket/hermit.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b3b80682f36349e73a8bf20781619e81faa57a8778eea6f8d18cfac910d6f29"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/tools/clippy/clippy_lints/src/methods/or_then_unwrap.rs:64-72 | src/tools/clippy/clippy_utils/src/lib.rs:306-314 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/methods/or_then_unwrap.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bcdc75adb40faaecaafd2a69b848912756f6e7179cf1ff22513b7e15c07e0a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/tools/rust-analyzer/crates/hir-def/src/lib.rs:1175-1181 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/def_id.rs:197-203 \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/tools/rust-analyzer/crates/hir-def/src/lib.rs"},"region":{"startLine":1175}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ff17cab4e0a42f646b93913d1172bab0e84afb5eb55499af9189708faf4fba0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): src/tools/rust-analyzer/crates/parser/src/grammar/patterns.rs:438-443 | src/tools/rust-analyzer/crates/parser/src/grammar/types.rs:222-227 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/parser/src/grammar/patterns.rs"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"02d5e11e8c6df404baee3f86059422c4ce0bb503ac5f2a67f09606b3b34048c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): src/tools/rust-analyzer/crates/parser/src/grammar/patterns.rs:463-469 | src/tools/rust-analyzer/crates/parser/src/grammar/types.rs:139-144 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/parser/src/grammar/patterns.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"c59c27fe4222c1bcd535876b907f2af307e47c0fd320402da5a0f2434464d816"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): compiler/rustc_ast/src/ast_traits.rs:170-177 | compiler/rustc_ast/src/attr/mod.rs:199-204 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ast/src/ast_traits.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"76d626895fc0c582cecf0d4ca8595e2a2674d0946c8ce66ce70d8f0d482b38ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): compiler/rustc_attr_ir/src/attr.rs:42-52 | compiler/rustc_attr_parsing/src/parser.rs:44-49 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_attr_ir/src/attr.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c23af76960ae22df021b9c75e13436f4a966e993864583087772cda2567b0d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): compiler/rustc_const_eval/src/interpret/operand.rs:533-541 | compiler/rustc_const_eval/src/interpret/place.rs:276-284 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_const_eval/src/interpret/operand.rs"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f8a5d7d4984d9751726d3f3e2a3f957b41326d19ef501cb5a1a7069b1a16f7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): compiler/rustc_const_eval/src/util/type_name.rs:139-146 | compiler/rustc_middle/src/ty/print/pretty.rs:2513-2524 \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":"compiler/rustc_const_eval/src/util/type_name.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2fbb2e476d10d627d8037dea68b90fccf6c5c6935aa7746fdbaf22f251ba940"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): compiler/rustc_expand/src/base.rs:668-676 | compiler/rustc_expand/src/expand.rs:2075-2083 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_expand/src/base.rs"},"region":{"startLine":668}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4af321d53d2f4c3f13ca44dc1b2228c181607df5753ec50034280e06f5dc3d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): compiler/rustc_infer/src/infer/mod.rs:840-847 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/mod.rs:659-666 \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":"compiler/rustc_infer/src/infer/mod.rs"},"region":{"startLine":840}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a4a2685d369f141f3038fbf6ccc35667e7b6e96652ef83e00bf70fc4e72c78c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): compiler/rustc_lint/src/early.rs:104-110 | compiler/rustc_lint/src/late.rs:170-176 \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":"compiler/rustc_lint/src/early.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"89b2948fd3b5067471caff1a601aef0f922aaa9fe23a792da3b72522f7453f54"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): library/stdarch/crates/core_arch/src/loongarch64/lasx/portable.rs:148-157 | library/stdarch/crates/core_arch/src/loongarch64/lsx/portable.rs:106-108 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/loongarch64/lasx/portable.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"afa231e4ff53ef5a770a3630bac03d96c3376d614de23f3c3fb0be6a031f2197"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/tools/clippy/clippy_utils/src/lib.rs:3450-3459 | src/tools/clippy/clippy_utils/src/visitors.rs:790-799 \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/tools/clippy/clippy_utils/src/lib.rs"},"region":{"startLine":3450}}}],"partialFingerprints":{"codehealthFindingId/v1":"50a94cc0db9266ef1d2cb3736f42272dbad606d24b7234a6712fa7559fe4d4ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): compiler/rustc_ast/src/ast.rs:296-302 | compiler/rustc_hir/src/hir.rs:593-600 \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":"compiler/rustc_ast/src/ast.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"4db5735c52d9bead76bd400401ae566ae99886de7bad9d153a021db710bc3db9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): compiler/rustc_hir_typeck/src/op.rs:1266-1273 | src/tools/rust-analyzer/crates/hir-ty/src/infer/op.rs:421-428 \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":"compiler/rustc_hir_typeck/src/op.rs"},"region":{"startLine":1266}}}],"partialFingerprints":{"codehealthFindingId/v1":"227120706aee788862df38aec7e1259df981d741806b03d0af722659c9f3148e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): compiler/rustc_infer/src/infer/canonical/instantiate.rs:110-117 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/canonical/instantiate.rs:152-159 \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":"compiler/rustc_infer/src/infer/canonical/instantiate.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eea7ffde5696c9f022dc9db818d633ecacf0e0a2db73f96a8659790017de130"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): compiler/rustc_mir_build/src/thir/pattern/const_to_pat.rs:232-240 | compiler/rustc_mir_build/src/thir/pattern/mod.rs:462-470 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_build/src/thir/pattern/const_to_pat.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"4152aac149cc0210732c0272d9185553dfe7b105130ed3b03bf7e3f944eca517"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): compiler/rustc_mir_transform/src/copy_prop.rs:127-137 | compiler/rustc_mir_transform/src/gvn.rs:2162-2169 \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":"compiler/rustc_mir_transform/src/copy_prop.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fb087e81f3905db4ab7ee823cc322d11c3f4b11a4ef1b69ae9520322ef7aa87"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): library/alloc/src/io/cursor.rs:32-42 | library/core/src/io/cursor.rs:321-331 \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":"library/alloc/src/io/cursor.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"27c9e1326ebb52c8aed34bb611c4b8fe2dee5a3827265ce5dea3b6c686c35a63"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): library/alloc/src/rcs/arc.rs:2234-2247 | library/alloc/src/rcs/rc.rs:405-417 \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":"library/alloc/src/rcs/arc.rs"},"region":{"startLine":2234}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1ec97e2d526635d234a2c92adcdc7a3699a3a2572fd278aee02ab5eef7d5028"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): library/alloc/src/rcs/arc.rs:2338-2348 | library/alloc/src/rcs/rc.rs:2435-2445 \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":"library/alloc/src/rcs/arc.rs"},"region":{"startLine":2338}}}],"partialFingerprints":{"codehealthFindingId/v1":"c51b3c345c87b852b6281547d5ab7a92c988313644277955cb5c79cff3228d10"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): library/proc_macro/src/lib.rs:488-493 | src/librustdoc/html/url_parts_builder.rs:131-136 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/proc_macro/src/lib.rs"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e9cd7665d184310cca3d9157ae63492456585505a28c010462650e04a5737dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx2.rs:2753-2762 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:20706-20716 \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":"library/stdarch/crates/core_arch/src/x86/avx2.rs"},"region":{"startLine":2753}}}],"partialFingerprints":{"codehealthFindingId/v1":"baf6dfca7bf38ac7e799ac76ea582caf61182b13bb7b3ebb6d1565245d8c7329"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512bw.rs:7519-7528 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:20615-20624 \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":"library/stdarch/crates/core_arch/src/x86/avx512bw.rs"},"region":{"startLine":7519}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c59194fc58e6f33e74f815900b28c4278bf1b7dff5a095c96e3685de0788afa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512f.rs:13308-13314 | library/stdarch/crates/core_arch/src/x86/sse41.rs:633-639 \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":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":13308}}}],"partialFingerprints":{"codehealthFindingId/v1":"4331acf5c4c8788eb203bf380debec4eb45dbea0b5515a009edd9c4d196aefd3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): src/tools/clippy/clippy_lints/src/drop_forget_ref.rs:143-150 | compiler/rustc_lint/src/drop_forget_useless.rs:314-321 \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/tools/clippy/clippy_lints/src/drop_forget_ref.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ee09be9fa3b2705a093a3804cd15fa5a7060d5fc9f80aa45d29da361bee780e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): compiler/rustc_ast_ir/src/lib.rs:34-43 | src/tools/rust-analyzer/crates/hir-ty/src/primitive.rs:6-15 \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":"compiler/rustc_ast_ir/src/lib.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"964fe0816d397b3e13d850f3a54a628743de820cb39efd3b8a17f068ff3308b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): compiler/rustc_ast_ir/src/lib.rs:110-119 | src/tools/rust-analyzer/crates/hir-ty/src/primitive.rs:17-26 \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":"compiler/rustc_ast_ir/src/lib.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfe962b9d72b4ffbdf9aaf533ac29ad467983f1e52fd934c495d39a498410c9b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): compiler/rustc_ast_pretty/src/pprust/state/expr.rs:112-118 | compiler/rustc_hir_pretty/src/lib.rs:1306-1312 \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":"compiler/rustc_ast_pretty/src/pprust/state/expr.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"70e27bcc6499e5bc317e5057795efa3e58649117d7fefc36f003e80289f09fb2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): compiler/rustc_borrowck/src/polonius/legacy/loan_kills.rs:20-25 | compiler/rustc_borrowck/src/type_check/liveness/mod.rs:204-210 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/polonius/legacy/loan_kills.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"b276c02a87a5f524975584910f00faa65e143bc2b4ca59aa1fe66e80e2f24231"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): compiler/rustc_borrowck/src/polonius/liveness_constraints.rs:110-116 | compiler/rustc_lint/src/impl_trait_overcaptures.rs:560-566 \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":"compiler/rustc_borrowck/src/polonius/liveness_constraints.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"e856d339bcf31fa1b20de684f37347f53c8c81b05290fc3842c1c9c30488366b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): compiler/rustc_middle/src/ty/sty.rs:582-590 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/util.rs:225-234 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/ty/sty.rs"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ec1963c401da0e068691a616b2e280aec094381bb1cb96902068a6236e554ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): library/std/src/sys/sync/condvar/pthread.rs:22-29 | library/std/src/sys/sync/mutex/pthread.rs:19-28 \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":"library/std/src/sys/sync/condvar/pthread.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"69d57a05dec17dbfe40563778fb8c80575690035d3453f7b181be5a3f95ec619"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): library/std/src/sys/sync/mutex/itron.rs:63-67 | library/std/src/sys/sync/rwlock/solid.rs:92-96 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/sync/mutex/itron.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e032ba120e6c488356f109f66facd2e095257421ffcc7410f79a485bc197538"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): library/stdarch/crates/core_arch/src/macros.rs:229-237 | library/stdarch/crates/core_arch/src/s390x/vector.rs:353-361 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/macros.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"3496161f2fa93045013fe391f497ea2539176b4d6eccbc1b046900bbba2d867e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx.rs:2997-3004 | library/stdarch/crates/core_arch/src/x86/avx512dq.rs:1356-1362 \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":"library/stdarch/crates/core_arch/src/x86/avx.rs"},"region":{"startLine":2997}}}],"partialFingerprints":{"codehealthFindingId/v1":"65ca713fbc5d318fda15c4aa602ee92335e28ad2d09423d71c54d8bf7c69f987"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512bw.rs:7149-7158 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:20141-20150 \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":"library/stdarch/crates/core_arch/src/x86/avx512bw.rs"},"region":{"startLine":7149}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a3aec0a1abbba9ae16d9917fde3110f422565b175532e49f495087fd88c06d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): library/stdarch/crates/core_arch/src/x86/sse2.rs:1443-1451 | library/stdarch/crates/core_arch/src/x86_64/sse2.rs:80-88 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/sse2.rs"},"region":{"startLine":1443}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a1ee40e8d7106b7a23f6dc8aa43cb6f97a3011e637b9634fc4e8b94dd16265d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): compiler/rustc_hir_typeck/src/upvar.rs:2158-2163 | src/tools/rust-analyzer/crates/hir-ty/src/infer/closure/analysis.rs:1160-1165 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/upvar.rs"},"region":{"startLine":2158}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ad06d9254b671c6adbe8a07732305d6e6e71203a3a8ac8698e95aaa19ff9383"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): compiler/rustc_middle/src/ty/generic_args.rs:704-707 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/generic_arg.rs:647-650 \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":"compiler/rustc_middle/src/ty/generic_args.rs"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ec06d87ec861ef2faede40e502e0b005d1f7024d3cedd4a1460d494dcde26c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): library/stdarch/crates/core_arch/src/macros.rs:218-226 | library/stdarch/crates/core_arch/src/s390x/vector.rs:421-429 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/macros.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5729a6b8963ed46b4e432f85d8b1b4650e69b41fe8213ed41d528461207fa3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): library/stdarch/crates/core_arch/src/x86/sse.rs:2069-2077 | library/stdarch/crates/core_arch/src/x86/sse2.rs:1415-1423 | library/stdarch/crates/core_arch/src/x86/sse4a.rs:124-132 \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":"library/stdarch/crates/core_arch/src/x86/sse.rs"},"region":{"startLine":2069}}}],"partialFingerprints":{"codehealthFindingId/v1":"21526a1a670ada3e820121a420879de31f619ee9e10f0b306ff391d86a35ad67"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): library/stdarch/crates/core_arch/src/x86/sse2.rs:2723-2731 | library/stdarch/crates/core_arch/src/x86/sse4a.rs:150-158 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/sse2.rs"},"region":{"startLine":2723}}}],"partialFingerprints":{"codehealthFindingId/v1":"40630e7795d0d30a8d0a66d8ad98b8edaf04b659aadf7094872d5099b5ec13c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): src/tools/rust-analyzer/crates/hir-def/src/visibility.rs:370-374 | src/tools/rust-analyzer/crates/hir/src/lib.rs:944-948 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/visibility.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"315195448e944f68a3655e7802855ea694b811de79c6372fc730cc60eb10633c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 1\u002B corresponding lines): src/tools/rust-analyzer/crates/hir-ty/src/next_solver/allocation.rs:73-73 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/consts.rs:43-43 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/predicate.rs:260-260 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/region.rs:33-33 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/ty.rs:64-64 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 1 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/next_solver/allocation.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3d82e4b170890d4872c2ba8920b3970912096fc791d335d9ba6ba45d1c25d0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): src/tools/rust-analyzer/crates/intern/src/intern.rs:267-271 | src/tools/rust-analyzer/crates/intern/src/intern_slice.rs:227-231 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/intern/src/intern.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"a29e3184bddfe28c7298f2bf15e19cbefd3f27049fb5013588798be70536bbff"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): compiler/rustc_infer/src/infer/type_variable.rs:356-358 | compiler/rustc_infer/src/infer/unify_key.rs:147-149 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_infer/src/infer/type_variable.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"f22b790ec1e3825b632e13cad340a86f435993520c020f3441c4980ddfb2bbbd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): compiler/rustc_middle/src/mir/terminator.rs:88-90 | src/tools/rust-analyzer/crates/hir-ty/src/mir.rs:375-377 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/mir/terminator.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2e32b4ec50a86ebbe59baa8f8a502bd798b83a6ef9a789b6af5412c0d52831d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): compiler/rustc_type_ir/src/predicate.rs:159-165 | compiler/rustc_type_ir/src/term_kind.rs:277-284 | compiler/rustc_type_ir/src/ty_kind.rs:603-609 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_type_ir/src/predicate.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"981a23e53e4935105992ec24920daef549c2bf425dee151474af2eef79cbf4b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): library/alloc/src/rcs/arc.rs:2170-2176 | library/alloc/src/rcs/rc.rs:1946-1952 \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":"library/alloc/src/rcs/arc.rs"},"region":{"startLine":2170}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3d2500d7a752e01bb6619bd2b8fe6f15e4e1c6895b9719ced2f851d584e5879"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/tools/clippy/clippy_lints/src/derivable_impls.rs:71-77 | src/tools/clippy/clippy_utils/src/hir_utils.rs:1729-1735 \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/tools/clippy/clippy_lints/src/derivable_impls.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"36aa938b5bb75fb2ea01e9d244cd8fb675c7249298221021c73b77244c9f5a98"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): src/tools/miri/cargo-miri/src/util.rs:126-129 | src/tools/miri/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":"src/tools/miri/cargo-miri/src/util.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c6ff77b761740490c8b76241081f46661008f5cba79193cfc7bb4e92e39a27b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): compiler/rustc_ast/src/ast.rs:1080-1086 | src/tools/miri/src/machine.rs:233-241 \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":"compiler/rustc_ast/src/ast.rs"},"region":{"startLine":1080}}}],"partialFingerprints":{"codehealthFindingId/v1":"70850334dbe52bd09f446b17833c56517d747a9cb7decf57c960058e36123a95"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): compiler/rustc_builtin_macros/src/format_foreign/printf/mod.rs:580-589 | compiler/rustc_builtin_macros/src/format_foreign/shell/mod.rs:102-111 \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":"compiler/rustc_builtin_macros/src/format_foreign/printf/mod.rs"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"0462adbf552ec2a406323fe340788148d7b0034b58ab6c912430574098c346be"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): compiler/rustc_middle/src/hir/place.rs:128-131 | src/tools/rust-analyzer/crates/hir-ty/src/infer/closure/analysis/expr_use_visitor.rs:122-129 \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":"compiler/rustc_middle/src/hir/place.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"20e7895a2a090d3f2cb0afba70f470c79ae39764c3944f08969173cba57fd7c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): compiler/rustc_mir_transform/src/coroutine/mod.rs:458-466 | compiler/rustc_mir_transform/src/inline.rs:1265-1272 \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":"compiler/rustc_mir_transform/src/coroutine/mod.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e0a2791980df479a95397d2fc7f684ecdba022554f890bcf49fac55373d05d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): compiler/rustc_passes/src/upvars.rs:46-51 | src/tools/clippy/clippy_utils/src/usage.rs:110-115 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_passes/src/upvars.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1984e393c2ff4ee172082b48b6dbd555c7fde87aa6c3ae9eaf48b894999944c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): library/compiler-builtins/compiler-builtins/src/mem/x86_64.rs:24-32 | library/std/src/sys/pal/sgx/abi/usercalls/alloc.rs:373-383 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/compiler-builtins/compiler-builtins/src/mem/x86_64.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ba6fdac5a84741fdc276db717de467408870df418a7bedaf6a3769cc1eec67d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): library/core/src/iter/adapters/mod.rs:180-187 | library/core/src/iter/adapters/take_while.rs:59-66 \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":"library/core/src/iter/adapters/mod.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9657da76865d9b33f3a908cb42b40d0a1f7af7f5ea1629dc59af213bb6d01c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): library/stdarch/crates/core_arch/src/macros.rs:207-215 | library/stdarch/crates/core_arch/src/s390x/vector.rs:391-402 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/macros.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"30eb57a6bdc8711e5ef9507199a642ddc1eb66431ff33e7095f8d02e5c64a8cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): src/tools/rust-analyzer/crates/syntax/src/ast/expr_ext.rs:237-242 | src/tools/rust-analyzer/crates/syntax/src/ast/node_ext.rs:1151-1156 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/syntax/src/ast/expr_ext.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"c58b5324d3a917119fc69e552eaa41de0d7365782f67a846523e1509f3e21e78"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): src/tools/rust-analyzer/crates/syntax/src/ast/expr_ext.rs:473-478 | src/tools/rust-analyzer/crates/syntax/src/ast/node_ext.rs:1173-1178 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/syntax/src/ast/expr_ext.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"cceeb432ee15fc09608380644c7de2902eab33344548eb910f47382b99ead398"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): compiler/rustc_ast_pretty/src/pprust/state.rs:1874-1880 | compiler/rustc_hir_pretty/src/lib.rs:1821-1827 \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":"compiler/rustc_ast_pretty/src/pprust/state.rs"},"region":{"startLine":1874}}}],"partialFingerprints":{"codehealthFindingId/v1":"fede7b6799086bac872132acabe018d88cd5b585f677a5b425ef7d19706084c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): compiler/rustc_const_eval/src/interpret/operand.rs:240-246 | compiler/rustc_const_eval/src/interpret/place.rs:108-114 \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":"compiler/rustc_const_eval/src/interpret/operand.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"53e84bffc62e4d43eef17c8701033721cf087f111b565c960f11a61d32569f82"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): compiler/rustc_const_eval/src/interpret/operand.rs:492-498 | compiler/rustc_const_eval/src/interpret/place.rs:216-222 \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":"compiler/rustc_const_eval/src/interpret/operand.rs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"5582fad991ffcd66e9ddd9662347c3ead0c5b1168fdaaded22d2352d8b199118"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): compiler/rustc_hir/src/pat_util.rs:50-57 | src/tools/rust-analyzer/crates/hir-ide/src/diagnostics/match_check/pat_util.rs:54-61 | src/tools/rust-analyzer/crates/hir-ty/src/utils.rs:210-217 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir/src/pat_util.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8ed4da599a279538d894fad97f0f3e893a15c5ad3bbb9ea0029c29c3a860547"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): compiler/rustc_hir_typeck/src/closure.rs:597-603 | src/tools/rust-analyzer/crates/hir-ty/src/infer/closure.rs:711-729 \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":"compiler/rustc_hir_typeck/src/closure.rs"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"37733a05be0f3b6a15dc2a2628abdbebe18912d0fc03d55c707c92469dc7b8d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): compiler/rustc_middle/src/ty/sty.rs:1383-1388 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/ty.rs:526-531 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/ty/sty.rs"},"region":{"startLine":1383}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa361ef4dc8dc8c839b77aed0476a2bc0f7a9ce48deb4f1f6aa40bbcf41ea23c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): library/std/src/sys/sync/once/futex.rs:91-98 | library/std/src/sys/sync/once/queue.rs:139-146 \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":"library/std/src/sys/sync/once/futex.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"40f918e6a8231ce97fa59cbeb9951713a6ede8f96bfe5b7220c2a0d192a3d303"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 4\u002B corresponding lines): src/tools/rust-analyzer/crates/hir-ty/src/next_solver/allocation.rs:29-32 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/consts/valtree.rs:348-351 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/interner.rs:755-758 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/opaques.rs:65-72 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/region.rs:52-55 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/next_solver/allocation.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8e14270ebd6eb55593ef875060719693c0b94cabbddac018bb8f8b24476b715"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): compiler/rustc_arena/src/lib.rs:367-375 | library/proc_macro/src/bridge/arena.rs:27-33 \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":"compiler/rustc_arena/src/lib.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"13c57c228ec1e7e981dd5760d0d27f8dd255c3076dc2ac45b777f66c6bf1e236"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 6\u002B corresponding lines): compiler/rustc_attr_parsing/src/attributes/crate_level.rs:24-30 | compiler/rustc_attr_parsing/src/attributes/path.rs:21-26 | compiler/rustc_attr_parsing/src/attributes/rustc_allocator.rs:33-38 | compiler/rustc_attr_parsing/src/attributes/rustc_internal.rs:1106-1111 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 6 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_attr_parsing/src/attributes/crate_level.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"27f8b33ecb845a616220c1bccd89cbdcf9f431b5faa34b20029fa8b18b74a88f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): compiler/rustc_codegen_gcc/src/consts.rs:52-60 | compiler/rustc_codegen_llvm/src/consts.rs:179-187 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_gcc/src/consts.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"96331e9647490567ecc56a858a875db4beb41e60d76d2b9a4a4af4a4c349c89f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): compiler/rustc_infer/src/infer/opaque_types/table.rs:63-66 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/opaque_types/table.rs:64-67 \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":"compiler/rustc_infer/src/infer/opaque_types/table.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b0ea94f87110da15c6cbb446515d260e8fc3a9228fce084aa3542aa95721ded"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): compiler/rustc_infer/src/infer/relate/lattice.rs:86-89 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/relate/lattice.rs:98-101 \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":"compiler/rustc_infer/src/infer/relate/lattice.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8f5a9162f8df99a120ed8959d23c9ffef27e10b5bb534221a8aa3ed97f0d642"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): compiler/rustc_type_ir/src/solve/mod.rs:1135-1140 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/mod.rs:1321-1326 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_type_ir/src/solve/mod.rs"},"region":{"startLine":1135}}}],"partialFingerprints":{"codehealthFindingId/v1":"0301494d5ffd559a1225693830f3e1a3adbc8ebb45a8fe80f12e52e2b05b4780"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): library/std/src/sys/process/unix/unsupported/wait_status.rs:46-56 | library/std/src/sys/process/windows.rs:787-792 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/process/unix/unsupported/wait_status.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d3ae9981b2b03bc650b16109ef3cef6e843579985f3927975011fa2f4c3a0d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): src/bootstrap/src/core/build_steps/dist.rs:1030-1036 | src/bootstrap/src/core/build_steps/tool.rs:561-566 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/build_steps/dist.rs"},"region":{"startLine":1030}}}],"partialFingerprints":{"codehealthFindingId/v1":"f89aae6deceb1e755610218fe3ba68f09542c15aa85118ff4430ac0ed1c92e9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/bootstrap/src/core/build_steps/test.rs:385-393 | src/bootstrap/src/core/build_steps/tool.rs:678-686 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/build_steps/test.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"bccab3bf01327435f960b50b4ea3b6cf934480468e3323fcaba31c6889165440"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/bootstrap/src/core/build_steps/test.rs:491-499 | src/bootstrap/src/core/build_steps/tool.rs:621-634 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/build_steps/test.rs"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"a077619d36a2e3a54d713b74610c7eed3c44e3b1b68da98ccbce0878334fd759"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/tools/clippy/clippy_lints/src/loops/explicit_into_iter_loop.rs:34-42 | src/tools/clippy/clippy_lints/src/loops/explicit_iter_loop.rs:92-101 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/loops/explicit_into_iter_loop.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"fac95fad44cf82429ed323a494c5a199bcb1207685ad0f738a0d13348e032c1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/tools/rust-analyzer/crates/ide-diagnostics/src/handlers/non_exhaustive_record_expr.rs:10-18 | src/tools/rust-analyzer/crates/ide-diagnostics/src/handlers/union_expr_must_have_exactly_one_field.rs:9-17 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-diagnostics/src/handlers/non_exhaustive_record_expr.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"79a9b48e0c8b3e3a2aa4cba34ae4ff2fa6d01dd1c1437fc0e55ccf7c3b48e670"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): compiler/rustc_data_structures/src/sso/map.rs:358-364 | compiler/rustc_data_structures/src/sso/set.rs:170-176 | src/tools/rust-analyzer/crates/stdx/src/thin_map.rs:862-868 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_data_structures/src/sso/map.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"67cd92caf4ba1de048f2f8ab885da0663b00ee725f6e6791af06085dc6bdd2d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): compiler/rustc_hir_typeck/src/coercion.rs:215-218 | src/tools/rust-analyzer/crates/hir-ty/src/infer/coerce.rs:190-193 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/coercion.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"e00d24049ce7de949dc22c9d0a9c7675aa9766c0d5f9c5737ff17d4da542a55c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): library/alloc/src/collections/vec_deque/iter.rs:60-62 | library/alloc/src/collections/vec_deque/iter_mut.rs:133-135 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/alloc/src/collections/vec_deque/iter.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"2301ffa44cdb62b3c62ff772990d52f32f62e525382fd7717d8592bf5c5510fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): library/alloc/src/rcs/arc.rs:4477-4487 | library/alloc/src/rcs/rc.rs:4789-4799 \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":"library/alloc/src/rcs/arc.rs"},"region":{"startLine":4477}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfc247f0b5a9a4c3e5f8a6bc175a43bd7398ce8d5eaddfea517d4c5ec8f2bb5f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): library/compiler-builtins/libm/src/math/ceil.rs:30-39 | library/compiler-builtins/libm/src/math/floor.rs:16-25 \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":"library/compiler-builtins/libm/src/math/ceil.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff4242445abe215be05c0bbae2f6823ac3e6494ba826eafdb7a3d47f95232969"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): library/std/src/sys/net/connection/xous/tcpstream.rs:175-180 | library/std/src/sys/net/connection/xous/udp.rs:353-358 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/net/connection/xous/tcpstream.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"496bc868cf54c0418ddf175b17de4db842fcc50d9d1960ce4039a36c865c0383"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): library/std/src/sys/net/connection/xous/tcpstream.rs:182-187 | library/std/src/sys/net/connection/xous/udp.rs:360-365 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/net/connection/xous/tcpstream.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"522af79d74feec7aad982b9b4319b282bd9628e4228a681887650df9a8a9dc3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512bf16.rs:266-271 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:24412-24417 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512bf16.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"96c0bce36cc28c10f0cd17d809afefe780c4fe9c6ecf44c7a7575d08bb4ddc3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512bf16.rs:311-316 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:24358-24363 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512bf16.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c5cf19cdf5957199589149bb1a44a69ffb33aac2129a64bb5caa4a098c1d6e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512bf16.rs:357-362 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:24304-24309 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512bf16.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"75fba9b47d28ed38dbae3de04ab69a3d712d92ac70063682733f85145780cb2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512bw.rs:8135-8140 | library/stdarch/crates/core_arch/src/x86/avx512vbmi2.rs:809-814 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512bw.rs"},"region":{"startLine":8135}}}],"partialFingerprints":{"codehealthFindingId/v1":"c18701a80c46c528456e9377fa77d2922cda1fa5005f5f3324092d1667995672"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512bw.rs:8173-8178 | library/stdarch/crates/core_arch/src/x86/avx512vbmi2.rs:1241-1246 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512bw.rs"},"region":{"startLine":8173}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6eab617ba8005645f4690173dde46a0184ea97d6be6e615f42591cd617cab62"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512bw.rs:8203-8208 | library/stdarch/crates/core_arch/src/x86/avx512vbmi2.rs:857-862 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512bw.rs"},"region":{"startLine":8203}}}],"partialFingerprints":{"codehealthFindingId/v1":"b80c5ad2f241cf1d054ab4408621ddd3bbaa6382d12b5eb9e180657d444f04e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512bw.rs:8241-8246 | library/stdarch/crates/core_arch/src/x86/avx512vbmi2.rs:1289-1294 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512bw.rs"},"region":{"startLine":8241}}}],"partialFingerprints":{"codehealthFindingId/v1":"f55ce15aa2a18d9c6c10c48a28b648e835e92285ba29850c3c38ba47e5f9ee7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512bw.rs:8266-8271 | library/stdarch/crates/core_arch/src/x86/avx512vbmi2.rs:905-910 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512bw.rs"},"region":{"startLine":8266}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd6e8c1afd64acf1970c6e95ef5e953a4df7170f12b0fd35ccfd1586a25a9d5f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512bw.rs:8294-8299 | library/stdarch/crates/core_arch/src/x86/avx512vbmi2.rs:1337-1342 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512bw.rs"},"region":{"startLine":8294}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ef70232afbcac21318a0404b724fd569f13f4d5567ab449ae09d4f4540c737a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 6\u002B corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512f.rs:23931-23936 | library/stdarch/crates/core_arch/src/x86/avx512vbmi2.rs:665-670 | library/stdarch/crates/core_arch/src/x86/avx512vnni.rs:25-30 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 6 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":23931}}}],"partialFingerprints":{"codehealthFindingId/v1":"30836a81a388083359ab70289bbbf3842527df836b6fbe7707490bcd0c3ee5fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 6\u002B corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512f.rs:23969-23974 | library/stdarch/crates/core_arch/src/x86/avx512vbmi2.rs:1097-1102 | library/stdarch/crates/core_arch/src/x86/avx512vnni.rs:164-169 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 6 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":23969}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8bd4b31bf856a272bfb937b7eabc242544cc2c770a10b1b4737f226d54d9e1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 6\u002B corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512f.rs:23999-24004 | library/stdarch/crates/core_arch/src/x86/avx512vbmi2.rs:713-718 | library/stdarch/crates/core_arch/src/x86/avx512vnni.rs:75-80 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 6 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":23999}}}],"partialFingerprints":{"codehealthFindingId/v1":"35da1bda49253fb631b57c5939d89cf8c26085840925d4524a1d3669966bfe12"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 6\u002B corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512f.rs:24037-24042 | library/stdarch/crates/core_arch/src/x86/avx512vbmi2.rs:1145-1150 | library/stdarch/crates/core_arch/src/x86/avx512vnni.rs:214-219 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 6 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":24037}}}],"partialFingerprints":{"codehealthFindingId/v1":"d91f8cf7b9407c3f9103fa917cf5dbfdb3a418890034b9ea5677cce883fed88a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 6\u002B corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512f.rs:24062-24067 | library/stdarch/crates/core_arch/src/x86/avx512vbmi2.rs:761-766 | library/stdarch/crates/core_arch/src/x86/avx512vnni.rs:125-130 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 6 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":24062}}}],"partialFingerprints":{"codehealthFindingId/v1":"d78bdbcb2113cec2b5132acfc9082ff8c9785caa2e033fae86638cbb389a60f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 6\u002B corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512f.rs:24090-24095 | library/stdarch/crates/core_arch/src/x86/avx512vbmi2.rs:1193-1198 | library/stdarch/crates/core_arch/src/x86/avx512vnni.rs:264-269 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 6 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":24090}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5995fe2321a627da474f3665db2a3905530741b72c3ea0a6d308d1f5bf129a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512f.rs:24120-24125 | library/stdarch/crates/core_arch/src/x86/avx512vbmi2.rs:521-526 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":24120}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cb3e57874eed544298b94bfd1b2008d8b258c98a6ac62b190717a300e1edad3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512f.rs:24158-24163 | library/stdarch/crates/core_arch/src/x86/avx512vbmi2.rs:953-958 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":24158}}}],"partialFingerprints":{"codehealthFindingId/v1":"904703a8b2f4ff235abb23911ecd7b716b6120ccb25e42bf37c1d020c2f55f9b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512f.rs:24188-24193 | library/stdarch/crates/core_arch/src/x86/avx512vbmi2.rs:569-574 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":24188}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f83ecbce348d5c4bf624fd57d9b081f5dfa9ce385aa6e87b29ac7d7edb51234"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512f.rs:24226-24231 | library/stdarch/crates/core_arch/src/x86/avx512vbmi2.rs:1001-1006 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":24226}}}],"partialFingerprints":{"codehealthFindingId/v1":"f91e84198e3210a76a27f7d645465346150dbb9f90c052992c1f81914a56189c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512f.rs:24251-24256 | library/stdarch/crates/core_arch/src/x86/avx512vbmi2.rs:617-622 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":24251}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fd2e157d2c981a01b69a393008e6014e02869af26bfe645cb8d06b087f77568"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512f.rs:24279-24284 | library/stdarch/crates/core_arch/src/x86/avx512vbmi2.rs:1049-1054 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":24279}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6181023b3f1d7dbc6949e65ad19743832c3e010dce0e8a75038c9b27f043304"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/bootstrap/src/core/build_steps/test.rs:3979-3989 | src/bootstrap/src/core/build_steps/tool.rs:932-940 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/build_steps/test.rs"},"region":{"startLine":3979}}}],"partialFingerprints":{"codehealthFindingId/v1":"adf627cf501e1499536870ff0b76bf395b4069a042aaa0ebde315247642b22bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): src/tools/clippy/clippy_lints/src/methods/single_char_add_str.rs:74-76 | src/tools/clippy/clippy_lints/src/useless_vec.rs:306-308 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/methods/single_char_add_str.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"45b136e47dee374b5f2635b4e5531b2eb59ee6766604af862bcdbf01403e2af6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): src/tools/rust-analyzer/crates/proc-macro-api/src/bidirectional_protocol/msg.rs:192-197 | src/tools/rust-analyzer/crates/proc-macro-api/src/legacy_protocol/msg.rs:166-171 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/proc-macro-api/src/bidirectional_protocol/msg.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"558cc06051ee568e9b62f8b57c3d6ccf0f0a2cdda6b8791de95eb4dde9c53499"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): compiler/rustc_hir_pretty/src/lib.rs:2708-2716 | src/tools/clippy/clippy_lints/src/undocumented_unsafe_blocks.rs:513-518 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_pretty/src/lib.rs"},"region":{"startLine":2708}}}],"partialFingerprints":{"codehealthFindingId/v1":"4675700e91252665fac8bd0c10ae661b0606afea55c1f78e7860290a71031d50"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): compiler/rustc_infer/src/infer/snapshot/undo_log.rs:189-191 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/snapshot/undo_log.rs:184-186 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_infer/src/infer/snapshot/undo_log.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bb4dfe90bd4edf8e90606581e76be31171009adc5dc4833c78b52b4f7a6c8ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): compiler/rustc_trait_selection/src/traits/engine.rs:269-274 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/obligation_ctxt.rs:98-103 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/traits/engine.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"1da9dbb2cc8afbf77c8bdeb9b4799cdde35d595374a9c3af0bac8eb62f5b2497"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): compiler/rustc_type_ir/src/sty/mod.rs:264-269 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/region.rs:254-259 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_type_ir/src/sty/mod.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"c00b8d61d391518aa393cba4dac912f2edba42ef88c61444549ab34f59ff2108"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): library/std/src/sync/nonpoison/rwlock.rs:766-778 | library/std/src/sync/poison/rwlock.rs:895-907 \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":"library/std/src/sync/nonpoison/rwlock.rs"},"region":{"startLine":766}}}],"partialFingerprints":{"codehealthFindingId/v1":"5048e62de97d636732273144e2fac49de2dea2eacbc666dde8534cea8f836960"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): library/std/src/sys/alloc/wasm.rs:54-59 | library/std/src/sys/alloc/xous.rs:41-46 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/alloc/wasm.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"22964aa2427907d10d39d2b8c748d30cb3ae90e00910f3771024dce5b1620da7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): library/std/src/sys/fs/hermit.rs:597-599 | library/std/src/sys/fs/unix.rs:2458-2460 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/fs/hermit.rs"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"27f8fa3ec634e7ff54e56b6593fc0d9a0c6ad8bc88a4ff06645a21ed6947a211"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): library/std/src/sys/net/connection/socket/hermit.rs:39-42 | library/std/src/sys/net/connection/socket/solid.rs:118-121 \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":"library/std/src/sys/net/connection/socket/hermit.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9d10dfce3d513dc40c0eeffdd45c1ee1a3b05f29b2ad810d26ef2c7acfdd02c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx.rs:1756-1759 | library/stdarch/crates/core_arch/src/x86/avx2.rs:1917-1920 \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":"library/stdarch/crates/core_arch/src/x86/avx.rs"},"region":{"startLine":1756}}}],"partialFingerprints":{"codehealthFindingId/v1":"e50d3ade68a9fdb24a35b93ee99dc9c62db7a94a176028ec3c31eaabf6d32ead"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx.rs:1770-1773 | library/stdarch/crates/core_arch/src/x86/avx2.rs:1977-1980 \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":"library/stdarch/crates/core_arch/src/x86/avx.rs"},"region":{"startLine":1770}}}],"partialFingerprints":{"codehealthFindingId/v1":"510e657896f70a7490eab58160de0f5d7c40e35e0ff9d1e48d7fc8fba1e5db95"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx.rs:1785-1788 | library/stdarch/crates/core_arch/src/x86/avx2.rs:1902-1905 \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":"library/stdarch/crates/core_arch/src/x86/avx.rs"},"region":{"startLine":1785}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1b434aa402065e3f72026946e9e3042970038c1e674959e76fc4e8035949113"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx.rs:1799-1802 | library/stdarch/crates/core_arch/src/x86/avx2.rs:1962-1965 \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":"library/stdarch/crates/core_arch/src/x86/avx.rs"},"region":{"startLine":1799}}}],"partialFingerprints":{"codehealthFindingId/v1":"e43eb216ebc42b1a30019f7e3b1c23a0d53065e537218471b799685cfe1da05b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx.rs:1814-1817 | library/stdarch/crates/core_arch/src/x86/avx2.rs:1887-1890 \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":"library/stdarch/crates/core_arch/src/x86/avx.rs"},"region":{"startLine":1814}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f824e547551dd9107a12032f6c3dae9aa84e4c36d98872d745c4847610c9c69"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx.rs:1828-1831 | library/stdarch/crates/core_arch/src/x86/avx2.rs:1947-1950 \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":"library/stdarch/crates/core_arch/src/x86/avx.rs"},"region":{"startLine":1828}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea4e2a8591419b4b4c7404a4397aa667e94257a5a3907ff1c16fb692e9c2fb19"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx.rs:1843-1846 | library/stdarch/crates/core_arch/src/x86/avx2.rs:1872-1875 \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":"library/stdarch/crates/core_arch/src/x86/avx.rs"},"region":{"startLine":1843}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7a8edd09cb969ce4377d8b8954e5be7270d9cc355bfaa03a29f55376dcd8692"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx.rs:1857-1860 | library/stdarch/crates/core_arch/src/x86/avx2.rs:1932-1935 \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":"library/stdarch/crates/core_arch/src/x86/avx.rs"},"region":{"startLine":1857}}}],"partialFingerprints":{"codehealthFindingId/v1":"feed9d818a2b8395f0353cf49648c7a99767f97bc70c72cd4a4fd5cb81e36e51"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/tools/clippy/clippy_lints/src/casts/cast_possible_truncation.rs:17-23 | src/tools/clippy/clippy_utils/src/consts.rs:1226-1232 \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/tools/clippy/clippy_lints/src/casts/cast_possible_truncation.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ddf4a37259634b4a1fba82bfc9363b397e278441d3058626a1f529a66e27f3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): src/tools/rust-analyzer/crates/hir-expand/src/builtin/derive_macro.rs:61-64 | src/tools/rust-analyzer/crates/hir-expand/src/builtin/fn_macro.rs:58-61 \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":"src/tools/rust-analyzer/crates/hir-expand/src/builtin/derive_macro.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"916ea954fe7de9e1401f60df6715156873823c5719555ce06b3fe8fd75b33a30"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/tools/rust-analyzer/crates/ide-diagnostics/src/handlers/invalid_derive_target.rs:10-19 | src/tools/rust-analyzer/crates/ide-diagnostics/src/handlers/malformed_derive.rs:9-18 \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/tools/rust-analyzer/crates/ide-diagnostics/src/handlers/invalid_derive_target.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"38f6e6d7882fa185f42a4e6cbeebaa296d25890ebe27318fe11cef07fd324fd1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): compiler/rustc_ast_lowering/src/expr.rs:2223-2226 | compiler/rustc_ast_lowering/src/lib.rs:3247-3250 \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":"compiler/rustc_ast_lowering/src/expr.rs"},"region":{"startLine":2223}}}],"partialFingerprints":{"codehealthFindingId/v1":"c20879a22c2b83eccf242d9398fe1a6bc4fe32128dec0f2a4a6fdf8c5bf7b054"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): compiler/rustc_infer/src/infer/at.rs:495-500 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/at.rs:269-274 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_infer/src/infer/at.rs"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"78ef833676fef330b3adf9bdbf17f3e21222142640650c9b9baac310a1927142"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): compiler/rustc_infer/src/infer/mod.rs:977-981 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/mod.rs:791-795 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_infer/src/infer/mod.rs"},"region":{"startLine":977}}}],"partialFingerprints":{"codehealthFindingId/v1":"81f1baf755f17aba375ce10db2be494c905124db9661bdc7bdf06758bc85da81"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): compiler/rustc_public/src/mir/body.rs:1120-1122 | compiler/rustc_public/src/mir/visit.rs:571-573 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_public/src/mir/body.rs"},"region":{"startLine":1120}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c918c976a790117eb4fd1a22ebde8a658623aa50f385889c3f371c6ac59cf84"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 4\u002B corresponding lines): compiler/rustc_type_ir/src/predicate.rs:133-136 | compiler/rustc_type_ir/src/term_kind.rs:167-170 | compiler/rustc_type_ir/src/ty_kind.rs:520-523 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_type_ir/src/predicate.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"35ebeab116ee57bef44ef4831f289e97a378454984026d9c58b984da52e1af82"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): library/alloc/src/collections/linked_list.rs:2305-2309 | library/alloc/src/collections/vec_deque/mod.rs:120-124 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/alloc/src/collections/linked_list.rs"},"region":{"startLine":2305}}}],"partialFingerprints":{"codehealthFindingId/v1":"82509221ee14ae00740844056ad960db0df26fdda15b1500b2246eb40701a280"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512bf16.rs:54-59 | library/stdarch/crates/core_arch/src/x86/avx512bw.rs:506-511 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512bf16.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7cea6df936ae5d90b3a4c221de9962d7bdc9eb824fb5a3ab351a85fd9a59a87"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512bf16.rs:97-102 | library/stdarch/crates/core_arch/src/x86/avx512bw.rs:476-481 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512bf16.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9564b57ac98b2193d27f29b0328a6023934bf42643c011113101ac00c4bf938"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512bf16.rs:140-145 | library/stdarch/crates/core_arch/src/x86/avx512bw.rs:446-451 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512bf16.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"18a8c78775e576ccbd6ccf9f717c6d18f8f19971a498a9231a3a86aa37adce99"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512bf16.rs:327-332 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:24372-24377 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512bf16.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7e05b8839fae90fdf2e859672a7b1a6e0d9bfbd54706d9a9c11bab2f08d31a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512bf16.rs:373-378 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:24318-24323 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512bf16.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e24e10e9c20f2f69cbcbd9514a8163ae235f7bc6fa1f1e6ce62a60f66ed409d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512bw.rs:8154-8159 | library/stdarch/crates/core_arch/src/x86/avx512vbmi2.rs:824-829 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512bw.rs"},"region":{"startLine":8154}}}],"partialFingerprints":{"codehealthFindingId/v1":"f48b23f48f41390aad1121a2f22fa33e662b29e9480c05cf1428cbb291523f37"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512bw.rs:8222-8227 | library/stdarch/crates/core_arch/src/x86/avx512vbmi2.rs:872-877 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512bw.rs"},"region":{"startLine":8222}}}],"partialFingerprints":{"codehealthFindingId/v1":"13273023a886e441b10593638e99f5a9238f153fb5c6285101f04267cfb23bb2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512bw.rs:8280-8285 | library/stdarch/crates/core_arch/src/x86/avx512vbmi2.rs:920-925 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512bw.rs"},"region":{"startLine":8280}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bb2e7ae627d24cc384acb07086e4f005e814c8d58dc957f997638e881c2f8a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 6\u002B corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512f.rs:23950-23955 | library/stdarch/crates/core_arch/src/x86/avx512vbmi2.rs:680-685 | library/stdarch/crates/core_arch/src/x86/avx512vnni.rs:39-44 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 6 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":23950}}}],"partialFingerprints":{"codehealthFindingId/v1":"0187a93ca2fdb25ae56d6e9304a6046cc43c0efa8f5a825c73e81f3c1881b0fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 6\u002B corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512f.rs:24018-24023 | library/stdarch/crates/core_arch/src/x86/avx512vbmi2.rs:728-733 | library/stdarch/crates/core_arch/src/x86/avx512vnni.rs:89-94 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 6 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":24018}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3ed606070a91291ed669867e18d781246998fdd3da696c16f98f08685b4ab1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 6\u002B corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512f.rs:24076-24081 | library/stdarch/crates/core_arch/src/x86/avx512vbmi2.rs:776-781 | library/stdarch/crates/core_arch/src/x86/avx512vnni.rs:139-144 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 6 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":24076}}}],"partialFingerprints":{"codehealthFindingId/v1":"50ad257a2b378ec251b9b4543bfb7dc5cc30cea891e34d822a84f2209ded9985"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512f.rs:24139-24144 | library/stdarch/crates/core_arch/src/x86/avx512vbmi2.rs:536-541 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":24139}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f1398db815e46d3e63b5ee5fb5c193d09cdde6fe240277fe1f6de94e5092e17"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512f.rs:24207-24212 | library/stdarch/crates/core_arch/src/x86/avx512vbmi2.rs:584-589 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":24207}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d6785df2e80713b9c50fa9e1a1448ed988ad83bb344315ed27fd4f7a0608b34"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512f.rs:24265-24270 | library/stdarch/crates/core_arch/src/x86/avx512vbmi2.rs:632-637 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":24265}}}],"partialFingerprints":{"codehealthFindingId/v1":"31d343d1b39c72c6166b47e0dc6ed698ae9df963896de896608e3bbd0626dd04"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512vbmi2.rs:1112-1117 | library/stdarch/crates/core_arch/src/x86/avx512vnni.rs:178-183 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512vbmi2.rs"},"region":{"startLine":1112}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e0c1de3a4ef2ef0447a197614ba1287de6e4847a73e498e9c059156c47e67cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512vbmi2.rs:1160-1165 | library/stdarch/crates/core_arch/src/x86/avx512vnni.rs:228-233 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512vbmi2.rs"},"region":{"startLine":1160}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5b9a90845096230fa9bfd0a78582bf9c027dacdfcc9d2b60d459ba698ee4f99"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512vbmi2.rs:1208-1213 | library/stdarch/crates/core_arch/src/x86/avx512vnni.rs:278-283 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512vbmi2.rs"},"region":{"startLine":1208}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3e64ddadc77097a89393c78e768bb49798b52e413cae17f1dd268badde9f40a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): src/bootstrap/src/core/build_steps/doc.rs:1546-1550 | src/bootstrap/src/core/build_steps/tool.rs:1141-1145 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/build_steps/doc.rs"},"region":{"startLine":1546}}}],"partialFingerprints":{"codehealthFindingId/v1":"85c4d0b12b05a6a57150fe0aabee0c6dec42c4bdbf3eaf4a3cdf698819d32a5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 1\u002B corresponding lines): src/tools/rust-analyzer/crates/hir-ty/src/next_solver/consts.rs:421-421 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/generic_arg.rs:459-459 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/predicate.rs:85-85 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/ty.rs:1419-1419 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 1 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/tools/rust-analyzer/crates/hir-ty/src/next_solver/consts.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"7404ba09337610dda2ebc5676440bda755e2202e41d74dbdac72a66ceed7b352"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): compiler/rustc_infer/src/infer/mod.rs:1207-1211 | compiler/rustc_infer/src/infer/outlives/obligations.rs:137-141 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_infer/src/infer/mod.rs"},"region":{"startLine":1207}}}],"partialFingerprints":{"codehealthFindingId/v1":"e661eacc06ddb034f2985379a2853859b40568551f2076ef1904f70a5b8dc338"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): compiler/rustc_infer/src/infer/relate/generalize.rs:758-761 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/relate/generalize.rs:678-681 \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":"compiler/rustc_infer/src/infer/relate/generalize.rs"},"region":{"startLine":758}}}],"partialFingerprints":{"codehealthFindingId/v1":"73fbeaa7fd796f487a5d425710841ab69ec516eaf403e05ea2a71e9501510206"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): compiler/rustc_middle/src/ty/predicate.rs:640-645 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/predicate.rs:748-753 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/ty/predicate.rs"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c9030d826a173a51902094e82d940dcfefbc84c79bec0851fdcd1757aa0895d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): library/std/src/sys/fs/hermit.rs:324-336 | library/std/src/sys/fs/solid.rs:233-245 | library/std/src/sys/fs/unix.rs:1116-1129 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/fs/hermit.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8f47036bf6f535a7dc307ed9f7a01f5b92b9d4c66177ddd96241b47d560bea6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512dq.rs:5735-5747 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:38393-38403 \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":"library/stdarch/crates/core_arch/src/x86/avx512dq.rs"},"region":{"startLine":5735}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e18c2bda8310f09c3fc5dc5a523504f769c04257c7c20a1451d8492fcc1f6e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512dq.rs:5872-5884 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:38355-38365 \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":"library/stdarch/crates/core_arch/src/x86/avx512dq.rs"},"region":{"startLine":5872}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6335aaf05fafe007928aa26dfe9144a2eb9acf3a18466cec7af60d5465a7593"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512dq.rs:6629-6641 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:38469-38479 \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":"library/stdarch/crates/core_arch/src/x86/avx512dq.rs"},"region":{"startLine":6629}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1724235644ebae8f54660acf15b40b6af0ffe9a6545f2b40a4d14a87399aaa4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512dq.rs:6808-6820 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:38431-38441 \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":"library/stdarch/crates/core_arch/src/x86/avx512dq.rs"},"region":{"startLine":6808}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe223504169f10a17d5ea153db3d38472f22d3aaca63b2bafa318b4418d5749e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): src/tools/rust-analyzer/crates/proc-macro-api/src/bidirectional_protocol.rs:205-210 | src/tools/rust-analyzer/crates/proc-macro-api/src/legacy_protocol.rs:145-151 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/proc-macro-api/src/bidirectional_protocol.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"8839d4ed94f669c8d94b1757bfa0c5c60a5542de2a9a3881faf622b637ef1979"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): compiler/rustc_attr_parsing/src/attributes/crate_level.rs:87-91 | compiler/rustc_attr_parsing/src/attributes/rustc_internal.rs:515-518 \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":"compiler/rustc_attr_parsing/src/attributes/crate_level.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"c39457caa804be5e775dcd71fa5508d9d1f56d95deeec7da76a56fba694d380c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): compiler/rustc_middle/src/middle/stability.rs:52-57 | compiler/rustc_parse/src/lexer/diagnostics.rs:32-37 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/middle/stability.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"66da38a6fc3127f4d24a2edc30a8e7a0a7fecb20137d08973e4673e4e33bc980"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): library/alloc/src/collections/vec_deque/iter.rs:136-139 | library/alloc/src/collections/vec_deque/iter_mut.rs:200-203 \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":"library/alloc/src/collections/vec_deque/iter.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eb7302c7ac64ec490b355016f618ec58c325a482cf0e14da3099bf7f7a23d46"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): library/alloc/src/collections/vec_deque/iter.rs:201-204 | library/alloc/src/collections/vec_deque/iter_mut.rs:265-268 \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":"library/alloc/src/collections/vec_deque/iter.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"547abb196df6105dcf576fcac14e450645a22c61da5a065565e7af0508e396ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): library/alloc/src/rcs/arc.rs:3719-3721 | library/alloc/src/rcs/rc.rs:2803-2805 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/alloc/src/rcs/arc.rs"},"region":{"startLine":3719}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b303487f54ea0fe646911eaa6aa60b4a1fca175347678bdeb621eea5e5efbea"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): library/alloc/src/wtf8/mod.rs:423-428 | library/std/src/sys/os_str/bytes.rs:186-189 \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":"library/alloc/src/wtf8/mod.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"3532f1d925ecde4182ea40fca9769cb85590ba397e1173a9b475d51fceb23697"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): library/core/src/io/util.rs:34-37 | library/std/src/sys/stdio/unsupported.rs:70-73 \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":"library/core/src/io/util.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"30a2890ebdf1826de23dae63f7e965fb117fbcf88ea0c558e1a43bf4dda0a877"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): library/core/src/iter/adapters/skip_while.rs:31-33 | library/core/src/iter/adapters/take_while.rs:31-33 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/iter/adapters/skip_while.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e10d43e7ae5cf4905bd79937a92a2087caac443bd24cc5d0aebf45775372f81"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): library/std/src/sync/nonpoison/mutex.rs:329-331 | library/std/src/sync/poison/mutex.rs:545-553 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sync/nonpoison/mutex.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b9bf3e9a9d97103534cc795eae1f7ad4e2a7cda496e09902d3bef236a4bac76"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): library/std/src/sync/nonpoison/rwlock.rs:373-377 | library/std/src/sync/poison/rwlock.rs:467-475 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sync/nonpoison/rwlock.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd5114c47ae58c612d807cb08a83e8ad22c5cbc4ab5396511ef576cfee65e470"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): library/std/src/sync/nonpoison/rwlock.rs:449-453 | library/std/src/sync/poison/rwlock.rs:561-569 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sync/nonpoison/rwlock.rs"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"fedd096346e93dc48ec9689f86557cc117b583d03d3a02d8db681602f9d62813"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): library/std/src/sync/poison/mutex.rs:356-358 | library/std/src/sync/poison/rwlock.rs:270-272 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sync/poison/mutex.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f57eb4d3380a6ae75934bb59e948af4614ea91b02e241d3418d8e5866cb4692"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): library/std/src/sync/poison/mutex.rs:640-643 | library/std/src/sync/poison/rwlock.rs:660-663 \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":"library/std/src/sync/poison/mutex.rs"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"694c9b3f714a73ae76adb9cf54f5799950a1d8418c6fb4f620160ec98ef5aa45"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): library/std/src/sync/poison/mutex.rs:670-673 | library/std/src/sync/poison/rwlock.rs:690-693 \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":"library/std/src/sync/poison/mutex.rs"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"7adfc6b07ae4440a91c6c220f6a7061eaf6e24b811ae89b2e3bc3f539773572a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx.rs:3032-3038 | library/stdarch/crates/core_arch/src/x86/avx512dq.rs:1081-1086 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx.rs"},"region":{"startLine":3032}}}],"partialFingerprints":{"codehealthFindingId/v1":"50e02273463a8b5845ce013eb5958c44e14950aca1e4e0dcc4f2f739f7c48ba2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512bf16.rs:70-75 | library/stdarch/crates/core_arch/src/x86/avx512bw.rs:521-526 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512bf16.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"707679f1a3e003d078de99551b0cba6617e6fac11143b36f679a4d70e8866b83"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512bf16.rs:112-117 | library/stdarch/crates/core_arch/src/x86/avx512bw.rs:491-496 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512bf16.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"e83c51d845da5c124ca936df0e8d0f3d31200da509dda3cf7a8857b2b40d47bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512bf16.rs:156-161 | library/stdarch/crates/core_arch/src/x86/avx512bw.rs:461-466 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512bf16.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"52fdfc9b06f8acbc6990f503dac736ceadc80c7e16b082c16eac127d68073e7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512bf16.rs:182-187 | library/stdarch/crates/core_arch/src/x86/avx512bw.rs:1118-1123 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512bf16.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5368331f6b8ce739abc182c6a6db0526789094bdaae0f4f2e99e40b54b413d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512bf16.rs:223-228 | library/stdarch/crates/core_arch/src/x86/avx512bw.rs:1088-1093 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512bf16.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae642b7925f4ff82c9eb6b2134e6c97c17b7a3b7ee17e39c4ed791882fe54167"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512bf16.rs:399-404 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:22862-22868 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512bf16.rs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbf7990674ce49ff9a19173a778cc1c4d923c28fc2d71b36265c436c24043285"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512bf16.rs:440-445 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:16032-16037 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512bf16.rs"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cd924cbcc928b39400229456255bc91a596f1672b8d8590af774b1ff4f3cb6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512bf16.rs:481-486 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:11468-11473 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512bf16.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1b1a33d0260037236166b3cb74c706889a2e29185d5d59c2bd8ce46c00774a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512bw.rs:64-69 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:13431-13436 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512bw.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1965641b4a431ed215327aba49deb9c6c6b9157c2ff0555f5958b269f185a32"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512bw.rs:94-99 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:13476-13481 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512bw.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e329acb85c3d60c02e151ac6613af9dadf4a7bcef98c8400d1a651e6d1f608b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512bw.rs:200-205 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:13554-13559 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512bw.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"1edc450dbf316c7083b0c368ded5880d8a4a0401a460c6e00a7576c30cc8027a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512bw.rs:8591-8596 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:13788-13793 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512bw.rs"},"region":{"startLine":8591}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3f7c861cb890bed35a9d4475a0463b91acefd38c89acfcc600cd6bf7b5c2367"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512dq.rs:1005-1010 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:12862-12867 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512dq.rs"},"region":{"startLine":1005}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cfd39e46be98456e18f8cce3b3f7c67d150567fcea9e273c0b424d3c2ea9e52"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512dq.rs:1051-1056 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:13072-13077 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512dq.rs"},"region":{"startLine":1051}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cbf6f7a3d035bf4001d5b92850474a391e8a552e0e7442c508e33fa33a81409"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512dq.rs:1096-1101 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:12997-13002 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512dq.rs"},"region":{"startLine":1096}}}],"partialFingerprints":{"codehealthFindingId/v1":"018ba56af7569876dc7732eb845a4869af213f4d6e797c477dfd900a901c9104"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512dq.rs:1599-1605 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:13027-13032 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512dq.rs"},"region":{"startLine":1599}}}],"partialFingerprints":{"codehealthFindingId/v1":"00d4ab5bf79fedf99993ca1315584cf4988ab1fb235fa02f2c13b063a94636ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512dq.rs:2342-2347 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:13324-13329 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512dq.rs"},"region":{"startLine":2342}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ab6f4421404ceb87592d0e75dfd09b50081eae0c5e4ec2b48a78f1ec3bbaf8e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512dq.rs:2385-2390 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:13278-13283 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512dq.rs"},"region":{"startLine":2385}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac5ad14d600d08fe65221a922f450b579e012a5e91528327e359a1e1e379d66d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512dq.rs:2582-2587 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:12922-12927 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512dq.rs"},"region":{"startLine":2582}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4639005f79cf9fbf99440d4bf29cd7faa30169652b7cb04990228fb75fe11ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512dq.rs:2785-2790 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:28421-28426 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512dq.rs"},"region":{"startLine":2785}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd7ef6ed6f96cab7402340f2963595076b80eae8d191370f1a98e9b1689cb23d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512dq.rs:2982-2987 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:13183-13188 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512dq.rs"},"region":{"startLine":2982}}}],"partialFingerprints":{"codehealthFindingId/v1":"c62b4d897e2077fbafddb07cfa10da3340a55d9accb9200aed185c519775973c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 5\u002B corresponding lines): src/bootstrap/src/core/build_steps/compile.rs:2116-2120 | src/bootstrap/src/core/build_steps/dist.rs:523-527 | src/bootstrap/src/core/build_steps/tool.rs:733-737 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 5 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/build_steps/compile.rs"},"region":{"startLine":2116}}}],"partialFingerprints":{"codehealthFindingId/v1":"747f848b83e7868169b22f2c67a4d1dacbe0d2e933feea6139476b0759161632"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): src/tools/clippy/clippy_lints/src/incompatible_msrv.rs:270-274 | src/tools/clippy/clippy_lints/src/methods/is_empty.rs:41-45 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/incompatible_msrv.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8912b70e3bae9782f3148575235e215401587a620991001bd9845f4b3eaa1a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): compiler/rustc_ast/src/ast.rs:808-813 | src/tools/rust-analyzer/crates/hir-ty/src/infer/pat.rs:46-51 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ast/src/ast.rs"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"c63f53946ca02de9120c7f59ddc8195df4c6084b2a1efe271d7b1b766a10fdf7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 4\u002B corresponding lines): compiler/rustc_codegen_llvm/src/coverageinfo/llvm_cov.rs:76-80 | compiler/rustc_type_ir/src/solve/mod.rs:697-706 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/region_constraints/mod.rs:677-680 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/coverageinfo/llvm_cov.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"981752de1d521402a955ca671abb0c3520619020a88bc4bb5a77a883af372123"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): compiler/rustc_middle/src/mir/statement.rs:1028-1037 | compiler/rustc_public/src/mir/body.rs:1007-1014 \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":"compiler/rustc_middle/src/mir/statement.rs"},"region":{"startLine":1028}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5cfe62e11a0c80dcbab80ea825941afb38417d953c862ece8ec16d90a1bb44d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): compiler/rustc_middle/src/ty/consts/int.rs:242-245 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/consts/valtree.rs:420-423 \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":"compiler/rustc_middle/src/ty/consts/int.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"bce59b92e42224408b1e0b580c23c01c62d5e7f21310fbfa4184eadbd66ea119"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): compiler/rustc_middle/src/ty/consts/int.rs:256-259 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/consts/valtree.rs:434-437 \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":"compiler/rustc_middle/src/ty/consts/int.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e70c3373432c6775f266afd18ef49540805eda2b7eb258c9033ee54b9b94acf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): compiler/rustc_mir_dataflow/src/move_paths/mod.rs:168-172 | library/core/src/iter/sources/successors.rs:55-59 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_dataflow/src/move_paths/mod.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"31bbc62f25878924b954926bcc048de9c6940a747ea3b2424930a16923088545"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): compiler/rustc_public/src/lib.rs:222-224 | compiler/rustc_public/src/ty/def.rs:95-97 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_public/src/lib.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aa5c1125c3a704a99a27d88fc9645206a9c18a40a23acbb327381541405d915"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): compiler/rustc_span/src/edition.rs:75-83 | src/tools/rustfmt/check_diff/src/lib.rs:27-34 \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":"compiler/rustc_span/src/edition.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"a69c2cc07508466d825a1b8d70880c52a6927ad379cc2b95ff8543c810ce3094"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 5\u002B corresponding lines): library/alloc/src/boxed.rs:724-728 | library/alloc/src/boxed/convert.rs:217-221 | library/alloc/src/str.rs:943-947 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 5 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/alloc/src/boxed.rs"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"31ebf8078bf07aa5f82891201abe49e3c51363bf76d8ed8977e9d23da1fb353e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): library/alloc/src/collections/vec_deque/iter.rs:127-130 | library/alloc/src/collections/vec_deque/iter_mut.rs:191-194 \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":"library/alloc/src/collections/vec_deque/iter.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b286f087cb46bc21bd0ae83ac5d4b2b06b9730ca24da75f5e7f2ef06baed739"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): library/alloc/src/collections/vec_deque/iter.rs:192-195 | library/alloc/src/collections/vec_deque/iter_mut.rs:256-259 \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":"library/alloc/src/collections/vec_deque/iter.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea0339553874e79b1496a077dbd24edeac9c539d18d9eeb61b3ca660d06ad921"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): library/alloc/src/rcs/arc.rs:3714-3716 | library/alloc/src/rcs/rc.rs:2798-2800 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/alloc/src/rcs/arc.rs"},"region":{"startLine":3714}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3331fae12f13a334978b8061877abd2ac03b8d60d7a6838cc2c1e1a97660fa1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): library/alloc/src/rcs/arc.rs:4407-4410 | library/alloc/src/rcs/rc.rs:4055-4058 \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":"library/alloc/src/rcs/arc.rs"},"region":{"startLine":4407}}}],"partialFingerprints":{"codehealthFindingId/v1":"81333f3dd33b6c00f2332b87496a0434d37b6eeb4e35cec8c9ed23e89a60e873"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 5\u002B corresponding lines): library/std/src/sys/fs/motor.rs:414-418 | library/std/src/sys/fs/uefi.rs:151-155 | library/std/src/sys/fs/windows.rs:117-122 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 5 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/fs/motor.rs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"63d8374f9096f83ae4508b665748412c4656ef1888915b8f452b3428c4c74d24"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): src/tools/clippy/clippy_lints/src/manual_checked_ops.rs:169-171 | src/tools/clippy/clippy_lints/src/operators/float_cmp.rs:181-183 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/manual_checked_ops.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6fe7f797fccc98ffd5461fa61dcbb116bdf1823f3f3944094c899f5a1804963"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): src/tools/rust-analyzer/crates/hir-ty/src/lib.rs:571-576 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/def_id.rs:187-192 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/lib.rs"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"f91c0175df6a00ed24ac601e25487008137cebe9017c98d162d575ac617ad4f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 4\u002B corresponding lines): src/tools/rust-analyzer/crates/ide-db/src/search.rs:1449-1452 | src/tools/rust-analyzer/crates/ide/src/lib.rs:369-374 | src/tools/rust-analyzer/crates/ide/src/references.rs:226-229 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-db/src/search.rs"},"region":{"startLine":1449}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f568dfb5979c88496649770b0be012fe69784f58b71cc18afb41ae8a343e087"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): compiler/rustc_ast_ir/src/lib.rs:184-191 | src/tools/rust-analyzer/crates/hir-ty/src/primitive.rs:28-35 \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":"compiler/rustc_ast_ir/src/lib.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"53f2430ab491e68dd55a4c0cdcd2ebb71c1ef205d33df3cfb99b6b5a9ca62274"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): compiler/rustc_borrowck/src/diagnostics/outlives_suggestion.rs:49-68 | compiler/rustc_borrowck/src/diagnostics/region_name.rs:72-85 \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":"compiler/rustc_borrowck/src/diagnostics/outlives_suggestion.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"504611be700924a39e4a59bd6403d3f913031d5057707d97b2b574e27d16f4e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): library/std/src/sys/net/connection/socket/hermit.rs:275-278 | library/std/src/sys/net/connection/socket/solid.rs:342-345 \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":"library/std/src/sys/net/connection/socket/hermit.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"35c047f3b8642aef68eb108355ed5cb05ba54f4e09ce0dfae1dd261a9b21860e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 3\u002B corresponding lines): library/std/src/sys/process/unix/fuchsia.rs:320-323 | library/std/src/sys/process/unix/unix.rs:1299-1301 | library/std/src/sys/process/unix/unsupported.rs:78-80 | library/std/src/sys/process/unix/vxworks.rs:285-287 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 3 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":"library/std/src/sys/process/unix/fuchsia.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"423468751b06d68b3a86c518b8ad69cca4eafde707841b94639c8850e747e6f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512bf16.rs:197-202 | library/stdarch/crates/core_arch/src/x86/avx512bw.rs:1133-1138 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512bf16.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"6104e2639b849637ad3d62867719d89ea8607ee517ae8b22e633d2d473a2c164"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512bf16.rs:238-243 | library/stdarch/crates/core_arch/src/x86/avx512bw.rs:1103-1108 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512bf16.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"e85fdf0a6a4c2facb8ec0e9802b91fd5563c94a836635a12a6c7a41ccfbf57c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512bf16.rs:455-460 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:16046-16051 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512bf16.rs"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"858daf13240284cfbab2b08b3856496a9f9f664bf1832222a6aaf934787181a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512bw.rs:79-84 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:13446-13451 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512bw.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"7859abe9d02d8f8f9a36ffcf84efb4c4cf2f010ff6694893fdc1505a02744dff"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512bw.rs:109-114 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:13491-13496 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512bw.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"48e758c9859b411e36c55afa997bcdb5d8e4f0c07df255efb44ef4039ac3ae3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512bw.rs:215-220 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:13569-13574 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512bw.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"6465a65c33f8d55d65682ec962e2ba093c9a213f5a8bf829add2a8f6c5462f0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512bw.rs:8606-8611 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:13803-13808 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512bw.rs"},"region":{"startLine":8606}}}],"partialFingerprints":{"codehealthFindingId/v1":"217283f6f2244de0f0da4e67d0dab9a074e1db0985c778498230d6aa9bbc344e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512dq.rs:1021-1026 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:12877-12882 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512dq.rs"},"region":{"startLine":1021}}}],"partialFingerprints":{"codehealthFindingId/v1":"c21d68cfe1aceb1dbd5376bc075c6bf9b18ed5ccc8015236207109f95cb3d5f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512dq.rs:1066-1071 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:13087-13092 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512dq.rs"},"region":{"startLine":1066}}}],"partialFingerprints":{"codehealthFindingId/v1":"87c2ead8b09736bba05a8baa72d2e987e31ea1ef8bba7c3c55693b9c5ed788ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512dq.rs:1111-1116 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:13012-13017 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512dq.rs"},"region":{"startLine":1111}}}],"partialFingerprints":{"codehealthFindingId/v1":"37b956c6b055f7fb90291ae020a74738bd3576a8c0f8fddb7d1a3387c7d13f7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512dq.rs:2357-2362 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:13042-13047 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512dq.rs"},"region":{"startLine":2357}}}],"partialFingerprints":{"codehealthFindingId/v1":"883712e0dafa63c17d101f553debe67dde9020ee5c48f61272e85f34b7048d2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512dq.rs:2400-2405 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:13293-13298 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512dq.rs"},"region":{"startLine":2400}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9ca54faf73c288ade31cd8c4973f9d7bf6c6c917e1317ef32d6294d8564f092"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512dq.rs:2597-2602 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:12937-12942 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512dq.rs"},"region":{"startLine":2597}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa1dc05ea9fb17c4d610aabf27561af3297a20569f84732b7111170a3233ddc5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512dq.rs:2757-2762 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:13339-13344 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512dq.rs"},"region":{"startLine":2757}}}],"partialFingerprints":{"codehealthFindingId/v1":"75d41ec51a549ddfcc3695345b1802fc01bd28b0785785e5f523ce4bf63ed3b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512dq.rs:2800-2805 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:28436-28441 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512dq.rs"},"region":{"startLine":2800}}}],"partialFingerprints":{"codehealthFindingId/v1":"387aed83cceb2f325bae88960c5bd82cc8d892aa2b445cfe44f93c9448437c96"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): library/stdarch/crates/core_arch/src/x86/avx512dq.rs:2997-3002 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:13203-13208 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512dq.rs"},"region":{"startLine":2997}}}],"partialFingerprints":{"codehealthFindingId/v1":"e67d26e373ef4047ab73f42819a0d8c44578f781a2332a3da193a1609ed454e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 6\u002B corresponding lines): src/bootstrap/src/core/build_steps/compile.rs:1746-1751 | src/bootstrap/src/core/build_steps/doc.rs:1568-1573 | src/bootstrap/src/core/build_steps/test.rs:589-594 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 6 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/build_steps/compile.rs"},"region":{"startLine":1746}}}],"partialFingerprints":{"codehealthFindingId/v1":"e01687f435a75767b2bc2cafd3a3be6892392880912cdbbdce5292a7db37dbe0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): src/bootstrap/src/core/build_steps/compile.rs:1820-1825 | src/bootstrap/src/core/build_steps/test.rs:652-657 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/build_steps/compile.rs"},"region":{"startLine":1820}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed16fd5f8109d8f79c27ab015d11f84127d52f8d0817bf38829cfa7043abf1b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): src/tools/clippy/clippy_lints/src/eta_reduction.rs:384-387 | src/tools/clippy/clippy_lints/src/methods/unnecessary_to_owned.rs:670-672 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/eta_reduction.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"838302dcd430efec213ab72a215f1f95e4a260087c973e18f1e5cd489c6c56e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): compiler/rustc_ast_lowering/src/expr.rs:2337-2345 | compiler/rustc_ast_lowering/src/lib.rs:3298-3305 \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":"compiler/rustc_ast_lowering/src/expr.rs"},"region":{"startLine":2337}}}],"partialFingerprints":{"codehealthFindingId/v1":"0afaf4041177dbf11f8ab04fb6d502f4d862c6eab517935e70c6298abfa0ca91"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): compiler/rustc_data_structures/src/sso/map.rs:390-392 | src/tools/rust-analyzer/crates/ide-db/src/source_change.rs:115-117 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_data_structures/src/sso/map.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"72dde10239510738bd3b740707c5f258ea64524165d099ee25d9818eca1953fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 4\u002B corresponding lines): library/std/src/sys/os_str/bytes.rs:321-324 | library/std/src/sys/os_str/utf8.rs:286-289 | library/std/src/sys/os_str/wtf8.rs:285-288 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/os_str/bytes.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"076ed4b7211524f216302ca227996e030a3bea7e71171891d0e46dbd2765b536"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 4\u002B corresponding lines): library/std/src/sys/os_str/bytes.rs:327-330 | library/std/src/sys/os_str/utf8.rs:292-295 | library/std/src/sys/os_str/wtf8.rs:291-294 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/os_str/bytes.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc8fb9b1160fa4458e2c22c199873a78ecd3215f9f60300e87bec229c573022f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (65\u201366 lines \u00D7 2): library/compiler-builtins/libm/src/math/remquo.rs:13-78 | library/compiler-builtins/libm/src/math/remquof.rs:13-77 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/compiler-builtins/libm/src/math/remquo.rs:13\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/compiler-builtins/libm/src/math/remquo.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab1702d535474a5deed9eea92fa5acc90cb348093343f00828216321ce46ab92"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (61\u201363 lines \u00D7 2): library/compiler-builtins/libm/src/math/log10.rs:35-97 | library/compiler-builtins/libm/src/math/log2.rs:33-93 \u2014 before extracting anything, compare \u0060library/compiler-builtins/libm/src/math/log10.rs\u0060 and \u0060library/compiler-builtins/libm/src/math/log2.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 98 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":"library/compiler-builtins/libm/src/math/log10.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b5efcd00efe51c8b021e7665763f5be3edd5fa285a7031135e2aa4abb750849"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u201361 lines \u00D7 3): library/std/src/sys/process/unix/common.rs:651-654 | src/tools/compiletest/src/read2.rs:169-229 | src/tools/rust-analyzer/crates/stdx/src/process.rs:93-151 \u2014 before extracting anything, compare \u0060src/tools/compiletest/src/read2.rs\u0060 and \u0060src/tools/rust-analyzer/crates/stdx/src/process.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 103 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. 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":"library/std/src/sys/process/unix/common.rs"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d56470d2c6576c5fe2478e3fe3ad4423f5994f01f10ee7a6ffe7584a9114f74"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (58\u201359 lines \u00D7 2): library/compiler-builtins/libm/src/math/log10f.rs:29-87 | library/compiler-builtins/libm/src/math/log2f.rs:27-84 \u2014 before extracting anything, compare \u0060library/compiler-builtins/libm/src/math/log10f.rs\u0060 and \u0060library/compiler-builtins/libm/src/math/log2f.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 79 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":"library/compiler-builtins/libm/src/math/log10f.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"994a0e4e03f01eed793e6cd79086a75e52f293b0fa5b66ebcc564238bdf1db02"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (56 lines \u00D7 2): compiler/rustc_target/src/callconv/loongarch.rs:93-148 | compiler/rustc_target/src/callconv/riscv.rs:98-153 \u2014 before extracting anything, compare \u0060compiler/rustc_target/src/callconv/loongarch.rs\u0060 and \u0060compiler/rustc_target/src/callconv/riscv.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 328 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 \u0060compiler/rustc_target/src/callconv/loongarch.rs:93\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":"compiler/rustc_target/src/callconv/loongarch.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"970bc8a8bec950c455431d39d30443a60b2cffa9607c44f8cf34019356a22ef8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (52\u201353 lines \u00D7 2): compiler/rustc_target/src/callconv/loongarch.rs:289-340 | compiler/rustc_target/src/callconv/riscv.rs:294-346 \u2014 before extracting anything, compare \u0060compiler/rustc_target/src/callconv/loongarch.rs\u0060 and \u0060compiler/rustc_target/src/callconv/riscv.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 328 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 \u0060compiler/rustc_target/src/callconv/loongarch.rs:289\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":"compiler/rustc_target/src/callconv/loongarch.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0a7ba1a388eb21ba6849ae78422c6902771470dd9e5f25034554900042405cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (52 lines \u00D7 2): compiler/rustc_infer/src/infer/canonical/canonicalizer.rs:601-652 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/canonical/canonicalizer.rs:587-638 \u2014 before extracting anything, compare \u0060compiler/rustc_infer/src/infer/canonical/canonicalizer.rs\u0060 and \u0060src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/canonical/canonicalizer.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 74 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 \u0060compiler/rustc_infer/src/infer/canonical/canonicalizer.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":"compiler/rustc_infer/src/infer/canonical/canonicalizer.rs"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"c01a1ba62c49d969be14a04a9f3b56b8e23aa86a41ca14b9f0fc98dd704c35c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (51 lines \u00D7 2): compiler/rustc_target/src/callconv/loongarch.rs:159-209 | compiler/rustc_target/src/callconv/riscv.rs:164-214 \u2014 before extracting anything, compare \u0060compiler/rustc_target/src/callconv/loongarch.rs\u0060 and \u0060compiler/rustc_target/src/callconv/riscv.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 328 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":"compiler/rustc_target/src/callconv/loongarch.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef3da5f3e8143a9d83b1b8ed07360b10377dc6e0578c10ac9d22997455737ed1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (49 lines \u00D7 2): src/tools/rust-analyzer/crates/project-model/src/workspace.rs:835-883 | src/tools/rust-analyzer/crates/project-model/src/workspace.rs:917-965 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tools/rust-analyzer/crates/project-model/src/workspace.rs:835\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/tools/rust-analyzer/crates/project-model/src/workspace.rs"},"region":{"startLine":835}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca1eacb3ff21e27ef7b530cf17151170f6c2111376fc778730073182e152168f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (52\u201360 lines \u00D7 2): src/tools/rust-analyzer/crates/ide-db/src/imports/merge_imports.rs:979-1030 | src/tools/rustfmt/src/sort.rs:137-196 \u2014 before extracting anything, compare \u0060src/tools/rust-analyzer/crates/ide-db/src/imports/merge_imports.rs\u0060 and \u0060src/tools/rustfmt/src/sort.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 151 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/tools/rust-analyzer/crates/ide-db/src/imports/merge_imports.rs"},"region":{"startLine":979}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8d9c3650f808f205fc0dc4cd357b303b9fcd1c6510cb713a4d5be92ae9a9201"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (43 lines \u00D7 2): compiler/rustc_resolve/src/ident.rs:1691-1733 | compiler/rustc_resolve/src/ident.rs:1786-1828 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_resolve/src/ident.rs:1691\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":"compiler/rustc_resolve/src/ident.rs"},"region":{"startLine":1691}}}],"partialFingerprints":{"codehealthFindingId/v1":"13de73599c0a4a48f2337411df386883fd1b6fd1880d2e061362b82c1c9c4c96"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (43 lines \u00D7 2): compiler/rustc_target/src/callconv/loongarch.rs:45-87 | compiler/rustc_target/src/callconv/riscv.rs:51-93 \u2014 before extracting anything, compare \u0060compiler/rustc_target/src/callconv/loongarch.rs\u0060 and \u0060compiler/rustc_target/src/callconv/riscv.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 328 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 \u0060compiler/rustc_target/src/callconv/loongarch.rs:45\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":"compiler/rustc_target/src/callconv/loongarch.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"d35951f7902afbab7d8f550403ab1918870d2e8512bda3d28e508e8216f791e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (43 lines \u00D7 2): library/stdarch/crates/core_arch/src/powerpc/altivec.rs:3039-3081 | library/stdarch/crates/core_arch/src/powerpc/altivec.rs:3093-3135 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/stdarch/crates/core_arch/src/powerpc/altivec.rs:3039\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":"library/stdarch/crates/core_arch/src/powerpc/altivec.rs"},"region":{"startLine":3039}}}],"partialFingerprints":{"codehealthFindingId/v1":"c59ab001e9510604e8334e2b2db8432a84bd849676ed07082ac23a94e626f585"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (42 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-def/src/visibility.rs:173-214 | src/tools/rust-analyzer/crates/hir-def/src/visibility.rs:239-280 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/hir-def/src/visibility.rs:173\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/visibility.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"503ca16ede88ad768c2216d65b0112fb48a6759c53f38b5b7e3c9447f7e7552d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (40 lines \u00D7 2): compiler/rustc_macros/src/extension.rs:16-55 | src/tools/rust-analyzer/crates/macros/src/extension.rs:18-57 \u2014 before extracting anything, compare \u0060compiler/rustc_macros/src/extension.rs\u0060 and \u0060src/tools/rust-analyzer/crates/macros/src/extension.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 77 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":"compiler/rustc_macros/src/extension.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bf792b16f7c97aa7922f7de8250056f55df30dc276c6a471da5d0e2223690d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (38\u201339 lines \u00D7 2): src/tools/clippy/clippy_utils/src/ast_utils/mod.rs:333-371 | src/tools/clippy/clippy_utils/src/ast_utils/mod.rs:599-636 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/clippy/clippy_utils/src/ast_utils/mod.rs:333\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/tools/clippy/clippy_utils/src/ast_utils/mod.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"3092cc6e065319f92a4402806d2f45952e72cd81221873c6ec769b7ee6942b49"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30\u201335 lines \u00D7 2): compiler/rustc_borrowck/src/type_check/mod.rs:1087-1116 | compiler/rustc_borrowck/src/type_check/mod.rs:1125-1159 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_borrowck/src/type_check/mod.rs:1087\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":"compiler/rustc_borrowck/src/type_check/mod.rs"},"region":{"startLine":1087}}}],"partialFingerprints":{"codehealthFindingId/v1":"37f10bed28b91deee8ae3db6538b1e2ede2d7706d132c5a76448abaf32ab68ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u201335 lines \u00D7 3): compiler/rustc_codegen_cranelift/scripts/cargo-clif.rs:9-12 | compiler/rustc_codegen_cranelift/scripts/rustc-clif.rs:9-43 | compiler/rustc_codegen_cranelift/scripts/rustdoc-clif.rs:9-43 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_codegen_cranelift/scripts/cargo-clif.rs:9\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060compiler/rustc_codegen_cranelift/scripts/rustc-clif.rs:9\u0060 calls \u0060parent\u0060, \u0060unwrap\u0060 and \u0060compiler/rustc_codegen_cranelift/scripts/cargo-clif.rs:9\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":"compiler/rustc_codegen_cranelift/scripts/cargo-clif.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"74aa2c258fc77075c0d170023e70753608263cef985c624029ebbfe5c3f305e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (35 lines \u00D7 2): compiler/rustc_codegen_gcc/src/back/lto.rs:141-175 | compiler/rustc_codegen_llvm/src/back/lto.rs:219-253 \u2014 before extracting anything, compare \u0060compiler/rustc_codegen_gcc/src/back/lto.rs\u0060 and \u0060compiler/rustc_codegen_llvm/src/back/lto.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 49 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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":"compiler/rustc_codegen_gcc/src/back/lto.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"79f6089d1dfb6acc79051a0aef6252fe3c3523a5ba08c4b3bb9310911ef7faee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (35 lines \u00D7 2): compiler/rustc_codegen_gcc/src/intrinsic/mod.rs:1199-1233 | compiler/rustc_codegen_gcc/src/intrinsic/mod.rs:1263-1297 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_codegen_gcc/src/intrinsic/mod.rs:1199\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":"compiler/rustc_codegen_gcc/src/intrinsic/mod.rs"},"region":{"startLine":1199}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc3c4cc24fc7562248c3be5f9f62b126fa7a7da4d11abffdd861fb81b8c7abec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (35 lines \u00D7 2): compiler/rustc_hir_analysis/src/check/compare_eii.rs:126-160 | compiler/rustc_hir_analysis/src/check/compare_impl_item.rs:367-401 \u2014 before extracting anything, compare \u0060compiler/rustc_hir_analysis/src/check/compare_eii.rs\u0060 and \u0060compiler/rustc_hir_analysis/src/check/compare_impl_item.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 56 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 \u0060compiler/rustc_hir_analysis/src/check/compare_eii.rs:126\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":"compiler/rustc_hir_analysis/src/check/compare_eii.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"56737823817c0f64d99c7f90822427d779dab4584265457eb2c1ad4fa0368742"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (35 lines \u00D7 2): library/stdarch/crates/stdarch-gen-loongarch/src/main.rs:196-230 | library/stdarch/crates/stdarch-gen-loongarch/src/main.rs:794-828 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/stdarch/crates/stdarch-gen-loongarch/src/main.rs:196\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":"library/stdarch/crates/stdarch-gen-loongarch/src/main.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c564c6db4ccbc45fae9d4ede4d17a4bc23fa50ca16d36ecd7a899957ddc8a16"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (35 lines \u00D7 2): src/tools/rust-installer/src/combiner.rs:124-158 | src/tools/rust-installer/src/generator.rs:95-129 \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/tools/rust-installer/src/combiner.rs:124\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/tools/rust-installer/src/combiner.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"9112456c567275d3efac6d77bf9df0f1a32e84d0e5c13629a99a4a3985109cdb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (34 lines \u00D7 2): compiler/rustc_symbol_mangling/src/legacy.rs:436-469 | compiler/rustc_symbol_mangling/src/v0.rs:395-428 \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 \u0060compiler/rustc_symbol_mangling/src/legacy.rs:436\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, \u0060compiler/rustc_symbol_mangling/src/v0.rs:392\u0060 calls \u0060def_key\u0060, \u0060unwrap\u0060 and \u0060compiler/rustc_symbol_mangling/src/legacy.rs:435\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":"compiler/rustc_symbol_mangling/src/legacy.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"06a4e776d5e7fe0b039392c024595e7525239d10a77733c18a09b1f5eb1a8670"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33\u201334 lines \u00D7 2): src/tools/compiletest/src/read2.rs:255-288 | src/tools/rust-analyzer/crates/stdx/src/process.rs:182-214 \u2014 before extracting anything, compare \u0060src/tools/compiletest/src/read2.rs\u0060 and \u0060src/tools/rust-analyzer/crates/stdx/src/process.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 103 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/tools/compiletest/src/read2.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa54dd8e3152658ac67db32c7794cc2d9b7b68828a3ec563bfd3bbc7386f6b25"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33 lines \u00D7 2): src/tools/rust-analyzer/crates/hir/src/term_search/expr.rs:187-219 | src/tools/rust-analyzer/crates/hir/src/term_search/expr.rs:229-261 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/hir/src/term_search/expr.rs:187\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/tools/rust-analyzer/crates/hir/src/term_search/expr.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ff4de84b32df4dc1ed5c2a333d66a2e3653beb9b68bb42f6d41ac9eb4e458e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32\u201333 lines \u00D7 2): src/tools/rust-analyzer/crates/ide/src/hover/render.rs:529-560 | src/tools/rust-analyzer/crates/ide/src/hover/render.rs:562-594 \u2014 both copies are in the same file, so extract the block 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/tools/rust-analyzer/crates/ide/src/hover/render.rs"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"61c59df150aaed8ec511ddff4a4950dc4855bebaea4b3bfbffdc24dafa04ef51"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30\u201333 lines \u00D7 2): src/tools/rust-analyzer/lib/line-index/src/lib.rs:317-349 | src/tools/rust-analyzer/lib/line-index/src/lib.rs:419-448 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/lib/line-index/src/lib.rs:317\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/lib/line-index/src/lib.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"9df602871c0c4640c3a6afed766c094a080ed589132af2caff4b2d13b4157a90"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32 lines \u00D7 2): compiler/rustc_builtin_macros/src/format.rs:577-608 | src/tools/rust-analyzer/crates/hir-def/src/hir/format_args.rs:394-425 \u2014 before extracting anything, compare \u0060compiler/rustc_builtin_macros/src/format.rs\u0060 and \u0060src/tools/rust-analyzer/crates/hir-def/src/hir/format_args.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 113 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 \u0060compiler/rustc_builtin_macros/src/format.rs:577\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, \u0060compiler/rustc_builtin_macros/src/format.rs:611\u0060 calls \u0060report_invalid_references\u0060 and \u0060src/tools/rust-analyzer/crates/hir-def/src/hir/format_args.rs:429\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":"compiler/rustc_builtin_macros/src/format.rs"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bba7365197578862bd64924304859f28bd5e9ac6b9ae6c82384792221963315"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28\u201332 lines \u00D7 2): compiler/rustc_hir_typeck/src/coercion.rs:508-539 | src/tools/rust-analyzer/crates/hir-ty/src/infer/coerce.rs:498-525 \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 \u0060compiler/rustc_hir_typeck/src/coercion.rs:508\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":"compiler/rustc_hir_typeck/src/coercion.rs"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e6eeed33ea2cd8d8fae51497d56f3612eaca546be90b470bd6d9907aedcc957"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28\u201332 lines \u00D7 2): compiler/rustc_infer/src/infer/relate/generalize.rs:668-695 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/relate/generalize.rs:596-627 \u2014 before extracting anything, compare \u0060compiler/rustc_infer/src/infer/relate/generalize.rs\u0060 and \u0060src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/relate/generalize.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 73 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 \u0060compiler/rustc_infer/src/infer/relate/generalize.rs:668\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 \u0060c\u0060 to \u0060ty::Const\u003C\u0027tcx\u003E\u0060 in one and \u0060Const\u003C\u0027db\u003E\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":"compiler/rustc_infer/src/infer/relate/generalize.rs"},"region":{"startLine":668}}}],"partialFingerprints":{"codehealthFindingId/v1":"a14b0caa5f5a52e9635e847a6e995201bd4537f9cbe33e7106b26d820ecac054"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32 lines \u00D7 2): library/std/src/sync/mpmc/array.rs:384-415 | library/std/src/sync/mpmc/list.rs:435-466 \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 \u0060library/std/src/sync/mpmc/array.rs:384\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":"library/std/src/sync/mpmc/array.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"73607caf21db4e33231e60a2593fe9b4d0b4a529681b866ef1e6d1b2580f95fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): library/alloc/src/collections/vec_deque/splice.rs:73-103 | library/alloc/src/vec/splice.rs:68-98 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/alloc/src/collections/vec_deque/splice.rs:73\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":"library/alloc/src/collections/vec_deque/splice.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"34531434514a2ff40ffc774d0c7c0ad5401061dd522a99fa4a123323851f4b57"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25\u201331 lines \u00D7 2): library/stdarch/crates/stdarch-gen-hexagon/src/hvx.rs:1466-1490 | library/stdarch/crates/stdarch-gen-hexagon/src/hvx.rs:1540-1570 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/stdarch/crates/stdarch-gen-hexagon/src/hvx.rs:1466\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":"library/stdarch/crates/stdarch-gen-hexagon/src/hvx.rs"},"region":{"startLine":1466}}}],"partialFingerprints":{"codehealthFindingId/v1":"710c8d7d46f078309ffcd1881f9f24732479ed6ff80881c97da81941b1741d51"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): src/tools/miri/src/shims/unix/android/foreign_items.rs:70-100 | src/tools/miri/src/shims/unix/linux/foreign_items.rs:196-226 \u2014 \u0060src/tools/miri/src/shims/unix/android/foreign_items.rs\u0060 and \u0060src/tools/miri/src/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/tools/miri/src/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/tools/miri/src/shims/unix/android/foreign_items.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"285bfad43872fb01966ab734ba749e096ba9c76082d49085f454c9bba35f0d00"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): src/tools/rust-analyzer/crates/ide-db/src/imports/merge_imports.rs:906-936 | src/tools/rustfmt/src/sort.rs:57-87 \u2014 before extracting anything, compare \u0060src/tools/rust-analyzer/crates/ide-db/src/imports/merge_imports.rs\u0060 and \u0060src/tools/rustfmt/src/sort.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 151 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/tools/rust-analyzer/crates/ide-db/src/imports/merge_imports.rs"},"region":{"startLine":906}}}],"partialFingerprints":{"codehealthFindingId/v1":"01712930dcf2ea7cb225bc31a530bc55633bd2e8951ca907575d74f6e89818c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29\u201330 lines \u00D7 3): src/tools/clippy/clippy_utils/src/ast_utils/mod.rs:358-386 | src/tools/clippy/clippy_utils/src/ast_utils/mod.rs:537-566 | src/tools/clippy/clippy_utils/src/ast_utils/mod.rs:623-652 \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/tools/clippy/clippy_utils/src/ast_utils/mod.rs:537\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/tools/clippy/clippy_utils/src/ast_utils/mod.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"8199bb347c887ace102fd0c90db9f43bfa06c9a7bd3171f337467dff471f79fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): compiler/rustc_borrowck/src/type_check/free_region_relations.rs:189-218 | compiler/rustc_borrowck/src/type_check/free_region_relations.rs:349-378 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060self\u0060 to \u0060crate) fn create_old(mut\u0060 in one and \u0060crate) fn create(mut\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":"compiler/rustc_borrowck/src/type_check/free_region_relations.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b04ce50b5ddc2be70d7c6bbef6be0054cfdcab54ca0f194b33a05d244b33e9b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): compiler/rustc_codegen_gcc/src/intrinsic/simd.rs:1574-1603 | compiler/rustc_codegen_llvm/src/intrinsic.rs:2638-2667 \u2014 before extracting anything, compare \u0060compiler/rustc_codegen_gcc/src/intrinsic/simd.rs\u0060 and \u0060compiler/rustc_codegen_llvm/src/intrinsic.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 192 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 \u0060compiler/rustc_codegen_gcc/src/intrinsic/simd.rs:1574\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":"compiler/rustc_codegen_gcc/src/intrinsic/simd.rs"},"region":{"startLine":1574}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cf8c99f411b47ab5bb309dd6fb877dea02bac84e5b323251834eeda48eb8db8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): src/tools/miri/src/shims/unix/fd.rs:493-522 | src/tools/miri/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/tools/miri/src/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/tools/miri/src/shims/unix/fd.rs"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd20123b8be741e46535c72a09c5e2bd29f77e40eea4cbdc32f332c3b465e2ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26\u201330 lines \u00D7 2): src/tools/rust-analyzer/crates/ide-db/src/imports/merge_imports.rs:872-897 | src/tools/rustfmt/src/sort.rs:19-48 \u2014 before extracting anything, compare \u0060src/tools/rust-analyzer/crates/ide-db/src/imports/merge_imports.rs\u0060 and \u0060src/tools/rustfmt/src/sort.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 151 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/tools/rustfmt/src/sort.rs:19\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/tools/rust-analyzer/crates/ide-db/src/imports/merge_imports.rs"},"region":{"startLine":872}}}],"partialFingerprints":{"codehealthFindingId/v1":"72920ad77ae9c7a1b0014e0c4487945e54683ef019e913cfc6ad2897fd85e2d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28\u201330 lines \u00D7 2): src/tools/rust-analyzer/xtask/src/codegen/grammar.rs:203-230 | src/tools/rust-analyzer/xtask/src/codegen/grammar.rs:349-378 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/xtask/src/codegen/grammar.rs:203\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/tools/rust-analyzer/xtask/src/codegen/grammar.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d969a2a5e42f5c8cab85c5cadf5879279d5d91bb75184fd3a74fa8f6fcdf975"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28\u201329 lines \u00D7 2): compiler/rustc_codegen_gcc/src/common.rs:75-102 | compiler/rustc_codegen_llvm/src/common.rs:198-226 \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 \u0060compiler/rustc_codegen_gcc/src/common.rs:75\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":"compiler/rustc_codegen_gcc/src/common.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"84de723cf63800c945404322e42753e9797e6973a07f62480b78871d43e2068b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (55 lines \u00D7 2): library/compiler-builtins/libm/src/math/lgamma_r.rs:230-284 | library/compiler-builtins/libm/src/math/lgammaf_r.rs:165-219 \u2014 before extracting anything, compare \u0060library/compiler-builtins/libm/src/math/lgamma_r.rs\u0060 and \u0060library/compiler-builtins/libm/src/math/lgammaf_r.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 91 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 \u0060library/compiler-builtins/libm/src/math/lgamma_r.rs:230\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/compiler-builtins/libm/src/math/lgamma_r.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b9f9c37eff690a10429a47b56d142b4b47bdcae8398853321a21cf17c9f0376"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25\u201329 lines \u00D7 2): src/tools/miri/src/shims/unix/fd.rs:691-715 | src/tools/miri/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/tools/miri/src/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/tools/miri/src/shims/unix/fd.rs"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"849921ee9f56b6d6b0c2b79c8287cf2be7f447b6d244078bbda77fc0a5e3e7b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): src/tools/miri/src/shims/windows/fs.rs:637-665 | src/tools/miri/src/shims/windows/fs.rs:737-765 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/tools/miri/src/shims/windows/fs.rs:730\u0060 calls \u0060File\u0060, \u0060invalid_handle\u0060, \u0060Some\u0060 and \u0060src/tools/miri/src/shims/windows/fs.rs:632\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/tools/miri/src/shims/windows/fs.rs"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"308543884879d7ce4248c440bf5751414b4c4c1c4b08581801b63decba0290de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): compiler/rustc_codegen_gcc/src/intrinsic/simd.rs:1042-1069 | compiler/rustc_codegen_llvm/src/intrinsic.rs:2525-2552 \u2014 before extracting anything, compare \u0060compiler/rustc_codegen_gcc/src/intrinsic/simd.rs\u0060 and \u0060compiler/rustc_codegen_llvm/src/intrinsic.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 192 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":"compiler/rustc_codegen_gcc/src/intrinsic/simd.rs"},"region":{"startLine":1042}}}],"partialFingerprints":{"codehealthFindingId/v1":"f66b5a6e5d473678e1a8d8935f5086d1a966430870ecba3cd04fa7cf8109a8da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): compiler/rustc_hir_typeck/src/pat.rs:2840-2867 | src/tools/rust-analyzer/crates/hir-ty/src/infer/pat.rs:1398-1425 \u2014 before extracting anything, compare \u0060compiler/rustc_hir_typeck/src/pat.rs\u0060 and \u0060src/tools/rust-analyzer/crates/hir-ty/src/infer/pat.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 47 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 \u0060compiler/rustc_hir_typeck/src/pat.rs:2840\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":"compiler/rustc_hir_typeck/src/pat.rs"},"region":{"startLine":2840}}}],"partialFingerprints":{"codehealthFindingId/v1":"113d2e40054895d2d90cdccdd1e12829e20ec0e88998f74afd0b7e40a9be8060"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): compiler/rustc_target/src/callconv/loongarch.rs:215-242 | compiler/rustc_target/src/callconv/riscv.rs:220-247 \u2014 before extracting anything, compare \u0060compiler/rustc_target/src/callconv/loongarch.rs\u0060 and \u0060compiler/rustc_target/src/callconv/riscv.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 328 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":"compiler/rustc_target/src/callconv/loongarch.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"a592572862b2094db2f159390fe59c8f70bf733f66c159eb180379f1cd27d986"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): compiler/rustc_trait_selection/src/solve/inspect/analyse.rs:258-285 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/inspect.rs:351-378 \u2014 before extracting anything, compare \u0060compiler/rustc_trait_selection/src/solve/inspect/analyse.rs\u0060 and \u0060src/tools/rust-analyzer/crates/hir-ty/src/next_solver/inspect.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 79 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 \u0060compiler/rustc_trait_selection/src/solve/inspect/analyse.rs:258\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":"compiler/rustc_trait_selection/src/solve/inspect/analyse.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8d4f096a73424dce99648afe91575809105ae9c8e4f3d9c92d562252432d45f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27\u201328 lines \u00D7 2): library/std/src/sys/pal/unix/stack_overflow/handler_signal.rs:342-368 | library/std/src/sys/pal/unix/stack_overflow/handler_signal.rs:573-600 \u2014 both copies are in the same file, so extract the block 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":"library/std/src/sys/pal/unix/stack_overflow/handler_signal.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"18f514b8df8fc226dffc0b9f314899e872d41e298fd522a6a3d53eb505c764cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27\u201328 lines \u00D7 2): src/tools/clippy/clippy_lints/src/legacy_numeric_constants.rs:212-238 | src/tools/clippy/clippy_utils/src/consts.rs:830-857 \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/tools/clippy/clippy_lints/src/legacy_numeric_constants.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5fb857f77146e1b4d3341b8e28d943deb94fc9b6962f612f45b35d3c95abd3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs:757-783 | compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs:793-819 \u2014 both copies are in the same file, so extract the block 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":"compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs"},"region":{"startLine":757}}}],"partialFingerprints":{"codehealthFindingId/v1":"13b041209bed872d5c8c0a994c0cd85a04dfd453c9e4046261933cdf71c398d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): compiler/rustc_hir_typeck/src/method/probe.rs:726-752 | src/tools/rust-analyzer/crates/hir-ty/src/method_resolution/probe.rs:444-470 \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 \u0060compiler/rustc_hir_typeck/src/method/probe.rs:726\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":"compiler/rustc_hir_typeck/src/method/probe.rs"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa299e1a0a7e7c4f287666d1af937e0fd512d0fc479d1cd038daf65d797dea55"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): compiler/rustc_hir_typeck/src/upvar.rs:2673-2699 | src/tools/rust-analyzer/crates/hir-ty/src/infer/closure/analysis.rs:1490-1516 \u2014 before extracting anything, compare \u0060compiler/rustc_hir_typeck/src/upvar.rs\u0060 and \u0060src/tools/rust-analyzer/crates/hir-ty/src/infer/closure/analysis.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 74 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":"compiler/rustc_hir_typeck/src/upvar.rs"},"region":{"startLine":2673}}}],"partialFingerprints":{"codehealthFindingId/v1":"c34712ba1436e0ca8ea92d41d2f25188a4ba02ecfe184254f51ea9ef50721dac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): library/std/src/sys/process/unix/common.rs:539-565 | library/std/src/sys/process/unsupported.rs:161-187 \u2014 before extracting anything, compare \u0060library/std/src/sys/process/unix/common.rs\u0060 and \u0060library/std/src/sys/process/unsupported.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 46 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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 \u0060library/std/src/sys/process/unix/common.rs:539\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":"library/std/src/sys/process/unix/common.rs"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"27bd4568e8b94b226b27e2751a3519994a57412b1a08506a0402dc70ff808cef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): src/librustdoc/passes/lint/redundant_explicit_links.rs:253-279 | src/librustdoc/passes/lint/redundant_explicit_links.rs:371-397 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/librustdoc/passes/lint/redundant_explicit_links.rs:253\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/librustdoc/passes/lint/redundant_explicit_links.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"c799e47351061632c4c77f5e016d367dc3d8fcb0593c8a7b89535e68869699c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): src/tools/rust-analyzer/crates/ide/src/inlay_hints/lifetime.rs:105-131 | src/tools/rust-analyzer/crates/ide/src/inlay_hints/lifetime.rs:162-188 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/ide/src/inlay_hints/lifetime.rs:105\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/inlay_hints/lifetime.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"5446683a706be13ff9cb8bdbd755ffb8b5462a6521d07f8cdab6d3e113d77a2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): compiler/rustc_codegen_gcc/src/intrinsic/simd.rs:1660-1685 | compiler/rustc_codegen_llvm/src/intrinsic.rs:2723-2748 \u2014 before extracting anything, compare \u0060compiler/rustc_codegen_gcc/src/intrinsic/simd.rs\u0060 and \u0060compiler/rustc_codegen_llvm/src/intrinsic.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 192 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 \u0060compiler/rustc_codegen_gcc/src/intrinsic/simd.rs:1660\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":"compiler/rustc_codegen_gcc/src/intrinsic/simd.rs"},"region":{"startLine":1660}}}],"partialFingerprints":{"codehealthFindingId/v1":"f03b695cdd7f84505b8feb3721d78cbddb56bde5b91eac167312c3d48732397f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201326 lines \u00D7 2): library/stdarch/crates/core_arch/src/x86/avx512f.rs:26389-26412 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:26605-26630 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060library/stdarch/crates/core_arch/src/x86/avx512f.rs:26414\u0060 calls \u0060transmute\u0060 and \u0060library/stdarch/crates/core_arch/src/x86/avx512f.rs:26631\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":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":26389}}}],"partialFingerprints":{"codehealthFindingId/v1":"f75dd96f910b59798f52c1652c229293e658d3715c734cb3a68ecf89e0bd49c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): src/tools/miri/src/shims/windows/foreign_items.rs:235-260 | src/tools/miri/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/tools/miri/src/shims/windows/foreign_items.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3bb28b2a132718138c6b4ee8eadfb84a313f596d9133ea5188a124643ffc771"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): src/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_for_to_while_let.rs:120-145 | src/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_iter_for_each_to_for.rs:162-187 \u2014 before extracting anything, compare \u0060src/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_for_to_while_let.rs\u0060 and \u0060src/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_iter_for_each_to_for.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 48 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_for_to_while_let.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"085cbe57a9402723120b0ad5ece325984bb53e2093419c92f5e555b57f1e509d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): compiler/rustc_borrowck/src/type_check/free_region_relations.rs:317-341 | compiler/rustc_borrowck/src/type_check/free_region_relations.rs:424-448 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_borrowck/src/type_check/free_region_relations.rs:317\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/type_check/free_region_relations.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ff83002b9078488a9e7a47912c6231f6e69265a50578ca956d31f338d99f466"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201325 lines \u00D7 2): compiler/rustc_builtin_macros/src/format.rs:508-532 | src/tools/rust-analyzer/crates/hir-def/src/hir/format_args.rs:326-349 \u2014 before extracting anything, compare \u0060compiler/rustc_builtin_macros/src/format.rs\u0060 and \u0060src/tools/rust-analyzer/crates/hir-def/src/hir/format_args.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 113 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 \u0060compiler/rustc_builtin_macros/src/format.rs:508\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, \u0060compiler/rustc_builtin_macros/src/format.rs:533\u0060 calls \u0060invalid_placeholder_type_error\u0060 and \u0060src/tools/rust-analyzer/crates/hir-def/src/hir/format_args.rs:351\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":"compiler/rustc_builtin_macros/src/format.rs"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6bb6269bec28d873da62a3fcf276af70aa1ab92e559f85fcff01b331911318f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): compiler/rustc_infer/src/infer/canonical/query_response.rs:375-399 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/canonical/instantiate.rs:286-310 \u2014 before extracting anything, compare \u0060compiler/rustc_infer/src/infer/canonical/query_response.rs\u0060 and \u0060src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/canonical/instantiate.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 41 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":"compiler/rustc_infer/src/infer/canonical/query_response.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"252c6299493e86b6c60601830e8c26bb2ce691b389295af3a376faff2cc99b6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): compiler/rustc_symbol_mangling/src/legacy.rs:471-495 | compiler/rustc_symbol_mangling/src/v0.rs:430-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 \u0060compiler/rustc_symbol_mangling/src/legacy.rs:471\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":"compiler/rustc_symbol_mangling/src/legacy.rs"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"23793ce4ae7e24f22da1d4e19d463bd3d769c608722ce5aaa435a861e6df2eab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201325 lines \u00D7 2): compiler/rustc_trait_selection/src/traits/auto_trait.rs:591-599 | src/librustdoc/clean/auto_trait.rs:274-298 \u2014 before extracting anything, compare \u0060compiler/rustc_trait_selection/src/traits/auto_trait.rs\u0060 and \u0060src/librustdoc/clean/auto_trait.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 64 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 \u0060compiler/rustc_trait_selection/src/traits/auto_trait.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":"compiler/rustc_trait_selection/src/traits/auto_trait.rs"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"a58caff07d41b3fe5b1a009b84fb802bf147001e6f22b7612373d708607c2dea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): library/alloc/src/rcs/arc.rs:2412-2436 | library/alloc/src/rcs/rc.rs:2507-2531 \u2014 before extracting anything, compare \u0060library/alloc/src/rcs/arc.rs\u0060 and \u0060library/alloc/src/rcs/rc.rs\u0060 as WHOLE FILES: this scan already matched 28 separate duplicated blocks between them, totalling at least 329 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 \u0060library/alloc/src/rcs/arc.rs:2412\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":"library/alloc/src/rcs/arc.rs"},"region":{"startLine":2412}}}],"partialFingerprints":{"codehealthFindingId/v1":"c065b11217cba16ab97ce93d3dea37e90ed4c9345ab6e614f6ec0f18bab6500b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): src/tools/miri/src/intrinsics/x86/mod.rs:483-507 | src/tools/miri/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/tools/miri/src/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/tools/miri/src/intrinsics/x86/mod.rs:530\u0060 calls \u0060try_from\u0060, \u0060to_uint\u0060, \u0060unwrap_or\u0060 and \u0060src/tools/miri/src/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/tools/miri/src/intrinsics/x86/mod.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cc184fe3aeeb34716b57e902288d8862bf20c211925140fab652cf0aecc1d97"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): src/tools/miri/src/shims/unix/virtual_socket.rs:615-639 | src/tools/miri/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/tools/miri/src/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/tools/miri/src/shims/unix/virtual_socket.rs"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"2486b45ea57b0cabf956156f04ee1e396248a5e4647af5341a70aafb806d7bbb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201324 lines \u00D7 3): compiler/rustc_codegen_llvm/src/intrinsic.rs:1406-1423 | compiler/rustc_codegen_llvm/src/intrinsic.rs:1546-1563 | compiler/rustc_codegen_llvm/src/intrinsic.rs:1631-1654 \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, \u0060compiler/rustc_codegen_llvm/src/intrinsic.rs:1403\u0060 calls \u0060tcx\u0060, \u0060pointer_size\u0060, \u0060pointer_align\u0060 and \u0060compiler/rustc_codegen_llvm/src/intrinsic.rs:1521\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":"compiler/rustc_codegen_llvm/src/intrinsic.rs"},"region":{"startLine":1406}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd1f0b08a9990e623d76620bc63e2b34f65fe7ef2e7e3e17450061143e97fe68"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): compiler/rustc_hir_typeck/src/fn_ctxt/adjust_fulfillment_errors.rs:957-980 | compiler/rustc_hir_typeck/src/fn_ctxt/adjust_fulfillment_errors.rs:1080-1103 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_hir_typeck/src/fn_ctxt/adjust_fulfillment_errors.rs:957\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/fn_ctxt/adjust_fulfillment_errors.rs"},"region":{"startLine":957}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba4696acfb5341bbd2568ff59868ab4f547c6708f5d9a9954a05328bcf8b8b96"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): compiler/rustc_hir_typeck/src/upvar.rs:905-928 | src/tools/rust-analyzer/crates/hir-ty/src/infer/closure/analysis.rs:749-772 \u2014 before extracting anything, compare \u0060compiler/rustc_hir_typeck/src/upvar.rs\u0060 and \u0060src/tools/rust-analyzer/crates/hir-ty/src/infer/closure/analysis.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 74 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 \u0060compiler/rustc_hir_typeck/src/upvar.rs:905\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":"compiler/rustc_hir_typeck/src/upvar.rs"},"region":{"startLine":905}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a6d57f4db1cf3ef967f164a47c1106b744157b535eba0100c3a0cecd4254e25"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): compiler/rustc_trait_selection/src/error_reporting/infer/mod.rs:405-429 | compiler/rustc_trait_selection/src/error_reporting/infer/mod.rs:444-468 \u2014 both copies are in the same file, so extract the block 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":"compiler/rustc_trait_selection/src/error_reporting/infer/mod.rs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"475858b056c89fa934bcc2238eed5aa07c15a00b7e1ab10dc46b453af83ea6a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): compiler/rustc_trait_selection/src/traits/select/mod.rs:2513-2536 | compiler/rustc_trait_selection/src/traits/select/mod.rs:2582-2605 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_trait_selection/src/traits/select/mod.rs:2513\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":"compiler/rustc_trait_selection/src/traits/select/mod.rs"},"region":{"startLine":2513}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6e48b7b301d27bbb4705cae6a588c8e510c0a8f5af83a60c4b980b4c4f5d72a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): src/tools/clippy/clippy_lints_internal/src/repeated_is_diagnostic_item.rs:295-318 | src/tools/clippy/clippy_lints_internal/src/repeated_is_diagnostic_item.rs:361-384 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tools/clippy/clippy_lints_internal/src/repeated_is_diagnostic_item.rs:295\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/tools/clippy/clippy_lints_internal/src/repeated_is_diagnostic_item.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c0d082d630a9faa1dd911ba414f3352545e849aebf15ca20c639310253b5b30"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-ty/src/mir/eval/shim.rs:591-614 | src/tools/rust-analyzer/crates/hir-ty/src/mir/eval/shim.rs:663-686 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tools/rust-analyzer/crates/hir-ty/src/mir/eval/shim.rs:591\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/tools/rust-analyzer/crates/hir-ty/src/mir/eval/shim.rs"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f0cab189feb536c029319e3d2d903362a06877c24f631ce09335edfa217c1b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201324 lines \u00D7 2): src/tools/rust-analyzer/crates/ide-completion/src/completions/expr.rs:121-141 | src/tools/rust-analyzer/crates/ide-completion/src/completions/expr.rs:190-213 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/ide-completion/src/completions/expr.rs:190\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/tools/rust-analyzer/crates/ide-completion/src/completions/expr.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d708708ca1f2245a071da89ead36f47efa5ab91f162109b65dea19ebd2c0847"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): src/tools/rust-analyzer/crates/rust-analyzer/src/cli/analysis_stats.rs:932-955 | src/tools/rust-analyzer/crates/rust-analyzer/src/cli/analysis_stats.rs:1037-1060 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/rust-analyzer/src/cli/analysis_stats.rs:932\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/tools/rust-analyzer/crates/rust-analyzer/src/cli/analysis_stats.rs"},"region":{"startLine":932}}}],"partialFingerprints":{"codehealthFindingId/v1":"ace20495763ee4b2a822e090f380c1593baabda84e5e2af404d18e00c4c82974"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 3): src/tools/miri/priroda/src/frontend/dap.rs:368-390 | src/tools/miri/priroda/src/frontend/dap.rs:509-531 | src/tools/miri/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 \u0060src/tools/miri/priroda/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":"src/tools/miri/priroda/src/frontend/dap.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b2e6fb4f30fa513fdd0f55095d62d2daac19f11a280e89f1729d2a78870dbe7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): compiler/rustc_ast/src/util/comments.rs:79-101 | src/tools/rust-analyzer/crates/hir-def/src/attrs/docs.rs:536-558 \u2014 before extracting anything, compare \u0060compiler/rustc_ast/src/util/comments.rs\u0060 and \u0060src/tools/rust-analyzer/crates/hir-def/src/attrs/docs.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 51 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 \u0060compiler/rustc_ast/src/util/comments.rs:79\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ast/src/util/comments.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"51b55b2ec4985592002bb2a3ddd13fa1ea22f4ffe84117965989631edbb58c7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): compiler/rustc_infer/src/infer/region_constraints/mod.rs:430-452 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/region_constraints/mod.rs:334-356 \u2014 before extracting anything, compare \u0060compiler/rustc_infer/src/infer/region_constraints/mod.rs\u0060 and \u0060src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/region_constraints/mod.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 55 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 \u0060compiler/rustc_infer/src/infer/region_constraints/mod.rs:430\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":"compiler/rustc_infer/src/infer/region_constraints/mod.rs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb8cfa5f002bdf6d38af82130cd631ec1f1b419baa2e657b1e8cc8560bbb1d7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): compiler/rustc_trait_selection/src/diagnostics.rs:2012-2034 | compiler/rustc_trait_selection/src/error_reporting/infer/region.rs:1538-1560 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060compiler/rustc_trait_selection/src/diagnostics.rs:2010\u0060 calls \u0060is_empty\u0060 and \u0060compiler/rustc_trait_selection/src/error_reporting/infer/region.rs:1536\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":"compiler/rustc_trait_selection/src/diagnostics.rs"},"region":{"startLine":2012}}}],"partialFingerprints":{"codehealthFindingId/v1":"729f08e5e305f40c3d099d1901153c76cccc27c8a876cd1acbaa6732837662df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): compiler/rustc_trait_selection/src/solve/inspect/analyse.rs:290-312 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/inspect.rs:383-405 \u2014 before extracting anything, compare \u0060compiler/rustc_trait_selection/src/solve/inspect/analyse.rs\u0060 and \u0060src/tools/rust-analyzer/crates/hir-ty/src/next_solver/inspect.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 79 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 \u0060compiler/rustc_trait_selection/src/solve/inspect/analyse.rs:290\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":"compiler/rustc_trait_selection/src/solve/inspect/analyse.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d489851269b647bd3fef2064cd2c02b40c3b4c797881068d41b208f5c1d1388"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201323 lines \u00D7 2): compiler/rustc_trait_selection/src/traits/normalize.rs:201-223 | compiler/rustc_trait_selection/src/traits/normalize.rs:262-273 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_trait_selection/src/traits/normalize.rs:201\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":"compiler/rustc_trait_selection/src/traits/normalize.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"569073169ea09dcd5b62c6b170383ee026738be3019de34ed21914914a610484"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201323 lines \u00D7 2): library/alloc/src/str.rs:978-998 | src/tools/rust-analyzer/lib/smol_str/src/lib.rs:871-893 \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 \u0060library/alloc/src/str.rs:978\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":"library/alloc/src/str.rs"},"region":{"startLine":978}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b273f01454869a9222943f7b8cf7e1bd2a009b78d3c53e3fde2d6cb9c3ca1e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201323 lines \u00D7 2): src/librustdoc/clean/mod.rs:2564-2586 | src/librustdoc/clean/mod.rs:2590-2611 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/librustdoc/clean/mod.rs:2590\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/librustdoc/clean/mod.rs"},"region":{"startLine":2564}}}],"partialFingerprints":{"codehealthFindingId/v1":"19b498f7fdc11e0d7438d7a0cc46bf70522ba3297bcc2dc21a93f1463b631776"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): src/librustdoc/html/render/search_index.rs:505-527 | src/librustdoc/html/render/search_index.rs:673-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/librustdoc/html/render/search_index.rs:505\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/render/search_index.rs"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ce4ea5357cb40924e7d197f49b6b6dea7e55a8c15c0cc4c59124e2ddc52919d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201323 lines \u00D7 2): src/tools/clippy/clippy_lints/src/reserve_after_initialization.rs:75-97 | src/tools/clippy/clippy_lints/src/reserve_after_initialization.rs:104-123 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tools/clippy/clippy_lints/src/reserve_after_initialization.rs:75\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/tools/clippy/clippy_lints/src/reserve_after_initialization.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"a479d933144426bcea6076564377845baffd9f992fb89bc5535ab0a14dbd7eb3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201323 lines \u00D7 2): src/tools/rust-analyzer/crates/ide-completion/src/completions/expr.rs:204-226 | src/tools/rust-analyzer/crates/ide-completion/src/completions/type.rs:119-137 \u2014 before extracting anything, compare \u0060src/tools/rust-analyzer/crates/ide-completion/src/completions/expr.rs\u0060 and \u0060src/tools/rust-analyzer/crates/ide-completion/src/completions/type.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 49 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tools/rust-analyzer/crates/ide-completion/src/completions/expr.rs:204\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/tools/rust-analyzer/crates/ide-completion/src/completions/expr.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff4c52787caedd2d7fee49b25d525e1ea5fe7b9cfb35de22e8bb9d4bd5d5f165"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201323 lines \u00D7 2): src/tools/rust-analyzer/crates/ide-completion/src/context/analysis.rs:224-245 | src/tools/rust-analyzer/crates/ide-completion/src/context/analysis.rs:410-432 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/ide-completion/src/context/analysis.rs:224\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. 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/tools/rust-analyzer/crates/ide-completion/src/context/analysis.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"b170d0471bdf2e776de151732ccfd0df1fc400088a22f2e94e7d85fb58db4e7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201323 lines \u00D7 2): src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:999-1021 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1032-1052 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:999\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/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs"},"region":{"startLine":999}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc0dc7a5e96a3110ca5578c2ea40e342f7fc21e1af31ac78ba46d821fd2caa0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): src/tools/rust-analyzer/crates/tt/src/storage.rs:886-908 | src/tools/rust-analyzer/crates/tt/src/storage.rs:910-932 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/tt/src/storage.rs:886\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/tools/rust-analyzer/crates/tt/src/storage.rs"},"region":{"startLine":886}}}],"partialFingerprints":{"codehealthFindingId/v1":"6285e4a6764b4fc178d846775a54a12202f40cdd5030c8511c1675fa417267b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201322 lines \u00D7 3): compiler/rustc_borrowck/src/type_check/mod.rs:1141-1162 | compiler/rustc_borrowck/src/type_check/mod.rs:1174-1195 | compiler/rustc_borrowck/src/type_check/mod.rs:1211-1230 \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 \u0060compiler/rustc_borrowck/src/type_check/mod.rs:1141\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":"compiler/rustc_borrowck/src/type_check/mod.rs"},"region":{"startLine":1141}}}],"partialFingerprints":{"codehealthFindingId/v1":"606462f01770f0682039469b348f31237b7bd34a8eceb014a5237d7bf3b1cb94"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 3): src/tools/rust-analyzer/crates/hir-ide/src/diagnostics/decl_check.rs:327-348 | src/tools/rust-analyzer/crates/hir-ide/src/diagnostics/decl_check.rs:417-438 | src/tools/rust-analyzer/crates/hir-ide/src/diagnostics/decl_check.rs:578-599 \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/tools/rust-analyzer/crates/hir-ide/src/diagnostics/decl_check.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"27db3c02110e4f4eb45f7f24ee99b648aefd44ae7002a4d7f7a133c99c43b42d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 3): src/tools/rust-analyzer/crates/rust-analyzer/src/cli/analysis_stats.rs:855-876 | src/tools/rust-analyzer/crates/rust-analyzer/src/cli/analysis_stats.rs:1197-1218 | src/tools/rust-analyzer/crates/rust-analyzer/src/cli/analysis_stats.rs:1276-1297 \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/tools/rust-analyzer/crates/rust-analyzer/src/cli/analysis_stats.rs:855\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/tools/rust-analyzer/crates/rust-analyzer/src/cli/analysis_stats.rs:1196\u0060 calls \u0060Impl\u0060, \u0060source\u0060, \u0060syntax\u0060 and \u0060src/tools/rust-analyzer/crates/rust-analyzer/src/cli/analysis_stats.rs:854\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/tools/rust-analyzer/crates/rust-analyzer/src/cli/analysis_stats.rs"},"region":{"startLine":855}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a27099bfe870454798ba25fb3a7b34dd60604c6132ed0c03c32fe55cbbcf993"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201322 lines \u00D7 2): compiler/rustc_borrowck/src/dataflow.rs:206-227 | compiler/rustc_borrowck/src/dataflow.rs:315-331 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_borrowck/src/dataflow.rs:206\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":"compiler/rustc_borrowck/src/dataflow.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3481d338f8b34bf57fe34e8252d5e6a9ea121c5970c7b1abd7cbb2c3f92b6f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): compiler/rustc_codegen_gcc/src/intrinsic/simd.rs:1069-1090 | compiler/rustc_codegen_gcc/src/intrinsic/simd.rs:1181-1202 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_codegen_gcc/src/intrinsic/simd.rs:1069\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":"compiler/rustc_codegen_gcc/src/intrinsic/simd.rs"},"region":{"startLine":1069}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a27423625e77d84801237cbb9191cfdfb69a7e2fd465767b323bffe24f06183"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): compiler/rustc_codegen_gcc/src/intrinsic/simd.rs:1160-1181 | compiler/rustc_codegen_llvm/src/intrinsic.rs:2796-2817 \u2014 before extracting anything, compare \u0060compiler/rustc_codegen_gcc/src/intrinsic/simd.rs\u0060 and \u0060compiler/rustc_codegen_llvm/src/intrinsic.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 192 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":"compiler/rustc_codegen_gcc/src/intrinsic/simd.rs"},"region":{"startLine":1160}}}],"partialFingerprints":{"codehealthFindingId/v1":"1160c458b716e84c6ef61fa0af48ea65793131f2439d5aa9d213cca561def7d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): compiler/rustc_codegen_ssa/src/back/symbol_edit.rs:214-235 | compiler/rustc_codegen_ssa/src/back/symbol_edit.rs:397-418 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_codegen_ssa/src/back/symbol_edit.rs:214\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":"compiler/rustc_codegen_ssa/src/back/symbol_edit.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7e6c1a5610644402df1e47d1f200d3c0e499f0a3b07ee46ce0aeb6000817b9b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): compiler/rustc_hir_typeck/src/method/probe.rs:703-724 | src/tools/rust-analyzer/crates/hir-ty/src/method_resolution/probe.rs:421-442 \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":"compiler/rustc_hir_typeck/src/method/probe.rs"},"region":{"startLine":703}}}],"partialFingerprints":{"codehealthFindingId/v1":"de21473ca7c625d4e422c1b509230591082aa9e6b289fec8f59b2ae79c266748"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): compiler/rustc_macros/src/type_visitable.rs:7-28 | src/tools/rust-analyzer/crates/macros/src/lib.rs:36-57 \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":"compiler/rustc_macros/src/type_visitable.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"99a79bd39db965a65624470c644619294b8ba7773d73c5e164250dc9e1f96202"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): compiler/rustc_middle/src/ty/util.rs:83-104 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/util.rs:52-73 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/ty/util.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8fc684684199767944186a670d4e601b6ef3e123db0ec72112124a83ac59ef4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): compiler/rustc_target/src/callconv/loongarch.rs:343-364 | compiler/rustc_target/src/callconv/riscv.rs:349-370 \u2014 before extracting anything, compare \u0060compiler/rustc_target/src/callconv/loongarch.rs\u0060 and \u0060compiler/rustc_target/src/callconv/riscv.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 328 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 \u0060compiler/rustc_target/src/callconv/loongarch.rs:343\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":"compiler/rustc_target/src/callconv/loongarch.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f32b25af8b0536935dd44db0e06522dc408d7fe796ea92e10ce240310e11408"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): compiler/rustc_target/src/callconv/loongarch.rs:424-445 | compiler/rustc_target/src/callconv/riscv.rs:429-450 \u2014 before extracting anything, compare \u0060compiler/rustc_target/src/callconv/loongarch.rs\u0060 and \u0060compiler/rustc_target/src/callconv/riscv.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 328 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 \u0060compiler/rustc_target/src/callconv/loongarch.rs:424\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, \u0060compiler/rustc_target/src/callconv/riscv.rs:427\u0060 calls \u0060data_layout\u0060, \u0060pointer_size\u0060, \u0060bits\u0060 and \u0060compiler/rustc_target/src/callconv/loongarch.rs:422\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":"compiler/rustc_target/src/callconv/loongarch.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"35e699074d2e8eaf7275300c55956863de60f0fc9491800df090058c6d022c78"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201322 lines \u00D7 2): library/core/src/io/io_slice.rs:131-149 | library/core/src/io/io_slice.rs:291-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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060bufs\u0060 to \u0060\u0026mut \u0026mut [IoSliceMut\u003C\u0027a\u003E]\u0060 in one and \u0060\u0026mut \u0026mut [IoSlice\u003C\u0027a\u003E]\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":"library/core/src/io/io_slice.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c4e8a76262d790e225d9277475bf2b7c9db26c19705aa6db2605a1f4f34c208"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): library/std/src/sys/net/connection/socket/hermit.rs:57-78 | library/std/src/sys/net/connection/socket/unix.rs:179-200 \u2014 before extracting anything, compare \u0060library/std/src/sys/net/connection/socket/hermit.rs\u0060 and \u0060library/std/src/sys/net/connection/socket/unix.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 35 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/std/src/sys/net/connection/socket/hermit.rs:57\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":"library/std/src/sys/net/connection/socket/hermit.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"08d00c3986c0fdf1a1a263d2042cede7cea9eceb4d5a377c71d5030c790bcd97"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): src/tools/clippy/clippy_lints_internal/src/repeated_is_diagnostic_item.rs:267-288 | src/tools/clippy/clippy_lints_internal/src/repeated_is_diagnostic_item.rs:333-354 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/clippy/clippy_lints_internal/src/repeated_is_diagnostic_item.rs:267\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/tools/clippy/clippy_lints_internal/src/repeated_is_diagnostic_item.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"c067baaaa57eaca52421c972f7cead076f1b3472aa9843981dea9203b30faf94"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): src/tools/rust-analyzer/crates/hir/src/term_search/tactics.rs:441-462 | src/tools/rust-analyzer/crates/hir/src/term_search/tactics.rs:636-657 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/hir/src/term_search/tactics.rs:441\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir/src/term_search/tactics.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"e92e5be17ba116a3498f13f5914129fb57dd9f6d76afddb32c8aef4fc4b874c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 3): compiler/rustc_codegen_llvm/src/builder.rs:487-507 | compiler/rustc_codegen_llvm/src/builder.rs:1457-1477 | compiler/rustc_codegen_llvm/src/builder.rs:1926-1946 \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 \u0060compiler/rustc_codegen_llvm/src/builder.rs:487\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":"compiler/rustc_codegen_llvm/src/builder.rs"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"27b0adebbe93f673c9e11fdca3d5539388d110b9ee29c718ddaa6357705d13b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201321 lines \u00D7 3): compiler/rustc_trait_selection/src/traits/select/mod.rs:2514-2532 | compiler/rustc_trait_selection/src/traits/select/mod.rs:2551-2571 | compiler/rustc_trait_selection/src/traits/select/mod.rs:2583-2601 \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":"compiler/rustc_trait_selection/src/traits/select/mod.rs"},"region":{"startLine":2514}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b3ed060da3cdc9362addbd12ee5959d7957a9d015e3d3a4750ff5a02064ac8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201321 lines \u00D7 3): src/tools/miri/src/shims/unix/socket.rs:242-262 | src/tools/miri/src/shims/unix/socket.rs:389-409 | src/tools/miri/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/tools/miri/src/shims/unix/socket.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"d709ffb840e27c85db73851bc181d93ca2b87483b64f2b2bac2d2a5a7939e07b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201321 lines \u00D7 3): src/tools/rust-analyzer/crates/ide-completion/src/context/analysis.rs:217-236 | src/tools/rust-analyzer/crates/ide-completion/src/context/analysis.rs:338-357 | src/tools/rust-analyzer/crates/ide-completion/src/context/analysis.rs:402-422 \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/tools/rust-analyzer/crates/ide-completion/src/context/analysis.rs:217\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/tools/rust-analyzer/crates/ide-completion/src/context/analysis.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd46027fe3d332bf7658f382f871f49a378b225189e962aa0485c1ecc815ea32"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201321 lines \u00D7 2): compiler/rustc_codegen_cranelift/src/inline_asm.rs:385-403 | compiler/rustc_codegen_cranelift/src/inline_asm.rs:407-427 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_codegen_cranelift/src/inline_asm.rs:407\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":"compiler/rustc_codegen_cranelift/src/inline_asm.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cbb9caac7aa5f7788730f70e90022bccccf1707766b95e14b5054090f6d5bb2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): compiler/rustc_codegen_gcc/src/debuginfo.rs:145-165 | compiler/rustc_codegen_llvm/src/debuginfo/mod.rs:688-708 \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 \u0060compiler/rustc_codegen_gcc/src/debuginfo.rs:145\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":"compiler/rustc_codegen_gcc/src/debuginfo.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"17e79bf64e8cac4cc16c2fbb5b31aa1885b871eea40f5cb25b73d93fa20b22a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): compiler/rustc_codegen_gcc/src/int.rs:537-557 | compiler/rustc_codegen_gcc/src/int.rs:567-587 \u2014 both copies are in the same file, so extract the block 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":"compiler/rustc_codegen_gcc/src/int.rs"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0991bed8687a68b9de426f1d2183388593f6fbbaa5ada025622ec3bab4d321a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201321 lines \u00D7 2): compiler/rustc_codegen_llvm/src/intrinsic.rs:2568-2587 | compiler/rustc_codegen_llvm/src/intrinsic.rs:2834-2854 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_codegen_llvm/src/intrinsic.rs:2568\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":"compiler/rustc_codegen_llvm/src/intrinsic.rs"},"region":{"startLine":2568}}}],"partialFingerprints":{"codehealthFindingId/v1":"8906d4cefebc4808841345e0a7f11c8f6a721b1f2834d0a3aed5dfc1fd0a0788"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): compiler/rustc_trait_selection/src/solve/select.rs:65-85 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/select.rs:305-325 \u2014 before extracting anything, compare \u0060compiler/rustc_trait_selection/src/solve/select.rs\u0060 and \u0060src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/select.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 75 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 \u0060compiler/rustc_trait_selection/src/solve/select.rs:65\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":"compiler/rustc_trait_selection/src/solve/select.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"eab89f27be411fcc651edecbdeaf78bee5c77d2e55b666a1a8ba4362b92b2ae7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): library/compiler-builtins/libm/src/math/atan.rs:96-116 | library/compiler-builtins/libm/src/math/atanf.rs:75-95 \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 \u0060library/compiler-builtins/libm/src/math/atan.rs:96\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":"library/compiler-builtins/libm/src/math/atan.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab6804c6fceee4ac0bf2f2a27f32a06e4cfc68b58a322db16ffdaa54b811f03d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201321 lines \u00D7 2): library/compiler-builtins/libm/src/math/j0.rs:181-201 | library/compiler-builtins/libm/src/math/j0f.rs:122-139 \u2014 before extracting anything, compare \u0060library/compiler-builtins/libm/src/math/j0.rs\u0060 and \u0060library/compiler-builtins/libm/src/math/j0f.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 80 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 \u0060library/compiler-builtins/libm/src/math/j0.rs:181\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060x\u0060 to \u0060f64\u0060 in one and \u0060f32\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":"library/compiler-builtins/libm/src/math/j0.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5c645be2e64da699ae1b4b2f0c0e6c725c14cbf8b7dbecb8b8e797c9b226869"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): library/stdarch/crates/stdarch-gen-loongarch/src/main.rs:331-351 | library/stdarch/crates/stdarch-gen-loongarch/src/main.rs:379-399 \u2014 both copies are in the same file, so extract the block 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":"library/stdarch/crates/stdarch-gen-loongarch/src/main.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"57acd70fce90b638107ed2d3f87aefa067abd436482f1b42448c328524a6743b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): src/tools/rust-analyzer/crates/hir/src/diagnostics.rs:1470-1490 | src/tools/rust-analyzer/crates/hir/src/diagnostics.rs:1915-1935 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/hir/src/diagnostics.rs:1470\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/tools/rust-analyzer/crates/hir/src/diagnostics.rs:1491\u0060 calls \u0060Some\u0060 and \u0060src/tools/rust-analyzer/crates/hir/src/diagnostics.rs:1936\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/tools/rust-analyzer/crates/hir/src/diagnostics.rs"},"region":{"startLine":1470}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ee296ef7e553abf931feb61222f687637dce6ee9c55c20c75717dd81ef40a42"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): src/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_enum_is_method.rs:76-96 | src/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_enum_projection_method.rs:155-175 \u2014 before extracting anything, compare \u0060src/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_enum_is_method.rs\u0060 and \u0060src/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_enum_projection_method.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 62 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/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_enum_is_method.rs:76\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/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_enum_is_method.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc63af2da665da1ba3bc77927c040ff9d9c5e862b4769a9eea426ce42a7f181b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): src/tools/rust-analyzer/crates/ide-completion/src/context/analysis.rs:1584-1604 | src/tools/rust-analyzer/crates/ide-completion/src/context/analysis.rs:1613-1633 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/ide-completion/src/context/analysis.rs:1584\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/tools/rust-analyzer/crates/ide-completion/src/context/analysis.rs"},"region":{"startLine":1584}}}],"partialFingerprints":{"codehealthFindingId/v1":"d67677916a1909d1e563908898c518630a077ec19f989605002d498660ab7871"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): src/tools/rust-analyzer/crates/ide-diagnostics/src/handlers/field_shorthand.rs:38-58 | src/tools/rust-analyzer/crates/ide-diagnostics/src/handlers/field_shorthand.rs:84-104 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/ide-diagnostics/src/handlers/field_shorthand.rs:38\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-diagnostics/src/handlers/field_shorthand.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"48c3d527824a20ac44cafe827607760a1cd98b530573ddc1c377ccaad8c36554"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): src/tools/rust-analyzer/crates/proc-macro-srv/src/token_stream.rs:698-725 | src/tools/rust-analyzer/crates/tt/src/lib.rs:447-474 \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/tools/rust-analyzer/crates/proc-macro-srv/src/token_stream.rs:698\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/tools/rust-analyzer/crates/proc-macro-srv/src/token_stream.rs"},"region":{"startLine":698}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aa70c407e62ae5c989953197483c7e73af74b63239bdedd8794beafb4721859"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): compiler/rustc_abi/src/lib.rs:518-537 | compiler/rustc_abi/src/lib.rs:563-582 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_abi/src/lib.rs:518\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_abi/src/lib.rs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa1464245efeb0cbca11821a6fdfdf31ab629b6ee0f433ec304c3058cd4fc9fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): compiler/rustc_codegen_llvm/src/intrinsic.rs:1483-1502 | compiler/rustc_codegen_llvm/src/intrinsic.rs:1574-1593 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_codegen_llvm/src/intrinsic.rs:1483\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":"compiler/rustc_codegen_llvm/src/intrinsic.rs"},"region":{"startLine":1483}}}],"partialFingerprints":{"codehealthFindingId/v1":"efaf0e99067d19368dd4c8a250f10543135f5cff981c692b95e0a57fadc75461"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): compiler/rustc_resolve/src/ident.rs:646-665 | compiler/rustc_resolve/src/ident.rs:697-716 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_resolve/src/ident.rs:646\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":"compiler/rustc_resolve/src/ident.rs"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd0e9fa396b0ce6c604d13b01575261407091cccee03f6ef436034ba1276be61"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): compiler/rustc_thread_pool/src/scope/mod.rs:535-553 | compiler/rustc_thread_pool/src/scope/mod.rs:608-627 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"compiler/rustc_thread_pool/src/scope/mod.rs"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e07092ff9543484b57f74e2596a7203f8340de3c50bc41879c60ba7dffc45e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): compiler/rustc_trait_selection/src/solve/select.rs:172-191 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/select.rs:398-417 \u2014 before extracting anything, compare \u0060compiler/rustc_trait_selection/src/solve/select.rs\u0060 and \u0060src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/select.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 75 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 \u0060compiler/rustc_trait_selection/src/solve/select.rs:172\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":"compiler/rustc_trait_selection/src/solve/select.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"9486df0150038be4386ba2d5c8cda3aa376864b939c3042babfff78ff0436e1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): compiler/rustc_trait_selection/src/traits/effects.rs:203-222 | compiler/rustc_trait_selection/src/traits/effects.rs:294-313 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_trait_selection/src/traits/effects.rs:203\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/traits/effects.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"322236312bac3f6bfa9964a755c92a172effdc9b2a37ad22e15ecfb44ee5a642"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): library/compiler-builtins/libm/src/math/j0.rs:287-306 | library/compiler-builtins/libm/src/math/j1.rs:279-298 \u2014 before extracting anything, compare \u0060library/compiler-builtins/libm/src/math/j0.rs\u0060 and \u0060library/compiler-builtins/libm/src/math/j1.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 84 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/compiler-builtins/libm/src/math/j0.rs:287\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":"library/compiler-builtins/libm/src/math/j0.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"9490b583981a94645e81393c87880b626ced5520c611eecae31151075d5c67ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): library/compiler-builtins/libm/src/math/j0.rs:399-418 | library/compiler-builtins/libm/src/math/j1.rs:391-410 \u2014 before extracting anything, compare \u0060library/compiler-builtins/libm/src/math/j0.rs\u0060 and \u0060library/compiler-builtins/libm/src/math/j1.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 84 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/compiler-builtins/libm/src/math/j0.rs:399\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/compiler-builtins/libm/src/math/j0.rs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a187b36c4d7e9a77dddf1010e5bb669f221b417d201eee2665f55a5539a358e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): library/compiler-builtins/libm/src/math/j0f.rs:224-243 | library/compiler-builtins/libm/src/math/j1f.rs:223-242 \u2014 before extracting anything, compare \u0060library/compiler-builtins/libm/src/math/j0f.rs\u0060 and \u0060library/compiler-builtins/libm/src/math/j1f.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 100 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 \u0060library/compiler-builtins/libm/src/math/j0f.rs:224\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":"library/compiler-builtins/libm/src/math/j0f.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"daa59d1e52936277183dba6086e535cf4473e41ce83763ebbd8da783b222762f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): library/compiler-builtins/libm/src/math/j0f.rs:336-355 | library/compiler-builtins/libm/src/math/j1f.rs:335-354 \u2014 before extracting anything, compare \u0060library/compiler-builtins/libm/src/math/j0f.rs\u0060 and \u0060library/compiler-builtins/libm/src/math/j1f.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 100 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 \u0060library/compiler-builtins/libm/src/math/j0f.rs:336\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/compiler-builtins/libm/src/math/j0f.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"b893ea56563bcd311e6736a0d6f4ca829acb03cbeca654a5e8264bea5d5ee886"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): library/compiler-builtins/libm/src/math/sinf.rs:32-51 | library/compiler-builtins/libm/src/math/tanf.rs:32-51 \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 \u0060library/compiler-builtins/libm/src/math/sinf.rs:32\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":"library/compiler-builtins/libm/src/math/sinf.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5f6645b488b7808a3c6f9ce7fad4129ce7c2233c599f8f988d75c4a96719a7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): library/core/src/str/pattern.rs:1791-1810 | library/core/src/str/pattern.rs:1838-1857 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060order_greater\u0060 to \u0060bool) -\u003E (usize\u0060 in one and \u0060bool\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":"library/core/src/str/pattern.rs"},"region":{"startLine":1791}}}],"partialFingerprints":{"codehealthFindingId/v1":"cab904c6ad5e1741848a6d234b7c90cead4cedac383c80476eb1dfc296f32fdc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): library/stdarch/crates/stdarch-gen-hexagon/src/hvx.rs:402-421 | library/stdarch/crates/stdarch-gen-hexagon/src/scalar.rs:354-373 \u2014 before extracting anything, compare \u0060library/stdarch/crates/stdarch-gen-hexagon/src/hvx.rs\u0060 and \u0060library/stdarch/crates/stdarch-gen-hexagon/src/scalar.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 55 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 \u0060library/stdarch/crates/stdarch-gen-hexagon/src/hvx.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":"library/stdarch/crates/stdarch-gen-hexagon/src/hvx.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"b394c31daa94ed261865dcac7972c62dcb855f370dcc2c57c765174ebb05804d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): src/librustdoc/passes/lint/redundant_explicit_links.rs:215-234 | src/librustdoc/passes/lint/redundant_explicit_links.rs:333-351 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/librustdoc/passes/lint/redundant_explicit_links.rs:215\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/librustdoc/passes/lint/redundant_explicit_links.rs:332\u0060 calls \u0060with_span_note\u0060, \u0060with_note\u0060 and \u0060src/librustdoc/passes/lint/redundant_explicit_links.rs:215\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/librustdoc/passes/lint/redundant_explicit_links.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6a9b0abf848f81db36b62255e81ee8383a31a2bbae88e68eef88096c869d8eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201320 lines \u00D7 2): src/tools/miri/src/intrinsics/aarch64.rs:273-286 | src/tools/miri/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/tools/miri/src/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/tools/miri/src/intrinsics/aarch64.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ecc560711d4224eefae42f3a09eb18d2f659b3bd491be8928394aad5ed69245"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-def/src/resolver.rs:823-842 | src/tools/rust-analyzer/crates/hir-def/src/resolver.rs:873-892 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tools/rust-analyzer/crates/hir-def/src/resolver.rs:823\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/tools/rust-analyzer/crates/hir-def/src/resolver.rs"},"region":{"startLine":823}}}],"partialFingerprints":{"codehealthFindingId/v1":"66b7124f2284f50b5e7b09c03cb0d6b1d91cd57c2e28ba58125c05cdab672652"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5\u201320 lines \u00D7 3): src/tools/rust-analyzer/crates/hir-ty/src/mir/eval.rs:2323-2342 | src/tools/rust-analyzer/crates/hir-ty/src/mir/eval.rs:2354-2371 | src/tools/rust-analyzer/crates/hir-ty/src/mir/eval.rs:3004-3008 \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/tools/rust-analyzer/crates/hir-ty/src/mir/eval.rs:2323\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/mir/eval.rs"},"region":{"startLine":2323}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ee9034134ba2ebd24bd2998b3783ecd7dfacac227a677bf29b42606c7382a76"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): src/tools/rust-analyzer/crates/rust-analyzer/src/cli/analysis_stats.rs:986-1005 | src/tools/rust-analyzer/crates/rust-analyzer/src/cli/analysis_stats.rs:1090-1109 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/rust-analyzer/src/cli/analysis_stats.rs:986\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/tools/rust-analyzer/crates/rust-analyzer/src/cli/analysis_stats.rs"},"region":{"startLine":986}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e3cd59a9de15b259de42eff6173d89cf9b09468a0ad9518c8468cad50f586d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 4): src/tools/rust-analyzer/crates/hir-ty/src/mir/eval.rs:1140-1158 | src/tools/rust-analyzer/crates/hir-ty/src/mir/eval.rs:1173-1190 | src/tools/rust-analyzer/crates/hir-ty/src/mir/eval.rs:1201-1218 | src/tools/rust-analyzer/crates/hir-ty/src/mir/eval.rs:1229-1246 \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/tools/rust-analyzer/crates/hir-ty/src/mir/eval.rs:1140\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/tools/rust-analyzer/crates/hir-ty/src/mir/eval.rs"},"region":{"startLine":1140}}}],"partialFingerprints":{"codehealthFindingId/v1":"f64a21cf05f4cba346a8ffe58572dce4ce01482383591be84bda73039d188186"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 3): compiler/rustc_passes/src/check_attr.rs:559-577 | compiler/rustc_passes/src/check_attr.rs:604-621 | compiler/rustc_passes/src/check_attr.rs:651-669 \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 \u0060compiler/rustc_passes/src/check_attr.rs:559\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":"compiler/rustc_passes/src/check_attr.rs"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"067eb4e48b4cc4c6daaae390e99a002ae1d33a93670b37c50cb501907fe09271"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 3): src/tools/rust-analyzer/crates/proc-macro-api/src/legacy_protocol/msg/flat.rs:150-168 | src/tools/rust-analyzer/crates/proc-macro-api/src/legacy_protocol/msg/flat.rs:226-244 | src/tools/rust-analyzer/crates/proc-macro-api/src/legacy_protocol/msg/flat.rs:268-286 \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/tools/rust-analyzer/crates/proc-macro-api/src/legacy_protocol/msg/flat.rs:150\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/tools/rust-analyzer/crates/proc-macro-api/src/legacy_protocol/msg/flat.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a23cb6bd2cf078d51dcd589da754df1ec0b17d99c00031aa82f1c4512f76b92"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): compiler/rustc_ast_lowering/src/format.rs:407-425 | src/tools/rust-analyzer/crates/hir-def/src/expr_store/lower/format_args.rs:260-278 \u2014 before extracting anything, compare \u0060compiler/rustc_ast_lowering/src/format.rs\u0060 and \u0060src/tools/rust-analyzer/crates/hir-def/src/expr_store/lower/format_args.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 96 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 \u0060compiler/rustc_ast_lowering/src/format.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":"compiler/rustc_ast_lowering/src/format.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"deb33b846796ebd053e1b50fa29bca9e795a15be2f9137232f51b1a8c6653b10"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): compiler/rustc_borrowck/src/type_check/mod.rs:1269-1286 | compiler/rustc_borrowck/src/type_check/mod.rs:1336-1354 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_borrowck/src/type_check/mod.rs:1269\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":"compiler/rustc_borrowck/src/type_check/mod.rs"},"region":{"startLine":1269}}}],"partialFingerprints":{"codehealthFindingId/v1":"c01f7b8ee70d808df038526bfa72838c494aa950b1e0d91676fc57b5674069e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): compiler/rustc_codegen_cranelift/src/allocator.rs:20-38 | compiler/rustc_codegen_gcc/src/allocator.rs:36-54 \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 \u0060compiler/rustc_codegen_cranelift/src/allocator.rs:20\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":"compiler/rustc_codegen_cranelift/src/allocator.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3280c2a45ad457312f517ec1f6210aa1d91fcc1df2cd854c3e91c6b040f7d25"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): compiler/rustc_const_eval/src/const_eval/machine.rs:679-697 | compiler/rustc_const_eval/src/const_eval/machine.rs:705-723 \u2014 both copies are in the same file, so extract the block 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, \u0060compiler/rustc_const_eval/src/const_eval/machine.rs:704\u0060 calls \u0060read_target_usize\u0060 and \u0060compiler/rustc_const_eval/src/const_eval/machine.rs:678\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":"compiler/rustc_const_eval/src/const_eval/machine.rs"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b181ce65685c8d12b65a94d4d8d8e6281cb0ad3e2c7a86c552602b24fca847f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): compiler/rustc_hir/src/hir.rs:3951-3969 | compiler/rustc_type_ir/src/ty_kind.rs:1109-1127 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir/src/hir.rs"},"region":{"startLine":3951}}}],"partialFingerprints":{"codehealthFindingId/v1":"830f4a442ab467d42324478fce0291aa926ebef2b1b2208648bb7c141891244c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): compiler/rustc_hir_analysis/src/check/compare_impl_item.rs:1427-1444 | compiler/rustc_hir_analysis/src/check/compare_impl_item.rs:1465-1483 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_hir_analysis/src/check/compare_impl_item.rs:1427\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":"compiler/rustc_hir_analysis/src/check/compare_impl_item.rs"},"region":{"startLine":1427}}}],"partialFingerprints":{"codehealthFindingId/v1":"715ec63591fdeb391a467bcc5f5df54d39e228b53b29b77dd1965d73c3811d71"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): compiler/rustc_hir_typeck/src/opaque_types.rs:68-86 | src/tools/rust-analyzer/crates/hir-ty/src/infer/opaques.rs:45-63 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. 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":"compiler/rustc_hir_typeck/src/opaque_types.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6539eb8e2a76b76edbeb0673e3474e3b4987b827e7095f7fee801317e23b0cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): compiler/rustc_mir_build/src/thir/print.rs:813-831 | compiler/rustc_mir_build/src/thir/print.rs:835-853 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_mir_build/src/thir/print.rs:813\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":"compiler/rustc_mir_build/src/thir/print.rs"},"region":{"startLine":813}}}],"partialFingerprints":{"codehealthFindingId/v1":"5215d06dad3127b6264c1699200ad4e17c8800597a699053b5b79a7d75ff4dbb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): compiler/rustc_mir_transform/src/lint_tail_expr_drop_order.rs:390-408 | compiler/rustc_mir_transform/src/lint_tail_expr_drop_order.rs:429-447 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_mir_transform/src/lint_tail_expr_drop_order.rs:390\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":"compiler/rustc_mir_transform/src/lint_tail_expr_drop_order.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ad9f3444b357ece8f8a2ec8c22032cfb0e787f663d69eacc8a112271eb15b3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201319 lines \u00D7 2): compiler/rustc_next_trait_solver/src/solve/trait_goals.rs:571-589 | compiler/rustc_next_trait_solver/src/solve/trait_goals.rs:596-612 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_next_trait_solver/src/solve/trait_goals.rs:571\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":"compiler/rustc_next_trait_solver/src/solve/trait_goals.rs"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcef86f90431b10c5c17be33bb084f3d3343174efc42cecdf4d4462a930cbc14"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): compiler/rustc_trait_selection/src/error_reporting/infer/mod.rs:2156-2174 | compiler/rustc_trait_selection/src/error_reporting/infer/mod.rs:2177-2195 \u2014 both copies are in the same file, so extract the block 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":"compiler/rustc_trait_selection/src/error_reporting/infer/mod.rs"},"region":{"startLine":2156}}}],"partialFingerprints":{"codehealthFindingId/v1":"da8d0ea7e1e5ce7b8e11b861dcda2de9fc5bca236c20d4830ac44e802cae5a63"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): compiler/rustc_trait_selection/src/solve/select.rs:117-135 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/select.rs:355-373 \u2014 before extracting anything, compare \u0060compiler/rustc_trait_selection/src/solve/select.rs\u0060 and \u0060src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/select.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 75 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 \u0060compiler/rustc_trait_selection/src/solve/select.rs:117\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":"compiler/rustc_trait_selection/src/solve/select.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"97c77736e4b7d4bab7003316c4bf907141c82bacc76bedd249f841f34ba05bb9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): library/compiler-builtins/libm/src/math/lgamma_r.rs:287-305 | library/compiler-builtins/libm/src/math/lgammaf_r.rs:222-240 \u2014 before extracting anything, compare \u0060library/compiler-builtins/libm/src/math/lgamma_r.rs\u0060 and \u0060library/compiler-builtins/libm/src/math/lgammaf_r.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 91 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 \u0060library/compiler-builtins/libm/src/math/lgamma_r.rs:287\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":"library/compiler-builtins/libm/src/math/lgamma_r.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"680d28f5f9641639979ba455f803873b4c864cfb9eb7a6c4f3d9549ff6f0d35c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): library/core/src/num/imp/flt2dec/mod.rs:385-403 | library/core/src/num/imp/flt2dec/mod.rs:630-648 \u2014 both copies are in the same file, so extract the block 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":"library/core/src/num/imp/flt2dec/mod.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e74e4e75ba25712a15d8e4c58da1d68e16162c7629caec66cc121627d1266cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): library/std/src/sys/paths/unix.rs:23-46 | library/std/src/sys/paths/wasi.rs:10-33 \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":"library/std/src/sys/paths/unix.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"c870f2826f713a9939564ec199a9d6c76299aa108704df3ade19e0593b587ff0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): library/std/src/sys/sync/once/futex.rs:124-142 | library/std/src/sys/sync/once/futex.rs:192-210 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/std/src/sys/sync/once/futex.rs:124\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":"library/std/src/sys/sync/once/futex.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b948fe2bce4b86fbbb092855999184d228b3ce6d219389d90710c10e5f3bcb0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201319 lines \u00D7 2): src/librustdoc/html/markdown.rs:1913-1928 | src/librustdoc/passes/lint/redundant_explicit_links.rs:558-576 \u2014 before extracting anything, compare \u0060src/librustdoc/html/markdown.rs\u0060 and \u0060src/librustdoc/passes/lint/redundant_explicit_links.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 38 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/librustdoc/html/markdown.rs:1913\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/librustdoc/html/markdown.rs"},"region":{"startLine":1913}}}],"partialFingerprints":{"codehealthFindingId/v1":"868cc6e23fd4111e45d0c679130d854681acc9d9d34270d88e1a4d3d329ee45f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): src/tools/clippy/clippy_dev/src/deprecate_lint.rs:38-56 | src/tools/clippy/clippy_dev/src/deprecate_lint.rs:90-108 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tools/clippy/clippy_dev/src/deprecate_lint.rs:38\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_dev/src/deprecate_lint.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"07f41c6e512aab869ab0c677a8e0319d257c67566da7fe73227073a63e060311"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): src/tools/clippy/clippy_lints/src/methods/clone_on_copy.rs:100-117 | src/tools/clippy/clippy_lints/src/methods/clone_on_copy.rs:156-174 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/clippy/clippy_lints/src/methods/clone_on_copy.rs:100\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/tools/clippy/clippy_lints/src/methods/clone_on_copy.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d17145690b65cffb48df2bd03123650ec3278e3116f2f4731f0f4d68022e585"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): src/tools/clippy/clippy_utils/src/ast_utils/mod.rs:313-331 | src/tools/clippy/clippy_utils/src/ast_utils/mod.rs:517-535 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tools/clippy/clippy_utils/src/ast_utils/mod.rs:313\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/tools/clippy/clippy_utils/src/ast_utils/mod.rs:311\u0060 calls \u0060ExternCrate\u0060, \u0060eq_id\u0060, \u0060Use\u0060 and \u0060src/tools/clippy/clippy_utils/src/ast_utils/mod.rs:516\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/tools/clippy/clippy_utils/src/ast_utils/mod.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a2b4a0dfc7702a76415f8d5befef25e7203ba354635d94c52d9894b6ccb94a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): src/tools/clippy/clippy_utils/src/ast_utils/mod.rs:576-594 | src/tools/clippy/clippy_utils/src/ast_utils/mod.rs:662-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/tools/clippy/clippy_utils/src/ast_utils/mod.rs:576\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/tools/clippy/clippy_utils/src/ast_utils/mod.rs"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"e86d2f102542d6c82993c36956a6734222237483174fe3335094ca7b44e7569e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201319 lines \u00D7 2): src/tools/miri/src/shims/unix/freebsd/sync.rs:197-215 | src/tools/miri/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/tools/miri/src/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/tools/miri/src/shims/unix/freebsd/sync.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"f685273dfed11e895ffb9f8743e8a6b87188bc83c4bf12bf62d8644d356427e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): src/tools/rust-analyzer/crates/intern/src/intern.rs:51-69 | src/tools/rust-analyzer/crates/intern/src/intern.rs:78-96 \u2014 both copies are in the same file, so extract the block 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/tools/rust-analyzer/crates/intern/src/intern.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"9743cad21e913b6ce7cd638b4ee066e88203640cd437ab23351d9847abbcf4fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): src/tools/rust-analyzer/crates/proc-macro-srv-cli/src/version.rs:40-58 | src/tools/rust-analyzer/crates/rust-analyzer/src/version.rs:39-57 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/proc-macro-srv-cli/src/version.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"2277cc67b856d0e664109601b9ad7e9935f1cccc219b6177f232a3e48d898f18"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): src/tools/rustfmt/src/comment.rs:684-702 | src/tools/rustfmt/src/comment.rs:739-756 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rustfmt/src/comment.rs:684\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/comment.rs"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4eeb87ebc15cf36e865eeab798a216176f82a7c1cbd174fda6d41c168b2562a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 3): library/core/src/num/imp/flt2dec/mod.rs:386-403 | library/core/src/num/imp/flt2dec/mod.rs:631-648 | library/core/src/num/imp/flt2dec/mod.rs:663-679 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/num/imp/flt2dec/mod.rs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"a82fc3c688434108b8e138ddec88090f4ff93cb942d4bd50e8a1848fde1d78a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201318 lines \u00D7 3): src/tools/miri/src/shims/unix/freebsd/foreign_items.rs:42-53 | src/tools/miri/src/shims/unix/macos/foreign_items.rs:263-280 | src/tools/miri/src/shims/unix/solarish/foreign_items.rs:83-92 \u2014 \u0060src/tools/miri/src/shims/unix/macos/foreign_items.rs\u0060 and \u0060src/tools/miri/src/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/tools/miri/src/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/tools/miri/src/shims/unix/freebsd/foreign_items.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"b11babae4a43d5e5908793d8024fb5ef907d9483aed8954f716791b34b80cc08"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 3): src/tools/rust-analyzer/crates/hir-ty/src/infer.rs:1956-1973 | src/tools/rust-analyzer/crates/hir-ty/src/infer.rs:2263-2280 | src/tools/rust-analyzer/crates/hir-ty/src/infer/path.rs:153-170 \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/tools/rust-analyzer/crates/hir-ty/src/infer.rs"},"region":{"startLine":1956}}}],"partialFingerprints":{"codehealthFindingId/v1":"02131fcef51f0e23f4a2f5fbc5b1c2ffc5f8a2f5cb044df5b32991805d926ee0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 3): src/tools/rust-analyzer/crates/proc-macro-api/src/legacy_protocol/msg/flat.rs:176-193 | src/tools/rust-analyzer/crates/proc-macro-api/src/legacy_protocol/msg/flat.rs:294-311 | src/tools/rust-analyzer/crates/proc-macro-api/src/legacy_protocol/msg/flat.rs:325-342 \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/tools/rust-analyzer/crates/proc-macro-api/src/legacy_protocol/msg/flat.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4d25dd893123b3c55116b575b4d8bce08253d3af530743ba64e06fc3bbb9174"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): compiler/rustc_ast/src/format.rs:98-115 | src/tools/rust-analyzer/crates/hir-def/src/hir/format_args.rs:474-491 \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 \u0060compiler/rustc_ast/src/format.rs:98\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":"compiler/rustc_ast/src/format.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"9365637892a257e9b0f4ee7bfd0d4493e528630364c12649e5e9e17dffb39dcc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201318 lines \u00D7 2): compiler/rustc_ast_lowering/src/format.rs:315-330 | src/tools/rust-analyzer/crates/hir-def/src/expr_store/lower/format_args.rs:142-159 \u2014 before extracting anything, compare \u0060compiler/rustc_ast_lowering/src/format.rs\u0060 and \u0060src/tools/rust-analyzer/crates/hir-def/src/expr_store/lower/format_args.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 96 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 \u0060compiler/rustc_ast_lowering/src/format.rs:315\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":"compiler/rustc_ast_lowering/src/format.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cd750fb34b8366aaff6fb9ba773dc4280c0e6362fd259784f27d53a391d94db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): compiler/rustc_ast_lowering/src/format.rs:345-362 | src/tools/rust-analyzer/crates/hir-def/src/expr_store/lower/format_args.rs:200-217 \u2014 before extracting anything, compare \u0060compiler/rustc_ast_lowering/src/format.rs\u0060 and \u0060src/tools/rust-analyzer/crates/hir-def/src/expr_store/lower/format_args.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 96 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 \u0060compiler/rustc_ast_lowering/src/format.rs:345\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":"compiler/rustc_ast_lowering/src/format.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"906b3571625347b337b973351d18eaceedc74ed1968a20354f29865bed16f44f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): compiler/rustc_codegen_llvm/src/asm.rs:1281-1298 | compiler/rustc_codegen_llvm/src/asm.rs:1474-1491 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_codegen_llvm/src/asm.rs:1281\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":"compiler/rustc_codegen_llvm/src/asm.rs"},"region":{"startLine":1281}}}],"partialFingerprints":{"codehealthFindingId/v1":"7695096a449167e81cdd9b2186cae1082f72b953d2b852d312024c46098d6927"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): compiler/rustc_codegen_llvm/src/intrinsic.rs:2670-2687 | compiler/rustc_codegen_llvm/src/intrinsic.rs:2751-2768 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_codegen_llvm/src/intrinsic.rs:2670\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":"compiler/rustc_codegen_llvm/src/intrinsic.rs"},"region":{"startLine":2670}}}],"partialFingerprints":{"codehealthFindingId/v1":"59f6159ddf9f8569dce0173eeee32fefacfd2b8bcb624b92f3022c1875b27ff7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5\u201320 lines \u00D7 4): compiler/rustc_const_eval/src/const_eval/dummy_machine.rs:149-153 | compiler/rustc_const_eval/src/const_eval/dummy_machine.rs:154-173 | src/tools/miri/src/operator.rs:30-34 | src/tools/miri/src/operator.rs:35-54 \u2014 there are 4 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_const_eval/src/const_eval/dummy_machine.rs:154\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. 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":"compiler/rustc_const_eval/src/const_eval/dummy_machine.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"a534ac3c66f8c5c1c367d3ce5461497ea06014cbf59c5f06b93050f63ef52a24"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): compiler/rustc_hir_typeck/src/coercion.rs:2238-2255 | src/tools/rust-analyzer/crates/hir-ty/src/infer/coerce.rs:1630-1647 \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 \u0060compiler/rustc_hir_typeck/src/coercion.rs:2238\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 first that the copies are not typed on the same thing: the declarations holding them bind \u0060goal\u0060 to \u0060\u0026inspect::InspectGoal\u003C\u0027_, \u0027tcx\u003E\u0060 in one and \u0060\u0026InspectGoal\u003C\u0027_, \u0027db\u003E\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":"compiler/rustc_hir_typeck/src/coercion.rs"},"region":{"startLine":2238}}}],"partialFingerprints":{"codehealthFindingId/v1":"dad0665060e482547199a5784278ea728af6c22c22d19a9d2c8b303a5a7c2fc1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201318 lines \u00D7 2): compiler/rustc_hir_typeck/src/pat.rs:2824-2837 | compiler/rustc_hir_typeck/src/pat.rs:2858-2875 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_hir_typeck/src/pat.rs:2858\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/pat.rs"},"region":{"startLine":2824}}}],"partialFingerprints":{"codehealthFindingId/v1":"5287328e08da518228f2be92ed5de264f13342fb014e11586137df22e11e9045"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): compiler/rustc_index/src/bit_set.rs:780-797 | compiler/rustc_index/src/bit_set.rs:859-875 \u2014 both copies are in the same file, so extract the block 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":"compiler/rustc_index/src/bit_set.rs"},"region":{"startLine":780}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a7338b1a7e2f9e8fb6eb9249c7e6acaa1f6895b5d9e2f0f97f38029421ec56b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): compiler/rustc_infer/src/infer/snapshot/undo_log.rs:139-156 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/snapshot/undo_log.rs:134-151 \u2014 before extracting anything, compare \u0060compiler/rustc_infer/src/infer/snapshot/undo_log.rs\u0060 and \u0060src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/snapshot/undo_log.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 50 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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060snapshot\u0060 to \u0060Snapshot\u003C\u0027tcx\u003E\u0060 in one and \u0060Snapshot\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":"compiler/rustc_infer/src/infer/snapshot/undo_log.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"964f427480e3440cf851588eb094718b6754a1fcc1941b01001423cd51af2038"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): compiler/rustc_middle/src/ty/util.rs:1207-1224 | compiler/rustc_middle/src/ty/util.rs:1260-1277 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_middle/src/ty/util.rs:1207\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":"compiler/rustc_middle/src/ty/util.rs"},"region":{"startLine":1207}}}],"partialFingerprints":{"codehealthFindingId/v1":"c26b5440d13830c31681d2e518ede3581dfad0a51fb70711575c43437566ff95"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): compiler/rustc_next_trait_solver/src/normalize.rs:114-131 | compiler/rustc_next_trait_solver/src/normalize.rs:165-181 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_next_trait_solver/src/normalize.rs:114\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_next_trait_solver/src/normalize.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"78e810c54217e46c57581b34a15816c21f75a79b1186e67eb2bb1edca1e0f098"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): compiler/rustc_trait_selection/src/solve/fulfill/derive_errors.rs:205-222 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/errors.rs:335-352 \u2014 before extracting anything, compare \u0060compiler/rustc_trait_selection/src/solve/fulfill/derive_errors.rs\u0060 and \u0060src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/errors.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 99 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 \u0060compiler/rustc_trait_selection/src/solve/fulfill/derive_errors.rs:205\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":"compiler/rustc_trait_selection/src/solve/fulfill/derive_errors.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"a875aeac404332cb9b40c234e8a33fa0638975382c46f569b46168450cc6bc3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): library/compiler-builtins/libm/src/math/acos.rs:81-98 | library/compiler-builtins/libm/src/math/acosf.rs:49-66 \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 \u0060library/compiler-builtins/libm/src/math/acos.rs:81\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060x\u0060 to \u0060f64\u0060 in one and \u0060f32\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":"library/compiler-builtins/libm/src/math/acos.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"01512cadeb61e0d6359a449fdfe555bb76621c73163d4dcad7b003e2ca4f8fa4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): library/compiler-builtins/libm/src/math/expm1.rs:96-113 | library/compiler-builtins/libm/src/math/expm1f.rs:100-116 \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":"library/compiler-builtins/libm/src/math/expm1.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"45e977b891ac8c99bf1ca85e70ecd110e1b038315d8172fb1f8bd822c2abc15d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): library/std/src/os/xous/ffi.rs:38-55 | library/std/src/os/xous/ffi.rs:102-119 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/std/src/os/xous/ffi.rs:38\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":"library/std/src/os/xous/ffi.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a783009396faad0d4087ecbd8db1a4568448fa383b9abb8d5e704d9b1def680"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): library/std/src/os/xous/ffi.rs:520-537 | library/std/src/os/xous/ffi.rs:596-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 \u0060library/std/src/os/xous/ffi.rs:520\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":"library/std/src/os/xous/ffi.rs"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6364e530e0094a637c716fc193d5140d8f02e43119707e0a4d467a4e422ab90"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): library/std/src/sys/net/connection/wasip1.rs:185-202 | library/std/src/sys/net/connection/wasip1.rs:285-302 \u2014 both copies are in the same file, so extract the block 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":"library/std/src/sys/net/connection/wasip1.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bf6d148c9353c98f8e48793474913063f57974fb8e673116851189574fd3c6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): src/tools/clippy/clippy_lints/src/loops/while_let_on_iterator.rs:213-230 | src/tools/clippy/clippy_lints/src/loops/while_let_on_iterator.rs:254-270 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/loops/while_let_on_iterator.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4dd6ce4b30b9d912c7b0cb5a14e41ebc9bfec0fa109ab7468cfc630b16c42ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): src/tools/clippy/clippy_lints/src/undocumented_unsafe_blocks.rs:257-274 | src/tools/clippy/clippy_lints/src/undocumented_unsafe_blocks.rs:280-296 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/clippy/clippy_lints/src/undocumented_unsafe_blocks.rs:257\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/tools/clippy/clippy_lints/src/undocumented_unsafe_blocks.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6ac92e8bf20839dab5451c7501f6a11d09887d5127a7e883c838949e379e10a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-def/src/expr_store/lower.rs:107-124 | src/tools/rust-analyzer/crates/hir-def/src/expr_store/lower.rs:142-159 \u2014 both copies are in the same file, so extract the block 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/tools/rust-analyzer/crates/hir-def/src/expr_store/lower.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"2493fa592af8ef38561e09af3a958cabae91d8b0243f56019f94d7d4d769507a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-ty/src/mir/eval.rs:1435-1452 | src/tools/rust-analyzer/crates/hir-ty/src/mir/eval.rs:1473-1490 \u2014 both copies are in the same file, so extract the block 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/tools/rust-analyzer/crates/hir-ty/src/mir/eval.rs"},"region":{"startLine":1435}}}],"partialFingerprints":{"codehealthFindingId/v1":"3befcce15d4188d3ad4254b374a2aef7a32926b31b33e707bbaa694d2faa97a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201318 lines \u00D7 2): src/tools/rust-analyzer/crates/ide-completion/src/completions/expr.rs:132-149 | src/tools/rust-analyzer/crates/ide-completion/src/completions/type.rs:76-91 \u2014 before extracting anything, compare \u0060src/tools/rust-analyzer/crates/ide-completion/src/completions/expr.rs\u0060 and \u0060src/tools/rust-analyzer/crates/ide-completion/src/completions/type.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 49 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tools/rust-analyzer/crates/ide-completion/src/completions/expr.rs:132\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-completion/src/completions/expr.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"017aeedf1696f5047920032e7648b8a3fb15fbc216fc6a1b06aca0d3f920bfec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): src/tools/rust-analyzer/crates/ide-diagnostics/src/handlers/unlinked_file.rs:130-147 | src/tools/rust-analyzer/crates/ide-diagnostics/src/handlers/unlinked_file.rs:190-206 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/ide-diagnostics/src/handlers/unlinked_file.rs:130\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/tools/rust-analyzer/crates/ide-diagnostics/src/handlers/unlinked_file.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"382c001ec69f8593efeb4a177021860c41e75f0da718693cd519450e002e008d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): src/tools/rust-analyzer/crates/ide/src/inlay_hints/lifetime.rs:249-265 | src/tools/rust-analyzer/crates/ide/src/inlay_hints/lifetime.rs:345-362 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/ide/src/inlay_hints/lifetime.rs:249\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/inlay_hints/lifetime.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"855a2996ad583762cab5a9fb8af827cbe7d9d5b97d92255906a036fe556a0762"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): src/tools/rustfmt/src/items.rs:2068-2086 | src/tools/rustfmt/src/items.rs:2089-2107 \u2014 both copies are in the same file, so extract the block 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/tools/rustfmt/src/items.rs"},"region":{"startLine":2068}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f16ef4b3bd266e82590cbaf0ff9ab66ba6e7ce5e5e6a2ff077c0b218dc486f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 4): library/compiler-builtins/libm/src/math/j0.rs:294-310 | library/compiler-builtins/libm/src/math/j0f.rs:231-247 | library/compiler-builtins/libm/src/math/j1.rs:286-302 | library/compiler-builtins/libm/src/math/j1f.rs:230-246 \u2014 before extracting anything, compare \u0060library/compiler-builtins/libm/src/math/j0.rs\u0060 and \u0060library/compiler-builtins/libm/src/math/j0f.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 80 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060x\u0060 to \u0060f64\u0060 in one and \u0060f32\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":"library/compiler-builtins/libm/src/math/j0.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c8d0373ba2dbc202e6ce80952d7fe2481162c7256e24eb9801716353e5bd372"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 4): library/compiler-builtins/libm/src/math/j0.rs:406-422 | library/compiler-builtins/libm/src/math/j0f.rs:343-359 | library/compiler-builtins/libm/src/math/j1.rs:398-414 | library/compiler-builtins/libm/src/math/j1f.rs:342-358 \u2014 before extracting anything, compare \u0060library/compiler-builtins/libm/src/math/j0.rs\u0060 and \u0060library/compiler-builtins/libm/src/math/j0f.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 80 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060x\u0060 to \u0060f64\u0060 in one and \u0060f32\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":"library/compiler-builtins/libm/src/math/j0.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea0c1aa98c603a9713f6702cdded23210f08e46292224ec9ce3d1b4a199ff376"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201317 lines \u00D7 4): library/std/src/sys/env/hermit.rs:30-46 | library/std/src/sys/env/solid.rs:38-54 | library/std/src/sys/env/unix.rs:94-110 | library/std/src/sys/env/wasi.rs:60-72 \u2014 before extracting anything, compare \u0060library/std/src/sys/env/solid.rs\u0060 and \u0060library/std/src/sys/env/unix.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 39 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 \u0060library/std/src/sys/env/hermit.rs:30\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":"library/std/src/sys/env/hermit.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3db842a441270f442ecb3bcb942ea4b6500fea729901158ece6905a9fae1e5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3): compiler/rustc_codegen_llvm/src/intrinsic.rs:681-697 | compiler/rustc_codegen_llvm/src/intrinsic.rs:702-718 | compiler/rustc_codegen_llvm/src/intrinsic.rs:724-740 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060compiler/rustc_codegen_llvm/src/intrinsic.rs:719\u0060 calls \u0060insert_value\u0060, \u0060immediate\u0060 and \u0060compiler/rustc_codegen_llvm/src/intrinsic.rs:698\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":"compiler/rustc_codegen_llvm/src/intrinsic.rs"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dbcf71463245e86e0af7c86f87d6052840c26bc0b38d5c7ed30213d1928ca2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201317 lines \u00D7 3): compiler/rustc_const_eval/src/interpret/stack.rs:520-533 | compiler/rustc_next_trait_solver/src/solve/assembly/structural_traits.rs:126-142 | compiler/rustc_trait_selection/src/traits/select/mod.rs:2034-2047 \u2014 before extracting anything, compare \u0060compiler/rustc_next_trait_solver/src/solve/assembly/structural_traits.rs\u0060 and \u0060compiler/rustc_trait_selection/src/traits/select/mod.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 40 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_const_eval/src/interpret/stack.rs:520\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, \u0060compiler/rustc_next_trait_solver/src/solve/assembly/structural_traits.rs:143\u0060 calls \u0060Pat\u0060 and \u0060compiler/rustc_const_eval/src/interpret/stack.rs:534\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":"compiler/rustc_const_eval/src/interpret/stack.rs"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"29900a6d8cdb0ec4800a5cdcc35d467c0c3bc33ac1879ff39c3a285d59f57751"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3): library/std/src/sys/net/connection/xous/tcplistener.rs:53-69 | library/std/src/sys/net/connection/xous/udp.rs:45-61 | library/std/src/sys/net/connection/xous/udp.rs:229-245 \u2014 before extracting anything, compare \u0060library/std/src/sys/net/connection/xous/tcplistener.rs\u0060 and \u0060library/std/src/sys/net/connection/xous/udp.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 74 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060addr\u0060 to \u0060\u0026mut SocketAddr\u0060 in one and \u0060\u0026SocketAddr\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":"library/std/src/sys/net/connection/xous/tcplistener.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"27ea355fa4eb745de9fbe383f1398cb757615e318c663d7cc79bdf68c1e921a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3): src/tools/rust-analyzer/crates/hir-ide/src/diagnostics/decl_check.rs:357-373 | src/tools/rust-analyzer/crates/hir-ide/src/diagnostics/decl_check.rs:445-461 | src/tools/rust-analyzer/crates/hir-ide/src/diagnostics/decl_check.rs:608-624 \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/tools/rust-analyzer/crates/hir-ide/src/diagnostics/decl_check.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. 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/tools/rust-analyzer/crates/hir-ide/src/diagnostics/decl_check.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ace1441aa080a90c7074bc93dba2c750ef3664601ae6a661b01bd835a0a03c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3): src/tools/rust-analyzer/crates/proc-macro-srv/src/token_stream.rs:115-131 | src/tools/rust-analyzer/crates/proc-macro-srv/src/token_stream.rs:143-159 | src/tools/rust-analyzer/crates/proc-macro-srv/src/token_stream.rs:171-187 \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/tools/rust-analyzer/crates/proc-macro-srv/src/token_stream.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab37c5e05d58174660669d683c90f1e37b60bf1d41d4b856193ea3e43c1eaf1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): compiler/rustc_borrowck/src/dataflow.rs:235-251 | compiler/rustc_borrowck/src/dataflow.rs:336-352 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_borrowck/src/dataflow.rs:235\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":"compiler/rustc_borrowck/src/dataflow.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"08931f021298dca5db34723a99dea7a8e9106998a3b7d958cd6f93ab3ba51663"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): compiler/rustc_borrowck/src/lib.rs:1482-1498 | compiler/rustc_borrowck/src/polonius/legacy/loan_invalidations.rs:248-264 \u2014 before extracting anything, compare \u0060compiler/rustc_borrowck/src/lib.rs\u0060 and \u0060compiler/rustc_borrowck/src/polonius/legacy/loan_invalidations.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 67 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 \u0060compiler/rustc_borrowck/src/lib.rs:1482\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":"compiler/rustc_borrowck/src/lib.rs"},"region":{"startLine":1482}}}],"partialFingerprints":{"codehealthFindingId/v1":"6037fdc42e92c791929d039037c093b0986709bac07dfbce7e10cce047673e3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): compiler/rustc_data_structures/src/flock/unix.rs:122-138 | src/librustdoc/html/render/write_shared/flock.rs:75-91 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_data_structures/src/flock/unix.rs:122\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":"compiler/rustc_data_structures/src/flock/unix.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"c27dae422bfc88c86f36b236e0565bdc43a2554d3c529e8bdf70ab93769d18b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): compiler/rustc_hir_analysis/src/check/compare_impl_item.rs:1337-1353 | compiler/rustc_hir_analysis/src/check/compare_impl_item.rs:1362-1378 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_hir_analysis/src/check/compare_impl_item.rs:1337\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":"compiler/rustc_hir_analysis/src/check/compare_impl_item.rs"},"region":{"startLine":1337}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d9c3f36fee0072ee0c0ad3a7652a313502964bd3e6a5a10492b2b84e8518175"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): compiler/rustc_hir_analysis/src/check/wfcheck.rs:1182-1198 | compiler/rustc_hir_analysis/src/check/wfcheck.rs:1207-1223 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_hir_analysis/src/check/wfcheck.rs:1182\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":"compiler/rustc_hir_analysis/src/check/wfcheck.rs"},"region":{"startLine":1182}}}],"partialFingerprints":{"codehealthFindingId/v1":"70a807d88f5b41bd0d6ecfe220ca68e3bbac2ae5d99be07a7579b75fc53bc9c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): compiler/rustc_hir_analysis/src/collect/type_of.rs:306-322 | compiler/rustc_hir_analysis/src/collect/type_of.rs:347-363 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_hir_analysis/src/collect/type_of.rs:306\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060def_id\u0060 to \u0060DefId\u0060 in one and \u0060LocalDefId\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":"compiler/rustc_hir_analysis/src/collect/type_of.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"0db446d640ff377febeb8c214c9fa755c1a4054272e765370e4617c871c94e9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): compiler/rustc_hir_typeck/src/callee.rs:1259-1275 | src/tools/rust-analyzer/crates/hir-ty/src/infer/callee.rs:552-568 \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 \u0060compiler/rustc_hir_typeck/src/callee.rs:1259\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":"compiler/rustc_hir_typeck/src/callee.rs"},"region":{"startLine":1259}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d1cd863d975490ca5223d65c6aa0c6f900ef337f042d72bf68ce9e532d570b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): compiler/rustc_trait_selection/src/solve/fulfill/derive_errors.rs:501-517 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/errors.rs:610-626 \u2014 before extracting anything, compare \u0060compiler/rustc_trait_selection/src/solve/fulfill/derive_errors.rs\u0060 and \u0060src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/errors.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 99 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 \u0060compiler/rustc_trait_selection/src/solve/fulfill/derive_errors.rs:501\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":"compiler/rustc_trait_selection/src/solve/fulfill/derive_errors.rs"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"b41b6a1cfabeaa502362fe0708ac4ea7af358216587b75bb1d28901e1f5915d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): library/std/src/sys/pal/windows/handle.rs:267-283 | library/std/src/sys/pal/windows/handle.rs:317-332 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/std/src/sys/pal/windows/handle.rs:267\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, \u0060library/std/src/sys/pal/windows/handle.rs:286\u0060 calls \u0060Ok\u0060 and \u0060library/std/src/sys/pal/windows/handle.rs:335\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":"library/std/src/sys/pal/windows/handle.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c5ba9594358dfaab04be07d940e1882239bfc5e8d5f149fcb41d9c395c614f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201317 lines \u00D7 2): library/std/src/sys/sync/thread_parking/pthread.rs:56-72 | library/std/src/sys/sync/thread_parking/pthread.rs:103-113 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/std/src/sys/sync/thread_parking/pthread.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":"library/std/src/sys/sync/thread_parking/pthread.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"40ad4d5a2accddd98a27dcec2e143f841ff40e2dd0e13d4c2a6ba7978a4e9885"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): library/stdarch/crates/stdarch-gen-arm/src/wildstring.rs:90-106 | library/stdarch/crates/stdarch-gen-arm/src/wildstring.rs:111-127 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/stdarch/crates/stdarch-gen-arm/src/wildstring.rs:90\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":"library/stdarch/crates/stdarch-gen-arm/src/wildstring.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ba42565118242decfed17ed509438c13ce92d7a54bb84afb0f612c8d25e9282"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): src/librustdoc/html/render/search_index.rs:367-383 | src/librustdoc/html/render/search_index.rs:537-552 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/librustdoc/html/render/search_index.rs:367\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/librustdoc/html/render/search_index.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ce188357a354328b6a16cecab586e6c4da09f8295f0a696842f0f92e152703d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/tools/clippy/clippy_lints/src/casts/cast_possible_wrap.rs:99-115 | src/tools/clippy/clippy_lints/src/casts/cast_sign_loss.rs:57-73 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/casts/cast_possible_wrap.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"8db079f46e3a952dfe682846a2fd13cd9c627fc48eeb0d7d9b4f667a6d6698d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/tools/clippy/clippy_lints/src/disallowed_items.rs:318-334 | src/tools/clippy/clippy_lints/src/disallowed_items.rs:341-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/tools/clippy/clippy_lints/src/disallowed_items.rs:318\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/tools/clippy/clippy_lints/src/disallowed_items.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"04a5cb8f5616ce8672551e3e63001e56556bcbf6df0f9d947ff3a9369d956f42"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): src/tools/clippy/clippy_lints/src/manual_pop_if.rs:214-231 | src/tools/clippy/clippy_lints/src/manual_pop_if.rs:374-391 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/clippy/clippy_lints/src/manual_pop_if.rs:214\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/tools/clippy/clippy_lints/src/manual_pop_if.rs:373\u0060 calls \u0060typeck_results\u0060, \u0060expr_ty\u0060, \u0060is_bool\u0060 and \u0060src/tools/clippy/clippy_lints/src/manual_pop_if.rs:213\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/tools/clippy/clippy_lints/src/manual_pop_if.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fe102ea4d186d892d098523967d08fa545e1be16e1e01a3531c85abe90542eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/tools/clippy/clippy_lints/src/needless_continue.rs:493-509 | src/tools/clippy/clippy_lints/src/needless_continue.rs:527-543 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/clippy/clippy_lints/src/needless_continue.rs:493\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/tools/clippy/clippy_lints/src/needless_continue.rs"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"18ec808e67a7a554357ebbaf9f2596bc005f11f03de249a6747d2727a616451a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/tools/miri/src/shims/unix/tcp_socket.rs:239-255 | src/tools/miri/src/shims/unix/udp_socket.rs:127-143 \u2014 before extracting anything, compare \u0060src/tools/miri/src/shims/unix/tcp_socket.rs\u0060 and \u0060src/tools/miri/src/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/tools/miri/src/shims/unix/tcp_socket.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee470b15d98eed6a078f3e6e8d44052f141efed79d7410a8a3d791d25896d787"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/tools/miri/src/shims/unix/tcp_socket.rs:763-779 | src/tools/miri/src/shims/unix/udp_socket.rs:268-284 \u2014 before extracting anything, compare \u0060src/tools/miri/src/shims/unix/tcp_socket.rs\u0060 and \u0060src/tools/miri/src/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/tools/miri/src/shims/unix/tcp_socket.rs:761\u0060 calls \u0060ensure_not_failed\u0060 and \u0060src/tools/miri/src/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/tools/miri/src/shims/unix/tcp_socket.rs"},"region":{"startLine":763}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ca2b03c9bee5b58a90bc19fedd5e618e0e149a29aa612f8b22cf6bd30a72ef8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/tools/miri/src/shims/unix/tcp_socket.rs:1164-1180 | src/tools/miri/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/tools/miri/src/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/tools/miri/src/shims/unix/tcp_socket.rs"},"region":{"startLine":1164}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccf9c74636018eed8f167dedf9a1c0511fe325242c50cf125a2a38c6135e4f07"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-ty/src/infer/expr.rs:76-92 | src/tools/rust-analyzer/crates/hir-ty/src/infer/expr.rs:293-309 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/hir-ty/src/infer/expr.rs:76\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/tools/rust-analyzer/crates/hir-ty/src/infer/expr.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"9021e4400fe0259a274bbad91db9082123b54e9336ba44916f313d4c37e5addf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): src/tools/rust-analyzer/crates/hir/src/semantics.rs:2478-2498 | src/tools/rust-analyzer/crates/ide-assists/src/handlers/extract_function.rs:709-729 \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/tools/rust-analyzer/crates/hir/src/semantics.rs:2478\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/tools/rust-analyzer/crates/hir/src/semantics.rs"},"region":{"startLine":2478}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ce9a0bbdaf4cc3545c07d4e4991dc49411fa8bc9a49c97c0b9dba1ab2843919"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/tools/rust-analyzer/crates/ide-diagnostics/src/handlers/unresolved_field.rs:37-53 | src/tools/rust-analyzer/crates/ide-diagnostics/src/handlers/unresolved_method.rs:34-50 \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/tools/rust-analyzer/crates/ide-diagnostics/src/handlers/unresolved_field.rs:37\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060d\u0060 to \u0060\u0026hir::UnresolvedField\u003C\u0027_\u003E\u0060 in one and \u0060\u0026hir::UnresolvedMethodCall\u003C\u0027_\u003E\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/tools/rust-analyzer/crates/ide-diagnostics/src/handlers/unresolved_field.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"c96282b3d12330ac8d5904c85768905d19e5aa42c06e425f2ff389fa1cfd4b0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/tools/rust-analyzer/crates/ide/src/syntax_highlighting/highlight.rs:540-556 | src/tools/rust-analyzer/crates/ide/src/syntax_highlighting/highlight.rs:563-579 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/ide/src/syntax_highlighting/highlight.rs:540\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/tools/rust-analyzer/crates/ide/src/syntax_highlighting/highlight.rs"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"b30a23c51417c21b182f618bc9f9852d1f71885fc668914ddfda0f3dfd95afa8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201317 lines \u00D7 2): src/tools/rust-analyzer/crates/proc-macro-api/src/legacy_protocol/msg/flat.rs:831-847 | src/tools/rust-analyzer/crates/proc-macro-api/src/legacy_protocol/msg/flat.rs:942-956 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/proc-macro-api/src/legacy_protocol/msg/flat.rs:831\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/tools/rust-analyzer/crates/proc-macro-api/src/legacy_protocol/msg/flat.rs:848\u0060 calls \u0060push\u0060 and \u0060src/tools/rust-analyzer/crates/proc-macro-api/src/legacy_protocol/msg/flat.rs:957\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/tools/rust-analyzer/crates/proc-macro-api/src/legacy_protocol/msg/flat.rs"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"b38b1803cd2be40261ad1be77a734cc348be7abaa6efe95d754852f43c2925e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/tools/rust-analyzer/crates/span/src/map.rs:167-183 | src/tools/rust-analyzer/crates/syntax/src/lib.rs:223-239 \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/tools/rust-analyzer/crates/span/src/map.rs:167\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/tools/rust-analyzer/crates/span/src/map.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"a28634a2cfd76eb4542cbdc3d66f351d543f1598be918d9b1de3a9c46b627be5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:369-386 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:2172-2189 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:369\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/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:368\u0060 calls \u0060map_node\u0060, \u0060syntax\u0060, \u0060clone\u0060 and \u0060src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:2171\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/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"75b01416bc7c6a7947a8da7cd5bd626384e07c6daa7923bcf884ba9a390f8a6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 5): library/std/src/sys/fs/unix.rs:1326-1341 | library/std/src/sys/fs/unix.rs:1350-1365 | library/std/src/sys/fs/unix.rs:1374-1389 | library/std/src/sys/fs/unix.rs:1410-1425 | library/std/src/sys/fs/unix.rs:1446-1461 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/std/src/sys/fs/unix.rs:1326\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":"library/std/src/sys/fs/unix.rs"},"region":{"startLine":1326}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb499a6cae6f6e3481e4063260708ef67c07d567abfbfe79f0996b149a3c9f9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201316 lines \u00D7 4): compiler/rustc_hir_analysis/src/check/compare_impl_item.rs:268-279 | compiler/rustc_hir_analysis/src/check/compare_impl_item.rs:293-308 | compiler/rustc_hir_analysis/src/check/compare_impl_item.rs:515-526 | compiler/rustc_hir_analysis/src/check/compare_impl_item.rs:2561-2576 \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 \u0060compiler/rustc_hir_analysis/src/check/compare_impl_item.rs:293\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":"compiler/rustc_hir_analysis/src/check/compare_impl_item.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"088276d291d8f8275f9a8c3eedc8660089c51d64662e43b113391979e6196113"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 4): src/tools/rust-analyzer/crates/ide-db/src/imports/merge_imports.rs:879-894 | src/tools/rust-analyzer/crates/ide-db/src/imports/merge_imports.rs:918-933 | src/tools/rustfmt/src/sort.rs:26-41 | src/tools/rustfmt/src/sort.rs:69-84 \u2014 before extracting anything, compare \u0060src/tools/rust-analyzer/crates/ide-db/src/imports/merge_imports.rs\u0060 and \u0060src/tools/rustfmt/src/sort.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 151 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/tools/rust-analyzer/crates/ide-db/src/imports/merge_imports.rs:879\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/tools/rust-analyzer/crates/ide-db/src/imports/merge_imports.rs"},"region":{"startLine":879}}}],"partialFingerprints":{"codehealthFindingId/v1":"958d84be1b3ebfd5fedf4a69b27df8ca188283add1eff09d1d8691fda5b8ccf8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3): compiler/rustc_codegen_cranelift/src/allocator.rs:15-30 | compiler/rustc_codegen_gcc/src/allocator.rs:31-46 | compiler/rustc_codegen_llvm/src/allocator.rs:34-49 \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 \u0060compiler/rustc_codegen_cranelift/src/allocator.rs:15\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":"compiler/rustc_codegen_cranelift/src/allocator.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c38d5d4d4b0623757af49841d11da4c6a4ca042ed62c89412c83440cc340eab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3): library/std/src/sys/env/solid.rs:59-74 | library/std/src/sys/env/unix.rs:115-130 | library/std/src/sys/env/wasi.rs:77-92 \u2014 before extracting anything, compare \u0060library/std/src/sys/env/solid.rs\u0060 and \u0060library/std/src/sys/env/unix.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 39 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":"library/std/src/sys/env/solid.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f5a8f3f74b4ac62e4fd0a5aa0dea01a8b2546b53a20c7dcae02f41e1d824ce6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201316 lines \u00D7 3): src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1816-1831 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1946-1957 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:2209-2222 \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/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1816\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/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs"},"region":{"startLine":1816}}}],"partialFingerprints":{"codehealthFindingId/v1":"de158e1b405435966228a596db371c9263903eedbc4c3e484cbd33a99a60961c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): compiler/rustc_borrowck/src/diagnostics/explain_borrow.rs:743-758 | compiler/rustc_borrowck/src/diagnostics/explain_borrow.rs:789-804 \u2014 both copies are in the same file, so extract the block 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":"compiler/rustc_borrowck/src/diagnostics/explain_borrow.rs"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"de6bf476e9db2b3179da747f17239648fe81772366010bcd956c0f6f170ae982"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201316 lines \u00D7 2): compiler/rustc_borrowck/src/lib.rs:1549-1564 | compiler/rustc_borrowck/src/polonius/legacy/loan_invalidations.rs:284-296 \u2014 before extracting anything, compare \u0060compiler/rustc_borrowck/src/lib.rs\u0060 and \u0060compiler/rustc_borrowck/src/polonius/legacy/loan_invalidations.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 67 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 \u0060compiler/rustc_borrowck/src/lib.rs:1549\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":"compiler/rustc_borrowck/src/lib.rs"},"region":{"startLine":1549}}}],"partialFingerprints":{"codehealthFindingId/v1":"8002258c3b045321b40694b0afee5f3975a59533a570ce7158eecb4637c13f06"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201316 lines \u00D7 2): compiler/rustc_borrowck/src/region_infer/opaque_types/region_ctxt.rs:79-86 | compiler/rustc_borrowck/src/region_infer/region_context.rs:140-155 \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 \u0060compiler/rustc_borrowck/src/region_infer/opaque_types/region_ctxt.rs:79\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":"compiler/rustc_borrowck/src/region_infer/opaque_types/region_ctxt.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"925d67ee65e1d38661cf957bbb16ebc88f93f83736862d7f7c436ef1502dc755"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs:1030-1045 | compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs:1118-1133 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs:1030\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":"compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs"},"region":{"startLine":1030}}}],"partialFingerprints":{"codehealthFindingId/v1":"b23f041a3dafe53f1f089b3bcf735c1b15c73005571b8221dcacf58a208437e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): compiler/rustc_codegen_gcc/src/intrinsic/simd.rs:1606-1621 | compiler/rustc_codegen_gcc/src/intrinsic/simd.rs:1688-1702 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_codegen_gcc/src/intrinsic/simd.rs:1606\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":"compiler/rustc_codegen_gcc/src/intrinsic/simd.rs"},"region":{"startLine":1606}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b5ea6ae310d7b0e0ffd32493d4ed1a2be8a3b014c4aa9eca3ea262ed3f4c0a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): compiler/rustc_codegen_llvm/src/debuginfo/mod.rs:498-513 | compiler/rustc_codegen_llvm/src/debuginfo/mod.rs:546-561 \u2014 both copies are in the same file, so extract the block 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, \u0060compiler/rustc_codegen_llvm/src/debuginfo/mod.rs:544\u0060 calls \u0060push\u0060 and \u0060compiler/rustc_codegen_llvm/src/debuginfo/mod.rs:496\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":"compiler/rustc_codegen_llvm/src/debuginfo/mod.rs"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcb83357dfd9bec392d5bf8991211225dfb5f58f4356f6267884035ca1258c21"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): compiler/rustc_errors/src/annotate_snippet_emitter_writer.rs:225-241 | compiler/rustc_errors/src/annotate_snippet_emitter_writer.rs:293-309 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_errors/src/annotate_snippet_emitter_writer.rs:225\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":"compiler/rustc_errors/src/annotate_snippet_emitter_writer.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"77ee97f759f7823962d1a9ffd031bd8ed655d6734e111774f435b84353472c9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): compiler/rustc_infer/src/infer/canonical/canonicalizer.rs:537-552 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/canonical/canonicalizer.rs:526-541 \u2014 before extracting anything, compare \u0060compiler/rustc_infer/src/infer/canonical/canonicalizer.rs\u0060 and \u0060src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/canonical/canonicalizer.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 74 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 \u0060compiler/rustc_infer/src/infer/canonical/canonicalizer.rs:537\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":"compiler/rustc_infer/src/infer/canonical/canonicalizer.rs"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7a8b46def082067f0c1465c8acf166dd061c9d252916a9b6387664228c792ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): compiler/rustc_macros/src/extension.rs:84-99 | src/tools/rust-analyzer/crates/macros/src/extension.rs:87-102 \u2014 before extracting anything, compare \u0060compiler/rustc_macros/src/extension.rs\u0060 and \u0060src/tools/rust-analyzer/crates/macros/src/extension.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 77 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 \u0060compiler/rustc_macros/src/extension.rs:84\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":"compiler/rustc_macros/src/extension.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"81da583b2156a131222509e58bdad4384beabea9d30f32021b860f0ff51c4ddd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201316 lines \u00D7 2): compiler/rustc_metadata/src/rmeta/encoder.rs:2648-2660 | compiler/rustc_metadata/src/rmeta/encoder.rs:2702-2717 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_metadata/src/rmeta/encoder.rs:2702\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":"compiler/rustc_metadata/src/rmeta/encoder.rs"},"region":{"startLine":2648}}}],"partialFingerprints":{"codehealthFindingId/v1":"d03d28ab3c332a10eec93fba4eeaca41de4d9f472f2294e41999a6784b4cbaa9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): compiler/rustc_middle/src/mir/pretty.rs:1264-1279 | compiler/rustc_middle/src/mir/pretty.rs:1283-1298 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_middle/src/mir/pretty.rs:1264\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":"compiler/rustc_middle/src/mir/pretty.rs"},"region":{"startLine":1264}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9c1d349c9e4467b95f09220a32fd535aadba3d459a168604713911dfbfb2719"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): compiler/rustc_mir_build/src/builder/scope.rs:566-581 | compiler/rustc_mir_build/src/builder/scope.rs:619-634 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_mir_build/src/builder/scope.rs:566\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":"compiler/rustc_mir_build/src/builder/scope.rs"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"40ef86b9971a8a125668080ff47f033a43db36a764812b4b98402a6978565a63"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): compiler/rustc_mir_dataflow/src/framework/fmt.rs:85-100 | compiler/rustc_mir_dataflow/src/framework/fmt.rs:112-127 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"compiler/rustc_mir_dataflow/src/framework/fmt.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"880480130ec32249ba9b78275e00d7fa3f52a0fbdb4ad8269df53b8c01ea8c83"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): compiler/rustc_mir_transform/src/validate.rs:296-311 | compiler/rustc_mir_transform/src/validate.rs:1509-1524 \u2014 both copies are in the same file, so extract the block 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, \u0060compiler/rustc_mir_transform/src/validate.rs:294\u0060 calls \u0060visit_statement\u0060 and \u0060compiler/rustc_mir_transform/src/validate.rs:1508\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":"compiler/rustc_mir_transform/src/validate.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"39009dd2bd9180bc04444b557a5ebd30a879017f7f9b34b249c23c037295d551"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): compiler/rustc_trait_selection/src/solve/fulfill/derive_errors.rs:478-493 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/errors.rs:587-602 \u2014 before extracting anything, compare \u0060compiler/rustc_trait_selection/src/solve/fulfill/derive_errors.rs\u0060 and \u0060src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/errors.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 99 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 \u0060compiler/rustc_trait_selection/src/solve/fulfill/derive_errors.rs:478\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":"compiler/rustc_trait_selection/src/solve/fulfill/derive_errors.rs"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"d409656a347bdee17f321b32c5b8a11e340bd5a5bddc850790a4ae253fd5ae78"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): compiler/rustc_trait_selection/src/traits/auto_trait.rs:623-639 | src/librustdoc/clean/auto_trait.rs:327-342 \u2014 before extracting anything, compare \u0060compiler/rustc_trait_selection/src/traits/auto_trait.rs\u0060 and \u0060src/librustdoc/clean/auto_trait.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 64 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 \u0060compiler/rustc_trait_selection/src/traits/auto_trait.rs:623\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":"compiler/rustc_trait_selection/src/traits/auto_trait.rs"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"3baef3a10111c19469b94d09834164fa5d1d4b6043a40ac4d2c8d403b2a4d1e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): compiler/rustc_trait_selection/src/traits/specialize/mod.rs:189-204 | compiler/rustc_trait_selection/src/traits/specialize/mod.rs:317-332 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_trait_selection/src/traits/specialize/mod.rs:189\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/traits/specialize/mod.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbf03e20fdcc80fb2e60e22969727716c7a5b76adcc26cb75855dd165bcc1a6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): compiler/rustc_ty_utils/src/assoc.rs:249-264 | compiler/rustc_ty_utils/src/assoc.rs:315-330 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ty_utils/src/assoc.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"e747ec200aa0f98bdf00427dd8dbadc103d3256e2be6b70714544f7f77dff11d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): library/compiler-builtins/libm/src/math/erf.rs:283-306 | library/compiler-builtins/libm/src/math/erff.rs:195-218 \u2014 before extracting anything, compare \u0060library/compiler-builtins/libm/src/math/erf.rs\u0060 and \u0060library/compiler-builtins/libm/src/math/erff.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 54 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060x\u0060 to \u0060f64\u0060 in one and \u0060f32\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":"library/compiler-builtins/libm/src/math/erf.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e2adaf4a3637386b4e59c42730835797651ea0af8cf6d522476edce46122f2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): library/compiler-builtins/libm/src/math/j0f.rs:115-130 | library/compiler-builtins/libm/src/math/j1f.rs:115-130 \u2014 before extracting anything, compare \u0060library/compiler-builtins/libm/src/math/j0f.rs\u0060 and \u0060library/compiler-builtins/libm/src/math/j1f.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 100 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 \u0060library/compiler-builtins/libm/src/math/j0f.rs:115\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":"library/compiler-builtins/libm/src/math/j0f.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe59d5f3f404ebf30da49b77e09a84099f0fc499c2c2d9d6ee56577aff7c15ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): library/compiler-builtins/libm/src/math/j1.rs:180-195 | library/compiler-builtins/libm/src/math/j1f.rs:125-139 \u2014 before extracting anything, compare \u0060library/compiler-builtins/libm/src/math/j1.rs\u0060 and \u0060library/compiler-builtins/libm/src/math/j1f.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 55 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 \u0060library/compiler-builtins/libm/src/math/j1.rs:180\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060x\u0060 to \u0060f64\u0060 in one and \u0060f32\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":"library/compiler-builtins/libm/src/math/j1.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"f68a9685057472381c3d99a00d63618f8d6960d078bb45899b92f884c749baf2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): library/compiler-builtins/libm/src/math/jn.rs:185-200 | library/compiler-builtins/libm/src/math/jnf.rs:128-143 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/compiler-builtins/libm/src/math/jn.rs:185\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":"library/compiler-builtins/libm/src/math/jn.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a49abddd57dd56c7350b5292b3785a35e2b2e9eeb3e9c46279f458ceb705600"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): library/core/src/slice/sort/shared/smallsort.rs:424-439 | library/core/src/slice/sort/shared/smallsort.rs:473-488 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/core/src/slice/sort/shared/smallsort.rs:424\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":"library/core/src/slice/sort/shared/smallsort.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"49e13bf59fb578b3435c3361bed68d55f8e61b3e8723d56c489e62712729cf26"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): library/std/src/sys/fs/windows.rs:458-472 | library/std/src/sys/fs/windows.rs:479-494 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/std/src/sys/fs/windows.rs:458\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":"library/std/src/sys/fs/windows.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab17e7b7fac840339dc955c64574613efe7df16ab70704f33a9f27761082ea42"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 2): library/stdarch/crates/core_arch/src/x86/avx512dq.rs:1824-1839 | library/stdarch/crates/core_arch/src/x86/avx512dq.rs:2041-2054 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060library/stdarch/crates/core_arch/src/x86/avx512dq.rs:2056\u0060 calls \u0060transmute\u0060 and \u0060library/stdarch/crates/core_arch/src/x86/avx512dq.rs:1840\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":"library/stdarch/crates/core_arch/src/x86/avx512dq.rs"},"region":{"startLine":1824}}}],"partialFingerprints":{"codehealthFindingId/v1":"78d7ff9ddbe1a910d7670ec3918eee4ef11de4c34dd7178f73c2ece8922fcbb9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): library/stdarch/crates/stdarch-gen-arm/src/assert_instr.rs:136-151 | library/stdarch/crates/stdarch-gen-arm/src/assert_instr.rs:270-285 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/stdarch/crates/stdarch-gen-arm/src/assert_instr.rs:136\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/stdarch-gen-arm/src/assert_instr.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"108c2d5d3f812935d4ec139aee8d760f77bae4431f959b3d19071adbaa4e130d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): library/stdarch/crates/stdarch-gen-loongarch/src/main.rs:1462-1477 | library/stdarch/crates/stdarch-gen-loongarch/src/main.rs:1484-1499 \u2014 both copies are in the same file, so extract the block 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":"library/stdarch/crates/stdarch-gen-loongarch/src/main.rs"},"region":{"startLine":1462}}}],"partialFingerprints":{"codehealthFindingId/v1":"86e11650fdba17750f14edd000c2d598f43f83d44e501c4d79b5a39b4cf9ad7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/librustdoc/externalfiles.rs:39-54 | src/librustdoc/externalfiles.rs:55-70 \u2014 both copies are in the same file, so extract the block 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/librustdoc/externalfiles.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ffe9588aa851b37feaaedd54f17f2986da9bc285c366347213b4d357c4ad372"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/librustdoc/html/render/search_index.rs:487-502 | src/librustdoc/html/render/search_index.rs:655-670 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/librustdoc/html/render/search_index.rs:487\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/librustdoc/html/render/search_index.rs"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce63fd5e508dea734f258be7e7ea583a7fbef41bcc38aac67c718135fbf2ad25"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): src/librustdoc/passes/lint/redundant_explicit_links.rs:237-251 | src/librustdoc/passes/lint/redundant_explicit_links.rs:354-369 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/librustdoc/passes/lint/redundant_explicit_links.rs:237\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/librustdoc/passes/lint/redundant_explicit_links.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"e68b16a61c7e4a5b9f627e2edebff7a9901696ef0fb24784429b88cac481bca3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/tools/miri/src/shims/math.rs:231-246 | src/tools/miri/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/tools/miri/src/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/tools/miri/src/shims/math.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c2f2b58f9f0dbbe62e2ad877b69df768ec137bcecae1b9ab8fb46c1f75b6836"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-ty/src/infer/callee.rs:137-152 | src/tools/rust-analyzer/crates/hir-ty/src/infer/callee.rs:190-205 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/hir-ty/src/infer/callee.rs:137\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/infer/callee.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"37b17d1e05d9f0d807d2aca951aaf06fde57b29a17ad5dcffb56048277879058"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-ty/src/infer/pat.rs:1380-1395 | src/tools/rust-analyzer/crates/hir-ty/src/infer/pat.rs:1416-1435 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/hir-ty/src/infer/pat.rs:1416\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/infer/pat.rs"},"region":{"startLine":1380}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dd9fd84a04858078e89da5038b5d0b2ad3f4c3c3b7dd60b5ea39ff3e291c941"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): src/tools/rust-analyzer/crates/hir/src/source_analyzer.rs:1633-1648 | src/tools/rust-analyzer/crates/hir/src/source_analyzer.rs:1674-1688 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/hir/src/source_analyzer.rs:1633\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir/src/source_analyzer.rs"},"region":{"startLine":1633}}}],"partialFingerprints":{"codehealthFindingId/v1":"656551d39f5da01628153266dcfc283dddd1c833d94406104dbd7e6f3c164588"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): src/tools/rust-analyzer/crates/hir/src/source_analyzer.rs:1929-1953 | src/tools/rust-analyzer/crates/hir/src/source_analyzer.rs:2130-2154 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/hir/src/source_analyzer.rs:1929\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/tools/rust-analyzer/crates/hir/src/source_analyzer.rs"},"region":{"startLine":1929}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d9378bd8d627b40a23c8eecafa3dcec5a28d4b34c729ed857350038fe7d2b2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_deref.rs:70-85 | src/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_deref.rs:113-128 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_deref.rs:70\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/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_deref.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6c424cf254fb167e1963e351e0a24ecd0d6707b99d44c7889b0c354bc13edab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/tools/rust-analyzer/crates/ide-db/src/imports/import_assets.rs:891-907 | src/tools/rust-analyzer/crates/ide-db/src/imports/import_assets.rs:916-932 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/ide-db/src/imports/import_assets.rs:891\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/tools/rust-analyzer/crates/ide-db/src/imports/import_assets.rs:915\u0060 calls \u0060as_assoc_item\u0060 and \u0060src/tools/rust-analyzer/crates/ide-db/src/imports/import_assets.rs:890\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/tools/rust-analyzer/crates/ide-db/src/imports/import_assets.rs"},"region":{"startLine":891}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e9d5990deb99801fdec7e6e2ec8a8710e122b29e23d5157875b378d5bbf28af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/tools/rust-analyzer/crates/ide/src/runnables.rs:364-379 | src/tools/rust-analyzer/crates/ide/src/runnables.rs:456-471 \u2014 both copies are in the same file, so extract the block 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/tools/rust-analyzer/crates/ide/src/runnables.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e8b7006d68b9705bb02b2caed0c087e6c157a3f9f8a45c56ac19c57d57e90e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/tools/rust-analyzer/crates/rust-analyzer/src/handlers/request.rs:2001-2017 | src/tools/rust-analyzer/crates/rust-analyzer/src/handlers/request.rs:2031-2047 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060params\u0060 to \u0060SemanticTokensParams\u0060 in one and \u0060SemanticTokensDeltaParams\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/tools/rust-analyzer/crates/rust-analyzer/src/handlers/request.rs"},"region":{"startLine":2001}}}],"partialFingerprints":{"codehealthFindingId/v1":"d21ff094d1219e487a648532120b9803ac9a7112b3cd3a953c7849f06e32e10a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/tools/rustfmt/src/modules.rs:153-168 | src/tools/rustfmt/src/modules.rs:175-190 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rustfmt/src/modules.rs:153\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/tools/rustfmt/src/modules.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"a73417e2f39f7fe3c369db21d5be08d93c21f537f44028f8199c56dee0f28874"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 5): library/std/src/os/xous/ffi.rs:151-165 | library/std/src/os/xous/ffi.rs:423-437 | library/std/src/os/xous/ffi.rs:550-564 | library/std/src/os/xous/ffi.rs:590-604 | library/std/src/os/xous/ffi.rs:633-647 \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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/os/xous/ffi.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"23b2c9675d54154a653d0900b1b3d0c3e8ca3c0b686476c7208c9ad38a4c6c21"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): compiler/rustc_codegen_gcc/src/intrinsic/simd.rs:525-539 | compiler/rustc_codegen_gcc/src/intrinsic/simd.rs:582-596 | compiler/rustc_codegen_gcc/src/intrinsic/simd.rs:621-635 \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 \u0060compiler/rustc_codegen_gcc/src/intrinsic/simd.rs:525\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":"compiler/rustc_codegen_gcc/src/intrinsic/simd.rs"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"e055e55e12ab5a4280219c9a9d5f973ed2e92b03dfd44f6da1bcb559837be360"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): compiler/rustc_macros/src/type_foldable.rs:68-82 | compiler/rustc_type_ir_macros/src/lib.rs:77-91 | src/tools/rust-analyzer/crates/macros/src/lib.rs:160-174 \u2014 before extracting anything, compare \u0060compiler/rustc_macros/src/type_foldable.rs\u0060 and \u0060src/tools/rust-analyzer/crates/macros/src/lib.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 31 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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060attrs\u0060 to \u0060\u0026[syn::Attribute]\u0060 in one and \u0060\u0026[Attribute]\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":"compiler/rustc_macros/src/type_foldable.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"e865c4e909ac81b6f569f5c2e5d4c7fd444e28d5a36aa95ba862d35489823877"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): compiler/rustc_mir_transform/src/lower_intrinsics.rs:45-59 | compiler/rustc_mir_transform/src/lower_intrinsics.rs:75-89 | compiler/rustc_mir_transform/src/lower_intrinsics.rs:101-115 \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 \u0060compiler/rustc_mir_transform/src/lower_intrinsics.rs:45\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/lower_intrinsics.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fcdd72a33fed8c80e124da228133c2440eba877c4fa821667b32adbfbf513f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): library/compiler-builtins/libm/src/math/log.rs:88-102 | library/compiler-builtins/libm/src/math/log10.rs:62-76 | library/compiler-builtins/libm/src/math/log2.rs:59-73 \u2014 before extracting anything, compare \u0060library/compiler-builtins/libm/src/math/log10.rs\u0060 and \u0060library/compiler-builtins/libm/src/math/log2.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 98 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 \u0060library/compiler-builtins/libm/src/math/log.rs:88\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/compiler-builtins/libm/src/math/log.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"0049fdd876f9b842013ee00c18c4c8d6a6ee30a1a8986c6570b5c29b39ed112b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): library/stdarch/crates/stdarch-gen-loongarch/src/main.rs:1462-1476 | library/stdarch/crates/stdarch-gen-loongarch/src/main.rs:1484-1498 | library/stdarch/crates/stdarch-gen-loongarch/src/main.rs:1507-1521 \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":"library/stdarch/crates/stdarch-gen-loongarch/src/main.rs"},"region":{"startLine":1462}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c4a8256f5bb851cd706bc72a895210373bc09126173965a3f95a4ad000e5295"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): src/tools/rust-analyzer/crates/hir/src/source_analyzer.rs:136-150 | src/tools/rust-analyzer/crates/hir/src/source_analyzer.rs:189-203 | src/tools/rust-analyzer/crates/hir/src/source_analyzer.rs:234-248 \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/tools/rust-analyzer/crates/hir/src/source_analyzer.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"cacc4ad0cb33d84c0c7a2b64d9686ea3daf9db25f08b5907d33f744eee3fc3fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): src/tools/rust-analyzer/crates/span/src/ast_id.rs:883-897 | src/tools/rust-analyzer/crates/span/src/map.rs:166-180 | src/tools/rust-analyzer/crates/syntax/src/lib.rs:222-236 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tools/rust-analyzer/crates/span/src/ast_id.rs:883\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/tools/rust-analyzer/crates/span/src/ast_id.rs"},"region":{"startLine":883}}}],"partialFingerprints":{"codehealthFindingId/v1":"d10997ac7a60be87557909e29653bd9b0debf5c921b2d3e6fb8550f27ff24f70"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25\u201326 lines \u00D7 2): compiler/rustc_ast_lowering/src/format.rs:371-396 | src/tools/rust-analyzer/crates/hir-def/src/expr_store/lower/format_args.rs:225-249 \u2014 before extracting anything, compare \u0060compiler/rustc_ast_lowering/src/format.rs\u0060 and \u0060src/tools/rust-analyzer/crates/hir-def/src/expr_store/lower/format_args.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 96 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 \u0060compiler/rustc_ast_lowering/src/format.rs:371\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":"compiler/rustc_ast_lowering/src/format.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"2397e365f52d09cd4c9681657733b40fe97b7b730d02444e916b41e1c6b55e43"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): compiler/rustc_ast_pretty/src/pprust/state.rs:1235-1249 | compiler/rustc_hir_pretty/src/lib.rs:365-379 \u2014 before extracting anything, compare \u0060compiler/rustc_ast_pretty/src/pprust/state.rs\u0060 and \u0060compiler/rustc_hir_pretty/src/lib.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 54 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":"compiler/rustc_ast_pretty/src/pprust/state.rs"},"region":{"startLine":1235}}}],"partialFingerprints":{"codehealthFindingId/v1":"e291e488b5ee5de983a9f0eba8446477decbd3af3f960a1ac0769a6d272720bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): compiler/rustc_builtin_macros/src/deriving/clone.rs:116-132 | compiler/rustc_builtin_macros/src/deriving/eq.rs:56-70 \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 \u0060compiler/rustc_builtin_macros/src/deriving/clone.rs:116\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":"compiler/rustc_builtin_macros/src/deriving/clone.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc9f97a19eb2361e934dc6617bf9c55f2d15328c83987c37350259e12aaa2788"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201315 lines \u00D7 2): compiler/rustc_codegen_cranelift/src/unsize.rs:32-39 | compiler/rustc_codegen_ssa/src/base.rs:172-186 \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 \u0060compiler/rustc_codegen_cranelift/src/unsize.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":"compiler/rustc_codegen_cranelift/src/unsize.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7e7ebc077c4f1ef61423d50e46082df2ca4310ac508cb654e3e5a7e8a943b49"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): compiler/rustc_codegen_gcc/src/int.rs:197-211 | compiler/rustc_codegen_gcc/src/int.rs:281-295 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_codegen_gcc/src/int.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_gcc/src/int.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"92ecb90986a5169654069417f5c2bb5569d5ed691469cb086ea518c45afcda62"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): compiler/rustc_codegen_gcc/src/intrinsic/simd.rs:182-196 | compiler/rustc_codegen_llvm/src/intrinsic.rs:2170-2184 \u2014 before extracting anything, compare \u0060compiler/rustc_codegen_gcc/src/intrinsic/simd.rs\u0060 and \u0060compiler/rustc_codegen_llvm/src/intrinsic.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 192 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":"compiler/rustc_codegen_gcc/src/intrinsic/simd.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"f699751056843a5f6433a481e75119e11f608c623f22f3c3dc6352985d42d716"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): compiler/rustc_codegen_llvm/src/intrinsic.rs:1465-1479 | compiler/rustc_codegen_llvm/src/intrinsic.rs:1573-1586 \u2014 both copies are in the same file, so extract the block 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":"compiler/rustc_codegen_llvm/src/intrinsic.rs"},"region":{"startLine":1465}}}],"partialFingerprints":{"codehealthFindingId/v1":"f788b09a91ebbe56d3324e44f71c40626817f4ce31eb03d2f88e6ac5b04d23a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): compiler/rustc_codegen_llvm/src/intrinsic.rs:2297-2311 | compiler/rustc_codegen_llvm/src/intrinsic.rs:2321-2335 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_codegen_llvm/src/intrinsic.rs:2297\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":"compiler/rustc_codegen_llvm/src/intrinsic.rs"},"region":{"startLine":2297}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc6b44afcca73b37e63ecc2a5243896a1bcf527046c4153cb9ccb263851483ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201315 lines \u00D7 2): compiler/rustc_codegen_llvm/src/typetree.rs:117-131 | compiler/rustc_codegen_llvm/src/typetree.rs:134-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":"compiler/rustc_codegen_llvm/src/typetree.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef71cc5bd3ba9166af72e7329469b1b99aff1f14edb277edcd3c469e8c09181d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): compiler/rustc_codegen_ssa/src/back/link.rs:225-239 | compiler/rustc_codegen_ssa/src/back/link.rs:257-271 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_codegen_ssa/src/back/link.rs:225\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":"compiler/rustc_codegen_ssa/src/back/link.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"37050c8933a02a353381be421b531d04054c72e864221b04e7484b4e24ccebe5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): compiler/rustc_codegen_ssa/src/mir/intrinsic.rs:448-462 | compiler/rustc_codegen_ssa/src/mir/intrinsic.rs:472-486 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_codegen_ssa/src/mir/intrinsic.rs:448\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":"compiler/rustc_codegen_ssa/src/mir/intrinsic.rs"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f35f2fa66c8e9b5a723bd95117462030d2a1d2612d47bbc4e62ccedbce5cd3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): compiler/rustc_const_eval/src/const_eval/machine.rs:844-859 | compiler/rustc_const_eval/src/const_eval/machine.rs:885-900 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_const_eval/src/const_eval/machine.rs:844\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":"compiler/rustc_const_eval/src/const_eval/machine.rs"},"region":{"startLine":844}}}],"partialFingerprints":{"codehealthFindingId/v1":"1377d6475fef6ecfa6bd6a8ca4a2446988daf8808ab58648e9bf2774fc705d84"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): compiler/rustc_hir_analysis/src/check/check.rs:1125-1139 | compiler/rustc_hir_analysis/src/check/check.rs:1142-1156 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_hir_analysis/src/check/check.rs:1125\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 after the matched lines, \u0060compiler/rustc_hir_analysis/src/check/check.rs:1141\u0060 calls \u0060ensure_ok\u0060, \u0060type_of\u0060 and \u0060compiler/rustc_hir_analysis/src/check/check.rs:1158\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":"compiler/rustc_hir_analysis/src/check/check.rs"},"region":{"startLine":1125}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bd20546c366f82f532a9a47b421ad322cce8d9ba13f8de85c3af2c83d6f698d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 2): compiler/rustc_hir_typeck/src/method/suggest.rs:2324-2338 | compiler/rustc_hir_typeck/src/method/suggest.rs:2363-2375 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_hir_typeck/src/method/suggest.rs:2324\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":"compiler/rustc_hir_typeck/src/method/suggest.rs"},"region":{"startLine":2324}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fee35fa8fed5a482dce8d5b47e85ecfe786325c21076ad6dc741c20ef8bc3d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 2): compiler/rustc_lint/src/runtime_symbols.rs:144-158 | compiler/rustc_lint/src/runtime_symbols.rs:165-177 \u2014 both copies are in the same file, so extract the block 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":"compiler/rustc_lint/src/runtime_symbols.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"b838d3fddeadfcf6b1efde8ddef7c3d1456ed5734bfb85024812deb817723bff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): compiler/rustc_macros/src/extension.rs:142-156 | src/tools/rust-analyzer/crates/macros/src/extension.rs:143-157 \u2014 before extracting anything, compare \u0060compiler/rustc_macros/src/extension.rs\u0060 and \u0060src/tools/rust-analyzer/crates/macros/src/extension.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 77 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":"compiler/rustc_macros/src/extension.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"a34069b29ca685d7d1c1f8a2ce75d9fd079d4539e35d422ccbbb47d4e2e4da45"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): compiler/rustc_mir_transform/src/check_enums.rs:27-43 | compiler/rustc_mir_transform/src/check_pointers.rs:62-78 \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 \u0060compiler/rustc_mir_transform/src/check_enums.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":"compiler/rustc_mir_transform/src/check_enums.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"654920021878205bb0aebf3d19818bfc8221401617be5175bb62f1499bc371d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): compiler/rustc_next_trait_solver/src/solve/assembly/structural_traits.rs:678-692 | compiler/rustc_trait_selection/src/traits/project.rs:1937-1951 \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 \u0060compiler/rustc_next_trait_solver/src/solve/assembly/structural_traits.rs:678\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":"compiler/rustc_next_trait_solver/src/solve/assembly/structural_traits.rs"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fe2163307057c8680b78d1cc6308fc55c6d6ec9273757335dea06b8de5b7fdb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): compiler/rustc_resolve/src/ident.rs:1133-1147 | compiler/rustc_resolve/src/ident.rs:1175-1189 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_resolve/src/ident.rs:1133\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/ident.rs"},"region":{"startLine":1133}}}],"partialFingerprints":{"codehealthFindingId/v1":"e23db2f29ddb5ff139054604d33874c7d13db16f650ac5fbd01bebfa881939c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): compiler/rustc_trait_selection/src/solve/select.rs:46-60 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/select.rs:286-300 \u2014 before extracting anything, compare \u0060compiler/rustc_trait_selection/src/solve/select.rs\u0060 and \u0060src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/select.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 75 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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060goal\u0060 to \u0060\u0026inspect::InspectGoal\u003C\u0027_, \u0027tcx\u003E\u0060 in one and \u0060\u0026InspectGoal\u003C\u0027_, \u0027db\u003E\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":"compiler/rustc_trait_selection/src/solve/select.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c0882d5d62d7743b9c498e72ccfa033c2c78f3a8ebc05438b33b4377f7afd28"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): library/alloc/src/boxed/thin.rs:258-272 | library/alloc/src/boxed/thin.rs:302-316 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/alloc/src/boxed/thin.rs:258\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":"library/alloc/src/boxed/thin.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"0330574f13cd64eb596dd1fb400de7163eb8ea306a0b388edfaa40a07b8cdc80"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): library/compiler-builtins/libm-test/src/precision.rs:270-283 | library/compiler-builtins/libm-test/src/precision.rs:313-327 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/compiler-builtins/libm-test/src/precision.rs:270\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/compiler-builtins/libm-test/src/precision.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b6e8020785656f5e6e1b797c05a4bb2c414883d3c0ea6d228b93e6060953fce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): library/compiler-builtins/libm/src/math/exp2m1.rs:642-656 | library/compiler-builtins/libm/src/math/exp2m1.rs:678-692 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/compiler-builtins/libm/src/math/exp2m1.rs:642\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":"library/compiler-builtins/libm/src/math/exp2m1.rs"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"586db3f7229796a8f8b4cc763b66b36fa48f0ab54bc36fd72f11e0a31af1acb0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): library/compiler-builtins/libm/src/math/pow.rs:196-210 | library/compiler-builtins/libm/src/math/powf.rs:152-165 \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 \u0060library/compiler-builtins/libm/src/math/pow.rs:196\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 first that the copies are not typed on the same thing: the declarations holding them bind \u0060x\u0060 to \u0060f64\u0060 in one and \u0060f32\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":"library/compiler-builtins/libm/src/math/pow.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"242019de7951b57316688b3031277c17d9d3c936e99b958ad59d81ead92cdb7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): library/std/src/os/xous/ffi.rs:96-110 | library/std/src/os/xous/ffi.rs:381-395 \u2014 both copies are in the same file, so extract the block 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":"library/std/src/os/xous/ffi.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"005e4a0e284950275909b7ee95e02e5f3cc00bfde4e4e9dbcd389b42ffb2462a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): library/std/src/os/xous/ffi.rs:160-174 | library/std/src/os/xous/ffi.rs:479-493 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/std/src/os/xous/ffi.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":"library/std/src/os/xous/ffi.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"909d6cd01fb04cc6e547e69a6a5151f5103909c71c5074e23d0abf21d278eab7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): library/std/src/os/xous/ffi.rs:470-484 | library/std/src/os/xous/ffi.rs:514-528 \u2014 both copies are in the same file, so extract the block 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":"library/std/src/os/xous/ffi.rs"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6adb086142283662b33e89494d8e124d17987424a1f89dea9dd36d3f7e9bd5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): library/std/src/sys/process/unix/fuchsia.rs:178-192 | library/std/src/sys/process/unix/fuchsia.rs:213-227 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/std/src/sys/process/unix/fuchsia.rs:178\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/process/unix/fuchsia.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"3145d2df1c23b08039a0b715128cdcfe5bdd1f77feab94ae86e6182124350168"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): library/stdarch/crates/stdarch-gen-loongarch/src/main.rs:361-375 | library/stdarch/crates/stdarch-gen-loongarch/src/main.rs:1263-1277 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/stdarch/crates/stdarch-gen-loongarch/src/main.rs:361\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":"library/stdarch/crates/stdarch-gen-loongarch/src/main.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"482c673f704f5cd5130a715a20ea150e7b2e4050f453e822e985812254cab4a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/librustdoc/fold.rs:82-96 | src/librustdoc/visit.rs:35-49 \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/librustdoc/visit.rs:34\u0060 calls \u0060TypeAlias\u0060 and \u0060src/librustdoc/fold.rs:81\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/librustdoc/fold.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"425a8d245efdaf8290686b5fd7d8c2cfa4aedbbb7a855134d25e41f727e6a6de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/librustdoc/html/render/mod.rs:2051-2065 | src/librustdoc/html/render/mod.rs:2078-2092 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/librustdoc/html/render/mod.rs:2051\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/librustdoc/html/render/mod.rs"},"region":{"startLine":2051}}}],"partialFingerprints":{"codehealthFindingId/v1":"957f98e479c424a19e9196b364214c408cac23a4f6a7c043c76a481dbce3feb7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/librustdoc/html/render/print_item.rs:694-708 | src/librustdoc/html/render/print_item.rs:728-742 \u2014 both copies are in the same file, so extract the block 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/librustdoc/html/render/print_item.rs"},"region":{"startLine":694}}}],"partialFingerprints":{"codehealthFindingId/v1":"e36e7c9f1292aff0d6f5adb825187d6868d6fc60d3e38928dc2005ecb3eb28b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/librustdoc/html/render/search_index.rs:702-716 | src/librustdoc/html/render/search_index.rs:717-731 \u2014 both copies are in the same file, so extract the block 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/librustdoc/html/render/search_index.rs"},"region":{"startLine":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"75ae24971ccf49ad88f0a320154ed381c1884b113ea7fec6ca37a94acd5f0c9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/tools/clippy/clippy_lints/src/casts/ptr_as_ptr.rs:47-61 | src/tools/clippy/clippy_lints/src/casts/ref_as_ptr.rs:42-56 \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/tools/clippy/clippy_lints/src/casts/ptr_as_ptr.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"aed8ab935f9062693f592cae6178772001d7978682f2bb10ec20f6448edaf046"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/tools/clippy/clippy_lints_internal/src/repeated_is_diagnostic_item.rs:422-436 | src/tools/clippy/clippy_lints_internal/src/repeated_is_diagnostic_item.rs:475-489 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tools/clippy/clippy_lints_internal/src/repeated_is_diagnostic_item.rs:422\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/tools/clippy/clippy_lints_internal/src/repeated_is_diagnostic_item.rs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"79c204056cec4cc6b8bcb2f3340028a6348ec0589ece74049490df559d1912c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/tools/clippy/clippy_utils/src/ty/mod.rs:1234-1249 | src/tools/clippy/clippy_utils/src/ty/mod.rs:1397-1412 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/clippy/clippy_utils/src/ty/mod.rs:1234\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 \u0060ty\u0060 to \u0060Ty\u003C\u0027_\u003E\u0060 in one and \u0060Ty\u003C\u0027tcx\u003E\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/tools/clippy/clippy_utils/src/ty/mod.rs"},"region":{"startLine":1234}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f16807dafda4f13260b704a55d7a6a25c5e838a3c1ca7010dbefc2f6c955268"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/tools/compiletest/src/runtest/compute_diff.rs:57-71 | src/tools/rustfmt/src/rustfmt_diff.rs:222-236 \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/tools/compiletest/src/runtest/compute_diff.rs:57\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/compiletest/src/runtest/compute_diff.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb10e9e0efe1d5ddcb87ed5f67ce9c9bac7b50acbec6da352f0e8157297022f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/tools/miri/src/shims/math.rs:66-80 | src/tools/miri/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/tools/miri/src/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/tools/miri/src/shims/math.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba2c7630b193c849c58ce98f3fbfa0b1dd046b1e36776907590be348f2cf70ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/tools/miri/src/shims/unix/socket.rs:382-396 | src/tools/miri/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/tools/miri/src/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/tools/miri/src/shims/unix/socket.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"da29816207c5dbdba1e591de607cbde13a1e1a73a7e14cc10b5a6a06437ccf3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201315 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-def/src/nameres/collector.rs:2147-2161 | src/tools/rust-analyzer/crates/hir-def/src/nameres/collector.rs:2169-2178 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/hir-def/src/nameres/collector.rs:2147\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/tools/rust-analyzer/crates/hir-def/src/nameres/collector.rs"},"region":{"startLine":2147}}}],"partialFingerprints":{"codehealthFindingId/v1":"be69dd6b0aab85ae38210605dba11f9663f93868c0e3c68ce85cea8a285d8bd7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/tools/rust-analyzer/crates/ide-assists/src/utils/gen_trait_fn_body.rs:444-458 | src/tools/rust-analyzer/crates/ide-assists/src/utils/gen_trait_fn_body.rs:637-651 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/ide-assists/src/utils/gen_trait_fn_body.rs:444\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/utils/gen_trait_fn_body.rs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9b245b7442dbed0f11dc2d762621ca5874b616a2127f1ce0f6127efe73b7885"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/tools/rust-analyzer/crates/ide/src/doc_links.rs:601-615 | src/tools/rust-analyzer/crates/ide/src/doc_links.rs:617-631 \u2014 both copies are in the same file, so extract the block 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/tools/rust-analyzer/crates/ide/src/doc_links.rs"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"b57e9d17d82a7dc8cb1ef2a5dbe89ae3b9f7e42e6171ad02e1f9cf330ba22f66"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/tools/rust-analyzer/crates/ide/src/syntax_highlighting/escape.rs:47-61 | src/tools/rust-analyzer/crates/ide/src/syntax_highlighting/escape.rs:76-90 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/ide/src/syntax_highlighting/escape.rs:47\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/tools/rust-analyzer/crates/ide/src/syntax_highlighting/escape.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ff67a66d3a1597c19e8abb0197979ab4c30453f0ad6937aa23499ecf4e51af9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/tools/rust-analyzer/crates/rust-analyzer/src/cli/analysis_stats.rs:958-972 | src/tools/rust-analyzer/crates/rust-analyzer/src/cli/analysis_stats.rs:1063-1077 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/rust-analyzer/src/cli/analysis_stats.rs:958\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/tools/rust-analyzer/crates/rust-analyzer/src/cli/analysis_stats.rs"},"region":{"startLine":958}}}],"partialFingerprints":{"codehealthFindingId/v1":"907933f2df684f9e0aceeebd5989850e7e5d9bb351c4813742e802fbdd4a0d1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/tools/rust-analyzer/xtask/src/codegen/lints.rs:279-294 | src/tools/rust-analyzer/xtask/src/codegen/lints.rs:295-310 \u2014 both copies are in the same file, so extract the block 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/tools/rust-analyzer/xtask/src/codegen/lints.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"54c929a7230bf4f9840d1511654ca1dd42674439a449d58697a33db4484936b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/tools/rustfmt/src/parse/macros/cfg_if.rs:76-90 | src/tools/rustfmt/src/parse/macros/cfg_select.rs:86-100 \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/tools/rustfmt/src/parse/macros/cfg_if.rs:76\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/tools/rustfmt/src/parse/macros/cfg_if.rs:73\u0060 calls \u0060dcx\u0060, \u0060reset_err_count\u0060 and \u0060src/tools/rustfmt/src/parse/macros/cfg_select.rs:83\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/tools/rustfmt/src/parse/macros/cfg_if.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"c55573d0cee6c3d248f9fd8f787126e2af34770a77ea62e7b323a7207c34bf1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 5): compiler/rustc_codegen_gcc/src/intrinsic/simd.rs:179-192 | compiler/rustc_codegen_gcc/src/intrinsic/simd.rs:524-537 | compiler/rustc_codegen_gcc/src/intrinsic/simd.rs:581-594 | compiler/rustc_codegen_gcc/src/intrinsic/simd.rs:620-633 | compiler/rustc_codegen_gcc/src/intrinsic/simd.rs:692-704 \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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_gcc/src/intrinsic/simd.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"554ee130959658c5f644bc5dfe06b8c7160637d03ba768bd09c0d75e232114e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 5): src/tools/rust-analyzer/crates/hir-expand/src/fixup.rs:150-163 | src/tools/rust-analyzer/crates/hir-expand/src/fixup.rs:180-193 | src/tools/rust-analyzer/crates/hir-expand/src/fixup.rs:196-209 | src/tools/rust-analyzer/crates/hir-expand/src/fixup.rs:226-239 | src/tools/rust-analyzer/crates/hir-expand/src/fixup.rs:266-279 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tools/rust-analyzer/crates/hir-expand/src/fixup.rs:150\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/tools/rust-analyzer/crates/hir-expand/src/fixup.rs:194\u0060 calls \u0060LoopExpr\u0060 and \u0060src/tools/rust-analyzer/crates/hir-expand/src/fixup.rs:178\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/tools/rust-analyzer/crates/hir-expand/src/fixup.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"b960de71476d2521ac1cc3cc64054675d582dee6b69cbbb88146e7a8470469a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 4): library/core/src/num/imp/flt2dec/mod.rs:372-385 | library/core/src/num/imp/flt2dec/mod.rs:448-461 | library/core/src/num/imp/flt2dec/mod.rs:540-553 | library/core/src/num/imp/flt2dec/mod.rs:617-630 \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 \u0060library/core/src/num/imp/flt2dec/mod.rs:372\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":"library/core/src/num/imp/flt2dec/mod.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"36c82045604cda90a7cba31db7c3d378bfc866681050f9c8e3f70dad8a85005d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 4): src/tools/rust-analyzer/crates/hir-ide/src/diagnostics/expr.rs:634-647 | src/tools/rust-analyzer/crates/hir-ide/src/diagnostics/expr.rs:677-690 | src/tools/rust-analyzer/crates/hir/src/source_analyzer.rs:2188-2199 | src/tools/rust-analyzer/crates/hir/src/source_analyzer.rs:2220-2231 \u2014 there are 4 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tools/rust-analyzer/crates/hir-ide/src/diagnostics/expr.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. 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/tools/rust-analyzer/crates/hir-ide/src/diagnostics/expr.rs"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"91cc17bd6b30f33793a5961f5a87922069d3aebf9fead6eaf7231e15271b8a1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): src/tools/clippy/clippy_lints/src/functions/must_use.rs:36-49 | src/tools/clippy/clippy_lints/src/functions/must_use.rs:72-85 | src/tools/clippy/clippy_lints/src/functions/must_use.rs:109-122 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tools/clippy/clippy_lints/src/functions/must_use.rs:36\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 \u0060item\u0060 to \u0060\u0026\u0027tcx hir::Item\u003C\u0027_\u003E\u0060 in one and \u0060\u0026\u0027tcx hir::ImplItem\u003C\u0027_\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/tools/clippy/clippy_lints/src/functions/must_use.rs:70\u0060 calls \u0060hir_attrs\u0060, \u0060hir_id\u0060 and \u0060src/tools/clippy/clippy_lints/src/functions/must_use.rs:35\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/tools/clippy/clippy_lints/src/functions/must_use.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ea6451dc54a345434829b631773333de10cb5676ec75a66f2a70d190db22e4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): compiler/rustc_abi/src/lib.rs:549-561 | compiler/rustc_abi/src/lib.rs:592-605 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_abi/src/lib.rs:549\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":"compiler/rustc_abi/src/lib.rs"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"58f3ac1be0ac6c10b7489d5fce33f03723f22970510b8e360a3c16d5d2d26a57"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201314 lines \u00D7 2): compiler/rustc_arena/src/lib.rs:225-238 | compiler/rustc_arena/src/lib.rs:577-587 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_arena/src/lib.rs:225\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":"compiler/rustc_arena/src/lib.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f9465105779746a1d694c8384912b713fe22bf699d7ec373a71a230393f4585"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): compiler/rustc_ast/src/util/comments.rs:39-52 | src/tools/rust-analyzer/crates/hir-def/src/attrs/docs.rs:492-505 \u2014 before extracting anything, compare \u0060compiler/rustc_ast/src/util/comments.rs\u0060 and \u0060src/tools/rust-analyzer/crates/hir-def/src/attrs/docs.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 51 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":"compiler/rustc_ast/src/util/comments.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e0c13ff0f2fa2a4b125992611c985d57700687bf81c64304f9dc20c79aaa91d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): compiler/rustc_ast/src/util/comments.rs:64-77 | src/tools/rust-analyzer/crates/hir-def/src/attrs/docs.rs:521-534 \u2014 before extracting anything, compare \u0060compiler/rustc_ast/src/util/comments.rs\u0060 and \u0060src/tools/rust-analyzer/crates/hir-def/src/attrs/docs.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 51 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":"compiler/rustc_ast/src/util/comments.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac7518d8b9723b54de796a46ae1a93159643057a86abd1feffc886a5d69270c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): compiler/rustc_ast_lowering/src/expr.rs:1029-1042 | compiler/rustc_ast_lowering/src/expr.rs:1705-1718 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_ast_lowering/src/expr.rs:1029\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ast_lowering/src/expr.rs"},"region":{"startLine":1029}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3cbfa044302b532172b68f02571a5af517bbc048624d0628fa941d72b287e73"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): compiler/rustc_ast_pretty/src/pprust/state.rs:1932-1945 | compiler/rustc_hir_pretty/src/lib.rs:2040-2053 \u2014 before extracting anything, compare \u0060compiler/rustc_ast_pretty/src/pprust/state.rs\u0060 and \u0060compiler/rustc_hir_pretty/src/lib.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 54 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":"compiler/rustc_ast_pretty/src/pprust/state.rs"},"region":{"startLine":1932}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7504f90483f48009b19aa4ffdd9fc93dda58dc0414761745b04ab9b03c2a350"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): compiler/rustc_attr_parsing/src/attributes/crate_level.rs:304-316 | compiler/rustc_attr_parsing/src/attributes/crate_level.rs:344-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 \u0060compiler/rustc_attr_parsing/src/attributes/crate_level.rs:304\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":"compiler/rustc_attr_parsing/src/attributes/crate_level.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"79dd77d0667a29fcf03a752047a0c9a3ca9e2fac82f4d9c3b0b017eb93fd37fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): compiler/rustc_borrowck/src/diagnostics/explain_borrow.rs:116-128 | compiler/rustc_borrowck/src/diagnostics/explain_borrow.rs:290-303 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_borrowck/src/diagnostics/explain_borrow.rs:116\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":"compiler/rustc_borrowck/src/diagnostics/explain_borrow.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f6471cebb77bb3fcf59f25cbbef80ae1f678cb46d7c50a02b46f87cace87904"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): compiler/rustc_builtin_macros/src/asm.rs:588-601 | compiler/rustc_builtin_macros/src/asm.rs:612-625 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_builtin_macros/src/asm.rs:588\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":"compiler/rustc_builtin_macros/src/asm.rs"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f48412ba8f8cc98b046c16ad5c36b9fd4779a06fe36f9cbca431104b61e47cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201314 lines \u00D7 2): compiler/rustc_builtin_macros/src/format.rs:290-303 | src/tools/rust-analyzer/crates/hir-def/src/hir/format_args.rs:200-209 \u2014 before extracting anything, compare \u0060compiler/rustc_builtin_macros/src/format.rs\u0060 and \u0060src/tools/rust-analyzer/crates/hir-def/src/hir/format_args.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 113 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 \u0060compiler/rustc_builtin_macros/src/format.rs:290\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":"compiler/rustc_builtin_macros/src/format.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"7caad6bfc6bb4abb2ac07ab2646462a201824301aec1129d4ec19bc7a30d11a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): compiler/rustc_codegen_cranelift/src/inline_asm.rs:786-799 | compiler/rustc_codegen_cranelift/src/inline_asm.rs:836-849 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_codegen_cranelift/src/inline_asm.rs:786\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":"compiler/rustc_codegen_cranelift/src/inline_asm.rs"},"region":{"startLine":786}}}],"partialFingerprints":{"codehealthFindingId/v1":"886e181913bf589d4cfde200a55630ff5034347336855191b771c10ca939b0b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): compiler/rustc_codegen_cranelift/src/intrinsics/llvm.rs:77-90 | compiler/rustc_codegen_cranelift/src/intrinsics/llvm_x86.rs:1370-1383 \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 \u0060compiler/rustc_codegen_cranelift/src/intrinsics/llvm.rs:77\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/src/intrinsics/llvm.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ffc6d9103836a60f3157377d1e06d3c399413cabd5fe500adaf7bd78e0ff662"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs:1025-1038 | compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs:1069-1082 \u2014 both copies are in the same file, so extract the block 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":"compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs"},"region":{"startLine":1025}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a9ad70c7bcc12f4c96b7c8f9e8db6c4f44043dd25f224299830548dec480943"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs:151-164 | compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs:245-258 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs:151\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":"compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"56b8b7bb5e83b69c9c6cb3c76ed079090bcf019aabaf67c7663d106e2beb6ecd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): compiler/rustc_codegen_gcc/src/back/write.rs:175-188 | compiler/rustc_codegen_llvm/src/back/write.rs:1139-1152 \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 \u0060compiler/rustc_codegen_gcc/src/back/write.rs:175\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":"compiler/rustc_codegen_gcc/src/back/write.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"24d3813bd64e8d678b2bf06e2134222465aa802d1b0ba023e15e581b4effe978"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): compiler/rustc_codegen_gcc/src/int.rs:116-129 | compiler/rustc_codegen_gcc/src/int.rs:735-746 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_codegen_gcc/src/int.rs:116\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_gcc/src/int.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"0697a9156e33182b8e585a4d92a951c0cbbad2bdec01ab39402030d883392dfe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): compiler/rustc_codegen_gcc/src/intrinsic/llvm.rs:400-413 | compiler/rustc_codegen_gcc/src/intrinsic/llvm.rs:453-466 \u2014 both copies are in the same file, so extract the block 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060compiler/rustc_codegen_gcc/src/intrinsic/llvm.rs:468\u0060 calls \u0060into\u0060 and \u0060compiler/rustc_codegen_gcc/src/intrinsic/llvm.rs:415\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":"compiler/rustc_codegen_gcc/src/intrinsic/llvm.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8bb3bded29aab68292bc185e6392a960652f13f9597cff6d5d6b707c4edbcd4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): compiler/rustc_codegen_llvm/src/debuginfo/metadata.rs:1387-1400 | compiler/rustc_codegen_llvm/src/debuginfo/metadata/enums/native.rs:158-171 \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 \u0060compiler/rustc_codegen_llvm/src/debuginfo/metadata.rs:1387\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, \u0060compiler/rustc_codegen_llvm/src/debuginfo/metadata/enums/native.rs:152\u0060 calls \u0060layout_of\u0060, \u0060wants_c_like_enum_debuginfo\u0060 and \u0060compiler/rustc_codegen_llvm/src/debuginfo/metadata.rs:1384\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":"compiler/rustc_codegen_llvm/src/debuginfo/metadata.rs"},"region":{"startLine":1387}}}],"partialFingerprints":{"codehealthFindingId/v1":"12c451e158bb3ef258af2ad457f8eecf79cad80aecb60c6b2a7fa2f47d44411f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): compiler/rustc_codegen_llvm/src/intrinsic.rs:747-760 | compiler/rustc_codegen_llvm/src/intrinsic.rs:768-781 \u2014 both copies are in the same file, so extract the block 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":"compiler/rustc_codegen_llvm/src/intrinsic.rs"},"region":{"startLine":747}}}],"partialFingerprints":{"codehealthFindingId/v1":"389b4e68b052a5f042c7d872b2a93271872185d22d29a40c7ecbd22c38d24860"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): compiler/rustc_codegen_llvm/src/intrinsic.rs:3165-3178 | compiler/rustc_codegen_llvm/src/intrinsic.rs:3179-3190 \u2014 both copies are in the same file, so extract the block 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":"compiler/rustc_codegen_llvm/src/intrinsic.rs"},"region":{"startLine":3165}}}],"partialFingerprints":{"codehealthFindingId/v1":"b845ce388b325ac8c081855635aebfaa86e580407aca8150d1f5a0d613405005"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): compiler/rustc_hir_analysis/src/check/compare_impl_item.rs:1408-1421 | compiler/rustc_hir_analysis/src/check/compare_impl_item.rs:1446-1459 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_hir_analysis/src/check/compare_impl_item.rs:1408\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":"compiler/rustc_hir_analysis/src/check/compare_impl_item.rs"},"region":{"startLine":1408}}}],"partialFingerprints":{"codehealthFindingId/v1":"bee8b768bf48ac71fdc3063b29778efe40f8b57d01cfda456baab7d5469304f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): compiler/rustc_hir_typeck/src/upvar.rs:2099-2112 | src/tools/rust-analyzer/crates/hir-ty/src/infer/closure/analysis.rs:1101-1114 \u2014 before extracting anything, compare \u0060compiler/rustc_hir_typeck/src/upvar.rs\u0060 and \u0060src/tools/rust-analyzer/crates/hir-ty/src/infer/closure/analysis.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 74 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 \u0060compiler/rustc_hir_typeck/src/upvar.rs:2099\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":"compiler/rustc_hir_typeck/src/upvar.rs"},"region":{"startLine":2099}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4474f55eee4162710bd8ccf830253304b0ad526d99a4972887474f9c7a2a981"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): compiler/rustc_infer/src/infer/mod.rs:1716-1729 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/mod.rs:1179-1192 \u2014 before extracting anything, compare \u0060compiler/rustc_infer/src/infer/mod.rs\u0060 and \u0060src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/mod.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 44 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":"compiler/rustc_infer/src/infer/mod.rs"},"region":{"startLine":1716}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c2d648f6109f3fe5380c560c18f8ab3fc456731d94d65300f3a0d5c20787779"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): compiler/rustc_infer/src/infer/relate/generalize.rs:736-748 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/relate/generalize.rs:655-668 \u2014 before extracting anything, compare \u0060compiler/rustc_infer/src/infer/relate/generalize.rs\u0060 and \u0060src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/relate/generalize.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 73 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 \u0060compiler/rustc_infer/src/infer/relate/generalize.rs:736\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060c\u0060 to \u0060ty::Const\u003C\u0027tcx\u003E\u0060 in one and \u0060Const\u003C\u0027db\u003E\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":"compiler/rustc_infer/src/infer/relate/generalize.rs"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"2529f4310b46bc73e0ffa373be90d5d83d318c2e77dbc790283a1993301c8b19"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): compiler/rustc_metadata/src/rmeta/encoder.rs:1001-1014 | compiler/rustc_metadata/src/rmeta/encoder.rs:1081-1094 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_metadata/src/rmeta/encoder.rs:1001\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, \u0060compiler/rustc_metadata/src/rmeta/encoder.rs:1095\u0060 calls \u0060Ctor\u0060 and \u0060compiler/rustc_metadata/src/rmeta/encoder.rs:1015\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":"compiler/rustc_metadata/src/rmeta/encoder.rs"},"region":{"startLine":1001}}}],"partialFingerprints":{"codehealthFindingId/v1":"c49b0ae74ebae92ee236e1494b283bb38c21d01e1eddc4fb15c51d075d97fa45"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): compiler/rustc_mir_build/src/builder/scope.rs:439-452 | compiler/rustc_mir_build/src/builder/scope.rs:459-472 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_mir_build/src/builder/scope.rs:439\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":"compiler/rustc_mir_build/src/builder/scope.rs"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6a9099a553f184dab771537d265c556dd87019806d00ab04eaa4d2d9e188016"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): compiler/rustc_pattern_analysis/src/usefulness.rs:1623-1635 | compiler/rustc_pattern_analysis/src/usefulness.rs:1639-1652 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_pattern_analysis/src/usefulness.rs:1639\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_pattern_analysis/src/usefulness.rs"},"region":{"startLine":1623}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbe878e594a7651e5106b1a7473130d3af6ba336eba1c70a4e3b666ee67633ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): compiler/rustc_resolve/src/late/diagnostics.rs:4689-4702 | compiler/rustc_resolve/src/late/diagnostics.rs:4822-4835 \u2014 both copies are in the same file, so extract the block 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":"compiler/rustc_resolve/src/late/diagnostics.rs"},"region":{"startLine":4689}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1a6a431c5a2bd114d56c7be711e1439897b19a74ba2e4d44e502e399807eb70"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): compiler/rustc_session/src/options.rs:1546-1559 | compiler/rustc_session/src/options.rs:1598-1611 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_session/src/options.rs:1546\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":"compiler/rustc_session/src/options.rs"},"region":{"startLine":1546}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9acb132bd0cf8a2abea83145ab5e320f7bd0dce41a0b2580b497c5b26545fa9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): compiler/rustc_target/src/callconv/loongarch.rs:366-379 | compiler/rustc_target/src/callconv/riscv.rs:372-385 \u2014 before extracting anything, compare \u0060compiler/rustc_target/src/callconv/loongarch.rs\u0060 and \u0060compiler/rustc_target/src/callconv/riscv.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 328 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 \u0060compiler/rustc_target/src/callconv/loongarch.rs:366\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_target/src/callconv/loongarch.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"295fa0bd253b37c649e5721769a409058b2e21987565d09e7e0e3f69353e7fba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): compiler/rustc_trait_selection/src/solve/fulfill/derive_errors.rs:326-339 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/errors.rs:458-471 \u2014 before extracting anything, compare \u0060compiler/rustc_trait_selection/src/solve/fulfill/derive_errors.rs\u0060 and \u0060src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/errors.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 99 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 \u0060compiler/rustc_trait_selection/src/solve/fulfill/derive_errors.rs:326\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060goal\u0060 to \u0060\u0026inspect::InspectGoal\u003C\u0027_, \u0027tcx\u003E\u0060 in one and \u0060\u0026inspect::InspectGoal\u003C\u0027_, \u0027db\u003E\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":"compiler/rustc_trait_selection/src/solve/fulfill/derive_errors.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8aab46f407592691f008cf938372ccc971283ff4b562ec575e91b828b8863e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): compiler/rustc_trait_selection/src/traits/effects.rs:176-189 | compiler/rustc_trait_selection/src/traits/effects.rs:272-285 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_trait_selection/src/traits/effects.rs:176\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":"compiler/rustc_trait_selection/src/traits/effects.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"03d9ea5389e6430bb2dfa5b598c435c666d6d84168e868367ce56bbd3663771a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): compiler/rustc_trait_selection/src/traits/fulfill.rs:635-648 | compiler/rustc_trait_selection/src/traits/fulfill.rs:661-674 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_trait_selection/src/traits/fulfill.rs:635\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":"compiler/rustc_trait_selection/src/traits/fulfill.rs"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5dc1d9afb5c31d7d5abae0e57bfd0db920b8a76fed73359c877678c8ff2f2e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): compiler/rustc_trait_selection/src/traits/project.rs:1115-1128 | compiler/rustc_trait_selection/src/traits/project.rs:1173-1186 \u2014 both copies are in the same file, so extract the block 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, \u0060compiler/rustc_trait_selection/src/traits/project.rs:1113\u0060 calls \u0060Adt\u0060, \u0060Foreign\u0060 and \u0060compiler/rustc_trait_selection/src/traits/project.rs:1172\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":"compiler/rustc_trait_selection/src/traits/project.rs"},"region":{"startLine":1115}}}],"partialFingerprints":{"codehealthFindingId/v1":"a334a9621093a62fac9b24a530b55c154c86f37b3aafe987ac6c01e77c67e1bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): compiler/rustc_ty_utils/src/abi.rs:157-170 | compiler/rustc_ty_utils/src/abi.rs:193-206 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_ty_utils/src/abi.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":"compiler/rustc_ty_utils/src/abi.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a62b3262a643411e993ed8800182d9054044cc360d152172959531aad9d6198"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): library/alloc/src/boxed/thin.rs:240-253 | library/alloc/src/boxed/thin.rs:283-296 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/alloc/src/boxed/thin.rs:240\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":"library/alloc/src/boxed/thin.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e67a4eb64d92cbf76f4841d0ad350665c83ac027751ca2d6bd77aaf7c5fb174"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): library/alloc/src/collections/linked_list.rs:1512-1525 | library/alloc/src/collections/linked_list.rs:1648-1661 \u2014 both copies are in the same file, so extract the block 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":"library/alloc/src/collections/linked_list.rs"},"region":{"startLine":1512}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7e4ad4fce95ee9aa1b0dabfcf1e3ce306742af7c1ab56c7b1c09e2ccb08f47f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): library/alloc/src/vec/into_iter.rs:348-360 | library/alloc/src/vec/into_iter.rs:490-503 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/alloc/src/vec/into_iter.rs:348\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060self\u0060 to \u0060mut\u0060 in one and \u0060\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":"library/alloc/src/vec/into_iter.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"553d3a0fc3f5d079f49fd11aae506a2e7c6a471f5d1851f5aa070314f21b439a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): library/compiler-builtins/libm/src/math/jn.rs:49-62 | library/compiler-builtins/libm/src/math/jn.rs:260-273 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"library/compiler-builtins/libm/src/math/jn.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"04640204cc27a1e8d5f394548953e9a5735d7cba1a2b5a0188215741e8b3a6d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): library/compiler-builtins/libm/src/math/log1p.rs:85-98 | library/compiler-builtins/libm/src/math/log1pf.rs:40-53 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/compiler-builtins/libm/src/math/log1p.rs:85\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 \u0060x\u0060 to \u0060f64\u0060 in one and \u0060f32\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":"library/compiler-builtins/libm/src/math/log1p.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9cfb0f3bbd6cb5ab1736dad071d0fa816993df7aadeed304e68a02c707db00a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): library/std/src/sys/fd/unix.rs:314-327 | library/std/src/sys/fd/unix.rs:351-364 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/std/src/sys/fd/unix.rs:314\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":"library/std/src/sys/fd/unix.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0404778dc564d9212c9f6563f3b7efe8b9be3e1d090be1312649cb7ba331fab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): library/std/src/sys/fd/unix.rs:341-354 | library/std/src/sys/fd/unix.rs:537-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 \u0060library/std/src/sys/fd/unix.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":"library/std/src/sys/fd/unix.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed0e26f5e254a6547cac29a4bd053a9a6c3d24937855ddae3a836232ab76712f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): library/std/src/sys/fd/unix.rs:510-523 | library/std/src/sys/fd/unix.rs:547-560 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/std/src/sys/fd/unix.rs:510\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":"library/std/src/sys/fd/unix.rs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb7abf8d5987854dfb19b53e71fec3af518d31c6e57c8c92819abd27be4ec4a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): library/std/src/sys/net/connection/socket/solid.rs:130-143 | library/std/src/sys/net/connection/socket/solid.rs:273-285 \u2014 both copies are in the same file, so extract the block 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":"library/std/src/sys/net/connection/socket/solid.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"224ab755910e2cc78e98d1c991e1da32e08c26340d0644aa67ee3be1ba4cad9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): library/std/src/sys/net/connection/xous/tcplistener.rs:74-86 | library/std/src/sys/net/connection/xous/tcpstream.rs:95-108 \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 \u0060library/std/src/sys/net/connection/xous/tcplistener.rs:74\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":"library/std/src/sys/net/connection/xous/tcplistener.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"868bf95d1911651546f2139a8b1c688d8c5aa2e7ab7a8c856644fd99c3ae8a69"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): library/stdarch/crates/core_arch/src/powerpc/altivec.rs:2783-2796 | library/stdarch/crates/core_arch/src/powerpc/altivec.rs:2802-2815 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/stdarch/crates/core_arch/src/powerpc/altivec.rs:2783\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060a\u0060 to \u0060vector_signed_short\u0060 in one and \u0060vector_signed_int\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":"library/stdarch/crates/core_arch/src/powerpc/altivec.rs"},"region":{"startLine":2783}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eaf9193b9e1262a400130466d26c4bb8119b68a22522ba1f22875b390ca93ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): library/stdarch/crates/core_arch/src/wasm32/simd128.rs:2945-2958 | library/stdarch/crates/core_arch/src/wasm32/simd128.rs:2970-2983 \u2014 both copies are in the same file, so extract the block 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":"library/stdarch/crates/core_arch/src/wasm32/simd128.rs"},"region":{"startLine":2945}}}],"partialFingerprints":{"codehealthFindingId/v1":"66535d23d605ae894f00241366b42cc273e8204e2725f4be6e079ad4ba522e2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): library/stdarch/crates/core_arch/src/wasm32/simd128.rs:2995-3008 | library/stdarch/crates/core_arch/src/wasm32/simd128.rs:3023-3036 \u2014 both copies are in the same file, so extract the block 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":"library/stdarch/crates/core_arch/src/wasm32/simd128.rs"},"region":{"startLine":2995}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a070b48cb3b1be42ffd435ff3628dcdda95187f631b5c4e330267b2d49396c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): library/stdarch/crates/core_arch/src/wasm32/simd128.rs:3358-3371 | library/stdarch/crates/core_arch/src/wasm32/simd128.rs:3383-3396 \u2014 both copies are in the same file, so extract the block 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":"library/stdarch/crates/core_arch/src/wasm32/simd128.rs"},"region":{"startLine":3358}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c53c22b216d9a65915676afe987b20c67ec102a0c3dac9f239088ef72221a65"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): library/stdarch/crates/core_arch/src/wasm32/simd128.rs:3408-3421 | library/stdarch/crates/core_arch/src/wasm32/simd128.rs:3436-3449 \u2014 both copies are in the same file, so extract the block 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":"library/stdarch/crates/core_arch/src/wasm32/simd128.rs"},"region":{"startLine":3408}}}],"partialFingerprints":{"codehealthFindingId/v1":"da2d6466a35a26f2ebd06c2271a1cebed71b0af6d0a29b16ef7b31e4d361a3a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): library/stdarch/crates/core_arch/src/wasm32/simd128.rs:3666-3679 | library/stdarch/crates/core_arch/src/wasm32/simd128.rs:3691-3704 \u2014 both copies are in the same file, so extract the block 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":"library/stdarch/crates/core_arch/src/wasm32/simd128.rs"},"region":{"startLine":3666}}}],"partialFingerprints":{"codehealthFindingId/v1":"5818156004e6caac9899a94b9e7c7064c0690434416a3a3422a059ab378b1c5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): library/stdarch/crates/core_arch/src/wasm32/simd128.rs:3716-3729 | library/stdarch/crates/core_arch/src/wasm32/simd128.rs:3744-3757 \u2014 both copies are in the same file, so extract the block 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":"library/stdarch/crates/core_arch/src/wasm32/simd128.rs"},"region":{"startLine":3716}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7fc4b7545ca8e9aca260e4148a4da1de41deae21236898b3c518602cd1f5450"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): library/stdarch/crates/core_arch/src/x86/avx512f.rs:23175-23188 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:23303-23316 \u2014 both copies are in the same file, so extract the block 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":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":23175}}}],"partialFingerprints":{"codehealthFindingId/v1":"b78beaf39622c21f256e8403d6f1180bd2b82a8e1da567ebcebeae11d6b1cbd1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): library/stdarch/crates/core_arch/src/x86/avx512f.rs:26815-26828 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:27264-27277 \u2014 both copies are in the same file, so extract the block 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":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":26815}}}],"partialFingerprints":{"codehealthFindingId/v1":"433de9d671d73a293f5672711cef38f293b89d5a0d77788c1513452b65ddee10"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/librustdoc/json/conversions.rs:237-250 | src/librustdoc/json/conversions.rs:255-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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060stab\u0060 to \u0060\u0026rustc_attr_ir::Stability\u0060 in one and \u0060\u0026rustc_attr_ir::ConstStability\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/librustdoc/json/conversions.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c17e21b6b2b6b2535bc6323127543925011bd3175a7c4fcc9a693c86c3699cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u201314 lines \u00D7 2): src/tools/clippy/clippy_lints/src/assigning_clones.rs:225-238 | src/tools/clippy/clippy_lints/src/assigning_clones.rs:260-266 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/clippy/clippy_lints/src/assigning_clones.rs:225\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/tools/clippy/clippy_lints/src/assigning_clones.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9d9714ad47d170a4ddd6b0fdbb19098413deb63c074b7f307eee122f1ec19db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/tools/clippy/clippy_lints/src/doc/include_in_doc_without_cfg.rs:14-27 | src/tools/clippy/clippy_lints/src/large_include_file.rs:94-107 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/doc/include_in_doc_without_cfg.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"414f840ff4a670b2bd68c32c6213984c059212ada6ae93af85d7c76a5ca2ce91"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/tools/clippy/clippy_lints/src/methods/ptr_offset_by_literal.rs:20-33 | src/tools/clippy/clippy_lints/src/methods/ptr_offset_with_cast.rs:21-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tools/clippy/clippy_lints/src/methods/ptr_offset_by_literal.rs:20\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/tools/clippy/clippy_lints/src/methods/ptr_offset_by_literal.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"6766cdb200410d36ebcdee9c442a278a1aa936dbeea8f5f96b44a64a3e11806c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201314 lines \u00D7 2): src/tools/clippy/clippy_lints/src/operators/op_ref.rs:76-85 | src/tools/clippy/clippy_lints/src/operators/op_ref.rs:124-137 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/clippy/clippy_lints/src/operators/op_ref.rs:76\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/tools/clippy/clippy_lints/src/operators/op_ref.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"392b305f5c5e80a6adf0ce1e2c7847e9d94d5d56d38a9f87580f200e6b8d7948"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): src/tools/clippy/clippy_lints/src/undocumented_unsafe_blocks.rs:127-140 | src/tools/clippy/clippy_lints/src/undocumented_unsafe_blocks.rs:361-372 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/clippy/clippy_lints/src/undocumented_unsafe_blocks.rs:127\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060cx\u0060 to \u0060\u0026LateContext\u003C\u0027tcx\u003E\u0060 in one and \u0060\u0026LateContext\u003C\u0027_\u003E\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/tools/clippy/clippy_lints/src/undocumented_unsafe_blocks.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab2665b8791b87174b26d1ec3315f468e5b9915bd45a2c442372e55af70621e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): src/tools/miri/src/intrinsics/x86/avx.rs:135-147 | src/tools/miri/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/tools/miri/src/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/tools/miri/src/intrinsics/x86/avx.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"52a94c434e6db339e1728b1d08bc6068c151856a69414488e14d71528aecb7e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/tools/miri/src/shims/math.rs:103-116 | src/tools/miri/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/tools/miri/src/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/tools/miri/src/shims/math.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b8984dfdfb6de60abdda1bf90f18a108e48f8e2b52f24d96b51bd4a08b2679b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): src/tools/miri/src/shims/time.rs:335-348 | src/tools/miri/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/tools/miri/src/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/tools/miri/src/shims/time.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"94df554bd7450a7079d36bbe63d455f0fdaa98b5203ef994ca97056096a48c47"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/tools/miri/src/shims/unix/foreign_items.rs:898-911 | src/tools/miri/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/tools/miri/src/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/tools/miri/src/shims/unix/foreign_items.rs:897\u0060 calls \u0060deref_pointer\u0060, \u0060read_pointer\u0060 and \u0060src/tools/miri/src/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/tools/miri/src/shims/unix/foreign_items.rs"},"region":{"startLine":898}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ea844337fb535b5206f280b87f01adc4ff9e9510163ca1e5b58f53f939bd7c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-expand/src/lib.rs:1206-1219 | src/tools/rust-analyzer/crates/hir-expand/src/lib.rs:1247-1260 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/hir-expand/src/lib.rs:1206\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/tools/rust-analyzer/crates/hir-expand/src/lib.rs"},"region":{"startLine":1206}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9c7c29bb7f1f4915c61b6d17ac6889b0d546fe411c6df56625766f0ecb8d965"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-ide/src/display.rs:1535-1548 | src/tools/rust-analyzer/crates/hir-ide/src/display.rs:1594-1607 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/hir-ide/src/display.rs:1535\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/tools/rust-analyzer/crates/hir-ide/src/display.rs"},"region":{"startLine":1535}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b4cd370685dd770741709870ae80452da7ac1b7c3c3c01f510764ffb97f9932"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-ide/src/display.rs:1867-1880 | src/tools/rust-analyzer/crates/hir-ide/src/display.rs:1919-1932 \u2014 both copies are in the same file, so extract the block 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/tools/rust-analyzer/crates/hir-ide/src/display.rs"},"region":{"startLine":1867}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0cac63486701a1135c0394f94b31a704d8fdb5f1a481e5e0fd52cfe8713b6a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-ty/src/mir/lower.rs:1180-1193 | src/tools/rust-analyzer/crates/hir-ty/src/mir/lower.rs:1210-1223 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/hir-ty/src/mir/lower.rs:1180\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/mir/lower.rs"},"region":{"startLine":1180}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f2073b3194a20662c316db891ce78baa490b053838d4713b56494409a4c775c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-ty/src/mir/lower/pattern_matching.rs:223-234 | src/tools/rust-analyzer/crates/hir-ty/src/mir/lower/pattern_matching.rs:308-321 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/hir-ty/src/mir/lower/pattern_matching.rs:223\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/tools/rust-analyzer/crates/hir-ty/src/mir/lower/pattern_matching.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"4197e2eedad9b96a23325f76e932b3a89a83f7e612f8b4c9130c812f2678c674"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): src/tools/rust-analyzer/crates/hir/src/lib.rs:5441-5454 | src/tools/rust-analyzer/crates/hir/src/lib.rs:5550-5562 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/hir/src/lib.rs:5441\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/tools/rust-analyzer/crates/hir/src/lib.rs"},"region":{"startLine":5441}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f9b61d0e85c52d7e1bbea93ead04a744ca79597c67be0ffd82a8bbdc49b98a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/tools/rust-analyzer/crates/hir/src/term_search/tactics.rs:144-158 | src/tools/rust-analyzer/crates/hir/src/term_search/tactics.rs:193-206 \u2014 both copies are in the same file, so extract the block 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/tools/rust-analyzer/crates/hir/src/term_search/tactics.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"c45e10c4953b649c70e9d16e89e612d20a675e3b9cb7ca1c868341d1ced276b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/tools/rust-analyzer/crates/hir/src/term_search/tactics.rs:424-437 | src/tools/rust-analyzer/crates/hir/src/term_search/tactics.rs:619-632 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tools/rust-analyzer/crates/hir/src/term_search/tactics.rs:424\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/tools/rust-analyzer/crates/hir/src/term_search/tactics.rs:616\u0060 calls \u0060filter\u0060, \u0060is_unsafe\u0060 and \u0060src/tools/rust-analyzer/crates/hir/src/term_search/tactics.rs:421\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/tools/rust-analyzer/crates/hir/src/term_search/tactics.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d9d49fe1ea9dcef4543c1c96566c5fe5098bd1e4411274975da2fdb6f679bb9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_function.rs:590-603 | src/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_function.rs:649-662 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_function.rs:590\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/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_function.rs"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"07271901124cf7c0b2d09bcb65984dd5dd2eff44cfba57ce710607761cf7118f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): src/tools/rust-analyzer/crates/ide-completion/src/completions/flyimport.rs:263-276 | src/tools/rust-analyzer/crates/ide-completion/src/completions/flyimport.rs:316-328 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tools/rust-analyzer/crates/ide-completion/src/completions/flyimport.rs:263\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/tools/rust-analyzer/crates/ide-completion/src/completions/flyimport.rs:278\u0060 calls \u0060filter\u0060, \u0060filter_excluded_flyimport\u0060 and \u0060src/tools/rust-analyzer/crates/ide-completion/src/completions/flyimport.rs:330\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/tools/rust-analyzer/crates/ide-completion/src/completions/flyimport.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"bac18b99af7b78b5f9e07000be8b44d9332503dd540537aa3ac135eef11b04b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/tools/rust-analyzer/crates/ide-completion/src/completions/flyimport.rs:277-290 | src/tools/rust-analyzer/crates/ide-completion/src/completions/flyimport.rs:373-386 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/ide-completion/src/completions/flyimport.rs:277\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/tools/rust-analyzer/crates/ide-completion/src/completions/flyimport.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"51397d7487d5716162be70ab862e6e5e1200405d765d3eef5eb9d4799ad2f4fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/tools/rust-analyzer/crates/ide-completion/src/context/analysis.rs:2107-2120 | src/tools/rust-analyzer/crates/syntax/src/algo.rs:137-150 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. 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/tools/rust-analyzer/crates/ide-completion/src/context/analysis.rs"},"region":{"startLine":2107}}}],"partialFingerprints":{"codehealthFindingId/v1":"b79df2572962c697f02f9ea5ad188b2ff062bbc881f20adb375aa189c1e87f86"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/tools/rust-analyzer/crates/ide-completion/src/render/const_.rs:30-43 | src/tools/rust-analyzer/crates/ide-completion/src/render/type_alias.rs:52-65 \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/tools/rust-analyzer/crates/ide-completion/src/render/const_.rs:30\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/tools/rust-analyzer/crates/ide-completion/src/render/const_.rs:29\u0060 calls \u0060const_value\u0060, \u0060Some\u0060 and \u0060src/tools/rust-analyzer/crates/ide-completion/src/render/type_alias.rs:51\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/tools/rust-analyzer/crates/ide-completion/src/render/const_.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"73b8639bada1dc9deb728cfe686d8fcd51735ac140ff870b034e504aedf69aed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/tools/rust-analyzer/crates/ide-db/src/imports/merge_imports.rs:943-956 | src/tools/rustfmt/src/sort.rs:94-107 \u2014 before extracting anything, compare \u0060src/tools/rust-analyzer/crates/ide-db/src/imports/merge_imports.rs\u0060 and \u0060src/tools/rustfmt/src/sort.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 151 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/tools/rust-analyzer/crates/ide-db/src/imports/merge_imports.rs"},"region":{"startLine":943}}}],"partialFingerprints":{"codehealthFindingId/v1":"84cf8c07f5e49e94b517828639b0e8fd2178af3a02e562c50f9efb3f96336acb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): src/tools/rust-analyzer/crates/proc-macro-srv-cli/src/main_loop.rs:304-317 | src/tools/rust-analyzer/crates/proc-macro-srv-cli/src/main_loop.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/proc-macro-srv-cli/src/main_loop.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1291b50d5dd6357bdb4313b3fb0a6b830d93163791c65d716e09d6fc181dbf0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201314 lines \u00D7 2): src/tools/rust-analyzer/xtask/src/codegen/lints.rs:333-343 | src/tools/rust-analyzer/xtask/src/codegen/lints.rs:359-372 \u2014 both copies are in the same file, so extract the block 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/tools/rust-analyzer/xtask/src/codegen/lints.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"85efa32cba538236be6812a30c0954af6cc69547282af03b0255efb2e041d848"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/tools/rustfmt/check_diff/src/lib.rs:341-354 | src/tools/rustfmt/check_diff/src/lib.rs:384-397 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tools/rustfmt/check_diff/src/lib.rs:341\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/tools/rustfmt/check_diff/src/lib.rs:383\u0060 calls \u0060as_mut\u0060, \u0060unwrap\u0060, \u0060write_all\u0060 and \u0060src/tools/rustfmt/check_diff/src/lib.rs:339\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/tools/rustfmt/check_diff/src/lib.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cd03efdcbd28ed1b7c9eb8031ac363624033995633a93f6fc08068ddf44aa53"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 4): compiler/rustc_codegen_gcc/src/intrinsic/simd.rs:540-552 | compiler/rustc_codegen_gcc/src/intrinsic/simd.rs:554-566 | compiler/rustc_codegen_llvm/src/intrinsic.rs:3035-3047 | compiler/rustc_codegen_llvm/src/intrinsic.rs:3049-3061 \u2014 before extracting anything, compare \u0060compiler/rustc_codegen_gcc/src/intrinsic/simd.rs\u0060 and \u0060compiler/rustc_codegen_llvm/src/intrinsic.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 192 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 \u0060compiler/rustc_codegen_gcc/src/intrinsic/simd.rs:540\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":"compiler/rustc_codegen_gcc/src/intrinsic/simd.rs"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffd88f72d01fbc482736b065b4d8e7c1b8b5abdaa6904e8d30a48147c387ece7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 4): library/compiler-builtins/libm/src/math/log10.rs:56-67 | library/compiler-builtins/libm/src/math/log10f.rs:47-59 | library/compiler-builtins/libm/src/math/log2.rs:53-64 | library/compiler-builtins/libm/src/math/log2f.rs:44-56 \u2014 before extracting anything, compare \u0060library/compiler-builtins/libm/src/math/log10.rs\u0060 and \u0060library/compiler-builtins/libm/src/math/log2.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 98 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 \u0060library/compiler-builtins/libm/src/math/log10.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":"library/compiler-builtins/libm/src/math/log10.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"a776b91e926ad80647dac92443bd25e9165f19c8452998619323810c268e273a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 4): library/stdarch/crates/core_arch/src/x86/avx2.rs:938-950 | library/stdarch/crates/core_arch/src/x86/avx2.rs:982-994 | library/stdarch/crates/core_arch/src/x86/avx2.rs:1008-1020 | library/stdarch/crates/core_arch/src/x86/avx2.rs:1052-1064 \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 \u0060library/stdarch/crates/core_arch/src/x86/avx2.rs:938\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":"library/stdarch/crates/core_arch/src/x86/avx2.rs"},"region":{"startLine":938}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f301b479bfa65b29be5d05dafb2779da5cc088e2e7ad67bb1c61c1f02511921"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 4): src/tools/rust-analyzer/crates/hir-ide/src/diagnostics/decl_check.rs:363-375 | src/tools/rust-analyzer/crates/hir-ide/src/diagnostics/decl_check.rs:451-463 | src/tools/rust-analyzer/crates/hir-ide/src/diagnostics/decl_check.rs:541-553 | src/tools/rust-analyzer/crates/hir-ide/src/diagnostics/decl_check.rs:614-626 \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/tools/rust-analyzer/crates/hir-ide/src/diagnostics/decl_check.rs:363\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/tools/rust-analyzer/crates/hir-ide/src/diagnostics/decl_check.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"93588e79ffa9adedb775757ca33abd42c2c64308b3b0ef88cfb14cafabdb6b30"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): library/std/src/os/xous/ffi.rs:157-169 | library/std/src/os/xous/ffi.rs:429-441 | library/std/src/os/xous/ffi.rs:476-488 \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 \u0060library/std/src/os/xous/ffi.rs:157\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":"library/std/src/os/xous/ffi.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"697b10f769f0559fb41fb4dbb18946e79f49903cef006b143e1e31f82c11f8a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): src/tools/miri/src/shims/foreign_items.rs:765-777 | src/tools/miri/src/shims/foreign_items.rs:792-804 | src/tools/miri/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/tools/miri/src/shims/foreign_items.rs:790\u0060 calls \u0060check_target_os\u0060 and \u0060src/tools/miri/src/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/tools/miri/src/shims/foreign_items.rs"},"region":{"startLine":765}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a6e8d072006c98f11832215d95b50528aadec1235266b6e2d52e9dd5cded357"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): src/tools/rust-analyzer/crates/syntax/src/validation.rs:328-340 | src/tools/rust-analyzer/crates/syntax/src/validation.rs:344-356 | src/tools/rust-analyzer/crates/syntax/src/validation.rs:360-372 \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/tools/rust-analyzer/crates/syntax/src/validation.rs:328\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060ty\u0060 to \u0060ast::RefType\u0060 in one and \u0060ast::PtrType\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/tools/rust-analyzer/crates/syntax/src/validation.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"e57ead7bfae8f7417570c70025159b933c687bbbca5ccd77747360aeeedf8a73"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): compiler/rustc_borrowck/src/diagnostics/region_errors.rs:1064-1078 | compiler/rustc_borrowck/src/diagnostics/region_errors.rs:1083-1097 \u2014 both copies are in the same file, so extract the block 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":"compiler/rustc_borrowck/src/diagnostics/region_errors.rs"},"region":{"startLine":1064}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c2f9b55fd84ab82bcf18cb3015b66bfb1ae9e0ee03f13081ce392817bbc1764"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 2): compiler/rustc_builtin_macros/src/autodiff.rs:346-356 | compiler/rustc_builtin_macros/src/offload.rs:159-171 \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 \u0060compiler/rustc_builtin_macros/src/autodiff.rs:346\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":"compiler/rustc_builtin_macros/src/autodiff.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"01b0ad3a39e96ba4b04244017297d06b89aab5bbdb1bf6de9bf7c76d684aff8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): compiler/rustc_builtin_macros/src/format.rs:540-552 | compiler/rustc_builtin_macros/src/format.rs:564-576 \u2014 both copies are in the same file, so extract the block 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":"compiler/rustc_builtin_macros/src/format.rs"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fd5bf22034bd37dd6cb674ed6fce060954a2cfeb2f6ab445fa3ecf666310458"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201313 lines \u00D7 2): compiler/rustc_codegen_cranelift/src/global_asm.rs:107-116 | compiler/rustc_codegen_llvm/src/asm.rs:435-447 \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 \u0060compiler/rustc_codegen_cranelift/src/global_asm.rs:107\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":"compiler/rustc_codegen_cranelift/src/global_asm.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cec7e646103d505c7a0b28926fd604d1e77697f090fdaf0f955091235905197"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs:411-423 | compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs:430-442 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs:447\u0060 calls \u0060call_memcpy\u0060 and \u0060compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs:426\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":"compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"1311f985b5af2fb1a23b85e204c87a73735362b9b58f7ccd3fad8f884a7d485a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs:454-466 | compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs:468-480 \u2014 both copies are in the same file, so extract the block 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":"compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"f28ecc7e2f49dbd37c323be1433a769e5d7cf713660e44a994269db0c1406996"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs:1093-1105 | compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs:1135-1147 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs"},"region":{"startLine":1093}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d8e37442f7dba3ed195341cb289ef08953da38eda33dcb1febaf371028be734"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 2): compiler/rustc_codegen_cranelift/src/value_and_place.rs:716-726 | compiler/rustc_codegen_cranelift/src/value_and_place.rs:742-754 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_codegen_cranelift/src/value_and_place.rs:716\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":"compiler/rustc_codegen_cranelift/src/value_and_place.rs"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed41206707faa5e4b782990e59f521ca604d5e952d69d8e96b47439b0c43d425"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): compiler/rustc_codegen_gcc/src/asm.rs:506-518 | compiler/rustc_codegen_gcc/src/asm.rs:984-998 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_codegen_gcc/src/asm.rs:506\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":"compiler/rustc_codegen_gcc/src/asm.rs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"29aa83731b2a87dedf1d5b7ce2cb475724d5c94fc0b377e866f9c7b7e86ef8e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): compiler/rustc_codegen_gcc/src/int.rs:220-232 | compiler/rustc_codegen_gcc/src/int.rs:298-310 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_codegen_gcc/src/int.rs:220\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":"compiler/rustc_codegen_gcc/src/int.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9bb454b6362d4db67f3c16c7ff189b4c22e8234b3a034c0c41f8bbb9aef630c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): compiler/rustc_codegen_gcc/src/intrinsic/mod.rs:448-460 | compiler/rustc_codegen_llvm/src/intrinsic.rs:588-599 \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 \u0060compiler/rustc_codegen_gcc/src/intrinsic/mod.rs:448\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":"compiler/rustc_codegen_gcc/src/intrinsic/mod.rs"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"7089fcc56a7625b8d766108ba6fd4242d82ecaf8333ce7feaf643b43c966d7ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): compiler/rustc_codegen_gcc/src/intrinsic/simd.rs:1345-1357 | compiler/rustc_codegen_gcc/src/intrinsic/simd.rs:1379-1391 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_codegen_gcc/src/intrinsic/simd.rs:1345\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":"compiler/rustc_codegen_gcc/src/intrinsic/simd.rs"},"region":{"startLine":1345}}}],"partialFingerprints":{"codehealthFindingId/v1":"b443db2d1cd766976bd658cd0f95d701d605be6506807b3d0952667e2974d033"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): compiler/rustc_codegen_llvm/src/asm.rs:1267-1279 | compiler/rustc_codegen_llvm/src/asm.rs:1460-1472 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_codegen_llvm/src/asm.rs:1267\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":"compiler/rustc_codegen_llvm/src/asm.rs"},"region":{"startLine":1267}}}],"partialFingerprints":{"codehealthFindingId/v1":"53d81cb2c9397854fb8cf3f5399d579357ec1e720550bc265de73ba7173b3079"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): compiler/rustc_codegen_llvm/src/va_arg.rs:713-725 | compiler/rustc_codegen_llvm/src/va_arg.rs:735-747 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_codegen_llvm/src/va_arg.rs:713\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":"compiler/rustc_codegen_llvm/src/va_arg.rs"},"region":{"startLine":713}}}],"partialFingerprints":{"codehealthFindingId/v1":"56147f5cbf1015aabd88d9fee45aeeb815c525dfb01dc7e4facc1e89442988fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): compiler/rustc_hir_analysis/src/coherence/builtin.rs:350-362 | compiler/rustc_hir_analysis/src/coherence/builtin.rs:730-742 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_hir_analysis/src/coherence/builtin.rs:350\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":"compiler/rustc_hir_analysis/src/coherence/builtin.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"03c3de34c6f3f1b3af90226ee149c856662f0721a855aa97cd959a3e1597c609"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): compiler/rustc_hir_analysis/src/coherence/builtin/coerce_shared.rs:517-532 | compiler/rustc_hir_analysis/src/coherence/builtin/coerce_shared.rs:587-602 \u2014 both copies are in the same file, so extract the block 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":"compiler/rustc_hir_analysis/src/coherence/builtin/coerce_shared.rs"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0957e623cdbb5c7af23dd4163c60b03323b980faac6b575dfbe552554eeb64f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): compiler/rustc_hir_analysis/src/collect/type_of.rs:100-112 | compiler/rustc_hir_analysis/src/collect/type_of.rs:126-138 \u2014 both copies are in the same file, so extract the block 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":"compiler/rustc_hir_analysis/src/collect/type_of.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"24ddd0d269b8bb929c382a16be29e06267791aea92e3c2685891d1f5302fea6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): compiler/rustc_hir_pretty/src/lib.rs:2062-2074 | compiler/rustc_hir_pretty/src/lib.rs:2102-2114 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_hir_pretty/src/lib.rs:2062\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, \u0060compiler/rustc_hir_pretty/src/lib.rs:2116\u0060 calls \u0060word\u0060 and \u0060compiler/rustc_hir_pretty/src/lib.rs:2075\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":"compiler/rustc_hir_pretty/src/lib.rs"},"region":{"startLine":2062}}}],"partialFingerprints":{"codehealthFindingId/v1":"196c078789d27ec28554c9fe7c41c14f887353033ff5ec252878a0c1b9437d60"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): compiler/rustc_infer/src/infer/relate/type_relating.rs:125-137 | compiler/rustc_type_ir/src/relate/solver_relating.rs:148-160 \u2014 before extracting anything, compare \u0060compiler/rustc_infer/src/infer/relate/type_relating.rs\u0060 and \u0060compiler/rustc_type_ir/src/relate/solver_relating.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 33 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_infer/src/infer/relate/type_relating.rs:125\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 \u0060a\u0060 to \u0060Ty\u003C\u0027tcx\u003E\u0060 in one and \u0060I::Ty\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":"compiler/rustc_infer/src/infer/relate/type_relating.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c2d198904c67cbbac3aaad6011f6ae89988ccaf64840605325297c51d4cee0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): compiler/rustc_infer/src/infer/snapshot/mod.rs:85-97 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/snapshot/mod.rs:87-99 \u2014 before extracting anything, compare \u0060compiler/rustc_infer/src/infer/snapshot/mod.rs\u0060 and \u0060src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/snapshot/mod.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 48 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060snapshot\u0060 to \u0060CombinedSnapshot\u003C\u0027tcx\u003E\u0060 in one and \u0060CombinedSnapshot\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":"compiler/rustc_infer/src/infer/snapshot/mod.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a4f7d4a78b19542a13257b0fb1a306ef4402312c57df5cc341ea6c1ac12c8a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): compiler/rustc_middle/src/ty/layout.rs:32-44 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/util.rs:133-145 \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 \u0060compiler/rustc_middle/src/ty/layout.rs:32\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":"compiler/rustc_middle/src/ty/layout.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"890b20895f6b30b2bb312ee2fcfbeb56c03009b704d96c1c61e1f5370ffd769b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): compiler/rustc_middle/src/ty/util.rs:1192-1204 | compiler/rustc_middle/src/ty/util.rs:1245-1257 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_middle/src/ty/util.rs:1192\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":"compiler/rustc_middle/src/ty/util.rs"},"region":{"startLine":1192}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d7cef0bef4ccb586c5d1da1c13c09c101a7fb118fcdfc9dfca08a91aab87702"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): compiler/rustc_mir_dataflow/src/impls/storage_liveness.rs:283-295 | compiler/rustc_mir_dataflow/src/impls/storage_liveness.rs:322-333 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_mir_dataflow/src/impls/storage_liveness.rs:283\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":"compiler/rustc_mir_dataflow/src/impls/storage_liveness.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"a35119ef743a69caaaa00aa853ba02c25e5c1b715f328dfaf19ba4a1e243ea7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): compiler/rustc_next_trait_solver/src/solve/assembly/structural_traits.rs:397-409 | compiler/rustc_next_trait_solver/src/solve/assembly/structural_traits.rs:754-766 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060compiler/rustc_next_trait_solver/src/solve/assembly/structural_traits.rs:410\u0060 calls \u0060UnsafeBinder\u0060 and \u0060compiler/rustc_next_trait_solver/src/solve/assembly/structural_traits.rs:767\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":"compiler/rustc_next_trait_solver/src/solve/assembly/structural_traits.rs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1cc0cce43cfbcd8f7ac207faa1e1281496a5f9739cbb0a431b5d38f01af09b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): compiler/rustc_target/src/callconv/loongarch.rs:398-410 | compiler/rustc_target/src/callconv/riscv.rs:404-415 \u2014 before extracting anything, compare \u0060compiler/rustc_target/src/callconv/loongarch.rs\u0060 and \u0060compiler/rustc_target/src/callconv/riscv.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 328 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":"compiler/rustc_target/src/callconv/loongarch.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea7b582e79be4268bf2b816c2f1ce78cbe27e24b7fae4bf29370428f586eb045"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): compiler/rustc_trait_selection/src/solve/normalize.rs:288-300 | compiler/rustc_trait_selection/src/solve/normalize.rs:303-315 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"compiler/rustc_trait_selection/src/solve/normalize.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"549f954b17e99224499c09c334f0055ad52c1a27964eba917b12b3cf325f3c7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): compiler/rustc_trait_selection/src/traits/fulfill.rs:707-729 | compiler/rustc_trait_selection/src/traits/select/mod.rs:792-814 \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 \u0060compiler/rustc_trait_selection/src/traits/fulfill.rs:707\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":"compiler/rustc_trait_selection/src/traits/fulfill.rs"},"region":{"startLine":707}}}],"partialFingerprints":{"codehealthFindingId/v1":"6639fed0ac7ddacbdf675845c9df4d2b8ff2ea4f74f876d6567b99c80cc26700"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): compiler/rustc_trait_selection/src/traits/mod.rs:143-155 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/errors.rs:74-86 \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 \u0060compiler/rustc_trait_selection/src/traits/mod.rs:143\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060f\u0060 to \u0060\u0026mut std::fmt::Formatter\u003C\u0027_\u003E\u0060 in one and \u0060\u0026mut fmt::Formatter\u003C\u0027_\u003E\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":"compiler/rustc_trait_selection/src/traits/mod.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"3563f948365357cda360001764fcc4d82d4a8a6677c2163acbb275050240f2a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): compiler/rustc_trait_selection/src/traits/wf.rs:1147-1159 | compiler/rustc_trait_selection/src/traits/wf.rs:1205-1216 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_trait_selection/src/traits/wf.rs:1147\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":"compiler/rustc_trait_selection/src/traits/wf.rs"},"region":{"startLine":1147}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fc3f8b3698fd1f7a84e86d922a969005f33c6937032af2df3b3b2de13929a73"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): compiler/rustc_type_ir/src/infer_ctxt.rs:287-299 | compiler/rustc_type_ir/src/infer_ctxt.rs:353-365 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060compiler/rustc_type_ir/src/infer_ctxt.rs:300\u0060 calls \u0060ErasedNotCoherence\u0060 and \u0060compiler/rustc_type_ir/src/infer_ctxt.rs:366\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":"compiler/rustc_type_ir/src/infer_ctxt.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"129b9ba2e2aced6fc5cc75280c5b3251c10ab86be6e3232bf3055de0fcd505e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): compiler/rustc_type_ir_macros/src/lib.rs:106-118 | src/tools/rust-analyzer/crates/macros/src/lib.rs:64-76 \u2014 before extracting anything, compare \u0060compiler/rustc_type_ir_macros/src/lib.rs\u0060 and \u0060src/tools/rust-analyzer/crates/macros/src/lib.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 33 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_type_ir_macros/src/lib.rs:106\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, \u0060compiler/rustc_type_ir_macros/src/lib.rs:102\u0060 calls \u0060filter\u0060, \u0060has_ignore_attr\u0060, \u0060ast\u0060 and \u0060src/tools/rust-analyzer/crates/macros/src/lib.rs:61\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":"compiler/rustc_type_ir_macros/src/lib.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"da0e2402ad999878255d7e9036953f05d86cb8e401e4a5bcd3d8b5c835ccf14b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): library/alloc/src/collections/binary_heap/mod.rs:840-852 | library/alloc/src/collections/binary_heap/mod.rs:901-912 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/alloc/src/collections/binary_heap/mod.rs:840\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, \u0060library/alloc/src/collections/binary_heap/mod.rs:857\u0060 calls \u0060element\u0060, \u0060get\u0060, \u0060pos\u0060 and \u0060library/alloc/src/collections/binary_heap/mod.rs:915\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":"library/alloc/src/collections/binary_heap/mod.rs"},"region":{"startLine":840}}}],"partialFingerprints":{"codehealthFindingId/v1":"e03fcf3d00b71867249d3b711300bed110da48e8081674cbeb4aba0d0e0c3302"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 2): library/alloc/src/collections/vec_deque/into_iter.rs:94-106 | library/alloc/src/collections/vec_deque/into_iter.rs:216-226 \u2014 both copies are in the same file, so extract the block 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, \u0060library/alloc/src/collections/vec_deque/into_iter.rs:90\u0060 calls \u0060to_wrapped_index\u0060 and \u0060library/alloc/src/collections/vec_deque/into_iter.rs:212\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":"library/alloc/src/collections/vec_deque/into_iter.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c27bba47f8206c64ed5ae0a77aeb813057643c2cd5659a57062edb6ef7e9969"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): library/alloc/src/rcs/arc.rs:2441-2453 | library/alloc/src/rcs/rc.rs:2536-2548 \u2014 before extracting anything, compare \u0060library/alloc/src/rcs/arc.rs\u0060 and \u0060library/alloc/src/rcs/rc.rs\u0060 as WHOLE FILES: this scan already matched 28 separate duplicated blocks between them, totalling at least 329 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 \u0060library/alloc/src/rcs/arc.rs:2441\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":"library/alloc/src/rcs/arc.rs"},"region":{"startLine":2441}}}],"partialFingerprints":{"codehealthFindingId/v1":"772961329ebe940b4fd6766aa7d0b8c0a5376d5240d5654c71051680e2dd898e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): library/alloc/src/str.rs:1004-1016 | src/tools/rust-analyzer/lib/smol_str/src/lib.rs:898-911 \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 \u0060library/alloc/src/str.rs:1004\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":"library/alloc/src/str.rs"},"region":{"startLine":1004}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b9b4c49531bad18bfcf84d66e43ea4448b2486dbbf77dd8dcfa06ae05408bb4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): library/compiler-builtins/libm-test/src/generate/edge_cases.rs:82-94 | library/compiler-builtins/libm-test/src/generate/edge_cases.rs:190-202 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/compiler-builtins/libm-test/src/generate/edge_cases.rs:82\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":"library/compiler-builtins/libm-test/src/generate/edge_cases.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfb1ccd1e363ec353ed1929613233d4001d5847c2b43f230c83dd1ebe93de0b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): library/compiler-builtins/libm/src/math/jnf.rs:23-35 | library/compiler-builtins/libm/src/math/jnf.rs:200-212 \u2014 both copies are in the same file, so extract the block 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":"library/compiler-builtins/libm/src/math/jnf.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"43a147d4b0175b93e75f50061fb6a938c97f18d34e1bfb79102351b048b7488f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): library/stdarch/crates/core_arch/src/x86/avx2.rs:2797-2809 | library/stdarch/crates/core_arch/src/x86/avx2.rs:3004-3016 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/stdarch/crates/core_arch/src/x86/avx2.rs:2797\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":"library/stdarch/crates/core_arch/src/x86/avx2.rs"},"region":{"startLine":2797}}}],"partialFingerprints":{"codehealthFindingId/v1":"63270ce759f7ebad1f5a9f8d47a0264162b9f651639cae15cf7a937510bf26e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): library/stdarch/crates/core_arch/src/x86/avx512bw.rs:4401-4413 | library/stdarch/crates/core_arch/src/x86/avx512bw.rs:4767-4779 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/stdarch/crates/core_arch/src/x86/avx512bw.rs:4401\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":"library/stdarch/crates/core_arch/src/x86/avx512bw.rs"},"region":{"startLine":4401}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e1ff17dc67d276c342e6a6f24c143c16cca877c3f65ce5bfdc6fd9d09b9ddd5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): library/stdarch/crates/core_arch/src/x86/avx512bw.rs:4433-4446 | library/stdarch/crates/core_arch/src/x86/avx512bw.rs:4799-4812 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/stdarch/crates/core_arch/src/x86/avx512bw.rs:4433\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":"library/stdarch/crates/core_arch/src/x86/avx512bw.rs"},"region":{"startLine":4433}}}],"partialFingerprints":{"codehealthFindingId/v1":"36935999c977e06f3a24a0ff4b201f592f5315be4bb71128dad823405eaa037d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): library/stdarch/crates/core_arch/src/x86/avx512bw.rs:4462-4474 | library/stdarch/crates/core_arch/src/x86/avx512bw.rs:4828-4840 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/stdarch/crates/core_arch/src/x86/avx512bw.rs:4462\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":"library/stdarch/crates/core_arch/src/x86/avx512bw.rs"},"region":{"startLine":4462}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8b40f9c96b381f3db6b74dcf3f3d93eca9fd2ea2b274111cecea9c5c8b1959b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): library/stdarch/crates/core_arch/src/x86/avx512bw.rs:4494-4507 | library/stdarch/crates/core_arch/src/x86/avx512bw.rs:4860-4873 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/stdarch/crates/core_arch/src/x86/avx512bw.rs:4494\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":"library/stdarch/crates/core_arch/src/x86/avx512bw.rs"},"region":{"startLine":4494}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4c5fb2942be7bf69154eb87693fa4b48dded01155bd6302b32caf4686f57338"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): library/stdarch/crates/core_arch/src/x86/avx512bw.rs:4523-4535 | library/stdarch/crates/core_arch/src/x86/avx512bw.rs:4889-4901 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/stdarch/crates/core_arch/src/x86/avx512bw.rs:4523\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":"library/stdarch/crates/core_arch/src/x86/avx512bw.rs"},"region":{"startLine":4523}}}],"partialFingerprints":{"codehealthFindingId/v1":"198ecf80eac47d8714a694bc23a8feddc1257c9ca812fd09a71f75b9d32d3369"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): library/stdarch/crates/core_arch/src/x86/avx512bw.rs:4555-4568 | library/stdarch/crates/core_arch/src/x86/avx512bw.rs:4921-4934 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/stdarch/crates/core_arch/src/x86/avx512bw.rs:4555\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":"library/stdarch/crates/core_arch/src/x86/avx512bw.rs"},"region":{"startLine":4555}}}],"partialFingerprints":{"codehealthFindingId/v1":"42c28a67431cca8fe69f6938b770629f3fd4763dc135ef37063d855f75c33483"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): library/stdarch/crates/core_arch/src/x86/avx512bw.rs:4584-4596 | library/stdarch/crates/core_arch/src/x86/avx512bw.rs:4950-4962 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/stdarch/crates/core_arch/src/x86/avx512bw.rs:4584\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":"library/stdarch/crates/core_arch/src/x86/avx512bw.rs"},"region":{"startLine":4584}}}],"partialFingerprints":{"codehealthFindingId/v1":"410a515179213a6288120174cba26fdd61a92fcc4005ddd568f1a3989b32c7d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): library/stdarch/crates/core_arch/src/x86/avx512bw.rs:4616-4629 | library/stdarch/crates/core_arch/src/x86/avx512bw.rs:4982-4995 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/stdarch/crates/core_arch/src/x86/avx512bw.rs:4616\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":"library/stdarch/crates/core_arch/src/x86/avx512bw.rs"},"region":{"startLine":4616}}}],"partialFingerprints":{"codehealthFindingId/v1":"f81582e36220be8cbc81331144aa4222299aa9e84c21a49b7d21f6c0fbf14f48"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): library/stdarch/crates/core_arch/src/x86/avx512bw.rs:4645-4657 | library/stdarch/crates/core_arch/src/x86/avx512bw.rs:5011-5023 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/stdarch/crates/core_arch/src/x86/avx512bw.rs:4645\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":"library/stdarch/crates/core_arch/src/x86/avx512bw.rs"},"region":{"startLine":4645}}}],"partialFingerprints":{"codehealthFindingId/v1":"4780c40fccdfdad1182ff7dfa9811d1e781be1c5e7b685dc82b8add2a263aba4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): library/stdarch/crates/core_arch/src/x86/avx512bw.rs:4677-4690 | library/stdarch/crates/core_arch/src/x86/avx512bw.rs:5043-5056 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/stdarch/crates/core_arch/src/x86/avx512bw.rs:4677\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":"library/stdarch/crates/core_arch/src/x86/avx512bw.rs"},"region":{"startLine":4677}}}],"partialFingerprints":{"codehealthFindingId/v1":"ece60e048fb78ab3d30901230322b34b14eb47aca13c967fdee2aac971d5a93d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): library/stdarch/crates/core_arch/src/x86/avx512bw.rs:4706-4718 | library/stdarch/crates/core_arch/src/x86/avx512bw.rs:5072-5084 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/stdarch/crates/core_arch/src/x86/avx512bw.rs:4706\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":"library/stdarch/crates/core_arch/src/x86/avx512bw.rs"},"region":{"startLine":4706}}}],"partialFingerprints":{"codehealthFindingId/v1":"fce68529cf8e416ec737d5e618445030da1ae843e17bd4df1a283419cb429b92"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): library/stdarch/crates/core_arch/src/x86/avx512bw.rs:4738-4751 | library/stdarch/crates/core_arch/src/x86/avx512bw.rs:5104-5117 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/stdarch/crates/core_arch/src/x86/avx512bw.rs:4738\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":"library/stdarch/crates/core_arch/src/x86/avx512bw.rs"},"region":{"startLine":4738}}}],"partialFingerprints":{"codehealthFindingId/v1":"51660671d778999986bc24fd5bdb09359fc71e8fb5b7168216dec12a2ce1a7be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): library/stdarch/crates/core_arch/src/x86/avx512bw.rs:11876-11888 | library/stdarch/crates/core_arch/src/x86/avx512bw.rs:11972-11984 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/stdarch/crates/core_arch/src/x86/avx512bw.rs:11876\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":"library/stdarch/crates/core_arch/src/x86/avx512bw.rs"},"region":{"startLine":11876}}}],"partialFingerprints":{"codehealthFindingId/v1":"baec8ead80b3633c0198d26171863060332992ca65a8ddf2e8fb96e37154880d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): library/stdarch/crates/core_arch/src/x86/avx512f.rs:32685-32697 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:33306-33318 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/stdarch/crates/core_arch/src/x86/avx512f.rs:32685\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":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":32685}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa9fdbdb3dca4044774f26a49d667a02ae24c50ef56afe2752a21ba06032a3df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): library/stdarch/crates/core_arch/src/x86/avx512f.rs:32717-32730 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:33338-33351 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/stdarch/crates/core_arch/src/x86/avx512f.rs:32717\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":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":32717}}}],"partialFingerprints":{"codehealthFindingId/v1":"b331eeca947f9595bf24fb3ce4275c417d9004a088315f90e788ec2b31c0c4a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): library/stdarch/crates/core_arch/src/x86/avx512f.rs:32749-32761 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:33370-33382 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/stdarch/crates/core_arch/src/x86/avx512f.rs:32749\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":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":32749}}}],"partialFingerprints":{"codehealthFindingId/v1":"58b2b8a1369b1b3eb799c4ebafcfd71ddbbaa0f273efeeaeaba906803fff2803"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): library/stdarch/crates/core_arch/src/x86/avx512f.rs:32781-32794 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:33402-33415 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/stdarch/crates/core_arch/src/x86/avx512f.rs:32781\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":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":32781}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bfa99ff33f9ac82d7cf349e15e0086c88ce2522a9b7bc961498d7267efd5b72"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): library/stdarch/crates/core_arch/src/x86/avx512f.rs:32810-32822 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:33431-33443 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/stdarch/crates/core_arch/src/x86/avx512f.rs:32810\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":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":32810}}}],"partialFingerprints":{"codehealthFindingId/v1":"f184b8dfaa0866ffbabd95a3678fe3cc92a01b996f51f680b2fb639713062ecc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): library/stdarch/crates/core_arch/src/x86/avx512f.rs:32842-32855 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:33463-33476 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/stdarch/crates/core_arch/src/x86/avx512f.rs:32842\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":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":32842}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cf0f3ba20635a9f130e8a75714c1125bb71559969585be8974a6404f908e7cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): library/stdarch/crates/core_arch/src/x86/avx512f.rs:33927-33939 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:34548-34560 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/stdarch/crates/core_arch/src/x86/avx512f.rs:33927\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":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":33927}}}],"partialFingerprints":{"codehealthFindingId/v1":"3809c1af734e3957849dfdbc8cef5df92b818be0e3574d329053ae3c2fee66df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): library/stdarch/crates/core_arch/src/x86/avx512f.rs:33959-33972 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:34580-34593 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/stdarch/crates/core_arch/src/x86/avx512f.rs:33959\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":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":33959}}}],"partialFingerprints":{"codehealthFindingId/v1":"6326d4c529e3db2cea6b875597a33c18ec4b0ab08031fea69a3c7802526246e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): library/stdarch/crates/core_arch/src/x86/avx512f.rs:33991-34003 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:34612-34624 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/stdarch/crates/core_arch/src/x86/avx512f.rs:33991\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":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":33991}}}],"partialFingerprints":{"codehealthFindingId/v1":"915b8e9cf4eb09aa791f67308e54391ec0ebe9125d1e22486a54567090d232ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): library/stdarch/crates/core_arch/src/x86/avx512f.rs:34023-34036 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:34644-34657 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/stdarch/crates/core_arch/src/x86/avx512f.rs:34023\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":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":34023}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9c12b7e4bc8fe632ff4269a29e11956864bdd2d93e59aa73dd046679d52f678"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): library/stdarch/crates/core_arch/src/x86/avx512f.rs:34052-34064 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:34673-34685 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/stdarch/crates/core_arch/src/x86/avx512f.rs:34052\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":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":34052}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1f3c0bd81372d439f073e8865e11ca412d0844e1d2d9b17460e5eb93a22fcec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): library/stdarch/crates/core_arch/src/x86/avx512f.rs:34084-34097 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:34705-34718 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/stdarch/crates/core_arch/src/x86/avx512f.rs:34084\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":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":34084}}}],"partialFingerprints":{"codehealthFindingId/v1":"96f74e9a48f06f5f00a0ad1b09310fa4ff6810bd9330b39b32c95d9dcae82770"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): library/stdarch/crates/stdarch-gen-hexagon/src/hvx.rs:876-888 | library/stdarch/crates/stdarch-gen-hexagon/src/hvx.rs:907-919 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/stdarch/crates/stdarch-gen-hexagon/src/hvx.rs:876\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":"library/stdarch/crates/stdarch-gen-hexagon/src/hvx.rs"},"region":{"startLine":876}}}],"partialFingerprints":{"codehealthFindingId/v1":"486ffb40a9bc504ae3cc55997f69a8bd8b057655532aebd79493d9c94b2aae3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/bootstrap/src/core/build_steps/compile.rs:1413-1425 | src/bootstrap/src/core/build_steps/tool.rs:255-267 \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/bootstrap/src/core/build_steps/compile.rs"},"region":{"startLine":1413}}}],"partialFingerprints":{"codehealthFindingId/v1":"abde1a22d202d2462df9c0c174cdda6d6fe49c067be0b1c9f6553f8f1dab4a3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/librustdoc/html/markdown.rs:1922-1934 | src/librustdoc/html/markdown.rs:1958-1970 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/librustdoc/html/markdown.rs:1922\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/librustdoc/html/markdown.rs"},"region":{"startLine":1922}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5e38f259687a01261e15146d4f42ca5efd63ca0839f524ab8b8c14bf532c66f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/tools/clippy/clippy_lints/src/arbitrary_source_item_ordering.rs:410-422 | src/tools/clippy/clippy_lints/src/arbitrary_source_item_ordering.rs:426-438 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tools/clippy/clippy_lints/src/arbitrary_source_item_ordering.rs:410\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/tools/clippy/clippy_lints/src/arbitrary_source_item_ordering.rs"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"66bc04e1ca6d3df6b906854579b4775901408c71500f5ecabaaef0a2551b2435"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/tools/clippy/clippy_lints/src/casts/needless_type_cast.rs:66-78 | src/tools/clippy/clippy_lints/src/casts/needless_type_cast.rs:97-109 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tools/clippy/clippy_lints/src/casts/needless_type_cast.rs:66\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/tools/clippy/clippy_lints/src/casts/needless_type_cast.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0a55b17a76f7fb3717455ea12f233c15f586df32df2e801684c888f67cb2fa6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201313 lines \u00D7 2): src/tools/clippy/clippy_lints/src/equatable_if_let.rs:78-90 | src/tools/clippy/clippy_lints/src/pattern_type_mismatch.rs:176-185 \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/tools/clippy/clippy_lints/src/equatable_if_let.rs:78\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/tools/clippy/clippy_lints/src/equatable_if_let.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4cae0382045977295d9b297e866aed129ccd5dbf05d58bc656b372342b9705b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/tools/clippy/clippy_lints/src/floating_point_arithmetic/custom_abs.rs:19-32 | src/tools/clippy/clippy_lints/src/floating_point_arithmetic/custom_abs.rs:36-49 \u2014 both copies are in the same file, so extract the block 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/tools/clippy/clippy_lints/src/floating_point_arithmetic/custom_abs.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f8ca6477e01e0bde647a6df947daaf677c72214ff90514c8c9d360ec46c1737"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201313 lines \u00D7 2): src/tools/clippy/clippy_lints/src/methods/option_zip_none.rs:61-70 | src/tools/clippy/clippy_lints/src/methods/option_zip_none.rs:75-87 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tools/clippy/clippy_lints/src/methods/option_zip_none.rs:61\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/methods/option_zip_none.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeb7a5c505afef73fd41525591b8902d8bed8a9e7778a8934728c1340d8175e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/tools/clippy/clippy_lints/src/missing_doc.rs:200-212 | src/tools/clippy/clippy_lints/src/missing_doc.rs:221-233 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tools/clippy/clippy_lints/src/missing_doc.rs:200\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060item\u0060 to \u0060\u0026\u0027tcx TraitItem\u003C\u0027_\u003E\u0060 in one and \u0060\u0026\u0027tcx ImplItem\u003C\u0027_\u003E\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/tools/clippy/clippy_lints/src/missing_doc.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5ccd7cacf64e63ba23327d789110668652c47156a848f01a60766f53aa76256"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/tools/clippy/clippy_lints/src/needless_pass_by_ref_mut.rs:473-485 | src/tools/clippy/clippy_lints/src/needless_pass_by_ref_mut.rs:516-528 \u2014 both copies are in the same file, so extract the block 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/tools/clippy/clippy_lints/src/needless_pass_by_ref_mut.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"44ab8bc239fe8cf9fc88077c685d2da6baadbd75a90aef9c3f080d32bf2dff7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/tools/clippy/clippy_utils/src/res.rs:140-152 | src/tools/clippy/clippy_utils/src/res.rs:236-248 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/clippy/clippy_utils/src/res.rs:140\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/tools/clippy/clippy_utils/src/res.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fb7053be53eaaa4e534fc4167fb5b603fbb0c369f1d6509a26999470726e1f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/tools/miri/src/concurrency/weak_memory.rs:505-517 | src/tools/miri/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/tools/miri/src/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/tools/miri/src/concurrency/weak_memory.rs:519\u0060 calls \u0060sc_read\u0060 and \u0060src/tools/miri/src/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/tools/miri/src/concurrency/weak_memory.rs"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"234c34c0a571abc280cbf7287b780388a59441124c7c75c71f330a82b51a78b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/tools/miri/src/intrinsics/x86/avx2.rs:182-194 | src/tools/miri/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/tools/miri/src/intrinsics/x86/avx2.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a8f2b066faf81f276bd2268bfd0e8638aca32147b42612b8d0789fcc462f4c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/tools/miri/src/shims/unix/linux/foreign_items.rs:223-235 | src/tools/miri/src/shims/unix/solarish/foreign_items.rs:55-67 \u2014 \u0060src/tools/miri/src/shims/unix/linux/foreign_items.rs\u0060 and \u0060src/tools/miri/src/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/tools/miri/src/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/tools/miri/src/shims/unix/linux/foreign_items.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcbdca8a2cab2dc2a0baee404fc8f092994ac26f5aa148032a89d4319c8de284"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/tools/miri/src/shims/unix/macos/sync.rs:402-414 | src/tools/miri/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/tools/miri/src/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/tools/miri/src/shims/unix/macos/sync.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"794cd723f62c19caee44f474bc371b56ccdaffd2f56be5322100ce5eb76f9632"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/tools/miri/src/shims/unix/sync.rs:223-235 | src/tools/miri/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/tools/miri/src/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/tools/miri/src/shims/unix/sync.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"2666e6523497c5ff0cc0db5c6426a5df808b62ab95245ef0100c9b57f107e6bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-ty/src/next_solver/normalize.rs:252-264 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/normalize.rs:267-279 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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/tools/rust-analyzer/crates/hir-ty/src/next_solver/normalize.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"2552c69e1d0f7bc2d0b8d83badc5dde44e382288971f458ddc7afc77b17e656e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-ty/src/traits.rs:253-265 | src/tools/rust-analyzer/crates/hir-ty/src/traits.rs:276-288 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/hir-ty/src/traits.rs:253\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/traits.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a8b285b9510b1d5cd88fba411c7cd869e3199129fd348ffea639fae6194f309"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/tools/rust-analyzer/crates/hir/src/term_search.rs:120-132 | src/tools/rust-analyzer/crates/hir/src/term_search.rs:158-170 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tools/rust-analyzer/crates/hir/src/term_search.rs:120\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/tools/rust-analyzer/crates/hir/src/term_search.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e28a1d10dafee2d6039f89bca3f85a7f0dd02e35585ef5362bcede2cbe66743"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): src/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_bool_to_enum.rs:234-245 | src/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_bool_to_enum.rs:274-286 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_bool_to_enum.rs:274\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/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_bool_to_enum.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d8f50f3b06778f69dac88be39b0efe7cc34ea1dc0fd4fae11420994d9645cb9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): src/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_default_from_new.rs:106-117 | src/tools/rust-analyzer/crates/ide-assists/src/utils.rs:655-667 \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/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_default_from_new.rs:106\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/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_default_from_new.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"de490c017dbc341a1ecd5c7b9d265a7016d02673e5554c693c73bbfad2d9daeb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201313 lines \u00D7 2): src/tools/rust-analyzer/crates/ide-assists/src/handlers/wrap_unwrap_cfg_attr.rs:215-227 | src/tools/rust-analyzer/crates/ide-assists/src/handlers/wrap_unwrap_cfg_attr.rs:256-265 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tools/rust-analyzer/crates/ide-assists/src/handlers/wrap_unwrap_cfg_attr.rs:215\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/tools/rust-analyzer/crates/ide-assists/src/handlers/wrap_unwrap_cfg_attr.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"7574276fe1b14e83ddb31ce985918bb1c489987fc16aadc9af4cc75da1cda1fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/tools/rust-analyzer/crates/ide-completion/src/completions/flyimport.rs:280-292 | src/tools/rust-analyzer/crates/ide-completion/src/completions/flyimport.rs:331-343 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/ide-completion/src/completions/flyimport.rs:280\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/tools/rust-analyzer/crates/ide-completion/src/completions/flyimport.rs:278\u0060 calls \u0060filter\u0060, \u0060filter_excluded_flyimport\u0060 and \u0060src/tools/rust-analyzer/crates/ide-completion/src/completions/flyimport.rs:329\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/tools/rust-analyzer/crates/ide-completion/src/completions/flyimport.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"36f660e80b78bf933f4dbb1718fa614578e7627a2b8b59e2cce44b8ca495d036"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): src/tools/rust-analyzer/crates/ide-completion/src/completions/snippet.rs:17-29 | src/tools/rust-analyzer/crates/ide-completion/src/completions/snippet.rs:57-68 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/ide-completion/src/completions/snippet.rs:17\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/tools/rust-analyzer/crates/ide-completion/src/completions/snippet.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9f2b0fda9d5b5a63e7c4fba361e19dc0cf11b8cee52c47c54fad254852f8e34"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/tools/rust-analyzer/crates/ide-completion/src/context/analysis.rs:238-250 | src/tools/rust-analyzer/crates/ide-completion/src/context/analysis.rs:359-371 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tools/rust-analyzer/crates/ide-completion/src/context/analysis.rs:238\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/tools/rust-analyzer/crates/ide-completion/src/context/analysis.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"df4fc6a7abd60350ca88bb99c87f383f5d11b0abc62bfa910780f5d5122539c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): src/tools/rust-analyzer/crates/ide-db/src/syntax_helpers/node_ext.rs:47-59 | src/tools/rust-analyzer/crates/ide-db/src/syntax_helpers/node_ext.rs:146-157 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tools/rust-analyzer/crates/ide-db/src/syntax_helpers/node_ext.rs:47\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-db/src/syntax_helpers/node_ext.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"30e8fa6165a39705519563a911b8fd9e000cad5f8e4de9e7906dab2c97e632ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/tools/rust-analyzer/crates/ide/src/inlay_hints/lifetime.rs:35-47 | src/tools/rust-analyzer/crates/ide/src/inlay_hints/lifetime.rs:91-103 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tools/rust-analyzer/crates/ide/src/inlay_hints/lifetime.rs:35\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/tools/rust-analyzer/crates/ide/src/inlay_hints/lifetime.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"133b3cc813505514c8c7e4c0ce400a74d843dae482c017bf87c0d89215956404"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): src/tools/rust-analyzer/crates/rust-analyzer/src/cli/analysis_stats.rs:157-168 | src/tools/rust-analyzer/crates/rust-analyzer/src/cli/analysis_stats.rs:170-182 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/rust-analyzer/src/cli/analysis_stats.rs:170\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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/tools/rust-analyzer/crates/rust-analyzer/src/cli/analysis_stats.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f0b5a0a2c2ef930c832cb9efadec67f393c3a1c3e1e04705de6a5be4299485d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/tools/rust-analyzer/crates/rust-analyzer/src/lsp/to_proto.rs:685-697 | src/tools/rust-analyzer/crates/rust-analyzer/src/lsp/to_proto.rs:709-721 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/rust-analyzer/src/lsp/to_proto.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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/tools/rust-analyzer/crates/rust-analyzer/src/lsp/to_proto.rs:698\u0060 calls \u0060String\u0060 and \u0060src/tools/rust-analyzer/crates/rust-analyzer/src/lsp/to_proto.rs:722\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/tools/rust-analyzer/crates/rust-analyzer/src/lsp/to_proto.rs"},"region":{"startLine":685}}}],"partialFingerprints":{"codehealthFindingId/v1":"96761e966fcb1e57eef9fe4aa7e000bccda3b505f65e99f9007ceeffbbb4eac5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/tools/rustfmt/check_diff/src/lib.rs:321-333 | src/tools/rustfmt/check_diff/src/lib.rs:364-376 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rustfmt/check_diff/src/lib.rs:321\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/tools/rustfmt/check_diff/src/lib.rs:335\u0060 calls \u0060arg\u0060, \u0060as_ref\u0060 and \u0060src/tools/rustfmt/check_diff/src/lib.rs:378\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/tools/rustfmt/check_diff/src/lib.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"a23ef710ae88f88a337719ca3a63884544f5a092e03afcf1f0de46a53f0869e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/tools/rustfmt/src/items.rs:3161-3173 | src/tools/rustfmt/src/items.rs:3247-3259 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rustfmt/src/items.rs:3161\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/tools/rustfmt/src/items.rs"},"region":{"startLine":3161}}}],"partialFingerprints":{"codehealthFindingId/v1":"db74e385806418c7cb4b58b691d7570dbddd16fd6e28b78dfaaa3e2c7b9a562d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 6): compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs:871-882 | compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs:893-904 | compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs:915-926 | compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs:937-948 | compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs:959-970 | compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs:981-992 \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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs"},"region":{"startLine":871}}}],"partialFingerprints":{"codehealthFindingId/v1":"269c63ef25aec96219d86832ee84cd3b80629876fc1749925a09f60ea3e54fc2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 5): library/stdarch/crates/core_arch/src/x86/avx2.rs:2827-2838 | library/stdarch/crates/core_arch/src/x86/avx2.rs:3034-3045 | library/stdarch/crates/core_arch/src/x86/avx512bw.rs:11938-11949 | library/stdarch/crates/core_arch/src/x86/avx512bw.rs:12034-12045 | library/stdarch/crates/core_arch/src/x86/sse2.rs:723-734 \u2014 before extracting anything, compare \u0060library/stdarch/crates/core_arch/src/x86/avx2.rs\u0060 and \u0060library/stdarch/crates/core_arch/src/x86/avx512bw.rs\u0060 as WHOLE FILES: this scan already matched 6 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. 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 \u0060library/stdarch/crates/core_arch/src/x86/avx2.rs:2827\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":"library/stdarch/crates/core_arch/src/x86/avx2.rs"},"region":{"startLine":2827}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce655bc9eca5fe4d83bc640e4ab12c99d16c3863c369e114466c1451365073a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): compiler/rustc_next_trait_solver/src/solve/assembly/mod.rs:819-830 | compiler/rustc_next_trait_solver/src/solve/assembly/mod.rs:966-977 | compiler/rustc_next_trait_solver/src/solve/assembly/structural_traits.rs:576-587 | compiler/rustc_type_ir/src/ty_kind.rs:402-413 \u2014 before extracting anything, compare \u0060compiler/rustc_next_trait_solver/src/solve/assembly/mod.rs\u0060 and \u0060compiler/rustc_type_ir/src/ty_kind.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 36 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":"compiler/rustc_next_trait_solver/src/solve/assembly/mod.rs"},"region":{"startLine":819}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ab37e6b3dbab210525e5b31e61ce269b99bc3b2de33fd8cb0f6c44a03e38749"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 3): compiler/rustc_trait_selection/src/traits/auto_trait.rs:605-616 | compiler/rustc_trait_selection/src/traits/auto_trait.rs:624-635 | src/librustdoc/clean/auto_trait.rs:328-338 \u2014 before extracting anything, compare \u0060compiler/rustc_trait_selection/src/traits/auto_trait.rs\u0060 and \u0060src/librustdoc/clean/auto_trait.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 64 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":"compiler/rustc_trait_selection/src/traits/auto_trait.rs"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"3afbdfcc38bab425324749d694c668427873ba975d6a9c420ca818ac11c0ea79"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): library/compiler-builtins/libm/src/math/arch/i586/rounding.rs:15-26 | library/compiler-builtins/libm/src/math/arch/i586/rounding.rs:42-53 | library/compiler-builtins/libm/src/math/arch/i586/rounding.rs:62-73 \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 \u0060library/compiler-builtins/libm/src/math/arch/i586/rounding.rs:15\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/compiler-builtins/libm/src/math/arch/i586/rounding.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"704634f0b31f6b7679b10df1ca092f9e579bcba2a471cd519b8b30c5a09fc021"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 3): library/compiler-builtins/libm/src/math/rem_pio2.rs:107-117 | library/compiler-builtins/libm/src/math/rem_pio2.rs:126-136 | library/compiler-builtins/libm/src/math/rem_pio2.rs:142-153 \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 \u0060library/compiler-builtins/libm/src/math/rem_pio2.rs:107\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/compiler-builtins/libm/src/math/rem_pio2.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"2889fbf92b78c659eb24e908a67a24371dac485b4ddc6ee6366b993953a42b0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): library/std/src/sys/pal/xous/params.rs:208-219 | library/std/src/sys/pal/xous/params.rs:221-232 | library/std/src/sys/pal/xous/params.rs:278-289 \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":"library/std/src/sys/pal/xous/params.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff54c5248cfc549148ad674115a5ed9cffb8b89ebedb3f44e1e8dc3532b2e3b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): library/stdarch/crates/core_arch/src/x86/avx512f.rs:22822-22835 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:23108-23121 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:23238-23251 \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 \u0060library/stdarch/crates/core_arch/src/x86/avx512f.rs:22822\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":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":22822}}}],"partialFingerprints":{"codehealthFindingId/v1":"658a433e0dda63187abfd17fe16f756bbf47b447039f713870ee8bac6839adf2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 3): src/tools/rust-analyzer/crates/hir-def/src/nameres/collector.rs:2146-2156 | src/tools/rust-analyzer/crates/hir-def/src/nameres/collector.rs:2168-2178 | src/tools/rust-analyzer/crates/hir-def/src/nameres/collector.rs:2183-2194 \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/tools/rust-analyzer/crates/hir-def/src/nameres/collector.rs:2146\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/tools/rust-analyzer/crates/hir-def/src/nameres/collector.rs:2195\u0060 calls \u0060resolve_vis\u0060 and \u0060src/tools/rust-analyzer/crates/hir-def/src/nameres/collector.rs:2179\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/tools/rust-analyzer/crates/hir-def/src/nameres/collector.rs"},"region":{"startLine":2146}}}],"partialFingerprints":{"codehealthFindingId/v1":"90d3583f5266dc4ae39d120f603f410dfa216ccb1e774128938bbf183179c092"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): src/tools/rust-analyzer/xtask/src/codegen/grammar.rs:94-105 | src/tools/rust-analyzer/xtask/src/codegen/grammar.rs:207-218 | src/tools/rust-analyzer/xtask/src/codegen/grammar.rs:355-366 \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/tools/rust-analyzer/xtask/src/codegen/grammar.rs:94\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/tools/rust-analyzer/xtask/src/codegen/grammar.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"08a7bb48399075d0d82e8629d96a191effcea5f9ffe946b9152f08b1c5120623"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): compiler/rustc_ast/src/token.rs:1061-1072 | compiler/rustc_ast/src/token.rs:1075-1086 \u2014 both copies are in the same file, so extract the block 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":"compiler/rustc_ast/src/token.rs"},"region":{"startLine":1061}}}],"partialFingerprints":{"codehealthFindingId/v1":"f64c29f81fe365cac7098bbfa1015b6658b5f9216414bafff076c796d8f566b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): compiler/rustc_ast_pretty/src/pprust/state/expr.rs:801-812 | compiler/rustc_hir_pretty/src/lib.rs:1779-1790 \u2014 before extracting anything, compare \u0060compiler/rustc_ast_pretty/src/pprust/state/expr.rs\u0060 and \u0060compiler/rustc_hir_pretty/src/lib.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 47 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, \u0060compiler/rustc_ast_pretty/src/pprust/state/expr.rs:799\u0060 calls \u0060popen\u0060, \u0060ibox\u0060 and \u0060compiler/rustc_hir_pretty/src/lib.rs:1778\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":"compiler/rustc_ast_pretty/src/pprust/state/expr.rs"},"region":{"startLine":801}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b006558663d05e39539f864bdcf9af17476886e6da7c86631e1319082b9fca8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): compiler/rustc_borrowck/src/diagnostics/mutability_errors.rs:1291-1302 | compiler/rustc_borrowck/src/diagnostics/mutability_errors.rs:1334-1345 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_borrowck/src/diagnostics/mutability_errors.rs:1291\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":"compiler/rustc_borrowck/src/diagnostics/mutability_errors.rs"},"region":{"startLine":1291}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc96769c152d0f06e934e572e8863a55ebdbc7146ef4fe449fd0b5f72752ad5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): compiler/rustc_borrowck/src/lib.rs:477-488 | compiler/rustc_borrowck/src/lib.rs:516-527 \u2014 both copies are in the same file, so extract the block 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":"compiler/rustc_borrowck/src/lib.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"997bcbef13360a7a99fd912be567333dbf5b3c7b5f27b0cad4da1d43a053121f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): compiler/rustc_borrowck/src/lib.rs:948-959 | compiler/rustc_borrowck/src/polonius/legacy/loan_invalidations.rs:166-177 \u2014 before extracting anything, compare \u0060compiler/rustc_borrowck/src/lib.rs\u0060 and \u0060compiler/rustc_borrowck/src/polonius/legacy/loan_invalidations.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 67 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 \u0060compiler/rustc_borrowck/src/lib.rs:948\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":"compiler/rustc_borrowck/src/lib.rs"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"755e9daf1cb0f3981d36ff8d8433d65d8469a537f2ca3a02baa779ff6540e9e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): compiler/rustc_builtin_macros/src/format.rs:484-495 | src/tools/rust-analyzer/crates/hir-def/src/hir/format_args.rs:301-312 \u2014 before extracting anything, compare \u0060compiler/rustc_builtin_macros/src/format.rs\u0060 and \u0060src/tools/rust-analyzer/crates/hir-def/src/hir/format_args.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 113 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 \u0060compiler/rustc_builtin_macros/src/format.rs:484\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":"compiler/rustc_builtin_macros/src/format.rs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"4886559aa7f7ffc360c37b4bfad4c1ef3c4bf1b530106b2be0afb3944db7f0ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): compiler/rustc_codegen_cranelift/src/intrinsics/llvm_x86.rs:758-769 | compiler/rustc_codegen_cranelift/src/intrinsics/llvm_x86.rs:811-822 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_codegen_cranelift/src/intrinsics/llvm_x86.rs:758\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":"compiler/rustc_codegen_cranelift/src/intrinsics/llvm_x86.rs"},"region":{"startLine":758}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cb12d703cbc52530b03fa78d48e689640f45118154012323f56aaaf682db8a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs:1003-1014 | compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs:1047-1058 \u2014 both copies are in the same file, so extract the block 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":"compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs"},"region":{"startLine":1003}}}],"partialFingerprints":{"codehealthFindingId/v1":"82387ff795968d25d997c75d50f0cbe4ceedc7b742a50170da284da36b764f79"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs:629-640 | compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs:670-681 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs:629\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":"compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"18e19e617a70174c348384b7891dade9ff05547f4a60bbb23423a8c4daf5559e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs:1079-1090 | compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs:1130-1141 \u2014 both copies are in the same file, so extract the block 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":"compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs"},"region":{"startLine":1079}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d0362680fad4d5827e6d9490dd652de677490974c8e5b87ae856cbf4e36139e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): compiler/rustc_codegen_gcc/src/base.rs:172-183 | compiler/rustc_codegen_llvm/src/base.rs:117-128 \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 \u0060compiler/rustc_codegen_gcc/src/base.rs:172\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":"compiler/rustc_codegen_gcc/src/base.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"f12b7be6cb4d5363259cb89224e080f71c615fe4a405b39a8d7d3e70f7e24ee5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): compiler/rustc_codegen_gcc/src/builder.rs:2303-2314 | compiler/rustc_codegen_gcc/src/builder.rs:2333-2344 \u2014 both copies are in the same file, so extract the block 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":"compiler/rustc_codegen_gcc/src/builder.rs"},"region":{"startLine":2303}}}],"partialFingerprints":{"codehealthFindingId/v1":"b793af306fd4fff187d15ac4cbe030ebc824382a2db6a8b4d7a9d63a41258f4c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): compiler/rustc_codegen_gcc/src/intrinsic/simd.rs:164-175 | compiler/rustc_codegen_llvm/src/intrinsic.rs:2155-2165 \u2014 before extracting anything, compare \u0060compiler/rustc_codegen_gcc/src/intrinsic/simd.rs\u0060 and \u0060compiler/rustc_codegen_llvm/src/intrinsic.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 192 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 \u0060compiler/rustc_codegen_gcc/src/intrinsic/simd.rs:164\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":"compiler/rustc_codegen_gcc/src/intrinsic/simd.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ff4ec6a18b518ac56ee5005d350ac3ffd0b3d983df4e843df525851b801ddf4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): compiler/rustc_codegen_gcc/src/type_.rs:401-412 | compiler/rustc_codegen_llvm/src/type_of.rs:116-127 \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 \u0060compiler/rustc_codegen_gcc/src/type_.rs:401\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":"compiler/rustc_codegen_gcc/src/type_.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"471b0e557c8f34d330a65be90840a949ac9ba3c10a15a13c50a990534e43799e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): compiler/rustc_codegen_gcc/src/type_of.rs:223-234 | compiler/rustc_codegen_llvm/src/type_of.rs:249-260 \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 \u0060compiler/rustc_codegen_gcc/src/type_of.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":"compiler/rustc_codegen_gcc/src/type_of.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"00f68d7409f20a3f94462e28a87405cea8a5d989598160ec3838bd6791639f0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): compiler/rustc_codegen_llvm/src/asm.rs:218-229 | compiler/rustc_codegen_llvm/src/asm.rs:442-456 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_codegen_llvm/src/asm.rs:218\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":"compiler/rustc_codegen_llvm/src/asm.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"55bdb57edef5f96a685363e68977e75b4a93910ed09126767eebb5f3706a2600"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): compiler/rustc_codegen_llvm/src/debuginfo/metadata.rs:1310-1321 | compiler/rustc_codegen_llvm/src/debuginfo/metadata/enums/mod.rs:357-368 \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 \u0060compiler/rustc_codegen_llvm/src/debuginfo/metadata.rs:1310\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":"compiler/rustc_codegen_llvm/src/debuginfo/metadata.rs"},"region":{"startLine":1310}}}],"partialFingerprints":{"codehealthFindingId/v1":"862a771558dee0e23e44257ad1965c5cf27e4591b33f1583c07c5c5749d354ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): compiler/rustc_codegen_llvm/src/debuginfo/metadata/enums/cpp_like.rs:194-205 | compiler/rustc_codegen_llvm/src/debuginfo/metadata/enums/native.rs:57-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_codegen_llvm/src/debuginfo/metadata/enums/cpp_like.rs:194\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, \u0060compiler/rustc_codegen_llvm/src/debuginfo/metadata/enums/native.rs:55\u0060 calls \u0060visibility_di_flags\u0060, \u0060did\u0060 and \u0060compiler/rustc_codegen_llvm/src/debuginfo/metadata/enums/cpp_like.rs:192\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":"compiler/rustc_codegen_llvm/src/debuginfo/metadata/enums/cpp_like.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"8164b331f8b00303b28ecd66e8ef83b500f844ef74f40fa0283a12b7d7495127"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): compiler/rustc_codegen_llvm/src/intrinsic.rs:2622-2633 | compiler/rustc_codegen_llvm/src/intrinsic.rs:2709-2720 \u2014 both copies are in the same file, so extract the block 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":"compiler/rustc_codegen_llvm/src/intrinsic.rs"},"region":{"startLine":2622}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2cd5272b6b28d41c369cc56b2914e775c96ae87584cc1b15d90b4b20d004953"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): compiler/rustc_codegen_llvm/src/va_arg.rs:1106-1119 | compiler/rustc_codegen_llvm/src/va_arg.rs:1228-1239 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_codegen_llvm/src/va_arg.rs:1106\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":"compiler/rustc_codegen_llvm/src/va_arg.rs"},"region":{"startLine":1106}}}],"partialFingerprints":{"codehealthFindingId/v1":"79e49956e62c77f86defeef143b0c31fc788e705b13ebcff8248f16199da4119"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): compiler/rustc_codegen_ssa/src/target_features.rs:463-474 | compiler/rustc_codegen_ssa/src/target_features.rs:490-500 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_codegen_ssa/src/target_features.rs:463\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":"compiler/rustc_codegen_ssa/src/target_features.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"c67febb6403791f1041bd053f6b986643e4a01dfc41ce95197c15521f19ddc0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): compiler/rustc_expand/src/mbe/macro_rules.rs:726-737 | compiler/rustc_expand/src/mbe/macro_rules.rs:764-775 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_expand/src/mbe/macro_rules.rs:726\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, \u0060compiler/rustc_expand/src/mbe/macro_rules.rs:725\u0060 calls \u0060extend\u0060 and \u0060compiler/rustc_expand/src/mbe/macro_rules.rs:763\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":"compiler/rustc_expand/src/mbe/macro_rules.rs"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"f43fdadb94b7619dc26933eaf8f1bd4ef0d7002814ef34e3f97f9a8afec87766"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): compiler/rustc_hir_analysis/src/check/compare_eii.rs:420-431 | compiler/rustc_hir_analysis/src/check/compare_impl_item.rs:1808-1819 \u2014 before extracting anything, compare \u0060compiler/rustc_hir_analysis/src/check/compare_eii.rs\u0060 and \u0060compiler/rustc_hir_analysis/src/check/compare_impl_item.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 56 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":"compiler/rustc_hir_analysis/src/check/compare_eii.rs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd268f055601447926cd466011001eb753d7a5d91825856332b3f966b3117424"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): compiler/rustc_hir_typeck/src/opaque_types.rs:128-139 | src/tools/rust-analyzer/crates/hir-ty/src/infer/opaques.rs:95-106 \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 \u0060compiler/rustc_hir_typeck/src/opaque_types.rs:128\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":"compiler/rustc_hir_typeck/src/opaque_types.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"e38f855a8403c1ef711aa1608f029ff43adc11e925b5dc855bd9cd6be04ab6a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): compiler/rustc_infer/src/infer/at.rs:80-91 | compiler/rustc_infer/src/infer/at.rs:110-120 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_infer/src/infer/at.rs:80\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060compiler/rustc_infer/src/infer/at.rs:108\u0060 calls \u0060default\u0060 and \u0060compiler/rustc_infer/src/infer/at.rs:79\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":"compiler/rustc_infer/src/infer/at.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"90fc0b8a57277458825761316dbc8a9ec2f05cdd60e5136ceab45754604e1a1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): compiler/rustc_lint/src/late.rs:102-113 | compiler/rustc_lint/src/late.rs:200-211 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_lint/src/late.rs:102\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_lint/src/late.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"a08aa0cb5ccc5bcfd201ad475bb5fafeb07b227c428e355ad330817250ca74b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): compiler/rustc_middle/src/query/keys.rs:451-462 | compiler/rustc_middle/src/ty/print/mod.rs:343-354 \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 \u0060compiler/rustc_middle/src/query/keys.rs:451\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, \u0060compiler/rustc_middle/src/ty/print/mod.rs:342\u0060 calls \u0060Alias\u0060 and \u0060compiler/rustc_middle/src/query/keys.rs:450\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":"compiler/rustc_middle/src/query/keys.rs"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc1e12995bfad0112d76b7fbfd1fd214e686adff570ad92ea364105c10b8b662"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): compiler/rustc_mir_build/src/builder/scope.rs:816-827 | compiler/rustc_mir_build/src/builder/scope.rs:1072-1083 \u2014 both copies are in the same file, so extract the block 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":"compiler/rustc_mir_build/src/builder/scope.rs"},"region":{"startLine":816}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f9dd3db2857ea291fe909e6adfe28ba57eed2dbc033b407896f64f96b29ac7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201312 lines \u00D7 2): compiler/rustc_mir_build/src/builder/scope.rs:1018-1025 | compiler/rustc_mir_build/src/builder/scope.rs:1031-1042 \u2014 both copies are in the same file, so extract the block 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":"compiler/rustc_mir_build/src/builder/scope.rs"},"region":{"startLine":1018}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab7c48ba937eed27b1532a805e504e902eb896725420f21d9715ac0838189fe6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): compiler/rustc_mir_transform/src/gvn.rs:1794-1806 | compiler/rustc_mir_transform/src/gvn.rs:1808-1820 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_mir_transform/src/gvn.rs:1794\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":"compiler/rustc_mir_transform/src/gvn.rs"},"region":{"startLine":1794}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8b2d48af87e647db0091143b1b20dd95ebca4f2c2397234a3802c09aa3f8923"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u201312 lines \u00D7 2): compiler/rustc_next_trait_solver/src/canonical/mod.rs:400-411 | compiler/rustc_type_ir/src/relate/combine.rs:53-59 \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 \u0060compiler/rustc_next_trait_solver/src/canonical/mod.rs:400\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, \u0060compiler/rustc_type_ir/src/relate/combine.rs:60\u0060 calls \u0060Ok\u0060 and \u0060compiler/rustc_next_trait_solver/src/canonical/mod.rs:412\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":"compiler/rustc_next_trait_solver/src/canonical/mod.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"923fb5c119eab82635fc37380656a6f8f0e0176e52caaf19f6c262588da744d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): compiler/rustc_next_trait_solver/src/solve/assembly/structural_traits.rs:831-842 | compiler/rustc_trait_selection/src/traits/effects.rs:495-506 \u2014 before extracting anything, compare \u0060compiler/rustc_next_trait_solver/src/solve/assembly/structural_traits.rs\u0060 and \u0060compiler/rustc_trait_selection/src/traits/effects.rs\u0060 as WHOLE FILES: this scan already matched 7 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. 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":"compiler/rustc_next_trait_solver/src/solve/assembly/structural_traits.rs"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"13b1aa2e73bcdb6d5e24ae4415f377f958557e7fa57991c7421a04f6e69dbfa9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): compiler/rustc_next_trait_solver/src/solve/trait_goals.rs:1205-1217 | compiler/rustc_next_trait_solver/src/solve/trait_goals.rs:1241-1252 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_next_trait_solver/src/solve/trait_goals.rs:1205\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":"compiler/rustc_next_trait_solver/src/solve/trait_goals.rs"},"region":{"startLine":1205}}}],"partialFingerprints":{"codehealthFindingId/v1":"594113425eee5fd50752b4e1863b2d8be191b746d767c84f173e541bd02bf79d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): compiler/rustc_resolve/src/ident.rs:1172-1183 | compiler/rustc_resolve/src/ident.rs:1238-1249 \u2014 both copies are in the same file, so extract the block 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":"compiler/rustc_resolve/src/ident.rs"},"region":{"startLine":1172}}}],"partialFingerprints":{"codehealthFindingId/v1":"9854b0ca2d72cc3ba8b32b8a4185b93aa9fd10c2b6045b472c60dac36473df79"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201312 lines \u00D7 2): compiler/rustc_trait_selection/src/error_reporting/traits/overflow.rs:62-73 | compiler/rustc_trait_selection/src/solve/delegate.rs:568-576 \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":"compiler/rustc_trait_selection/src/error_reporting/traits/overflow.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4e6253b922efd692850b120c4d44e2f0a55b5880c099e9a3e958677c0c13f4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): compiler/rustc_trait_selection/src/traits/project.rs:1822-1833 | compiler/rustc_trait_selection/src/traits/project.rs:1856-1867 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_trait_selection/src/traits/project.rs:1822\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":"compiler/rustc_trait_selection/src/traits/project.rs"},"region":{"startLine":1822}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7a482c0b0573cc2c32dafe3fe4f4a3c4b8e959953255df3f0bddb5057bd111a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): compiler/rustc_type_ir/src/region_constraint.rs:862-872 | compiler/rustc_type_ir/src/region_constraint.rs:996-1007 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_type_ir/src/region_constraint.rs:862\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":"compiler/rustc_type_ir/src/region_constraint.rs"},"region":{"startLine":862}}}],"partialFingerprints":{"codehealthFindingId/v1":"05f43a260f0956102cb215a259c46b5fd70ff758b8bcad0ce84b17cfe360dbca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): library/compiler-builtins/libm/src/math/lgamma_r.rs:204-215 | library/compiler-builtins/libm/src/math/lgammaf_r.rs:139-150 \u2014 before extracting anything, compare \u0060library/compiler-builtins/libm/src/math/lgamma_r.rs\u0060 and \u0060library/compiler-builtins/libm/src/math/lgammaf_r.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 91 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 \u0060library/compiler-builtins/libm/src/math/lgamma_r.rs:204\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":"library/compiler-builtins/libm/src/math/lgamma_r.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"23aed72ad2eb201c88c44a537df39930f7ea85f0f750f848f0a0827e1d002bb8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): library/core/src/slice/iter.rs:466-477 | library/core/src/slice/iter.rs:503-514 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/core/src/slice/iter.rs:466\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":"library/core/src/slice/iter.rs"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"6669d7e443cc1a8f59e582f55c95cc2cebe987e2f93fca469470fea178bb34e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): library/std/src/sync/mpmc/array.rs:219-230 | library/std/src/sync/mpmc/array.rs:505-516 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/std/src/sync/mpmc/array.rs:219\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":"library/std/src/sync/mpmc/array.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"851b9ec30c89123d439c1a879fe65e1affe3696b2d68fd4cefef0cf7044982da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): library/std/src/sys/fs/unix.rs:1392-1403 | library/std/src/sys/fs/unix.rs:1428-1439 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/std/src/sys/fs/unix.rs:1392\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":"library/std/src/sys/fs/unix.rs"},"region":{"startLine":1392}}}],"partialFingerprints":{"codehealthFindingId/v1":"c69444ff36e3616621c2e1985425d853c5d8f2dd90b11ab6567872efd5814e78"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): library/std/src/sys/net/connection/uefi/tcp4.rs:226-237 | library/std/src/sys/net/connection/uefi/tcp4.rs:309-320 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/std/src/sys/net/connection/uefi/tcp4.rs:226\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 first that the copies are not typed on the same thing: the declarations holding them bind \u0060buf\u0060 to \u0060\u0026[IoSlice\u003C\u0027_\u003E]\u0060 in one and \u0060\u0026[IoSliceMut\u003C\u0027_\u003E]\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":"library/std/src/sys/net/connection/uefi/tcp4.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca09684e5135311130a4e1a1f53312d4df02a3a52c366d3dae2e514bb3fcad1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): library/std/src/sys/stdio/uefi.rs:26-37 | library/std/src/sys/stdio/windows.rs:42-53 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/std/src/sys/stdio/uefi.rs:26\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":"library/std/src/sys/stdio/uefi.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"503d6f51e29dc17ddabe883abcbe55222217c1c5e9a7feb03d577a8b8f6c6d9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): library/stdarch/crates/core_arch/src/x86/avx512bw.rs:8736-8747 | library/stdarch/crates/core_arch/src/x86/avx512bw.rs:9006-9017 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/stdarch/crates/core_arch/src/x86/avx512bw.rs:8736\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":"library/stdarch/crates/core_arch/src/x86/avx512bw.rs"},"region":{"startLine":8736}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff052dd78b84cfa9bb2bf3388ac4e0b44f8fb5d01f473de8a7098fbd85dcdaa4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): library/stdarch/crates/core_arch/src/x86/avx512bw.rs:8867-8878 | library/stdarch/crates/core_arch/src/x86/avx512bw.rs:9137-9148 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/stdarch/crates/core_arch/src/x86/avx512bw.rs:8867\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":"library/stdarch/crates/core_arch/src/x86/avx512bw.rs"},"region":{"startLine":8867}}}],"partialFingerprints":{"codehealthFindingId/v1":"593c31cd334369ab1e774cd65699886040bd836ace2ceb473c2821dbbb344226"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): library/stdarch/crates/core_arch/src/x86/avx512bw.rs:9838-9849 | library/stdarch/crates/core_arch/src/x86/sse2.rs:1599-1610 \u2014 before extracting anything, compare \u0060library/stdarch/crates/core_arch/src/x86/avx512bw.rs\u0060 and \u0060library/stdarch/crates/core_arch/src/x86/sse2.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 51 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 \u0060library/stdarch/crates/core_arch/src/x86/avx512bw.rs:9838\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":"library/stdarch/crates/core_arch/src/x86/avx512bw.rs"},"region":{"startLine":9838}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae7dc861ce01136131e1e1e6b88b2af2c648850b0a8643132f5ce455a20a36ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): library/stdarch/crates/core_arch/src/x86/avx512f.rs:25331-25342 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:25635-25646 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/stdarch/crates/core_arch/src/x86/avx512f.rs:25331\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":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":25331}}}],"partialFingerprints":{"codehealthFindingId/v1":"9168f5c6f539075b31bd49c89d949c9dfff3bfcc58783445e61837f8487e6806"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): library/stdarch/crates/core_arch/src/x86/avx512f.rs:41868-41879 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:41937-41948 \u2014 both copies are in the same file, so extract the block 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":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":41868}}}],"partialFingerprints":{"codehealthFindingId/v1":"47dae001a98a3526c586f5c9648b9078b042c1b4b39917c4b6d20c093bcd22fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): library/stdarch/crates/core_arch/src/x86/avx512f.rs:41998-42009 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:42067-42078 \u2014 both copies are in the same file, so extract the block 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":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":41998}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7928163b070a576dd81d3f8d75ef449f2af1d6e50683538f6385a21572c7558"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/bootstrap/src/core/build_steps/doc.rs:430-441 | src/bootstrap/src/core/build_steps/doc.rs:539-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/bootstrap/src/core/build_steps/doc.rs:430\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/bootstrap/src/core/build_steps/doc.rs:536\u0060 calls \u0060arg\u0060 and \u0060src/bootstrap/src/core/build_steps/doc.rs:428\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/bootstrap/src/core/build_steps/doc.rs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"c948b4064188ffb55bff124256b040bfbcf254d1ec881f570c4e866e76261008"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/librustdoc/clean/mod.rs:982-993 | src/librustdoc/clean/mod.rs:2459-2470 \u2014 both copies are in the same file, so extract the block 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/librustdoc/clean/mod.rs"},"region":{"startLine":982}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5e45ea61c449afda2e17db1f4dc078ef5083c13327c9140baf8fd8b5e1127c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/librustdoc/config.rs:541-552 | src/librustdoc/config.rs:742-753 \u2014 both copies are in the same file, so extract the block 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/librustdoc/config.rs"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5d6991be20a6bba734019ae93aaa09f613a32e2be0af1022c59d46faddeebdd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/librustdoc/html/render/mod.rs:1996-2010 | src/librustdoc/html/render/print_item.rs:836-847 \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/librustdoc/html/render/mod.rs:1996\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/librustdoc/html/render/mod.rs"},"region":{"startLine":1996}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e40822ad459ece15370dfdc72b7814c261ea29f20936228e37ca08f940a84df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): src/tools/clippy/clippy_lints/src/arbitrary_source_item_ordering.rs:312-322 | src/tools/clippy/clippy_lints/src/arbitrary_source_item_ordering.rs:346-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/tools/clippy/clippy_lints/src/arbitrary_source_item_ordering.rs:312\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/tools/clippy/clippy_lints/src/arbitrary_source_item_ordering.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"528cef34bbf36aaf83a16962eb550c64ed3089a5eda3d5051a22a99b09d5d5fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/tools/clippy/clippy_lints/src/implicit_saturating_sub.rs:363-374 | src/tools/clippy/clippy_lints/src/implicit_saturating_sub.rs:378-389 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/clippy/clippy_lints/src/implicit_saturating_sub.rs:363\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/tools/clippy/clippy_lints/src/implicit_saturating_sub.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e9308b33604d82f5e80fadcc32fb94707622f5383ff9fb8b38abc31404fab44"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): src/tools/clippy/clippy_lints/src/manual_pop_if.rs:275-286 | src/tools/clippy/clippy_lints/src/manual_pop_if.rs:328-337 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/clippy/clippy_lints/src/manual_pop_if.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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/manual_pop_if.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e323accb363c7f93790ce764deb625e9e7bcb8c1209b746f34958ec2c4a1334"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/tools/clippy/clippy_lints/src/matches/match_like_matches.rs:41-52 | src/tools/clippy/clippy_lints/src/matches/match_like_matches.rs:173-184 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/clippy/clippy_lints/src/matches/match_like_matches.rs:41\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/tools/clippy/clippy_lints/src/matches/match_like_matches.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5049b581137abeed1bcce3435799bfd367a80e675415746228f5a22d2702f09"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/tools/clippy/clippy_lints/src/types/mod.rs:619-630 | src/tools/clippy/clippy_lints/src/types/mod.rs:633-644 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/clippy/clippy_lints/src/types/mod.rs:619\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/tools/clippy/clippy_lints/src/types/mod.rs"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"e437bc5e08ab7d008ee30f50d844c61165af627ad4430b2c93134160093de2d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/tools/miri/src/concurrency/sync.rs:421-432 | src/tools/miri/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/tools/miri/src/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/tools/miri/src/concurrency/sync.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"2093f106af26df06251f76eed2d9c2bb12d965fb39dbb85ae6d355f5a30589f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/tools/miri/src/intrinsics/x86/mod.rs:1070-1081 | src/tools/miri/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/tools/miri/src/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/tools/miri/src/intrinsics/x86/mod.rs"},"region":{"startLine":1070}}}],"partialFingerprints":{"codehealthFindingId/v1":"8000f7be6c50cdda181d78f8a25c36a1b4285fcafbbbb2f983eb1e3d3a96ffe8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/tools/miri/src/shims/unix/freebsd/sync.rs:157-171 | src/tools/miri/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/tools/miri/src/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/tools/miri/src/shims/unix/freebsd/sync.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a9567f94883ccc4cce3180a61090dcc6fa622b06f97e0c3320ae9de6a049d99"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/tools/miri/src/shims/unix/socket.rs:957-968 | src/tools/miri/src/shims/unix/socket.rs:1133-1144 \u2014 both copies are in the same file, so extract the block 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/tools/miri/src/shims/unix/socket.rs"},"region":{"startLine":957}}}],"partialFingerprints":{"codehealthFindingId/v1":"52d33323fc53e1c17883c89409227ea4b32e9600853f26a3de5bddda7952d00c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/tools/miri/src/shims/unix/virtual_socket.rs:371-382 | src/tools/miri/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/tools/miri/src/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/tools/miri/src/shims/unix/virtual_socket.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"adf59b69933f1eeea8a444aad48bc4785f7fd218f0f10224f8e8990e4988f394"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/tools/run-make-support/src/external_deps/rustc.rs:177-188 | src/tools/run-make-support/src/external_deps/rustdoc.rs:64-75 \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/tools/run-make-support/src/external_deps/rustc.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba62ffe5cbb0e80a6983e7fe02863f9833a03acc36bc08e3ca87a0b27992d0bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/tools/run-make-support/src/fs.rs:263-274 | src/tools/run-make-support/src/fs.rs:296-307 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/run-make-support/src/fs.rs:263\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/tools/run-make-support/src/fs.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"a047fd3d6c5064347fd3d17d75f2b76729a618da6426803451997e752d782c42"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-def/src/expr_store.rs:373-384 | src/tools/rust-analyzer/crates/hir-def/src/item_scope.rs:842-853 \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/tools/rust-analyzer/crates/hir-def/src/expr_store.rs:373\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/tools/rust-analyzer/crates/hir-def/src/expr_store.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ba943a9380f827b8f8079a53af4ff83fa9df60d8b838d6802f5f85e2c67d7e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-def/src/lang_item.rs:177-188 | src/tools/rust-analyzer/crates/hir-def/src/lang_item.rs:202-213 \u2014 both copies are in the same file, so extract the block 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/tools/rust-analyzer/crates/hir-def/src/lang_item.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c0c94daf2055bf67eca5dea92acf5df730fbd4929a790dc9f8a1bba2be90808"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-def/src/signatures.rs:91-102 | src/tools/rust-analyzer/crates/hir-def/src/signatures.rs:179-189 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060id\u0060 to \u0060StructId\u0060 in one and \u0060UnionId\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/tools/rust-analyzer/crates/hir-def/src/signatures.rs:90\u0060 calls \u0060source\u0060 and \u0060src/tools/rust-analyzer/crates/hir-def/src/signatures.rs:178\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/tools/rust-analyzer/crates/hir-def/src/signatures.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"27eabbad08212ed8999a94124236d0f1451234b3e48260fdbe033339f1213cdf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-def/src/signatures.rs:191-201 | src/tools/rust-analyzer/crates/hir-def/src/signatures.rs:267-278 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/hir-def/src/signatures.rs:191\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 \u0060id\u0060 to \u0060UnionId\u0060 in one and \u0060EnumId\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/tools/rust-analyzer/crates/hir-def/src/signatures.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"a57f1369286fb7d17c3f1a87fed2a1e352c57f8bac45e2a655bdfb3bdec7ee70"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-ide/src/display.rs:1063-1077 | src/tools/rust-analyzer/crates/hir-ide/src/display.rs:1209-1223 \u2014 both copies are in the same file, so extract the block 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/tools/rust-analyzer/crates/hir-ide/src/display.rs"},"region":{"startLine":1063}}}],"partialFingerprints":{"codehealthFindingId/v1":"486229b76fd75b600dc9f54a9eb8f9bf7c627269d35a7b0e646443f94038227b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-ide/src/display.rs:1792-1803 | src/tools/rust-analyzer/crates/hir-ide/src/display.rs:1816-1827 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/tools/rust-analyzer/crates/hir-ide/src/display.rs:1828\u0060 calls \u0060async_gen_item_ty_from_yield_ty\u0060, \u0060lang_items\u0060, \u0060unwrap_or\u0060 and \u0060src/tools/rust-analyzer/crates/hir-ide/src/display.rs:1804\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/tools/rust-analyzer/crates/hir-ide/src/display.rs"},"region":{"startLine":1792}}}],"partialFingerprints":{"codehealthFindingId/v1":"443d24fc7fe7b2a4d3beb0cbdce3063f5ff5081a9704cfd07e003c4eb1218bf8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-ide/src/display.rs:2069-2080 | src/tools/rust-analyzer/crates/hir-ide/src/display.rs:2114-2125 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/hir-ide/src/display.rs:2069\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/tools/rust-analyzer/crates/hir-ide/src/display.rs"},"region":{"startLine":2069}}}],"partialFingerprints":{"codehealthFindingId/v1":"f88f738498764281af9ad0cfa618597ca9d573c1e446725c390fb40ddaa10aac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-ty/src/infer.rs:2438-2449 | src/tools/rust-analyzer/crates/hir-ty/src/infer.rs:2500-2511 \u2014 both copies are in the same file, so extract the block 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/tools/rust-analyzer/crates/hir-ty/src/infer.rs"},"region":{"startLine":2438}}}],"partialFingerprints":{"codehealthFindingId/v1":"61c60624e8caa1d169b877ca5e337198492ae3eeb08a1bcf96dd7876e18f7952"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-ty/src/infer/cast.rs:346-357 | src/tools/rust-analyzer/crates/hir-ty/src/infer/cast.rs:358-369 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/infer/cast.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"e773650d508adaa7da251b3d4d49cd4ba2b97ce66d5e3049116a9ae41e939b7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-ty/src/lib.rs:254-265 | src/tools/rust-analyzer/crates/hir-ty/src/lib.rs:288-299 \u2014 both copies are in the same file, so extract the block 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/tools/rust-analyzer/crates/hir-ty/src/lib.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"d313b67bac33bab26788750e6fe543e05237f2391554b5287cf80a74c8248776"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-ty/src/lower.rs:1785-1796 | src/tools/rust-analyzer/crates/hir-ty/src/lower.rs:2285-2295 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tools/rust-analyzer/crates/hir-ty/src/lower.rs:2285\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/tools/rust-analyzer/crates/hir-ty/src/lower.rs"},"region":{"startLine":1785}}}],"partialFingerprints":{"codehealthFindingId/v1":"6835872ce3a8373dac9d9a2b7cc4a1da3e9934c5210e6d94ab60aa9853fd564f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-ty/src/next_solver/ty.rs:1014-1025 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/ty.rs:1061-1072 \u2014 both copies are in the same file, so extract the block 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/tools/rust-analyzer/crates/hir-ty/src/next_solver/ty.rs"},"region":{"startLine":1014}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0a83357728eacc7833a261051692a4b045d406e496d735f532b1fbac62cc83e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/tools/rust-analyzer/crates/hir/src/semantics/child_by_source.rs:61-73 | src/tools/rust-analyzer/crates/hir/src/semantics/child_by_source.rs:88-100 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir/src/semantics/child_by_source.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"12abce9cb9ab1934a13529357fc4352c07f08a02ed8de44b5acf59c8b96ba990"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_for_to_while_let.rs:152-163 | src/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_iter_for_each_to_for.rs:194-205 \u2014 before extracting anything, compare \u0060src/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_for_to_while_let.rs\u0060 and \u0060src/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_iter_for_each_to_for.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 48 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. 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/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_for_to_while_let.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ed736e10689f65b8d9699535ee3476a9931e8d37fdb186b5f4a02b5dc56d870"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_tuple_return_type_to_struct.rs:291-302 | src/tools/rust-analyzer/crates/ide-assists/src/handlers/unwrap_return_type.rs:217-228 \u2014 before extracting anything, compare \u0060src/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_tuple_return_type_to_struct.rs\u0060 and \u0060src/tools/rust-analyzer/crates/ide-assists/src/handlers/unwrap_return_type.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 31 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/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_tuple_return_type_to_struct.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4477d9834e65874fc37438977adc6f32691aaa5f317e44d86d9412025e8b4cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_tuple_struct_to_named_struct.rs:195-207 | src/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_tuple_struct_to_named_struct.rs:238-250 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_tuple_struct_to_named_struct.rs:195\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/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_tuple_struct_to_named_struct.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4ac63edbf3714b817daff6e761ee685c5f44d4d21fa041e6c0a5d39db39d341"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): src/tools/rust-analyzer/crates/ide-db/src/search.rs:312-340 | src/tools/rust-analyzer/crates/ide-db/src/search.rs:343-371 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tools/rust-analyzer/crates/ide-db/src/search.rs:312\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-db/src/search.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"46a86edd6063af70e0f6898d1bf5c950a0a367250fe0e52072ee5d79eada4b43"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/tools/rust-analyzer/crates/ide-db/src/syntax_helpers/format_string.rs:121-132 | src/tools/rust-analyzer/crates/ide-db/src/syntax_helpers/format_string.rs:178-189 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tools/rust-analyzer/crates/ide-db/src/syntax_helpers/format_string.rs:121\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/tools/rust-analyzer/crates/ide-db/src/syntax_helpers/format_string.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e0b3445928830410a447b28705dd8060dd55913719fd25c5985b214e2983a16"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/tools/rust-analyzer/crates/macros/src/lib.rs:103-114 | src/tools/rust-analyzer/crates/macros/src/lib.rs:121-132 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/macros/src/lib.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/tools/rust-analyzer/crates/macros/src/lib.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"842be81ead3ab06e2260a8f023818816d2016c3dda490cd4d4abd3e443369013"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/tools/rust-analyzer/crates/rust-analyzer/src/lsp/to_proto.rs:1425-1436 | src/tools/rust-analyzer/crates/rust-analyzer/src/lsp/to_proto.rs:1439-1450 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/rust-analyzer/src/lsp/to_proto.rs:1425\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/tools/rust-analyzer/crates/rust-analyzer/src/lsp/to_proto.rs"},"region":{"startLine":1425}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f0c2f1dded61611dca798535671bf17a9ab76c0b31b95443a602cc8169dbb11"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/tools/rust-analyzer/xtask/src/codegen/lints.rs:173-185 | src/tools/rust-analyzer/xtask/src/codegen/lints.rs:194-206 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/xtask/src/codegen/lints.rs:173\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/xtask/src/codegen/lints.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"33784037b48153c92b0caf46656b50522e071ae4ff09a096d33fc32af9f463f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 6): compiler/rustc_codegen_gcc/src/intrinsic/llvm.rs:270-279 | compiler/rustc_codegen_gcc/src/intrinsic/llvm.rs:286-295 | compiler/rustc_codegen_gcc/src/intrinsic/llvm.rs:319-328 | compiler/rustc_codegen_gcc/src/intrinsic/llvm.rs:338-347 | compiler/rustc_codegen_gcc/src/intrinsic/llvm.rs:572-581 | compiler/rustc_codegen_gcc/src/intrinsic/llvm.rs:594-604 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060compiler/rustc_codegen_gcc/src/intrinsic/llvm.rs:318\u0060 calls \u0060pop\u0060 and \u0060compiler/rustc_codegen_gcc/src/intrinsic/llvm.rs:269\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":"compiler/rustc_codegen_gcc/src/intrinsic/llvm.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"f23e1bc0db848ab36324fa60adadf5dc3cece455f8c58146d16d317ef058b178"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 4): src/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_blanket_trait_impl.rs:129-139 | src/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_default_from_new.rs:83-91 | src/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_delegate_methods.rs:213-222 | src/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_impl.rs:18-26 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 4 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_blanket_trait_impl.rs:129\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/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_blanket_trait_impl.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"23ab455d687f2f8041a8e50a97663cab27d7efaedf97be48540dca8c7e2661a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): src/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_default_from_new.rs:85-95 | src/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_enum_is_method.rs:90-100 | src/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_enum_projection_method.rs:169-179 | src/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_single_field_struct_from.rs:145-155 \u2014 before extracting anything, compare \u0060src/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_enum_is_method.rs\u0060 and \u0060src/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_enum_projection_method.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 62 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/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_default_from_new.rs:85\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_default_from_new.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7f7d36fdbce6e65f65eddc7e61f3a716b55ce0f95675619e9ed535719d953c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): compiler/rustc_ast/src/token.rs:1040-1050 | compiler/rustc_ast/src/token.rs:1056-1066 | compiler/rustc_ast/src/token.rs:1070-1080 \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":"compiler/rustc_ast/src/token.rs"},"region":{"startLine":1040}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0efb936351845836958a947eb7295d7a3075f3ef8677f77f3611bf7d01571ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): compiler/rustc_codegen_cranelift/src/intrinsics/llvm_x86.rs:153-165 | compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs:1092-1104 | compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs:1144-1156 \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 \u0060compiler/rustc_codegen_cranelift/src/intrinsics/llvm_x86.rs:153\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":"compiler/rustc_codegen_cranelift/src/intrinsics/llvm_x86.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bbd974ee5267321d2ecc2e7f9118e057df6101c57ed49feac0eb1bc9aeed77e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): compiler/rustc_codegen_gcc/src/intrinsic/simd.rs:1590-1600 | compiler/rustc_codegen_llvm/src/intrinsic.rs:2552-2562 | compiler/rustc_codegen_llvm/src/intrinsic.rs:2654-2664 \u2014 before extracting anything, compare \u0060compiler/rustc_codegen_gcc/src/intrinsic/simd.rs\u0060 and \u0060compiler/rustc_codegen_llvm/src/intrinsic.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 192 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 \u0060compiler/rustc_codegen_gcc/src/intrinsic/simd.rs:1590\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":"compiler/rustc_codegen_gcc/src/intrinsic/simd.rs"},"region":{"startLine":1590}}}],"partialFingerprints":{"codehealthFindingId/v1":"6264524efc082cac5fe301c1854077afc64d3970b4418a940196d9fd9258f9e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): compiler/rustc_codegen_llvm/src/asm.rs:1248-1258 | compiler/rustc_codegen_llvm/src/asm.rs:1441-1451 | compiler/rustc_codegen_llvm/src/asm.rs:1616-1626 \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 \u0060compiler/rustc_codegen_llvm/src/asm.rs:1248\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":"compiler/rustc_codegen_llvm/src/asm.rs"},"region":{"startLine":1248}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2c9509c4349d51ccef68f9b24feadf0d3252deb9ad7ba6a8c0952e77d9e17e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): compiler/rustc_codegen_llvm/src/debuginfo/metadata.rs:1385-1396 | compiler/rustc_codegen_llvm/src/debuginfo/metadata.rs:1424-1434 | compiler/rustc_codegen_llvm/src/debuginfo/metadata/enums/native.rs:156-167 \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 \u0060compiler/rustc_codegen_llvm/src/debuginfo/metadata.rs:1385\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, \u0060compiler/rustc_codegen_llvm/src/debuginfo/metadata.rs:1423\u0060 calls \u0060spanned_layout_of\u0060 and \u0060compiler/rustc_codegen_llvm/src/debuginfo/metadata.rs:1384\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":"compiler/rustc_codegen_llvm/src/debuginfo/metadata.rs"},"region":{"startLine":1385}}}],"partialFingerprints":{"codehealthFindingId/v1":"e45bf4057250c24f6a9894c5e06bf5cdfa31ef80d6524d78ee1dd9fd3dcecd6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): compiler/rustc_middle/src/ty/util.rs:1208-1218 | compiler/rustc_middle/src/ty/util.rs:1261-1271 | compiler/rustc_mir_transform/src/gvn.rs:1746-1756 \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":"compiler/rustc_middle/src/ty/util.rs"},"region":{"startLine":1208}}}],"partialFingerprints":{"codehealthFindingId/v1":"32ce257d9ecea13a4ad21badc558b8dc694a6885a8994736ea4e1a87d5e5741b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): compiler/rustc_next_trait_solver/src/canonical/canonicalizer.rs:395-405 | compiler/rustc_next_trait_solver/src/solve/assembly/structural_traits.rs:393-403 | compiler/rustc_next_trait_solver/src/solve/assembly/structural_traits.rs:750-760 \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":"compiler/rustc_next_trait_solver/src/canonical/canonicalizer.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3d6f259ec186a25cf10a00c02aceb34a886ea1f709e19d8919c5ba6c4f82f1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 3): compiler/rustc_trait_selection/src/traits/project.rs:1480-1490 | compiler/rustc_trait_selection/src/traits/project.rs:1525-1535 | compiler/rustc_trait_selection/src/traits/project.rs:1580-1588 \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 \u0060compiler/rustc_trait_selection/src/traits/project.rs:1480\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":"compiler/rustc_trait_selection/src/traits/project.rs"},"region":{"startLine":1480}}}],"partialFingerprints":{"codehealthFindingId/v1":"75c78bf68e7b563e65ea32c013df8464aa309064d3d5b4080762094ec0b0e91e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 3): library/std/src/sys/net/connection/xous/tcplistener.rs:78-87 | library/std/src/sys/net/connection/xous/tcpstream.rs:99-109 | library/std/src/sys/net/connection/xous/udp.rs:72-81 \u2014 before extracting anything, compare \u0060library/std/src/sys/net/connection/xous/tcplistener.rs\u0060 and \u0060library/std/src/sys/net/connection/xous/udp.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 74 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 \u0060library/std/src/sys/net/connection/xous/tcplistener.rs:78\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060library/std/src/sys/net/connection/xous/tcpstream.rs:111\u0060 calls \u0060Err\u0060 and \u0060library/std/src/sys/net/connection/xous/udp.rs:83\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":"library/std/src/sys/net/connection/xous/tcplistener.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"830766f4d8125447f546484ceed0a794af297a9f490f436827ad6c065b0ec9b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 3): library/std_detect/src/detect/os/freebsd/powerpc.rs:16-24 | library/std_detect/src/detect/os/linux/powerpc.rs:19-29 | library/std_detect/src/detect/os/openbsd/powerpc.rs:19-27 \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 \u0060library/std_detect/src/detect/os/freebsd/powerpc.rs:16\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":"library/std_detect/src/detect/os/freebsd/powerpc.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ba188e5891ef3a0e6d395cb9a378a732becb0dd1df60c0be421c6ac74790e29"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): library/stdarch/crates/core_arch/src/x86/avx2.rs:242-252 | library/stdarch/crates/core_arch/src/x86/avx512bw.rs:12149-12159 | library/stdarch/crates/core_arch/src/x86/ssse3.rs:150-160 \u2014 before extracting anything, compare \u0060library/stdarch/crates/core_arch/src/x86/avx2.rs\u0060 and \u0060library/stdarch/crates/core_arch/src/x86/avx512bw.rs\u0060 as WHOLE FILES: this scan already matched 6 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. 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 \u0060library/stdarch/crates/core_arch/src/x86/avx2.rs:242\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":"library/stdarch/crates/core_arch/src/x86/avx2.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"575e6ad88402e1150d580e0d53a44349d9b1cd6e6d543dbe0a0ee4a8490ec8e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): src/tools/miri/src/shims/time.rs:335-345 | src/tools/miri/src/shims/time.rs:363-373 | src/tools/miri/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/tools/miri/src/shims/time.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"d39b47a0207b0a55948124fa3709be74372e01036861e9208e7228f5ff2dda5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): src/tools/rust-analyzer/crates/ide/src/static_index.rs:121-131 | src/tools/rust-analyzer/crates/rust-analyzer/src/cli/diagnostics.rs:131-141 | src/tools/rust-analyzer/crates/rust-analyzer/src/cli/unresolved_references.rs:100-110 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/static_index.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"943a91080635ad6e860c33317ba9b21ae93bcc3f1d2e8ce32e595cf83908292a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): compiler/rustc_ast_pretty/src/pprust/state.rs:1862-1872 | compiler/rustc_hir_pretty/src/lib.rs:1560-1570 \u2014 before extracting anything, compare \u0060compiler/rustc_ast_pretty/src/pprust/state.rs\u0060 and \u0060compiler/rustc_hir_pretty/src/lib.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 54 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 \u0060compiler/rustc_ast_pretty/src/pprust/state.rs:1862\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":"compiler/rustc_ast_pretty/src/pprust/state.rs"},"region":{"startLine":1862}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fa37f7c8d41b6883679e4a72bdb582d665e6161e91f13cf889b890966927f38"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): compiler/rustc_borrowck/src/diagnostics/region_name.rs:532-542 | compiler/rustc_borrowck/src/diagnostics/region_name.rs:947-957 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_borrowck/src/diagnostics/region_name.rs:532\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":"compiler/rustc_borrowck/src/diagnostics/region_name.rs"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"a07608fbe7a8746c6fc88c36e3f50a8b5ca184754bc4354d283f14569bfa38a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): compiler/rustc_borrowck/src/lib.rs:684-694 | compiler/rustc_borrowck/src/lib.rs:706-716 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_borrowck/src/lib.rs:684\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":"compiler/rustc_borrowck/src/lib.rs"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7589d6b3c96398c0687bfdced7ffa14de905f3107cc5d65b9458d7e1e5c679c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): compiler/rustc_borrowck/src/lib.rs:973-983 | compiler/rustc_borrowck/src/polonius/legacy/loan_invalidations.rs:191-200 \u2014 before extracting anything, compare \u0060compiler/rustc_borrowck/src/lib.rs\u0060 and \u0060compiler/rustc_borrowck/src/polonius/legacy/loan_invalidations.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 67 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 \u0060compiler/rustc_borrowck/src/lib.rs:973\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":"compiler/rustc_borrowck/src/lib.rs"},"region":{"startLine":973}}}],"partialFingerprints":{"codehealthFindingId/v1":"aedba75bd9e5a55a3dfd6bb0dbe285289f69afd4b7292e6841fe376863942aa2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): compiler/rustc_borrowck/src/lib.rs:1877-1887 | compiler/rustc_borrowck/src/polonius/legacy/loan_invalidations.rs:426-436 \u2014 before extracting anything, compare \u0060compiler/rustc_borrowck/src/lib.rs\u0060 and \u0060compiler/rustc_borrowck/src/polonius/legacy/loan_invalidations.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 67 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 \u0060compiler/rustc_borrowck/src/lib.rs:1877\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":"compiler/rustc_borrowck/src/lib.rs"},"region":{"startLine":1877}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e29a7aeefff4eb69f01c3923e05e4508a35d87305b45a91beece0c8a12687de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): compiler/rustc_borrowck/src/type_check/mod.rs:2373-2383 | compiler/rustc_borrowck/src/type_check/mod.rs:2520-2530 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_borrowck/src/type_check/mod.rs:2373\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":"compiler/rustc_borrowck/src/type_check/mod.rs"},"region":{"startLine":2373}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b24f367f3f8f387c473e988b4b3d335af1519dc5501a92dcaada894f4f88e70"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): compiler/rustc_builtin_macros/src/deriving/debug.rs:247-258 | compiler/rustc_builtin_macros/src/deriving/debug.rs:330-341 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_builtin_macros/src/deriving/debug.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1127da1635c417874e00ed8917b36bff438a0bda2f5590840f0ba8ed3df3ab6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): compiler/rustc_codegen_gcc/src/intrinsic/mod.rs:1437-1447 | compiler/rustc_codegen_llvm/src/intrinsic.rs:1700-1709 \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 \u0060compiler/rustc_codegen_gcc/src/intrinsic/mod.rs:1437\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":"compiler/rustc_codegen_gcc/src/intrinsic/mod.rs"},"region":{"startLine":1437}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c3af7b8a4ff0fde1dcfbbd5b099e12e51d640a9be762835d6cb43074a80e214"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): compiler/rustc_codegen_gcc/src/intrinsic/simd.rs:826-836 | compiler/rustc_codegen_llvm/src/intrinsic.rs:2401-2411 \u2014 before extracting anything, compare \u0060compiler/rustc_codegen_gcc/src/intrinsic/simd.rs\u0060 and \u0060compiler/rustc_codegen_llvm/src/intrinsic.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 192 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 \u0060compiler/rustc_codegen_gcc/src/intrinsic/simd.rs:826\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, \u0060compiler/rustc_codegen_gcc/src/intrinsic/simd.rs:838\u0060 calls \u0060pointercast\u0060, \u0060type_ptr_to\u0060 and \u0060compiler/rustc_codegen_llvm/src/intrinsic.rs:2413\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":"compiler/rustc_codegen_gcc/src/intrinsic/simd.rs"},"region":{"startLine":826}}}],"partialFingerprints":{"codehealthFindingId/v1":"847b817bdd1597d1459cab5b0f686510e75174787103c4451e146f6ea071d926"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): compiler/rustc_const_eval/src/const_eval/machine.rs:656-665 | compiler/rustc_const_eval/src/const_eval/machine.rs:755-765 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_const_eval/src/const_eval/machine.rs:656\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":"compiler/rustc_const_eval/src/const_eval/machine.rs"},"region":{"startLine":656}}}],"partialFingerprints":{"codehealthFindingId/v1":"898778448d338cb578b7d1ba23d0f1843a2e30d2a12af65a806690cd7eb7f0f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): compiler/rustc_hir_analysis/src/check/compare_impl_item.rs:637-647 | compiler/rustc_hir_analysis/src/check/compare_impl_item.rs:2434-2443 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_hir_analysis/src/check/compare_impl_item.rs:637\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":"compiler/rustc_hir_analysis/src/check/compare_impl_item.rs"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a30d4a36e86f12d4a529a3e45b21da1091708b1f4e40d0554f85d6810119086"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): compiler/rustc_hir_analysis/src/check/compare_impl_item.rs:1237-1247 | compiler/rustc_hir_analysis/src/check/compare_impl_item.rs:1259-1269 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_hir_analysis/src/check/compare_impl_item.rs:1237\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":"compiler/rustc_hir_analysis/src/check/compare_impl_item.rs"},"region":{"startLine":1237}}}],"partialFingerprints":{"codehealthFindingId/v1":"211f0752343e149080a05d4cedb0fff7b311441f0e6268c85e9b79f9974c9866"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): compiler/rustc_hir_analysis/src/check/region.rs:354-364 | compiler/rustc_hir_analysis/src/check/region.rs:369-379 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/check/region.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"807e7b0aba8050848c95185f6c744b313f7a1afd1051eb56d7c4a00dd78289a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): compiler/rustc_hir_analysis/src/check/wfcheck.rs:2045-2055 | compiler/rustc_ty_utils/src/ty.rs:387-397 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060compiler/rustc_hir_analysis/src/check/wfcheck.rs:2044\u0060 calls \u0060Dynamic\u0060 and \u0060compiler/rustc_ty_utils/src/ty.rs:386\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":"compiler/rustc_hir_analysis/src/check/wfcheck.rs"},"region":{"startLine":2045}}}],"partialFingerprints":{"codehealthFindingId/v1":"7741a8cb9765eb49c33ae9dec6f2ac7a714d301aa1a66a76c11fb7e4d3ddaa32"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): compiler/rustc_hir_analysis/src/coherence/inherent_impls.rs:191-201 | compiler/rustc_hir_typeck/src/method/probe.rs:929-939 \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":"compiler/rustc_hir_analysis/src/coherence/inherent_impls.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"13afec0fd7cb98e6addd7655dcd14a62f51a04827b89cf6a2754add5d07a9fe2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): compiler/rustc_hir_analysis/src/collect/type_of.rs:125-135 | compiler/rustc_hir_analysis/src/collect/type_of.rs:177-187 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_hir_analysis/src/collect/type_of.rs:125\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":"compiler/rustc_hir_analysis/src/collect/type_of.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfc7d13e25adbb50798d5b4f1624d143a7a524a960605fbc1e3d6699c0f3462a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): compiler/rustc_hir_analysis/src/variance/constraints.rs:192-202 | compiler/rustc_hir_analysis/src/variance/constraints.rs:391-401 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_hir_analysis/src/variance/constraints.rs:192\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":"compiler/rustc_hir_analysis/src/variance/constraints.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a51d426bfa44767466e94176f45549423f93b8cc89260ad6db8f925b2514cb2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): compiler/rustc_hir_typeck/src/closure.rs:486-495 | compiler/rustc_hir_typeck/src/closure.rs:535-545 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"compiler/rustc_hir_typeck/src/closure.rs"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9c2bba278da9c048d27d0e0c14f68202202a507b54dd2a3d04352cfbbf60e1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): compiler/rustc_hir_typeck/src/pat.rs:803-813 | src/tools/rust-analyzer/crates/hir-ty/src/infer/pat.rs:645-655 \u2014 before extracting anything, compare \u0060compiler/rustc_hir_typeck/src/pat.rs\u0060 and \u0060src/tools/rust-analyzer/crates/hir-ty/src/infer/pat.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 47 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 \u0060compiler/rustc_hir_typeck/src/pat.rs:803\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":"compiler/rustc_hir_typeck/src/pat.rs"},"region":{"startLine":803}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8fb9f6860d00df81c213d682612f2af15f35fe307839c80e68e8ec9541f2b4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): compiler/rustc_infer/src/infer/lexical_region_resolve/mod.rs:264-274 | compiler/rustc_infer/src/infer/lexical_region_resolve/mod.rs:279-289 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_infer/src/infer/lexical_region_resolve/mod.rs:264\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":"compiler/rustc_infer/src/infer/lexical_region_resolve/mod.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c69fb2c728f2ba19af2db605a7adcc0eeb34106474080c51d269afe034b7a83"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): compiler/rustc_infer/src/infer/relate/lattice.rs:260-270 | compiler/rustc_infer/src/infer/relate/lattice.rs:272-282 \u2014 both copies are in the same file, so extract the block 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":"compiler/rustc_infer/src/infer/relate/lattice.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"477a590c425dcbb82a5275493397da90447d1018163e86b63b55dba7200d4ff0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): compiler/rustc_infer/src/infer/relate/type_relating.rs:90-100 | compiler/rustc_type_ir/src/relate/solver_relating.rs:117-127 \u2014 before extracting anything, compare \u0060compiler/rustc_infer/src/infer/relate/type_relating.rs\u0060 and \u0060compiler/rustc_type_ir/src/relate/solver_relating.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 33 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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":"compiler/rustc_infer/src/infer/relate/type_relating.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"53aea9439d4aa50ae58efe0875463e806eb159bd379a5ffc5becc4843beb2afb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): compiler/rustc_middle/src/mir/terminator.rs:636-646 | compiler/rustc_middle/src/mir/terminator.rs:657-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_middle/src/mir/terminator.rs:636\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":"compiler/rustc_middle/src/mir/terminator.rs"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"46348f949da969debdf494deb42ab082b68857f03a70d231528a318f5ea550e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): compiler/rustc_mir_build/src/builder/mod.rs:697-706 | compiler/rustc_mir_build/src/builder/mod.rs:732-742 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_mir_build/src/builder/mod.rs:697\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":"compiler/rustc_mir_build/src/builder/mod.rs"},"region":{"startLine":697}}}],"partialFingerprints":{"codehealthFindingId/v1":"e72af4483a2a74f4f4ca1434185dedd0a72b25fd33afe243129d0be06211fe1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): compiler/rustc_mir_build/src/check_unsafety.rs:1003-1013 | compiler/rustc_mir_build/src/check_unsafety.rs:1022-1032 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_mir_build/src/check_unsafety.rs:1003\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":"compiler/rustc_mir_build/src/check_unsafety.rs"},"region":{"startLine":1003}}}],"partialFingerprints":{"codehealthFindingId/v1":"caf00457a4614152aadfa65d282f77b8d20f59b272476054d98d06b682cf4b2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): compiler/rustc_mir_dataflow/src/value_analysis.rs:463-473 | compiler/rustc_mir_dataflow/src/value_analysis.rs:476-486 \u2014 both copies are in the same file, so extract the block 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":"compiler/rustc_mir_dataflow/src/value_analysis.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"509568d0c47ba2620a1951563f11df803e514148fe0dc95a4635f91f99fcde18"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): compiler/rustc_mir_transform/src/lower_intrinsics.rs:143-153 | compiler/rustc_mir_transform/src/lower_intrinsics.rs:163-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 \u0060compiler/rustc_mir_transform/src/lower_intrinsics.rs:143\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":"compiler/rustc_mir_transform/src/lower_intrinsics.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"34a7b2c3418a92e3641e5eb16d84f22224175bcc61b9a8b09f413cada0d46158"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): compiler/rustc_parse/src/parser/ty.rs:1648-1658 | compiler/rustc_parse/src/parser/ty.rs:1662-1672 \u2014 both copies are in the same file, so extract the block 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":"compiler/rustc_parse/src/parser/ty.rs"},"region":{"startLine":1648}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7c8c76ad6c502433fe1974d891c6ee10b91fd08d9d188ba7275b03113b51784"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): compiler/rustc_resolve/src/ident.rs:605-615 | compiler/rustc_resolve/src/ident.rs:671-681 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/ident.rs"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"d57aec75b0819608cc142cd067e2910b31fb5242681199ab13016819f7c7c498"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): compiler/rustc_resolve/src/late/lang_items.rs:189-199 | compiler/rustc_resolve/src/late/lang_items.rs:202-212 \u2014 both copies are in the same file, so extract the block 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":"compiler/rustc_resolve/src/late/lang_items.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce34e5ead54bd15d5753ae68ea8faa04aef74b4fa2053a87e94aafde1da7cb80"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): compiler/rustc_symbol_mangling/src/export.rs:115-125 | compiler/rustc_type_ir/src/inherent.rs:193-203 \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":"compiler/rustc_symbol_mangling/src/export.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad25bd1731c4ffb2eb39220971bfbb99820c4e00d0c20164247aa412699c313d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): compiler/rustc_symbol_mangling/src/v0.rs:94-104 | compiler/rustc_symbol_mangling/src/v0.rs:159-169 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_symbol_mangling/src/v0.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2f929674db04f9b09312b1d794a035bb233b8631cab49b5255e4d7572bdfdfb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): compiler/rustc_trait_selection/src/solve/fulfill/derive_errors.rs:295-305 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/errors.rs:427-437 \u2014 before extracting anything, compare \u0060compiler/rustc_trait_selection/src/solve/fulfill/derive_errors.rs\u0060 and \u0060src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/errors.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 99 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 \u0060compiler/rustc_trait_selection/src/solve/fulfill/derive_errors.rs:295\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060goal\u0060 to \u0060\u0026inspect::InspectGoal\u003C\u0027_, \u0027tcx\u003E\u0060 in one and \u0060\u0026inspect::InspectGoal\u003C\u0027_, \u0027db\u003E\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":"compiler/rustc_trait_selection/src/solve/fulfill/derive_errors.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"dddf29c0f5ab466fb215628727b0a358a0a498cbd9d0f5eff418242de554772c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): compiler/rustc_trait_selection/src/solve/fulfill/derive_errors.rs:435-445 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/errors.rs:540-549 \u2014 before extracting anything, compare \u0060compiler/rustc_trait_selection/src/solve/fulfill/derive_errors.rs\u0060 and \u0060src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/errors.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 99 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 \u0060compiler/rustc_trait_selection/src/solve/fulfill/derive_errors.rs:435\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":"compiler/rustc_trait_selection/src/solve/fulfill/derive_errors.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"9de59dfff82f8fd2fc6be316889543efe66f98c9af2bbc0ef5cfd610c0fe13f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): compiler/rustc_trait_selection/src/traits/effects.rs:135-144 | compiler/rustc_trait_selection/src/traits/effects.rs:291-301 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_trait_selection/src/traits/effects.rs:291\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"compiler/rustc_trait_selection/src/traits/effects.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0b2ec90e88f021b442b7e301b107a8f5a137b81670ff3eefb62fd7d9fd015f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): compiler/rustc_type_ir/src/binder.rs:268-278 | compiler/rustc_type_ir/src/binder.rs:288-298 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_type_ir/src/binder.rs:268\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":"compiler/rustc_type_ir/src/binder.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"168286b7cf96e9a5139a7fecd7b529a171d196a9e6ca94280f872c8a58e75296"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): library/alloc/src/collections/btree/node.rs:1627-1637 | library/alloc/src/collections/btree/node.rs:1691-1701 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/alloc/src/collections/btree/node.rs:1627\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 \u0060super) fn bulk_steal_left(\u0026mut\u0060 in one and \u0060super) fn bulk_steal_right(\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":"library/alloc/src/collections/btree/node.rs"},"region":{"startLine":1627}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca1676c84e23a740ffd5ab9631a4daab69f7244c4bde3a740b4d026729dcc8d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): library/alloc/src/rcs/arc.rs:2361-2371 | library/alloc/src/rcs/rc.rs:2458-2468 \u2014 before extracting anything, compare \u0060library/alloc/src/rcs/arc.rs\u0060 and \u0060library/alloc/src/rcs/rc.rs\u0060 as WHOLE FILES: this scan already matched 28 separate duplicated blocks between them, totalling at least 329 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 \u0060library/alloc/src/rcs/arc.rs:2361\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":"library/alloc/src/rcs/arc.rs"},"region":{"startLine":2361}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4e347be02e86908debdd32dc524d7ddc98de1fc847fcb51ee12875225670531"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): library/compiler-builtins/libm/src/math/erf.rs:224-234 | library/compiler-builtins/libm/src/math/erf.rs:269-279 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/compiler-builtins/libm/src/math/erf.rs:224\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":"library/compiler-builtins/libm/src/math/erf.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"f044e7653b3370cadb24b99f54cda3e657c21c78d8e90384f69f67f53dc01d00"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): library/compiler-builtins/libm/src/math/erff.rs:135-145 | library/compiler-builtins/libm/src/math/erff.rs:180-190 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/compiler-builtins/libm/src/math/erff.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/compiler-builtins/libm/src/math/erff.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1cea90e987246a822cd4a192d13e6e378b410a4096e120312f8677a71de6834"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): library/compiler-builtins/libm/src/math/lgamma_r.rs:158-168 | library/compiler-builtins/libm/src/math/tgamma.rs:43-53 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/compiler-builtins/libm/src/math/lgamma_r.rs:158\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":"library/compiler-builtins/libm/src/math/lgamma_r.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"204bc65687e71106f86eacf85e28aa4cf3d0cedb9cd1a5c27343e5efe35921d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): library/compiler-builtins/libm/src/math/sincos.rs:53-63 | library/compiler-builtins/libm/src/math/sincosf.rs:113-123 \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 \u0060library/compiler-builtins/libm/src/math/sincos.rs:53\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":"library/compiler-builtins/libm/src/math/sincos.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"05e3ff8960bdd600b387d37802374b5a076ea9bf49323a628b9be4cd862eee41"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): library/core/src/iter/adapters/step_by.rs:308-318 | library/core/src/iter/adapters/step_by.rs:330-340 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/core/src/iter/adapters/step_by.rs:308\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":"library/core/src/iter/adapters/step_by.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"7439c4dbb55602d343f50eb9043c5308d51348fc57158a4dc31d1bc7c7e926d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): library/core/src/slice/iter.rs:2588-2598 | library/core/src/slice/iter.rs:2943-2953 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/core/src/slice/iter.rs:2588\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":"library/core/src/slice/iter.rs"},"region":{"startLine":2588}}}],"partialFingerprints":{"codehealthFindingId/v1":"f694fca82cb03fffb8c9744b82f96c1b6e195bb90ffdfd788920a659c96d1681"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): library/core/src/str/iter.rs:727-737 | library/core/src/str/iter.rs:768-782 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/core/src/str/iter.rs:727\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":"library/core/src/str/iter.rs"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f8b86fdc7b3b3f5607bd9ade6ab1423be6ff60906aece7653577800540f744e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): library/portable-simd/crates/core_simd/src/swizzle.rs:87-97 | library/portable-simd/crates/core_simd/src/swizzle.rs:125-135 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/portable-simd/crates/core_simd/src/swizzle.rs:87\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":"library/portable-simd/crates/core_simd/src/swizzle.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"c36386543cfd85ca333fd34aaffa280e3121e7ed2d1b46113752606f19e3a87c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): library/std/src/sys/fs/windows.rs:340-350 | library/std/src/sys/fs/windows/dir.rs:118-128 \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 \u0060library/std/src/sys/fs/windows.rs:340\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":"library/std/src/sys/fs/windows.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"43bad3e0ff2ab8cb830d24950758d2a93d88f2a06103b1bf6ca0a6edd8a7b647"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): library/std/src/sys/process/uefi.rs:711-721 | library/std/src/sys/process/uefi.rs:735-745 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/std/src/sys/process/uefi.rs:711\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":"library/std/src/sys/process/uefi.rs"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef512aad99f465eef09aac32727f01970ec3c99ee656cc2df0cf8f2eebf0b85f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): library/stdarch/crates/core_arch/src/x86/avx512f.rs:27051-27061 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:27500-27509 \u2014 both copies are in the same file, so extract the block 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":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":27051}}}],"partialFingerprints":{"codehealthFindingId/v1":"498c00a0fbd6c3af00307ce7e86291e34c52ba4b01f8ea1335fff472d614c8cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): library/stdarch/crates/core_arch/src/x86/avx512f.rs:39444-39454 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:39487-39497 \u2014 both copies are in the same file, so extract the block 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":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":39444}}}],"partialFingerprints":{"codehealthFindingId/v1":"5df9e3de9c145768c89e87962a8b3acf13caf41b714bc2c5417f85384c2fd4e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): library/stdarch/crates/core_arch/src/x86/avx512f.rs:39508-39518 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:39551-39561 \u2014 both copies are in the same file, so extract the block 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":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":39508}}}],"partialFingerprints":{"codehealthFindingId/v1":"333633a2c50e135244e023ed61f24617b8965cd4e2fa9bef7df3612072e7dce2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): library/stdarch/crates/core_arch/src/x86/avx512f.rs:41615-41625 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:41682-41692 \u2014 both copies are in the same file, so extract the block 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":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":41615}}}],"partialFingerprints":{"codehealthFindingId/v1":"39e9894555dd7be7c7a81adb9836ab23418242d5309f640be0027761b773e281"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): library/stdarch/crates/core_arch/src/x86/avx512f.rs:41741-41751 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:41808-41818 \u2014 both copies are in the same file, so extract the block 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":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":41741}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5a3dba71c1b09a7526aedc3e5761d24dd4800e31eb9c8d56ef18adb7cde2653"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): library/stdarch/crates/stdarch-gen-loongarch/src/main.rs:1363-1373 | library/stdarch/crates/stdarch-gen-loongarch/src/main.rs:1376-1386 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/stdarch/crates/stdarch-gen-loongarch/src/main.rs:1363\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":"library/stdarch/crates/stdarch-gen-loongarch/src/main.rs"},"region":{"startLine":1363}}}],"partialFingerprints":{"codehealthFindingId/v1":"076e80b7a87f2fe57176b5dc1c05fc712218b1214e4d50e13ebd852c572399d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/bootstrap/src/core/build_steps/check.rs:581-594 | src/bootstrap/src/core/build_steps/check.rs:665-675 \u2014 both copies are in the same file, so extract the block 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/bootstrap/src/core/build_steps/check.rs"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c94165e7b62c74b2b4c0893ee1bd3c39a14d775308583b811297c6b7f0cc0e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/bootstrap/src/core/build_steps/compile.rs:2050-2060 | src/bootstrap/src/core/build_steps/compile.rs:2074-2084 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/bootstrap/src/core/build_steps/compile.rs:2050\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/bootstrap/src/core/build_steps/compile.rs"},"region":{"startLine":2050}}}],"partialFingerprints":{"codehealthFindingId/v1":"67af1e817af9a20d5ce63bb8544083d46d3c2e8027ed332f42e304f68f96155b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): src/librustdoc/html/render/mod.rs:1774-1783 | src/librustdoc/html/render/mod.rs:1803-1813 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/librustdoc/html/render/mod.rs:1774\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060cx\u0060 to \u0060\u0026Context\u003C\u0027_\u003E) -\u003E (String\u0060 in one and \u0060\u0026Context\u003C\u0027_\u003E\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/librustdoc/html/render/mod.rs"},"region":{"startLine":1774}}}],"partialFingerprints":{"codehealthFindingId/v1":"c36f16991a3db0ef2e7ab352876505e2ab47c8e1e63b211a2ef411d8df697559"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): src/librustdoc/html/render/mod.rs:1796-1805 | src/librustdoc/html/render/mod.rs:1852-1862 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/librustdoc/html/render/mod.rs:1796\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/librustdoc/html/render/mod.rs"},"region":{"startLine":1796}}}],"partialFingerprints":{"codehealthFindingId/v1":"0081fab47b2a9c778871d3b2d2995c72b83529113c9eab503c8cdd042ccf5241"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/librustdoc/html/render/search_index.rs:413-423 | src/librustdoc/html/render/search_index.rs:437-447 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/librustdoc/html/render/search_index.rs:413\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/librustdoc/html/render/search_index.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb1982a59644463e8c5df465cd38c2fbad8cd45c7e1c77eda0446c733e177f2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/tools/clippy/clippy_config/src/types.rs:162-172 | src/tools/clippy/clippy_config/src/types.rs:197-207 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/clippy/clippy_config/src/types.rs:162\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/tools/clippy/clippy_config/src/types.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"57be5242c6f024c863d9065bcc55ba85f8e7941e53ad778aeffdae304d1368e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/tools/clippy/clippy_lints/src/methods/mod.rs:5616-5626 | src/tools/clippy/clippy_lints/src/methods/mod.rs:5634-5644 \u2014 both copies are in the same file, so extract the block 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/tools/clippy/clippy_lints/src/methods/mod.rs"},"region":{"startLine":5616}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c2fa1f9afd8cd2bc4fc7f065b4272e059b97608832c8735a57f572d9022415d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/tools/clippy/clippy_lints/src/mut_mut.rs:59-69 | src/tools/clippy/clippy_lints/src/mut_mut.rs:115-125 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/clippy/clippy_lints/src/mut_mut.rs:59\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/tools/clippy/clippy_lints/src/mut_mut.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f812d58b43b4751720594bb5634612fd20cb9e48bf86a3ec76d7fe7c1c8c3d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/tools/clippy/clippy_lints/src/unconditional_recursion.rs:133-143 | src/tools/clippy/clippy_lints/src/unconditional_recursion.rs:238-248 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/clippy/clippy_lints/src/unconditional_recursion.rs:133\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/tools/clippy/clippy_lints/src/unconditional_recursion.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"12bcc94a5055ae2557341233cb33aa6f2a5c821abb6f6484e5f193c71d3363e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201311 lines \u00D7 2): src/tools/compiletest/src/runtest/compute_diff.rs:38-45 | src/tools/rustfmt/src/rustfmt_diff.rs:213-223 \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/tools/compiletest/src/runtest/compute_diff.rs:38\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/tools/compiletest/src/runtest/compute_diff.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2bbff2bb26e4ef907a09ef31333640c3289a4cfabac9eefbd7a1298014469eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/tools/miri/src/shims/cpu_affinity.rs:113-123 | src/tools/miri/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/tools/miri/src/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/tools/miri/src/shims/cpu_affinity.rs:129\u0060 calls \u0060chunk_size\u0060 and \u0060src/tools/miri/src/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/tools/miri/src/shims/cpu_affinity.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d1fed7410d4f18c7d4cac2390db771453a4039d1cd75b6baa52a2cd6b93faa3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/tools/miri/src/shims/unix/socket.rs:341-351 | src/tools/miri/src/shims/unix/socket.rs:913-923 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/miri/src/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/tools/miri/src/shims/unix/socket.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cb0f5ef7f7255550624e8ad5692f1986eb543be2b334e3c4b4eacbc841b2f3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/tools/miri/src/shims/windows/foreign_items.rs:612-623 | src/tools/miri/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/tools/miri/src/shims/windows/foreign_items.rs"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"b08270accfef20146dfa2d06527989cd810edbc7592bf6911b1b1c5338afcf39"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/tools/miri/src/shims/windows/sync.rs:266-276 | src/tools/miri/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/tools/miri/src/shims/windows/sync.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"5176c81916597a96ec9973af6809fdef052f98c5f56bab0ed23502a07c38f550"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): src/tools/nix-dev-shell/x/x.rs:25-35 | src/tools/x/src/main.rs:106-115 \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/tools/nix-dev-shell/x/x.rs:25\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/tools/nix-dev-shell/x/x.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"23bd5b36df00801f0b758dae083c05b62b6f5b4dc1e54a68b895d3a11a1e2f3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-def/src/expr_store.rs:793-803 | src/tools/rust-analyzer/crates/hir-def/src/expr_store.rs:828-838 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/hir-def/src/expr_store.rs:793\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/tools/rust-analyzer/crates/hir-def/src/expr_store.rs"},"region":{"startLine":793}}}],"partialFingerprints":{"codehealthFindingId/v1":"e328d3108ffbff813ba1d1ead421ca6c4eef3ba5af81956ecc994b01b209add3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-def/src/expr_store/lower.rs:2562-2572 | src/tools/rust-analyzer/crates/hir-def/src/expr_store/lower.rs:2578-2586 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/hir-def/src/expr_store/lower.rs:2562\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/tools/rust-analyzer/crates/hir-def/src/expr_store/lower.rs"},"region":{"startLine":2562}}}],"partialFingerprints":{"codehealthFindingId/v1":"f498f8e15c78df99f7da556775b7336c7fe1fa56378038be9b89dcea95636527"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-def/src/expr_store/pretty.rs:589-599 | src/tools/rust-analyzer/crates/hir-def/src/expr_store/pretty.rs:608-618 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tools/rust-analyzer/crates/hir-def/src/expr_store/pretty.rs:589\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/expr_store/pretty.rs"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"6581c6b20a4fdcdfaa1fe0c9e2e605d9695e42be2af486d828f8537725fa3b56"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-def/src/item_scope.rs:922-932 | src/tools/rust-analyzer/crates/hir-def/src/item_scope.rs:935-945 \u2014 both copies are in the same file, so extract the block 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/tools/rust-analyzer/crates/hir-def/src/item_scope.rs"},"region":{"startLine":922}}}],"partialFingerprints":{"codehealthFindingId/v1":"839aa2ca2bff264e65ae4cb757b5c05c5ab12f86408862913e098671aa077bad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-ty/src/drop.rs:82-93 | src/tools/rust-analyzer/crates/hir-ty/src/drop.rs:102-112 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/hir-ty/src/drop.rs:82\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/drop.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"74cfbff0f2ce824785fef9653859ef5bd598dcc88d427fa8b07d2885e9dbbaa8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201311 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-ty/src/infer/op.rs:211-218 | src/tools/rust-analyzer/crates/hir-ty/src/infer/op.rs:222-232 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tools/rust-analyzer/crates/hir-ty/src/infer/op.rs:211\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/infer/op.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"1852a5018a0d4700a1e77d6fe085eb6341a88986943e86cfeb2138cb7a8ed26b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-ty/src/lower.rs:1669-1679 | src/tools/rust-analyzer/crates/hir-ty/src/lower.rs:1700-1710 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060def\u0060 to \u0060ConstId\u0060 in one and \u0060StaticId\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/tools/rust-analyzer/crates/hir-ty/src/lower.rs:1668\u0060 calls \u0060loc\u0060 and \u0060src/tools/rust-analyzer/crates/hir-ty/src/lower.rs:1699\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/tools/rust-analyzer/crates/hir-ty/src/lower.rs"},"region":{"startLine":1669}}}],"partialFingerprints":{"codehealthFindingId/v1":"799ac702993176ab8810ac72ec0bcedf5c9d0ec554c6d3e420728119c0218893"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-ty/src/lower.rs:1700-1710 | src/tools/rust-analyzer/crates/hir-ty/src/lower.rs:2286-2296 \u2014 both copies are in the same file, so extract the block 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/tools/rust-analyzer/crates/hir-ty/src/lower.rs"},"region":{"startLine":1700}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ca5f0cf4b1e123b68af763283214ff6b0a9868d81288097cf9051cb6f44fc7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-ty/src/lower/path.rs:751-763 | src/tools/rust-analyzer/crates/hir-ty/src/method_resolution/confirm.rs:409-419 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tools/rust-analyzer/crates/hir-ty/src/lower/path.rs:751\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/lower/path.rs"},"region":{"startLine":751}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eb5f5327b4528a8105c201343e00b83109dfcee90df88b65a2f0aa914e7f691"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-ty/src/mir/eval.rs:2464-2475 | src/tools/rust-analyzer/crates/hir-ty/src/mir/eval.rs:2485-2496 \u2014 both copies are in the same file, so extract the block 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/tools/rust-analyzer/crates/hir-ty/src/mir/eval.rs"},"region":{"startLine":2464}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ad342adb6ce614902b7c6a36cb44fe03c37bafba90c51a8e38d97185db4f798"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-ty/src/mir/eval.rs:2651-2661 | src/tools/rust-analyzer/crates/hir-ty/src/mir/eval.rs:2663-2673 \u2014 both copies are in the same file, so extract the block 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/tools/rust-analyzer/crates/hir-ty/src/mir/eval.rs"},"region":{"startLine":2651}}}],"partialFingerprints":{"codehealthFindingId/v1":"76244342c95c3b3786f4b4fb1f55226b255e0c5f8bb303e06c38d80cc3f178ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-ty/src/mir/eval/shim.rs:620-630 | src/tools/rust-analyzer/crates/hir-ty/src/mir/eval/shim.rs:692-702 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/hir-ty/src/mir/eval/shim.rs:620\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/tools/rust-analyzer/crates/hir-ty/src/mir/eval/shim.rs"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"41a0f31f7d7c7f264653d3432713b4738658fe6d9d221d03c7a8cb21c233630e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-ty/src/mir/lower.rs:430-440 | src/tools/rust-analyzer/crates/hir-ty/src/mir/lower.rs:935-945 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/hir-ty/src/mir/lower.rs:430\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/tools/rust-analyzer/crates/hir-ty/src/mir/lower.rs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"24cd17c2b38454f00f7bfce3b244af67e2f902cae2db2bc7735c2e7b1885575b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 2): src/tools/rust-analyzer/crates/hir/src/diagnostics.rs:1793-1803 | src/tools/rust-analyzer/crates/hir/src/diagnostics.rs:1817-1825 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/hir/src/diagnostics.rs:1793\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/tools/rust-analyzer/crates/hir/src/diagnostics.rs"},"region":{"startLine":1793}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7b9fe6060924690e0a7707cab9d92f614fe9396f9abf140602418bd822ee045"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/tools/rust-analyzer/crates/hir/src/lib.rs:3321-3331 | src/tools/rust-analyzer/crates/hir/src/lib.rs:3362-3372 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/hir/src/lib.rs:3321\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/tools/rust-analyzer/crates/hir/src/lib.rs"},"region":{"startLine":3321}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a6d3e7702c4f945124b5757992392ae26adfbcdc876502b460ee4ae4ceb5034"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/tools/rust-analyzer/crates/hir/src/lib.rs:3346-3356 | src/tools/rust-analyzer/crates/hir/src/lib.rs:3387-3397 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/hir/src/lib.rs:3346\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/tools/rust-analyzer/crates/hir/src/lib.rs"},"region":{"startLine":3346}}}],"partialFingerprints":{"codehealthFindingId/v1":"927e5ae7b5e9f6c2a0e79c4f5f06dc9c89a0a3bcf3f4ca5d07f7c09a27fdbb69"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): src/tools/rust-analyzer/crates/hir/src/lib.rs:4227-4236 | src/tools/rust-analyzer/crates/hir/src/lib.rs:4261-4271 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/hir/src/lib.rs:4227\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/tools/rust-analyzer/crates/hir/src/lib.rs"},"region":{"startLine":4227}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ceafc50b09728182c7360442ed909cc72563f37de678b1c62599e05ec043585"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): src/tools/rust-analyzer/crates/hir/src/term_search/tactics.rs:53-62 | src/tools/rust-analyzer/crates/hir/src/term_search/tactics.rs:102-112 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/hir/src/term_search/tactics.rs:53\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/tools/rust-analyzer/crates/hir/src/term_search/tactics.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"9712e722cefa908522a1c926644e965fcafe1dbffcf1a7e03ef47dc7df3217a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_tuple_return_type_to_struct.rs:266-276 | src/tools/rust-analyzer/crates/ide-assists/src/handlers/unwrap_return_type.rs:70-80 \u2014 before extracting anything, compare \u0060src/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_tuple_return_type_to_struct.rs\u0060 and \u0060src/tools/rust-analyzer/crates/ide-assists/src/handlers/unwrap_return_type.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 31 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/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_tuple_return_type_to_struct.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9d96a5eee6fd74189ec04ae96dade3f13b98a664ba67c8308cfef94e2db04c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_enum_is_method.rs:117-127 | src/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_enum_projection_method.rs:198-208 \u2014 before extracting anything, compare \u0060src/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_enum_is_method.rs\u0060 and \u0060src/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_enum_projection_method.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 62 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/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_enum_is_method.rs:117\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/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_enum_is_method.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cc0692593e5fbb909c856beadcd4814ab84622567da35c89d86b69603f4ba3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 2): src/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_impl.rs:121-129 | src/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_impl.rs:236-246 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_impl.rs:121\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: \u0060src/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_impl.rs:121\u0060 is reached only past a guard at line 101 that tests \u0060ctx.find_node_at_offset\u0060 and leaves the function early, and \u0060src/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_impl.rs:236\u0060 reads \u0060ctx.find_node_at_offset\u0060 with no such check. What separates these copies is not which lines they run but which PRECONDITION they enforce, so one of them is operating on state the other one refuses. Decide which is intended BEFORE unifying them \u2014 extract the shared part and whichever copy is missing the check keeps running unchecked, and if the guard is the correct behaviour then that hole is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_impl.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"15a0d23bdd109b0ee53ec0082378eddf99f2c008743577465f701d3bfc3deb6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): src/tools/rust-analyzer/crates/ide-assists/src/utils/gen_trait_fn_body.rs:662-672 | src/tools/rust-analyzer/crates/ide-assists/src/utils/gen_trait_fn_body.rs:682-691 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/ide-assists/src/utils/gen_trait_fn_body.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/tools/rust-analyzer/crates/ide-assists/src/utils/gen_trait_fn_body.rs"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6a68d4ccd19057ef2a64ef6d18caf71884a4df9047a152509eaf9dc9cc34b3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/tools/rust-analyzer/crates/ide-completion/src/completions/type.rs:72-82 | src/tools/rust-analyzer/crates/ide-completion/src/completions/type.rs:115-125 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/ide-completion/src/completions/type.rs:72\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/tools/rust-analyzer/crates/ide-completion/src/completions/type.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0110a37575382b710d38c36535dc15f7e2b061ac781c3629ef5b0e57529ffec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): src/tools/rust-analyzer/crates/ide/src/inlay_hints.rs:103-112 | src/tools/rust-analyzer/crates/ide/src/inlay_hints.rs:150-160 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/ide/src/inlay_hints.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/tools/rust-analyzer/crates/ide/src/inlay_hints.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e14be7aa95e6116c5ae631e440c8423934d7d5f046cf5e945ca3b7620d1286e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/tools/rust-analyzer/crates/mbe/src/expander/matcher.rs:523-533 | src/tools/rust-analyzer/crates/mbe/src/expander/matcher.rs:543-553 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/mbe/src/expander/matcher.rs:523\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/tools/rust-analyzer/crates/mbe/src/expander/matcher.rs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"4449a431e4b04797fd7c2c6edd7f856d147b810b8603e11aadf0ccd508838292"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u201311 lines \u00D7 2): src/tools/rust-analyzer/crates/parser/src/grammar/expressions.rs:710-720 | src/tools/rust-analyzer/crates/parser/src/grammar/patterns.rs:407-413 \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/tools/rust-analyzer/crates/parser/src/grammar/expressions.rs:710\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/tools/rust-analyzer/crates/parser/src/grammar/expressions.rs"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe1f7540747f87dd8504ee063cc1a98b7fdb4d4801edf8b3a9c641dc8409a327"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): src/tools/rust-analyzer/crates/proc-macro-srv/src/token_stream.rs:194-216 | src/tools/rust-analyzer/crates/proc-macro-srv/src/token_stream.rs:220-242 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/proc-macro-srv/src/token_stream.rs:194\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/tools/rust-analyzer/crates/proc-macro-srv/src/token_stream.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dac575078a80f185e492cf101bcaf64ace16d95a4b1cfea13606723895dfa9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/tools/rust-analyzer/crates/rust-analyzer/src/lsp/to_proto.rs:1830-1840 | src/tools/rust-analyzer/crates/rust-analyzer/src/lsp/to_proto.rs:1884-1894 \u2014 both copies are in the same file, so extract the block 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/tools/rust-analyzer/crates/rust-analyzer/src/lsp/to_proto.rs"},"region":{"startLine":1830}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f831d32a34b44ea84c023c2e64401a6487e91aa7a362eb74b4d5a1b813f6c22"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): src/tools/rust-analyzer/crates/syntax/src/ast/edit.rs:91-100 | src/tools/rust-analyzer/crates/syntax/src/ast/edit.rs:108-118 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tools/rust-analyzer/crates/syntax/src/ast/edit.rs:91\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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/tools/rust-analyzer/crates/syntax/src/ast/edit.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe0ab43d10e98bcfa5d30652f08309812dedbe7566621af99644fda373306f56"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/tools/rust-analyzer/crates/syntax/src/validation.rs:375-385 | src/tools/rust-analyzer/crates/syntax/src/validation.rs:388-398 \u2014 both copies are in the same file, so extract the block 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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060ty\u0060 to \u0060ast::DynTraitType\u0060 in one and \u0060ast::ImplTraitType\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/tools/rust-analyzer/crates/syntax/src/validation.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0d34c7262be6c04fcb89d4132133ae7922b9113d5493438a3353e76af8d802f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/tools/rustfmt/src/imports.rs:363-373 | src/tools/rustfmt/src/items.rs:3592-3602 \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/tools/rustfmt/src/imports.rs:363\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/tools/rustfmt/src/imports.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"79f5ccaa128b6e878a6d9d5313301e0b9fdb885cc5633271990be11a2f38e543"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/tools/rustfmt/src/items.rs:863-873 | src/tools/rustfmt/src/items.rs:1277-1287 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rustfmt/src/items.rs:863\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/tools/rustfmt/src/items.rs"},"region":{"startLine":863}}}],"partialFingerprints":{"codehealthFindingId/v1":"512c80da62c39f37ac4eb0e070f40dd753d24fd07830c1bfdb81372364c9a54d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/tools/rustfmt/src/rustfmt_diff.rs:191-201 | src/tools/rustfmt/src/rustfmt_diff.rs:208-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/rustfmt_diff.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"8878f9118585f48f065095e293fef1df286a6c61a768f163c8b7eb676c5aca4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 11): compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs:832-841 | compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs:877-886 | compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs:899-908 | compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs:921-930 | compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs:943-952 | compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs:965-974 | compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs:987-996 | compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs:1009-1018 | compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs:1031-1040 | compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs:1053-1062 | compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs:1075-1084 \u2014 all 11 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 \u0060compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs:832\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":"compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff317d5d805e5776cee0d582b379e505bdf1f15746ac3a808d009c3bc31b1c28"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 7): library/std/src/os/xous/ffi.rs:156-165 | library/std/src/os/xous/ffi.rs:428-437 | library/std/src/os/xous/ffi.rs:475-484 | library/std/src/os/xous/ffi.rs:519-528 | library/std/src/os/xous/ffi.rs:555-564 | library/std/src/os/xous/ffi.rs:595-604 | library/std/src/os/xous/ffi.rs:638-647 \u2014 all 7 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 \u0060library/std/src/os/xous/ffi.rs:156\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":"library/std/src/os/xous/ffi.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"857c1c8f94f362a4dda99355919bf941388f3bd2e93248aad7b132db835c24ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 5): src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:167-176 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1573-1582 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1800-1809 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1868-1877 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:2202-2211 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.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/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f5e8e5c1de80b0490667dbd754d18b87de26218e85c56b3c4b7fbd525b181f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): compiler/rustc_next_trait_solver/src/solve/trait_goals.rs:545-554 | compiler/rustc_next_trait_solver/src/solve/trait_goals.rs:570-579 | compiler/rustc_next_trait_solver/src/solve/trait_goals.rs:595-604 | compiler/rustc_next_trait_solver/src/solve/trait_goals.rs:618-627 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_next_trait_solver/src/solve/trait_goals.rs"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"40822a439afdb5cc68ed9b12cb7207d51531a86ddbe4fee773f5413f0b615418"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): compiler/rustc_passes/src/check_attr.rs:562-572 | compiler/rustc_passes/src/check_attr.rs:606-616 | compiler/rustc_passes/src/check_attr.rs:654-664 | compiler/rustc_passes/src/check_attr.rs:704-714 \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 \u0060compiler/rustc_passes/src/check_attr.rs:562\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":"compiler/rustc_passes/src/check_attr.rs"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c5368d08d5eadc2334861eb2b38493b2a963030355782c8e54da253f88d65e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): library/compiler-builtins/libm/src/math/j0.rs:286-295 | library/compiler-builtins/libm/src/math/j0.rs:398-407 | library/compiler-builtins/libm/src/math/j1.rs:278-287 | library/compiler-builtins/libm/src/math/j1.rs:390-399 \u2014 before extracting anything, compare \u0060library/compiler-builtins/libm/src/math/j0.rs\u0060 and \u0060library/compiler-builtins/libm/src/math/j1.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 84 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/compiler-builtins/libm/src/math/j0.rs:286\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":"library/compiler-builtins/libm/src/math/j0.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e11fcfc9221202ad32fbfdd7beb0b257bb087f0df5490bade3dce4483339b8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): library/compiler-builtins/libm/src/math/j0f.rs:223-232 | library/compiler-builtins/libm/src/math/j0f.rs:335-344 | library/compiler-builtins/libm/src/math/j1f.rs:222-231 | library/compiler-builtins/libm/src/math/j1f.rs:334-343 \u2014 before extracting anything, compare \u0060library/compiler-builtins/libm/src/math/j0f.rs\u0060 and \u0060library/compiler-builtins/libm/src/math/j1f.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 100 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 \u0060library/compiler-builtins/libm/src/math/j0f.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":"library/compiler-builtins/libm/src/math/j0f.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dd47abb8a22dbedafe630b8f20c8f97ff560a6fb1672735b352201342ff1567"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): library/stdarch/crates/core_arch/src/x86/avx2.rs:2801-2810 | library/stdarch/crates/core_arch/src/x86/avx2.rs:3008-3017 | library/stdarch/crates/core_arch/src/x86/avx512bw.rs:11880-11889 | library/stdarch/crates/core_arch/src/x86/avx512bw.rs:11976-11985 \u2014 before extracting anything, compare \u0060library/stdarch/crates/core_arch/src/x86/avx2.rs\u0060 and \u0060library/stdarch/crates/core_arch/src/x86/avx512bw.rs\u0060 as WHOLE FILES: this scan already matched 6 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. 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 \u0060library/stdarch/crates/core_arch/src/x86/avx2.rs:2801\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":"library/stdarch/crates/core_arch/src/x86/avx2.rs"},"region":{"startLine":2801}}}],"partialFingerprints":{"codehealthFindingId/v1":"fae2f890c84a70e4e388285b20267577ce79e68878bb14d65e29bc0ea02992e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): src/tools/clippy/clippy_lints_internal/src/repeated_is_diagnostic_item.rs:283-292 | src/tools/clippy/clippy_lints_internal/src/repeated_is_diagnostic_item.rs:313-322 | src/tools/clippy/clippy_lints_internal/src/repeated_is_diagnostic_item.rs:349-358 | src/tools/clippy/clippy_lints_internal/src/repeated_is_diagnostic_item.rs:379-388 \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/tools/clippy/clippy_lints_internal/src/repeated_is_diagnostic_item.rs:283\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints_internal/src/repeated_is_diagnostic_item.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"887fbbd8e70727b406aea41820206905420e28a81b7d6a7409c0b96bd09471e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 4): src/tools/miri/src/shims/unix/freebsd/foreign_items.rs:39-46 | src/tools/miri/src/shims/unix/linux/foreign_items.rs:244-251 | src/tools/miri/src/shims/unix/macos/foreign_items.rs:258-267 | src/tools/miri/src/shims/unix/solarish/foreign_items.rs:80-87 \u2014 \u0060src/tools/miri/src/shims/unix/linux/foreign_items.rs\u0060 and \u0060src/tools/miri/src/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/tools/miri/src/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/tools/miri/src/shims/unix/freebsd/foreign_items.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"01cf663ac28878d94752bbf9b60499aa438a8d68ea9904bbb890e3a58354d8a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 4): src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:410-418 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1816-1825 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1946-1954 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:2209-2217 \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/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:410\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/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:409\u0060 calls \u0060map_children\u0060, \u0060attrs\u0060, \u0060syntax\u0060 and \u0060src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:2208\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/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"30180353b9c7cdd38de88dac9ae411e347c5c3dc420ee880b2f4e08d16022177"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): compiler/rustc_codegen_gcc/src/intrinsic/llvm.rs:923-937 | compiler/rustc_codegen_gcc/src/intrinsic/llvm.rs:945-959 | compiler/rustc_codegen_gcc/src/intrinsic/llvm.rs:991-1005 \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 \u0060compiler/rustc_codegen_gcc/src/intrinsic/llvm.rs:923\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":"compiler/rustc_codegen_gcc/src/intrinsic/llvm.rs"},"region":{"startLine":923}}}],"partialFingerprints":{"codehealthFindingId/v1":"97b80f5b6ba22d25ee28eed0e288581548d39c763e0826dc1374a9b7d430a432"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): compiler/rustc_codegen_llvm/src/asm.rs:1221-1230 | compiler/rustc_codegen_llvm/src/asm.rs:1418-1427 | compiler/rustc_codegen_llvm/src/asm.rs:1596-1605 \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 \u0060compiler/rustc_codegen_llvm/src/asm.rs:1221\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":"compiler/rustc_codegen_llvm/src/asm.rs"},"region":{"startLine":1221}}}],"partialFingerprints":{"codehealthFindingId/v1":"6754c4371acd63984f1ba24e1cfd32b43bf2fdc639490aa427a981dc4a95e3a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): compiler/rustc_monomorphize/src/collector.rs:1551-1560 | compiler/rustc_monomorphize/src/collector.rs:1562-1571 | compiler/rustc_monomorphize/src/collector.rs:1573-1582 \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 \u0060compiler/rustc_monomorphize/src/collector.rs:1551\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":"compiler/rustc_monomorphize/src/collector.rs"},"region":{"startLine":1551}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6d2384bca3baba62aa939723a12dd54197658c7f93ea5784f1eb38fac4ecc92"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): compiler/rustc_next_trait_solver/src/solve/assembly/structural_traits.rs:417-426 | compiler/rustc_next_trait_solver/src/solve/assembly/structural_traits.rs:600-609 | compiler/rustc_next_trait_solver/src/solve/assembly/structural_traits.rs:774-783 \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 \u0060compiler/rustc_next_trait_solver/src/solve/assembly/structural_traits.rs:417\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":"compiler/rustc_next_trait_solver/src/solve/assembly/structural_traits.rs"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"508d6d848e06302f2958a9183a5195b1660e8b4a95794c6c9ca94680d562c540"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): library/std/src/sys/net/connection/socket/mod.rs:560-569 | library/std/src/sys/net/connection/socket/mod.rs:711-720 | library/std/src/sys/net/connection/socket/mod.rs:954-963 \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":"library/std/src/sys/net/connection/socket/mod.rs"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4f339f6178ccb6d94892fabe180efc09fd9bf5288e24070ce60f9510e174241"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): src/tools/miri/src/shims/unix/tcp_socket.rs:349-358 | src/tools/miri/src/shims/unix/tcp_socket.rs:768-777 | src/tools/miri/src/shims/unix/udp_socket.rs:273-282 \u2014 before extracting anything, compare \u0060src/tools/miri/src/shims/unix/tcp_socket.rs\u0060 and \u0060src/tools/miri/src/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/tools/miri/src/shims/unix/tcp_socket.rs:761\u0060 calls \u0060ensure_not_failed\u0060 and \u0060src/tools/miri/src/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/tools/miri/src/shims/unix/tcp_socket.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d5a891d9b5d90a2ab41f2b435fed858b326e5ed4bf592b736a2f36521d02804"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): compiler/rustc_attr_parsing/src/attributes/stability.rs:342-351 | compiler/rustc_attr_parsing/src/attributes/stability.rs:407-416 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_attr_parsing/src/attributes/stability.rs:342\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, \u0060compiler/rustc_attr_parsing/src/attributes/stability.rs:341\u0060 calls \u0060span\u0060 and \u0060compiler/rustc_attr_parsing/src/attributes/stability.rs:406\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":"compiler/rustc_attr_parsing/src/attributes/stability.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"b76d2537879c0e486205a6eaaae1d759a4440840cb700147e6bcda1c0b9cbf5f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): compiler/rustc_borrowck/src/diagnostics/mod.rs:666-674 | compiler/rustc_borrowck/src/diagnostics/region_errors.rs:210-219 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_borrowck/src/diagnostics/region_errors.rs:210\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/diagnostics/mod.rs"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc25c87b51d512e1eed7c3b6140eacac7a6a31d43ef43ea00cc6bf21bf48411c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): compiler/rustc_borrowck/src/lib.rs:1923-1932 | compiler/rustc_borrowck/src/lib.rs:1970-1979 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060compiler/rustc_borrowck/src/lib.rs:1980\u0060 calls \u0060RawPtr\u0060, \u0060Ref\u0060 and \u0060compiler/rustc_borrowck/src/lib.rs:1933\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":"compiler/rustc_borrowck/src/lib.rs"},"region":{"startLine":1923}}}],"partialFingerprints":{"codehealthFindingId/v1":"687d6cf25b2ff4fd6746b81c0519947b32688513c7f96ad4720164b221d0ccd8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): compiler/rustc_borrowck/src/universal_regions.rs:747-755 | compiler/rustc_borrowck/src/universal_regions.rs:776-785 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_borrowck/src/universal_regions.rs:776\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/universal_regions.rs"},"region":{"startLine":747}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8a44361554b414d2c648a683a3b2aa7dc2287ff2ef9cf8cab087160f7a37c28"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): compiler/rustc_builtin_macros/src/alloc_error_handler.rs:43-52 | compiler/rustc_builtin_macros/src/global_allocator.rs:56-65 \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 \u0060compiler/rustc_builtin_macros/src/alloc_error_handler.rs:43\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":"compiler/rustc_builtin_macros/src/alloc_error_handler.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bcef1e33631666ff2ea5d9005ec7b65f662c19adc6bb80bb2f409fe39723f7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): compiler/rustc_builtin_macros/src/util.rs:88-97 | compiler/rustc_builtin_macros/src/util.rs:242-251 \u2014 both copies are in the same file, so extract the block 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":"compiler/rustc_builtin_macros/src/util.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c9b2264063b552d899249400a4896785e9a131a6c4ba98909b5ed71153a12cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): compiler/rustc_codegen_cranelift/src/common.rs:245-254 | compiler/rustc_codegen_cranelift/src/main_shim.rs:82-91 \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 \u0060compiler/rustc_codegen_cranelift/src/common.rs:245\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":"compiler/rustc_codegen_cranelift/src/common.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"3216d3fb04ccfa10f0b04a34d9e1c2fb7a38118d76e4331bae7921c4a3937f9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): compiler/rustc_codegen_cranelift/src/intrinsics/llvm_x86.rs:915-924 | compiler/rustc_codegen_cranelift/src/intrinsics/llvm_x86.rs:1339-1347 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_codegen_cranelift/src/intrinsics/llvm_x86.rs:915\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":"compiler/rustc_codegen_cranelift/src/intrinsics/llvm_x86.rs"},"region":{"startLine":915}}}],"partialFingerprints":{"codehealthFindingId/v1":"905daa3b19cc64b7772ea12c077629bce4b7df74324b5bfa098e1727ee33ea48"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs:561-570 | compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs:587-596 \u2014 both copies are in the same file, so extract the block 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":"compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b7cc1a82b3319b178e39fdeca875a0fecc1ede75d796302ecff67e44771be1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs:827-836 | compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs:849-858 \u2014 both copies are in the same file, so extract the block 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":"compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs"},"region":{"startLine":827}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7c99b5377cebe9b2078b2cead61a71443e25814298660b7c8f20951e74f824f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs:49-58 | compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs:520-528 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs:49\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":"compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7508c465bb0b69fde1941bae57c9957aae9a1797479e07952040067e98172fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs:821-830 | compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs:885-894 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs:821\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":"compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs"},"region":{"startLine":821}}}],"partialFingerprints":{"codehealthFindingId/v1":"046aa91a9df764ca577861257de075d2be873c6423725f2657f0a2ba8bbbe50a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): compiler/rustc_codegen_gcc/src/asm.rs:344-353 | compiler/rustc_codegen_gcc/src/asm.rs:390-399 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_codegen_gcc/src/asm.rs:344\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":"compiler/rustc_codegen_gcc/src/asm.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"65f599989922d133e77abf641415d65c3d01a3db885447cf047fbde4f8411873"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): compiler/rustc_codegen_gcc/src/consts.rs:266-275 | compiler/rustc_codegen_llvm/src/consts.rs:367-376 \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 \u0060compiler/rustc_codegen_gcc/src/consts.rs:266\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":"compiler/rustc_codegen_gcc/src/consts.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"54a5f863ce650298de21dfee958fb5277b6a066a65d448c708ce608f98e11cf4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): compiler/rustc_codegen_gcc/src/intrinsic/mod.rs:752-763 | compiler/rustc_codegen_llvm/src/abi.rs:297-306 \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 \u0060compiler/rustc_codegen_gcc/src/intrinsic/mod.rs:752\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, \u0060compiler/rustc_codegen_llvm/src/abi.rs:295\u0060 calls \u0060min\u0060, \u0060unaligned_size\u0060, \u0060bytes\u0060 and \u0060compiler/rustc_codegen_gcc/src/intrinsic/mod.rs:751\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":"compiler/rustc_codegen_gcc/src/intrinsic/mod.rs"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cb07fb4e6aaa33a0ca7080e5049af22e92d2c71343ee725b0a6cfb0f74e0cce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): compiler/rustc_codegen_gcc/src/intrinsic/simd.rs:1040-1050 | compiler/rustc_codegen_gcc/src/intrinsic/simd.rs:1158-1167 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_codegen_gcc/src/intrinsic/simd.rs:1040\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":"compiler/rustc_codegen_gcc/src/intrinsic/simd.rs"},"region":{"startLine":1040}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f65b93aaba661ca4dcafd1424c7823f7d615df91d7021afbc9219eac33da7c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): compiler/rustc_codegen_llvm/src/asm.rs:1344-1353 | compiler/rustc_codegen_llvm/src/asm.rs:1531-1540 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_codegen_llvm/src/asm.rs:1344\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":"compiler/rustc_codegen_llvm/src/asm.rs"},"region":{"startLine":1344}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc454d5a20ca7cfed25fb2dcf7f66de373f6ed7df77989b08448a5b0a09f9026"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): compiler/rustc_codegen_llvm/src/asm.rs:1356-1365 | compiler/rustc_codegen_llvm/src/asm.rs:1542-1551 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_codegen_llvm/src/asm.rs:1356\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":"compiler/rustc_codegen_llvm/src/asm.rs"},"region":{"startLine":1356}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee351790ecccaf500f6a102988f8b5de903494a6869e72335fd32038a858596c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): compiler/rustc_codegen_llvm/src/intrinsic.rs:2589-2598 | compiler/rustc_codegen_llvm/src/intrinsic.rs:2689-2698 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_codegen_llvm/src/intrinsic.rs:2589\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/intrinsic.rs"},"region":{"startLine":2589}}}],"partialFingerprints":{"codehealthFindingId/v1":"23fd508a3869c6b8eb1caba5b336e876ac26e16de084e6e6f75bd70990ebfc2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): compiler/rustc_codegen_llvm/src/intrinsic.rs:2770-2779 | compiler/rustc_codegen_llvm/src/intrinsic.rs:2856-2865 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_codegen_llvm/src/intrinsic.rs:2770\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/intrinsic.rs"},"region":{"startLine":2770}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f8f0e3bad0a0aac31fb7e8fdf753a375c12db697f1d1f200da10342901b899f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): compiler/rustc_codegen_ssa/src/mir/intrinsic.rs:303-314 | compiler/rustc_codegen_ssa/src/mir/intrinsic.rs:337-346 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_codegen_ssa/src/mir/intrinsic.rs:303\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":"compiler/rustc_codegen_ssa/src/mir/intrinsic.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"6da530c729be30773136afb177840c11149766f66dc76d2468ac2876dc91e796"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 2): compiler/rustc_const_eval/src/const_eval/dummy_machine.rs:141-150 | src/tools/miri/src/operator.rs:24-31 \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 \u0060compiler/rustc_const_eval/src/const_eval/dummy_machine.rs:141\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_const_eval/src/const_eval/dummy_machine.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"e962c07d4b54fa07a833c8c83db560a6628012ccca91fa2fe72cd9a2eccbfa82"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): compiler/rustc_const_eval/src/const_eval/machine.rs:788-797 | compiler/rustc_const_eval/src/const_eval/machine.rs:871-880 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_const_eval/src/const_eval/machine.rs:788\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":"compiler/rustc_const_eval/src/const_eval/machine.rs"},"region":{"startLine":788}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc3014d30a8a6aac3dcdb326b1d449acd9f0e348f637d00983ce9b8cd39ec7b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): compiler/rustc_const_eval/src/interpret/intrinsics/simd.rs:574-582 | compiler/rustc_const_eval/src/interpret/intrinsics/simd.rs:603-612 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_const_eval/src/interpret/intrinsics/simd.rs:574\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":"compiler/rustc_const_eval/src/interpret/intrinsics/simd.rs"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"892cd2186563ffba81173ee8d7a1b4756ee2dd11a693e80f3668fb94de7ef206"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): compiler/rustc_driver_impl/src/lib.rs:492-501 | compiler/rustc_driver_impl/src/lib.rs:539-548 \u2014 both copies are in the same file, so extract the block 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":"compiler/rustc_driver_impl/src/lib.rs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"10da8742e5a97771b4c8691a7dcdc4879261b4f842b45f88e305641433265ec8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): compiler/rustc_expand/src/mbe/macro_rules.rs:1765-1773 | compiler/rustc_expand/src/mbe/macro_rules.rs:1778-1787 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_expand/src/mbe/macro_rules.rs:1765\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":"compiler/rustc_expand/src/mbe/macro_rules.rs"},"region":{"startLine":1765}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0079752d67166c128be0c6265c47b3d02c457c21b5f832a8402de500aca21c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): compiler/rustc_hir_analysis/src/coherence/builtin.rs:601-610 | compiler/rustc_hir_analysis/src/coherence/builtin.rs:621-630 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_hir_analysis/src/coherence/builtin.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":"compiler/rustc_hir_analysis/src/coherence/builtin.rs"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f1cef46dc1f2ab2cc1373faebf372bc68e1d62419575e2363eccbf8a618c850"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): compiler/rustc_hir_analysis/src/collect/item_bounds.rs:283-292 | src/tools/rust-analyzer/crates/hir-ty/src/lower.rs:2527-2537 \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 \u0060compiler/rustc_hir_analysis/src/collect/item_bounds.rs:283\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060ty\u0060 to \u0060Ty\u003C\u0027tcx\u003E\u0060 in one and \u0060Ty\u003C\u0027db\u003E\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":"compiler/rustc_hir_analysis/src/collect/item_bounds.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"d03087c46b89c0f216a20ec49f02c2c186326357959cba4e4062b2ec84ddf47e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): compiler/rustc_hir_typeck/src/method/prelude_edition_lints.rs:35-44 | compiler/rustc_hir_typeck/src/method/prelude_edition_lints.rs:473-482 \u2014 both copies are in the same file, so extract the block 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":"compiler/rustc_hir_typeck/src/method/prelude_edition_lints.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bed726ca52402735ae3f37cea806e2d0eaa9faa415687477c356b5f3a1ae7d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): compiler/rustc_hir_typeck/src/method/probe.rs:2042-2051 | compiler/rustc_hir_typeck/src/method/probe.rs:2194-2203 \u2014 both copies are in the same file, so extract the block 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":"compiler/rustc_hir_typeck/src/method/probe.rs"},"region":{"startLine":2042}}}],"partialFingerprints":{"codehealthFindingId/v1":"42e90317ed3851b65cd293915632c74d2bdf0e52bee9f2ffd2d20fea679d4c0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): compiler/rustc_hir_typeck/src/upvar.rs:2239-2249 | compiler/rustc_hir_typeck/src/upvar.rs:2257-2267 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_hir_typeck/src/upvar.rs:2239\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"compiler/rustc_hir_typeck/src/upvar.rs"},"region":{"startLine":2239}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f7e65efd15d5073c6fa8496bfd8c27a26b403fe23b12dfdb93b6f44c1183d08"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): compiler/rustc_infer/src/infer/snapshot/fudge.rs:237-247 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/snapshot/fudge.rs:230-240 \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 \u0060compiler/rustc_infer/src/infer/snapshot/fudge.rs:237\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060r\u0060 to \u0060ty::Region\u003C\u0027tcx\u003E\u0060 in one and \u0060Region\u003C\u0027db\u003E\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":"compiler/rustc_infer/src/infer/snapshot/fudge.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb7e0f1368e288c2de87c548a0cf43aaac619e4b4fd9003177d1b31b5ef723da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): compiler/rustc_infer/src/infer/type_variable.rs:198-207 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/type_variable.rs:166-175 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060ty\u0060 to \u0060Ty\u003C\u0027tcx\u003E\u0060 in one and \u0060Ty\u003C\u0027db\u003E\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":"compiler/rustc_infer/src/infer/type_variable.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"c733fef7a8eac25d2f0fa2266774ce475f87955dc80fa253e8dae1b5296b30b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): compiler/rustc_lint/src/context.rs:835-844 | compiler/rustc_lint/src/context.rs:885-894 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_lint/src/context.rs:835\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, \u0060compiler/rustc_lint/src/context.rs:884\u0060 calls \u0060Def\u0060, \u0060hir_get_if_local\u0060 and \u0060compiler/rustc_lint/src/context.rs:834\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":"compiler/rustc_lint/src/context.rs"},"region":{"startLine":835}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b718c74a62a41bf5734ae9e8cbdfc73ca144b21ecdb115d9bf460b829a22bdd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u201310 lines \u00D7 2): compiler/rustc_middle/src/ty/print/pretty.rs:423-428 | compiler/rustc_middle/src/ty/print/pretty.rs:431-440 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_middle/src/ty/print/pretty.rs:423\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":"compiler/rustc_middle/src/ty/print/pretty.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5d52bbf2414a21834136a796df793d9c1f40c8f5a8342d6b1946737aa9bd04c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): compiler/rustc_middle/src/ty/sty.rs:1965-1974 | compiler/rustc_next_trait_solver/src/solve/assembly/structural_traits.rs:137-146 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060compiler/rustc_middle/src/ty/sty.rs:1964\u0060 calls \u0060UnsafeBinder\u0060 and \u0060compiler/rustc_next_trait_solver/src/solve/assembly/structural_traits.rs:136\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":"compiler/rustc_middle/src/ty/sty.rs"},"region":{"startLine":1965}}}],"partialFingerprints":{"codehealthFindingId/v1":"30bab03d8692d072e48d6bbd01b0a054f8d4643b9b01567713b8d77f158965ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): compiler/rustc_middle/src/ty/util.rs:1550-1559 | compiler/rustc_trait_selection/src/traits/query/dropck_outlives.rs:33-42 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060compiler/rustc_trait_selection/src/traits/query/dropck_outlives.rs:43\u0060 calls \u0060CoroutineWitness\u0060 and \u0060compiler/rustc_middle/src/ty/util.rs:1560\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":"compiler/rustc_middle/src/ty/util.rs"},"region":{"startLine":1550}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fdd2c52e13932d95a1a47549ad3340c90ac7bf499b439d14c4b253d655e9895"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): compiler/rustc_mir_dataflow/src/move_paths/builder.rs:148-157 | compiler/rustc_mir_dataflow/src/move_paths/builder.rs:193-202 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060compiler/rustc_mir_dataflow/src/move_paths/builder.rs:203\u0060 calls \u0060RawPtr\u0060, \u0060Ref\u0060 and \u0060compiler/rustc_mir_dataflow/src/move_paths/builder.rs:158\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":"compiler/rustc_mir_dataflow/src/move_paths/builder.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ceb4c9635232577da36bc90bc399c70be2e0e18fb62d8f25fd32d4dedda5eb9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): compiler/rustc_mir_transform/src/check_mut_restriction.rs:132-140 | compiler/rustc_mir_transform/src/check_mut_restriction.rs:147-156 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_mir_transform/src/check_mut_restriction.rs:147\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/check_mut_restriction.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1f133217c4580f7ee64ebdc2ef41be54eee3a628328a0fe818e5a6e7657ab02"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): compiler/rustc_mir_transform/src/shim.rs:1173-1182 | compiler/rustc_mir_transform/src/shim.rs:1208-1217 \u2014 both copies are in the same file, so extract the block 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":"compiler/rustc_mir_transform/src/shim.rs"},"region":{"startLine":1173}}}],"partialFingerprints":{"codehealthFindingId/v1":"d51160d1ba912c8134247c15746cd177471392916b7eda55181e708a481cd975"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): compiler/rustc_next_trait_solver/src/solve/assembly/structural_traits.rs:209-218 | compiler/rustc_trait_selection/src/traits/effects.rs:358-367 \u2014 before extracting anything, compare \u0060compiler/rustc_next_trait_solver/src/solve/assembly/structural_traits.rs\u0060 and \u0060compiler/rustc_trait_selection/src/traits/effects.rs\u0060 as WHOLE FILES: this scan already matched 7 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. 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":"compiler/rustc_next_trait_solver/src/solve/assembly/structural_traits.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9535a3c6a717b29148e21abf56986eff8c0ebaed0e7fcf744b35d6b56e55384"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): compiler/rustc_parse/src/parser/expr.rs:1836-1845 | compiler/rustc_parse/src/parser/ty.rs:834-843 \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 \u0060compiler/rustc_parse/src/parser/expr.rs:1836\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 \u0060crate) fn parse_expr_offset_of(\u0026mut\u0060 in one and \u0060\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":"compiler/rustc_parse/src/parser/expr.rs"},"region":{"startLine":1836}}}],"partialFingerprints":{"codehealthFindingId/v1":"604866eac006587b13302c7c6a3f06a3925c0bb1ccc1baf5cee34daa63cd15c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): compiler/rustc_parse/src/parser/pat.rs:1082-1091 | compiler/rustc_parse/src/parser/pat.rs:1097-1106 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_parse/src/parser/pat.rs:1082\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":"compiler/rustc_parse/src/parser/pat.rs"},"region":{"startLine":1082}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b032fa8fb65b33c8832d8f0df7d9967cdf3971691df220052b926ff2d6ba75f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): compiler/rustc_resolve/src/diagnostics/impls.rs:4179-4188 | compiler/rustc_resolve/src/diagnostics/impls.rs:4189-4197 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_resolve/src/diagnostics/impls.rs:4179\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":"compiler/rustc_resolve/src/diagnostics/impls.rs"},"region":{"startLine":4179}}}],"partialFingerprints":{"codehealthFindingId/v1":"c19dc05e404d1259737d52bbecb855ba27391772a26d397b5a25141f59d32cd0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): compiler/rustc_resolve/src/ident.rs:1627-1636 | compiler/rustc_resolve/src/ident.rs:1735-1744 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_resolve/src/ident.rs:1627\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":"compiler/rustc_resolve/src/ident.rs"},"region":{"startLine":1627}}}],"partialFingerprints":{"codehealthFindingId/v1":"300ba596e88267ac6d040b6490c482609a00ad31b379ca091714a688f2ca965a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): compiler/rustc_resolve/src/late.rs:1870-1878 | compiler/rustc_resolve/src/late.rs:1895-1904 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_resolve/src/late.rs:1870\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":"compiler/rustc_resolve/src/late.rs"},"region":{"startLine":1870}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca6e313ab94b246604ba36c8c146d576c25324a5f4f0cd5bdeb2c74dcaa3f0d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): compiler/rustc_resolve/src/late.rs:3068-3077 | compiler/rustc_resolve/src/late.rs:3087-3096 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_resolve/src/late.rs:3068\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, \u0060compiler/rustc_resolve/src/late.rs:3079\u0060 calls \u0060resolve_trait_items\u0060 and \u0060compiler/rustc_resolve/src/late.rs:3098\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":"compiler/rustc_resolve/src/late.rs"},"region":{"startLine":3068}}}],"partialFingerprints":{"codehealthFindingId/v1":"52886729c3801c308deb8db15c6a50f70e793938ca238512bdcf5286d1ed70d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u201310 lines \u00D7 2): compiler/rustc_target/src/asm/mod.rs:1292-1301 | compiler/rustc_target/src/asm/mod.rs:1355-1360 \u2014 both copies are in the same file, so extract the block 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":"compiler/rustc_target/src/asm/mod.rs"},"region":{"startLine":1292}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b75054742e8e9077723d6fb15ea8fda2b920ec6a72c4266be5ef433c38f7b5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): compiler/rustc_target/src/callconv/aarch64.rs:25-34 | compiler/rustc_target/src/callconv/arm.rs:18-27 \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 \u0060compiler/rustc_target/src/callconv/aarch64.rs:25\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":"compiler/rustc_target/src/callconv/aarch64.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"a581cab1df85def9693f89d9920bc4866e68283795e5f1d54dfea04458857a51"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): compiler/rustc_ty_utils/src/instance.rs:350-359 | compiler/rustc_ty_utils/src/instance.rs:407-416 \u2014 both copies are in the same file, so extract the block 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":"compiler/rustc_ty_utils/src/instance.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4f5ad541b2c86a1387497296c3c964160a4e29d5bddb3b56cb73656cd376fd9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): compiler/rustc_ty_utils/src/layout.rs:353-362 | src/tools/rust-analyzer/crates/hir-ty/src/layout.rs:441-450 \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 \u0060compiler/rustc_ty_utils/src/layout.rs:353\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":"compiler/rustc_ty_utils/src/layout.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"618a15a344f11dad6e203f072847e40a9a1dbe867f77abe4bfe9924bfb7fe280"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): compiler/rustc_type_ir/src/relate.rs:437-446 | compiler/rustc_type_ir/src/relate.rs:454-463 \u2014 both copies are in the same file, so extract the block 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":"compiler/rustc_type_ir/src/relate.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a586fafa73d160780ff5a7b3ab1e11cbb35e029ac40425e75b16453e2ccb65f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): compiler/rustc_type_ir/src/sty/consts.rs:342-351 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/consts.rs:273-282 \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 \u0060compiler/rustc_type_ir/src/sty/consts.rs:342\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":"compiler/rustc_type_ir/src/sty/consts.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ea00e336d006e576c1867327cb897812aa580c88fda34402f4e366a098e17e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): library/alloc/src/io/buffered/bufwriter.rs:394-403 | library/alloc/src/io/buffered/bufwriter.rs:633-641 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/alloc/src/io/buffered/bufwriter.rs:394\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":"library/alloc/src/io/buffered/bufwriter.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"06ec3aca36ece917c20f4dacfc1bbabbf8ec0bc42fa3588d79d1194207e47282"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): library/compiler-builtins/compiler-builtins/src/float/div.rs:111-119 | library/compiler-builtins/compiler-builtins/src/float/mul.rs:18-27 \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":"library/compiler-builtins/compiler-builtins/src/float/div.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"e527160bddd037588ef9d30e759f31b6588b1855040afee40da577d6951884ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): library/compiler-builtins/crates/symcheck/src/main.rs:475-484 | library/compiler-builtins/crates/symcheck/src/main.rs:582-591 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/compiler-builtins/crates/symcheck/src/main.rs:475\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":"library/compiler-builtins/crates/symcheck/src/main.rs"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"c46c87d654f1c913336692eb36eb2fb5b58e18fb9b893441696560d7dc7eef2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201325 lines \u00D7 2): library/compiler-builtins/libm/src/math/j0.rs:129-153 | library/compiler-builtins/libm/src/math/j0f.rs:80-98 \u2014 before extracting anything, compare \u0060library/compiler-builtins/libm/src/math/j0.rs\u0060 and \u0060library/compiler-builtins/libm/src/math/j0f.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 80 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 \u0060library/compiler-builtins/libm/src/math/j0.rs:129\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/compiler-builtins/libm/src/math/j0.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5e8fe45ccef3744cab31edf7c8aca0c68ee36e2f0f7bb9b9c64f39ea0ab1370"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): library/core/src/fmt/float.rs:91-99 | library/core/src/fmt/float.rs:184-193 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/core/src/fmt/float.rs:91\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/fmt/float.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b01047545e68743377fb774ce843bb21632a6a9a80a9e35c8b6b309974b2465"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): library/core/src/num/imp/flt2dec/strategy/grisu.rs:314-323 | library/core/src/num/imp/flt2dec/strategy/grisu.rs:614-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/num/imp/flt2dec/strategy/grisu.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"a67b4030d173b649ef3b54bc619676ced2655adae9a26fef0034d8ddc8f41a9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): library/core/src/str/lossy.rs:225-234 | library/core/src/str/lossy.rs:239-248 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/core/src/str/lossy.rs:225\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":"library/core/src/str/lossy.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"b818545f8112844c000176b09ea421a2ed572a102c39be17644d0f587eddfb29"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): library/core/src/str/pattern.rs:744-753 | library/core/src/str/pattern.rs:764-773 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/core/src/str/pattern.rs:744\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":"library/core/src/str/pattern.rs"},"region":{"startLine":744}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d8d853a5062c5e373240d35ed08ef92bd89aeb452b9159d619c2abc34b1c426"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): library/panic_abort/src/android.rs:27-37 | library/panic_abort/src/zkvm.rs:7-17 \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":"library/panic_abort/src/android.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"70bd6b857046d398c874f31d97c2086b1de7c80a5586cb46448bb80f3c78304f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): library/std/src/sync/mpmc/zero.rs:143-152 | library/std/src/sync/mpmc/zero.rs:167-176 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/std/src/sync/mpmc/zero.rs:143\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sync/mpmc/zero.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4cb09423fd614b2499e988365f3e6db44fd9720785f649ef9b76f5434f620cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): library/std/src/sys/io/kernel_copy/linux.rs:299-308 | library/std/src/sys/io/kernel_copy/linux.rs:318-327 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/std/src/sys/io/kernel_copy/linux.rs:299\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":"library/std/src/sys/io/kernel_copy/linux.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3cd6644b6a57ed866b6c9c223d789ac0433d91f4b92f163978996e909e90db4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): library/std/src/sys/personality/dwarf/mod.rs:38-47 | library/std/src/sys/personality/dwarf/mod.rs:53-62 \u2014 both copies are in the same file, so extract the block 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":"library/std/src/sys/personality/dwarf/mod.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"7508846a8389b96fea10c76549d270625b84e3ac4fe874d96e8cf70af664c652"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): library/stdarch/crates/core_arch/src/x86/avx.rs:158-167 | library/stdarch/crates/core_arch/src/x86/sse.rs:1046-1055 \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 \u0060library/stdarch/crates/core_arch/src/x86/avx.rs:158\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":"library/stdarch/crates/core_arch/src/x86/avx.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aa25b1f17de8aee8351ed60b45798aaa9b23d51e04cd73bbfd1f5cd64b4c080"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): library/stdarch/crates/core_arch/src/x86/avx512bw.rs:9810-9819 | library/stdarch/crates/core_arch/src/x86/sse2.rs:1595-1604 \u2014 before extracting anything, compare \u0060library/stdarch/crates/core_arch/src/x86/avx512bw.rs\u0060 and \u0060library/stdarch/crates/core_arch/src/x86/sse2.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 51 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 \u0060library/stdarch/crates/core_arch/src/x86/avx512bw.rs:9810\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":"library/stdarch/crates/core_arch/src/x86/avx512bw.rs"},"region":{"startLine":9810}}}],"partialFingerprints":{"codehealthFindingId/v1":"687ff83746de4e037e52295ed59c671a8c91779c6eecbb2ca976de2c9df22636"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): library/stdarch/crates/core_arch/src/x86/avx512f.rs:39322-39331 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:39363-39372 \u2014 both copies are in the same file, so extract the block 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":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":39322}}}],"partialFingerprints":{"codehealthFindingId/v1":"85e0402156405a83f290240ea5823e5e61de44f0028cc57e2733f92fc457cd89"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): library/stdarch/crates/core_arch/src/x86/avx512f.rs:39383-39392 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:39424-39433 \u2014 both copies are in the same file, so extract the block 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":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":39383}}}],"partialFingerprints":{"codehealthFindingId/v1":"9be364ddb7616ecd416cb1527c29cb09122ae595104c833745d99a92477dc95c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): library/stdarch/crates/core_arch/src/x86/avx512fp16.rs:5557-5566 | library/stdarch/crates/core_arch/src/x86/avx512fp16.rs:5580-5589 \u2014 both copies are in the same file, so extract the block 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":"library/stdarch/crates/core_arch/src/x86/avx512fp16.rs"},"region":{"startLine":5557}}}],"partialFingerprints":{"codehealthFindingId/v1":"b11491bb2dd6d3bee6a2b6f313783dcdfa388069494711db609710719f266ba7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): library/stdarch/crates/core_arch/src/x86/avx512fp16.rs:6072-6081 | library/stdarch/crates/core_arch/src/x86/avx512fp16.rs:6095-6104 \u2014 both copies are in the same file, so extract the block 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":"library/stdarch/crates/core_arch/src/x86/avx512fp16.rs"},"region":{"startLine":6072}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c816380aad7ed235ba25b0735c87b4dfe35b34bf7b2978b3f71600ce4036f65"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): library/stdarch/crates/core_arch/src/x86/avx512fp16.rs:6578-6587 | library/stdarch/crates/core_arch/src/x86/avx512fp16.rs:6601-6610 \u2014 both copies are in the same file, so extract the block 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":"library/stdarch/crates/core_arch/src/x86/avx512fp16.rs"},"region":{"startLine":6578}}}],"partialFingerprints":{"codehealthFindingId/v1":"094d134b244d5a2e56b11564360a4f92ddea0b2b47104a577dbac99001fe311c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): library/stdarch/crates/core_arch/src/x86/avx512fp16.rs:7092-7101 | library/stdarch/crates/core_arch/src/x86/avx512fp16.rs:7115-7124 \u2014 both copies are in the same file, so extract the block 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":"library/stdarch/crates/core_arch/src/x86/avx512fp16.rs"},"region":{"startLine":7092}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbd490a3dbbf29bf9031bb0c858c63d4a6fb940e58833a78eddee106154ae8c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): library/stdarch/crates/stdarch-gen-arm/src/intrinsic.rs:1306-1315 | library/stdarch/crates/stdarch-gen-arm/src/intrinsic.rs:1399-1408 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/stdarch/crates/stdarch-gen-arm/src/intrinsic.rs:1306\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":"library/stdarch/crates/stdarch-gen-arm/src/intrinsic.rs"},"region":{"startLine":1306}}}],"partialFingerprints":{"codehealthFindingId/v1":"fffc77a6d19e74148eb0b2b8946dc8981c58f719b185f56ef28fa99dd500d1de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/bootstrap/src/cli_main.rs:146-155 | src/bootstrap/src/utils/helpers.rs:173-182 \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/bootstrap/src/cli_main.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"23f9df07cd191775f5074c6edbc02ec11ad792d44647e7f2a8960df6a87208ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/librustdoc/html/markdown.rs:1904-1913 | src/librustdoc/html/markdown.rs:1940-1949 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/librustdoc/html/markdown.rs:1904\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/librustdoc/html/markdown.rs"},"region":{"startLine":1904}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6367036ed838f89990454b676881e2d726821c05a7143c9df47b3b92d78cf47"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/tools/clippy/clippy_dev/src/utils.rs:483-492 | src/tools/clippy/clippy_dev/src/utils.rs:513-522 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/clippy/clippy_dev/src/utils.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_dev/src/utils.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e2ae90ee769e9d1dde9c6bc79899b02a915054888676ac6cf42c5beb09eb4ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): src/tools/clippy/clippy_lints/src/doc/markdown.rs:133-141 | src/tools/clippy/clippy_lints/src/doc/markdown.rs:163-172 \u2014 both copies are in the same file, so extract the block 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/tools/clippy/clippy_lints/src/doc/markdown.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4f0d2bb6dff83298e8c4317b2c95e33be0022c871c38e7d1a3213c4dda12d1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/tools/clippy/clippy_lints/src/functions/must_use.rs:334-343 | src/tools/clippy/clippy_lints/src/functions/must_use.rs:347-356 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/clippy/clippy_lints/src/functions/must_use.rs:334\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/tools/clippy/clippy_lints/src/functions/must_use.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"525ce7ec7d47f03b3c5030b7670c95020bb49d998fcf74531b1b4043b9f66b17"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/tools/clippy/clippy_lints/src/matches/redundant_guards.rs:30-42 | src/tools/clippy/clippy_lints/src/matches/redundant_guards.rs:49-61 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tools/clippy/clippy_lints/src/matches/redundant_guards.rs:30\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/tools/clippy/clippy_lints/src/matches/redundant_guards.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"98aa8f07940c29914e1989dc85049a7ad0b55a4a1e9ac046d031eee42193ec5f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): src/tools/clippy/clippy_lints/src/non_copy_const.rs:768-777 | src/tools/clippy/clippy_lints/src/non_copy_const.rs:829-837 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tools/clippy/clippy_lints/src/non_copy_const.rs:768\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060item\u0060 to \u0060\u0026\u0027tcx TraitItem\u003C\u0027_\u003E\u0060 in one and \u0060\u0026\u0027tcx ImplItem\u003C\u0027_\u003E\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/tools/clippy/clippy_lints/src/non_copy_const.rs"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"63c02d2816841bf93229d2872c63ef6ebfc822913ed95f760891686b2ebefd72"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): src/tools/clippy/clippy_lints/src/operators/assign_op_pattern.rs:135-154 | src/tools/clippy/clippy_lints/src/operators/assign_op_pattern.rs:161-180 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tools/clippy/clippy_lints/src/operators/assign_op_pattern.rs:135\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/tools/clippy/clippy_lints/src/operators/assign_op_pattern.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d9c83e4c58d122355a7e1d960fa77f563de9dbeb4379318dcf17f6caa209707"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/tools/clippy/clippy_lints/src/operators/manual_div_ceil.rs:30-39 | src/tools/clippy/clippy_lints/src/operators/manual_div_ceil.rs:41-50 \u2014 both copies are in the same file, so extract the block 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/tools/clippy/clippy_lints/src/operators/manual_div_ceil.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"189cfb5f9adae48f141b2b338de55e83d53df1641651697c81b4698f6dace390"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/tools/clippy/clippy_lints/src/ranges.rs:244-253 | src/tools/clippy/clippy_lints/src/ranges.rs:279-288 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/clippy/clippy_lints/src/ranges.rs:244\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/tools/clippy/clippy_lints/src/ranges.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5034f522ff1eed8ea1cac8a875b0bb511f9700572c71e9588ceca2364a1a245"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/tools/clippy/clippy_utils/src/mir/mod.rs:125-134 | src/tools/clippy/clippy_utils/src/mir/mod.rs:140-149 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_utils/src/mir/mod.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"4753214071f16699c7a81b460e2c298e2b970e72f5cd4bed9725433e1b703895"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/tools/clippy/clippy_utils/src/ty/mod.rs:642-651 | src/tools/clippy/clippy_utils/src/ty/mod.rs:656-666 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/clippy/clippy_utils/src/ty/mod.rs:642\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/tools/clippy/clippy_utils/src/ty/mod.rs"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"625b48ab1de7f7943be9531d1d341801041aa83bcab00243dfdb1efd3c10d8e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/tools/compiletest/src/runtest/debuginfo.rs:115-124 | src/tools/compiletest/src/runtest/debuginfo.rs:366-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/compiletest/src/runtest/debuginfo.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec95cdd7478baaec06b692a51d26c042587a0a92ff8f2ab5c1487e96115cf2d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/tools/miri/src/borrow_tracker/stacked_borrows/mod.rs:744-753 | src/tools/miri/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/tools/miri/src/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/tools/miri/src/borrow_tracker/stacked_borrows/mod.rs"},"region":{"startLine":744}}}],"partialFingerprints":{"codehealthFindingId/v1":"918d93f1a2f86ab3e6f9516dbcac28f278eb42d9a76391d418e359b849a81ca5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 2): src/tools/miri/src/borrow_tracker/tree_borrows/tree.rs:540-549 | src/tools/miri/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/tools/miri/src/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/tools/miri/src/borrow_tracker/tree_borrows/tree.rs:646\u0060 calls \u0060Some\u0060 and \u0060src/tools/miri/src/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/tools/miri/src/borrow_tracker/tree_borrows/tree.rs"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"4927aebc988a7b3d9d9905e8f2d52f85f1193b4bbf95ba60a1fef44cd48410bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/tools/miri/src/concurrency/data_race.rs:1325-1334 | src/tools/miri/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/tools/miri/src/concurrency/data_race.rs"},"region":{"startLine":1325}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4d4e539fdd2c8540c9c78134d9a99e9f98b930154a8e1b73d910ef708df1a09"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/tools/miri/src/intrinsics/x86/sse.rs:164-173 | src/tools/miri/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/tools/miri/src/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/tools/miri/src/intrinsics/x86/sse.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b998060660498e450d03ef18377dcd64cf28c0f984f27cbd25e7c611800f64b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/tools/miri/src/shims/alloc.rs:128-137 | src/tools/miri/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/tools/miri/src/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/tools/miri/src/shims/alloc.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"82d09af046d99ccad1077756b1dffcdfcfe410fffe7cd0f33da1affcc6d6780b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/tools/miri/src/shims/alloc.rs:151-160 | src/tools/miri/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/tools/miri/src/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/tools/miri/src/shims/alloc.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6f3a8cd6aa70bca560f3b335ecf6a925a4d145a1e4e5b5e87e28ccac45b764f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/tools/miri/src/shims/os_str.rs:275-284 | src/tools/miri/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/tools/miri/src/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/tools/miri/src/shims/os_str.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"7166748a42818c730e2d02b03ec327d46df94cba1a5a64f17b733857fed6c38e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): src/tools/miri/src/shims/unix/fd.rs:482-491 | src/tools/miri/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/tools/miri/src/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/tools/miri/src/shims/unix/fd.rs"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4e41e5e191a7e6bf8cce11bba44edae06e4a1fc43fbfb712b1367fd00454c24"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/tools/miri/src/shims/unix/macos/foreign_items.rs:314-323 | src/tools/miri/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/tools/miri/src/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/tools/miri/src/shims/unix/macos/foreign_items.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"79f1049f7288f31a0355fad63fa60f5a65f34895f6d78f0f3a84350964e48f80"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/tools/miri/src/shims/unix/mem.rs:145-154 | src/tools/miri/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/tools/miri/src/shims/unix/mem.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"b84b3b189f5f77f8223a51c39445a19be05363abd72f203858487c52cffb5cb9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u201310 lines \u00D7 2): src/tools/miri/src/shims/unix/virtual_socket.rs:591-600 | src/tools/miri/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/tools/miri/src/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/tools/miri/src/shims/unix/virtual_socket.rs"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"745ab7824d239ebe976cb6576e31d8f24644ce77fed2a215f75b2643f27694af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): src/tools/miri/src/shims/windows/fs.rs:584-593 | src/tools/miri/src/shims/windows/fs.rs:689-697 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/miri/src/shims/windows/fs.rs:584\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/tools/miri/src/shims/windows/fs.rs"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"b15e000b3805d357e1be30d4524159eb38cae37bd4ef6bad2cd843d9877d184e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-def/src/attrs.rs:533-542 | src/tools/rust-analyzer/crates/hir-def/src/attrs.rs:544-553 \u2014 both copies are in the same file, so extract the block 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/tools/rust-analyzer/crates/hir-def/src/attrs.rs"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a2c876bed7425e2fa1db7ed2cd703c26fac3f043d5248e37831d10d93f5e7fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-def/src/item_scope.rs:697-706 | src/tools/rust-analyzer/crates/hir-def/src/item_scope.rs:713-722 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/hir-def/src/item_scope.rs:697\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/item_scope.rs"},"region":{"startLine":697}}}],"partialFingerprints":{"codehealthFindingId/v1":"109879d306e03ebea1a48689562f2bfdc9634a00c38a7526947fea76b855142f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-expand/src/builtin/derive_macro.rs:1014-1023 | src/tools/rust-analyzer/crates/hir-expand/src/builtin/derive_macro.rs:1072-1081 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/hir-expand/src/builtin/derive_macro.rs:1014\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/tools/rust-analyzer/crates/hir-expand/src/builtin/derive_macro.rs"},"region":{"startLine":1014}}}],"partialFingerprints":{"codehealthFindingId/v1":"e40c816b398a84bcde985e4f553609c8bcfbf1a987da04754aa550d99952631f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-ide/src/display.rs:1171-1180 | src/tools/rust-analyzer/crates/hir-ide/src/display.rs:1187-1196 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/hir-ide/src/display.rs:1171\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/tools/rust-analyzer/crates/hir-ide/src/display.rs"},"region":{"startLine":1171}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7fef977e6f5c3576b634d5f0e29d0c9547fd6285edf918de251762e2e9c0081"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-ty/src/infer/expr.rs:734-744 | src/tools/rust-analyzer/crates/hir-ty/src/infer/expr.rs:746-757 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/hir-ty/src/infer/expr.rs:734\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/tools/rust-analyzer/crates/hir-ty/src/infer/expr.rs"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"58f75d63ec508e71cd6edf0a0cc9076be77acd1c4af62ade39856025841f22f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-ty/src/lower.rs:1508-1517 | src/tools/rust-analyzer/crates/hir-ty/src/lower.rs:1840-1849 \u2014 both copies are in the same file, so extract the block 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/tools/rust-analyzer/crates/hir-ty/src/lower.rs:1839\u0060 calls \u0060of\u0060 and \u0060src/tools/rust-analyzer/crates/hir-ty/src/lower.rs:1507\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/tools/rust-analyzer/crates/hir-ty/src/lower.rs"},"region":{"startLine":1508}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cd3ec048b2265cee8262b2a2a4eda9fea8b9b874be711cffde44a2cb85ef78d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-ty/src/lower/path.rs:351-371 | src/tools/rust-analyzer/crates/hir-ty/src/lower/path.rs:407-427 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tools/rust-analyzer/crates/hir-ty/src/lower/path.rs:351\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060self\u0060 to \u0060crate) fn resolve_path_in_type_ns(\u0026mut\u0060 in one and \u0060crate) fn resolve_path_in_value_ns( \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/tools/rust-analyzer/crates/hir-ty/src/lower/path.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"46bd8818a15c80fc31feac31eb6c4d207c5596c986832661f31765a8f4f8d04a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/tools/rust-analyzer/crates/ide-assists/src/handlers/add_missing_match_arms.rs:167-177 | src/tools/rust-analyzer/crates/ide-assists/src/handlers/add_missing_match_arms.rs:200-210 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tools/rust-analyzer/crates/ide-assists/src/handlers/add_missing_match_arms.rs:167\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/tools/rust-analyzer/crates/ide-assists/src/handlers/add_missing_match_arms.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"637ebd21f43e08d02f2b7f9599671f03046a276b404dbc809b673d264fa6f706"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 2): src/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_enum_is_method.rs:47-54 | src/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_enum_projection_method.rs:124-133 \u2014 before extracting anything, compare \u0060src/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_enum_is_method.rs\u0060 and \u0060src/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_enum_projection_method.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 62 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_enum_is_method.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"165d883067fdc996495964c05f6b732194e292b8f865aafaee3a5466ce74759f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): src/tools/rust-analyzer/crates/ide-assists/src/utils/gen_trait_fn_body.rs:126-135 | src/tools/rust-analyzer/crates/ide-assists/src/utils/gen_trait_fn_body.rs:330-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/tools/rust-analyzer/crates/ide-assists/src/utils/gen_trait_fn_body.rs:126\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/tools/rust-analyzer/crates/ide-assists/src/utils/gen_trait_fn_body.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0555f7202aed090ac6fb4f8799a2fed6092bd713ab1ad45222cca6b7dd47d77"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u201310 lines \u00D7 2): src/tools/rust-analyzer/crates/ide-completion/src/completions.rs:347-353 | src/tools/rust-analyzer/crates/ide-completion/src/completions.rs:370-379 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tools/rust-analyzer/crates/ide-completion/src/completions.rs:347\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/tools/rust-analyzer/crates/ide-completion/src/completions.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"1db240ef6d795713a09acff7306975250f052c2450fb2f5e8aa7e111911e4772"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/tools/rust-analyzer/crates/ide-completion/src/completions/attribute.rs:90-99 | src/tools/rust-analyzer/crates/ide-completion/src/completions/attribute/derive.rs:21-30 \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/tools/rust-analyzer/crates/ide-completion/src/completions/attribute.rs:90\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/tools/rust-analyzer/crates/ide-completion/src/completions/attribute.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"038d8513388f5a41a76f07e8390cd3c1b36319d235621176ed0293da48c75e64"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 2): src/tools/rust-analyzer/crates/ide-completion/src/completions/dot.rs:46-55 | src/tools/rust-analyzer/crates/ide-completion/src/completions/dot.rs:108-115 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/ide-completion/src/completions/dot.rs:46\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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/tools/rust-analyzer/crates/ide-completion/src/completions/dot.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"781090e8937a26d4c2c5dc42f4c8cbad16c92f866bcda5a9c7c27ac8ec687d5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/tools/rust-analyzer/crates/ide-db/src/syntax_helpers/format_string.rs:131-140 | src/tools/rust-analyzer/crates/ide-db/src/syntax_helpers/format_string.rs:214-223 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/ide-db/src/syntax_helpers/format_string.rs:131\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-db/src/syntax_helpers/format_string.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9d72f3e960da6b69d179e674c2df827fb642279bb4e80af83a6fcb022c24af8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u201310 lines \u00D7 3): src/tools/rust-analyzer/crates/ide/src/hover/render.rs:382-391 | src/tools/rust-analyzer/crates/ide/src/hover/render.rs:400-409 | src/tools/rust-analyzer/crates/ide/src/hover/render.rs:421-424 \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/tools/rust-analyzer/crates/ide/src/hover/render.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. 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/tools/rust-analyzer/crates/ide/src/hover/render.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"33463a2c4988d58c60916c759e265b76b3d36d821a5708980a67bc9d96734735"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): src/tools/rust-analyzer/crates/ide/src/rename.rs:682-690 | src/tools/rust-analyzer/crates/ide/src/rename.rs:695-704 \u2014 both copies are in the same file, so extract the block 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/tools/rust-analyzer/crates/ide/src/rename.rs"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f9dfceacf7272008685a3b44af6849ac4892e970385417d7a4786539dea1a2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/tools/rust-analyzer/crates/ide/src/runnables.rs:382-391 | src/tools/rust-analyzer/crates/ide/src/runnables.rs:473-482 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/ide/src/runnables.rs:382\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/tools/rust-analyzer/crates/ide/src/runnables.rs:380\u0060 calls \u0060from_module_to_decl\u0060, \u0060call_site\u0060 and \u0060src/tools/rust-analyzer/crates/ide/src/runnables.rs:471\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/tools/rust-analyzer/crates/ide/src/runnables.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b1f164149ef5bc05fba9ab2c8d660ee752b90c1d34809401c4ace7d0aeebbce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/tools/rust-analyzer/crates/load-cargo/src/lib.rs:656-665 | src/tools/rust-analyzer/crates/load-cargo/src/lib.rs:703-712 \u2014 both copies are in the same file, so extract the block 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/tools/rust-analyzer/crates/load-cargo/src/lib.rs"},"region":{"startLine":656}}}],"partialFingerprints":{"codehealthFindingId/v1":"22a760c8414a1c8e37b56c212a6fe82defe6e8a2bed6f2026672bb5489c24820"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 2): src/tools/rust-analyzer/crates/proc-macro-srv/src/dylib/proc_macros.rs:38-47 | src/tools/rust-analyzer/crates/proc-macro-srv/src/dylib/proc_macros.rs:49-56 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/proc-macro-srv/src/dylib/proc_macros.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3ca68de99bc9a2e3abb3c7d8eaf80b0991d991cb1baac5a1b72975fb3c622e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): src/tools/rust-analyzer/crates/rust-analyzer/src/cli/lsif.rs:310-318 | src/tools/rust-analyzer/crates/rust-analyzer/src/cli/scip.rs:64-73 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tools/rust-analyzer/crates/rust-analyzer/src/cli/scip.rs:64\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/tools/rust-analyzer/crates/rust-analyzer/src/cli/lsif.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"977c64885abe959cbc4393cbfb84a6f49c9f4358fe8beaf48695354ff3b7910e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/tools/rust-analyzer/crates/syntax-bridge/src/lib.rs:549-558 | src/tools/rust-analyzer/crates/syntax-bridge/src/lib.rs:591-600 \u2014 both copies are in the same file, so extract the block 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/tools/rust-analyzer/crates/syntax-bridge/src/lib.rs"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcf3adb20a2f3c0a7d1896bf1902846f975b0bf8a3ffb621b0307aed86dac30a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/tools/rustfmt/src/types.rs:686-695 | src/tools/rustfmt/src/types.rs:713-722 \u2014 both copies are in the same file, so extract the block 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/tools/rustfmt/src/types.rs"},"region":{"startLine":686}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6a10ffe706cef22d9632a55450d88ba661af15a690626c72cfa4c1eb612a0ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 7): compiler/rustc_next_trait_solver/src/canonical/canonicalizer.rs:394-402 | compiler/rustc_next_trait_solver/src/solve/assembly/mod.rs:818-826 | compiler/rustc_next_trait_solver/src/solve/assembly/mod.rs:965-973 | compiler/rustc_next_trait_solver/src/solve/assembly/structural_traits.rs:392-400 | compiler/rustc_next_trait_solver/src/solve/assembly/structural_traits.rs:575-583 | compiler/rustc_next_trait_solver/src/solve/assembly/structural_traits.rs:749-757 | compiler/rustc_type_ir/src/ty_kind.rs:401-409 \u2014 before extracting anything, compare \u0060compiler/rustc_next_trait_solver/src/solve/assembly/mod.rs\u0060 and \u0060compiler/rustc_type_ir/src/ty_kind.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 36 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060compiler/rustc_next_trait_solver/src/solve/assembly/mod.rs:827\u0060 calls \u0060Pat\u0060 and \u0060compiler/rustc_next_trait_solver/src/canonical/canonicalizer.rs:403\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":"compiler/rustc_next_trait_solver/src/canonical/canonicalizer.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"839f6d09288b6e8514325fc47650ed7d63ca66de6316d975f39ceb733d478436"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 5): library/stdarch/crates/core_arch/src/x86/avx2.rs:2802-2810 | library/stdarch/crates/core_arch/src/x86/avx2.rs:3009-3017 | library/stdarch/crates/core_arch/src/x86/avx512bw.rs:11881-11889 | library/stdarch/crates/core_arch/src/x86/avx512bw.rs:11977-11985 | library/stdarch/crates/core_arch/src/x86/sse2.rs:714-722 \u2014 before extracting anything, compare \u0060library/stdarch/crates/core_arch/src/x86/avx2.rs\u0060 and \u0060library/stdarch/crates/core_arch/src/x86/avx512bw.rs\u0060 as WHOLE FILES: this scan already matched 6 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. 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 \u0060library/stdarch/crates/core_arch/src/x86/avx2.rs:2802\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":"library/stdarch/crates/core_arch/src/x86/avx2.rs"},"region":{"startLine":2802}}}],"partialFingerprints":{"codehealthFindingId/v1":"03c4907e9f16ba083d0bca011982485d5b266eb0482dfcf1b92d5be59c5aebcc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs:72-80 | compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs:122-130 | compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs:149-157 | compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs:180-188 \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 \u0060compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs:72\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"310912f5708bad15f10d5c6ea628eb54151381628800f34932d341964059d28e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): compiler/rustc_macros/src/type_foldable.rs:15-23 | compiler/rustc_macros/src/type_foldable.rs:31-39 | compiler/rustc_type_ir_macros/src/lib.rs:149-157 | compiler/rustc_type_ir_macros/src/lib.rs:171-179 \u2014 there are 4 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_macros/src/type_foldable.rs:15\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":"compiler/rustc_macros/src/type_foldable.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e450c91adb36012e9e2015525e4fbd78719caee3a4850dff1c61c86d49cfaeb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): compiler/rustc_trait_selection/src/traits/project.rs:1398-1407 | compiler/rustc_trait_selection/src/traits/project.rs:1454-1463 | compiler/rustc_trait_selection/src/traits/project.rs:1500-1508 | compiler/rustc_trait_selection/src/traits/project.rs:1545-1553 \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 \u0060compiler/rustc_trait_selection/src/traits/project.rs:1398\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/traits/project.rs"},"region":{"startLine":1398}}}],"partialFingerprints":{"codehealthFindingId/v1":"77050e605ad644a4978ac4c48561722acb90f596fa8bdcd22e62b092437a00e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): library/std/src/sync/nonpoison/rwlock.rs:679-687 | library/std/src/sync/nonpoison/rwlock.rs:904-912 | library/std/src/sync/poison/rwlock.rs:813-821 | library/std/src/sync/poison/rwlock.rs:1039-1047 \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. 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":"library/std/src/sync/nonpoison/rwlock.rs"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"43d4f7df6bb86f9aca54ac42e0de9591a7f92f6d2223f31d94153c070599481b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): library/stdarch/crates/core_arch/src/x86/avx512fp16.rs:11293-11301 | library/stdarch/crates/core_arch/src/x86/avx512fp16.rs:11349-11357 | library/stdarch/crates/core_arch/src/x86/avx512fp16.rs:11403-11411 | library/stdarch/crates/core_arch/src/x86/avx512fp16.rs:11457-11465 \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 \u0060library/stdarch/crates/core_arch/src/x86/avx512fp16.rs:11293\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":"library/stdarch/crates/core_arch/src/x86/avx512fp16.rs"},"region":{"startLine":11293}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd7d82c0c37bf2190b3e1bc5ff58c3eb65ac720567ddcf34e6baa712b01ee548"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): compiler/rustc_codegen_cranelift/src/intrinsics/llvm_x86.rs:447-455 | compiler/rustc_codegen_cranelift/src/intrinsics/llvm_x86.rs:955-963 | compiler/rustc_codegen_cranelift/src/intrinsics/llvm_x86.rs:1356-1364 \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 \u0060compiler/rustc_codegen_cranelift/src/intrinsics/llvm_x86.rs:447\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":"compiler/rustc_codegen_cranelift/src/intrinsics/llvm_x86.rs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"c873a583ad9360e559e1bb94d67644e9d2bec73862b7587b3cf8df94de0c16ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): compiler/rustc_codegen_cranelift/src/intrinsics/llvm_x86.rs:762-770 | compiler/rustc_codegen_cranelift/src/intrinsics/llvm_x86.rs:815-823 | compiler/rustc_codegen_cranelift/src/intrinsics/llvm_x86.rs:1073-1082 \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 \u0060compiler/rustc_codegen_cranelift/src/intrinsics/llvm_x86.rs:762\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":"compiler/rustc_codegen_cranelift/src/intrinsics/llvm_x86.rs"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cddbb241372fc2257ac2141677fad6c2eedb3a7d8f1ef00214d3211517e454e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): compiler/rustc_codegen_gcc/src/intrinsic/llvm.rs:186-194 | compiler/rustc_codegen_gcc/src/intrinsic/llvm.rs:402-410 | compiler/rustc_codegen_gcc/src/intrinsic/llvm.rs:455-463 \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":"compiler/rustc_codegen_gcc/src/intrinsic/llvm.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"51d6552d71cdd8b0dc153098b2bd596b0bda8deb2ccc6451f0fba81ebf61f731"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): library/std/src/os/xous/ffi.rs:259-267 | library/std/src/os/xous/ffi.rs:474-482 | library/std/src/os/xous/ffi.rs:518-526 \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 \u0060library/std/src/os/xous/ffi.rs:259\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":"library/std/src/os/xous/ffi.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"de50fb59787c0c93a41bfac9004a7b45eff86668b2e9ce4a5f667ecf116fa3a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): library/std/src/sys/net/connection/socket/mod.rs:572-580 | library/std/src/sys/net/connection/socket/mod.rs:723-731 | library/std/src/sys/net/connection/socket/mod.rs:966-974 \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":"library/std/src/sys/net/connection/socket/mod.rs"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b3212f7ca37c89aec821529781d647df330dd00a799e0ba5ab40561e5c57d2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): library/std/src/sys/net/connection/uefi/tcp4.rs:170-178 | library/std/src/sys/net/connection/uefi/tcp4.rs:255-263 | library/std/src/sys/net/connection/uefi/tcp4.rs:338-346 \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 \u0060library/std/src/sys/net/connection/uefi/tcp4.rs:170\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":"library/std/src/sys/net/connection/uefi/tcp4.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"67db6a9236e426bf7ae5d393776983331988f9f2a13828107c0d071998a696cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): library/stdarch/crates/core_arch/src/x86/avx512bw.rs:8748-8756 | library/stdarch/crates/core_arch/src/x86/avx512bw.rs:8887-8895 | library/stdarch/crates/core_arch/src/x86/avx512bw.rs:9157-9165 \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 \u0060library/stdarch/crates/core_arch/src/x86/avx512bw.rs:8748\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":"library/stdarch/crates/core_arch/src/x86/avx512bw.rs"},"region":{"startLine":8748}}}],"partialFingerprints":{"codehealthFindingId/v1":"1637d55cf35b278fc49aecf83a37911cee0f37bcc13def3255203d2e2f154e15"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): src/tools/clippy/clippy_dev/src/edit_lints.rs:25-33 | src/tools/clippy/clippy_dev/src/edit_lints.rs:59-67 | src/tools/clippy/clippy_dev/src/edit_lints.rs:110-118 \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/tools/clippy/clippy_dev/src/edit_lints.rs:25\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/tools/clippy/clippy_dev/src/edit_lints.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"962106ebce6c913300dedd6c419357513a1ba92ef9da52934b942b837863a7bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): src/tools/clippy/clippy_lints/src/arbitrary_source_item_ordering.rs:286-295 | src/tools/clippy/clippy_lints/src/arbitrary_source_item_ordering.rs:357-366 | src/tools/clippy/clippy_lints/src/arbitrary_source_item_ordering.rs:453-462 \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/tools/clippy/clippy_lints/src/arbitrary_source_item_ordering.rs:286\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 \u0060cx\u0060 to \u0060\u0026LateContext\u003C\u0027_\u003E\u0060 in one and \u0060\u0026LateContext\u003C\u0027tcx\u003E\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/tools/clippy/clippy_lints/src/arbitrary_source_item_ordering.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eb051ee070f39d94eb4ba1b258d6de1e4fff9d0f19cec62790bb9739f1b8eff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): src/tools/miri/src/intrinsics/aarch64.rs:325-333 | src/tools/miri/src/intrinsics/aarch64.rs:350-358 | src/tools/miri/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/tools/miri/src/intrinsics/aarch64.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e576fd09f78f421a41b9d8bce16b1b257bc3c79ec968d220ce71c9d794a4e6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): src/tools/miri/src/intrinsics/x86/mod.rs:338-347 | src/tools/miri/src/intrinsics/x86/mod.rs:866-875 | src/tools/miri/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/tools/miri/src/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/tools/miri/src/intrinsics/x86/mod.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"c875bc9a5d00c25ca5d8603c4064f88094c733b0199d0bd7f7e239161a2f3c0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): src/tools/rust-analyzer/crates/hir-ty/src/infer.rs:2473-2481 | src/tools/rust-analyzer/crates/hir-ty/src/infer.rs:2514-2522 | src/tools/rust-analyzer/crates/hir-ty/src/infer.rs:2577-2585 \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/tools/rust-analyzer/crates/hir-ty/src/infer.rs:2473\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/tools/rust-analyzer/crates/hir-ty/src/infer.rs"},"region":{"startLine":2473}}}],"partialFingerprints":{"codehealthFindingId/v1":"b29ffdc20f2ca724963f2e57f4b0e93063c5da48c30370d26fdfd30ee55532ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:351-359 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1797-1805 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:2155-2163 \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/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:351\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/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:361\u0060 calls \u0060map_children\u0060, \u0060attrs\u0060, \u0060syntax\u0060 and \u0060src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1807\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/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8e4bbf7a06cc01d801fc264406ec3e9a018a0edf286d1866669717b9de5c1a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): compiler/rustc_ast_lowering/src/format.rs:250-258 | src/tools/rust-analyzer/crates/hir-def/src/expr_store/lower/format_args.rs:462-470 \u2014 before extracting anything, compare \u0060compiler/rustc_ast_lowering/src/format.rs\u0060 and \u0060src/tools/rust-analyzer/crates/hir-def/src/expr_store/lower/format_args.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 96 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 \u0060compiler/rustc_ast_lowering/src/format.rs:250\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":"compiler/rustc_ast_lowering/src/format.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"17baec8f02aca8a98d3a2d9e66c6a9fcf263af6e65880546ea7be81a7294320f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): compiler/rustc_ast_pretty/src/pprust/state/expr.rs:1015-1023 | compiler/rustc_ast_pretty/src/pprust/state/expr.rs:1026-1034 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_ast_pretty/src/pprust/state/expr.rs:1015\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, \u0060compiler/rustc_ast_pretty/src/pprust/state/expr.rs:1025\u0060 calls \u0060push\u0060 and \u0060compiler/rustc_ast_pretty/src/pprust/state/expr.rs:1014\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ast_pretty/src/pprust/state/expr.rs"},"region":{"startLine":1015}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bc44b7c6d7a84020f4f7fa902ad0c0c949f6efeedd8ee18caf3ff262a3dade8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): compiler/rustc_attr_parsing/src/attributes/doc.rs:214-222 | compiler/rustc_attr_parsing/src/attributes/doc.rs:692-700 \u2014 both copies are in the same file, so extract the block 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":"compiler/rustc_attr_parsing/src/attributes/doc.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"29dee4049755e48553e7f53f976b1e9c714df59f669f8257e79488a7565e1eef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): compiler/rustc_builtin_macros/src/asm.rs:81-89 | compiler/rustc_parse/src/parser/asm.rs:260-268 \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 \u0060compiler/rustc_builtin_macros/src/asm.rs:81\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":"compiler/rustc_builtin_macros/src/asm.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"afd2bdeceb03342a6290999d6847237039d4b5349c7669a24b040fde13508adc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): compiler/rustc_builtin_macros/src/format.rs:427-435 | src/tools/rust-analyzer/crates/hir-def/src/hir/format_args.rs:239-246 \u2014 before extracting anything, compare \u0060compiler/rustc_builtin_macros/src/format.rs\u0060 and \u0060src/tools/rust-analyzer/crates/hir-def/src/hir/format_args.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 113 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 \u0060compiler/rustc_builtin_macros/src/format.rs:427\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":"compiler/rustc_builtin_macros/src/format.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad7e685d6e8c348ed9b4996799585c26221c190b7733fe8a5be590b2fc480fbb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): compiler/rustc_codegen_cranelift/src/inline_asm.rs:66-74 | compiler/rustc_codegen_cranelift/src/inline_asm.rs:226-234 \u2014 both copies are in the same file, so extract the block 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":"compiler/rustc_codegen_cranelift/src/inline_asm.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"690ab3efe8491996e965d588b4ebb4c1fee1bd081fad0e50292349df2c216dd7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): compiler/rustc_codegen_cranelift/src/inline_asm.rs:812-825 | compiler/rustc_codegen_cranelift/src/inline_asm.rs:861-874 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_codegen_cranelift/src/inline_asm.rs:812\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":"compiler/rustc_codegen_cranelift/src/inline_asm.rs"},"region":{"startLine":812}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f9a5255cf1613f98d94f6a903b09f5a16f87a7899b3fd35c04ccc4ab4e1e8c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): compiler/rustc_codegen_cranelift/src/intrinsics/llvm_aarch64.rs:1180-1188 | compiler/rustc_codegen_cranelift/src/intrinsics/llvm_aarch64.rs:1205-1213 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_codegen_cranelift/src/intrinsics/llvm_aarch64.rs:1180\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":"compiler/rustc_codegen_cranelift/src/intrinsics/llvm_aarch64.rs"},"region":{"startLine":1180}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8180756c9cc9a4681254ab7284a87b4613ce3c84f28c2453dd8b3731f6ba1de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs:1116-1124 | compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs:1253-1261 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs:1116\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":"compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs"},"region":{"startLine":1116}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3c127100016dcaabc26564328bcdce8d5275b4df45606e50bc170b45f0a9c44"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs:639-647 | compiler/rustc_codegen_cranelift/src/intrinsics/simd.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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs:639\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":"compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6ff0871a7dd657f1cbb22199e4080b93b7d6ac140ea86ddf7c676ced0f14c76"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs:680-688 | compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs:700-708 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs:680\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs"},"region":{"startLine":680}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5f1f5a39559fad5295f0c241378834cc6301ea100d1326ff3d1d1cf38f8ffd2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): compiler/rustc_codegen_cranelift/src/pretty_clif.rs:129-137 | compiler/rustc_codegen_cranelift/src/pretty_clif.rs:148-156 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_codegen_cranelift/src/pretty_clif.rs:129\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":"compiler/rustc_codegen_cranelift/src/pretty_clif.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd737db23c80b4516aa9e1e82d59561834fb227bdbbd4ba90eb6a22511e25e1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): compiler/rustc_codegen_gcc/src/declare.rs:24-32 | compiler/rustc_codegen_gcc/src/declare.rs:76-84 \u2014 both copies are in the same file, so extract the block 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":"compiler/rustc_codegen_gcc/src/declare.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"96f788cff4535516faf19f9d24486ff2cdff19c22eb0c0f0b75d82987dbeef7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): compiler/rustc_codegen_gcc/src/intrinsic/simd.rs:1028-1036 | compiler/rustc_codegen_gcc/src/intrinsic/simd.rs:1147-1155 \u2014 both copies are in the same file, so extract the block 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":"compiler/rustc_codegen_gcc/src/intrinsic/simd.rs"},"region":{"startLine":1028}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebb9f091d2205eceb709c0a95d2c29a1509fafabf62969fd87aac0b1832fe2ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): compiler/rustc_codegen_gcc/src/type_of.rs:36-44 | compiler/rustc_codegen_llvm/src/type_.rs:97-105 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_gcc/src/type_of.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1c53554325c2b6ea633ce029721c5b8f2f3b12e64f0fe10f95034a627afca4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): compiler/rustc_codegen_gcc/src/type_of.rs:48-56 | compiler/rustc_codegen_llvm/src/type_.rs:108-116 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_gcc/src/type_of.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"a530747439b5a85dd15865a840147992ea2aff15beeff9f38e9b45379012ff8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): compiler/rustc_codegen_llvm/src/asm.rs:1253-1261 | compiler/rustc_codegen_llvm/src/asm.rs:1292-1300 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_codegen_llvm/src/asm.rs:1253\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/asm.rs"},"region":{"startLine":1253}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e994425c2765dd8ede3012881abe612cccbf79dff6ef0c1c8c919c032621a01"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): compiler/rustc_codegen_llvm/src/asm.rs:1446-1454 | compiler/rustc_codegen_llvm/src/asm.rs:1485-1493 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_codegen_llvm/src/asm.rs:1446\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/asm.rs"},"region":{"startLine":1446}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea854ffe76d939bb8a708a4e8b2d842eaf6d7df76083acc9a795f9659dbcbdae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): compiler/rustc_codegen_llvm/src/asm.rs:1621-1629 | compiler/rustc_codegen_llvm/src/asm.rs:1660-1668 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_codegen_llvm/src/asm.rs:1621\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/asm.rs"},"region":{"startLine":1621}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e8c0438054ec5aa805c0d082a144bb52d7ada8225ca3d904fe9672cfbda4c32"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): compiler/rustc_codegen_llvm/src/intrinsic.rs:2200-2208 | compiler/rustc_codegen_llvm/src/intrinsic.rs:2252-2260 \u2014 both copies are in the same file, so extract the block 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":"compiler/rustc_codegen_llvm/src/intrinsic.rs"},"region":{"startLine":2200}}}],"partialFingerprints":{"codehealthFindingId/v1":"4db6f46c55c3de3822a1e74fb1e0ba91d5fed186cd1b3cc4680f2ba12effd251"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): compiler/rustc_const_eval/src/const_eval/valtrees.rs:372-380 | compiler/rustc_middle/src/ty/util.rs:1600-1608 \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":"compiler/rustc_const_eval/src/const_eval/valtrees.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"581e1258f225b43ec2ee067b58a7285cd4c6a103fc997414eafcf17af9b8d8f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): compiler/rustc_const_eval/src/util/type_name.rs:56-63 | compiler/rustc_symbol_mangling/src/legacy.rs:270-278 \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 \u0060compiler/rustc_const_eval/src/util/type_name.rs:56\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":"compiler/rustc_const_eval/src/util/type_name.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c4397255b4c34ee1283c9e5d40ee2804be993b44fd8730ea3b67caf9e8a552e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): compiler/rustc_hir/src/def.rs:830-838 | compiler/rustc_hir/src/def.rs:847-854 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_hir/src/def.rs:830\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir/src/def.rs"},"region":{"startLine":830}}}],"partialFingerprints":{"codehealthFindingId/v1":"650cef219426fa2f0400445f74097b0400d83ac050acde4da31bf5787437417c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): compiler/rustc_hir_analysis/src/check/compare_eii.rs:407-415 | compiler/rustc_hir_analysis/src/check/compare_impl_item.rs:1796-1804 \u2014 before extracting anything, compare \u0060compiler/rustc_hir_analysis/src/check/compare_eii.rs\u0060 and \u0060compiler/rustc_hir_analysis/src/check/compare_impl_item.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 56 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 \u0060compiler/rustc_hir_analysis/src/check/compare_eii.rs:407\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":"compiler/rustc_hir_analysis/src/check/compare_eii.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"af89dcf86ca8c6aa3e89c1a00090413cbd42fd775c3491be7f539b37e8e97707"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): compiler/rustc_hir_analysis/src/check/wfcheck.rs:1662-1670 | compiler/rustc_hir_typeck/src/lib.rs:154-162 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/check/wfcheck.rs"},"region":{"startLine":1662}}}],"partialFingerprints":{"codehealthFindingId/v1":"22daf10b2b044b4c69c88965f7a077c633c063cc0e1ff3f3674293d6c4373449"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): compiler/rustc_hir_typeck/src/coercion.rs:616-623 | compiler/rustc_symbol_mangling/src/export.rs:112-120 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/coercion.rs"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"37add4650bce82ee71c13d1404d15b657187e986fc93cdd3d144868a355e2564"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): compiler/rustc_hir_typeck/src/fn_ctxt/adjust_fulfillment_errors.rs:510-518 | compiler/rustc_hir_typeck/src/fn_ctxt/adjust_fulfillment_errors.rs:526-534 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_hir_typeck/src/fn_ctxt/adjust_fulfillment_errors.rs:510\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":"compiler/rustc_hir_typeck/src/fn_ctxt/adjust_fulfillment_errors.rs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"a684dd4a3c8bf277bf48b4055bebb723c93815654c30884b1091484bc266da6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): compiler/rustc_hir_typeck/src/fn_ctxt/checks.rs:2865-2876 | compiler/rustc_hir_typeck/src/fn_ctxt/checks.rs:2894-2906 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_hir_typeck/src/fn_ctxt/checks.rs:2894\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":"compiler/rustc_hir_typeck/src/fn_ctxt/checks.rs"},"region":{"startLine":2865}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fbfefd832fa52ed8874f8f9d48c9e6c844cd8a2c268666df495b85eb80a1ae6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): compiler/rustc_hir_typeck/src/upvar.rs:1033-1040 | src/tools/rust-analyzer/crates/hir-ty/src/infer/closure/analysis.rs:891-899 \u2014 before extracting anything, compare \u0060compiler/rustc_hir_typeck/src/upvar.rs\u0060 and \u0060src/tools/rust-analyzer/crates/hir-ty/src/infer/closure/analysis.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 74 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 \u0060compiler/rustc_hir_typeck/src/upvar.rs:1033\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":"compiler/rustc_hir_typeck/src/upvar.rs"},"region":{"startLine":1033}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb37d2f549423a7b66a4d87ac5f0fd2761a80c51f0632a1eafbf2d670f1b097b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): compiler/rustc_index/src/interval.rs:290-298 | compiler/rustc_index/src/interval.rs:314-322 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_index/src/interval.rs:290\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":"compiler/rustc_index/src/interval.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0b25d4e128270dde37a02d38b65a853a38d370d7bad2794e92498357eacdaea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): compiler/rustc_infer/src/infer/at.rs:406-414 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/at.rs:184-192 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_infer/src/infer/at.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e33d43460f78cd88698795b0afced80e57acbb90eaba215e5e202e050db2085"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): compiler/rustc_infer/src/infer/canonical/instantiate.rs:94-102 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/canonical/instantiate.rs:136-144 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_infer/src/infer/canonical/instantiate.rs:94\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060t\u0060 to \u0060Ty\u003C\u0027tcx\u003E\u0060 in one and \u0060Ty\u003C\u0027db\u003E\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":"compiler/rustc_infer/src/infer/canonical/instantiate.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"accf406f6151efaec5b1bdb97a5be78c97916271e42792bfeb957f0b44d8010f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20139 lines \u00D7 2): compiler/rustc_infer/src/infer/canonical/query_response.rs:591-599 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/canonical/instantiate.rs:496-501 \u2014 before extracting anything, compare \u0060compiler/rustc_infer/src/infer/canonical/query_response.rs\u0060 and \u0060src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/canonical/instantiate.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 41 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 \u0060compiler/rustc_infer/src/infer/canonical/query_response.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. 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":"compiler/rustc_infer/src/infer/canonical/query_response.rs"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"15b8a652d94caa56b009c4d4aeb54a4187d5e29abcaff99c75747bd5341c25b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): compiler/rustc_infer/src/infer/relate/generalize.rs:514-522 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/relate/generalize.rs:453-461 \u2014 before extracting anything, compare \u0060compiler/rustc_infer/src/infer/relate/generalize.rs\u0060 and \u0060src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/relate/generalize.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 73 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 \u0060compiler/rustc_infer/src/infer/relate/generalize.rs:514\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":"compiler/rustc_infer/src/infer/relate/generalize.rs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b617057e264a216189c99c38d29744cef262427372266e66cc196888d97928e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): compiler/rustc_infer/src/infer/relate/type_relating.rs:109-117 | compiler/rustc_type_ir/src/relate/solver_relating.rs:136-144 \u2014 before extracting anything, compare \u0060compiler/rustc_infer/src/infer/relate/type_relating.rs\u0060 and \u0060compiler/rustc_type_ir/src/relate/solver_relating.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 33 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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":"compiler/rustc_infer/src/infer/relate/type_relating.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf8878231852bb90cfe5e6ff02ed095a28b41dc905be763bfbd84b1c7a9c788a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): compiler/rustc_infer/src/infer/snapshot/mod.rs:30-38 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/snapshot/mod.rs:32-40 \u2014 before extracting anything, compare \u0060compiler/rustc_infer/src/infer/snapshot/mod.rs\u0060 and \u0060src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/snapshot/mod.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 48 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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":"compiler/rustc_infer/src/infer/snapshot/mod.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"dceb844da0c77d3867ea1a3fca77c769f5ab0ff1ccadd63d0001ff72759ee49b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): compiler/rustc_interface/src/util.rs:701-709 | compiler/rustc_interface/src/util.rs:732-740 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_interface/src/util.rs:701\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":"compiler/rustc_interface/src/util.rs"},"region":{"startLine":701}}}],"partialFingerprints":{"codehealthFindingId/v1":"eff5d752a042064e85f8ff743a57e46ecb30f60f20b9a103b92944decaf3ffc4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): compiler/rustc_macros/src/symbols.rs:205-212 | compiler/rustc_macros/src/symbols.rs:233-241 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_macros/src/symbols.rs:205\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":"compiler/rustc_macros/src/symbols.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"418f2417cb68edf9014e581a14d26153adc4b3e92087a86c443119006245d89c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): compiler/rustc_metadata/src/rmeta/encoder.rs:1594-1602 | compiler/rustc_metadata/src/rmeta/encoder.rs:1616-1624 \u2014 both copies are in the same file, so extract the block 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":"compiler/rustc_metadata/src/rmeta/encoder.rs"},"region":{"startLine":1594}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eb9265b0994ce88d2ffd161f8286df4d103666c974527b82afd6e512f9c65c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): compiler/rustc_middle/src/mir/interpret/mod.rs:589-596 | compiler/rustc_public/src/mir/alloc.rs:58-66 \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 \u0060compiler/rustc_public/src/mir/alloc.rs:58\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/mir/interpret/mod.rs"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"09fb0ff67eeba77eea35de222c22470ac70cb6b91f11337ad2a89b9ff64df9ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): compiler/rustc_middle/src/query/keys.rs:427-435 | compiler/rustc_middle/src/ty/print/mod.rs:325-333 \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 \u0060compiler/rustc_middle/src/query/keys.rs:427\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":"compiler/rustc_middle/src/query/keys.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b1eb27032f314112c883a91101624197aef9b05805e60a7c7c2ccfda0a2b225"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): compiler/rustc_middle/src/ty/instance.rs:801-809 | compiler/rustc_middle/src/ty/instance.rs:813-821 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_middle/src/ty/instance.rs:801\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":"compiler/rustc_middle/src/ty/instance.rs"},"region":{"startLine":801}}}],"partialFingerprints":{"codehealthFindingId/v1":"a195e488583985dfa5f42117d763aaf01d7841ecccceb7a2f7f6155b8682c278"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): compiler/rustc_mir_build/src/thir/cx/expr.rs:418-426 | compiler/rustc_mir_build/src/thir/cx/expr.rs:546-554 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_mir_build/src/thir/cx/expr.rs:418\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":"compiler/rustc_mir_build/src/thir/cx/expr.rs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8ca08b799bc986ee20eae55799518dcd631847bb9a894cd8e937eca8fd035ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): compiler/rustc_mir_transform/src/check_alignment.rs:71-79 | compiler/rustc_mir_transform/src/check_alignment.rs:126-134 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_mir_transform/src/check_alignment.rs:71\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/check_alignment.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"55eb74bc0c0191752d88d36f9890b3e3c1d65cdac81b2ef73b3c9dad92572bc3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 2): compiler/rustc_mir_transform/src/coroutine/mod.rs:228-235 | compiler/rustc_mir_transform/src/coroutine/mod.rs:300-309 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_mir_transform/src/coroutine/mod.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. 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":"compiler/rustc_mir_transform/src/coroutine/mod.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"8deb2116bf91e76fa552e80110f563c0e5851f03e3ac6886ae93d62894cee1c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): compiler/rustc_mir_transform/src/dataflow_const_prop.rs:531-545 | compiler/rustc_mir_transform/src/jump_threading.rs:429-443 \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 \u0060compiler/rustc_mir_transform/src/dataflow_const_prop.rs:531\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":"compiler/rustc_mir_transform/src/dataflow_const_prop.rs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"86d36e39ded7a8a7aa46f303fc7a39239816e82c2d8a1b47b7b31e71eae58144"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): compiler/rustc_next_trait_solver/src/canonical/mod.rs:466-473 | compiler/rustc_type_ir/src/relate/combine.rs:162-170 \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 \u0060compiler/rustc_next_trait_solver/src/canonical/mod.rs:466\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":"compiler/rustc_next_trait_solver/src/canonical/mod.rs"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeee2e988d3b1f655f5b38b65803732c77d41f2c8fa1e48c95e60c991296b6b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): compiler/rustc_next_trait_solver/src/solve/assembly/mod.rs:835-843 | compiler/rustc_next_trait_solver/src/solve/assembly/mod.rs:982-990 \u2014 both copies are in the same file, so extract the block 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":"compiler/rustc_next_trait_solver/src/solve/assembly/mod.rs"},"region":{"startLine":835}}}],"partialFingerprints":{"codehealthFindingId/v1":"659d8203e8c5e8675c326a37558187bbb3bcf0b83ab38a3cee7ad96b1690f342"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): compiler/rustc_parse/src/parser/asm.rs:121-129 | compiler/rustc_parse/src/parser/asm.rs:135-143 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_parse/src/parser/asm.rs:121\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/asm.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"92db0bd0292feafe587866e4ca9a4aaaeee949e94c3c7bb0ad53fbfc11d6058e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): compiler/rustc_passes/src/check_attr.rs:645-653 | compiler/rustc_passes/src/check_attr.rs:679-687 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_passes/src/check_attr.rs:645\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":"compiler/rustc_passes/src/check_attr.rs"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7f0e2bab77e896112c70ca7f50386b7cb531fe50081e361baf0cfb801130813"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): compiler/rustc_public/src/compiler_interface.rs:225-233 | compiler/rustc_public/src/compiler_interface.rs:239-247 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_public/src/compiler_interface.rs:225\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":"compiler/rustc_public/src/compiler_interface.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"11b62006e87d257846033a775d9231eb1119b35e73b01e20fb06f04ff6d1bd07"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): compiler/rustc_target/src/asm/mod.rs:1158-1169 | compiler/rustc_target/src/asm/mod.rs:1178-1189 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_target/src/asm/mod.rs:1158\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":"compiler/rustc_target/src/asm/mod.rs"},"region":{"startLine":1158}}}],"partialFingerprints":{"codehealthFindingId/v1":"583526d5e66a1189c5ae883e5f18f3e26b374f9408509942ed44fbd7f50b3ed2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): compiler/rustc_trait_selection/src/error_reporting/infer/nice_region_error/placeholder_error.rs:125-133 | compiler/rustc_trait_selection/src/error_reporting/infer/nice_region_error/placeholder_error.rs:141-149 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_trait_selection/src/error_reporting/infer/nice_region_error/placeholder_error.rs:125\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":"compiler/rustc_trait_selection/src/error_reporting/infer/nice_region_error/placeholder_error.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fdca15010923b0ed26522ab2b42461ec1c8b663560137b4af99f2a86bfdcd88"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): compiler/rustc_trait_selection/src/traits/effects.rs:624-633 | compiler/rustc_trait_selection/src/traits/effects.rs:669-677 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_trait_selection/src/traits/effects.rs:624\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/traits/effects.rs"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"62fb72be1afdd44d3a35b17c94d7d7d3e4de401a59dfd3765ea01b1b5a43de82"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): compiler/rustc_type_ir/src/sty/consts.rs:308-316 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/consts.rs:304-312 \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 \u0060compiler/rustc_type_ir/src/sty/consts.rs:308\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":"compiler/rustc_type_ir/src/sty/consts.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcc9a9a9b4f36574358688dd172c59e09318ad2da3565e98a7c7e0b86642be57"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): compiler/rustc_type_ir/src/sty/consts.rs:325-333 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/consts.rs:321-329 \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 \u0060compiler/rustc_type_ir/src/sty/consts.rs:325\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_type_ir/src/sty/consts.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"d957ce9b6b3e7fb743db3243cc71c31f8a41ed9ef372af1cf9049955496d92b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): library/alloc/src/collections/vec_deque/into_iter.rs:81-89 | library/alloc/src/collections/vec_deque/into_iter.rs:204-212 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/alloc/src/collections/vec_deque/into_iter.rs:81\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, \u0060library/alloc/src/collections/vec_deque/into_iter.rs:90\u0060 calls \u0060to_wrapped_index\u0060 and \u0060library/alloc/src/collections/vec_deque/into_iter.rs:213\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":"library/alloc/src/collections/vec_deque/into_iter.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"487dd7fab7c98e69df17017b3ca50fa9dc28c3fd90fb810051170b7a3d16dd6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): library/alloc/src/collections/vec_deque/mod.rs:3634-3646 | library/alloc/src/collections/vec_deque/mod.rs:3717-3725 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/alloc/src/collections/vec_deque/mod.rs:3634\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":"library/alloc/src/collections/vec_deque/mod.rs"},"region":{"startLine":3634}}}],"partialFingerprints":{"codehealthFindingId/v1":"412b90dbf1114bcbad8e950235ba0e51751f19410adec8c7fcdb3c4e96d398b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): library/compiler-builtins/compiler-builtins/src/float/cmp.rs:75-83 | library/compiler-builtins/compiler-builtins/src/float/cmp.rs:124-132 \u2014 both copies are in the same file, so extract the block 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":"library/compiler-builtins/compiler-builtins/src/float/cmp.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"09d925e46596ac296b5a1f87d3accbdc70721c2aa8d99de1a9630bfba38870c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): library/compiler-builtins/compiler-builtins/src/int/specialized_div_rem/delegate.rs:228-236 | library/compiler-builtins/compiler-builtins/src/int/specialized_div_rem/delegate.rs:274-282 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/compiler-builtins/compiler-builtins/src/int/specialized_div_rem/delegate.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":"library/compiler-builtins/compiler-builtins/src/int/specialized_div_rem/delegate.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"91a766dc4eb50446badb35fc11b83fc68e277ec4ebb00ee8bd03b34ec42449d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): library/compiler-builtins/libm/src/math/erf.rs:238-254 | library/compiler-builtins/libm/src/math/erff.rs:149-165 \u2014 before extracting anything, compare \u0060library/compiler-builtins/libm/src/math/erf.rs\u0060 and \u0060library/compiler-builtins/libm/src/math/erff.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 54 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 \u0060library/compiler-builtins/libm/src/math/erf.rs:238\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 \u0060x\u0060 to \u0060f64\u0060 in one and \u0060f32\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":"library/compiler-builtins/libm/src/math/erf.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"7618833d06a336da2764736922eba8cf782edbe511777ba276495d9681cc32b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): library/core/src/slice/raw.rs:130-138 | library/core/src/slice/raw.rs:185-193 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/core/src/slice/raw.rs:130\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":"library/core/src/slice/raw.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"927a35bed78729cb6fb3a4abced6790909f82da2c2bf7da654b09be305744d8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): library/proc_macro/src/bridge/buffer.rs:56-64 | library/proc_macro/src/bridge/buffer.rs:68-76 \u2014 both copies are in the same file, so extract the block 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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060self\u0060 to \u0060super) fn take(\u0026mut\u0060 in one and \u0060super) fn extend_from_slice(\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":"library/proc_macro/src/bridge/buffer.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"06a8d16661c1995bd39209d9d61c2380e0ef783f19945c93896d9ca79f3ec540"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): library/std/src/sys/fs/windows.rs:553-561 | library/std/src/sys/fs/windows.rs:825-833 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/std/src/sys/fs/windows.rs:553\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":"library/std/src/sys/fs/windows.rs"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"848ef75c094e3242ed2ec0231e1efd021328f10672c6c9b252e6b75e7afacca6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): library/std/src/sys/net/connection/xous/tcplistener.rs:90-98 | library/std/src/sys/net/connection/xous/udp.rs:86-95 \u2014 before extracting anything, compare \u0060library/std/src/sys/net/connection/xous/tcplistener.rs\u0060 and \u0060library/std/src/sys/net/connection/xous/udp.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 74 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 \u0060library/std/src/sys/net/connection/xous/tcplistener.rs:90\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":"library/std/src/sys/net/connection/xous/tcplistener.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e3b1bea2c1d4c50fe905025f1bbd630b08ce1189e3f439dfbcbc38268f26436"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28\u201329 lines \u00D7 2): library/std/src/sys/net/connection/xous/tcplistener.rs:138-166 | library/std/src/sys/net/connection/xous/udp.rs:154-181 \u2014 before extracting anything, compare \u0060library/std/src/sys/net/connection/xous/tcplistener.rs\u0060 and \u0060library/std/src/sys/net/connection/xous/udp.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 74 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 \u0060library/std/src/sys/net/connection/xous/tcplistener.rs:138\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/net/connection/xous/tcplistener.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"3961118f0a94c19d45e0d278008bae904daad41b744b6d621dfaec599269948d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): library/std/src/sys/pal/uefi/helpers.rs:143-162 | library/std/src/sys/pal/uefi/helpers.rs:197-216 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/std/src/sys/pal/uefi/helpers.rs:143\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":"library/std/src/sys/pal/uefi/helpers.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"a96264fab49a704554f8abb9f790c7b2a5f7db7a56f0c44880dfe998bf9ab5a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): library/std/src/sys/process/unix/common.rs:500-509 | library/std/src/sys/process/unsupported.rs:140-149 \u2014 before extracting anything, compare \u0060library/std/src/sys/process/unix/common.rs\u0060 and \u0060library/std/src/sys/process/unsupported.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 46 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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 \u0060library/std/src/sys/process/unix/common.rs:500\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":"library/std/src/sys/process/unix/common.rs"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d0f5e618d8685e74d4e33be36df2a907ebde394315a46e87daa607197da08d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): library/std/src/sys/process/unix/common.rs:521-529 | library/std/src/sys/process/unsupported.rs:151-159 \u2014 before extracting anything, compare \u0060library/std/src/sys/process/unix/common.rs\u0060 and \u0060library/std/src/sys/process/unsupported.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 46 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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":"library/std/src/sys/process/unix/common.rs"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"23ab3afb98f68e1da937a9464e122a98c0530a5b375b7444cff2f9e94624442a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): library/std/src/sys/process/unix/unix.rs:1062-1070 | library/std/src/sys/process/unix/vxworks.rs:194-202 \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 \u0060library/std/src/sys/process/unix/unix.rs:1062\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":"library/std/src/sys/process/unix/unix.rs"},"region":{"startLine":1062}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca6373536c265aa0568215e0314dca1547a788aea1d3c2f6ce069626ba4a44a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): library/std_detect/src/detect/os/freebsd/auxvec.rs:50-63 | library/std_detect/src/detect/os/openbsd/auxvec.rs:46-54 \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 \u0060library/std_detect/src/detect/os/freebsd/auxvec.rs:50\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":"library/std_detect/src/detect/os/freebsd/auxvec.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"e01fb3d6f04d6a53a0cda63038cd03ea93330299126feb5f161db27cd3259aaf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20139 lines \u00D7 4): library/stdarch/crates/core_arch/src/x86/avx.rs:160-168 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:22834-22837 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:24633-24636 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:24783-24791 \u2014 before extracting anything, compare \u0060library/stdarch/crates/core_arch/src/x86/avx.rs\u0060 and \u0060library/stdarch/crates/core_arch/src/x86/avx512f.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 50 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 \u0060library/stdarch/crates/core_arch/src/x86/avx.rs:160\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":"library/stdarch/crates/core_arch/src/x86/avx.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"a111c118ba9fd1308fdac9f1b029c3cbe51ff68175319f9d4ad2dca7dd3a99fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): library/stdarch/crates/core_arch/src/x86/avx2.rs:2534-2542 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:24638-24646 \u2014 before extracting anything, compare \u0060library/stdarch/crates/core_arch/src/x86/avx2.rs\u0060 and \u0060library/stdarch/crates/core_arch/src/x86/avx512f.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 53 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 \u0060library/stdarch/crates/core_arch/src/x86/avx2.rs:2534\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":"library/stdarch/crates/core_arch/src/x86/avx2.rs"},"region":{"startLine":2534}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad5a72f66cb27fdc973e249eecada3f267ce94b1331f045d66a2327ba589f9a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): library/stdarch/crates/core_arch/src/x86/avx2.rs:2995-3003 | library/stdarch/crates/core_arch/src/x86/avx512bw.rs:11963-11971 \u2014 before extracting anything, compare \u0060library/stdarch/crates/core_arch/src/x86/avx2.rs\u0060 and \u0060library/stdarch/crates/core_arch/src/x86/avx512bw.rs\u0060 as WHOLE FILES: this scan already matched 6 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. 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":"library/stdarch/crates/core_arch/src/x86/avx2.rs"},"region":{"startLine":2995}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6ad7c1883bbeac0cd72eccc3c3b5d9e29a80fcdd78de5d5d565de4f4cec09f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): library/stdarch/crates/core_arch/src/x86/avx2.rs:3468-3476 | library/stdarch/crates/core_arch/src/x86/avx2.rs:3519-3527 \u2014 both copies are in the same file, so extract the block 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":"library/stdarch/crates/core_arch/src/x86/avx2.rs"},"region":{"startLine":3468}}}],"partialFingerprints":{"codehealthFindingId/v1":"7230674663150e2392239f7727bccfa9a915f2ff6ee66ba6312e7a244b130707"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): library/stdarch/crates/core_arch/src/x86/avx512f.rs:39703-39711 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:39726-39734 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/stdarch/crates/core_arch/src/x86/avx512f.rs:39703\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":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":39703}}}],"partialFingerprints":{"codehealthFindingId/v1":"fccf00bdc682ea78bf1e294290fd096423637ef59b521368f99a99333fcd86b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): library/stdarch/crates/core_arch/src/x86/avx512f.rs:39770-39778 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:39793-39801 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/stdarch/crates/core_arch/src/x86/avx512f.rs:39770\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":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":39770}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b2276dba54b5e8a81a0ce307a1d2575acd4b67c78e621abfa4c35ce9f3d65fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): library/stdarch/crates/core_arch/src/x86/avx512f.rs:42393-42401 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:42429-42437 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/stdarch/crates/core_arch/src/x86/avx512f.rs:42393\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":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":42393}}}],"partialFingerprints":{"codehealthFindingId/v1":"97bf2ea03b75afe583eb74c12dee3f06882211295d2f7f9820d9ea0e253db192"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): library/stdarch/crates/core_arch/src/x86/avx512f.rs:42527-42535 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:42563-42571 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/stdarch/crates/core_arch/src/x86/avx512f.rs:42527\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":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":42527}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f58cc34f549a45cd543346a78088ae89bdaece45453e440761d32f74583ee8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): library/stdarch/crates/core_arch/src/x86/avx512fp16.rs:5671-5679 | library/stdarch/crates/core_arch/src/x86/avx512fp16.rs:5708-5716 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/stdarch/crates/core_arch/src/x86/avx512fp16.rs:5671\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":"library/stdarch/crates/core_arch/src/x86/avx512fp16.rs"},"region":{"startLine":5671}}}],"partialFingerprints":{"codehealthFindingId/v1":"7144d5983dc2f1b13f4a6a64b097950e28429d32a09f1c05233b33edcac8cba1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): library/stdarch/crates/intrinsic-test/src/arm/mod.rs:66-74 | library/stdarch/crates/intrinsic-test/src/x86/mod.rs:84-91 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/intrinsic-test/src/arm/mod.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f73737255758cd26dbae604391fee90d95abaf4fffa441c4f7dd22745172a03"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): library/stdarch/crates/stdarch-gen-hexagon/src/hvx.rs:330-337 | library/stdarch/crates/stdarch-gen-hexagon/src/scalar.rs:255-263 \u2014 before extracting anything, compare \u0060library/stdarch/crates/stdarch-gen-hexagon/src/hvx.rs\u0060 and \u0060library/stdarch/crates/stdarch-gen-hexagon/src/scalar.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 55 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 \u0060library/stdarch/crates/stdarch-gen-hexagon/src/hvx.rs:330\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":"library/stdarch/crates/stdarch-gen-hexagon/src/hvx.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"1824e450d780e27d15c1cb9ae6eb28331516772eaa09f3fe7806e68b7157173b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): library/stdarch/crates/stdarch-gen-hexagon/src/hvx.rs:893-901 | library/stdarch/crates/stdarch-gen-hexagon/src/hvx.rs:1050-1058 \u2014 both copies are in the same file, so extract the block 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":"library/stdarch/crates/stdarch-gen-hexagon/src/hvx.rs"},"region":{"startLine":893}}}],"partialFingerprints":{"codehealthFindingId/v1":"d10662de6c39248cb0efe6ebd3599cedf2d715bb2a744bb22c34ca54dc10ee26"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): library/stdarch/crates/stdarch-gen-loongarch/src/main.rs:156-164 | library/stdarch/crates/stdarch-gen-loongarch/src/main.rs:622-630 \u2014 both copies are in the same file, so extract the block 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":"library/stdarch/crates/stdarch-gen-loongarch/src/main.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"b16cf5192989c212ae56c3c04edc3479571839c90350112108d61ead041c6143"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): library/stdarch/crates/stdarch-gen-loongarch/src/main.rs:1134-1142 | library/stdarch/crates/stdarch-gen-loongarch/src/main.rs:1186-1194 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/stdarch/crates/stdarch-gen-loongarch/src/main.rs:1134\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":"library/stdarch/crates/stdarch-gen-loongarch/src/main.rs"},"region":{"startLine":1134}}}],"partialFingerprints":{"codehealthFindingId/v1":"63be8df05a09686595bfd68dfb7d9aa3a4c49c0a6457552dbd84aca59aa24ffd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): library/stdarch/crates/stdarch-gen-loongarch/src/main.rs:1147-1155 | library/stdarch/crates/stdarch-gen-loongarch/src/main.rs:1199-1207 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/stdarch/crates/stdarch-gen-loongarch/src/main.rs:1147\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":"library/stdarch/crates/stdarch-gen-loongarch/src/main.rs"},"region":{"startLine":1147}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce1b86a6efe21afd378adc071bef4d3a2a55073b29f065698e69a61cd385ea12"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): library/stdarch/crates/stdarch-gen-loongarch/src/main.rs:1160-1168 | library/stdarch/crates/stdarch-gen-loongarch/src/main.rs:1212-1220 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/stdarch/crates/stdarch-gen-loongarch/src/main.rs:1160\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":"library/stdarch/crates/stdarch-gen-loongarch/src/main.rs"},"region":{"startLine":1160}}}],"partialFingerprints":{"codehealthFindingId/v1":"54c5c0cae8ff2bfd44b97cce037fbf1a6017208978ada50641d52e9ace61d7cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/bootstrap/src/core/download.rs:321-329 | src/bootstrap/src/core/download.rs:425-433 \u2014 both copies are in the same file, so extract the block 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/bootstrap/src/core/download.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd249b1ea260507074525976738bdc8c06584456e7c3936b065226cea85a46be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): src/librustdoc/html/markdown.rs:1901-1910 | src/librustdoc/passes/lint/redundant_explicit_links.rs:544-554 \u2014 before extracting anything, compare \u0060src/librustdoc/html/markdown.rs\u0060 and \u0060src/librustdoc/passes/lint/redundant_explicit_links.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 38 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/librustdoc/html/markdown.rs:1901\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/librustdoc/html/markdown.rs"},"region":{"startLine":1901}}}],"partialFingerprints":{"codehealthFindingId/v1":"9849cfd4ce71466f26e584dce10ee737b2e5cb01473397357e6de9071a53cb2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/librustdoc/html/render/mod.rs:1193-1201 | src/librustdoc/html/render/print_item.rs:577-585 \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 after the matched lines, \u0060src/librustdoc/html/render/print_item.rs:587\u0060 calls \u0060wrap_item\u0060, \u0060render_attributes_in_code\u0060 and \u0060src/librustdoc/html/render/mod.rs:1203\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/librustdoc/html/render/mod.rs"},"region":{"startLine":1193}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2c9424d497bbfcbe31b5728af5b421c5977d7949806cc06407b313d0c22052f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/tools/clippy/clippy_dev/src/edit_lints.rs:36-44 | src/tools/clippy/clippy_dev/src/edit_lints.rs:70-78 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/clippy/clippy_dev/src/edit_lints.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/tools/clippy/clippy_dev/src/edit_lints.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f3b47ff33b183d8e7c2955d961220505985434ef6aa32d1c2ddb3403b2a5c79"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/tools/clippy/clippy_lints/src/booleans.rs:170-178 | src/tools/clippy/clippy_lints/src/booleans.rs:180-188 \u2014 both copies are in the same file, so extract the block 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/tools/clippy/clippy_lints/src/booleans.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"533022d6f4b2870db94449fefcc2e547cdcd02ca17ceb5a2436e340858cb5ca0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/tools/clippy/clippy_lints/src/empty_with_brackets.rs:306-314 | src/tools/clippy/clippy_lints/src/empty_with_brackets.rs:327-335 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/clippy/clippy_lints/src/empty_with_brackets.rs:306\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/tools/clippy/clippy_lints/src/empty_with_brackets.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"878b85b87bb0834852887a2d1351839b32de2aef2e765f590535402e96948d15"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/tools/clippy/clippy_lints/src/lifetimes.rs:729-737 | src/tools/clippy/clippy_lints/src/lifetimes.rs:750-758 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/clippy/clippy_lints/src/lifetimes.rs:729\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/tools/clippy/clippy_lints/src/lifetimes.rs"},"region":{"startLine":729}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b25ef4677dad7a69854f9d7edf59a7fc3050527885b5a56074179fd8bf4b66a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/tools/clippy/clippy_lints/src/macro_use.rs:176-184 | src/tools/clippy/clippy_lints/src/macro_use.rs:188-196 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/macro_use.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd7331f35073efad4aa9f6fb10b9fa5416486b4db3ad183a83b47b812991288b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/tools/clippy/clippy_lints/src/matches/match_same_arms.rs:289-297 | src/tools/clippy/clippy_lints/src/matches/match_same_arms.rs:313-321 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/clippy/clippy_lints/src/matches/match_same_arms.rs:289\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/matches/match_same_arms.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"b58fbeb8253cc0b772b7554afc9ca35476d86b17ebe2021c91f61939a002aa95"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/tools/clippy/clippy_lints/src/methods/map_unwrap_or.rs:192-201 | src/tools/clippy/clippy_lints/src/option_if_let_else.rs:297-306 \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/tools/clippy/clippy_lints/src/methods/map_unwrap_or.rs:192\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060expr\u0060 to \u0060\u0026\u0027tcx rustc_hir::Expr\u003C\u0027_\u003E\u0060 in one and \u0060\u0026\u0027tcx Expr\u003C\u0027_\u003E\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/tools/clippy/clippy_lints/src/methods/map_unwrap_or.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"53bc8551a724bf6742cb5185a67a83aceb38a5de95f08fc060c5cdfa1f12a8fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/tools/clippy/clippy_lints/src/misc.rs:185-193 | src/tools/clippy/clippy_lints/src/misc.rs:196-204 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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/tools/clippy/clippy_lints/src/misc.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"43e7fbd490d5650ef3a46348a2fc02d4b075cc0a190b1d7c99eb0fbf5a856c32"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/tools/clippy/clippy_lints/src/missing_asserts_for_indexing.rs:242-250 | src/tools/clippy/clippy_lints/src/missing_asserts_for_indexing.rs:305-313 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/clippy/clippy_lints/src/missing_asserts_for_indexing.rs:242\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/tools/clippy/clippy_lints/src/missing_asserts_for_indexing.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"6106a77424cdfa54ebb9dd0e510f033c8b5bdd3e40c597b88c48a385f8392d12"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/tools/clippy/clippy_lints/src/operators/op_ref.rs:113-123 | src/tools/clippy/clippy_lints/src/operators/op_ref.rs:146-156 \u2014 both copies are in the same file, so extract the block 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/tools/clippy/clippy_lints/src/operators/op_ref.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccbbc98eee580160a33fb2a24a43b2d2a03c1b92f4da5436007de1f2b19c77ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/tools/clippy/clippy_utils/src/ty/mod.rs:850-858 | src/tools/clippy/clippy_utils/src/ty/mod.rs:891-899 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/clippy/clippy_utils/src/ty/mod.rs:850\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/tools/clippy/clippy_utils/src/ty/mod.rs"},"region":{"startLine":850}}}],"partialFingerprints":{"codehealthFindingId/v1":"28a25e10f18ba270548c5aaba77bd9737792f8d035213ad463e36ec17b852f28"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/tools/jsondocck/src/directive.rs:259-267 | src/tools/jsondocck/src/directive.rs:342-350 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/jsondocck/src/directive.rs:259\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/tools/jsondocck/src/directive.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"6606a9688327f47b7c7e494006febe92ff611cf4b97d6a9834ce922d3072abd7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/tools/miri/src/intrinsics/x86/mod.rs:262-270 | src/tools/miri/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/tools/miri/src/intrinsics/x86/mod.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"4724ee4d9f8eb25b3475d32c06c9dc88bad051756004bc5460d5d77ba5ff282b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/tools/miri/src/intrinsics/x86/sha.rs:77-85 | src/tools/miri/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/tools/miri/src/intrinsics/x86/sha.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"8db7cf66a7f487973b75fbcb453dd91fc0011e3e08eb47f5f60d1060e9e593d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): src/tools/miri/src/shims/unix/android/foreign_items.rs:36-58 | src/tools/miri/src/shims/unix/linux/foreign_items.rs:73-95 \u2014 \u0060src/tools/miri/src/shims/unix/android/foreign_items.rs\u0060 and \u0060src/tools/miri/src/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/tools/miri/src/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/tools/miri/src/shims/unix/android/foreign_items.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"213224b8e74f0db6b2073fc4b535dee18c600fc9fcf5b9233aa810167055a731"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): src/tools/miri/src/shims/unix/socket.rs:502-509 | src/tools/miri/src/shims/unix/socket.rs:606-614 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/miri/src/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. 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/tools/miri/src/shims/unix/socket.rs"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ce8573b89056331383ec8d579bf489f4168c03f304059d960e47026904fa5f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/tools/miri/src/shims/unix/socket.rs:531-539 | src/tools/miri/src/shims/unix/socket.rs:616-624 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tools/miri/src/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/tools/miri/src/shims/unix/socket.rs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f0a9e500d4dbb014d27bbc8ee361f46c1a03e6ce0a19c8a59d30ea62692cf0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/tools/miri/src/shims/windows/foreign_items.rs:602-610 | src/tools/miri/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/tools/miri/src/shims/windows/foreign_items.rs"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"054007441bdce16bc33bad5a18b765bf750232706e714709c05783fcdf0a0ffc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-def/src/attrs.rs:661-669 | src/tools/rust-analyzer/crates/hir-def/src/attrs.rs:673-681 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/attrs.rs"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"50e40d5ff6d7a5c2fac9ef2a23b19f7f5f20fe479a018cd7e748b130f64a5398"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-def/src/attrs.rs:1289-1297 | src/tools/rust-analyzer/crates/hir-def/src/attrs.rs:1310-1317 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/hir-def/src/attrs.rs:1289\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/tools/rust-analyzer/crates/hir-def/src/attrs.rs"},"region":{"startLine":1289}}}],"partialFingerprints":{"codehealthFindingId/v1":"15efc801fe8f9ff0076b75ccce2a10f0cdd36c912e9693ad79f396488836ec9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-def/src/expr_store/lower.rs:1142-1150 | src/tools/rust-analyzer/crates/hir-def/src/expr_store/lower.rs:1186-1194 \u2014 both copies are in the same file, so extract the block 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/tools/rust-analyzer/crates/hir-def/src/expr_store/lower.rs"},"region":{"startLine":1142}}}],"partialFingerprints":{"codehealthFindingId/v1":"d55865ffd17198060adb40072f7efe0ec8ae2bdee7033707c85de5a4499d926c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-def/src/expr_store/lower.rs:2753-2761 | src/tools/rust-analyzer/crates/hir-def/src/expr_store/lower.rs:2766-2774 \u2014 both copies are in the same file, so extract the block 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/tools/rust-analyzer/crates/hir-def/src/expr_store/lower.rs"},"region":{"startLine":2753}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2711ef478b142e01cf12da1742150f119eb094f4ffc1d4fe40d70ab11a7c899"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-def/src/import_map.rs:250-258 | src/tools/rust-analyzer/crates/hir-def/src/import_map.rs:296-304 \u2014 both copies are in the same file, so extract the block 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/tools/rust-analyzer/crates/hir-def/src/import_map.rs:295\u0060 calls \u0060for_trait_item\u0060 and \u0060src/tools/rust-analyzer/crates/hir-def/src/import_map.rs:249\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/tools/rust-analyzer/crates/hir-def/src/import_map.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"da9ac91cb21efdfbcdc142a66abd76270c5e4ebeaa13510c27601f24afcf4bb3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-def/src/nameres/path_resolution.rs:269-277 | src/tools/rust-analyzer/crates/hir-def/src/nameres/path_resolution.rs:384-392 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tools/rust-analyzer/crates/hir-def/src/nameres/path_resolution.rs:269\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/tools/rust-analyzer/crates/hir-def/src/nameres/path_resolution.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0e034059b28b7d1aae8623070549158f694976c9f0ca25c6cc18ad94ebd5b2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-def/src/src.rs:155-163 | src/tools/rust-analyzer/crates/hir-def/src/src.rs:170-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/tools/rust-analyzer/crates/hir-def/src/src.rs:155\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/tools/rust-analyzer/crates/hir-def/src/src.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"afd437c42dff9d1d716e83c621ca01d74fc8da68696376f9e34fd9ed8f980908"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-expand/src/builtin/fn_macro.rs:880-888 | src/tools/rust-analyzer/crates/hir-expand/src/builtin/fn_macro.rs:956-964 \u2014 both copies are in the same file, so extract the block 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/tools/rust-analyzer/crates/hir-expand/src/builtin/fn_macro.rs"},"region":{"startLine":880}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9e35b478c8984641e744618d903c0055cc4c1119333b0042079368231cffbba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-ide/src/display.rs:849-857 | src/tools/rust-analyzer/crates/hir-ide/src/display.rs:1122-1130 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/hir-ide/src/display.rs:849\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/tools/rust-analyzer/crates/hir-ide/src/display.rs"},"region":{"startLine":849}}}],"partialFingerprints":{"codehealthFindingId/v1":"2277fa6dd179afbca8b407e85488dc77b3f3d9ddeb9fad4e4de81e48537cb74e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-ide/src/display.rs:868-876 | src/tools/rust-analyzer/crates/hir-ide/src/display.rs:1141-1149 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/hir-ide/src/display.rs:868\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ide/src/display.rs"},"region":{"startLine":868}}}],"partialFingerprints":{"codehealthFindingId/v1":"a00efac13c5695c65630ea53097d877157aab61775fa967f83cfc74ec77a2886"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20139 lines \u00D7 3): src/tools/rust-analyzer/crates/hir-ide/src/display.rs:890-893 | src/tools/rust-analyzer/crates/hir-ide/src/display.rs:925-933 | src/tools/rust-analyzer/crates/hir-ide/src/display.rs:955-963 \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/tools/rust-analyzer/crates/hir-ide/src/display.rs:925\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ide/src/display.rs"},"region":{"startLine":890}}}],"partialFingerprints":{"codehealthFindingId/v1":"aefc617f32b608955ace66713be5861fe23bf4e1ebd4ef12dfeae25231322a92"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-ty/src/consteval.rs:210-218 | src/tools/rust-analyzer/crates/hir-ty/src/consteval.rs:248-256 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/hir-ty/src/consteval.rs:210\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/consteval.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8564d97676567b6a22b8ac5221cf6f0a6379b8689fa1b07a3c7cca06e1b6739"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-ty/src/infer.rs:1540-1548 | src/tools/rust-analyzer/crates/hir-ty/src/infer.rs:1554-1562 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/hir-ty/src/infer.rs:1540\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/tools/rust-analyzer/crates/hir-ty/src/infer.rs"},"region":{"startLine":1540}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1be5003b2e9a0892789a7be97d5ab35a380f622583f9a72d5d860af06d422b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-ty/src/infer/closure/analysis.rs:1228-1236 | src/tools/rust-analyzer/crates/hir-ty/src/infer/closure/analysis.rs:1243-1251 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/hir-ty/src/infer/closure/analysis.rs:1228\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/tools/rust-analyzer/crates/hir-ty/src/infer/closure/analysis.rs"},"region":{"startLine":1228}}}],"partialFingerprints":{"codehealthFindingId/v1":"90cd3b66e07b823e92e6a9ba8cf12e785595d934c134e1487e1dbf84ac69b207"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-ty/src/lower.rs:1506-1514 | src/tools/rust-analyzer/crates/hir-ty/src/lower.rs:2285-2293 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/hir-ty/src/lower.rs:1506\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/tools/rust-analyzer/crates/hir-ty/src/lower.rs"},"region":{"startLine":1506}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1215242d464df39eb0d9cb7d484bc87b3d2d3ab295d568b500da3f9162d2419"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-ty/src/next_solver/def_id.rs:252-260 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/def_id.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/tools/rust-analyzer/crates/hir-ty/src/next_solver/def_id.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"a564510eed076e13003a3b2b93ea3c29b71a37f402dd84a6616a601d5c23dd1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/tools/rust-analyzer/crates/hir/src/semantics.rs:2617-2625 | src/tools/rust-analyzer/crates/hir/src/semantics.rs:2629-2637 \u2014 both copies are in the same file, so extract the block 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/tools/rust-analyzer/crates/hir/src/semantics.rs"},"region":{"startLine":2617}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b0200bf11e8437ab5e3649609c04cebe1e1ac05981be34762e9489dd0a4815c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/tools/rust-analyzer/crates/hir/src/semantics/source_to_def.rs:675-683 | src/tools/rust-analyzer/crates/hir/src/semantics/source_to_def.rs:686-694 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/hir/src/semantics/source_to_def.rs:675\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir/src/semantics/source_to_def.rs"},"region":{"startLine":675}}}],"partialFingerprints":{"codehealthFindingId/v1":"87083b5045145888470cfa82bfabdd22b029caf6e9499a7230c84008665a52a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/tools/rust-analyzer/crates/hir/src/symbols.rs:290-298 | src/tools/rust-analyzer/crates/hir/src/symbols.rs:331-339 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/hir/src/symbols.rs:290\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir/src/symbols.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f9ca3cfc2c118f1d867e87722d19156dbc50a08da417fb21b02beae53782f28"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/tools/rust-analyzer/crates/hir/src/term_search/tactics.rs:170-178 | src/tools/rust-analyzer/crates/hir/src/term_search/tactics.rs:216-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tools/rust-analyzer/crates/hir/src/term_search/tactics.rs:170\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir/src/term_search/tactics.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"3612c1c35b89ddbb6a2f55fbeb7016cf6993e52d8736f8439ec9757fc082983c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): src/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_closure_to_fn.rs:428-436 | src/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_closure_to_fn.rs:438-445 \u2014 both copies are in the same file, so extract the block 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/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_closure_to_fn.rs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f093dfe51433d1f4a674d5b265bbe0ce3bea94ae878cc39cc1b326ec13f271a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_for_to_while_let.rs:37-46 | src/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_iter_for_each_to_for.rs:103-112 \u2014 before extracting anything, compare \u0060src/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_for_to_while_let.rs\u0060 and \u0060src/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_iter_for_each_to_for.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 48 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_for_to_while_let.rs:37\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_for_to_while_let.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcc2c1d466424a99e5f80989eb422d6c08ce83a6d1e3e0e6e0f7470982427b41"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 2): src/tools/rust-analyzer/crates/ide-assists/src/handlers/destructure_struct_binding.rs:230-238 | src/tools/rust-analyzer/crates/ide-assists/src/handlers/destructure_tuple_binding.rs:135-141 \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/tools/rust-analyzer/crates/ide-assists/src/handlers/destructure_struct_binding.rs:230\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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/tools/rust-analyzer/crates/ide-assists/src/handlers/destructure_struct_binding.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfeed3079d5cf8ae4aee1d5c467a639d51278f72f3ee469f01ab5e28f0b86b78"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_delegate_trait.rs:285-294 | src/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_delegate_trait.rs:395-403 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_delegate_trait.rs:285\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/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_delegate_trait.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"530c24cfaeab4ce0c2ccd2419ca68b50dbfa0ecd9acd69748f53198888b8c213"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_impl.rs:49-57 | src/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_impl.rs:97-105 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_impl.rs:49\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/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_impl.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"9075bd7bcaa12d513d7ad07ebe8aab39558e78c6550351ffbf635c7cfcab2a65"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/tools/rust-analyzer/crates/ide-assists/src/handlers/introduce_named_lifetime.rs:138-146 | src/tools/rust-analyzer/crates/ide-assists/src/handlers/introduce_named_lifetime.rs:197-205 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/ide-assists/src/handlers/introduce_named_lifetime.rs:138\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/tools/rust-analyzer/crates/ide-assists/src/handlers/introduce_named_lifetime.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"dda93eeec672d5a8ab938a1adaafd3677fced6f473c745048b61f12e50257e46"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/tools/rust-analyzer/crates/ide-assists/src/handlers/move_from_mod_rs.rs:31-39 | src/tools/rust-analyzer/crates/ide-assists/src/handlers/move_to_mod_rs.rs:31-39 \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/tools/rust-analyzer/crates/ide-assists/src/handlers/move_from_mod_rs.rs:31\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/tools/rust-analyzer/crates/ide-assists/src/handlers/move_from_mod_rs.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c708bc3b2ab9d4085aee2a8201da1e2d6c297b456444d775716e5bfb7966568"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/tools/rust-analyzer/crates/ide-assists/src/handlers/replace_method_eager_lazy.rs:32-40 | src/tools/rust-analyzer/crates/ide-assists/src/handlers/replace_method_eager_lazy.rs:142-150 \u2014 both copies are in the same file, so extract the block 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/tools/rust-analyzer/crates/ide-assists/src/handlers/replace_method_eager_lazy.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d047ebb946ee6981118ffd1d37767f275c955510c8bd9468387dd3a6d55508d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/tools/rust-analyzer/crates/ide-assists/src/utils/gen_trait_fn_body.rs:601-609 | src/tools/rust-analyzer/crates/ide-assists/src/utils/gen_trait_fn_body.rs:694-702 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/ide-assists/src/utils/gen_trait_fn_body.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/tools/rust-analyzer/crates/ide-assists/src/utils/gen_trait_fn_body.rs"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eb99309d3fcf4bb374111e5a30b6c576fb1db88990186343e4bdf03e86c99fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/tools/rust-analyzer/crates/ide-db/src/imports/import_assets.rs:377-385 | src/tools/rust-analyzer/crates/ide-db/src/imports/import_assets.rs:392-400 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/ide-db/src/imports/import_assets.rs:377\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/tools/rust-analyzer/crates/ide-db/src/imports/import_assets.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"919dbb50e85156eb7805381616b78e0513b97582be1bf1379da928ab8c1d928f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/tools/rust-analyzer/crates/ide-db/src/syntax_helpers/node_ext.rs:378-386 | src/tools/rust-analyzer/crates/ide-db/src/syntax_helpers/node_ext.rs:406-414 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/ide-db/src/syntax_helpers/node_ext.rs:378\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/tools/rust-analyzer/crates/ide-db/src/syntax_helpers/node_ext.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"e01395eaee4971a30c7dc1363d012ffa434d94ff6bd4063c9a687ffa2909654e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/tools/rust-analyzer/crates/ide/src/highlight_related.rs:134-142 | src/tools/rust-analyzer/crates/ide/src/highlight_related.rs:258-266 \u2014 both copies are in the same file, so extract the block 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/tools/rust-analyzer/crates/ide/src/highlight_related.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"aad186011864418d8ad3c08f69e8e587a35f385a3ad7c9433181531300cd858e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/tools/rust-analyzer/crates/ide/src/signature_help.rs:516-524 | src/tools/rust-analyzer/crates/ide/src/signature_help.rs:642-650 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tools/rust-analyzer/crates/ide/src/signature_help.rs:516\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/tools/rust-analyzer/crates/ide/src/signature_help.rs"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"6596b2c2450c4aab39788e8c2e7fdf65c7cda8d806f6bdd8598d4544cc194308"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/tools/rust-analyzer/crates/ide/src/syntax_highlighting/highlight.rs:168-176 | src/tools/rust-analyzer/crates/ide/src/syntax_highlighting/highlight.rs:185-193 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/ide/src/syntax_highlighting/highlight.rs:168\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/tools/rust-analyzer/crates/ide/src/syntax_highlighting/highlight.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"cecaca59ff9d1013b1cc631f4c7101739d8080b0286d7c685c90bcabb815eefe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/tools/rust-analyzer/crates/mbe/src/lib.rs:165-173 | src/tools/rust-analyzer/crates/mbe/src/lib.rs:225-233 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tools/rust-analyzer/crates/mbe/src/lib.rs:165\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/tools/rust-analyzer/crates/mbe/src/lib.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"33f0442246d28fb9f8c4e3312a1436487b69af883de66b759a3f9f1b17743279"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/tools/rust-analyzer/crates/proc-macro-srv-cli/src/main_loop.rs:51-59 | src/tools/rust-analyzer/crates/proc-macro-srv-cli/src/main_loop.rs:477-485 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/tools/rust-analyzer/crates/proc-macro-srv-cli/src/main_loop.rs:488\u0060 calls \u0060read\u0060, \u0060write\u0060 and \u0060src/tools/rust-analyzer/crates/proc-macro-srv-cli/src/main_loop.rs:63\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/tools/rust-analyzer/crates/proc-macro-srv-cli/src/main_loop.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"eda58a1c27ed385d9b918b2065fe4580941d4bbd46a81d6f6dbc20ce9a45a863"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/tools/rust-analyzer/crates/rust-analyzer/src/cli/analysis_stats.rs:1179-1187 | src/tools/rust-analyzer/crates/rust-analyzer/src/cli/analysis_stats.rs:1261-1269 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tools/rust-analyzer/crates/rust-analyzer/src/cli/analysis_stats.rs:1179\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":"src/tools/rust-analyzer/crates/rust-analyzer/src/cli/analysis_stats.rs"},"region":{"startLine":1179}}}],"partialFingerprints":{"codehealthFindingId/v1":"00784c771d34f3ba56d44fbe5329466e233ccbe1d31b171dfa5f9cd6e3149a49"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): src/tools/rust-analyzer/crates/rust-analyzer/src/config.rs:2467-2475 | src/tools/rust-analyzer/crates/rust-analyzer/src/config.rs:2478-2485 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/rust-analyzer/src/config.rs:2467\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/tools/rust-analyzer/crates/rust-analyzer/src/config.rs"},"region":{"startLine":2467}}}],"partialFingerprints":{"codehealthFindingId/v1":"42622758203f9bf392ea66812cd917af907038608d189c2c05f8e1e4938fe18f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/tools/rust-analyzer/xtask/src/codegen/grammar/ast_src.rs:225-233 | src/tools/rust-analyzer/xtask/src/codegen/grammar/ast_src.rs:234-242 \u2014 both copies are in the same file, so extract the block 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/tools/rust-analyzer/xtask/src/codegen/grammar/ast_src.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"4469ee69c104ce3a88a85db2129e0bf2377cfbf47e07e360b57cbfbdd31d5fca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): src/tools/rustfmt/src/header.rs:88-96 | src/tools/rustfmt/src/utils.rs:63-70 \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/tools/rustfmt/src/header.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"1917bdd956c42574ecbe3d4dcf65f736b2aa94872001a1620dc9f02dc6911046"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): src/tools/rustfmt/src/matches.rs:232-239 | src/tools/rustfmt/src/types.rs:386-394 \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/tools/rustfmt/src/matches.rs:232\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/tools/rustfmt/src/matches.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"713ed6c05aaa7dbe15d4bb50eef1881e2b93c2515bdd52fa3d7717fb88811a61"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 8): library/stdarch/crates/core_arch/src/x86/avx512bw.rs:9648-9655 | library/stdarch/crates/core_arch/src/x86/avx512bw.rs:9656-9663 | library/stdarch/crates/core_arch/src/x86/avx512bw.rs:9664-9671 | library/stdarch/crates/core_arch/src/x86/avx512bw.rs:9813-9820 | library/stdarch/crates/core_arch/src/x86/avx512bw.rs:9821-9828 | library/stdarch/crates/core_arch/src/x86/avx512bw.rs:9829-9836 | library/stdarch/crates/core_arch/src/x86/avx512bw.rs:9837-9844 | library/stdarch/crates/core_arch/src/x86/sse2.rs:1598-1605 \u2014 before extracting anything, compare \u0060library/stdarch/crates/core_arch/src/x86/avx512bw.rs\u0060 and \u0060library/stdarch/crates/core_arch/src/x86/sse2.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 51 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":"library/stdarch/crates/core_arch/src/x86/avx512bw.rs"},"region":{"startLine":9648}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a7616800c3765451dfb3d70fc1ddc3eef045b9ba1347a7aa4687fcdc5b644a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 6): library/std_detect/src/detect/os/freebsd/arm.rs:17-24 | library/std_detect/src/detect/os/freebsd/powerpc.rs:15-22 | library/std_detect/src/detect/os/linux/arm.rs:8-18 | library/std_detect/src/detect/os/linux/mips.rs:8-18 | library/std_detect/src/detect/os/linux/powerpc.rs:18-25 | library/std_detect/src/detect/os/openbsd/powerpc.rs:18-25 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 6 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 6 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/std_detect/src/detect/os/freebsd/arm.rs:17\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":"library/std_detect/src/detect/os/freebsd/arm.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ea3def43a59063a161df55a2f4037f58a9e519801d7aee7ff59ffca4cf0a2d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u20138 lines \u00D7 8): library/stdarch/crates/core_arch/src/x86/avx512f.rs:25109-25110 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:25114-25121 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:25189-25196 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:25264-25271 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:25413-25414 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:25418-25425 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:25493-25500 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:25568-25575 \u2014 all 8 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/stdarch/crates/core_arch/src/x86/avx512f.rs:25114\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":25109}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3cd2496660a5311d1b5b217f6063cb2170a455065bcc53bf9865a49273f816f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 6): src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:172-179 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1578-1585 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1727-1734 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1770-1777 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1805-1812 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1873-1880 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:172\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/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1736\u0060 calls \u0060map_node\u0060, \u0060syntax\u0060, \u0060clone\u0060 and \u0060src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1779\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/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"08e55c7f3dc5a94b3494fbe784b368859697bca97c7407dec64df231a1f9a57e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 5): compiler/rustc_borrowck/src/lib.rs:1976-1983 | compiler/rustc_next_trait_solver/src/solve/assembly/mod.rs:825-832 | compiler/rustc_next_trait_solver/src/solve/assembly/mod.rs:972-979 | compiler/rustc_next_trait_solver/src/solve/trait_goals.rs:1516-1523 | compiler/rustc_type_ir/src/ty_kind.rs:408-415 \u2014 before extracting anything, compare \u0060compiler/rustc_next_trait_solver/src/solve/assembly/mod.rs\u0060 and \u0060compiler/rustc_type_ir/src/ty_kind.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 36 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, \u0060compiler/rustc_next_trait_solver/src/solve/assembly/mod.rs:823\u0060 calls \u0060Adt\u0060 and \u0060compiler/rustc_borrowck/src/lib.rs:1974\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":"compiler/rustc_borrowck/src/lib.rs"},"region":{"startLine":1976}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d28526a02535f672e735bee52f405a33a380fe30a2cc8da7e5a4883a4d1c358"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): compiler/rustc_codegen_cranelift/src/intrinsics/llvm_aarch64.rs:702-709 | compiler/rustc_codegen_cranelift/src/intrinsics/llvm_aarch64.rs:838-845 | compiler/rustc_codegen_cranelift/src/intrinsics/llvm_aarch64.rs:945-952 | compiler/rustc_codegen_cranelift/src/intrinsics/llvm_x86.rs:1187-1194 \u2014 before extracting anything, compare \u0060compiler/rustc_codegen_cranelift/src/intrinsics/llvm_aarch64.rs\u0060 and \u0060compiler/rustc_codegen_cranelift/src/intrinsics/llvm_x86.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 92 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 \u0060compiler/rustc_codegen_cranelift/src/intrinsics/llvm_aarch64.rs:702\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/src/intrinsics/llvm_aarch64.rs"},"region":{"startLine":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"f715145f5017a0e3abac34b7b6e8c30ca187ac4f36008a3bfbd93063fd247590"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): compiler/rustc_const_eval/src/interpret/intrinsics/simd.rs:376-383 | compiler/rustc_const_eval/src/interpret/intrinsics/simd.rs:622-629 | compiler/rustc_const_eval/src/interpret/intrinsics/simd.rs:734-741 | compiler/rustc_const_eval/src/interpret/intrinsics/simd.rs:765-772 \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 \u0060compiler/rustc_const_eval/src/interpret/intrinsics/simd.rs:376\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":"compiler/rustc_const_eval/src/interpret/intrinsics/simd.rs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"e78d7e9469a1510537f4b224e071186fcef5f080b22c9455402c46349d649a3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): library/std/src/sys/fd/unix.rs:246-253 | library/std/src/sys/fd/unix.rs:293-300 | library/std/src/sys/fd/unix.rs:317-324 | library/std/src/sys/fd/unix.rs:354-361 \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 \u0060library/std/src/sys/fd/unix.rs:246\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 after the matched lines, \u0060library/std/src/sys/fd/unix.rs:325\u0060 calls \u0060default_read_vectored\u0060, \u0060read_at\u0060 and \u0060library/std/src/sys/fd/unix.rs:303\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":"library/std/src/sys/fd/unix.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e0a5cfb9ad32d326c1e141e8bf0a4527a8caea80e84316de59738f7abd24ab4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): src/tools/miri/src/intrinsics/aarch64.rs:323-330 | src/tools/miri/src/intrinsics/aarch64.rs:348-355 | src/tools/miri/src/intrinsics/aarch64.rs:395-402 | src/tools/miri/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/tools/miri/src/intrinsics/aarch64.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"a220ece1c9abf5fc857162d93f501c3bbf5dca2da45678adbd794ba584c40dcd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): src/tools/rust-analyzer/crates/hir-ide/src/display.rs:849-856 | src/tools/rust-analyzer/crates/hir-ide/src/display.rs:868-875 | src/tools/rust-analyzer/crates/hir-ide/src/display.rs:1122-1129 | src/tools/rust-analyzer/crates/hir-ide/src/display.rs:1141-1148 \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/tools/rust-analyzer/crates/hir-ide/src/display.rs:849\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/tools/rust-analyzer/crates/hir-ide/src/display.rs"},"region":{"startLine":849}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc551bc745e84276672232715069a158b6b5885d24a44c8b4068cb26099a4e63"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:353-360 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:401-408 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1483-1490 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:2157-2164 \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/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:353\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/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"187a44d61353db1d6fe9c7445cfd978d23865306df02718b08de156457e592c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:353-360 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:401-408 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1799-1806 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:2157-2164 \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/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:353\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/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:361\u0060 calls \u0060map_children\u0060, \u0060attrs\u0060, \u0060syntax\u0060 and \u0060src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1807\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/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ec095bde5a4c5c613796ea22a043665fbb3571f5ccdf35ed9bfc997787a55ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:420-427 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1820-1828 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1950-1957 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:2213-2220 \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/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:420\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/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"d209b0453c5a40e5a69734358a42f6a5dc8090ac382fa1542cd88aec98b2f23b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): compiler/rustc_const_eval/src/const_eval/machine.rs:777-784 | compiler/rustc_const_eval/src/const_eval/machine.rs:803-810 | compiler/rustc_const_eval/src/const_eval/machine.rs:825-832 \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":"compiler/rustc_const_eval/src/const_eval/machine.rs"},"region":{"startLine":777}}}],"partialFingerprints":{"codehealthFindingId/v1":"abdf41470ad63fa3da6e6eea55dd15864bcd430ff347521fdd004fede2046bee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20138 lines \u00D7 3): compiler/rustc_hir_analysis/src/coherence/builtin/coerce_shared.rs:104-109 | compiler/rustc_hir_analysis/src/coherence/builtin/coerce_shared.rs:152-157 | compiler/rustc_hir_analysis/src/coherence/builtin/coerce_shared.rs:162-169 \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 \u0060compiler/rustc_hir_analysis/src/coherence/builtin/coerce_shared.rs:162\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":"compiler/rustc_hir_analysis/src/coherence/builtin/coerce_shared.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f6417062cc0968be63a2b7c187857279abc9e116aa2f066d0cc4aa729c1317b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): compiler/rustc_middle/src/mir/pretty.rs:226-233 | compiler/rustc_middle/src/mir/pretty.rs:235-242 | compiler/rustc_middle/src/mir/pretty.rs:248-255 \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 \u0060compiler/rustc_middle/src/mir/pretty.rs:248\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":"compiler/rustc_middle/src/mir/pretty.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"a03383123b665049902f204b6a6b7ca7c81f3666ca78c797e26677e80d04e286"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): compiler/rustc_next_trait_solver/src/solve/assembly/structural_traits.rs:212-219 | compiler/rustc_trait_selection/src/traits/effects.rs:361-368 | compiler/rustc_trait_selection/src/traits/select/mod.rs:2093-2100 \u2014 before extracting anything, compare \u0060compiler/rustc_next_trait_solver/src/solve/assembly/structural_traits.rs\u0060 and \u0060compiler/rustc_trait_selection/src/traits/effects.rs\u0060 as WHOLE FILES: this scan already matched 7 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. 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":"compiler/rustc_next_trait_solver/src/solve/assembly/structural_traits.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"33b00d0c28fc6f7abf5b7bfd48a361d8ec4f1b85c5c950c19b3715ffbe12c882"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): compiler/rustc_target/src/callconv/loongarch.rs:92-99 | compiler/rustc_target/src/callconv/riscv.rs:97-104 | compiler/rustc_target/src/callconv/sparc64.rs:73-80 \u2014 before extracting anything, compare \u0060compiler/rustc_target/src/callconv/loongarch.rs\u0060 and \u0060compiler/rustc_target/src/callconv/riscv.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 328 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 \u0060compiler/rustc_target/src/callconv/loongarch.rs:92\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_target/src/callconv/loongarch.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c96df5a9eb5125fcbcb766d9bc9b291ba13f75bfec86d6ba517ef88f7dd1a7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): library/std/src/os/unix/net/datagram.rs:73-80 | library/std/src/os/unix/net/stream.rs:91-98 | library/std/src/os/windows/net/stream.rs:46-53 \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 \u0060library/std/src/os/unix/net/datagram.rs:73\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":"library/std/src/os/unix/net/datagram.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"54cee34cb1b1057aa0a1341d91897540ebc8f57e4d620e6727ad1ee8b067a7f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): library/std/src/sys/net/connection/socket/hermit.rs:227-234 | library/std/src/sys/net/connection/socket/solid.rs:295-302 | library/std/src/sys/net/connection/socket/unix.rs:405-412 \u2014 before extracting anything, compare \u0060library/std/src/sys/net/connection/socket/hermit.rs\u0060 and \u0060library/std/src/sys/net/connection/socket/unix.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 35 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/std/src/sys/net/connection/socket/hermit.rs:227\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/net/connection/socket/hermit.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd0713e25bb907c207d270b025b8c3f283dad61090373b6ebe7ca9ac000d77c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): library/stdarch/crates/core_arch/src/x86/avx.rs:168-175 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:22840-22847 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:24799-24806 \u2014 before extracting anything, compare \u0060library/stdarch/crates/core_arch/src/x86/avx.rs\u0060 and \u0060library/stdarch/crates/core_arch/src/x86/avx512f.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 50 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 \u0060library/stdarch/crates/core_arch/src/x86/avx.rs:168\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":"library/stdarch/crates/core_arch/src/x86/avx.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"f85beb471a7975dcf38ee66a6f430d27945a7c17af9e6740355aae90349cd911"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): library/stdarch/crates/core_arch/src/x86/avx2.rs:2563-2570 | library/stdarch/crates/core_arch/src/x86/avx2.rs:2571-2578 | library/stdarch/crates/core_arch/src/x86/avx2.rs:2608-2615 \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":"library/stdarch/crates/core_arch/src/x86/avx2.rs"},"region":{"startLine":2563}}}],"partialFingerprints":{"codehealthFindingId/v1":"6672bac968e66c1bdcb0f51b42b40cf7b583cc326935b74e2eed545402b9e380"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): library/stdarch/crates/core_arch/src/x86/avx512f.rs:4196-4203 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:4448-4455 | library/stdarch/crates/core_arch/src/x86/avx512fp16.rs:7362-7369 \u2014 before extracting anything, compare \u0060library/stdarch/crates/core_arch/src/x86/avx512f.rs\u0060 and \u0060library/stdarch/crates/core_arch/src/x86/avx512fp16.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 31 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 \u0060library/stdarch/crates/core_arch/src/x86/avx512f.rs:4196\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060a\u0060 to \u0060__m512\u0060 in one and \u0060__m256h\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":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":4196}}}],"partialFingerprints":{"codehealthFindingId/v1":"326a731715ea51c1bdc7404aeb25a461e517a8e4680dc1a4a652fef452675e8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): library/stdarch/crates/stdarch-gen-hexagon/src/hvx.rs:1478-1485 | library/stdarch/crates/stdarch-gen-hexagon/src/hvx.rs:1558-1565 | library/stdarch/crates/stdarch-gen-hexagon/src/scalar.rs:563-570 \u2014 before extracting anything, compare \u0060library/stdarch/crates/stdarch-gen-hexagon/src/hvx.rs\u0060 and \u0060library/stdarch/crates/stdarch-gen-hexagon/src/scalar.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 55 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 \u0060library/stdarch/crates/stdarch-gen-hexagon/src/hvx.rs:1478\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060library/stdarch/crates/stdarch-gen-hexagon/src/scalar.rs:572\u0060 calls \u0060is_empty\u0060 and \u0060library/stdarch/crates/stdarch-gen-hexagon/src/hvx.rs:1487\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":"library/stdarch/crates/stdarch-gen-hexagon/src/hvx.rs"},"region":{"startLine":1478}}}],"partialFingerprints":{"codehealthFindingId/v1":"deecb24b2f331c05d4083b394ae15e2f482b4ac1059df4bc7b1b5d53384a100f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/tools/clippy/clippy_lints/src/arbitrary_source_item_ordering.rs:282-289 | src/tools/clippy/clippy_lints/src/arbitrary_source_item_ordering.rs:318-325 | src/tools/clippy/clippy_lints/src/arbitrary_source_item_ordering.rs:353-360 \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/tools/clippy/clippy_lints/src/arbitrary_source_item_ordering.rs:282\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":"src/tools/clippy/clippy_lints/src/arbitrary_source_item_ordering.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"6545485127fbb81a6ea0cd4bbb51c68fe407a1d04571f801c00d00534029961d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/tools/miri/src/intrinsics/x86/avx.rs:134-141 | src/tools/miri/src/intrinsics/x86/avx.rs:164-171 | src/tools/miri/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/tools/miri/src/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/tools/miri/src/intrinsics/x86/avx.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"352cdc0d06b8cf544e4ea60ff4cc3c93d156d1dc433c70785f8c199f8800d878"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/tools/miri/src/shims/unix/socket.rs:382-389 | src/tools/miri/src/shims/unix/socket.rs:536-543 | src/tools/miri/src/shims/unix/socket.rs:621-628 \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/tools/miri/src/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/tools/miri/src/shims/unix/socket.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef460a2b1e65324ff3e621b3608fc987368efc519286b46f08a187faf6827f55"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/tools/miri/src/shims/unix/socket.rs:465-472 | src/tools/miri/src/shims/unix/socket.rs:532-539 | src/tools/miri/src/shims/unix/socket.rs:617-624 \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/tools/miri/src/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/tools/miri/src/shims/unix/socket.rs"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3f5b4a524f152588ccdd699410db32531eb58d4aab9bf44f1664f592b1cf5fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): src/tools/rust-analyzer/crates/hir-ty/src/next_solver/util.rs:646-655 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/util.rs:674-683 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/util.rs:705-714 \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/tools/rust-analyzer/crates/hir-ty/src/next_solver/util.rs:646\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/tools/rust-analyzer/crates/hir-ty/src/next_solver/util.rs"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d62822d42a0f71bfca890833de4379703401599e1cfd3959479b439a8c47d7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/tools/rust-analyzer/crates/ide-assists/src/handlers/apply_demorgan.rs:230-237 | src/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_tuple_return_type_to_struct.rs:270-277 | src/tools/rust-analyzer/crates/ide-assists/src/handlers/unwrap_return_type.rs:74-81 \u2014 before extracting anything, compare \u0060src/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_tuple_return_type_to_struct.rs\u0060 and \u0060src/tools/rust-analyzer/crates/ide-assists/src/handlers/unwrap_return_type.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 31 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/tools/rust-analyzer/crates/ide-assists/src/handlers/apply_demorgan.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"61ec01bd2d7d3cdd8ea13df7286f1c9850de66f914e76f3597673b40cb0f93af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/tools/rust-analyzer/crates/ide-db/src/search.rs:1247-1254 | src/tools/rust-analyzer/crates/ide-db/src/search.rs:1263-1270 | src/tools/rust-analyzer/crates/ide-db/src/search.rs:1275-1282 \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/tools/rust-analyzer/crates/ide-db/src/search.rs"},"region":{"startLine":1247}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb4003260879d4350eff4539d2206931a2d7fc7ebbb6684cb0f30ba33c65e3b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/tools/rust-analyzer/crates/ide/src/syntax_highlighting/highlight.rs:165-172 | src/tools/rust-analyzer/crates/ide/src/syntax_highlighting/highlight.rs:182-189 | src/tools/rust-analyzer/crates/ide/src/syntax_highlighting/highlight.rs:199-206 \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/tools/rust-analyzer/crates/ide/src/syntax_highlighting/highlight.rs:165\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/tools/rust-analyzer/crates/ide/src/syntax_highlighting/highlight.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"607a84a802865fe60bc6450c598a2af1815eea7d8495dd6c3980fb6b72b9fa6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:166-173 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1483-1490 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1867-1874 \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/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:166\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/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"e086bab3b4691d010d8b4051fddd8f98f3e78f03d6deaae7f8b8ec51ba8c4d5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): compiler/rustc_ast/src/ast.rs:2862-2869 | src/tools/rust-analyzer/crates/hir-def/src/hir.rs:589-596 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/tools/rust-analyzer/crates/hir-def/src/hir.rs:598\u0060 calls \u0060is_clobber\u0060, \u0060Reg\u0060 and \u0060compiler/rustc_ast/src/ast.rs:2870\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":"compiler/rustc_ast/src/ast.rs"},"region":{"startLine":2862}}}],"partialFingerprints":{"codehealthFindingId/v1":"23173d69054d67545267d47f2c9406bd0111277be6a262d92d39c825be5fb4d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): compiler/rustc_ast_pretty/src/pprust/state/item.rs:364-371 | compiler/rustc_ast_pretty/src/pprust/state/item.rs:397-404 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_ast_pretty/src/pprust/state/item.rs:364\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ast_pretty/src/pprust/state/item.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eb2adb34fff7c98d9ea38f29977ecbd36cb1def578725786ef0b271e2553210"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): compiler/rustc_attr_parsing/src/attributes/proc_macro_attrs.rs:84-91 | compiler/rustc_attr_parsing/src/attributes/proc_macro_attrs.rs:114-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. 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, \u0060compiler/rustc_attr_parsing/src/attributes/proc_macro_attrs.rs:113\u0060 calls \u0060expect_no_args\u0060, \u0060args\u0060 and \u0060compiler/rustc_attr_parsing/src/attributes/proc_macro_attrs.rs:83\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":"compiler/rustc_attr_parsing/src/attributes/proc_macro_attrs.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9bdda89b06c0e9341235a448511547947cc41e4dd876e8fb85264a21998225d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): compiler/rustc_attr_parsing/src/attributes/stability.rs:357-366 | compiler/rustc_attr_parsing/src/attributes/stability.rs:453-462 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_attr_parsing/src/attributes/stability.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":"compiler/rustc_attr_parsing/src/attributes/stability.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"1026fd4f9a3fb0bd431e6275bb98b609c3297d71d7b793be4a2c494da292cc6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): compiler/rustc_borrowck/src/diagnostics/mod.rs:613-620 | compiler/rustc_borrowck/src/diagnostics/mod.rs:633-640 \u2014 both copies are in the same file, so extract the block 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":"compiler/rustc_borrowck/src/diagnostics/mod.rs"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ba65c0d1f322e5766f23c9a1f25dbf6689e2ebde48e7924cb854838fdf9d40c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): compiler/rustc_borrowck/src/type_check/mod.rs:2417-2424 | compiler/rustc_borrowck/src/type_check/mod.rs:2621-2628 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_borrowck/src/type_check/mod.rs:2417\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":"compiler/rustc_borrowck/src/type_check/mod.rs"},"region":{"startLine":2417}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2be8597f8970b04a824238299ff6ff90e429d2f7f454ffb81c326c2c7361f23"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): compiler/rustc_builtin_macros/src/concat.rs:70-77 | compiler/rustc_builtin_macros/src/concat_bytes.rs:196-203 \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 \u0060compiler/rustc_builtin_macros/src/concat.rs:70\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"compiler/rustc_builtin_macros/src/concat.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"2045422a68221d403fa32cca7797f765756bae263a2baea2181a4c811f8f2bd4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): compiler/rustc_builtin_macros/src/format.rs:534-541 | src/tools/rust-analyzer/crates/hir-def/src/hir/format_args.rs:351-358 \u2014 before extracting anything, compare \u0060compiler/rustc_builtin_macros/src/format.rs\u0060 and \u0060src/tools/rust-analyzer/crates/hir-def/src/hir/format_args.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 113 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 \u0060compiler/rustc_builtin_macros/src/format.rs:534\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, \u0060compiler/rustc_builtin_macros/src/format.rs:533\u0060 calls \u0060invalid_placeholder_type_error\u0060 and \u0060src/tools/rust-analyzer/crates/hir-def/src/hir/format_args.rs:349\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":"compiler/rustc_builtin_macros/src/format.rs"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"a42387293bcceadc44696f3f72272d39f7ab685a52c34ba0cb3945c5c90a4c75"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): compiler/rustc_codegen_cranelift/src/abi/mod.rs:902-909 | compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs:1459-1466 \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 \u0060compiler/rustc_codegen_cranelift/src/abi/mod.rs:902\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":"compiler/rustc_codegen_cranelift/src/abi/mod.rs"},"region":{"startLine":902}}}],"partialFingerprints":{"codehealthFindingId/v1":"151a9641ca88c4a57815f6ba72b1c03acfa3b878b89f2fb2b92e09aa9eb748fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): compiler/rustc_codegen_cranelift/src/codegen_i128.rs:13-21 | compiler/rustc_codegen_cranelift/src/codegen_i128.rs:56-64 \u2014 both copies are in the same file, so extract the block 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":"compiler/rustc_codegen_cranelift/src/codegen_i128.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"b436d9fdadebf01f83420beb44115592c6ff24e466375aad8fdaf7b454e93d1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): compiler/rustc_codegen_cranelift/src/constant.rs:308-314 | compiler/rustc_codegen_cranelift/src/constant.rs:359-366 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_codegen_cranelift/src/constant.rs:308\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/src/constant.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"d001df79cd9f63752fd53263fa0446804e5c52ecd5231d7de31305c5f6ae8682"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20138 lines \u00D7 2): compiler/rustc_codegen_cranelift/src/driver/jit.rs:104-109 | compiler/rustc_codegen_cranelift/src/main_shim.rs:54-61 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_codegen_cranelift/src/driver/jit.rs:104\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":"compiler/rustc_codegen_cranelift/src/driver/jit.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0d43628a1242b72a6de4f436d1178d7899a3fc6caae145cf2308f74f3239131"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs:127-134 | compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs:173-180 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs:127\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"8815f637f65b67eac9e1bb5752caa5a7065c46daa58eb4246a47bdc656de0988"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs:168-175 | compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs:261-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d9d12b4551ba4598a71214d620001a2745c6b71e5d2afc027bec2d3cd2d7286"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs:653-660 | compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs:694-701 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs:653\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":"compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f49a46841341c84b0102eff8f4f666108baefbe6febb47041b0b833890c3829"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs:810-817 | compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs:835-842 \u2014 both copies are in the same file, so extract the block 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":"compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs"},"region":{"startLine":810}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cda9ff00089144b609d7814e2444a84e23554335ed6cfa80cc87a8ad041f88e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): compiler/rustc_codegen_cranelift/src/value_and_place.rs:217-226 | compiler/rustc_codegen_cranelift/src/value_and_place.rs:244-253 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_codegen_cranelift/src/value_and_place.rs:217\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":"compiler/rustc_codegen_cranelift/src/value_and_place.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9550203c8314b5d0651624dce91396877def13066e2ad0509c1013c746f202a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): compiler/rustc_codegen_gcc/src/builder.rs:1454-1461 | compiler/rustc_codegen_gcc/src/builder.rs:1480-1487 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_codegen_gcc/src/builder.rs:1454\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":"compiler/rustc_codegen_gcc/src/builder.rs"},"region":{"startLine":1454}}}],"partialFingerprints":{"codehealthFindingId/v1":"36ad1ce0ac8ddaeca13518a1fd888bc9e053161337d4a5f93dc0b72c0aaf6c96"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): compiler/rustc_codegen_gcc/src/context.rs:648-655 | compiler/rustc_codegen_llvm/src/context.rs:1186-1193 \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":"compiler/rustc_codegen_gcc/src/context.rs"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"5079eee9e05ff785a0df3741531523322b04545b8ae1f161d76fba49a3b1399d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): compiler/rustc_codegen_gcc/src/int.rs:154-161 | compiler/rustc_codegen_gcc/src/int.rs:756-763 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060compiler/rustc_codegen_gcc/src/int.rs:163\u0060 calls \u0060gcc_sub\u0060 and \u0060compiler/rustc_codegen_gcc/src/int.rs:767\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":"compiler/rustc_codegen_gcc/src/int.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"07a3213fb07c8fe66c040f3dc7f34543e5252c1fd7a8c30b96fdd288033bb350"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): compiler/rustc_codegen_gcc/src/intrinsic/simd.rs:81-88 | compiler/rustc_codegen_llvm/src/intrinsic.rs:2092-2099 \u2014 before extracting anything, compare \u0060compiler/rustc_codegen_gcc/src/intrinsic/simd.rs\u0060 and \u0060compiler/rustc_codegen_llvm/src/intrinsic.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 192 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 \u0060compiler/rustc_codegen_gcc/src/intrinsic/simd.rs:81\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":"compiler/rustc_codegen_gcc/src/intrinsic/simd.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ad582e8e612f5d476907b4db6c207dbdc59f77e887ca4d86a4bd5a64eae71ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): compiler/rustc_codegen_gcc/src/intrinsic/simd.rs:1267-1274 | compiler/rustc_codegen_llvm/src/intrinsic.rs:3252-3259 \u2014 before extracting anything, compare \u0060compiler/rustc_codegen_gcc/src/intrinsic/simd.rs\u0060 and \u0060compiler/rustc_codegen_llvm/src/intrinsic.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 192 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 \u0060compiler/rustc_codegen_gcc/src/intrinsic/simd.rs:1267\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":"compiler/rustc_codegen_gcc/src/intrinsic/simd.rs"},"region":{"startLine":1267}}}],"partialFingerprints":{"codehealthFindingId/v1":"96fccc79e97147a911bbeb12e50d2212f8e1d5a953915f4336010ce0720c069f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): compiler/rustc_codegen_llvm/src/back/lto.rs:408-415 | compiler/rustc_codegen_llvm/src/back/lto.rs:436-443 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_codegen_llvm/src/back/lto.rs:408\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/back/lto.rs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"622fe9c0d33779c5348431945d8486bb7f3fec08e33df799b49ef483577c741b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20138 lines \u00D7 2): compiler/rustc_codegen_llvm/src/consts.rs:699-704 | compiler/rustc_codegen_llvm/src/consts.rs:814-821 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_codegen_llvm/src/consts.rs:814\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":"compiler/rustc_codegen_llvm/src/consts.rs"},"region":{"startLine":699}}}],"partialFingerprints":{"codehealthFindingId/v1":"493ab4512de4931d8ec2a537291c487c13beb063b3b3933f3c57c705947252d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): compiler/rustc_codegen_ssa/src/back/metadata.rs:528-535 | compiler/rustc_codegen_ssa/src/back/metadata.rs:651-658 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_codegen_ssa/src/back/metadata.rs:528\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":"compiler/rustc_codegen_ssa/src/back/metadata.rs"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d13e76be603803df323a71ccba240521ac4157c3912ed118ddfa5ef12e4dcab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): compiler/rustc_codegen_ssa/src/back/symbol_edit.rs:161-168 | compiler/rustc_codegen_ssa/src/back/symbol_edit.rs:382-389 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_codegen_ssa/src/back/symbol_edit.rs:161\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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, \u0060compiler/rustc_codegen_ssa/src/back/symbol_edit.rs:160\u0060 calls \u0060is_undefined\u0060 and \u0060compiler/rustc_codegen_ssa/src/back/symbol_edit.rs:381\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":"compiler/rustc_codegen_ssa/src/back/symbol_edit.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc1f41c872c46825426f075491b675fd2a5150d41647b4193d39cce28646a4a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): compiler/rustc_codegen_ssa/src/back/write.rs:1863-1870 | compiler/rustc_codegen_ssa/src/back/write.rs:1920-1927 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_codegen_ssa/src/back/write.rs:1863\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":"compiler/rustc_codegen_ssa/src/back/write.rs"},"region":{"startLine":1863}}}],"partialFingerprints":{"codehealthFindingId/v1":"0326f30a37930f5e0d69f99cb1c152e7722145a5c09a788c3dae16d1c8ae0e22"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): compiler/rustc_errors/src/annotate_snippet_emitter_writer.rs:711-718 | compiler/rustc_errors/src/annotate_snippet_emitter_writer.rs:724-731 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_errors/src/annotate_snippet_emitter_writer.rs:711\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":"compiler/rustc_errors/src/annotate_snippet_emitter_writer.rs"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6928c0d2fd6e575a3fc0194d96956b5d8d216dd3dada3a83de4144ce6f9bf42"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): compiler/rustc_hir/src/hir.rs:2332-2339 | compiler/rustc_hir/src/hir.rs:2541-2548 \u2014 both copies are in the same file, so extract the block 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, \u0060compiler/rustc_hir/src/hir.rs:2330\u0060 calls \u0060Repeat\u0060, \u0060Array\u0060 and \u0060compiler/rustc_hir/src/hir.rs:2540\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":"compiler/rustc_hir/src/hir.rs"},"region":{"startLine":2332}}}],"partialFingerprints":{"codehealthFindingId/v1":"03127037a6b0fc13948d288c5865d48f46ee759a363bc8b221f8a3067cee7c89"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): compiler/rustc_hir_analysis/src/check/compare_impl_item.rs:207-219 | compiler/rustc_hir_analysis/src/check/compare_impl_item.rs:2363-2370 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_hir_analysis/src/check/compare_impl_item.rs:2363\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":"compiler/rustc_hir_analysis/src/check/compare_impl_item.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"71208bcd1a59b52b947191782bcb240738adeac373aa62671adc3357a768ad1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): compiler/rustc_hir_analysis/src/check/wfcheck.rs:1940-1948 | compiler/rustc_hir_analysis/src/check/wfcheck.rs:1982-1990 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_hir_analysis/src/check/wfcheck.rs:1940\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, \u0060compiler/rustc_hir_analysis/src/check/wfcheck.rs:1991\u0060 calls \u0060register_obligations\u0060, \u0060into_obligations\u0060 and \u0060compiler/rustc_hir_analysis/src/check/wfcheck.rs:1949\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":"compiler/rustc_hir_analysis/src/check/wfcheck.rs"},"region":{"startLine":1940}}}],"partialFingerprints":{"codehealthFindingId/v1":"97e1294757b68554c845397f2c5a61fba77697cd7da2489f37e22a7cf834cfb6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): compiler/rustc_hir_analysis/src/check/wfcheck.rs:2034-2041 | compiler/rustc_mir_dataflow/src/move_paths/builder.rs:198-205 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060compiler/rustc_hir_analysis/src/check/wfcheck.rs:2033\u0060 calls \u0060Adt\u0060 and \u0060compiler/rustc_mir_dataflow/src/move_paths/builder.rs:197\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":"compiler/rustc_hir_analysis/src/check/wfcheck.rs"},"region":{"startLine":2034}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e88e9a64576ddc0b96e4bb58eff25c1f149090d90e3f7e7772cf4a246e8ef89"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): compiler/rustc_hir_analysis/src/check/wfcheck.rs:2641-2649 | compiler/rustc_hir_analysis/src/check/wfcheck.rs:2652-2660 \u2014 both copies are in the same file, so extract the block 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":"compiler/rustc_hir_analysis/src/check/wfcheck.rs"},"region":{"startLine":2641}}}],"partialFingerprints":{"codehealthFindingId/v1":"a982fd8965430f04b9a74333bb24ad6917bfb4b81627531302aa698667896122"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): compiler/rustc_hir_typeck/src/intrinsicck.rs:281-288 | compiler/rustc_hir_typeck/src/intrinsicck.rs:297-304 \u2014 both copies are in the same file, so extract the block 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":"compiler/rustc_hir_typeck/src/intrinsicck.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"460482b5be3d082ccb78cb59920cbd0a5ced26487ac4591ab49afe753129f550"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): compiler/rustc_hir_typeck/src/pat.rs:3125-3132 | src/tools/rust-analyzer/crates/hir-ty/src/infer/pat.rs:1621-1628 \u2014 before extracting anything, compare \u0060compiler/rustc_hir_typeck/src/pat.rs\u0060 and \u0060src/tools/rust-analyzer/crates/hir-ty/src/infer/pat.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 47 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":"compiler/rustc_hir_typeck/src/pat.rs"},"region":{"startLine":3125}}}],"partialFingerprints":{"codehealthFindingId/v1":"490243d2777b613fc4f58123e264081cd750d3ea9f73b98a47b3966f795ee53d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): compiler/rustc_hir_typeck/src/upvar.rs:1373-1381 | compiler/rustc_hir_typeck/src/upvar.rs:1394-1401 \u2014 both copies are in the same file, so extract the block 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":"compiler/rustc_hir_typeck/src/upvar.rs"},"region":{"startLine":1373}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecc4752a06f5d5d1d0811b85fe187f616791ad4fa1b100efd00f22fae0694061"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): compiler/rustc_infer/src/infer/opaque_types/table.rs:143-151 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/opaque_types/table.rs:144-152 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060hidden_type\u0060 to \u0060ProvisionalHiddenType\u003C\u0027tcx\u003E\u0060 in one and \u0060OpaqueHiddenType\u003C\u0027db\u003E\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":"compiler/rustc_infer/src/infer/opaque_types/table.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8b4246b0ec59b2055368583b48c3c0cc97594dc3e40a2f79341f11cfaef8f20"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): compiler/rustc_infer/src/infer/region_constraints/mod.rs:890-897 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/region_constraints/mod.rs:644-651 \u2014 before extracting anything, compare \u0060compiler/rustc_infer/src/infer/region_constraints/mod.rs\u0060 and \u0060src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/region_constraints/mod.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 55 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":"compiler/rustc_infer/src/infer/region_constraints/mod.rs"},"region":{"startLine":890}}}],"partialFingerprints":{"codehealthFindingId/v1":"7235f3c50f2bd959375c517bed144efa54deb9cf57933f4d8bad1537151d919a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): compiler/rustc_infer/src/infer/relate/generalize.rs:465-472 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/relate/generalize.rs:406-413 \u2014 before extracting anything, compare \u0060compiler/rustc_infer/src/infer/relate/generalize.rs\u0060 and \u0060src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/relate/generalize.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 73 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 \u0060compiler/rustc_infer/src/infer/relate/generalize.rs:465\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":"compiler/rustc_infer/src/infer/relate/generalize.rs"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"566eaa2694e51c71cb3f509c377e460b948b51feecee54f1f316c3c29cbc5e4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): compiler/rustc_infer/src/infer/snapshot/fudge.rs:149-155 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/snapshot/fudge.rs:142-149 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060infcx\u0060 to \u0060\u0026InferCtxt\u003C\u0027tcx\u003E\u0060 in one and \u0060\u0026InferCtxt\u003C\u0027_\u003E\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":"compiler/rustc_infer/src/infer/snapshot/fudge.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ad465a884c100502676dbceb3fc17b365c37acc683a059543ee19de3eb89fcd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): compiler/rustc_infer/src/infer/snapshot/undo_log.rs:66-78 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/snapshot/undo_log.rs:65-77 \u2014 before extracting anything, compare \u0060compiler/rustc_infer/src/infer/snapshot/undo_log.rs\u0060 and \u0060src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/snapshot/undo_log.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 50 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 \u0060compiler/rustc_infer/src/infer/snapshot/undo_log.rs:66\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060undo\u0060 to \u0060UndoLog\u003C\u0027tcx\u003E\u0060 in one and \u0060UndoLog\u003C\u0027db\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060compiler/rustc_infer/src/infer/snapshot/undo_log.rs:79\u0060 calls \u0060ProjectionCache\u0060, \u0060reverse\u0060 and \u0060src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/snapshot/undo_log.rs:78\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":"compiler/rustc_infer/src/infer/snapshot/undo_log.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"71fb7e85ffa703c3ebd6a4a61f9cfd08c6a68d06db3ba5c69e80051a50ef4837"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): compiler/rustc_middle/src/mono.rs:544-551 | compiler/rustc_mir_transform/src/inline.rs:759-766 \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":"compiler/rustc_middle/src/mono.rs"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"38e66a0362f3c5a0bcd44c12cb963dcea0810f784100cddd3aedc44ab3c2db0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): compiler/rustc_middle/src/ty/util.rs:122-129 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/util.rs:105-112 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. 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":"compiler/rustc_middle/src/ty/util.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"4517a553ca113a3baef09feeef4a33d45851d7b8dd789afc7040cbb7c577920d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): compiler/rustc_mir_transform/src/shim.rs:287-294 | compiler/rustc_mir_transform/src/shim/async_destructor_ctor.rs:104-111 \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":"compiler/rustc_mir_transform/src/shim.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0dfb3658c4c11ed41cc84b3f8351f116af6b52e0f575218956d4aa434eb61cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): compiler/rustc_next_trait_solver/src/placeholder.rs:259-268 | compiler/rustc_next_trait_solver/src/placeholder.rs:318-327 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_next_trait_solver/src/placeholder.rs:259\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":"compiler/rustc_next_trait_solver/src/placeholder.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac5753eafb55062fb92425ce8bb41dfffd058787004b4371e65fe30fed8eac7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): compiler/rustc_next_trait_solver/src/solve/assembly/structural_traits.rs:864-871 | compiler/rustc_trait_selection/src/traits/effects.rs:529-535 \u2014 before extracting anything, compare \u0060compiler/rustc_next_trait_solver/src/solve/assembly/structural_traits.rs\u0060 and \u0060compiler/rustc_trait_selection/src/traits/effects.rs\u0060 as WHOLE FILES: this scan already matched 7 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. 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 \u0060compiler/rustc_next_trait_solver/src/solve/assembly/structural_traits.rs:864\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_next_trait_solver/src/solve/assembly/structural_traits.rs"},"region":{"startLine":864}}}],"partialFingerprints":{"codehealthFindingId/v1":"e789cd9ccd5d8970758f6578d973f293b0c1fa15d0081ec35f9c9bee75012918"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): compiler/rustc_parse/src/parser/pat.rs:829-836 | compiler/rustc_parse/src/parser/pat.rs:1456-1463 \u2014 both copies are in the same file, so extract the block 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":"compiler/rustc_parse/src/parser/pat.rs"},"region":{"startLine":829}}}],"partialFingerprints":{"codehealthFindingId/v1":"55a4dcd6686075040e0ddd3aa263b0a927e81595166425e9b6d6f08a54db74e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): compiler/rustc_trait_selection/src/error_reporting/infer/suggest.rs:203-210 | compiler/rustc_trait_selection/src/error_reporting/infer/suggest.rs:245-252 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_trait_selection/src/error_reporting/infer/suggest.rs:203\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/error_reporting/infer/suggest.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb3b065fb8696160e656e6eae059a45d89721762a5dc2fe1bd52075d57f0cc49"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): compiler/rustc_type_ir/src/relate.rs:310-317 | compiler/rustc_type_ir/src/relate.rs:330-337 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_type_ir/src/relate.rs:310\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":"compiler/rustc_type_ir/src/relate.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b36cac34f2b25a24b50ea7f4913063654cc0b0483c87fad822c8eedfbed666c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): compiler/rustc_type_ir/src/relate/solver_relating.rs:199-206 | compiler/rustc_type_ir/src/relate/solver_relating.rs:208-215 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"compiler/rustc_type_ir/src/relate/solver_relating.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"af0177fa88375060d40c807fa934bc9ead80eb00921f1b08bd62aeb526f3bd71"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): library/alloc/src/collections/vec_deque/iter.rs:180-187 | library/alloc/src/collections/vec_deque/iter_mut.rs:244-251 \u2014 before extracting anything, compare \u0060library/alloc/src/collections/vec_deque/iter.rs\u0060 and \u0060library/alloc/src/collections/vec_deque/iter_mut.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 48 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. 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":"library/alloc/src/collections/vec_deque/iter.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"6583a5841a005564dfaadb609bd38f22d87ec54b21495a4a7b4673e04300c259"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): library/core/src/fmt/builders.rs:250-257 | library/core/src/fmt/builders.rs:1341-1348 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/core/src/fmt/builders.rs:250\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":"library/core/src/fmt/builders.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"057dbe6694ea56ec83cd003db9bcd1da50f85db446574f305a9f2940a2a3125f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): library/core/src/slice/iter.rs:3034-3041 | library/core/src/slice/iter.rs:3142-3149 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/core/src/slice/iter.rs:3034\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":"library/core/src/slice/iter.rs"},"region":{"startLine":3034}}}],"partialFingerprints":{"codehealthFindingId/v1":"04b986cbf2709f95b59093d87c2715053f98f53a8dad54d9585a4df87774af58"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): library/core/src/slice/iter.rs:3080-3087 | library/core/src/slice/iter.rs:3175-3182 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/core/src/slice/iter.rs:3080\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":"library/core/src/slice/iter.rs"},"region":{"startLine":3080}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ab97651877bf7721fc5cb0f1fd6124e4782f1ea22e2827593cc4ae750e2e565"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): library/std/src/sys/env/unix.rs:82-89 | library/std/src/sys/env/wasi.rs:48-55 \u2014 before extracting anything, compare \u0060library/std/src/sys/env/unix.rs\u0060 and \u0060library/std/src/sys/env/wasi.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 41 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":"library/std/src/sys/env/unix.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"0125cd783ec7e833a77ac1122fb992f9fe628340ac7b3409239ff0411806688c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): library/std/src/sys/fs/windows.rs:523-530 | library/std/src/sys/fs/windows.rs:597-604 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/std/src/sys/fs/windows.rs:523\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":"library/std/src/sys/fs/windows.rs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"e01858dd908b03528c9bda9b0f7320cc6fba9c040c0b01755815966789c255e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): library/std/src/sys/stdio/xous.rs:21-28 | library/std/src/sys/stdio/xous.rs:48-55 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/std/src/sys/stdio/xous.rs:21\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/stdio/xous.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaf934c15f1e2758b00ceb856727a0aed0191c99d0db6b93c68e429ece0fc086"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): library/stdarch/crates/core_arch/src/wasm32/simd128.rs:871-878 | library/stdarch/crates/core_arch/src/wasm32/simd128.rs:941-948 \u2014 both copies are in the same file, so extract the block 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":"library/stdarch/crates/core_arch/src/wasm32/simd128.rs"},"region":{"startLine":871}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdf97779dc766306d0f81a14cc4923385c8f95d1cd2705ae96c1b48138deae7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): library/stdarch/crates/core_arch/src/x86/avx2.rs:2529-2537 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:24625-24633 \u2014 before extracting anything, compare \u0060library/stdarch/crates/core_arch/src/x86/avx2.rs\u0060 and \u0060library/stdarch/crates/core_arch/src/x86/avx512f.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 53 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 \u0060library/stdarch/crates/core_arch/src/x86/avx2.rs:2529\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":"library/stdarch/crates/core_arch/src/x86/avx2.rs"},"region":{"startLine":2529}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe2cf526dc03d0ed377fbaf5457bea536bcc81b8e6cb5755a54e2712833c8dc1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): library/stdarch/crates/core_arch/src/x86/avx512f.rs:22975-22982 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:24949-24956 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/stdarch/crates/core_arch/src/x86/avx512f.rs:22975\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":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":22975}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecc5df67b4823df873cf63550dce3e8bd33192f6741d036b2df7b9bb018a3e8c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): library/stdarch/crates/core_arch/src/x86/avx512fp16.rs:6186-6194 | library/stdarch/crates/core_arch/src/x86/avx512fp16.rs:6223-6231 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/stdarch/crates/core_arch/src/x86/avx512fp16.rs:6186\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":"library/stdarch/crates/core_arch/src/x86/avx512fp16.rs"},"region":{"startLine":6186}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ec0d66aded785086c7fcba5c5c8f2dfdad9cf756b3aa34d2b873ceb7b79c8d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): library/stdarch/crates/core_arch/src/x86/avx512fp16.rs:6692-6700 | library/stdarch/crates/core_arch/src/x86/avx512fp16.rs:6729-6737 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/stdarch/crates/core_arch/src/x86/avx512fp16.rs:6692\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":"library/stdarch/crates/core_arch/src/x86/avx512fp16.rs"},"region":{"startLine":6692}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd756c29bf2d35a681bb33257136cd38fbb4eb5103d4c8c82aa4c2e7639b1b5f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): library/stdarch/crates/core_arch/src/x86/avx512fp16.rs:7206-7214 | library/stdarch/crates/core_arch/src/x86/avx512fp16.rs:7243-7251 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/stdarch/crates/core_arch/src/x86/avx512fp16.rs:7206\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":"library/stdarch/crates/core_arch/src/x86/avx512fp16.rs"},"region":{"startLine":7206}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a14af979d9c5c891f80cea53db6ef3bbd1eb3d6b95fb668d5c3f67b2898c688"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): library/stdarch/crates/core_arch/src/x86/sse2.rs:1656-1663 | library/stdarch/crates/core_arch/src/x86/sse2.rs:1713-1720 \u2014 both copies are in the same file, so extract the block 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":"library/stdarch/crates/core_arch/src/x86/sse2.rs"},"region":{"startLine":1656}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c329e4e109c995b3b0d9943bc4a78be36a975c7e615420b2384391e222881e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/bootstrap/src/core/build_steps/toolstate.rs:236-243 | src/bootstrap/src/core/build_steps/toolstate.rs:273-280 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/bootstrap/src/core/build_steps/toolstate.rs:236\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/bootstrap/src/core/build_steps/toolstate.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"6781f0fa6ef080b4a008076103bd12394b5d4577e80cf14db168673327207492"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/bootstrap/src/core/builder/cargo.rs:489-496 | src/bootstrap/src/core/builder/cargo.rs:513-520 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/builder/cargo.rs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7c0f3aaac7a045148f93b27f3c5d3f0ca0f1fc8ec396aac447bfedf424ed6bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): src/librustdoc/clean/mod.rs:2196-2202 | src/librustdoc/clean/mod.rs:2371-2378 \u2014 both copies are in the same file, so extract the block 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/librustdoc/clean/mod.rs"},"region":{"startLine":2196}}}],"partialFingerprints":{"codehealthFindingId/v1":"53252cef61a1e1715587b7ac94ba2b16a3aad61e8f9b5f3b4a9a85f12290af6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/librustdoc/html/markdown.rs:1602-1609 | src/librustdoc/html/markdown.rs:1649-1656 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/librustdoc/html/markdown.rs:1602\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/librustdoc/html/markdown.rs"},"region":{"startLine":1602}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c2ac87793ea9f678ca2a333ae7fc8627457a82e986f74c4400eb367deff0e5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/librustdoc/html/markdown.rs:1760-1767 | src/librustdoc/html/markdown.rs:1783-1790 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/librustdoc/html/markdown.rs:1760\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/librustdoc/html/markdown.rs"},"region":{"startLine":1760}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b59e4e1020875a4dec5c2f8c54705ad2195015844bd19c78369308f27c560c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): src/librustdoc/html/markdown.rs:1830-1836 | src/librustdoc/passes/lint/redundant_explicit_links.rs:599-606 \u2014 before extracting anything, compare \u0060src/librustdoc/html/markdown.rs\u0060 and \u0060src/librustdoc/passes/lint/redundant_explicit_links.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 38 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/librustdoc/html/markdown.rs:1830\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/librustdoc/html/markdown.rs"},"region":{"startLine":1830}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc168aad8191ec17924f0a763ee9ceba15fd9f844893f89b209682b669cc7007"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/librustdoc/passes/lint/html_tags.rs:741-748 | src/librustdoc/passes/lint/html_tags.rs:778-785 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/librustdoc/passes/lint/html_tags.rs:741\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/librustdoc/passes/lint/html_tags.rs"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa2af5f3584943af8ce61cb04b9f03e5e2c8a019f06cf1f662221399d0f44485"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/tools/clippy/clippy_dev/src/fmt.rs:144-151 | src/tools/clippy/clippy_dev/src/fmt.rs:156-163 \u2014 both copies are in the same file, so extract the block 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/tools/clippy/clippy_dev/src/fmt.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8c8888b8918a0e8dcd60225a8f7c7c159c5e0893f8dc752002e4ec205a97532"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/tools/clippy/clippy_lints/src/manual_let_else.rs:311-318 | src/tools/clippy/clippy_lints/src/manual_let_else.rs:323-330 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/tools/clippy/clippy_lints/src/manual_let_else.rs:319\u0060 calls \u0060sess\u0060, \u0060source_map\u0060, \u0060span_to_snippet\u0060 and \u0060src/tools/clippy/clippy_lints/src/manual_let_else.rs:331\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/tools/clippy/clippy_lints/src/manual_let_else.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"c58cdea5c17e91b284183646414c799f225f7913b89ea28d335a3b75077171ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/tools/clippy/clippy_lints/src/methods/iter_filter.rs:65-72 | src/tools/clippy/clippy_lints/src/methods/iter_filter.rs:80-87 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tools/clippy/clippy_lints/src/methods/iter_filter.rs:65\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/tools/clippy/clippy_lints/src/methods/iter_filter.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c3bbd5b1e9b7d1ef208fc05ec0d16fa76efd8268906da432cab413c0f1e21c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/tools/clippy/clippy_lints/src/methods/map_unwrap_or.rs:163-170 | src/tools/clippy/clippy_lints/src/option_if_let_else.rs:271-278 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/methods/map_unwrap_or.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"156724eb3e9ddccbe6827088ee8f8fb88ae5a68dc024ecd9db259087c809fea8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/tools/clippy/clippy_lints/src/methods/mod.rs:6016-6023 | src/tools/clippy/clippy_lints/src/methods/mod.rs:6039-6046 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/clippy/clippy_lints/src/methods/mod.rs:6016\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/tools/clippy/clippy_lints/src/methods/mod.rs"},"region":{"startLine":6016}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd608483b399b6235f5973951721c72b2a03a20f3bad780422cedc363f3dcc60"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/tools/clippy/clippy_lints/src/operators/op_ref.rs:98-106 | src/tools/clippy/clippy_lints/src/operators/op_ref.rs:160-167 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/clippy/clippy_lints/src/operators/op_ref.rs:98\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/operators/op_ref.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd14e0161bda98cecb985152305ded3c0a3ff245f3222f8fc673f41f52f75bb0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/tools/clippy/clippy_lints/src/tuple_array_conversions.rs:91-103 | src/tools/clippy/clippy_lints/src/tuple_array_conversions.rs:137-149 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tools/clippy/clippy_lints/src/tuple_array_conversions.rs:91\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/tuple_array_conversions.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"6da095db8eb22ff23a987453ad7a6f2a115cdcef5ce2de5819b80de7ae0e397a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/tools/clippy/clippy_lints/src/undocumented_may_panic_call.rs:174-181 | src/tools/clippy/clippy_lints/src/undocumented_unsafe_blocks.rs:807-814 \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/tools/clippy/clippy_lints/src/undocumented_may_panic_call.rs:174\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/tools/clippy/clippy_lints/src/undocumented_may_panic_call.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"b70de27707d5407f29770cab88edb6567cb9508c20a005fb7b89faeab44a2468"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/tools/clippy/clippy_lints/src/undocumented_unsafe_blocks.rs:150-158 | src/tools/clippy/clippy_lints/src/undocumented_unsafe_blocks.rs:178-186 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/clippy/clippy_lints/src/undocumented_unsafe_blocks.rs:150\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/tools/clippy/clippy_lints/src/undocumented_unsafe_blocks.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ff7e8e3df6d0829e648936a0bcfd124bdd8775628c0a1ac5a3105f80044a285"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/tools/clippy/clippy_utils/src/eager_or_lazy.rs:169-176 | src/tools/clippy/clippy_utils/src/eager_or_lazy.rs:178-185 \u2014 both copies are in the same file, so extract the block 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/tools/clippy/clippy_utils/src/eager_or_lazy.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"625cef3491b4f58fa87ac2a077ce2b448faa1d46b83e9e1dc9dfc2ce2a6b74ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/tools/clippy/clippy_utils/src/lib.rs:272-280 | src/tools/clippy/clippy_utils/src/lib.rs:287-295 \u2014 both copies are in the same file, so extract the block 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/tools/clippy/clippy_utils/src/lib.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e18b6c18c28ffddeea0178d4ebff367c9462a419fdfb14d5a8e372ae20fc783"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/tools/compiletest/src/runtest/compute_diff.rs:33-40 | src/tools/compiletest/src/runtest/compute_diff.rs:47-54 \u2014 both copies are in the same file, so extract the block 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/tools/compiletest/src/runtest/compute_diff.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce03d2d6cebaf806e8519bc188f9d2481a545ab1108f3408effe2fbf5fb4bcbc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/tools/miri/src/borrow_tracker/stacked_borrows/mod.rs:602-612 | src/tools/miri/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/tools/miri/src/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/tools/miri/src/borrow_tracker/stacked_borrows/mod.rs"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f2f7ef010ecfcd025cb30aec8a834a465d185df10235f4f50a5e92d86281c1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/tools/miri/src/intrinsics/x86/avx512.rs:235-242 | src/tools/miri/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/tools/miri/src/intrinsics/x86/avx512.rs:234\u0060 calls \u0060project_to_simd\u0060 and \u0060src/tools/miri/src/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/tools/miri/src/intrinsics/x86/avx512.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9e7c247080d470cc367756e6a4e8606c46e8c6b8eb75b61557c8510d6965ee4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/tools/miri/src/intrinsics/x86/mod.rs:319-326 | src/tools/miri/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/tools/miri/src/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/tools/miri/src/intrinsics/x86/mod.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6eebbdca23569d2cc13d9b97ceff0a017e3f1247c4f1de59859523768b03ee8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/tools/miri/src/machine.rs:1493-1500 | src/tools/miri/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/tools/miri/src/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/tools/miri/src/machine.rs"},"region":{"startLine":1493}}}],"partialFingerprints":{"codehealthFindingId/v1":"9365a278c192eaba5d641406e7d1a8b2c2449e73c6e51a5174ae388c8b216d6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/tools/miri/src/shims/foreign_items.rs:364-371 | src/tools/miri/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/tools/miri/src/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/tools/miri/src/shims/foreign_items.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a43133960db87cc51557b54173525795cf3396e93277ecfad526cbd20818a32"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/tools/miri/src/shims/unix/android/foreign_items.rs:101-108 | src/tools/miri/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/tools/miri/src/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/tools/miri/src/shims/unix/android/foreign_items.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"63117772b683e69a2731b547afe1dde6b7891d2c950194866215cbbe8cb624cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/tools/miri/src/shims/unix/android/foreign_items.rs:112-119 | src/tools/miri/src/shims/unix/linux/foreign_items.rs:271-278 \u2014 \u0060src/tools/miri/src/shims/unix/android/foreign_items.rs\u0060 and \u0060src/tools/miri/src/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/tools/miri/src/shims/unix/android/foreign_items.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"581326481cc3a3ee57ed3feb3aace24bc9ae6c541c5f1fd0e0852fa0baff694d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/tools/miri/src/shims/unix/foreign_items.rs:717-724 | src/tools/miri/src/shims/unix/solarish/foreign_items.rs:151-158 \u2014 before extracting anything, compare \u0060src/tools/miri/src/shims/unix/foreign_items.rs\u0060 and \u0060src/tools/miri/src/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/tools/miri/src/shims/unix/foreign_items.rs"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ffc529e689e0516975c3443e19230d786e38090d631e0b1ea03c645854b987f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/tools/miri/src/shims/unix/socket.rs:469-476 | src/tools/miri/src/shims/unix/socket.rs:878-885 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/miri/src/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/tools/miri/src/shims/unix/socket.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"f59514dc1207e68288f6fcde1e0aeb0258fa232de910313af4079d76275a6fa6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/tools/miri/src/shims/unix/socket.rs:838-845 | src/tools/miri/src/shims/unix/socket.rs:870-877 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/miri/src/shims/unix/socket.rs:838\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/tools/miri/src/shims/unix/socket.rs"},"region":{"startLine":838}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a5338f4d8b62bb8d19f23d0f123fcffcbf125c63bd0fef780ef7dcaebc10fc6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/tools/run-make-support/src/external_deps/c_build.rs:40-47 | src/tools/run-make-support/src/external_deps/c_build.rs:91-98 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tools/run-make-support/src/external_deps/c_build.rs:40\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/tools/run-make-support/src/external_deps/c_build.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b46d7edc89a703a306eb2de238b0118a6f938819232b956300148614437e9b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-def/src/expr_store/scope.rs:163-170 | src/tools/rust-analyzer/crates/hir-def/src/expr_store/scope.rs:182-189 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/expr_store/scope.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"c15d8756e4a8eeead809e36653d1112a289c3c1591472da2b44cd9f4e861bd65"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-def/src/find_path.rs:406-413 | src/tools/rust-analyzer/crates/hir-def/src/find_path.rs:423-430 \u2014 both copies are in the same file, so extract the block 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/tools/rust-analyzer/crates/hir-def/src/find_path.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"d94e866da4762d05376b35fc698a8d7307ed7ac02d860bf72cec7440c0b12fc8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-def/src/item_scope.rs:657-664 | src/tools/rust-analyzer/crates/hir-def/src/item_scope.rs:674-681 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tools/rust-analyzer/crates/hir-def/src/item_scope.rs:657\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/tools/rust-analyzer/crates/hir-def/src/item_scope.rs"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"f78a1214fa5488436a334ad8115a458cf075d2fc197fa6a60406ea6c0f095321"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-def/src/nameres/collector.rs:691-699 | src/tools/rust-analyzer/crates/hir-def/src/nameres/collector.rs:748-756 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/hir-def/src/nameres/collector.rs:691\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/tools/rust-analyzer/crates/hir-def/src/nameres/collector.rs"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"12c4bb6c2649145a047d48838380c3360759ee4765df638b9da60f1664dee66f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-def/src/nameres/collector.rs:2569-2576 | src/tools/rust-analyzer/crates/hir-def/src/nameres/collector.rs:2645-2652 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/hir-def/src/nameres/collector.rs:2569\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/tools/rust-analyzer/crates/hir-def/src/nameres/collector.rs:2578\u0060 calls \u0060empty\u0060, \u0060set\u0060 and \u0060src/tools/rust-analyzer/crates/hir-def/src/nameres/collector.rs:2654\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/tools/rust-analyzer/crates/hir-def/src/nameres/collector.rs"},"region":{"startLine":2569}}}],"partialFingerprints":{"codehealthFindingId/v1":"e821546b6ec7b8450ceafef90dde44c3248bf9b787965178000068a480b521ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-def/src/nameres/collector.rs:2583-2590 | src/tools/rust-analyzer/crates/hir-def/src/nameres/collector.rs:2655-2662 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tools/rust-analyzer/crates/hir-def/src/nameres/collector.rs:2583\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/tools/rust-analyzer/crates/hir-def/src/nameres/collector.rs"},"region":{"startLine":2583}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3e826edb75c8f7f22c2d7cd3c64a7df9494681ed33ee0a18fd43091b91051fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-expand/src/attrs.rs:325-332 | src/tools/rust-analyzer/crates/syntax/src/ast/token_ext.rs:278-285 \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/tools/rust-analyzer/crates/hir-expand/src/attrs.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"200107e8bdf737c0c289d7d24867c43a5fb97543d18cd6bcf5bf9a00f4e9b078"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-ty/src/infer.rs:2352-2359 | src/tools/rust-analyzer/crates/hir-ty/src/infer.rs:2401-2408 \u2014 both copies are in the same file, so extract the block 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/tools/rust-analyzer/crates/hir-ty/src/infer.rs"},"region":{"startLine":2352}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3f87270e0f69ae763a96dacdf2f0d42acc3781575643177501e4b15c09e3fba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-ty/src/mir/eval.rs:1351-1358 | src/tools/rust-analyzer/crates/hir-ty/src/mir/eval.rs:1381-1388 \u2014 both copies are in the same file, so extract the block 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/tools/rust-analyzer/crates/hir-ty/src/mir/eval.rs"},"region":{"startLine":1351}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc9f4c17ec210188b11578c82ff1dbc9229f723fb78d25ccffb1ecaa645c4477"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20138 lines \u00D7 3): src/tools/rust-analyzer/crates/hir-ty/src/next_solver/consts/valtree.rs:136-139 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/consts/valtree.rs:165-172 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/consts/valtree.rs:190-197 \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/tools/rust-analyzer/crates/hir-ty/src/next_solver/consts/valtree.rs:165\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. 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/tools/rust-analyzer/crates/hir-ty/src/next_solver/consts/valtree.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f236235e2e2ef15b01aaea3d675b3a7eda847c79f0ec584d817940350c5385e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/tools/rust-analyzer/crates/hir/src/lib.rs:2515-2522 | src/tools/rust-analyzer/crates/hir/src/lib.rs:2524-2531 \u2014 both copies are in the same file, so extract the block 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/tools/rust-analyzer/crates/hir/src/lib.rs"},"region":{"startLine":2515}}}],"partialFingerprints":{"codehealthFindingId/v1":"7de0f0b06d504ba5bf535372b57eaa0ba0db3ee50772e5a2430b7d8a2648c50c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/tools/rust-analyzer/crates/hir/src/semantics/child_by_source.rs:75-82 | src/tools/rust-analyzer/crates/hir/src/semantics/child_by_source.rs:102-109 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tools/rust-analyzer/crates/hir/src/semantics/child_by_source.rs:75\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/tools/rust-analyzer/crates/hir/src/semantics/child_by_source.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"7de662e4ef048c58051fee2116dc083832d3557962216def4e56213cdb470122"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/tools/rust-analyzer/crates/hir/src/semantics/source_to_def.rs:627-634 | src/tools/rust-analyzer/crates/hir/src/semantics/source_to_def.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/tools/rust-analyzer/crates/hir/src/semantics/source_to_def.rs:627\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/tools/rust-analyzer/crates/hir/src/semantics/source_to_def.rs"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d7d752ce1a9ecd049533922aec6b81c5a233eb89ebc020cdd9491b0687e9193"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/tools/rust-analyzer/crates/hir/src/source_analyzer.rs:1891-1898 | src/tools/rust-analyzer/crates/hir/src/source_analyzer.rs:2096-2103 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/hir/src/source_analyzer.rs:1891\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/tools/rust-analyzer/crates/hir/src/source_analyzer.rs"},"region":{"startLine":1891}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a34ef2eed1876f28dbb612f16a0928e1922c06f63804ab14a84d6e352dff673"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/tools/rust-analyzer/crates/ide-assists/src/handlers/bind_unused_param.rs:27-34 | src/tools/rust-analyzer/crates/ide-assists/src/handlers/remove_unused_param.rs:69-76 \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/tools/rust-analyzer/crates/ide-assists/src/handlers/bind_unused_param.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a8a794a5b06f428785166cf1b4e33e94e43832b730777ec5325c30c75e9ef8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_closure_to_fn.rs:115-122 | src/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_closure_to_fn.rs:126-133 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_closure_to_fn.rs:115\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/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_closure_to_fn.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b19f1c09c73e0c2dd995f60229bfe7ac9fb8bccac5ce56436ce5cf307a5e2eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_named_struct_to_tuple_struct.rs:62-73 | src/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_tuple_struct_to_named_struct.rs:64-75 \u2014 before extracting anything, compare \u0060src/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_named_struct_to_tuple_struct.rs\u0060 and \u0060src/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_tuple_struct_to_named_struct.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 35 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_named_struct_to_tuple_struct.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/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_named_struct_to_tuple_struct.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"dae5ba8b957a1eb4b80b75b5e535fa7fb9be6ababb7ad9e42e425f6ad202f255"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_named_struct_to_tuple_struct.rs:290-298 | src/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_tuple_struct_to_named_struct.rs:348-356 \u2014 before extracting anything, compare \u0060src/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_named_struct_to_tuple_struct.rs\u0060 and \u0060src/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_tuple_struct_to_named_struct.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 35 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_named_struct_to_tuple_struct.rs:290\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/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_named_struct_to_tuple_struct.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"b55662618e0e34192b3a54add379cad8f439283b6bb72510927e434a97530eed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_to_guarded_return.rs:125-132 | src/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_to_guarded_return.rs:204-211 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_to_guarded_return.rs:125\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/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_to_guarded_return.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c66810dc4d85897c53dcf2b3c424b5b09310a4f8ff01f8a54fa481d8717fec0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/tools/rust-analyzer/crates/ide-assists/src/handlers/extract_type_alias.rs:96-103 | src/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_fn_type_alias.rs:105-112 \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/tools/rust-analyzer/crates/ide-assists/src/handlers/extract_type_alias.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"249d23ff66ce77ff2260fea986932d543fc4b5bda842f68ad6d009aef7446b96"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/tools/rust-analyzer/crates/ide-assists/src/handlers/extract_type_alias.rs:156-163 | src/tools/rust-analyzer/crates/ide-assists/src/handlers/extract_type_alias.rs:165-172 \u2014 both copies are in the same file, so extract the block 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/tools/rust-analyzer/crates/ide-assists/src/handlers/extract_type_alias.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"d57cd107955dbaa7057dc3c4eab43ffbdff2c114d6ff6bb0fdb9ae9b01ce46be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_enum_is_method.rs:58-66 | src/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_enum_projection_method.rs:136-144 \u2014 before extracting anything, compare \u0060src/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_enum_is_method.rs\u0060 and \u0060src/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_enum_projection_method.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 62 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/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_enum_is_method.rs:58\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/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_enum_is_method.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ec3873d67e618fd35fb645143f7922ea899d3b61d65924352c920901526ce34"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/tools/rust-analyzer/crates/ide-completion/src/completions/attribute.rs:101-108 | src/tools/rust-analyzer/crates/ide-completion/src/completions/item_list.rs:47-54 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tools/rust-analyzer/crates/ide-completion/src/completions/attribute.rs:101\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/tools/rust-analyzer/crates/ide-completion/src/completions/attribute.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7a30a1f6d08dbc1420fb623040b7bffaefaa9226cdd0c1bd0906c5cc5106ca2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/tools/rust-analyzer/crates/ide-completion/src/completions/expr.rs:172-179 | src/tools/rust-analyzer/crates/ide-completion/src/completions/type.rs:99-106 \u2014 before extracting anything, compare \u0060src/tools/rust-analyzer/crates/ide-completion/src/completions/expr.rs\u0060 and \u0060src/tools/rust-analyzer/crates/ide-completion/src/completions/type.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 49 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tools/rust-analyzer/crates/ide-completion/src/completions/expr.rs:172\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/tools/rust-analyzer/crates/ide-completion/src/completions/expr.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"37d1b1c7a6f47da4662215a68972f3926fd78848a40c4868cd96af3b88c22661"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/tools/rust-analyzer/crates/ide/src/hover/render.rs:122-129 | src/tools/rust-analyzer/crates/ide/src/hover/render.rs:167-174 \u2014 both copies are in the same file, so extract the block 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/tools/rust-analyzer/crates/ide/src/hover/render.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"1abea3700eccd687c0c84f85d6abeabf71a69cd8c0653338e8a8310d8e43da12"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/tools/rust-analyzer/crates/intern/src/gc.rs:137-144 | src/tools/rust-analyzer/crates/intern/src/gc.rs:150-157 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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/tools/rust-analyzer/crates/intern/src/gc.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"83335b31671d712786b4bfd78b3cc91ca3835078cac6fe8a0b3a5229dc2eef5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20138 lines \u00D7 4): src/tools/rust-analyzer/crates/rust-analyzer/src/cli/analysis_stats.rs:1505-1508 | src/tools/rust-analyzer/crates/rust-analyzer/src/cli/analysis_stats.rs:1521-1524 | src/tools/rust-analyzer/crates/rust-analyzer/src/cli/analysis_stats.rs:1543-1550 | src/tools/rust-analyzer/crates/rust-analyzer/src/cli/analysis_stats.rs:1564-1571 \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/tools/rust-analyzer/crates/rust-analyzer/src/cli/analysis_stats.rs:1543\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/tools/rust-analyzer/crates/rust-analyzer/src/cli/analysis_stats.rs:1541\u0060 calls \u0060file_path\u0060, \u0060file_id\u0060, \u0060line_index\u0060 and \u0060src/tools/rust-analyzer/crates/rust-analyzer/src/cli/analysis_stats.rs:1505\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/tools/rust-analyzer/crates/rust-analyzer/src/cli/analysis_stats.rs"},"region":{"startLine":1505}}}],"partialFingerprints":{"codehealthFindingId/v1":"6134e937d2616f4b3365a050f69df5763fb224886e6df907c358fed4e6517c83"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/tools/rust-analyzer/lib/smol_str/src/serde.rs:45-52 | src/tools/rust-analyzer/lib/smol_str/src/serde.rs:55-62 \u2014 both copies are in the same file, so extract the block 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/tools/rust-analyzer/lib/smol_str/src/serde.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"4363084982850a6460c6e26dcc886307e4a6ed2cc7a53d6864517211463f88b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/tools/rustfmt/src/items.rs:2341-2348 | src/tools/rustfmt/src/items.rs:2369-2376 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/items.rs"},"region":{"startLine":2341}}}],"partialFingerprints":{"codehealthFindingId/v1":"c209beb1e6a3fc29789bd9cec18bdebd73f9f441f91fa64d9a541724254d897f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/tools/rustfmt/src/matches.rs:461-468 | src/tools/rustfmt/src/matches.rs:504-511 \u2014 both copies are in the same file, so extract the block 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/tools/rustfmt/src/matches.rs"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8c8e02632e2abb5d295342844a2e7d02a494fa56b93c9d0eaab6217ad938838"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): src/tools/rustfmt/src/patterns.rs:179-185 | src/tools/rustfmt/src/patterns.rs:202-209 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tools/rustfmt/src/patterns.rs:179\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/patterns.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc4e1fecf861f6d46a3b3f43aa5774681e3882a879b16f9e5532537734c6763c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/tools/rustfmt/src/types.rs:497-504 | src/tools/rustfmt/src/types.rs:727-734 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rustfmt/src/types.rs:497\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/types.rs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e7d6d26377ab4c338e48e898b2cc5766ea2ada1a25faf421b0127d37ac2ec63"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 10): src/tools/miri/src/intrinsics/x86/avx.rs:134-140 | src/tools/miri/src/intrinsics/x86/avx.rs:164-170 | src/tools/miri/src/intrinsics/x86/gfni.rs:48-54 | src/tools/miri/src/intrinsics/x86/mod.rs:338-344 | src/tools/miri/src/intrinsics/x86/mod.rs:517-523 | src/tools/miri/src/intrinsics/x86/mod.rs:866-872 | src/tools/miri/src/intrinsics/x86/mod.rs:912-918 | src/tools/miri/src/intrinsics/x86/mod.rs:1265-1271 | src/tools/miri/src/intrinsics/x86/mod.rs:1363-1369 | src/tools/miri/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/tools/miri/src/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/tools/miri/src/intrinsics/x86/avx.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"6117ec93d81ccecd111eac08ecc9a299777e729c3e5e8ab6e8b82b5228974d67"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 7): src/tools/miri/src/intrinsics/aarch64.rs:323-329 | src/tools/miri/src/intrinsics/aarch64.rs:348-354 | src/tools/miri/src/intrinsics/aarch64.rs:372-378 | src/tools/miri/src/intrinsics/aarch64.rs:395-401 | src/tools/miri/src/intrinsics/x86/sha.rs:56-62 | src/tools/miri/src/intrinsics/x86/sha.rs:76-82 | src/tools/miri/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/tools/miri/src/intrinsics/aarch64.rs:368\u0060 calls \u0060expect_target_feature_for_intrinsic\u0060 and \u0060src/tools/miri/src/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/tools/miri/src/intrinsics/aarch64.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1b38199a1f7c2ef898c7cebca7ea9180e7edbf3608d264ca5b5da1faf102686"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 6): compiler/rustc_next_trait_solver/src/placeholder.rs:259-265 | compiler/rustc_next_trait_solver/src/placeholder.rs:287-293 | compiler/rustc_next_trait_solver/src/placeholder.rs:318-324 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/util.rs:646-652 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/util.rs:674-680 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/util.rs:705-711 \u2014 there are 6 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 6 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_next_trait_solver/src/placeholder.rs:259\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":"compiler/rustc_next_trait_solver/src/placeholder.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"533f30d716e1634f67747f2d5d7683350a89766409c77af0316967ffd368807f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 6): src/tools/miri/src/shims/unix/socket.rs:326-332 | src/tools/miri/src/shims/unix/socket.rs:347-353 | src/tools/miri/src/shims/unix/socket.rs:735-741 | src/tools/miri/src/shims/unix/socket.rs:772-778 | src/tools/miri/src/shims/unix/socket.rs:845-851 | src/tools/miri/src/shims/unix/socket.rs:919-925 \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/tools/miri/src/shims/unix/socket.rs:768\u0060 calls \u0060read_pointer\u0060 and \u0060src/tools/miri/src/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/tools/miri/src/shims/unix/socket.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"7be793fe22fdefac6045da7041f11652f400319c7f056a0944d177c90dbe6a78"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u20137 lines \u00D7 7): src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:593-599 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:796-802 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:850-851 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1075-1081 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1659-1665 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1709-1717 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1753-1761 \u2014 all 7 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/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:593\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060fields\u0060 to \u0060impl IntoIterator\u003CItem = ast::Expr\u003E\u0060 in one and \u0060impl IntoIterator\u003CItem = ast::RecordExprField\u003E\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/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"e861cd91342bfe72fd7614e19cbeda27bd0cd280d72d19619b49ba5fad803ae6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5): compiler/rustc_borrowck/src/lib.rs:1975-1981 | compiler/rustc_next_trait_solver/src/solve/assembly/mod.rs:824-830 | compiler/rustc_next_trait_solver/src/solve/assembly/mod.rs:971-977 | compiler/rustc_next_trait_solver/src/solve/assembly/structural_traits.rs:581-587 | compiler/rustc_type_ir/src/ty_kind.rs:407-413 \u2014 before extracting anything, compare \u0060compiler/rustc_next_trait_solver/src/solve/assembly/mod.rs\u0060 and \u0060compiler/rustc_type_ir/src/ty_kind.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 36 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, \u0060compiler/rustc_next_trait_solver/src/solve/assembly/mod.rs:823\u0060 calls \u0060Adt\u0060 and \u0060compiler/rustc_borrowck/src/lib.rs:1974\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":"compiler/rustc_borrowck/src/lib.rs"},"region":{"startLine":1975}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f50de27302e3a3c13f5b288b4d7c0ca6e3cf952c4626bc64f0c16f6eb36e331"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5): src/tools/miri/src/shims/unix/socket.rs:381-387 | src/tools/miri/src/shims/unix/socket.rs:468-474 | src/tools/miri/src/shims/unix/socket.rs:535-541 | src/tools/miri/src/shims/unix/socket.rs:620-626 | src/tools/miri/src/shims/unix/socket.rs:877-883 \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/tools/miri/src/shims/unix/socket.rs:378\u0060 calls \u0060Some\u0060, \u0060read_scalar\u0060, \u0060to_i32\u0060 and \u0060src/tools/miri/src/shims/unix/socket.rs:874\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/tools/miri/src/shims/unix/socket.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc7022c33356f5eaa30d4820fd5d96cea6869c021cbb0f7c9e1d0c41ff75a1a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): compiler/rustc_const_eval/src/interpret/stack.rs:521-527 | compiler/rustc_middle/src/ty/sty.rs:1957-1963 | compiler/rustc_next_trait_solver/src/solve/assembly/structural_traits.rs:130-136 | compiler/rustc_trait_selection/src/traits/select/mod.rs:2035-2041 \u2014 before extracting anything, compare \u0060compiler/rustc_next_trait_solver/src/solve/assembly/structural_traits.rs\u0060 and \u0060compiler/rustc_trait_selection/src/traits/select/mod.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 40 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060compiler/rustc_middle/src/ty/sty.rs:1964\u0060 calls \u0060UnsafeBinder\u0060 and \u0060compiler/rustc_const_eval/src/interpret/stack.rs:528\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":"compiler/rustc_const_eval/src/interpret/stack.rs"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"79356e371a0a6a6f8e9ee6c6551059fb13d4071565468adde1fca4a9ee0e9db2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): compiler/rustc_next_trait_solver/src/solve/assembly/structural_traits.rs:212-219 | compiler/rustc_next_trait_solver/src/solve/trait_goals.rs:805-811 | compiler/rustc_trait_selection/src/traits/effects.rs:361-368 | compiler/rustc_trait_selection/src/traits/select/mod.rs:2093-2100 \u2014 before extracting anything, compare \u0060compiler/rustc_next_trait_solver/src/solve/assembly/structural_traits.rs\u0060 and \u0060compiler/rustc_trait_selection/src/traits/effects.rs\u0060 as WHOLE FILES: this scan already matched 7 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. 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":"compiler/rustc_next_trait_solver/src/solve/assembly/structural_traits.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0a973b4f61ad911ed6b184de0dd76d33fab497feb25f98ab1f920d641bf5f7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): library/alloc/src/boxed.rs:1057-1063 | library/alloc/src/boxed.rs:1095-1101 | library/alloc/src/boxed.rs:1193-1199 | library/alloc/src/boxed.rs:1236-1242 \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 \u0060library/alloc/src/boxed.rs:1057\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":"library/alloc/src/boxed.rs"},"region":{"startLine":1057}}}],"partialFingerprints":{"codehealthFindingId/v1":"53b2ae40e01214c21838f7cc05933364150f6d3443eb502a55fed20441277d81"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): library/stdarch/crates/core_arch/src/x86/avx512bw.rs:8741-8747 | library/stdarch/crates/core_arch/src/x86/avx512bw.rs:8872-8878 | library/stdarch/crates/core_arch/src/x86/avx512bw.rs:9011-9017 | library/stdarch/crates/core_arch/src/x86/avx512bw.rs:9142-9148 \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 \u0060library/stdarch/crates/core_arch/src/x86/avx512bw.rs:8741\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":"library/stdarch/crates/core_arch/src/x86/avx512bw.rs"},"region":{"startLine":8741}}}],"partialFingerprints":{"codehealthFindingId/v1":"7149b9ed79e0354529170fcec5583a9e30f271b5f30816e1f8a45a2d84a71724"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): library/stdarch/crates/core_arch/src/x86/avx512f.rs:25098-25104 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:25181-25187 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:25402-25408 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:25485-25491 \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 \u0060library/stdarch/crates/core_arch/src/x86/avx512f.rs:25098\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":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":25098}}}],"partialFingerprints":{"codehealthFindingId/v1":"482eaf9c659ece43d7bcd53e83298da5bce372061ae37635ab5e921de873e037"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): library/stdarch/crates/core_arch/src/x86/avx512fp16.rs:5743-5749 | library/stdarch/crates/core_arch/src/x86/avx512fp16.rs:6250-6256 | library/stdarch/crates/core_arch/src/x86/avx512fp16.rs:6764-6770 | library/stdarch/crates/core_arch/src/x86/avx512fp16.rs:7278-7284 \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 \u0060library/stdarch/crates/core_arch/src/x86/avx512fp16.rs:5743\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":"library/stdarch/crates/core_arch/src/x86/avx512fp16.rs"},"region":{"startLine":5743}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbfb7ad2752ef6c28be7b5e6e5c18fc32ebfd1bc2b002879e3be79c4d0f3dc9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): src/tools/clippy/clippy_lints/src/arbitrary_source_item_ordering.rs:285-291 | src/tools/clippy/clippy_lints/src/arbitrary_source_item_ordering.rs:321-327 | src/tools/clippy/clippy_lints/src/arbitrary_source_item_ordering.rs:356-362 | src/tools/clippy/clippy_lints/src/arbitrary_source_item_ordering.rs:452-458 \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/tools/clippy/clippy_lints/src/arbitrary_source_item_ordering.rs:285\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 \u0060cx\u0060 to \u0060\u0026LateContext\u003C\u0027_\u003E\u0060 in one and \u0060\u0026LateContext\u003C\u0027tcx\u003E\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/tools/clippy/clippy_lints/src/arbitrary_source_item_ordering.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6fcf61f078c06db2b8dc6e43c17a6e1e6634429c27184db6687eacbe33beca8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): src/tools/rust-analyzer/crates/syntax/src/syntax_editor/edits.rs:60-66 | src/tools/rust-analyzer/crates/syntax/src/syntax_editor/edits.rs:76-82 | src/tools/rust-analyzer/crates/syntax/src/syntax_editor/edits.rs:94-100 | src/tools/rust-analyzer/crates/syntax/src/syntax_editor/edits.rs:106-112 \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/tools/rust-analyzer/crates/syntax/src/syntax_editor/edits.rs:60\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/syntax/src/syntax_editor/edits.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b8d9dca6911e0bc52e2e5735622c24a465ca2f139af27b3e6c2602c4cfbdee8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): compiler/rustc_codegen_cranelift/src/intrinsics/llvm_aarch64.rs:61-67 | compiler/rustc_codegen_cranelift/src/intrinsics/llvm_aarch64.rs:96-102 | compiler/rustc_codegen_cranelift/src/intrinsics/llvm_aarch64.rs:132-138 \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 \u0060compiler/rustc_codegen_cranelift/src/intrinsics/llvm_aarch64.rs:61\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":"compiler/rustc_codegen_cranelift/src/intrinsics/llvm_aarch64.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"943b68997bc9c5c65bd3960864a8868c54d9e24d4b119008c2557b47764cf051"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): compiler/rustc_codegen_ssa/src/mir/intrinsic.rs:375-381 | compiler/rustc_codegen_ssa/src/mir/intrinsic.rs:393-399 | compiler/rustc_codegen_ssa/src/mir/intrinsic.rs:414-420 \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":"compiler/rustc_codegen_ssa/src/mir/intrinsic.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aef17e40d77035969c8ef44cfcca61b297e6223998b4e2e3e76cce1b725348e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): compiler/rustc_hir_typeck/src/fn_ctxt/checks.rs:2868-2875 | compiler/rustc_hir_typeck/src/fn_ctxt/checks.rs:2897-2904 | compiler/rustc_hir_typeck/src/fn_ctxt/checks.rs:2930-2937 \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":"compiler/rustc_hir_typeck/src/fn_ctxt/checks.rs"},"region":{"startLine":2868}}}],"partialFingerprints":{"codehealthFindingId/v1":"9db1825e3218a1d5f8f92bdcb58e95ea43a41b01217a5435d60427bf88effa70"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 3): compiler/rustc_middle/src/mir/pretty.rs:226-232 | compiler/rustc_middle/src/mir/pretty.rs:235-241 | compiler/rustc_middle/src/mir/pretty.rs:257-262 \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. 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":"compiler/rustc_middle/src/mir/pretty.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"461e663b9e0bb9cb08644a6cb3e2d3e9818c5ad2177e555f53e4296111170acd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): compiler/rustc_next_trait_solver/src/solve/assembly/structural_traits.rs:401-407 | compiler/rustc_next_trait_solver/src/solve/assembly/structural_traits.rs:585-591 | compiler/rustc_next_trait_solver/src/solve/assembly/structural_traits.rs:758-764 \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, \u0060compiler/rustc_next_trait_solver/src/solve/assembly/structural_traits.rs:584\u0060 calls \u0060Pat\u0060 and \u0060compiler/rustc_next_trait_solver/src/solve/assembly/structural_traits.rs:400\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":"compiler/rustc_next_trait_solver/src/solve/assembly/structural_traits.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d1cd4141cb1a46f44d9e8854af64b1237b94f9cc170233139f6247fd1fe97ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): compiler/rustc_resolve/src/late.rs:2920-2927 | compiler/rustc_resolve/src/late.rs:3069-3075 | compiler/rustc_resolve/src/late.rs:3088-3094 \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 \u0060compiler/rustc_resolve/src/late.rs:2920\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":"compiler/rustc_resolve/src/late.rs"},"region":{"startLine":2920}}}],"partialFingerprints":{"codehealthFindingId/v1":"05977ba80f64181f18458b1bd62a5744c2fe2f5190a1c9c7a3319f611ddf3f2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): compiler/rustc_target/src/callconv/s390x.rs:121-127 | compiler/rustc_target/src/callconv/x86.rs:90-96 | compiler/rustc_target/src/callconv/x86_win64.rs:17-23 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_target/src/callconv/s390x.rs:121\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":"compiler/rustc_target/src/callconv/s390x.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"607c3865bbfab8457a0605576c1928eecdc693c4d4055343e3bf362770b9f38a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): compiler/rustc_type_ir_macros/src/lib.rs:94-100 | compiler/rustc_type_ir_macros/src/lib.rs:135-141 | compiler/rustc_type_ir_macros/src/lib.rs:241-247 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060compiler/rustc_type_ir_macros/src/lib.rs:102\u0060 calls \u0060filter\u0060, \u0060has_ignore_attr\u0060, \u0060ast\u0060 and \u0060compiler/rustc_type_ir_macros/src/lib.rs:143\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":"compiler/rustc_type_ir_macros/src/lib.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c3eb306fb3d8a1be51b5e79f97ac666ca91b698ce215b2b00ef74bb2324bf97"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): library/compiler-builtins/libm/src/math/log10.rs:83-89 | library/compiler-builtins/libm/src/math/log1p.rs:133-139 | library/compiler-builtins/libm/src/math/log2.rs:80-86 \u2014 before extracting anything, compare \u0060library/compiler-builtins/libm/src/math/log10.rs\u0060 and \u0060library/compiler-builtins/libm/src/math/log2.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 98 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":"library/compiler-builtins/libm/src/math/log10.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"608c9aed77873217ecc1e6c6f9c989fe7dcbd8f51e4e2997ed3ed56a70e3d8ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): library/compiler-builtins/libm/src/math/log10f.rs:75-81 | library/compiler-builtins/libm/src/math/log1pf.rs:88-94 | library/compiler-builtins/libm/src/math/log2f.rs:72-78 \u2014 before extracting anything, compare \u0060library/compiler-builtins/libm/src/math/log10f.rs\u0060 and \u0060library/compiler-builtins/libm/src/math/log2f.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 79 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":"library/compiler-builtins/libm/src/math/log10f.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b13ffd5e4112769bed595e1a8824c1d742f4e62cb918883f3105a115a210111"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): library/std/src/sync/mpmc/array.rs:137-143 | library/std/src/sync/mpmc/array.rs:221-227 | library/std/src/sync/mpmc/array.rs:507-513 \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":"library/std/src/sync/mpmc/array.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"68accbf914ed259ad24022e331ac9a5d7fd4b78fc9c2669a9e2cc0596d12e87a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): library/stdarch/crates/core_arch/src/x86/avx2.rs:215-221 | library/stdarch/crates/core_arch/src/x86/avx512bw.rs:12090-12096 | library/stdarch/crates/core_arch/src/x86/ssse3.rs:139-145 \u2014 before extracting anything, compare \u0060library/stdarch/crates/core_arch/src/x86/avx2.rs\u0060 and \u0060library/stdarch/crates/core_arch/src/x86/avx512bw.rs\u0060 as WHOLE FILES: this scan already matched 6 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. 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 \u0060library/stdarch/crates/core_arch/src/x86/avx2.rs:215\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":"library/stdarch/crates/core_arch/src/x86/avx2.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"f181268756b3831a2c9aef3ded021077b6ff2420b82b7408ddfcbed2fe44c1b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): library/stdarch/crates/stdarch-gen-arm/src/intrinsic.rs:1242-1248 | library/stdarch/crates/stdarch-gen-arm/src/intrinsic.rs:1311-1317 | library/stdarch/crates/stdarch-gen-arm/src/intrinsic.rs:1404-1410 \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":"library/stdarch/crates/stdarch-gen-arm/src/intrinsic.rs"},"region":{"startLine":1242}}}],"partialFingerprints":{"codehealthFindingId/v1":"e28bf75be547d4f8ad1617d4b741360bf3321f1b73d4db0192cf7eb86c08c02a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): library/stdarch/crates/stdarch-gen-loongarch/src/main.rs:416-422 | library/stdarch/crates/stdarch-gen-loongarch/src/main.rs:427-433 | library/stdarch/crates/stdarch-gen-loongarch/src/main.rs:438-444 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/stdarch/crates/stdarch-gen-loongarch/src/main.rs:416\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":"library/stdarch/crates/stdarch-gen-loongarch/src/main.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"683b4e9cd8d8bc7106025e0ed3e66a30ebce865f2cd30090392202ecea276218"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): src/tools/clippy/clippy_lints/src/missing_doc.rs:167-173 | src/tools/clippy/clippy_lints/src/missing_doc.rs:201-207 | src/tools/clippy/clippy_lints/src/missing_doc.rs:222-228 \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/tools/clippy/clippy_lints/src/missing_doc.rs:167\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 \u0060item\u0060 to \u0060\u0026\u0027tcx Item\u003C\u0027_\u003E\u0060 in one and \u0060\u0026\u0027tcx TraitItem\u003C\u0027_\u003E\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/tools/clippy/clippy_lints/src/missing_doc.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4cad0f81daf24c0de8709af0f985d2f79db8aa429f5840403e904ef4daa28a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 3): src/tools/miri/src/intrinsics/aarch64.rs:232-237 | src/tools/miri/src/intrinsics/simd.rs:81-87 | src/tools/miri/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/tools/miri/src/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/tools/miri/src/intrinsics/aarch64.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"842c205d52d0317cf2e6ef138782aac47f1cb064eccc791b062aa04e9a70d6ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/tools/miri/src/shims/unix/android/foreign_items.rs:81-88 | src/tools/miri/src/shims/unix/linux/foreign_items.rs:207-214 | src/tools/miri/src/shims/unix/solarish/foreign_items.rs:37-44 \u2014 \u0060src/tools/miri/src/shims/unix/android/foreign_items.rs\u0060 and \u0060src/tools/miri/src/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/tools/miri/src/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/tools/miri/src/shims/unix/android/foreign_items.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"025d2750593c654f6ba40fab379ba4d34c3d10b6272ed7ea89363b4175fbb069"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): src/tools/miri/src/shims/unix/android/foreign_items.rs:96-102 | src/tools/miri/src/shims/unix/linux/foreign_items.rs:222-228 | src/tools/miri/src/shims/unix/solarish/foreign_items.rs:54-60 \u2014 \u0060src/tools/miri/src/shims/unix/android/foreign_items.rs\u0060 and \u0060src/tools/miri/src/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/tools/miri/src/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/tools/miri/src/shims/unix/solarish/foreign_items.rs:53\u0060 calls \u0060assert_target_os\u0060 and \u0060src/tools/miri/src/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/tools/miri/src/shims/unix/android/foreign_items.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"f15cc5113ef5b2edd176a093312511c65870f0e21c5c24c0761e13273651d251"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): src/tools/rust-analyzer/crates/hir-def/src/item_scope.rs:391-397 | src/tools/rust-analyzer/crates/hir-def/src/item_scope.rs:402-408 | src/tools/rust-analyzer/crates/hir-def/src/item_scope.rs:413-419 \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/tools/rust-analyzer/crates/hir-def/src/item_scope.rs:391\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/tools/rust-analyzer/crates/hir-def/src/item_scope.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"509a154b4b2657f26edaef92c5ceb94e86db86c6d6b4e44e2863429391bebd10"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): src/tools/rust-analyzer/crates/hir-expand/src/attrs.rs:323-329 | src/tools/rust-analyzer/crates/syntax/src/ast/token_ext.rs:276-282 | src/tools/rust-analyzer/crates/syntax/src/ast/token_ext.rs:320-326 \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/tools/rust-analyzer/crates/hir-expand/src/attrs.rs:323\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/tools/rust-analyzer/crates/hir-expand/src/attrs.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"970f65f87e52e7a293efea5bef58a668e95de19eb394333d40c4f5d5d6d83e32"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): src/tools/rust-analyzer/crates/hir-ty/src/db.rs:380-386 | src/tools/rust-analyzer/crates/hir-ty/src/db.rs:409-415 | src/tools/rust-analyzer/crates/hir-ty/src/db.rs:439-445 \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/tools/rust-analyzer/crates/hir-ty/src/db.rs:380\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/tools/rust-analyzer/crates/hir-ty/src/db.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c5067ae833aa30b4ffa314f69651c03a855988cf8d581b37e984a2ba7b7d804"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): src/tools/rust-analyzer/crates/hir/src/lib.rs:5723-5729 | src/tools/rust-analyzer/crates/hir/src/lib.rs:5738-5744 | src/tools/rust-analyzer/crates/hir/src/lib.rs:5749-5755 \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/tools/rust-analyzer/crates/hir/src/lib.rs"},"region":{"startLine":5723}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0e934a5192fb9439d66d65a0e33162f57bba2c9794d69e422066fbc67e73869"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): src/tools/rust-analyzer/crates/ide/src/hover/render.rs:120-127 | src/tools/rust-analyzer/crates/ide/src/hover/render.rs:166-172 | src/tools/rust-analyzer/crates/ide/src/hover/render.rs:983-989 \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/tools/rust-analyzer/crates/ide/src/hover/render.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"b84414d515fdacd6014d6057b0fddc2fc17ee618a52028590525785294389af5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): src/tools/rust-analyzer/crates/ide/src/hover/render.rs:166-172 | src/tools/rust-analyzer/crates/ide/src/hover/render.rs:280-286 | src/tools/rust-analyzer/crates/ide/src/hover/render.rs:983-989 \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/tools/rust-analyzer/crates/ide/src/hover/render.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"33b63dc629c9c1f9075ec607819cee553efe031f8fa9687a8ee544624169f791"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): src/tools/rust-analyzer/crates/parser/src/grammar/items/adt.rs:149-155 | src/tools/rust-analyzer/crates/parser/src/grammar/items/adt.rs:161-167 | src/tools/rust-analyzer/crates/parser/src/grammar/items/adt.rs:221-227 \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/tools/rust-analyzer/crates/parser/src/grammar/items/adt.rs:149\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/parser/src/grammar/items/adt.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebc4743f151d2f5edee714e33e50b2c35f149648b386d2058654748b1ab39460"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): compiler/rustc_ast/src/ast.rs:1579-1585 | compiler/rustc_hir/src/hir.rs:2240-2246 \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":"compiler/rustc_ast/src/ast.rs"},"region":{"startLine":1579}}}],"partialFingerprints":{"codehealthFindingId/v1":"25092bb7a4c0891cc9783e9e0b26235f088ac41d3eec81ba6ff43dd1ceade7b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): compiler/rustc_ast_pretty/src/pprust/state.rs:1372-1378 | compiler/rustc_hir_pretty/src/lib.rs:422-428 \u2014 before extracting anything, compare \u0060compiler/rustc_ast_pretty/src/pprust/state.rs\u0060 and \u0060compiler/rustc_hir_pretty/src/lib.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 54 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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060ty\u0060 to \u0060\u0026ast::Ty\u0060 in one and \u0060\u0026hir::Ty\u003C\u0027_\u003E\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":"compiler/rustc_ast_pretty/src/pprust/state.rs"},"region":{"startLine":1372}}}],"partialFingerprints":{"codehealthFindingId/v1":"f56c62fee321792538afcf0c6770c1b7ec0855d083bede77b832e9a006ab5a42"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): compiler/rustc_ast_pretty/src/pprust/state/expr.rs:313-319 | compiler/rustc_hir_pretty/src/lib.rs:1425-1431 \u2014 before extracting anything, compare \u0060compiler/rustc_ast_pretty/src/pprust/state/expr.rs\u0060 and \u0060compiler/rustc_hir_pretty/src/lib.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 47 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 \u0060compiler/rustc_ast_pretty/src/pprust/state/expr.rs:313\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":"compiler/rustc_ast_pretty/src/pprust/state/expr.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"c12237880590ee44254d0b4906144aba0b4c4712befb0e7087fbfe8335131462"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): compiler/rustc_ast_pretty/src/pprust/state/expr.rs:547-553 | compiler/rustc_hir_pretty/src/lib.rs:1658-1664 \u2014 before extracting anything, compare \u0060compiler/rustc_ast_pretty/src/pprust/state/expr.rs\u0060 and \u0060compiler/rustc_hir_pretty/src/lib.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 47 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":"compiler/rustc_ast_pretty/src/pprust/state/expr.rs"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d32b479bb533ff812e36750e870967da9d948d6d5cfe9cf98ae1c3b2db136cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): compiler/rustc_attr_parsing/src/attributes/rustc_dump.rs:145-151 | compiler/rustc_attr_parsing/src/attributes/rustc_dump.rs:321-327 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_attr_parsing/src/attributes/rustc_dump.rs:145\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":"compiler/rustc_attr_parsing/src/attributes/rustc_dump.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"e54ea85e2db2e47fed7a724729b4e25f95d23b82e3b2c3108abab70bbefd5a97"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): compiler/rustc_borrowck/src/diagnostics/mod.rs:926-932 | compiler/rustc_borrowck/src/diagnostics/mod.rs:956-962 \u2014 both copies are in the same file, so extract the block 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":"compiler/rustc_borrowck/src/diagnostics/mod.rs"},"region":{"startLine":926}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2e475a1b8d7f716c0e15185bf93e1391e162bc445d7af97350b29dc5d2c4fd0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): compiler/rustc_borrowck/src/diagnostics/mutability_errors.rs:95-101 | compiler/rustc_borrowck/src/diagnostics/mutability_errors.rs:484-490 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_borrowck/src/diagnostics/mutability_errors.rs:95\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/diagnostics/mutability_errors.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cacd32b7a303c77e506c304f4177d2bb5531b62ce09a7c9b8a5d902bc32e1e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201321 lines \u00D7 2): compiler/rustc_borrowck/src/universal_regions.rs:624-644 | compiler/rustc_borrowck/src/universal_regions.rs:649-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":"compiler/rustc_borrowck/src/universal_regions.rs"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3f413bff8678f8aac588f81402102acfef5611c2268d99a12abc6711e7d3eb1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): compiler/rustc_builtin_macros/src/concat.rs:15-21 | compiler/rustc_builtin_macros/src/concat_bytes.rs:140-146 \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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060sp\u0060 to \u0060rustc_span::Span\u0060 in one and \u0060Span\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":"compiler/rustc_builtin_macros/src/concat.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b1227b86ece6d86221e812b64bf45bc8ccfb838a5ed5ba4b87ddeeb6c1003f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): compiler/rustc_builtin_macros/src/format.rs:559-565 | src/tools/rust-analyzer/crates/hir-def/src/hir/format_args.rs:376-382 \u2014 before extracting anything, compare \u0060compiler/rustc_builtin_macros/src/format.rs\u0060 and \u0060src/tools/rust-analyzer/crates/hir-def/src/hir/format_args.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 113 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 \u0060compiler/rustc_builtin_macros/src/format.rs:559\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":"compiler/rustc_builtin_macros/src/format.rs"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e067aff2ea4cea6bdd57d45623237c63800da72de55f22212e00464847e47d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): compiler/rustc_builtin_macros/src/format_foreign/printf/mod.rs:289-295 | compiler/rustc_builtin_macros/src/format_foreign/shell/mod.rs:56-62 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_builtin_macros/src/format_foreign/printf/mod.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"c875edc9d9732a588375f9f0be14e9b43763938771491fa7719e5be4ffb11a14"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): compiler/rustc_builtin_macros/src/source_util.rs:211-218 | compiler/rustc_builtin_macros/src/source_util.rs:245-252 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_builtin_macros/src/source_util.rs:211\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":"compiler/rustc_builtin_macros/src/source_util.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"48ad198b98a5cd402322966e85833e614ff402eb15490061836bed73f5990ac3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): compiler/rustc_builtin_macros/src/util.rs:141-147 | compiler/rustc_builtin_macros/src/util.rs:196-202 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_builtin_macros/src/util.rs:141\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":"compiler/rustc_builtin_macros/src/util.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"6542c960182733c60d861634eb87ff57a3c9e3f19886755d2d334c1eceb4f24b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs:384-390 | compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs:553-559 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs:384\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":"compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"0273ddd5ff6f50d4a8f35230807f653edaed349821312b0ce186fa2741440a66"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs:768-774 | compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs:787-793 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs:768\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":"compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"e499a31a3a777acb9268429ddec46816d23338c58d94a43b85ad337bccb71455"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs:1042-1050 | compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs:1171-1179 \u2014 both copies are in the same file, so extract the block 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":"compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs"},"region":{"startLine":1042}}}],"partialFingerprints":{"codehealthFindingId/v1":"59379d5fda1b1b0fd58e63dfc972ac90f9ea2409ceeb6bffca1cbd806adb2afc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): compiler/rustc_codegen_gcc/build_system/src/utils.rs:20-27 | compiler/rustc_codegen_gcc/build_system/src/utils.rs:133-139 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_codegen_gcc/build_system/src/utils.rs:20\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":"compiler/rustc_codegen_gcc/build_system/src/utils.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7c43c0bcd74f92616d90a10f5d8869df91c2acdf6c6dffea598a2bffa33ad32"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): compiler/rustc_codegen_gcc/src/allocator.rs:81-87 | compiler/rustc_codegen_gcc/src/allocator.rs:107-113 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_codegen_gcc/src/allocator.rs:81\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":"compiler/rustc_codegen_gcc/src/allocator.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"1968b04e9640c98c6fcf5a1552cff20bc93843718cda98604c5688b09fa12e62"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): compiler/rustc_codegen_gcc/src/back/lto.rs:73-81 | compiler/rustc_codegen_llvm/src/back/lto.rs:103-111 \u2014 before extracting anything, compare \u0060compiler/rustc_codegen_gcc/src/back/lto.rs\u0060 and \u0060compiler/rustc_codegen_llvm/src/back/lto.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 49 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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 \u0060compiler/rustc_codegen_gcc/src/back/lto.rs:73\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_gcc/src/back/lto.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"48ce4763d95c8a9b8788f935c642e55564057d88dd8001f3dedbc46d1b192656"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): compiler/rustc_codegen_gcc/src/builder.rs:1166-1173 | compiler/rustc_codegen_llvm/src/builder.rs:1663-1670 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Note 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 \u0060crate) fn set_unpredictable(\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":"compiler/rustc_codegen_gcc/src/builder.rs"},"region":{"startLine":1166}}}],"partialFingerprints":{"codehealthFindingId/v1":"d15d06b08d2cace04a12548b664a5e682974aa9d38d26e2597a7bb974725255e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): compiler/rustc_codegen_gcc/src/consts.rs:252-258 | compiler/rustc_codegen_llvm/src/consts.rs:352-358 \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 \u0060compiler/rustc_codegen_gcc/src/consts.rs:252\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":"compiler/rustc_codegen_gcc/src/consts.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"351d7dcb948077e4dd057c4446b52947040d6d9f66d916a76f3db41fac1eec37"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): compiler/rustc_codegen_gcc/src/context.rs:631-637 | compiler/rustc_codegen_llvm/src/context.rs:1173-1179 \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":"compiler/rustc_codegen_gcc/src/context.rs"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e5a90fd8c97b446ec73efea1c2c2c1b9255d9659566a424b829a3e99a7d73e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): compiler/rustc_codegen_gcc/src/intrinsic/mod.rs:868-874 | compiler/rustc_codegen_gcc/src/intrinsic/mod.rs:875-881 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_gcc/src/intrinsic/mod.rs"},"region":{"startLine":868}}}],"partialFingerprints":{"codehealthFindingId/v1":"f77b0f0e2d96524144910c040598a207b596435e594851439d73ba7a1cf460e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): compiler/rustc_codegen_gcc/src/intrinsic/simd.rs:563-569 | compiler/rustc_codegen_gcc/src/intrinsic/simd.rs:605-613 | compiler/rustc_codegen_gcc/src/intrinsic/simd.rs:641-647 \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 \u0060compiler/rustc_codegen_gcc/src/intrinsic/simd.rs:563\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060compiler/rustc_codegen_gcc/src/intrinsic/simd.rs:639\u0060 calls \u0060kind\u0060, \u0060RawPtr\u0060 and \u0060compiler/rustc_codegen_gcc/src/intrinsic/simd.rs:605\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":"compiler/rustc_codegen_gcc/src/intrinsic/simd.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"390da405225d335aa51d83d56c32e65a15d919ad7518bad5041e74c39715eebf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): compiler/rustc_codegen_gcc/src/intrinsic/simd.rs:667-674 | compiler/rustc_codegen_llvm/src/intrinsic.rs:3364-3370 \u2014 before extracting anything, compare \u0060compiler/rustc_codegen_gcc/src/intrinsic/simd.rs\u0060 and \u0060compiler/rustc_codegen_llvm/src/intrinsic.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 192 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, \u0060compiler/rustc_codegen_llvm/src/intrinsic.rs:3360\u0060 calls \u0060immediate\u0060 and \u0060compiler/rustc_codegen_gcc/src/intrinsic/simd.rs:663\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":"compiler/rustc_codegen_gcc/src/intrinsic/simd.rs"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"afd41808b2df34be36e57f466d147416483e512956469526f54f0291516edd28"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): compiler/rustc_codegen_llvm/src/builder.rs:1634-1640 | compiler/rustc_codegen_llvm/src/builder.rs:1668-1674 \u2014 both copies are in the same file, so extract the block 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, \u0060compiler/rustc_codegen_llvm/src/builder.rs:1665\u0060 calls \u0060project_index\u0060 and \u0060compiler/rustc_codegen_llvm/src/builder.rs:1632\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":"compiler/rustc_codegen_llvm/src/builder.rs"},"region":{"startLine":1634}}}],"partialFingerprints":{"codehealthFindingId/v1":"81fb750ef85f5e3d3330c2ae7727a72bb916044df6d9b9676ba5c25e1d75d68a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): compiler/rustc_hir_analysis/src/coherence/builtin.rs:476-483 | compiler/rustc_hir_analysis/src/coherence/builtin/coerce_shared.rs:240-247 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060compiler/rustc_hir_analysis/src/coherence/builtin/coerce_shared.rs:235\u0060 calls \u0060coerce_shared_diagnostic_context\u0060 and \u0060compiler/rustc_hir_analysis/src/coherence/builtin.rs:471\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":"compiler/rustc_hir_analysis/src/coherence/builtin.rs"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f853c6ba3a3b8991f14fd680de6ce8444dcce1f6dffec51cf1f421ff8c62ea8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): compiler/rustc_hir_pretty/src/lib.rs:1004-1010 | compiler/rustc_hir_pretty/src/lib.rs:1029-1035 \u2014 both copies are in the same file, so extract the block 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":"compiler/rustc_hir_pretty/src/lib.rs"},"region":{"startLine":1004}}}],"partialFingerprints":{"codehealthFindingId/v1":"39780770be8107af5a1d98d1a53c9acb0016cbe7e9779099553d44378a99a941"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): compiler/rustc_hir_typeck/src/fallback.rs:555-561 | compiler/rustc_hir_typeck/src/fallback.rs:584-592 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_hir_typeck/src/fallback.rs:555\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/fallback.rs"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"c772fb2b037e70d0c09ea178f40fa1743ea5166dd8374f0350e5187e6d1b6e1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): compiler/rustc_hir_typeck/src/upvar.rs:2499-2505 | compiler/rustc_hir_typeck/src/upvar.rs:2521-2527 \u2014 both copies are in the same file, so extract the block 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":"compiler/rustc_hir_typeck/src/upvar.rs"},"region":{"startLine":2499}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0a1e3c860b88296fdde5c4238afd2b4105970cab4e4958037e6d2157cb6007f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): compiler/rustc_infer/src/infer/canonical/query_response.rs:424-430 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/canonical/instantiate.rs:335-341 \u2014 before extracting anything, compare \u0060compiler/rustc_infer/src/infer/canonical/query_response.rs\u0060 and \u0060src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/canonical/instantiate.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 41 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":"compiler/rustc_infer/src/infer/canonical/query_response.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"69748b18f48166adb9086fb57f3dfc12541bb10c1d2ac8885cc0a932a1bb0065"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): compiler/rustc_mir_build/src/thir/print.rs:490-496 | compiler/rustc_mir_build/src/thir/print.rs:499-505 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_mir_build/src/thir/print.rs:490\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":"compiler/rustc_mir_build/src/thir/print.rs"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"572c7052abf6eeaf60dfb8fb2f85e7798efa75056c0c86b381612c1b7b96a2c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): compiler/rustc_mir_transform/src/coroutine/mod.rs:617-623 | compiler/rustc_mir_transform/src/coroutine/mod.rs:661-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/coroutine/mod.rs"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"330ddcc48707627cafd26af12c6bdc120643fc28b28616ff7fa48a3875d1bd66"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): compiler/rustc_parse/src/parser/function.rs:970-976 | compiler/rustc_parse/src/parser/function.rs:978-984 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_parse/src/parser/function.rs:970\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":"compiler/rustc_parse/src/parser/function.rs"},"region":{"startLine":970}}}],"partialFingerprints":{"codehealthFindingId/v1":"636daadab3e2f55dfbe638ca23e32f465b1988a8e380e77d630415d30d9cf6bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): compiler/rustc_resolve/src/diagnostics/impls.rs:4231-4237 | compiler/rustc_resolve/src/diagnostics/impls.rs:4269-4276 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_resolve/src/diagnostics/impls.rs:4231\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":"compiler/rustc_resolve/src/diagnostics/impls.rs"},"region":{"startLine":4231}}}],"partialFingerprints":{"codehealthFindingId/v1":"b186c2b07d15b4bf0fc827d9d1c8801d9066a57cade942aad6d8a4cd8e2b2346"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): compiler/rustc_target/src/asm/mod.rs:1198-1207 | compiler/rustc_target/src/asm/mod.rs:1216-1225 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_target/src/asm/mod.rs:1198\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":"compiler/rustc_target/src/asm/mod.rs"},"region":{"startLine":1198}}}],"partialFingerprints":{"codehealthFindingId/v1":"6521fd1fca5fe67994c1457c509e2500fd0a81a33fa58365e37c65cc764c4569"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): compiler/rustc_trait_selection/src/solve/fulfill/derive_errors.rs:295-301 | compiler/rustc_trait_selection/src/solve/fulfill/derive_errors.rs:358-363 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_trait_selection/src/solve/fulfill/derive_errors.rs:358\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"compiler/rustc_trait_selection/src/solve/fulfill/derive_errors.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"423a9f58ebfcc9be9403a6ef1fc1044084b3edeb29123561d3a9185b3cf7cc72"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): compiler/rustc_trait_selection/src/traits/select/mod.rs:571-577 | compiler/rustc_trait_selection/src/traits/select/mod.rs:583-589 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_trait_selection/src/traits/select/mod.rs:571\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":"compiler/rustc_trait_selection/src/traits/select/mod.rs"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"b709f79ed7c886f22e4c65ba7790c8096f821bab2d571c7136cc88e00de3ef40"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): library/compiler-builtins/compiler-builtins/src/mem/impls.rs:242-248 | library/compiler-builtins/compiler-builtins/src/mem/impls.rs:307-313 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/compiler-builtins/compiler-builtins/src/mem/impls.rs:242\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":"library/compiler-builtins/compiler-builtins/src/mem/impls.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"72bc2abe2c4dbd49ebf552b711f2417ca11a4cdf440e6f7461f3b73ddb6f9f49"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): library/compiler-builtins/libm/src/math/exp2m1.rs:633-640 | library/compiler-builtins/libm/src/math/exp2m1.rs:669-676 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/compiler-builtins/libm/src/math/exp2m1.rs"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"07559c8a268ec1f54060c5b8dc3d62c2cc43df2ebf6e4bbf8eb8425b3e0f86b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): library/core/src/slice/sort/shared/smallsort.rs:455-461 | library/core/src/slice/sort/shared/smallsort.rs:524-530 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/core/src/slice/sort/shared/smallsort.rs:455\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":"library/core/src/slice/sort/shared/smallsort.rs"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"07d289080b3087ebc4eab053166a1fa19325281326accaf35b58c7d659d7d96e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): library/std/src/sync/mpmc/counter.rs:62-68 | library/std/src/sync/mpmc/counter.rs:115-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 \u0060library/std/src/sync/mpmc/counter.rs:62\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sync/mpmc/counter.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8c664bed8d24586ab674b998768bc2b00b20c7c82d61c7f25841e943673bd5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): library/std/src/sync/mpmc/zero.rs:219-225 | library/std/src/sync/mpmc/zero.rs:236-243 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/std/src/sync/mpmc/zero.rs:219\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":"library/std/src/sync/mpmc/zero.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"79dbf63b4242c777f39c6e2100b1dbf725511a2eb51318c4bd2e1df6ab895ef9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): library/std/src/sync/nonpoison/rwlock.rs:834-840 | library/std/src/sync/poison/rwlock.rs:967-973 \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 \u0060library/std/src/sync/nonpoison/rwlock.rs:834\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, \u0060library/std/src/sync/poison/rwlock.rs:975\u0060 calls \u0060clone\u0060 and \u0060library/std/src/sync/nonpoison/rwlock.rs:841\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":"library/std/src/sync/nonpoison/rwlock.rs"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa62a1db7f6b55c24c71d5c27d4e3f5b54d31800a220feb5be7546fe5eb32643"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): library/std/src/sync/poison/mutex.rs:709-715 | library/std/src/sync/poison/rwlock.rs:712-718 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/std/src/sync/poison/mutex.rs:709\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":"library/std/src/sync/poison/mutex.rs"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf83eba7f1ff12965017f7ab929f1b34f9cccbd161f73b844f92fe9a56d53897"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): library/std/src/sys/args/windows.rs:375-384 | library/std/src/sys/args/windows.rs:393-401 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/std/src/sys/args/windows.rs:375\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":"library/std/src/sys/args/windows.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d875680e6ac029cf7b7a5ac229330de707e728e61c289b1526aeb28e12f7e85"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): library/std/src/sys/fs/uefi.rs:723-729 | library/std/src/sys/fs/uefi.rs:771-777 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/std/src/sys/fs/uefi.rs:771\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":"library/std/src/sys/fs/uefi.rs"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bb74db30dea2cba9fa0c6fc40bf97faa03db999b8e042bd680e3cc25947c9c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): library/std/src/sys/net/connection/socket/mod.rs:761-767 | library/std/src/sys/net/connection/socket/mod.rs:1050-1056 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/std/src/sys/net/connection/socket/mod.rs:761\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":"library/std/src/sys/net/connection/socket/mod.rs"},"region":{"startLine":761}}}],"partialFingerprints":{"codehealthFindingId/v1":"613b08ff9d0bee06b00bf59fc99eef34efcea66c8f84345fcbafc1c70c3c1531"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): library/std/src/sys/pal/uefi/helpers.rs:165-171 | library/std/src/sys/pal/uefi/helpers.rs:219-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/std/src/sys/pal/uefi/helpers.rs:165\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":"library/std/src/sys/pal/uefi/helpers.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"a61ee597986d78c730ae9945bc84a53713f3ebffbe8fd6d6d412e2e5f612d355"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): library/std/src/sys/pal/uefi/helpers.rs:176-182 | library/std/src/sys/pal/uefi/helpers.rs:230-236 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/std/src/sys/pal/uefi/helpers.rs:176\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":"library/std/src/sys/pal/uefi/helpers.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb368fb347be6a3571e61af2002bc6419cb525b2bf4937e633618d87a2010509"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): library/std/src/sys/process/unix/unix.rs:1042-1048 | library/std/src/sys/process/unix/vxworks.rs:182-188 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/std/src/sys/process/unix/unix.rs:1042\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":"library/std/src/sys/process/unix/unix.rs"},"region":{"startLine":1042}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff896ebe27f6d34eefbe1ed7af0544abc4f3a23a88ef40f85e17d5179dd398ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): library/stdarch/crates/core_arch/src/x86/avx2.rs:360-366 | library/stdarch/crates/core_arch/src/x86/avx2.rs:401-407 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/stdarch/crates/core_arch/src/x86/avx2.rs:360\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":"library/stdarch/crates/core_arch/src/x86/avx2.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5436aaabaa5a5d7787c29a0f25b220346281dd3f2140d73ddbe94bded63350d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20137 lines \u00D7 4): library/stdarch/crates/core_arch/src/x86/avx512f.rs:25107-25109 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:25256-25262 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:25411-25413 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:25560-25566 \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 \u0060library/stdarch/crates/core_arch/src/x86/avx512f.rs:25256\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":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":25107}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0c67136378db6aec303e808d44064981d52e9a7f5c5f841564bccd49ee80972"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u20137 lines \u00D7 3): library/stdarch/crates/core_arch/src/x86/avx512f.rs:25946-25947 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:29051-29057 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:29193-29199 \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 \u0060library/stdarch/crates/core_arch/src/x86/avx512f.rs:29051\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":25946}}}],"partialFingerprints":{"codehealthFindingId/v1":"77d947bbfce06b6369e398358530b2fd331cfbd3f25676085ad94b9912b8d2a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): library/stdarch/crates/core_arch/src/x86/avx512f.rs:41648-41654 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:41902-41908 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/stdarch/crates/core_arch/src/x86/avx512f.rs:41648\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":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":41648}}}],"partialFingerprints":{"codehealthFindingId/v1":"44fd0a7b66f97f0b77f909a5034214c2f098d972cf6ce0bd60f67cc50658ee65"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): library/stdarch/crates/core_arch/src/x86/avx512f.rs:41774-41780 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:42032-42038 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/stdarch/crates/core_arch/src/x86/avx512f.rs:41774\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":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":41774}}}],"partialFingerprints":{"codehealthFindingId/v1":"63293fb25a5880459fde91758e2b5ada6b41b993daad83ed6691c03087f9a063"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): library/stdarch/crates/core_arch/src/x86/avx512f.rs:42128-42134 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:42389-42395 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/stdarch/crates/core_arch/src/x86/avx512f.rs:42128\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":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":42128}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6700a60b9c6d8636ddb8144079a9c7c2d43d188823a89613d3fb45093b7fb0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): library/stdarch/crates/core_arch/src/x86/avx512f.rs:42162-42168 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:42424-42430 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/stdarch/crates/core_arch/src/x86/avx512f.rs:42162\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":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":42162}}}],"partialFingerprints":{"codehealthFindingId/v1":"146c4b4b3c3ee16dc24521f42ce4376009770bab42ab01d29e581a96a8c2715f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): library/stdarch/crates/core_arch/src/x86/avx512f.rs:42197-42203 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:42460-42466 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/stdarch/crates/core_arch/src/x86/avx512f.rs:42197\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":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":42197}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cf960174f70916d0d9c6cbbcabf235d4e38d07b1a49fce7eb15578cb23df09f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): library/stdarch/crates/core_arch/src/x86/avx512f.rs:42258-42264 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:42523-42529 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/stdarch/crates/core_arch/src/x86/avx512f.rs:42258\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":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":42258}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a1019c93df14bd3e26cca5fb041c276374c577129ca8ce80017a94b74cc293d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): library/stdarch/crates/core_arch/src/x86/avx512f.rs:42292-42298 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:42558-42564 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/stdarch/crates/core_arch/src/x86/avx512f.rs:42292\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":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":42292}}}],"partialFingerprints":{"codehealthFindingId/v1":"32fccf5cbdd5d927b2b067f4fe2b22b40fe25a456dff243c278d2a28ec753f07"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): library/stdarch/crates/core_arch/src/x86/avx512f.rs:42327-42333 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:42594-42600 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/stdarch/crates/core_arch/src/x86/avx512f.rs:42327\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":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":42327}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e7561f30834a6b1ca436d535d3014cfbae5aedb4ae9111dec900267693f5101"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): library/stdarch/crates/stdarch-gen-hexagon/src/hvx.rs:217-223 | library/stdarch/crates/stdarch-gen-hexagon/src/hvx.rs:232-238 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/stdarch/crates/stdarch-gen-hexagon/src/hvx.rs:217\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":"library/stdarch/crates/stdarch-gen-hexagon/src/hvx.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"64d527cd69a25574cc05fa6447a61f3a88b80f463e71198b4eb7792df13ae459"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): library/stdarch/crates/stdarch-gen-hexagon/src/hvx.rs:394-400 | library/stdarch/crates/stdarch-gen-hexagon/src/scalar.rs:346-352 \u2014 before extracting anything, compare \u0060library/stdarch/crates/stdarch-gen-hexagon/src/hvx.rs\u0060 and \u0060library/stdarch/crates/stdarch-gen-hexagon/src/scalar.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 55 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":"library/stdarch/crates/stdarch-gen-hexagon/src/hvx.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9608b8e05d570f36f78f9018833c9ef3fb8f603b3cf343f1a9da98e29c6eff5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/bootstrap/src/core/config/config.rs:1653-1659 | src/bootstrap/src/core/config/config.rs:1664-1670 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/bootstrap/src/core/config/config.rs:1653\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/bootstrap/src/core/config/config.rs"},"region":{"startLine":1653}}}],"partialFingerprints":{"codehealthFindingId/v1":"74208f2a503884805e66b0edbe5caf9cd1e68580e32539bf6bdf140a536a8e83"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/bootstrap/src/core/download.rs:363-369 | src/bootstrap/src/core/download.rs:399-405 \u2014 both copies are in the same file, so extract the block 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/bootstrap/src/core/download.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1dc84a2b7bcd65a3019f571f34b36eef3a300544fbccf1118783c300371e41f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/bootstrap/src/utils/cache.rs:240-246 | src/bootstrap/src/utils/cache.rs:260-266 \u2014 both copies are in the same file, so extract the block 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/bootstrap/src/utils/cache.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"5acfd846671a503af399be29f039e0aaf6512a1eacb5316af8a63870223e8d09"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/tools/clippy/clippy_dev/src/edit_lints.rs:84-90 | src/tools/clippy/clippy_dev/src/edit_lints.rs:156-162 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_dev/src/edit_lints.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3fc785e0ccb3698541119816a8c43d103152f75656146fa512555143228ab7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/tools/clippy/clippy_dev/src/parse.rs:362-370 | src/tools/clippy/clippy_dev/src/parse.rs:389-397 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tools/clippy/clippy_dev/src/parse.rs:362\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/tools/clippy/clippy_dev/src/parse.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"04f6f88b200ed68fb5c7ea96a579ed915b20691b015bb064edc9f8bec44464d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/tools/clippy/clippy_lints/src/floating_point_arithmetic/mul_add.rs:67-73 | src/tools/clippy/clippy_lints/src/floating_point_arithmetic/powi.rs:19-25 \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/tools/clippy/clippy_lints/src/floating_point_arithmetic/mul_add.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"a49b5ad705ee4be5f1c774c88e55fcb5936b3e25bc9359b683927baf4cfbf176"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): src/tools/clippy/clippy_lints/src/loops/manual_slice_fill.rs:75-81 | src/tools/clippy/clippy_lints/src/loops/manual_slice_fill.rs:92-97 \u2014 both copies are in the same file, so extract the block 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/tools/clippy/clippy_lints/src/loops/manual_slice_fill.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7b6177f96f7187d444cd3cb15ee007ad3c79adcb48faf3dddfe5215871583f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/tools/clippy/clippy_lints/src/loops/mut_range_bound.rs:89-96 | src/tools/clippy/clippy_lints/src/loops/mut_range_bound.rs:100-107 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/clippy/clippy_lints/src/loops/mut_range_bound.rs:89\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/tools/clippy/clippy_lints/src/loops/mut_range_bound.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5f26943da43a48452fd1ad30dfd9ed98506dec40f376c37d0ed340a54eeafd9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/tools/clippy/clippy_lints/src/manual_pop_if.rs:252-261 | src/tools/clippy/clippy_lints/src/manual_pop_if.rs:318-327 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/clippy/clippy_lints/src/manual_pop_if.rs:252\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/tools/clippy/clippy_lints/src/manual_pop_if.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"61414593456a21d6582088cd979fa3b78a287f72ef792bef5e7c588c34f6662c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/tools/clippy/clippy_lints/src/matches/redundant_pattern_match.rs:516-529 | src/tools/clippy/clippy_lints/src/matches/redundant_pattern_match.rs:542-555 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/clippy/clippy_lints/src/matches/redundant_pattern_match.rs:516\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/tools/clippy/clippy_lints/src/matches/redundant_pattern_match.rs"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2ba8a19fe6683486011b84bbe45d6f03bd3482b12c328d9cff5a498927f204f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/tools/clippy/clippy_lints/src/vec_init_then_push.rs:160-166 | src/tools/clippy/clippy_lints/src/vec_init_then_push.rs:183-189 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tools/clippy/clippy_lints/src/vec_init_then_push.rs:160\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/tools/clippy/clippy_lints/src/vec_init_then_push.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"447fac5a4d44d831bb68564dca97bc20861521566d05063c2a4ce1d930fd0b4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/tools/clippy/clippy_utils/src/ty/mod.rs:1080-1086 | src/tools/clippy/clippy_utils/src/ty/mod.rs:1090-1096 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/clippy/clippy_utils/src/ty/mod.rs:1080\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/tools/clippy/clippy_utils/src/ty/mod.rs"},"region":{"startLine":1080}}}],"partialFingerprints":{"codehealthFindingId/v1":"8db47f42351c7d5e4016eaca9ff8d3ef1993c102e2c91bf8c9e1047694f25a61"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/tools/miri/src/concurrency/data_race.rs:848-854 | src/tools/miri/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/tools/miri/src/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/tools/miri/src/concurrency/data_race.rs"},"region":{"startLine":848}}}],"partialFingerprints":{"codehealthFindingId/v1":"00445353f6146d46d86c8a6b260e1e29b2ab8272d555414c0558b0125033be20"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/tools/miri/src/concurrency/genmc/shims.rs:75-82 | src/tools/miri/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/tools/miri/src/concurrency/genmc/shims.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"017548c7e6ba3db1d3e98c4d467142f8636a007a68bbc56c4f64343b42f23425"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/tools/miri/src/intrinsics/simd.rs:23-29 | src/tools/miri/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/tools/miri/src/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/tools/miri/src/intrinsics/simd.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ae66b495765e5a6cf7a1cd49c3ccca6f79a6b17e30bc0a3f949b4c6f8b44934"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20137 lines \u00D7 4): src/tools/miri/src/intrinsics/x86/mod.rs:798-804 | src/tools/miri/src/intrinsics/x86/mod.rs:831-837 | src/tools/miri/src/intrinsics/x86/mod.rs:1188-1191 | src/tools/miri/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/tools/miri/src/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/tools/miri/src/intrinsics/x86/mod.rs:829\u0060 calls \u0060field\u0060, \u0060bits\u0060, \u0060strict_sub\u0060 and \u0060src/tools/miri/src/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/tools/miri/src/intrinsics/x86/mod.rs"},"region":{"startLine":798}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ae54f656d37292d4de6b2d78a426b09d51828f883f66ebed243f3b15b417324"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/tools/miri/src/shims/cpu_affinity.rs:103-109 | src/tools/miri/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/tools/miri/src/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/tools/miri/src/shims/cpu_affinity.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"afad1d9d202c18880d89003708f84fe7999cf25db8d16e2b13d0429cc2af54f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/tools/miri/src/shims/unix/foreign_items.rs:208-214 | src/tools/miri/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/tools/miri/src/shims/unix/foreign_items.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"d737a33b9af22d48c3e68781c5617cdd7afe136161b4535c25c83cd6d39d28f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/tools/miri/src/shims/unix/foreign_items.rs:392-398 | src/tools/miri/src/shims/unix/macos/foreign_items.rs:68-74 \u2014 before extracting anything, compare \u0060src/tools/miri/src/shims/unix/foreign_items.rs\u0060 and \u0060src/tools/miri/src/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/tools/miri/src/shims/unix/foreign_items.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fe3058b6b2aee55052ec8d00b3ecbd0703d24e90785aa1c6443281a92d22fa7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/tools/miri/src/shims/unix/foreign_items.rs:400-406 | src/tools/miri/src/shims/unix/macos/foreign_items.rs:60-66 \u2014 before extracting anything, compare \u0060src/tools/miri/src/shims/unix/foreign_items.rs\u0060 and \u0060src/tools/miri/src/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/tools/miri/src/shims/unix/foreign_items.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"97e76d8f62fd5a79279a2a59e48ce8809d464f76a2c42a2eb11c2a2734a2d721"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/tools/miri/src/shims/unix/foreign_items.rs:408-414 | src/tools/miri/src/shims/unix/macos/foreign_items.rs:52-58 \u2014 before extracting anything, compare \u0060src/tools/miri/src/shims/unix/foreign_items.rs\u0060 and \u0060src/tools/miri/src/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/tools/miri/src/shims/unix/foreign_items.rs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c88067411b14421e938bd7a5fa156eb12760eff5d35a23abf42ab15cc8f8575"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/tools/miri/src/shims/unix/foreign_items.rs:580-586 | src/tools/miri/src/shims/unix/macos/foreign_items.rs:95-101 \u2014 before extracting anything, compare \u0060src/tools/miri/src/shims/unix/foreign_items.rs\u0060 and \u0060src/tools/miri/src/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/tools/miri/src/shims/unix/foreign_items.rs"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a269f7f9f9cd089acb016736e151cd2d29b99db0747201e5b5e8398078d9448"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/tools/miri/src/shims/unix/foreign_items.rs:635-641 | src/tools/miri/src/shims/unix/solarish/foreign_items.rs:113-119 \u2014 before extracting anything, compare \u0060src/tools/miri/src/shims/unix/foreign_items.rs\u0060 and \u0060src/tools/miri/src/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/tools/miri/src/shims/unix/foreign_items.rs"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a95e644a654638a651145667ed664d65a56c05fe91b884325ec720bbc081ed6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/tools/miri/src/shims/unix/foreign_items.rs:1279-1285 | src/tools/miri/src/shims/unix/linux/foreign_items.rs:333-339 \u2014 before extracting anything, compare \u0060src/tools/miri/src/shims/unix/foreign_items.rs\u0060 and \u0060src/tools/miri/src/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/tools/miri/src/shims/unix/foreign_items.rs"},"region":{"startLine":1279}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fc8818e18dc47a6fe46df4492464715c06b14f32f4655f30fc75acbcdb36dc8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/tools/miri/src/shims/unix/fs.rs:1462-1468 | src/tools/miri/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/tools/miri/src/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/tools/miri/src/shims/unix/fs.rs"},"region":{"startLine":1462}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dab9b81403e927caa30d8ea357a621ce1c62de1ea8fdf764d37e8384359472f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/tools/miri/src/shims/unix/linux_like/epoll.rs:323-329 | src/tools/miri/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/tools/miri/src/shims/unix/linux_like/epoll.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"92b30952063c96ea3d934b0cd6d4de70fe44f3f5eac33bfdbc2e48d3230906bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/tools/miri/src/shims/unix/linux_like/sync.rs:56-62 | src/tools/miri/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/tools/miri/src/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/tools/miri/src/shims/unix/linux_like/sync.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad7fcb01b832ad99c2b60d6e512f54e9f7e69a28fa4602b1a191e4783b3dadcc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/tools/miri/src/shims/unix/tcp_socket.rs:662-668 | src/tools/miri/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/tools/miri/src/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/tools/miri/src/shims/unix/tcp_socket.rs"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"10e2c12233605cafba517c2d9c9d44ac75633eb7eadf9888aa674b95d85f8d04"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-def/src/expr_store/lower.rs:1472-1478 | src/tools/rust-analyzer/crates/hir-def/src/expr_store/lower.rs:1512-1518 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/hir-def/src/expr_store/lower.rs:1472\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/tools/rust-analyzer/crates/hir-def/src/expr_store/lower.rs"},"region":{"startLine":1472}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5d3b05f06f0f567aa2665ebfb6b3d75600f6ab6dadb386db41d523e613640e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-def/src/item_scope.rs:259-265 | src/tools/rust-analyzer/crates/hir-def/src/item_scope.rs:274-280 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/hir-def/src/item_scope.rs:259\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/tools/rust-analyzer/crates/hir-def/src/item_scope.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"6175e4de78520207c581ad233f3df017e60673879a62fb5b6968fa7f2a6a6812"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-def/src/item_scope.rs:774-780 | src/tools/rust-analyzer/crates/hir-def/src/item_scope.rs:792-798 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/hir-def/src/item_scope.rs:774\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/tools/rust-analyzer/crates/hir-def/src/item_scope.rs"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"238fee991d7217c9b01d666ee462f56cb9e33d7ec39d4c3af8e83a61f48788ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-def/src/resolver.rs:198-208 | src/tools/rust-analyzer/crates/hir-def/src/resolver.rs:382-392 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tools/rust-analyzer/crates/hir-def/src/resolver.rs:198\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/tools/rust-analyzer/crates/hir-def/src/resolver.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ffcb5d283797f20afa9dcf38dcdc925680a2befff348c63f94f3a74155e9078"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-def/src/resolver.rs:230-236 | src/tools/rust-analyzer/crates/hir-def/src/resolver.rs:459-465 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tools/rust-analyzer/crates/hir-def/src/resolver.rs:230\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/resolver.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"4da3d62bd8ccae1cbf3e035beb5d6cf7503f357d124b3e8ea2c06fdb0e9d91f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-expand/src/builtin/derive_macro.rs:1036-1045 | src/tools/rust-analyzer/crates/hir-expand/src/builtin/derive_macro.rs:1098-1107 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/hir-expand/src/builtin/derive_macro.rs:1036\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/tools/rust-analyzer/crates/hir-expand/src/builtin/derive_macro.rs"},"region":{"startLine":1036}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c07556635004b6965b45425c06cf96bc1afb0d15b461093ae2a84d672b2a399"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-ide/src/display.rs:995-1001 | src/tools/rust-analyzer/crates/hir-ide/src/display.rs:1021-1027 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/hir-ide/src/display.rs:995\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/tools/rust-analyzer/crates/hir-ide/src/display.rs"},"region":{"startLine":995}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbb82330b21b4fd017c807f768788ecd191271d212353bbca95a08e6337fefe6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/tools/rust-analyzer/crates/hir/src/source_analyzer.rs:1318-1324 | src/tools/rust-analyzer/crates/hir/src/source_analyzer.rs:1409-1415 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/hir/src/source_analyzer.rs:1318\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/tools/rust-analyzer/crates/hir/src/source_analyzer.rs"},"region":{"startLine":1318}}}],"partialFingerprints":{"codehealthFindingId/v1":"28b028b3a03245dd35a49b99ce4961a17bd6e3982b2fadaebdee37b8717a3195"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_named_struct_to_tuple_struct.rs:160-168 | src/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_tuple_struct_to_named_struct.rs:149-157 \u2014 before extracting anything, compare \u0060src/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_named_struct_to_tuple_struct.rs\u0060 and \u0060src/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_tuple_struct_to_named_struct.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 35 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_named_struct_to_tuple_struct.rs:160\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/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_named_struct_to_tuple_struct.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f21528528ce52db42d4fe3e9cad700f3b49deed413281dee054f4234f70c175"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): src/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_default_from_new.rs:98-104 | src/tools/rust-analyzer/crates/ide-assists/src/utils.rs:637-642 \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/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_default_from_new.rs:98\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_default_from_new.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"2691d9e9f11a05388a8e7afb713b667c2a8cde2e2ba983f52e74b08e2b373011"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/tools/rust-analyzer/crates/ide-assists/src/handlers/introduce_named_lifetime.rs:102-108 | src/tools/rust-analyzer/crates/ide-assists/src/handlers/introduce_named_lifetime.rs:171-177 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/ide-assists/src/handlers/introduce_named_lifetime.rs:102\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/tools/rust-analyzer/crates/ide-assists/src/handlers/introduce_named_lifetime.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fcbc0357a7e0d2fa54e8f4b763fdd3d59c79a8af9850378c6a4dbdd02fd6132"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/tools/rust-analyzer/crates/ide-assists/src/handlers/remove_dbg.rs:102-108 | src/tools/rust-analyzer/crates/ide-assists/src/handlers/remove_dbg.rs:110-116 \u2014 both copies are in the same file, so extract the block 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/tools/rust-analyzer/crates/ide-assists/src/handlers/remove_dbg.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bf56772faa96c9ba2c77e443283dca99c2bd5bc111050845bf4b16f977e7fb7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/tools/rust-analyzer/crates/ide-db/src/active_parameter.rs:183-189 | src/tools/rust-analyzer/crates/syntax/src/ast/node_ext.rs:59-65 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-db/src/active_parameter.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"e25b359651a5f57bb462ea460dcca026ae3dd2394c0f53fa5379ed4bc4288adc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/tools/rust-analyzer/crates/ide-db/src/syntax_helpers/node_ext.rs:179-185 | src/tools/rust-analyzer/crates/ide-db/src/syntax_helpers/node_ext.rs:207-213 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/ide-db/src/syntax_helpers/node_ext.rs:179\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-db/src/syntax_helpers/node_ext.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2e84eb006a65d57aa77a7d0595d4cd477488c16e394d9f4278276733fbe100c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/tools/rust-analyzer/crates/ide-diagnostics/src/handlers/mismatched_arg_count.rs:62-68 | src/tools/rust-analyzer/crates/ide-diagnostics/src/handlers/mismatched_arg_count.rs:70-76 \u2014 both copies are in the same file, so extract the block 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/tools/rust-analyzer/crates/ide-diagnostics/src/handlers/mismatched_arg_count.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"372b9636aebf727c1129c86162a1c58990d12d1b1a8904d8efbe0161ba85fc09"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/tools/rust-analyzer/crates/ide-diagnostics/src/handlers/type_mismatch.rs:392-398 | src/tools/rust-analyzer/crates/ide-diagnostics/src/handlers/type_mismatch.rs:416-422 \u2014 both copies are in the same file, so extract the block 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/tools/rust-analyzer/crates/ide-diagnostics/src/handlers/type_mismatch.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"70a545571adfe66953364758967a97cb109b702d80713e62cff7b574db89b4f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/tools/rust-analyzer/crates/ide/src/inlay_hints/lifetime.rs:79-85 | src/tools/rust-analyzer/crates/ide/src/inlay_hints/lifetime.rs:146-152 \u2014 both copies are in the same file, so extract the block 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/tools/rust-analyzer/crates/ide/src/inlay_hints/lifetime.rs:145\u0060 calls \u0060path\u0060, \u0060as_ref\u0060, \u0060and_then\u0060 and \u0060src/tools/rust-analyzer/crates/ide/src/inlay_hints/lifetime.rs:77\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/tools/rust-analyzer/crates/ide/src/inlay_hints/lifetime.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"909d738edd262708ed7e067fb79514c4e7ca56de14d66a96054cfcf1a5354609"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/tools/rust-analyzer/crates/ide/src/inlay_hints/param_name.rs:67-73 | src/tools/rust-analyzer/crates/ide/src/inlay_hints/param_name.rs:117-123 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/inlay_hints/param_name.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"61ad3d9ba71310d920c9c9520fbe63af18d7a1f9f4bf81f873b37ebc20cd50ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/tools/rust-analyzer/crates/ide/src/signature_help.rs:595-601 | src/tools/rust-analyzer/crates/ide/src/signature_help.rs:729-735 \u2014 both copies are in the same file, so extract the block 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/tools/rust-analyzer/crates/ide/src/signature_help.rs"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"04d283ba92f9b9dac89c2a24295cde3d3a917425078774142049ae8fe979b738"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/tools/rust-analyzer/crates/ide/src/typing.rs:259-265 | src/tools/rust-analyzer/crates/ide/src/typing.rs:295-301 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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 after the matched lines, \u0060src/tools/rust-analyzer/crates/ide/src/typing.rs:303\u0060 calls \u0060syntax\u0060, \u0060descendants\u0060, \u0060any\u0060 and \u0060src/tools/rust-analyzer/crates/ide/src/typing.rs:266\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/tools/rust-analyzer/crates/ide/src/typing.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e4e839fc979d26c0cae682a2317c035769801f09f0959a14f645e90311dc922"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/tools/rust-analyzer/crates/proc-macro-api/src/legacy_protocol/msg/flat.rs:371-377 | src/tools/rust-analyzer/crates/proc-macro-api/src/legacy_protocol/msg/flat.rs:390-396 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/proc-macro-api/src/legacy_protocol/msg/flat.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7befd02a36b49cda6a19739d7e652339f5aabda17714efe01f9bd27fc768022"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/tools/rust-analyzer/crates/proc-macro-srv/src/token_stream.rs:302-308 | src/tools/rust-analyzer/crates/proc-macro-srv/src/token_stream.rs:318-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tools/rust-analyzer/crates/proc-macro-srv/src/token_stream.rs:302\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/proc-macro-srv/src/token_stream.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"beec7e1dd60809ac05fca6d8adf2ea0c3094806eb0388eb63bebf6cbfa6fbec0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/tools/rust-analyzer/crates/rust-analyzer/src/cli/analysis_stats.rs:1197-1203 | src/tools/rust-analyzer/crates/rust-analyzer/src/cli/analysis_stats.rs:1235-1241 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/rust-analyzer/src/cli/analysis_stats.rs:1197\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/tools/rust-analyzer/crates/rust-analyzer/src/cli/analysis_stats.rs"},"region":{"startLine":1197}}}],"partialFingerprints":{"codehealthFindingId/v1":"56e713221ea3c7ee452bbeaa9a68f24ec401bac4a366a0ea1c19898a617a7b1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): src/tools/rust-analyzer/crates/span/src/lib.rs:93-99 | src/tools/rust-analyzer/crates/span/src/lib.rs:112-119 \u2014 both copies are in the same file, so extract the block 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/tools/rust-analyzer/crates/span/src/lib.rs:92\u0060 calls \u0060alternate\u0060 and \u0060src/tools/rust-analyzer/crates/span/src/lib.rs:111\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/tools/rust-analyzer/crates/span/src/lib.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb7bb40b7b58553cd4996bad8128a67a431151f33139c1506832a29c6aef76e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:538-545 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1625-1631 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:538\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/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6f998e40ea6687a313520e879d3fefc6872806909b66beb1938878ec3138d5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:782-789 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:924-931 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:782\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/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs"},"region":{"startLine":782}}}],"partialFingerprints":{"codehealthFindingId/v1":"a13db95e579351028b40ffbcee9ba813f7747e76a2a24ce75d56493dba1fee3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/tools/rustfmt/src/pairs.rs:119-125 | src/tools/rustfmt/src/pairs.rs:328-334 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/pairs.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"6524fb3086712a70044fbbe05d6c69eff062af492f2fca8e3628c5b8007701c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 11): src/tools/miri/src/intrinsics/aarch64.rs:27-32 | src/tools/miri/src/intrinsics/x86/avx.rs:134-140 | src/tools/miri/src/intrinsics/x86/avx.rs:164-170 | src/tools/miri/src/intrinsics/x86/gfni.rs:48-54 | src/tools/miri/src/intrinsics/x86/mod.rs:338-344 | src/tools/miri/src/intrinsics/x86/mod.rs:517-523 | src/tools/miri/src/intrinsics/x86/mod.rs:866-872 | src/tools/miri/src/intrinsics/x86/mod.rs:912-918 | src/tools/miri/src/intrinsics/x86/mod.rs:1265-1271 | src/tools/miri/src/intrinsics/x86/mod.rs:1363-1369 | src/tools/miri/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/tools/miri/src/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/tools/miri/src/intrinsics/aarch64.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bdf871d4a29ee021c99a46572abc6f8674bcdd2ab7f89cdc2f7dcbed85522d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 9): src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:174-179 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:649-654 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1545-1550 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1580-1585 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1729-1734 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1772-1777 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1807-1812 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1875-1880 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1939-1944 \u2014 all 9 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/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:648\u0060 calls \u0060map_children\u0060, \u0060attrs\u0060, \u0060syntax\u0060 and \u0060src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:173\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/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b23e0ec970d5460c1059202b81639e41e9d4a1f3ed517a6014f284f875aa7b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 8): library/stdarch/crates/core_arch/src/x86/avx512fp16.rs:5669-5674 | library/stdarch/crates/core_arch/src/x86/avx512fp16.rs:5706-5711 | library/stdarch/crates/core_arch/src/x86/avx512fp16.rs:6184-6189 | library/stdarch/crates/core_arch/src/x86/avx512fp16.rs:6221-6226 | library/stdarch/crates/core_arch/src/x86/avx512fp16.rs:6690-6695 | library/stdarch/crates/core_arch/src/x86/avx512fp16.rs:6727-6732 | library/stdarch/crates/core_arch/src/x86/avx512fp16.rs:7204-7209 | library/stdarch/crates/core_arch/src/x86/avx512fp16.rs:7241-7246 \u2014 all 8 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/stdarch/crates/core_arch/src/x86/avx512fp16.rs:5669\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512fp16.rs"},"region":{"startLine":5669}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd4a566593b37e9eddbfc292ff2837642ec7531566d2f8ff7231cca785507681"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 7): compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs:650-656 | compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs:691-697 | compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs:733-738 | compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs:744-749 | compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs:755-760 | compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs:766-771 | compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs:785-790 \u2014 all 7 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":"compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"2385a55d58f4743062dd5ff469c12a79aef631b8c30204f5867746363d8ff9a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u20136 lines \u00D7 10): src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:212-217 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:881-886 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:938-943 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:954-959 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:983-988 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1336-1337 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1350-1351 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1411-1412 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1460-1461 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1603-1604 \u2014 all 10 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/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:212\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:212\u0060 calls \u0060map_node\u0060, \u0060syntax\u0060, \u0060clone\u0060 and \u0060src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1336\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/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc2f38f4a48cca3a8d19c62bc53b4e496cc13ec2b9dd6c81ac71bc31523c2fdf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5): src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:321-326 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1063-1068 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1132-1137 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1364-1369 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:2285-2290 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:321\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/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"78c617fa754d787f001755e09725a4c96d6a5476024e21a7d68a84d561f7dfda"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20136 lines \u00D7 5): compiler/rustc_codegen_cranelift/src/intrinsics/llvm_x86.rs:522-527 | compiler/rustc_codegen_cranelift/src/intrinsics/llvm_x86.rs:598-603 | compiler/rustc_codegen_cranelift/src/intrinsics/llvm_x86.rs:633-638 | compiler/rustc_codegen_cranelift/src/intrinsics/llvm_x86.rs:1271-1276 | compiler/rustc_codegen_cranelift/src/intrinsics/llvm_x86.rs:1491-1494 \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. 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":"compiler/rustc_codegen_cranelift/src/intrinsics/llvm_x86.rs"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"5666ee3b01bbfa65da0f878b89fee1431bbc39fbd2b40b0065c437523f45e569"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs:32-37 | compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs:384-390 | compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs:553-559 | compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs:604-609 \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 \u0060compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs:384\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":"compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9e3a504edf2573258991aef154c3ffaa1cb4af97fc90c7ffeeef9442dded170"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): compiler/rustc_const_eval/src/interpret/intrinsics/simd.rs:380-386 | compiler/rustc_const_eval/src/interpret/intrinsics/simd.rs:626-632 | compiler/rustc_const_eval/src/interpret/intrinsics/simd.rs:649-655 | compiler/rustc_const_eval/src/interpret/intrinsics/simd.rs:769-775 \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 \u0060compiler/rustc_const_eval/src/interpret/intrinsics/simd.rs:380\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, \u0060compiler/rustc_const_eval/src/interpret/intrinsics/simd.rs:377\u0060 calls \u0060project_to_simd\u0060 and \u0060compiler/rustc_const_eval/src/interpret/intrinsics/simd.rs:647\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":"compiler/rustc_const_eval/src/interpret/intrinsics/simd.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa755cba29e083351c84d671302533f9be4b5978ef4220b77aeea88e8a03d515"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): compiler/rustc_mir_build/src/thir/print.rs:276-281 | compiler/rustc_mir_build/src/thir/print.rs:285-290 | compiler/rustc_mir_build/src/thir/print.rs:376-381 | compiler/rustc_mir_build/src/thir/print.rs:385-390 \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 \u0060compiler/rustc_mir_build/src/thir/print.rs:276\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":"compiler/rustc_mir_build/src/thir/print.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad8016106050a5e66537373866ae873aaa28b5023dbe6b9ad5c62d68ba2ce267"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): compiler/rustc_trait_selection/src/solve/fulfill/derive_errors.rs:56-61 | compiler/rustc_trait_selection/src/solve/fulfill/derive_errors.rs:63-68 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/errors.rs:161-166 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/errors.rs:168-173 \u2014 before extracting anything, compare \u0060compiler/rustc_trait_selection/src/solve/fulfill/derive_errors.rs\u0060 and \u0060src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/errors.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 99 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":"compiler/rustc_trait_selection/src/solve/fulfill/derive_errors.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"57b3125567e4238f21a9ad5e863ee80a50698695043f99d2540c98876df2597b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5\u20136 lines \u00D7 4): library/stdarch/crates/core_arch/src/x86/avx.rs:168-173 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:22840-22845 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:24638-24642 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:24799-24804 \u2014 before extracting anything, compare \u0060library/stdarch/crates/core_arch/src/x86/avx.rs\u0060 and \u0060library/stdarch/crates/core_arch/src/x86/avx512f.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 50 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 \u0060library/stdarch/crates/core_arch/src/x86/avx.rs:168\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab5023c75f5ec33dc254452eef859ed76fc67845fa7686a8b50791b82f08f58b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): library/stdarch/crates/core_arch/src/x86/avx512f.rs:4194-4199 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:4446-4451 | library/stdarch/crates/core_arch/src/x86/avx512fp16.rs:7360-7365 | library/stdarch/crates/core_arch/src/x86/avx512fp16.rs:7423-7429 \u2014 before extracting anything, compare \u0060library/stdarch/crates/core_arch/src/x86/avx512f.rs\u0060 and \u0060library/stdarch/crates/core_arch/src/x86/avx512fp16.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 31 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 \u0060library/stdarch/crates/core_arch/src/x86/avx512f.rs:4194\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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060a\u0060 to \u0060__m512\u0060 in one and \u0060__m256h\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":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":4194}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec3f4ad75ba25e497183c19e1e61f855ea8ec3a5039e0cef7f98cfea2402f102"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): library/stdarch/crates/core_arch/src/x86/avx512f.rs:38029-38034 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:38111-38116 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:38193-38198 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:38275-38280 \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 \u0060library/stdarch/crates/core_arch/src/x86/avx512f.rs:38029\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":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":38029}}}],"partialFingerprints":{"codehealthFindingId/v1":"78f6d2aff35b92997fe9149debeb1080b15ff3a1990f8eda064322358c42a0bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): library/stdarch/crates/core_arch/src/x86/avx512f.rs:38070-38075 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:38152-38157 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:38234-38239 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:38316-38321 \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 \u0060library/stdarch/crates/core_arch/src/x86/avx512f.rs:38070\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":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":38070}}}],"partialFingerprints":{"codehealthFindingId/v1":"f580fb52f56513a48ead0da015e7917953f57fd8667a0f9c136b9b557c6ac46c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): library/stdarch/crates/core_arch/src/x86/avx512f.rs:39594-39599 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:39723-39728 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:42164-42169 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:42426-42431 \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 \u0060library/stdarch/crates/core_arch/src/x86/avx512f.rs:39594\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":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":39594}}}],"partialFingerprints":{"codehealthFindingId/v1":"937bf0952a1895e18c07fae7e2e2ee0fa12e2eac37a1b76978571a9862e55ca6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): library/stdarch/crates/core_arch/src/x86/avx512f.rs:39658-39663 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:39790-39795 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:42294-42299 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:42560-42565 \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 \u0060library/stdarch/crates/core_arch/src/x86/avx512f.rs:39658\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":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":39658}}}],"partialFingerprints":{"codehealthFindingId/v1":"55dcecfac566d8113c59e4427e07adf1a93406b577a06eab497bf44ba353d746"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): library/stdarch/crates/core_arch/src/x86/avx512fp16.rs:1631-1636 | library/stdarch/crates/core_arch/src/x86/avx512fp16.rs:1972-1977 | library/stdarch/crates/core_arch/src/x86/avx512fp16.rs:2313-2318 | library/stdarch/crates/core_arch/src/x86/avx512fp16.rs:2654-2659 \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 \u0060library/stdarch/crates/core_arch/src/x86/avx512fp16.rs:1631\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":"library/stdarch/crates/core_arch/src/x86/avx512fp16.rs"},"region":{"startLine":1631}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6e7e54a72d61a3d02cd23bfee73fa3cc0e5418b16c7a67123502fc52116edd7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): library/stdarch/crates/core_arch/src/x86/avx512fp16.rs:5603-5608 | library/stdarch/crates/core_arch/src/x86/avx512fp16.rs:6118-6123 | library/stdarch/crates/core_arch/src/x86/avx512fp16.rs:6624-6629 | library/stdarch/crates/core_arch/src/x86/avx512fp16.rs:7138-7143 \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 \u0060library/stdarch/crates/core_arch/src/x86/avx512fp16.rs:5603\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":"library/stdarch/crates/core_arch/src/x86/avx512fp16.rs"},"region":{"startLine":5603}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ac156b4559c010dac1c7f1f499ac121de866c3e2782800210e30c8db32c40b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20136 lines \u00D7 4): compiler/rustc_codegen_cranelift/src/value_and_place.rs:913-916 | compiler/rustc_codegen_cranelift/src/value_and_place.rs:925-930 | compiler/rustc_codegen_cranelift/src/value_and_place.rs:938-943 | compiler/rustc_codegen_cranelift/src/value_and_place.rs:951-956 \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 \u0060compiler/rustc_codegen_cranelift/src/value_and_place.rs:913\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":"compiler/rustc_codegen_cranelift/src/value_and_place.rs"},"region":{"startLine":913}}}],"partialFingerprints":{"codehealthFindingId/v1":"39bfe480c7c941c01a2ac9183d523df1c9404b65d7122d533d0e78631b66839c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): compiler/rustc_macros/src/type_foldable.rs:13-18 | src/tools/rust-analyzer/crates/macros/src/lib.rs:101-106 | src/tools/rust-analyzer/crates/macros/src/lib.rs:212-217 \u2014 before extracting anything, compare \u0060compiler/rustc_macros/src/type_foldable.rs\u0060 and \u0060src/tools/rust-analyzer/crates/macros/src/lib.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 31 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 \u0060compiler/rustc_macros/src/type_foldable.rs:13\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_macros/src/type_foldable.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"563a83439151f1741a0c9e5a4bfc54c0a56e162543a14b9e911b7ba8f32f1a50"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): compiler/rustc_middle/src/ptrauth/llvm_siphash/mod.rs:50-55 | compiler/rustc_middle/src/ptrauth/llvm_siphash/mod.rs:58-63 | compiler/rustc_middle/src/ptrauth/llvm_siphash/mod.rs:65-70 \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 \u0060compiler/rustc_middle/src/ptrauth/llvm_siphash/mod.rs:50\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":"compiler/rustc_middle/src/ptrauth/llvm_siphash/mod.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f03fe8711b39291696625767076decb22060309a941cadfaa026e8e24340779"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): compiler/rustc_parse/src/parser/asm.rs:105-110 | compiler/rustc_parse/src/parser/asm.rs:121-126 | compiler/rustc_parse/src/parser/asm.rs:135-140 \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":"compiler/rustc_parse/src/parser/asm.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6e4b06b6dddaf0262c8c6f4f8a63b2e0c6c8119bf9bc7846b30aacac48af322"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): compiler/rustc_passes/src/check_attr.rs:62-67 | compiler/rustc_passes/src/check_attr.rs:71-76 | compiler/rustc_passes/src/check_attr.rs:84-89 \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":"compiler/rustc_passes/src/check_attr.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"da472c19992031e49530174fbdf8c618377673e856a8ea645be6d90e50aec1aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): src/tools/miri/src/shims/unix/android/foreign_items.rs:89-95 | src/tools/miri/src/shims/unix/linux/foreign_items.rs:215-221 | src/tools/miri/src/shims/unix/solarish/foreign_items.rs:46-52 \u2014 \u0060src/tools/miri/src/shims/unix/android/foreign_items.rs\u0060 and \u0060src/tools/miri/src/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/tools/miri/src/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/tools/miri/src/shims/unix/android/foreign_items.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0c63095a7960c7a95ec8beaeca4516ad54130d99f21096424b00f2ee96c5a06"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/tools/miri/src/shims/unix/socket.rs:1006-1012 | src/tools/miri/src/shims/unix/socket.rs:1045-1050 | src/tools/miri/src/shims/unix/socket.rs:1110-1116 \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/tools/miri/src/shims/unix/socket.rs:1006\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/tools/miri/src/shims/unix/socket.rs"},"region":{"startLine":1006}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4c8d1d30d938b70b3c5b68af19f08b99e5d1c8bfc8da0196030f57164fc7c92"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/tools/rust-analyzer/crates/hir-def/src/visibility.rs:336-341 | src/tools/rust-analyzer/crates/hir-def/src/visibility.rs:343-348 | src/tools/rust-analyzer/crates/hir-def/src/visibility.rs:350-355 \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/tools/rust-analyzer/crates/hir-def/src/visibility.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2c348782231446586a7a2e6497379492335d2240997effc62adf22bc5527267"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/tools/rust-analyzer/crates/hir/src/semantics.rs:2308-2313 | src/tools/rust-analyzer/crates/hir/src/semantics.rs:2315-2320 | src/tools/rust-analyzer/crates/hir/src/semantics.rs:2322-2327 \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/tools/rust-analyzer/crates/hir/src/semantics.rs"},"region":{"startLine":2308}}}],"partialFingerprints":{"codehealthFindingId/v1":"537ac864111fa04b463db8af76ce547575153bd7632d2eadb4281abca0f41506"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/tools/rust-analyzer/crates/syntax/src/ast/make.rs:492-497 | src/tools/rust-analyzer/crates/syntax/src/ast/make.rs:1008-1013 | src/tools/rust-analyzer/crates/syntax/src/ast/make.rs:1308-1313 \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/tools/rust-analyzer/crates/syntax/src/ast/make.rs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"2176bfa8f38fb63eda240e6de1169ef45139f48ac6ef1f0b4d4ccab43bb86c1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:181-187 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:362-367 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:2166-2171 \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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:368\u0060 calls \u0060map_node\u0060, \u0060syntax\u0060, \u0060clone\u0060 and \u0060src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:2172\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/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"a26e1988ccd1bc1a26b2da49fc621ccd246b35623713eea86a5048336c141f0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:181-186 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1816-1821 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1946-1951 \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/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7bcd4f8c8cbee8e6e460255433a2b3fc0939641bae7e4a48e1099a5d5c82aab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:361-367 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:409-415 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:2165-2171 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:368\u0060 calls \u0060map_node\u0060, \u0060syntax\u0060, \u0060clone\u0060 and \u0060src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:416\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/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"eae506dfa3d34886df2ed7883846e8d06651cc5725e955dc6561b900cfb8db33"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (1\u20136 lines \u00D7 5): src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:465-470 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1552-1552 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1588-1588 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1605-1610 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1737-1743 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:465\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ac74f72e098b2d91ca272baefadefbc696dfe3dcfca07ebc3402f2f072cabea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): compiler/rustc_ast_lowering/src/format.rs:399-404 | src/tools/rust-analyzer/crates/hir-def/src/expr_store/lower/format_args.rs:252-257 \u2014 before extracting anything, compare \u0060compiler/rustc_ast_lowering/src/format.rs\u0060 and \u0060src/tools/rust-analyzer/crates/hir-def/src/expr_store/lower/format_args.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 96 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 \u0060compiler/rustc_ast_lowering/src/format.rs:399\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":"compiler/rustc_ast_lowering/src/format.rs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"f54c904ac0367f7ccc3ea0d16f14d331c5b1386d73edf39617fa8e62e469e563"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): compiler/rustc_ast_lowering/src/item.rs:376-381 | compiler/rustc_ast_lowering/src/item.rs:385-390 \u2014 both copies are in the same file, so extract the block 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":"compiler/rustc_ast_lowering/src/item.rs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"09a44c745d1b5c41caf93217268241a3e957a42941a143dc25825addb3616d31"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): compiler/rustc_ast_lowering/src/lib.rs:1442-1447 | compiler/rustc_ast_lowering/src/lib.rs:1456-1463 \u2014 both copies are in the same file, so extract the block 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":"compiler/rustc_ast_lowering/src/lib.rs"},"region":{"startLine":1442}}}],"partialFingerprints":{"codehealthFindingId/v1":"e809f4835bb71dbe90129b0efacf50fad8ff9796df078f2bba2c937d2fa8b278"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): compiler/rustc_ast_pretty/src/pprust/state.rs:1815-1820 | compiler/rustc_ast_pretty/src/pprust/state.rs:1823-1828 \u2014 both copies are in the same file, so extract the block 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":"compiler/rustc_ast_pretty/src/pprust/state.rs"},"region":{"startLine":1815}}}],"partialFingerprints":{"codehealthFindingId/v1":"897e3f3f0eefc3caf25b0ebacd1725ab084337bad8573440c858995c32581a96"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): compiler/rustc_ast_pretty/src/pprust/state/expr.rs:22-27 | compiler/rustc_hir_pretty/src/lib.rs:1144-1149 \u2014 before extracting anything, compare \u0060compiler/rustc_ast_pretty/src/pprust/state/expr.rs\u0060 and \u0060compiler/rustc_hir_pretty/src/lib.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 47 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":"compiler/rustc_ast_pretty/src/pprust/state/expr.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"7898b56630f5c35e21d483120d25d1cba2786c8b81e9b8dd1d46c0b0e56a514c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): compiler/rustc_attr_parsing/src/attributes/autodiff.rs:53-58 | compiler/rustc_attr_parsing/src/attributes/proc_macro_attrs.rs:109-114 \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 \u0060compiler/rustc_attr_parsing/src/attributes/autodiff.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":"compiler/rustc_attr_parsing/src/attributes/autodiff.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c01404ae9e001d1ea7feecce59a6b8d6dda6aa61507330cd17b05d3082448f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): compiler/rustc_attr_parsing/src/diagnostics.rs:1614-1621 | compiler/rustc_attr_parsing/src/diagnostics.rs:1650-1655 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_attr_parsing/src/diagnostics.rs:1614\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":"compiler/rustc_attr_parsing/src/diagnostics.rs"},"region":{"startLine":1614}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac61eaf572fdb12f6e67b2d0a103eb6ed019a48c183ae353e6baf244f604e962"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): compiler/rustc_borrowck/src/universal_regions.rs:247-252 | compiler/rustc_borrowck/src/universal_regions.rs:295-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":"compiler/rustc_borrowck/src/universal_regions.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e74b040c0c043dffae780efab581afe0188921897dc58cf1fc573614d61cdb4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): compiler/rustc_builtin_macros/src/env.rs:46-52 | compiler/rustc_builtin_macros/src/env.rs:119-125 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_builtin_macros/src/env.rs:46\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":"compiler/rustc_builtin_macros/src/env.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3c8f9a95fc86e7fa8b4e4b92c64d7f3e0bbdb12964035a947330f9ac9e8553c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): compiler/rustc_builtin_macros/src/format.rs:614-619 | src/tools/rust-analyzer/crates/hir-def/src/hir/format_args.rs:431-436 \u2014 before extracting anything, compare \u0060compiler/rustc_builtin_macros/src/format.rs\u0060 and \u0060src/tools/rust-analyzer/crates/hir-def/src/hir/format_args.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 113 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 \u0060compiler/rustc_builtin_macros/src/format.rs:614\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, \u0060compiler/rustc_builtin_macros/src/format.rs:611\u0060 calls \u0060report_invalid_references\u0060 and \u0060src/tools/rust-analyzer/crates/hir-def/src/hir/format_args.rs:427\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":"compiler/rustc_builtin_macros/src/format.rs"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd76ef21fdb7ae65580e7a887948d8b2fb28d945f4336f30f25fbe7a01a2cd15"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): compiler/rustc_codegen_cranelift/src/abi/pass_mode.rs:112-117 | compiler/rustc_codegen_cranelift/src/abi/pass_mode.rs:170-175 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_codegen_cranelift/src/abi/pass_mode.rs:112\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":"compiler/rustc_codegen_cranelift/src/abi/pass_mode.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"e799441a90c72fe18922a574c1fb5c42110cd288f9bb65236e1340652f3601fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): compiler/rustc_codegen_cranelift/src/cast.rs:131-144 | compiler/rustc_codegen_cranelift/src/codegen_f16_f128.rs:238-251 \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 \u0060compiler/rustc_codegen_cranelift/src/cast.rs:131\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":"compiler/rustc_codegen_cranelift/src/cast.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5165ac005a65a1b26fa9a574f55428f8077c656ba27908d98e6f99b7f3272a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): compiler/rustc_codegen_cranelift/src/constant.rs:153-159 | compiler/rustc_codegen_cranelift/src/constant.rs:238-243 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_codegen_cranelift/src/constant.rs:153\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":"compiler/rustc_codegen_cranelift/src/constant.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"1156017bd07fff51a9433abef0565fa121197b8065d81b219952b308caa768a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): compiler/rustc_codegen_cranelift/src/intrinsics/llvm_x86.rs:203-208 | compiler/rustc_codegen_cranelift/src/intrinsics/llvm_x86.rs:369-374 \u2014 both copies are in the same file, so extract the block 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":"compiler/rustc_codegen_cranelift/src/intrinsics/llvm_x86.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"22d2a6f678b0e23d04ded0092fe62699463c4028dc4ea15d558767b2109f4900"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs:139-144 | compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs:198-203 \u2014 both copies are in the same file, so extract the block 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":"compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"389cbdd04a64d645941eed260d3efd7722e8e6bcfb720cb9e86ec87ebffe3031"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs:711-716 | compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs:722-727 \u2014 both copies are in the same file, so extract the block 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":"compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"34e818292708d7ccd2fc877a890c33dbf44b9041bd5cde4d92a2ab5c392f8ed9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): compiler/rustc_codegen_gcc/src/consts.rs:360-365 | compiler/rustc_codegen_llvm/src/consts.rs:98-103 \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 \u0060compiler/rustc_codegen_gcc/src/consts.rs:360\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":"compiler/rustc_codegen_gcc/src/consts.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9da22d7d137411cbe1c3999ca45a78b6d96a2016c501cd26104068dbb3cc256"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): compiler/rustc_codegen_gcc/src/type_.rs:370-375 | compiler/rustc_codegen_llvm/src/type_.rs:130-135 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_gcc/src/type_.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ee0101237f8831bae14c2b2d6595d0651a00378af50eee64196a9e56c0cc5bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): compiler/rustc_codegen_gcc/src/type_of.rs:111-117 | compiler/rustc_codegen_llvm/src/type_of.rs:65-71 \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 \u0060compiler/rustc_codegen_gcc/src/type_of.rs:111\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 after the matched lines, \u0060compiler/rustc_codegen_gcc/src/type_of.rs:118\u0060 calls \u0060Adt\u0060, \u0060Some\u0060 and \u0060compiler/rustc_codegen_llvm/src/type_of.rs:72\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":"compiler/rustc_codegen_gcc/src/type_of.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"48a770c5d96b0015beb2e713b6a76d6d179a498956986c2904d118b19a0f7db4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): compiler/rustc_const_eval/src/check_consts/resolver.rs:175-181 | compiler/rustc_const_eval/src/check_consts/resolver.rs:186-192 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_const_eval/src/check_consts/resolver.rs:175\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":"compiler/rustc_const_eval/src/check_consts/resolver.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6ce617a7266fc6f241b60c5850faa6630d9ad7a16fe6c960fc4b52f27e3918a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): compiler/rustc_const_eval/src/const_eval/machine.rs:862-867 | compiler/rustc_const_eval/src/const_eval/machine.rs:903-908 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_const_eval/src/const_eval/machine.rs:862\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":"compiler/rustc_const_eval/src/const_eval/machine.rs"},"region":{"startLine":862}}}],"partialFingerprints":{"codehealthFindingId/v1":"98ba5503d9490adb06a1ee39a7fa825cd2ea6cdf3b79cc8499bf9a66a628ae3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): compiler/rustc_const_eval/src/interpret/intrinsics.rs:275-280 | compiler/rustc_mir_dataflow/src/move_paths/builder.rs:202-207 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060compiler/rustc_mir_dataflow/src/move_paths/builder.rs:201\u0060 calls \u0060Pat\u0060 and \u0060compiler/rustc_const_eval/src/interpret/intrinsics.rs:274\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":"compiler/rustc_const_eval/src/interpret/intrinsics.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"397067e51ebeea6c0fc37b9b410a3376ad9f2773634a14ea534baf82de0a01cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): compiler/rustc_const_eval/src/interpret/intrinsics/simd.rs:677-682 | compiler/rustc_const_eval/src/interpret/intrinsics/simd.rs:707-712 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_const_eval/src/interpret/intrinsics/simd.rs:677\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":"compiler/rustc_const_eval/src/interpret/intrinsics/simd.rs"},"region":{"startLine":677}}}],"partialFingerprints":{"codehealthFindingId/v1":"73a05653d957973d6755f7be492262c4882e7fb673633cb9abebf6c62e9d3a0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): compiler/rustc_const_eval/src/interpret/memory.rs:488-493 | compiler/rustc_const_eval/src/interpret/memory.rs:504-509 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_const_eval/src/interpret/memory.rs:488\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, \u0060compiler/rustc_const_eval/src/interpret/memory.rs:487\u0060 calls \u0060try_from\u0060, \u0060bytes\u0060, \u0060unwrap\u0060 and \u0060compiler/rustc_const_eval/src/interpret/memory.rs:503\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":"compiler/rustc_const_eval/src/interpret/memory.rs"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7ba5e5d31f2614bc6f51a58dfd9cf8c5532b9281d2ac640f74b47e63d995dad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): compiler/rustc_hir_analysis/src/autoderef.rs:55-60 | src/tools/rust-analyzer/crates/hir-ty/src/autoderef.rs:176-181 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/autoderef.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"b85d6b8b67a29aeb9d0087b0987d1590d52f24fb72f96ea0c2761616be3054d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): compiler/rustc_hir_analysis/src/coherence/builtin.rs:454-459 | compiler/rustc_hir_analysis/src/coherence/builtin.rs:839-844 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_hir_analysis/src/coherence/builtin.rs:454\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":"compiler/rustc_hir_analysis/src/coherence/builtin.rs"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"2282b262ffd2cc9da77f556e59f4bdde650d0d813d8737e67eeedbf6412bd4e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): compiler/rustc_hir_typeck/src/coercion.rs:986-993 | compiler/rustc_hir_typeck/src/coercion.rs:1013-1020 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_hir_typeck/src/coercion.rs:986\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":"compiler/rustc_hir_typeck/src/coercion.rs"},"region":{"startLine":986}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0a1f473849022b14f1c790ed48484f15d4c01151769aed56e80f5b781181b00"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): compiler/rustc_hir_typeck/src/writeback.rs:163-168 | compiler/rustc_hir_typeck/src/writeback.rs:182-187 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_hir_typeck/src/writeback.rs:163\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":"compiler/rustc_hir_typeck/src/writeback.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6c6b386fd0a1aba9135b42b9d7624a038a4b2541012e466f088e63cfa17c04b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5\u20136 lines \u00D7 2): compiler/rustc_macros/src/diagnostics/diagnostic_builder.rs:27-31 | compiler/rustc_macros/src/diagnostics/subdiagnostic.rs:37-42 \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 \u0060compiler/rustc_macros/src/diagnostics/diagnostic_builder.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. 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":"compiler/rustc_macros/src/diagnostics/diagnostic_builder.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd48cbe4e1a2ce9ec43d89cd9d0846c64812becc2cb18e4194c9b81d47c806e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): compiler/rustc_middle/src/traits/mod.rs:735-746 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/select.rs:225-236 \u2014 before extracting anything, compare \u0060compiler/rustc_middle/src/traits/mod.rs\u0060 and \u0060src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/select.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 30 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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":"compiler/rustc_middle/src/traits/mod.rs"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d774f909145e82432387bd8558a8918adbdfb33107691cbd7896fc821bc453d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): compiler/rustc_middle/src/ty/layout.rs:188-194 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/util.rs:266-271 \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 \u0060compiler/rustc_middle/src/ty/layout.rs:188\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":"compiler/rustc_middle/src/ty/layout.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"b779b51f2908a33c44528639f245e1dab9c82b65132d57fdfe5604b472a9255e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): compiler/rustc_middle/src/ty/print/pretty.rs:632-639 | src/librustdoc/html/format.rs:475-482 \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 \u0060compiler/rustc_middle/src/ty/print/pretty.rs:632\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, \u0060compiler/rustc_middle/src/ty/print/pretty.rs:630\u0060 calls \u0060tcx\u0060 and \u0060src/librustdoc/html/format.rs:473\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":"compiler/rustc_middle/src/ty/print/pretty.rs"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"90cfea8ce59783a0d9d4d8218729e6041fbfbdfde49dafca20d9c88f29923793"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): compiler/rustc_mir_dataflow/src/framework/direction.rs:116-121 | compiler/rustc_mir_dataflow/src/framework/direction.rs:241-246 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_dataflow/src/framework/direction.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"f805ba9a3d831bf8738d440bd6bad70752197478dae6c26abfbc444163041fe0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): compiler/rustc_next_trait_solver/src/solve/assembly/structural_traits.rs:225-230 | compiler/rustc_trait_selection/src/traits/effects.rs:374-379 \u2014 before extracting anything, compare \u0060compiler/rustc_next_trait_solver/src/solve/assembly/structural_traits.rs\u0060 and \u0060compiler/rustc_trait_selection/src/traits/effects.rs\u0060 as WHOLE FILES: this scan already matched 7 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. 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":"compiler/rustc_next_trait_solver/src/solve/assembly/structural_traits.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e79b970324b50f5f93b09641084c95db96e637639760ebea0b04a0278ea200c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): compiler/rustc_serialize/src/serialize.rs:100-105 | compiler/rustc_serialize/src/serialize.rs:129-134 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_serialize/src/serialize.rs:100\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":"compiler/rustc_serialize/src/serialize.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d235637abbcab3f6f51cb40e417a69fc02cc2c5df35fbed3e93510585582819"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): compiler/rustc_trait_selection/src/diagnostics.rs:1998-2005 | compiler/rustc_trait_selection/src/error_reporting/infer/region.rs:1525-1532 \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":"compiler/rustc_trait_selection/src/diagnostics.rs"},"region":{"startLine":1998}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc690bab8189bc6b99b1cdc7c5809e86488ea3480c64db0b7140107d5d94f847"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): compiler/rustc_trait_selection/src/solve/fulfill/derive_errors.rs:319-324 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/errors.rs:451-456 \u2014 before extracting anything, compare \u0060compiler/rustc_trait_selection/src/solve/fulfill/derive_errors.rs\u0060 and \u0060src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/errors.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 99 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 \u0060compiler/rustc_trait_selection/src/solve/fulfill/derive_errors.rs:319\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 \u0060goal\u0060 to \u0060\u0026inspect::InspectGoal\u003C\u0027_, \u0027tcx\u003E\u0060 in one and \u0060\u0026inspect::InspectGoal\u003C\u0027_, \u0027db\u003E\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":"compiler/rustc_trait_selection/src/solve/fulfill/derive_errors.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"0823d41f9dcc6cc28c23aaef2c8c1b9d2281b326d8f18f99632ee89b4e889e71"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): compiler/rustc_type_ir/src/binder.rs:288-293 | compiler/rustc_type_ir/src/binder.rs:303-308 \u2014 both copies are in the same file, so extract the block 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":"compiler/rustc_type_ir/src/binder.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"596727dd111017786475efb4989f77edd41a8f165184aa1f35de718c8dec8aa1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): library/alloc/src/borrow.rs:499-504 | library/alloc/src/borrow.rs:516-521 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/alloc/src/borrow.rs:499\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060rhs\u0060 to \u0060\u0026\u0027a str\u0060 in one and \u0060Cow\u003C\u0027a, str\u003E\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":"library/alloc/src/borrow.rs"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8f9a207523e08b4207b669531684361c7a07bc55d5e0c8d417360a607ce787b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): library/alloc/src/collections/vec_deque/mod.rs:3879-3884 | library/alloc/src/collections/vec_deque/mod.rs:3889-3894 \u2014 both copies are in the same file, so extract the block 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":"library/alloc/src/collections/vec_deque/mod.rs"},"region":{"startLine":3879}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcb2e1e61d6c7b44d285598a5fce8592d0966376f0f511062d15d58d7bc55622"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): library/compiler-builtins/libm-test/src/generate/edge_cases.rs:177-182 | library/compiler-builtins/libm-test/src/run_cfg.rs:380-385 \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":"library/compiler-builtins/libm-test/src/generate/edge_cases.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"718048bcc666075ecbf11739c2a354d0b0d7ef2e261da1c2d556d60bcc1c37cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): library/core/src/fmt/builders.rs:386-391 | library/core/src/fmt/builders.rs:536-541 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/core/src/fmt/builders.rs:386\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":"library/core/src/fmt/builders.rs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"61749314fa14d945326929030d0aaaf3d8576a1b00938df443f760adb772b7be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): library/core/src/fmt/builders.rs:730-735 | library/core/src/fmt/builders.rs:945-950 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/core/src/fmt/builders.rs:730\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":"library/core/src/fmt/builders.rs"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"7146959e72588eda4136b831bb59a35d4b941ad441fb8fc678f99302382a9af6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): library/std/src/sys/fs/unix.rs:1841-1846 | library/std/src/sys/fs/unix.rs:1853-1858 \u2014 both copies are in the same file, so extract the block 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":"library/std/src/sys/fs/unix.rs"},"region":{"startLine":1841}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cd1e7dd44db65c575a10355e6d00ca829ae2aadac6aafda9fc88138a4ea6592"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): library/std/src/sys/net/connection/uefi/tcp4.rs:247-252 | library/std/src/sys/net/connection/uefi/tcp4.rs:330-335 \u2014 both copies are in the same file, so extract the block 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":"library/std/src/sys/net/connection/uefi/tcp4.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"729fc1f89e04fb06939c0befc1dca3c017f051f7c7904f8c258d59aa45ba5992"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): library/std/src/sys/process/windows/child_pipe.rs:248-253 | library/std/src/sys/process/windows/child_pipe.rs:267-272 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/std/src/sys/process/windows/child_pipe.rs:248\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":"library/std/src/sys/process/windows/child_pipe.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"87d7e8a79092567dae16abe282e7593dca8210fe83c56ee3989aca1e0286f214"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): library/std/src/sys/time/uefi.rs:204-209 | library/std/src/sys/time/uefi.rs:223-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 \u0060library/std/src/sys/time/uefi.rs:204\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":"library/std/src/sys/time/uefi.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"d45d876e4846a0e17a9be73e3da75125fcc66363d5e9b51527e53631e92c06db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): library/stdarch/crates/core_arch/src/wasm32/simd128.rs:2276-2281 | library/stdarch/crates/core_arch/src/wasm32/simd128.rs:2306-2311 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/stdarch/crates/core_arch/src/wasm32/simd128.rs:2276\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":"library/stdarch/crates/core_arch/src/wasm32/simd128.rs"},"region":{"startLine":2276}}}],"partialFingerprints":{"codehealthFindingId/v1":"b18e14854d0c144c8afb90d3e9552e7431206df019b9a25a50c704d015fbabc9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20136 lines \u00D7 3): library/stdarch/crates/core_arch/src/x86/avx2.rs:351-356 | library/stdarch/crates/core_arch/src/x86/avx2.rs:384-389 | library/stdarch/crates/core_arch/src/x86/avx2.rs:395-397 \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 \u0060library/stdarch/crates/core_arch/src/x86/avx2.rs:351\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":"library/stdarch/crates/core_arch/src/x86/avx2.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d13bc45d0065d4c837c3dd49876b974420630f23d3e1306040deb8846b92a49"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20136 lines \u00D7 3): library/stdarch/crates/core_arch/src/powerpc/vsx.rs:83-85 | library/stdarch/crates/core_arch/src/x86/avx512dq.rs:1577-1582 | library/stdarch/crates/core_arch/src/x86/avx512dq.rs:1762-1767 \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 \u0060library/stdarch/crates/core_arch/src/x86/avx512dq.rs:1577\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060library/stdarch/crates/core_arch/src/x86/avx512dq.rs:1759\u0060 calls \u0060as_i64x8\u0060 and \u0060library/stdarch/crates/core_arch/src/x86/avx512dq.rs:1574\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":"library/stdarch/crates/core_arch/src/powerpc/vsx.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c42c1f810abdf1fd3cf6fb5e588dd26bb2d78964068357a00d009fe019f4e1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5\u20136 lines \u00D7 2): library/stdarch/crates/core_arch/src/x86/avx512dq.rs:2040-2045 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:26388-26392 \u2014 before extracting anything, compare \u0060library/stdarch/crates/core_arch/src/x86/avx512dq.rs\u0060 and \u0060library/stdarch/crates/core_arch/src/x86/avx512f.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 53 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 \u0060library/stdarch/crates/core_arch/src/x86/avx512dq.rs:2040\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":"library/stdarch/crates/core_arch/src/x86/avx512dq.rs"},"region":{"startLine":2040}}}],"partialFingerprints":{"codehealthFindingId/v1":"cee263a2299b154e8cce4f4cfc818bf67b7eabf747e7c17ba89d65f5b1e7cc7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): library/stdarch/crates/core_arch/src/x86/avx512f.rs:6948-6953 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:6972-6977 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/stdarch/crates/core_arch/src/x86/avx512f.rs:6948\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":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":6948}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee241780a71ef557dc68c0ddd55bd9ce6f46a0ff2cbb1cec5b8b66f737b13537"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): library/stdarch/crates/core_arch/src/x86/avx512f.rs:7015-7020 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:7039-7044 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/stdarch/crates/core_arch/src/x86/avx512f.rs:7015\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":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":7015}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bb01af14b073f0d2fe373daa885564a7df56bdd41ee9572afbc4033f8ef00de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): library/stdarch/crates/core_arch/src/x86/avx512f.rs:7082-7087 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:7106-7111 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/stdarch/crates/core_arch/src/x86/avx512f.rs:7082\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":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":7082}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d2768247f25ebe3483cac8aebdeb59852cca95978d61658997e6003d40ecb7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): library/stdarch/crates/core_arch/src/x86/avx512f.rs:7149-7154 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:7173-7178 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/stdarch/crates/core_arch/src/x86/avx512f.rs:7149\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":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":7149}}}],"partialFingerprints":{"codehealthFindingId/v1":"57b5467205638949b02d1971ba6301c82d0faefe5c0f1910d714c057c73d96d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): library/stdarch/crates/core_arch/src/x86/avx512f.rs:7216-7221 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:7240-7245 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/stdarch/crates/core_arch/src/x86/avx512f.rs:7216\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":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":7216}}}],"partialFingerprints":{"codehealthFindingId/v1":"446cdbb340d4c2738abcd5cc5299f5da307146f96949600561566b4445c9ee35"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): library/stdarch/crates/core_arch/src/x86/avx512f.rs:7283-7288 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:7307-7312 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/stdarch/crates/core_arch/src/x86/avx512f.rs:7283\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":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":7283}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d4f82c358d7a56b5d36bdd5b40cb2754863322fed92ad0cc15a9941c399ccef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): library/stdarch/crates/core_arch/src/x86/avx512f.rs:28980-28986 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:29124-29130 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/stdarch/crates/core_arch/src/x86/avx512f.rs:28980\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":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":28980}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9fb4b94c0c1646600239b2f8974beec31f92ded79846ea7d22be27b04cec262"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): library/stdarch/crates/core_arch/src/x86/avx512f.rs:39466-39471 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:41904-41909 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/stdarch/crates/core_arch/src/x86/avx512f.rs:39466\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":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":39466}}}],"partialFingerprints":{"codehealthFindingId/v1":"9002a448908ec8d88fa7a65e573b0b280fdcc038c18fd9a33cc475d93923b259"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): library/stdarch/crates/core_arch/src/x86/avx512f.rs:39530-39535 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:42034-42039 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/stdarch/crates/core_arch/src/x86/avx512f.rs:39530\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":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":39530}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe558ed833c45de0cde8b69386b333c4baae1ff4b340ac6ceb4af301308f3b81"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): library/stdarch/crates/core_arch/src/x86/avx512f.rs:39701-39706 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:42391-42396 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/stdarch/crates/core_arch/src/x86/avx512f.rs:39701\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":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":39701}}}],"partialFingerprints":{"codehealthFindingId/v1":"86f776ac3eb2508be13faafae26a24a9a3f2cff659836a20e8f822fd619ce9dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): library/stdarch/crates/core_arch/src/x86/avx512f.rs:39746-39751 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:42462-42467 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/stdarch/crates/core_arch/src/x86/avx512f.rs:39746\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":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":39746}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b85875a415896baa0c3afae71de4095fdc5743914c1e4b02e1c33d57e7a9903"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): library/stdarch/crates/core_arch/src/x86/avx512f.rs:39768-39773 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:42525-42530 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/stdarch/crates/core_arch/src/x86/avx512f.rs:39768\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":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":39768}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5b22c80762b1316cbc329a3002d0a3ac9c0b2aaa1d4827bec7fc328e8aae281"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): library/stdarch/crates/core_arch/src/x86/avx512f.rs:39813-39818 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:42596-42601 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/stdarch/crates/core_arch/src/x86/avx512f.rs:39813\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":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":39813}}}],"partialFingerprints":{"codehealthFindingId/v1":"0693003476fe0c4c8b97798bd9c5f0f290deee40b4ae6ecb45ec63bd19a9edde"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): library/stdarch/crates/core_arch/src/x86/avx512f.rs:41023-41028 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:41101-41106 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/stdarch/crates/core_arch/src/x86/avx512f.rs:41023\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":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":41023}}}],"partialFingerprints":{"codehealthFindingId/v1":"928f3b55a314df89ba854cd3a8649a071235adc803d90df4c2f44e4c6733577d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): library/stdarch/crates/core_arch/src/x86/avx512f.rs:41138-41143 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:41216-41221 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/stdarch/crates/core_arch/src/x86/avx512f.rs:41138\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":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":41138}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa664b57a805cb16d839c32a865f67fd64d386caa0b246db6caf326ff234b390"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): library/stdarch/crates/stdarch-gen-loongarch/src/main.rs:483-488 | library/stdarch/crates/stdarch-gen-loongarch/src/main.rs:592-597 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/stdarch/crates/stdarch-gen-loongarch/src/main.rs:483\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":"library/stdarch/crates/stdarch-gen-loongarch/src/main.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"391c79609842e8c826eabb23238291ee46beb042d75225a5213a19a7108e9004"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/librustdoc/html/render/print_item.rs:2234-2239 | src/librustdoc/html/render/print_item.rs:2259-2264 \u2014 both copies are in the same file, so extract the block 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/librustdoc/html/render/print_item.rs"},"region":{"startLine":2234}}}],"partialFingerprints":{"codehealthFindingId/v1":"428aaae9eab67b7f8539f5f84a227f8787049d0b01df3ea4d86f7796ff7445fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/tools/clippy/clippy_lints/src/booleans.rs:160-165 | src/tools/clippy/clippy_lints/src/booleans.rs:180-185 \u2014 both copies are in the same file, so extract the block 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/tools/clippy/clippy_lints/src/booleans.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9385da111416ccf54567189745c5beb872516f7df877f28edaf21a2b1afbf01"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/tools/clippy/clippy_lints/src/floating_point_arithmetic/radians.rs:49-56 | src/tools/clippy/clippy_lints/src/floating_point_arithmetic/radians.rs:75-82 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/clippy/clippy_lints/src/floating_point_arithmetic/radians.rs:49\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/tools/clippy/clippy_lints/src/floating_point_arithmetic/radians.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"770d109b12895d057fa8bbb7928813b8b20f8859b9e68c40ec37b6c88dd7b060"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/tools/clippy/clippy_lints/src/functions/result.rs:58-64 | src/tools/clippy/clippy_lints/src/functions/result.rs:78-84 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/clippy/clippy_lints/src/functions/result.rs:58\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/tools/clippy/clippy_lints/src/functions/result.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0a5b262a0750eb313ccdda548b7fa3c6c87de4a6db4d99e4713677ef6da0dc3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/tools/clippy/clippy_lints/src/methods/unnecessary_first_then_check.rs:28-34 | src/tools/clippy/clippy_lints/src/methods/unnecessary_get_then_check.rs:39-44 \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/tools/clippy/clippy_lints/src/methods/unnecessary_first_then_check.rs:28\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/tools/clippy/clippy_lints/src/methods/unnecessary_first_then_check.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"640e9790b1f82c9dea13e3cbbe3a73f64b598923189fc83bb3812001d79a4e3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/tools/clippy/clippy_lints/src/operators/identity_op.rs:47-54 | src/tools/clippy/clippy_lints/src/operators/identity_op.rs:60-67 \u2014 both copies are in the same file, so extract the block 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/tools/clippy/clippy_lints/src/operators/identity_op.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d12cb0dc3347c9e50297cfbf557f4b580a9c8bbf0afa711aa2536888dc296a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/tools/clippy/clippy_utils/src/consts.rs:1066-1071 | src/tools/clippy/clippy_utils/src/consts.rs:1094-1099 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tools/clippy/clippy_utils/src/consts.rs:1066\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/tools/clippy/clippy_utils/src/consts.rs"},"region":{"startLine":1066}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef7680e27c0d3c64676adb08a46f7441ee00083a7b9063790594cba4d80cfad0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/tools/clippy/clippy_utils/src/visitors.rs:119-124 | src/tools/clippy/clippy_utils/src/visitors.rs:165-170 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/tools/clippy/clippy_utils/src/visitors.rs:173\u0060 calls \u0060visit_anon_const\u0060, \u0060Continue\u0060 and \u0060src/tools/clippy/clippy_utils/src/visitors.rs:127\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/tools/clippy/clippy_utils/src/visitors.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2281b0f7f8d462fccefa0dcd0f0413f6e7f9242c2cf9f2f5c9e0d1782741aad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/tools/clippy/clippy_utils/src/visitors.rs:450-456 | src/tools/clippy/clippy_utils/src/visitors.rs:465-471 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/clippy/clippy_utils/src/visitors.rs:450\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/tools/clippy/clippy_utils/src/visitors.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"394f8d7f1f70f70da869f629b3b3082c55ccb017c5267e15618d0c3816c7c111"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/tools/clippy/clippy_utils/src/visitors.rs:624-633 | src/tools/clippy/clippy_utils/src/visitors.rs:811-820 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/clippy/clippy_utils/src/visitors.rs:624\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/tools/clippy/clippy_utils/src/visitors.rs"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"b37b208d907421b2a86a58a7b43a93831bc0bde59e2162d42dd0737ced4988ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/tools/miri/cargo-miri/src/arg.rs:105-110 | src/tools/miri/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 \u0060src/tools/miri/cargo-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":"src/tools/miri/cargo-miri/src/arg.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"6702fde9a9ab6dd5ca77642a5be3f0a6d6bce726686c33ce2b399fa8390ea2d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/tools/miri/src/borrow_tracker/tree_borrows/wildcard.rs:202-207 | src/tools/miri/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/tools/miri/src/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/tools/miri/src/borrow_tracker/tree_borrows/wildcard.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"425df5c9f32a22adac6d56ed188565454e864b13b980f13d14018bbd0def3c1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/tools/miri/src/intrinsics/x86/avx.rs:190-196 | src/tools/miri/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/tools/miri/src/intrinsics/x86/avx.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4520d861014f25b649d12bdb18d55e18cffd496f1e6443d54ba57db82b72c89"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/tools/miri/src/intrinsics/x86/bmi.rs:32-37 | src/tools/miri/src/intrinsics/x86/sse42.rs:453-458 \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/tools/miri/src/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/tools/miri/src/intrinsics/x86/bmi.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f698dcacae1ce5d04aae84ec1a33dbf2773324b7ac3fdd5512c8379555d8cf2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/tools/miri/src/intrinsics/x86/sse.rs:124-129 | src/tools/miri/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/tools/miri/src/intrinsics/x86/sse.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c77658e3fd64bab7dad36ebf9504bfa05229f5969e626a4b2d4db2177b6977b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/tools/miri/src/shims/unix/android/foreign_items.rs:62-68 | src/tools/miri/src/shims/unix/linux/foreign_items.rs:142-148 \u2014 \u0060src/tools/miri/src/shims/unix/android/foreign_items.rs\u0060 and \u0060src/tools/miri/src/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/tools/miri/src/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/tools/miri/src/shims/unix/android/foreign_items.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eb96271d7c34fe42e1c7bb1e0af4dd80285a317086f6b54b47ffcf07aa3ade4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/tools/miri/src/shims/unix/foreign_items.rs:243-249 | src/tools/miri/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/tools/miri/src/shims/unix/foreign_items.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf028deafc7b233461dc2bd381d86c4dd33aaedc88e0c2a8eff36358a37b27d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/tools/miri/src/shims/unix/foreign_items.rs:303-308 | src/tools/miri/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/tools/miri/src/shims/unix/foreign_items.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"47e44bb4302fa16d72c56eb60a707f09a098114ad041a5b5c4782da7eaad79df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/tools/miri/src/shims/unix/foreign_items.rs:605-611 | src/tools/miri/src/shims/unix/solarish/foreign_items.rs:103-109 \u2014 before extracting anything, compare \u0060src/tools/miri/src/shims/unix/foreign_items.rs\u0060 and \u0060src/tools/miri/src/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/tools/miri/src/shims/unix/foreign_items.rs"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"82861f15f5b40e8b3017221314a789eb106d201b507dab5e9b4309655075d99f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/tools/miri/src/shims/unix/foreign_items.rs:643-649 | src/tools/miri/src/shims/unix/solarish/foreign_items.rs:121-127 \u2014 before extracting anything, compare \u0060src/tools/miri/src/shims/unix/foreign_items.rs\u0060 and \u0060src/tools/miri/src/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/tools/miri/src/shims/unix/foreign_items.rs"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbe329ef1fe9ed333e6e1cdbf3d8e7cef18ed2df693a42f739849f8caa9773a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/tools/miri/src/shims/unix/foreign_items.rs:1294-1299 | src/tools/miri/src/shims/unix/macos/foreign_items.rs:114-119 \u2014 before extracting anything, compare \u0060src/tools/miri/src/shims/unix/foreign_items.rs\u0060 and \u0060src/tools/miri/src/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/tools/miri/src/shims/unix/foreign_items.rs"},"region":{"startLine":1294}}}],"partialFingerprints":{"codehealthFindingId/v1":"824cbee16d0a1f30ea27ccd8b4b3bd2a48f60e53bc2ff2903aaf71f47702d836"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/tools/miri/src/shims/unix/freebsd/foreign_items.rs:73-78 | src/tools/miri/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/tools/miri/src/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/tools/miri/src/shims/unix/freebsd/foreign_items.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"992e210bd210319fee87d33be308a71d5e3cb4ee90ed51156c2ee0135941cddf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/tools/miri/src/shims/unix/freebsd/foreign_items.rs:174-179 | src/tools/miri/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/tools/miri/src/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/tools/miri/src/shims/unix/freebsd/foreign_items.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"7966ed64457c9e045a49b0290bc8c1c6627226e3bdea3f9cf283a9776c50ee97"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/tools/miri/src/shims/unix/tcp_socket.rs:274-279 | src/tools/miri/src/shims/unix/udp_socket.rs:161-166 \u2014 before extracting anything, compare \u0060src/tools/miri/src/shims/unix/tcp_socket.rs\u0060 and \u0060src/tools/miri/src/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/tools/miri/src/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/tools/miri/src/shims/unix/tcp_socket.rs:272\u0060 calls \u0060ensure_not_failed\u0060 and \u0060src/tools/miri/src/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/tools/miri/src/shims/unix/tcp_socket.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b5d72b1f43fd6c7d30d288870b580fc9866692416ca8a80e96f6543d3754b3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/tools/miri/src/shims/unix/virtual_socket.rs:601-606 | src/tools/miri/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/tools/miri/src/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/tools/miri/src/shims/unix/virtual_socket.rs"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"397847883060a06e7efb6d848ef1629b61fcee32c47bfb39142058240c7cc2e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-def/src/expr_store/lower.rs:1179-1184 | src/tools/rust-analyzer/crates/hir-def/src/expr_store/lower.rs:1208-1213 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/expr_store/lower.rs"},"region":{"startLine":1179}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbac7f1e82c7d407ccaa7794b216ff9e0ed4f12da7ca677f4b94f393c2471e5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-def/src/item_scope.rs:244-249 | src/tools/rust-analyzer/crates/hir-def/src/item_scope.rs:259-264 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/hir-def/src/item_scope.rs:244\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/tools/rust-analyzer/crates/hir-def/src/item_scope.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"65c65099df985e5e895a46fc3ca98d7c6079839021b1110c0985193ee13c0211"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-ty/src/infer/coerce.rs:1000-1005 | src/tools/rust-analyzer/crates/hir-ty/src/infer/coerce.rs:1007-1012 \u2014 both copies are in the same file, so extract the block 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/tools/rust-analyzer/crates/hir-ty/src/infer/coerce.rs"},"region":{"startLine":1000}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba32ae3925572a21fd6b6187b97d0d393e77236e3de1e3e7950201c633a592a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-ty/src/mir/eval/shim.rs:234-239 | src/tools/rust-analyzer/crates/hir-ty/src/mir/eval/shim.rs:246-251 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/hir-ty/src/mir/eval/shim.rs:234\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/tools/rust-analyzer/crates/hir-ty/src/mir/eval/shim.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d404d372732ffe4b1d0e26745850b7ce383bf7b0314040fc6f80f5705a96028"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-ty/src/mir/eval/shim.rs:1136-1141 | src/tools/rust-analyzer/crates/hir-ty/src/mir/eval/shim.rs:1168-1173 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/hir-ty/src/mir/eval/shim.rs:1136\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/tools/rust-analyzer/crates/hir-ty/src/mir/eval/shim.rs"},"region":{"startLine":1136}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ba48acc14b2fe371d0373f0a4d2bb2b66dbb1389ba58af3903afd64790e3f42"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-ty/src/next_solver/consts/valtree.rs:162-167 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/consts/valtree.rs:235-240 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/hir-ty/src/next_solver/consts/valtree.rs:162\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/tools/rust-analyzer/crates/hir-ty/src/next_solver/consts/valtree.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef0661efb55fb329def57b24f0c84126938f00687eab8c04a56d6c21190de83d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-ty/src/next_solver/interner.rs:1186-1191 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/interner.rs:1200-1205 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tools/rust-analyzer/crates/hir-ty/src/next_solver/interner.rs:1186\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 \u0060def_id\u0060 to \u0060Self::ImplOrTraitAssocTermId\u0060 in one and \u0060Self::InherentAssocTermId\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/tools/rust-analyzer/crates/hir-ty/src/next_solver/interner.rs"},"region":{"startLine":1186}}}],"partialFingerprints":{"codehealthFindingId/v1":"a46c56f7bb6a8744e5b93f9879f00c2f3d1f8aed6ce14f6490acc8f623880c5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/tools/rust-analyzer/crates/hir/src/diagnostics.rs:2002-2007 | src/tools/rust-analyzer/crates/hir/src/diagnostics.rs:2018-2023 \u2014 both copies are in the same file, so extract the block 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/tools/rust-analyzer/crates/hir/src/diagnostics.rs"},"region":{"startLine":2002}}}],"partialFingerprints":{"codehealthFindingId/v1":"88d94999c3fd93bdacbded62ad7059ff1193e6141b8bccda5a9c4d4e96abcf26"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/tools/rust-analyzer/crates/hir/src/source_analyzer.rs:1546-1552 | src/tools/rust-analyzer/crates/hir/src/source_analyzer.rs:1563-1569 \u2014 both copies are in the same file, so extract the block 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/tools/rust-analyzer/crates/hir/src/source_analyzer.rs"},"region":{"startLine":1546}}}],"partialFingerprints":{"codehealthFindingId/v1":"82fc4026d1aba7fd8cc5c16e67afb5f4f96d88b62b6beb82f56a22d4d2706647"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/tools/rust-analyzer/crates/hir/src/term_search/expr.rs:130-135 | src/tools/rust-analyzer/crates/hir/src/term_search/expr.rs:159-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir/src/term_search/expr.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b219f4f0680ed2e985d13aac37f7655074d2d028a20bd8fd3054e60249a9471"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/tools/rust-analyzer/crates/hir/src/term_search/expr.rs:130-135 | src/tools/rust-analyzer/crates/hir/src/term_search/expr.rs:271-276 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir/src/term_search/expr.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"db5cf0aa35b11a62fb462f4d22d30b7e6015b9edc20485f5ab7a0d657ca7510f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_bool_then.rs:86-91 | src/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_bool_then.rs:271-276 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_bool_then.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ed4fc4afb504372c96965bd5b02b0b9a214bb39cb9225de999c39dd11728cea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_from_to_tryfrom.rs:45-50 | src/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_into_to_from.rs:60-65 \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/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_from_to_tryfrom.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"19b425892cf486ab04c7ee0f08cffc13bbe008dc49ff66df25db8979776630ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/tools/rust-analyzer/crates/ide-assists/src/handlers/expand_glob_import.rs:45-56 | src/tools/rust-analyzer/crates/ide-assists/src/handlers/expand_glob_import.rs:103-114 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/tools/rust-analyzer/crates/ide-assists/src/handlers/expand_glob_import.rs:116\u0060 calls \u0060get_export_visibility_kind\u0060 and \u0060src/tools/rust-analyzer/crates/ide-assists/src/handlers/expand_glob_import.rs:58\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/tools/rust-analyzer/crates/ide-assists/src/handlers/expand_glob_import.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"693ef2e778896b5b2d521f57c057343de11c6e388eb0b1f98e87fba1e1cac306"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_new.rs:82-89 | src/tools/rust-analyzer/crates/ide-assists/src/handlers/qualify_method_call.rs:48-53 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_new.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f7a799472c11f7b67b3e95b68fae3b76232c4146a4fa3c7cdeee43a3b398e07"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/tools/rust-analyzer/crates/ide-assists/src/handlers/remove_unused_param.rs:165-171 | src/tools/rust-analyzer/crates/ide-assists/src/handlers/remove_unused_param.rs:190-196 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tools/rust-analyzer/crates/ide-assists/src/handlers/remove_unused_param.rs:165\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/tools/rust-analyzer/crates/ide-assists/src/handlers/remove_unused_param.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac00c680fd1123b3de6552991fa540a4400bd0c19653d366fdd4f4c4cdd0cbd3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/tools/rust-analyzer/crates/ide-assists/src/handlers/unwrap_return_type.rs:41-46 | src/tools/rust-analyzer/crates/ide-assists/src/handlers/wrap_return_type.rs:44-49 \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/tools/rust-analyzer/crates/ide-assists/src/handlers/unwrap_return_type.rs:41\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/tools/rust-analyzer/crates/ide-assists/src/handlers/unwrap_return_type.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5a4f31c3ab96d5f74728567540b59d21d714669abee5fe9dc785197d11e86e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/tools/rust-analyzer/crates/ide-assists/src/utils/gen_trait_fn_body.rs:56-61 | src/tools/rust-analyzer/crates/ide-assists/src/utils/gen_trait_fn_body.rs:166-171 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/ide-assists/src/utils/gen_trait_fn_body.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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/tools/rust-analyzer/crates/ide-assists/src/utils/gen_trait_fn_body.rs:172\u0060 calls \u0060expr_path\u0060, \u0060ident_path\u0060 and \u0060src/tools/rust-analyzer/crates/ide-assists/src/utils/gen_trait_fn_body.rs:63\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/tools/rust-analyzer/crates/ide-assists/src/utils/gen_trait_fn_body.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"282b233e1cb2c7f658af93d6ef0e8073c0979c94094148f8182754d89244f83f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/tools/rust-analyzer/crates/ide-assists/src/utils/gen_trait_fn_body.rs:197-202 | src/tools/rust-analyzer/crates/ide-assists/src/utils/gen_trait_fn_body.rs:231-236 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/ide-assists/src/utils/gen_trait_fn_body.rs:197\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/tools/rust-analyzer/crates/ide-assists/src/utils/gen_trait_fn_body.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"d866bb0bc99e3391d62f2003f74dacb56cf8e2e05c5c70bfbf9f8dd66d374768"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/tools/rust-analyzer/crates/ide-assists/src/utils/gen_trait_fn_body.rs:391-397 | src/tools/rust-analyzer/crates/ide-assists/src/utils/gen_trait_fn_body.rs:671-676 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tools/rust-analyzer/crates/ide-assists/src/utils/gen_trait_fn_body.rs:391\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/tools/rust-analyzer/crates/ide-assists/src/utils/gen_trait_fn_body.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc03d62fa51a62019effd78ea15c499a40db3aef1ba6de1f15f98806c76367f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/tools/rust-analyzer/crates/ide-assists/src/utils/gen_trait_fn_body.rs:503-508 | src/tools/rust-analyzer/crates/ide-assists/src/utils/gen_trait_fn_body.rs:536-541 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/ide-assists/src/utils/gen_trait_fn_body.rs:503\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/tools/rust-analyzer/crates/ide-assists/src/utils/gen_trait_fn_body.rs"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"adcc1496510dc38517951b8d5e61cf9b1f9a6c5f104f7ba96adb1baef2d52929"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/tools/rust-analyzer/crates/ide/src/interpret.rs:25-34 | src/tools/rust-analyzer/crates/ide/src/view_mir.rs:15-24 \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/tools/rust-analyzer/crates/ide/src/interpret.rs:25\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/tools/rust-analyzer/crates/ide/src/interpret.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"d159252239475cf74ff73d201bf652d5d6892ba135edfb58924bb803e72ea931"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/tools/rust-analyzer/crates/load-cargo/src/lib.rs:596-601 | src/tools/rust-analyzer/crates/load-cargo/src/lib.rs:633-638 \u2014 both copies are in the same file, so extract the block 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/tools/rust-analyzer/crates/load-cargo/src/lib.rs"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e3135004740291e20f8b927ffedb3166c4e4574aa44e1e5bfee2a1631ea198a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/tools/rust-analyzer/crates/proc-macro-srv-cli/src/main_loop.rs:137-143 | src/tools/rust-analyzer/crates/proc-macro-srv-cli/src/main_loop.rs:520-525 \u2014 both copies are in the same file, so extract the block 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/tools/rust-analyzer/crates/proc-macro-srv-cli/src/main_loop.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"d712606385da868f10b5052162eb3b4743783157651f386b9a11fb496622ce59"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/tools/rust-analyzer/crates/rust-analyzer/src/cli/analysis_stats.rs:456-461 | src/tools/rust-analyzer/crates/rust-analyzer/src/cli/analysis_stats.rs:1339-1344 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/rust-analyzer/src/cli/analysis_stats.rs:456\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/tools/rust-analyzer/crates/rust-analyzer/src/cli/analysis_stats.rs"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"aae6250e4983c8817fcb4201dc4fcf361c4ae358405922e264661130bdcad139"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/tools/rust-analyzer/crates/rust-analyzer/src/cli/analysis_stats.rs:844-858 | src/tools/rust-analyzer/crates/rust-analyzer/src/cli/analysis_stats.rs:1265-1279 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/rust-analyzer/src/cli/analysis_stats.rs:844\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/tools/rust-analyzer/crates/rust-analyzer/src/cli/analysis_stats.rs"},"region":{"startLine":844}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f77002514a212b0019d937723bdf222d73399f76ddef601794d3f0515c07047"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/tools/rust-analyzer/crates/rust-analyzer/src/handlers/request.rs:1074-1079 | src/tools/rust-analyzer/crates/rust-analyzer/src/handlers/request.rs:1108-1113 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/rust-analyzer/src/handlers/request.rs:1074\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/tools/rust-analyzer/crates/rust-analyzer/src/handlers/request.rs"},"region":{"startLine":1074}}}],"partialFingerprints":{"codehealthFindingId/v1":"518f25f26c4ef625f9d0ea7aa0eea463d7a93f73244170a918e4acc7bf5d48e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/tools/rust-analyzer/crates/rust-analyzer/src/main_loop.rs:678-688 | src/tools/rust-analyzer/crates/rust-analyzer/src/main_loop.rs:780-785 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/rust-analyzer/src/main_loop.rs:678\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/tools/rust-analyzer/crates/rust-analyzer/src/main_loop.rs"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3897e08c0e70f98360c034201848f5ebaa2bbb7504b425654638b382e557c2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/tools/rust-analyzer/crates/syntax/src/algo.rs:82-90 | src/tools/rust-analyzer/crates/syntax/src/algo.rs:102-110 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tools/rust-analyzer/crates/syntax/src/algo.rs:82\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060u\u0060 to \u0060\u0026SyntaxNode\u0060 in one and \u0060impl Element\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/tools/rust-analyzer/crates/syntax/src/algo.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef31f1a7b2c13005a5a9d7a0be6d6f938bd05dd4d30a779977e59a278941653d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:475-482 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1521-1528 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:475\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/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"929d9885d2f868307ca951d733ecf6b51a1e2e5814241ccc7940c3aeb5d80f90"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u20136 lines \u00D7 8): src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:57-58 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:564-569 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:604-605 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1086-1087 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1097-1102 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1118-1119 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1305-1306 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:2283-2284 \u2014 all 8 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:57\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/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"107523179dc6cf566294675e6fd5b0639313832c2fd8d1a9e378d12a781f51ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u20136 lines \u00D7 6): src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:124-125 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:463-464 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:751-756 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:763-768 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:901-903 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:2010-2011 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:751\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:751\u0060 calls \u0060map_node\u0060, \u0060syntax\u0060, \u0060clone\u0060 and \u0060src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:124\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/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"b51bfa2c3401fc28d9295f79728a4aa0733aa2b8cef7ac63bf6c9a8d2dd154ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20136 lines \u00D7 3): src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:571-573 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1089-1094 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1104-1109 \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/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:571\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/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"49d373cb460570a2e5081e75140fa5699b59799da34d15ac5c0e929a15003559"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1145-1150 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1164-1169 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1145\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/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs"},"region":{"startLine":1145}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fe190a8150d5c580f239336269e1c34bcaa5f6dd2db795a2dc2910278f0269b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1191-1196 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1224-1229 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1191\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/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs"},"region":{"startLine":1191}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f277d329a3e9964e43960413077d77206d22b1d20667ab6224afaa94d4947c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1320-1325 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1339-1344 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1320\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs"},"region":{"startLine":1320}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6349baeb8e4792ea134448e28b0b70a9b5e549ebf4d267e59296ff330b323f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:2024-2031 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:2036-2043 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:2024\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/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs"},"region":{"startLine":2024}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d878a197a5187ebf023c90653f3f0d0a5958160750ee436d02d97e303b43554"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/tools/rust-analyzer/crates/syntax/src/syntax_editor/edits.rs:135-140 | src/tools/rust-analyzer/crates/syntax/src/syntax_editor/edits.rs:152-157 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/syntax/src/syntax_editor/edits.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdf455b4edd854f3fb1e6457b80a7cd872ce204ca71cf154b24e48b62fb8c090"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/tools/rust-analyzer/crates/syntax/src/validation.rs:403-412 | src/tools/rust-analyzer/crates/syntax/src/validation.rs:417-426 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tools/rust-analyzer/crates/syntax/src/validation.rs:403\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060ty\u0060 to \u0060ast::DynTraitType\u0060 in one and \u0060ast::ImplTraitType\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/tools/rust-analyzer/crates/syntax/src/validation.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c852f346b98a060325ab78136fb7593e9e8c2f70cfe6207b5c1320c2d83e8e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/tools/rust-analyzer/xtask/src/codegen/diagnostics_docs.rs:35-40 | src/tools/rust-analyzer/xtask/src/codegen/feature_docs.rs:34-39 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/xtask/src/codegen/diagnostics_docs.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"e74287a7d8fc3ff2f896801b5037c12fcb7d831d2226deffe4f04e0e0d93327f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/tools/rustfmt/src/missed_spans.rs:282-289 | src/tools/rustfmt/src/visitor.rs:313-318 \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/tools/rustfmt/src/missed_spans.rs:282\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/tools/rustfmt/src/missed_spans.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"27d847aac91882782980061b487cb759958f48578ef0ea44c1f4e6eed5c92a89"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/tools/rustfmt/src/source_map.rs:40-45 | src/tools/rustfmt/src/source_map.rs:61-66 \u2014 both copies are in the same file, so extract the block 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/tools/rustfmt/src/source_map.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"80f45d76f3af45b2115c5c6135945a697ad52e27688021fbaba2e882a3d1d523"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 12): src/tools/miri/src/intrinsics/x86/gfni.rs:79-83 | src/tools/miri/src/intrinsics/x86/mod.rs:307-311 | src/tools/miri/src/intrinsics/x86/mod.rs:337-341 | src/tools/miri/src/intrinsics/x86/mod.rs:516-520 | src/tools/miri/src/intrinsics/x86/mod.rs:582-586 | src/tools/miri/src/intrinsics/x86/mod.rs:865-869 | src/tools/miri/src/intrinsics/x86/mod.rs:911-915 | src/tools/miri/src/intrinsics/x86/mod.rs:1025-1032 | src/tools/miri/src/intrinsics/x86/mod.rs:1172-1180 | src/tools/miri/src/intrinsics/x86/mod.rs:1264-1268 | src/tools/miri/src/intrinsics/x86/mod.rs:1362-1366 | src/tools/miri/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/tools/miri/src/intrinsics/x86/mod.rs:1185\u0060 calls \u0060is_power_of_two\u0060, \u0060from\u0060, \u0060strict_sub\u0060 and \u0060src/tools/miri/src/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/tools/miri/src/intrinsics/x86/gfni.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf3934fae3a79a63f39a8dd1634446efa2d47dade12ecbd2d437bec38819c0ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 7): compiler/rustc_const_eval/src/interpret/intrinsics/simd.rs:193-197 | compiler/rustc_const_eval/src/interpret/intrinsics/simd.rs:376-380 | compiler/rustc_const_eval/src/interpret/intrinsics/simd.rs:592-596 | compiler/rustc_const_eval/src/interpret/intrinsics/simd.rs:622-626 | compiler/rustc_const_eval/src/interpret/intrinsics/simd.rs:668-672 | compiler/rustc_const_eval/src/interpret/intrinsics/simd.rs:734-738 | compiler/rustc_const_eval/src/interpret/intrinsics/simd.rs:765-769 \u2014 all 7 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":"compiler/rustc_const_eval/src/interpret/intrinsics/simd.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"be19e0114aa399c2adf21451fef321a49980d6d0ae8e8169a863a2adb336007c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 6): src/librustdoc/html/markdown.rs:1448-1452 | src/librustdoc/html/markdown.rs:1526-1530 | src/librustdoc/html/markdown.rs:1570-1574 | src/librustdoc/html/markdown.rs:1607-1611 | src/librustdoc/html/markdown.rs:1654-1658 | src/librustdoc/html/markdown.rs:1735-1739 \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. 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/librustdoc/html/markdown.rs"},"region":{"startLine":1448}}}],"partialFingerprints":{"codehealthFindingId/v1":"51670110923dd3d928d5784a9acb8b95a387fb29960a1f79f156f1fa90067a58"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 6): src/tools/miri/src/shims/unix/android/foreign_items.rs:32-37 | src/tools/miri/src/shims/unix/android/foreign_items.rs:43-48 | src/tools/miri/src/shims/unix/foreign_items.rs:245-250 | src/tools/miri/src/shims/unix/foreign_items.rs:256-261 | src/tools/miri/src/shims/unix/linux/foreign_items.rs:69-74 | src/tools/miri/src/shims/unix/linux/foreign_items.rs:80-85 \u2014 before extracting anything, compare \u0060src/tools/miri/src/shims/unix/android/foreign_items.rs\u0060 and \u0060src/tools/miri/src/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/tools/miri/src/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/tools/miri/src/shims/unix/android/foreign_items.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a9484e52258c2086eefa79db2fbf852252639bff85b3be0a086df0cd2f58288"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 5): compiler/rustc_codegen_cranelift/src/value_and_place.rs:902-909 | compiler/rustc_codegen_cranelift/src/value_and_place.rs:915-922 | compiler/rustc_codegen_cranelift/src/value_and_place.rs:929-936 | compiler/rustc_codegen_cranelift/src/value_and_place.rs:942-949 | compiler/rustc_codegen_cranelift/src/value_and_place.rs:955-962 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_codegen_cranelift/src/value_and_place.rs:902\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":"compiler/rustc_codegen_cranelift/src/value_and_place.rs"},"region":{"startLine":902}}}],"partialFingerprints":{"codehealthFindingId/v1":"d89fb34ca4d3b169a4d360279a015238403235fdcefd34671416506fbca4d99a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5): library/stdarch/crates/core_arch/src/loongarch64/lasx/portable.rs:273-277 | library/stdarch/crates/core_arch/src/loongarch64/lasx/portable.rs:292-296 | library/stdarch/crates/core_arch/src/loongarch64/lasx/portable.rs:307-311 | library/stdarch/crates/core_arch/src/loongarch64/lsx/portable.rs:179-183 | library/stdarch/crates/core_arch/src/loongarch64/lsx/portable.rs:194-198 \u2014 there are 5 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 5 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/stdarch/crates/core_arch/src/loongarch64/lasx/portable.rs:273\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":"library/stdarch/crates/core_arch/src/loongarch64/lasx/portable.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"d635b29b2c6e1aa4b5eea5a1f24f051e73dbabf221af196839e0350f11e9af77"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs:1351-1355 | compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs:1360-1364 | compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs:1369-1373 | compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs:1378-1382 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs"},"region":{"startLine":1351}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b1bfb733d115e1c74b57ea05342129faa9d3784ea0f44ef079e9e0ccd062e8c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs:1387-1391 | compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs:1396-1400 | compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs:1405-1409 | compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs:1414-1418 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs"},"region":{"startLine":1387}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2072dcc5470398ca8b6805d8fa79bbc6d07a7fa572452f6b9c5b0413ab69af1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (1\u20135 lines \u00D7 6): library/stdarch/crates/core_arch/src/x86/avx512dq.rs:1454-1458 | library/stdarch/crates/core_arch/src/x86/avx512dq.rs:1640-1640 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:26479-26479 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:26543-26547 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:26694-26698 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:26757-26761 \u2014 before extracting anything, compare \u0060library/stdarch/crates/core_arch/src/x86/avx512dq.rs\u0060 and \u0060library/stdarch/crates/core_arch/src/x86/avx512f.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 53 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 \u0060library/stdarch/crates/core_arch/src/x86/avx512dq.rs:1454\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060b\u0060 to \u0060__m128i\u0060 in one and \u0060__m128\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060library/stdarch/crates/core_arch/src/x86/avx512f.rs:26541\u0060 calls \u0060_mm512_castsi256_si512\u0060 and \u0060library/stdarch/crates/core_arch/src/x86/avx512dq.rs:1452\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":"library/stdarch/crates/core_arch/src/x86/avx512dq.rs"},"region":{"startLine":1454}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4484d64febff1a81a1ff1fab976602009e2b010c51eab669020043937ef9306"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): src/tools/miri/src/shims/unix/fs.rs:886-891 | src/tools/miri/src/shims/unix/linux_like/epoll.rs:89-93 | src/tools/miri/src/shims/unix/socket.rs:717-721 | src/tools/miri/src/shims/unix/socket.rs:758-762 \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/tools/miri/src/shims/unix/fs.rs"},"region":{"startLine":886}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c47cbbb5fe67e1f30e83a58868d0c0c00296e62ccec18a449baa345fb2d939c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20135 lines \u00D7 5): src/tools/rust-analyzer/crates/ide/src/highlight_related.rs:315-319 | src/tools/rust-analyzer/crates/ide/src/highlight_related.rs:398-402 | src/tools/rust-analyzer/crates/ide/src/highlight_related.rs:505-509 | src/tools/rust-analyzer/crates/ide/src/highlight_related.rs:598-602 | src/tools/rust-analyzer/crates/ide/src/highlight_related.rs:798-800 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tools/rust-analyzer/crates/ide/src/highlight_related.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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/tools/rust-analyzer/crates/ide/src/highlight_related.rs:398\u0060 calls \u0060Some\u0060, \u0060original_frange\u0060 and \u0060src/tools/rust-analyzer/crates/ide/src/highlight_related.rs:798\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/tools/rust-analyzer/crates/ide/src/highlight_related.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fe37885920f3e6febfd4119b5f1f1019ad8b6e23d9828c31b1d1ceaf213b562"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): compiler/rustc_builtin_macros/src/autodiff.rs:377-382 | compiler/rustc_builtin_macros/src/autodiff.rs:386-391 | compiler/rustc_builtin_macros/src/autodiff.rs:397-402 \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":"compiler/rustc_builtin_macros/src/autodiff.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5c2a23b68a8e9686d8eb3cedcd2ca02859733c198d734d58808f57e0d20f4ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs:98-102 | compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs:139-144 | compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs:198-203 \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":"compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad2a730d5bfb54cb7cab847b5c258dddab8b4d80f8539be557f670285004fb1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): compiler/rustc_macros/src/type_foldable.rs:14-18 | compiler/rustc_type_ir_macros/src/lib.rs:148-152 | src/tools/rust-analyzer/crates/macros/src/lib.rs:102-106 \u2014 before extracting anything, compare \u0060compiler/rustc_macros/src/type_foldable.rs\u0060 and \u0060src/tools/rust-analyzer/crates/macros/src/lib.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 31 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 \u0060compiler/rustc_macros/src/type_foldable.rs:14\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":"compiler/rustc_macros/src/type_foldable.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"50445b15a6d2114dc4ad1f102468ce3c707376f9762bef6decb4b391e8cd82e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): compiler/rustc_target/src/asm/mod.rs:1300-1305 | compiler/rustc_target/src/asm/mod.rs:1330-1335 | compiler/rustc_target/src/asm/mod.rs:1359-1364 \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 \u0060compiler/rustc_target/src/asm/mod.rs:1300\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":"compiler/rustc_target/src/asm/mod.rs"},"region":{"startLine":1300}}}],"partialFingerprints":{"codehealthFindingId/v1":"190993a1fe27c65bb28e9768fd7c17db2d8ce82b33b25d870e94ece4a3b6e7f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): src/tools/miri/src/shims/unix/virtual_socket.rs:596-600 | src/tools/miri/src/shims/unix/virtual_socket.rs:607-611 | src/tools/miri/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/tools/miri/src/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/tools/miri/src/shims/unix/virtual_socket.rs"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e988d2e4a46fc89e8079cd4a4f9dc52e2d6855df65c241d273316db23d6c531"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): src/tools/rust-analyzer/crates/ide-assists/src/handlers/expand_rest_pattern.rs:129-134 | src/tools/rust-analyzer/crates/ide-assists/src/handlers/expand_rest_pattern.rs:191-195 | src/tools/rust-analyzer/crates/ide-assists/src/handlers/expand_rest_pattern.rs:252-257 \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/tools/rust-analyzer/crates/ide-assists/src/handlers/expand_rest_pattern.rs:129\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/tools/rust-analyzer/crates/ide-assists/src/handlers/expand_rest_pattern.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9946991bf121f144b0884bded1ba0bc8100d0783c920734ca911c1ae6426224"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u20135 lines \u00D7 4): src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:200-205 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:605-606 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1511-1516 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:2236-2240 \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/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:200\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:200\u0060 calls \u0060map_node\u0060, \u0060syntax\u0060, \u0060clone\u0060 and \u0060src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:605\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/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"11d96b5ac68cd3930cb980282350c90467d473cd080888f572523145c521aee1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u20135 lines \u00D7 9): src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:316-320 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1061-1062 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1130-1131 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1142-1143 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1186-1190 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1219-1223 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1362-1363 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1374-1375 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:2283-2284 \u2014 all 9 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/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:316\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/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:1145\u0060 calls \u0060map_node\u0060, \u0060syntax\u0060, \u0060clone\u0060 and \u0060src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:322\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/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0c5bb023367d13e76c88cb1a24a1b4b4e223f2163fe39dbae134f6dc028c5e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): compiler/rustc_ast/src/ast.rs:176-180 | compiler/rustc_ast/src/ast.rs:196-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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060path\u0060 to \u0060impl IntoIterator\u003CItem = impl Borrow\u003CSymbol\u003E\u003E\u0060 in one and \u0060impl IntoIterator\u003CItem = impl Borrow\u003CIdent\u003E\u003E\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":"compiler/rustc_ast/src/ast.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"81a1fea208a0d3517b09547852ba971f493647db377bcaf73caaec6ff9b9124d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): compiler/rustc_ast_passes/src/ast_validation.rs:1618-1623 | compiler/rustc_ast_passes/src/ast_validation.rs:1629-1634 \u2014 both copies are in the same file, so extract the block 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":"compiler/rustc_ast_passes/src/ast_validation.rs"},"region":{"startLine":1618}}}],"partialFingerprints":{"codehealthFindingId/v1":"5481c4e1f40258e3254e9c1280395441440afb8532c964f85cfb227bf8e44f54"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): compiler/rustc_ast_pretty/src/pprust/state/item.rs:29-34 | compiler/rustc_ast_pretty/src/pprust/state/item.rs:608-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 \u0060compiler/rustc_ast_pretty/src/pprust/state/item.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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060item\u0060 to \u0060\u0026ast::ForeignItem\u0060 in one and \u0060\u0026ast::AssocItem\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":"compiler/rustc_ast_pretty/src/pprust/state/item.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"a36737a828ec2d99f8f33f01557916d38226db84f75cf2ab44968c0b8494bee9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): compiler/rustc_builtin_macros/src/define_opaque.rs:13-17 | compiler/rustc_builtin_macros/src/define_opaque.rs:25-29 \u2014 both copies are in the same file, so extract the block 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060compiler/rustc_builtin_macros/src/define_opaque.rs:18\u0060 calls \u0060AssocItem\u0060, \u0060Fn\u0060, \u0060Some\u0060 and \u0060compiler/rustc_builtin_macros/src/define_opaque.rs:30\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":"compiler/rustc_builtin_macros/src/define_opaque.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"1119e5999e67987741b2d60784fa74cb9ca37881aa232eb3a9e2e2ebcba13fe1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): compiler/rustc_codegen_cranelift/scripts/rustc-clif.rs:56-60 | compiler/rustc_codegen_cranelift/scripts/rustdoc-clif.rs:56-60 \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 \u0060compiler/rustc_codegen_cranelift/scripts/rustc-clif.rs:56\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/scripts/rustc-clif.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eb71586964937ff17c102ab5a9836925d3691f1b3566ae946eb7f1fd4a88b84"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): compiler/rustc_codegen_cranelift/src/intrinsics/llvm_aarch64.rs:419-429 | compiler/rustc_codegen_cranelift/src/intrinsics/llvm_aarch64.rs:433-443 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_codegen_cranelift/src/intrinsics/llvm_aarch64.rs:419\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":"compiler/rustc_codegen_cranelift/src/intrinsics/llvm_aarch64.rs"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"0748792721b52aef311c06c4ec1b1513052d795df2ed1337339420b7c2545b70"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs:1270-1274 | compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs:1310-1314 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs:1270\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":"compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs"},"region":{"startLine":1270}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeabb2e44ff1f0859fdaa09d93cf9fa54cf9c8352cbde9c9a0376282d8a15f03"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs:1281-1285 | compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs:1290-1294 | compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs:1298-1305 \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 \u0060compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs:1298\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":"compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs"},"region":{"startLine":1281}}}],"partialFingerprints":{"codehealthFindingId/v1":"96187eddc7f70f833c6be178b5dcbcf443399cece14ff3e43e89fbbb93c8164a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs:1321-1325 | compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs:1330-1334 | compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs:1338-1345 \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 \u0060compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs:1338\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":"compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs"},"region":{"startLine":1321}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ef08cde76234b2b01ae5ff39c17b8765223cb2456250ba3b33de2c19c3f75ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs:501-505 | compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs:817-821 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs:501\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":"compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0c5dc1bf75b8e432fc945c422e8fab560298f41937330f6f5cdc19f7baf2e13"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs:1076-1082 | compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs:1168-1174 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs:1076\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":"compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs"},"region":{"startLine":1076}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff5e43ffb06de806295c8f2ac804ebc25e97867d935d317c7697f6e71d8efd3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): compiler/rustc_codegen_cranelift/src/value_and_place.rs:237-242 | compiler/rustc_codegen_cranelift/src/value_and_place.rs:737-742 \u2014 both copies are in the same file, so extract the block 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":"compiler/rustc_codegen_cranelift/src/value_and_place.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aabf747e41a231932c2f6d9375754125d609919a0c7348f29e3b15f29092452"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): compiler/rustc_codegen_gcc/src/asm.rs:1153-1160 | compiler/rustc_codegen_llvm/src/asm.rs:992-999 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_gcc/src/asm.rs"},"region":{"startLine":1153}}}],"partialFingerprints":{"codehealthFindingId/v1":"f73206cc02b56e704cd47a0629fe8d42b3ac80257ac71353a9c20035a7ba894f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): compiler/rustc_codegen_gcc/src/back/lto.rs:217-221 | compiler/rustc_codegen_llvm/src/back/lto.rs:300-304 \u2014 before extracting anything, compare \u0060compiler/rustc_codegen_gcc/src/back/lto.rs\u0060 and \u0060compiler/rustc_codegen_llvm/src/back/lto.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 49 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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 \u0060compiler/rustc_codegen_gcc/src/back/lto.rs:217\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060compiler/rustc_codegen_llvm/src/back/lto.rs:308\u0060 calls \u0060LLVMRustLinkerNew\u0060 and \u0060compiler/rustc_codegen_gcc/src/back/lto.rs:225\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":"compiler/rustc_codegen_gcc/src/back/lto.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfcd7e93d99c61c2b2a95ae314645984b479fbcfdd32c2a8aeaa590e891213dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): compiler/rustc_codegen_gcc/src/intrinsic/llvm.rs:622-628 | compiler/rustc_codegen_gcc/src/intrinsic/llvm.rs:630-636 \u2014 both copies are in the same file, so extract the block 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":"compiler/rustc_codegen_gcc/src/intrinsic/llvm.rs"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f3b0ddf67fed73c8c893c52935762ce3b33747565506ed528903f67b4abd09f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): compiler/rustc_codegen_gcc/src/intrinsic/simd.rs:1337-1341 | compiler/rustc_codegen_gcc/src/intrinsic/simd.rs:1371-1376 \u2014 both copies are in the same file, so extract the block 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":"compiler/rustc_codegen_gcc/src/intrinsic/simd.rs"},"region":{"startLine":1337}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bcf403f33fe55b8002b0bdc20ad8e19ac3b70e3e0699f7c5dd2817f0e7f4495"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): compiler/rustc_codegen_llvm/src/asm.rs:1210-1214 | compiler/rustc_codegen_llvm/src/asm.rs:1407-1411 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_codegen_llvm/src/asm.rs:1210\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":"compiler/rustc_codegen_llvm/src/asm.rs"},"region":{"startLine":1210}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b8af39642644b0497c5d74d0d04562f92d2c09f98952cd8c7570154cafe9771"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): compiler/rustc_codegen_llvm/src/consts.rs:756-760 | compiler/rustc_codegen_llvm/src/consts.rs:776-780 \u2014 both copies are in the same file, so extract the block 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":"compiler/rustc_codegen_llvm/src/consts.rs"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"abbd23b7cf66ee0c975b532324e0e2abd7e3d0d69025991d26f09e141802166a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): compiler/rustc_codegen_llvm/src/consts.rs:757-761 | compiler/rustc_codegen_llvm/src/consts.rs:895-899 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_codegen_llvm/src/consts.rs:757\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":"compiler/rustc_codegen_llvm/src/consts.rs"},"region":{"startLine":757}}}],"partialFingerprints":{"codehealthFindingId/v1":"b919602b848a2e4a798d46ddf40b1e00d061116245f633d0b74ad97444f8d107"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): compiler/rustc_codegen_llvm/src/context.rs:1143-1147 | compiler/rustc_codegen_llvm/src/context.rs:1154-1158 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_codegen_llvm/src/context.rs:1143\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":"compiler/rustc_codegen_llvm/src/context.rs"},"region":{"startLine":1143}}}],"partialFingerprints":{"codehealthFindingId/v1":"91d240534920bc41aa3f438c61e1899e3c6bc5e0ae46106c631a1588682308e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): compiler/rustc_codegen_llvm/src/intrinsic.rs:803-809 | compiler/rustc_codegen_llvm/src/intrinsic.rs:823-829 \u2014 both copies are in the same file, so extract the block 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":"compiler/rustc_codegen_llvm/src/intrinsic.rs"},"region":{"startLine":803}}}],"partialFingerprints":{"codehealthFindingId/v1":"e10b4f790fe3bddde924dd202aa4743c5a965b047c9b8dd601d4832a6e93e3e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): compiler/rustc_codegen_llvm/src/intrinsic.rs:1342-1346 | compiler/rustc_codegen_llvm/src/intrinsic.rs:1517-1521 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060compiler/rustc_codegen_llvm/src/intrinsic.rs:1403\u0060 calls \u0060tcx\u0060, \u0060pointer_size\u0060, \u0060pointer_align\u0060 and \u0060compiler/rustc_codegen_llvm/src/intrinsic.rs:1546\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":"compiler/rustc_codegen_llvm/src/intrinsic.rs"},"region":{"startLine":1342}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6398dac5ee1ccd2d363b5322c87b8ca64f0cd00aec4ea09073448fc57afe7a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): compiler/rustc_codegen_llvm/src/intrinsic.rs:2031-2036 | compiler/rustc_codegen_llvm/src/intrinsic.rs:2978-2983 \u2014 both copies are in the same file, so extract the block 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":"compiler/rustc_codegen_llvm/src/intrinsic.rs"},"region":{"startLine":2031}}}],"partialFingerprints":{"codehealthFindingId/v1":"c85bc78b5013fa1932fbc947ae83e38153b6834410faba5c981d8a784b58867b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): compiler/rustc_codegen_ssa/src/back/link.rs:1539-1543 | compiler/rustc_codegen_ssa/src/back/link.rs:1643-1647 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_codegen_ssa/src/back/link.rs:1539\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":"compiler/rustc_codegen_ssa/src/back/link.rs"},"region":{"startLine":1539}}}],"partialFingerprints":{"codehealthFindingId/v1":"e81a2c5e1e0b3ee4f5f0654d26bd8fd2a4a2718458dc44ec29cde7acf7649f6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): compiler/rustc_driver_impl/src/lib.rs:358-362 | src/librustdoc/lib.rs:1089-1093 \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 \u0060compiler/rustc_driver_impl/src/lib.rs:358\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_driver_impl/src/lib.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"39bfa5dc3b6630b23ced0e39af802fb5ae31e2b02291b339a9479ac662662ed2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): compiler/rustc_hir_analysis/src/check/compare_impl_item.rs:493-497 | compiler/rustc_hir_analysis/src/check/compare_impl_item/refine.rs:147-151 \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 \u0060compiler/rustc_hir_analysis/src/check/compare_impl_item.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":"compiler/rustc_hir_analysis/src/check/compare_impl_item.rs"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"986a62aed56b427c876c6058a2962be889d3765ce6b49877ccd95c875b111460"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): compiler/rustc_hir_analysis/src/check/entry.rs:43-47 | compiler/rustc_hir_analysis/src/check/entry.rs:57-61 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_hir_analysis/src/check/entry.rs:43\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/check/entry.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"621ea7249ad708a49e1ebd278b26a0fd910ae2b7c2ee72b7eac1990d3f6b5033"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): compiler/rustc_hir_pretty/src/lib.rs:991-995 | compiler/rustc_hir_pretty/src/lib.rs:1019-1024 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_hir_pretty/src/lib.rs:991\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":"compiler/rustc_hir_pretty/src/lib.rs"},"region":{"startLine":991}}}],"partialFingerprints":{"codehealthFindingId/v1":"8360cd578933a7d289f627f01173f06e9204624cbd01c7feae9adfa5b8df2cbc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): compiler/rustc_hir_typeck/src/op.rs:284-288 | compiler/rustc_hir_typeck/src/op.rs:296-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":"compiler/rustc_hir_typeck/src/op.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"c065b29458641e1ae85433aa6539d5de7b97ef0fc9907124daf69d120c2661ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): compiler/rustc_infer/src/infer/at.rs:466-475 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/at.rs:240-249 \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 \u0060compiler/rustc_infer/src/infer/at.rs:466\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":"compiler/rustc_infer/src/infer/at.rs"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fc0cd68ee4585d408180833e89e3c1c638df2c4eefb82dcf4b8d272ef1fd05d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): compiler/rustc_infer/src/infer/canonical/canonicalizer.rs:683-688 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/canonical/canonicalizer.rs:667-672 \u2014 before extracting anything, compare \u0060compiler/rustc_infer/src/infer/canonical/canonicalizer.rs\u0060 and \u0060src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/canonical/canonicalizer.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 74 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 \u0060compiler/rustc_infer/src/infer/canonical/canonicalizer.rs:683\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":"compiler/rustc_infer/src/infer/canonical/canonicalizer.rs"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"671926a41de5dc571a2a60290cb0c4d3db75124dd6056b59f5f618ce9c1c3613"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): compiler/rustc_infer/src/infer/region_constraints/mod.rs:900-907 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/region_constraints/mod.rs:654-661 \u2014 before extracting anything, compare \u0060compiler/rustc_infer/src/infer/region_constraints/mod.rs\u0060 and \u0060src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/region_constraints/mod.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 55 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":"compiler/rustc_infer/src/infer/region_constraints/mod.rs"},"region":{"startLine":900}}}],"partialFingerprints":{"codehealthFindingId/v1":"17900aa354b5bbd108aaa953165f8a5e48dc38c984229946e02f6ce9549d6f2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): compiler/rustc_infer/src/infer/snapshot/fudge.rs:189-193 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/snapshot/fudge.rs:183-187 \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 \u0060compiler/rustc_infer/src/infer/snapshot/fudge.rs:189\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_infer/src/infer/snapshot/fudge.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"c77a631daaff3006c39d384b9c62969d339ea1c68fcb364142c6e9b1fd659aab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): compiler/rustc_metadata/src/creader.rs:415-419 | compiler/rustc_metadata/src/creader.rs:422-426 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_metadata/src/creader.rs:415\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":"compiler/rustc_metadata/src/creader.rs"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b3fee7ddac848b66a79d2fb066d31b8c538ba42e057c32b7de7aba4031501c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): compiler/rustc_middle/src/query/keys.rs:411-415 | compiler/rustc_middle/src/ty/print/mod.rs:309-313 \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 \u0060compiler/rustc_middle/src/query/keys.rs:411\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":"compiler/rustc_middle/src/query/keys.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0cf99a879a37ea76966e8b141a3436ea31df7ef166000e4aa31807c8a4081e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): compiler/rustc_middle/src/ty/generic_args.rs:351-356 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/generic_arg.rs:395-400 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/ty/generic_args.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab10467eea77c29be9201b2aa98babaf6369069c6a67aa8b2721c3d9ef16b4d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): compiler/rustc_middle/src/ty/inhabitedness/inhabited_predicate.rs:187-195 | compiler/rustc_middle/src/ty/inhabitedness/inhabited_predicate.rs:213-221 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/ty/inhabitedness/inhabited_predicate.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d29bc7d0f156f7005cc2538f6476f45b0ce2d5ceb587e32bc663eed73d6ebc6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): compiler/rustc_mir_build/src/builder/expr/as_constant.rs:134-138 | compiler/rustc_mir_build/src/builder/expr/as_constant.rs:145-149 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"compiler/rustc_mir_build/src/builder/expr/as_constant.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bf3518683cae005850e33bcc7cedb0842e1606b315e2b3e407e619d20a660a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): compiler/rustc_mir_build/src/thir/print.rs:513-518 | compiler/rustc_mir_build/src/thir/print.rs:521-526 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_mir_build/src/thir/print.rs:513\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":"compiler/rustc_mir_build/src/thir/print.rs"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"3efaf1264bdbdc03619532a08d52497c1b2992666301afccda8b749360440070"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): compiler/rustc_mir_transform/src/check_enums.rs:284-288 | compiler/rustc_mir_transform/src/check_enums.rs:307-311 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_mir_transform/src/check_enums.rs:307\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"compiler/rustc_mir_transform/src/check_enums.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"98359f755989057a6979a75e54a85a5b5f722167bc283c4c63a4c2556cb86850"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): compiler/rustc_mir_transform/src/check_mut_restriction.rs:54-59 | compiler/rustc_mir_transform/src/check_mut_restriction.rs:143-148 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_mir_transform/src/check_mut_restriction.rs:54\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":"compiler/rustc_mir_transform/src/check_mut_restriction.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"77ba178ee87d6bd6207bc6ef44a80db7629e8b1d8301839f6801f195ff238b94"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): compiler/rustc_mir_transform/src/inline.rs:758-762 | compiler/rustc_mir_transform/src/inline/cycle.rs:30-34 \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":"compiler/rustc_mir_transform/src/inline.rs"},"region":{"startLine":758}}}],"partialFingerprints":{"codehealthFindingId/v1":"61301f2d1ea8ef812ab0826702fb1f7567b0da9079558388cf4dde5cba2f24f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): compiler/rustc_next_trait_solver/src/solve/assembly/structural_traits.rs:411-419 | compiler/rustc_next_trait_solver/src/solve/assembly/structural_traits.rs:594-602 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_next_trait_solver/src/solve/assembly/structural_traits.rs:411\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":"compiler/rustc_next_trait_solver/src/solve/assembly/structural_traits.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"83d128d1822a63163e4e9e9c775072dd8f0a0edcf4e84ac01f766a122aa53518"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): compiler/rustc_parse/src/parser/diagnostics.rs:1796-1800 | compiler/rustc_parse/src/parser/diagnostics.rs:1809-1813 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_parse/src/parser/diagnostics.rs:1796\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 \u0060super) fn recover_from_await_method_call(\u0026mut\u0060 in one and \u0060super) fn recover_from_use(\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":"compiler/rustc_parse/src/parser/diagnostics.rs"},"region":{"startLine":1796}}}],"partialFingerprints":{"codehealthFindingId/v1":"fff9487e002b8ea8184c02105d9c34a054832931d219a1826b26bf27d733eba0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): compiler/rustc_parse/src/parser/expr/diagnostics.rs:118-122 | compiler/rustc_parse/src/parser/expr/diagnostics.rs:137-141 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_parse/src/parser/expr/diagnostics.rs:118\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 \u0060super) fn recover_from_diamond_ne_op(\u0026mut\u0060 in one and \u0060super) fn recover_from_spaceship_cmp_op(\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":"compiler/rustc_parse/src/parser/expr/diagnostics.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"438ac9d32b58ff2e753029bad8a48410082fe81a206df475a34da7ae701d113d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): compiler/rustc_resolve/src/effective_visibilities.rs:132-136 | compiler/rustc_resolve/src/effective_visibilities.rs:315-319 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_resolve/src/effective_visibilities.rs:132\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":"compiler/rustc_resolve/src/effective_visibilities.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7cbbd1417f3f3a289c519d923eaedc69a074e7463d3d8f6fc958d24db3dff7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): compiler/rustc_sanitizers/src/cfi/typeid/itanium_cxx_abi/transform.rs:467-473 | compiler/rustc_sanitizers/src/cfi/typeid/itanium_cxx_abi/transform.rs:730-736 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_sanitizers/src/cfi/typeid/itanium_cxx_abi/transform.rs:467\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":"compiler/rustc_sanitizers/src/cfi/typeid/itanium_cxx_abi/transform.rs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab639974b44afb9157e7cc19c7927401fdb16c60261c756bbf60c5c11f84149e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): compiler/rustc_trait_selection/src/solve/fulfill.rs:279-283 | compiler/rustc_trait_selection/src/solve/fulfill.rs:306-316 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_trait_selection/src/solve/fulfill.rs:279\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/solve/fulfill.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fd46864d0ebda71db4bfe6c600c30723a4fee1bfa95fded722026d5a5101eae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): compiler/rustc_trait_selection/src/traits/auto_trait.rs:554-558 | src/librustdoc/clean/auto_trait.rs:243-247 \u2014 before extracting anything, compare \u0060compiler/rustc_trait_selection/src/traits/auto_trait.rs\u0060 and \u0060src/librustdoc/clean/auto_trait.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 64 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 \u0060compiler/rustc_trait_selection/src/traits/auto_trait.rs:554\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":"compiler/rustc_trait_selection/src/traits/auto_trait.rs"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"646bb0b4458dd6aa8539752f7bae4c0b261ff6aedb415f80323f9047c9301752"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): compiler/rustc_trait_selection/src/traits/auto_trait.rs:605-609 | src/librustdoc/clean/auto_trait.rs:314-318 \u2014 before extracting anything, compare \u0060compiler/rustc_trait_selection/src/traits/auto_trait.rs\u0060 and \u0060src/librustdoc/clean/auto_trait.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 64 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/librustdoc/clean/auto_trait.rs:320\u0060 calls \u0060Region\u0060, \u0060RegionVid\u0060 and \u0060compiler/rustc_trait_selection/src/traits/auto_trait.rs:611\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":"compiler/rustc_trait_selection/src/traits/auto_trait.rs"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"25f8918342303bcb4acf228ef53252b3978b5656cb6fcfae79e1773c5a847563"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): compiler/rustc_type_ir/src/region_constraint.rs:1366-1370 | compiler/rustc_type_ir/src/region_constraint.rs:1373-1377 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_type_ir/src/region_constraint.rs:1366\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":"compiler/rustc_type_ir/src/region_constraint.rs"},"region":{"startLine":1366}}}],"partialFingerprints":{"codehealthFindingId/v1":"e04a031d53f47a2dfc3934d08295ef0abdd224688df4b20a0f0340dc605469b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): library/compiler-builtins/compiler-builtins/src/mem/impls.rs:126-130 | library/compiler-builtins/compiler-builtins/src/mem/impls.rs:191-195 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/compiler-builtins/compiler-builtins/src/mem/impls.rs:126\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":"library/compiler-builtins/compiler-builtins/src/mem/impls.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c29500ea74cb760cc27843f67a3f1af1661f6f5d2c142a44240fe8d98cba5db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): library/compiler-builtins/libm/src/math/erf.rs:199-211 | library/compiler-builtins/libm/src/math/erff.rs:109-121 \u2014 before extracting anything, compare \u0060library/compiler-builtins/libm/src/math/erf.rs\u0060 and \u0060library/compiler-builtins/libm/src/math/erff.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 54 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":"library/compiler-builtins/libm/src/math/erf.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"db08771c3987edd4fa4decbef7bdc6d4432a334c568f804ae2d0c4d34b929aab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): library/compiler-builtins/libm/src/math/remquo.rs:5-9 | library/compiler-builtins/libm/src/math/remquof.rs:5-9 \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":"library/compiler-builtins/libm/src/math/remquo.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"8000ef52a15069c49e8b08f19e929edb46ae7793fe7c9fe5a9e62d055fa7a68a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): library/core/src/slice/iter.rs:1574-1578 | library/core/src/slice/iter.rs:2401-2405 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/core/src/slice/iter.rs:1574\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":"library/core/src/slice/iter.rs"},"region":{"startLine":1574}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7f5cae3aa272a02271097d51f44a8f549f92b234b40d36062836c5f89b2b713"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): library/std/src/sys/fs/windows.rs:725-729 | library/std/src/sys/fs/windows.rs:735-739 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/std/src/sys/fs/windows.rs:725\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":"library/std/src/sys/fs/windows.rs"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"03890dab7282923666caffc305e98b0d4403ca5788f81a488b7123068a473a81"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): library/stdarch/crates/core_arch/src/arm/neon.rs:65-70 | library/stdarch/crates/core_arch/src/arm/neon.rs:127-132 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/stdarch/crates/core_arch/src/arm/neon.rs:65\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/arm/neon.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ab4e1a56b70316b345e7d3bfd0925ca4250f78c504251bdfe15fe72cb862233"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): library/stdarch/crates/core_arch/src/x86/avx512dq.rs:1639-1645 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:26478-26484 \u2014 before extracting anything, compare \u0060library/stdarch/crates/core_arch/src/x86/avx512dq.rs\u0060 and \u0060library/stdarch/crates/core_arch/src/x86/avx512f.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 53 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 \u0060library/stdarch/crates/core_arch/src/x86/avx512dq.rs:1639\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":"library/stdarch/crates/core_arch/src/x86/avx512dq.rs"},"region":{"startLine":1639}}}],"partialFingerprints":{"codehealthFindingId/v1":"53101c7d1d15872d0b9d840321c33f1531bb48585ecee5deca16a0069fc36d73"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u20135 lines \u00D7 4): library/stdarch/crates/core_arch/src/x86/avx512dq.rs:1973-1977 | library/stdarch/crates/core_arch/src/x86/avx512dq.rs:2192-2196 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:28975-28976 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:29119-29120 \u2014 before extracting anything, compare \u0060library/stdarch/crates/core_arch/src/x86/avx512dq.rs\u0060 and \u0060library/stdarch/crates/core_arch/src/x86/avx512f.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 53 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 \u0060library/stdarch/crates/core_arch/src/x86/avx512dq.rs:1973\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512dq.rs"},"region":{"startLine":1973}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6530ffa7b3db8070c29455ad4c81caf260a2abd545e129270b2775539eacd69"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/librustdoc/html/markdown.rs:1898-1902 | src/librustdoc/html/markdown.rs:1934-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/librustdoc/html/markdown.rs:1898\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/librustdoc/html/markdown.rs"},"region":{"startLine":1898}}}],"partialFingerprints":{"codehealthFindingId/v1":"2041d5c765612aafd05e879668aa9e8fdeea6a9541fe58c20a1498633ebe04bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/librustdoc/html/render/mod.rs:1095-1099 | src/librustdoc/html/render/mod.rs:1132-1136 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/render/mod.rs"},"region":{"startLine":1095}}}],"partialFingerprints":{"codehealthFindingId/v1":"0346119ef6ca32138e702e6494acc5cbc3f247a12ad74a181cf9dde1ba3430ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/librustdoc/html/render/print_item.rs:2262-2266 | src/librustdoc/html/render/print_item.rs:2293-2297 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/librustdoc/html/render/print_item.rs:2262\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/librustdoc/html/render/print_item.rs"},"region":{"startLine":2262}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f883662878b0e3a8be03e6fa859264f4a96e16c9ce631b271b70d9a93cd5cd1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): src/librustdoc/passes/collect_intra_doc_links.rs:1906-1910 | src/librustdoc/passes/collect_intra_doc_links.rs:1913-1917 | src/librustdoc/passes/collect_intra_doc_links.rs:1918-1922 \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/librustdoc/passes/collect_intra_doc_links.rs:1906\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/librustdoc/passes/collect_intra_doc_links.rs:1912\u0060 calls \u0060Some\u0060, \u0060as_bytes\u0060, \u0060with_hi\u0060 and \u0060src/librustdoc/passes/collect_intra_doc_links.rs:1918\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/librustdoc/passes/collect_intra_doc_links.rs"},"region":{"startLine":1906}}}],"partialFingerprints":{"codehealthFindingId/v1":"885128ccf630321678296747fa10f0bc2007132ff763f6ae74904104532a9dfe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/tools/build-manifest/src/main.rs:128-132 | src/tools/build-manifest/src/main.rs:144-150 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/build-manifest/src/main.rs:144\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/tools/build-manifest/src/main.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"31799b642a8ac76797878000963e571147d1780620954bbc88c9c046d0c5c529"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/tools/clippy/clippy_lints/src/await_holding_invalid.rs:295-299 | src/tools/clippy/clippy_lints/src/entry.rs:763-767 \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/tools/clippy/clippy_lints/src/await_holding_invalid.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"51466f374c1ab4044000c3e8268fdb23bb133419c3da15c5dba20452fb7992d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/tools/clippy/clippy_lints/src/casts/cast_slice_from_raw_parts.rs:46-51 | src/tools/clippy/clippy_lints/src/casts/cast_slice_from_raw_parts.rs:84-89 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/clippy/clippy_lints/src/casts/cast_slice_from_raw_parts.rs:46\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/casts/cast_slice_from_raw_parts.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad996fb9cfe4c4ec04dd58ab39e34b2a59dda2c4ac3a7ea85cc7b6f7e8d1144e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/tools/clippy/clippy_lints/src/extra_unused_type_parameters.rs:265-269 | src/tools/clippy/clippy_lints/src/extra_unused_type_parameters.rs:281-285 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/clippy/clippy_lints/src/extra_unused_type_parameters.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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060item\u0060 to \u0060\u0026\u0027tcx Item\u003C\u0027tcx\u003E\u0060 in one and \u0060\u0026\u0027tcx ImplItem\u003C\u0027tcx\u003E\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/tools/clippy/clippy_lints/src/extra_unused_type_parameters.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b1faff222316ee2dfe6331e8fbf9ba104c7e08b82b8b3455577b7359a5e359e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20135 lines \u00D7 3): src/tools/clippy/clippy_lints/src/manual_retain.rs:89-93 | src/tools/clippy/clippy_lints/src/manual_retain.rs:136-140 | src/tools/clippy/clippy_lints/src/manual_retain.rs:193-195 \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/tools/clippy/clippy_lints/src/manual_retain.rs:89\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/tools/clippy/clippy_lints/src/manual_retain.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"507b369a35bf0ba9e5b85ef775818f8456f65f601822e1b07d30aac015a63b38"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/tools/clippy/clippy_lints/src/methods/unnecessary_sort_by.rs:178-182 | src/tools/clippy/clippy_lints/src/methods/unnecessary_sort_by.rs:206-210 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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/tools/clippy/clippy_lints/src/methods/unnecessary_sort_by.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"0794b93dbf883b56bae62c60e93a94a43e767b27cf3a3d3a37ba9b0aa699f5b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/tools/clippy/clippy_lints/src/min_ident_chars.rs:147-151 | src/tools/clippy/clippy_lints/src/missing_doc.rs:158-162 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/tools/clippy/clippy_lints/src/min_ident_chars.rs:146\u0060 calls \u0060Mod\u0060 and \u0060src/tools/clippy/clippy_lints/src/missing_doc.rs:157\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/tools/clippy/clippy_lints/src/min_ident_chars.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"381ae848dbb3caa9a016095c95194e125178ee9c9fb3ece22705554f0a6581b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/tools/clippy/clippy_lints/src/ranges.rs:231-235 | src/tools/clippy/clippy_lints/src/ranges.rs:267-271 \u2014 both copies are in the same file, so extract the block 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/tools/clippy/clippy_lints/src/ranges.rs:228\u0060 calls \u0060partial_cmp\u0060, \u0060typeck_results\u0060, \u0060expr_ty\u0060 and \u0060src/tools/clippy/clippy_lints/src/ranges.rs:264\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/tools/clippy/clippy_lints/src/ranges.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"89e58e97fe8dc874440db69c7b1b7a1dc77d8384aea28b8159a67f28072c3d0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/tools/clippy/clippy_lints_internal/src/repeated_is_diagnostic_item.rs:439-443 | src/tools/clippy/clippy_lints_internal/src/repeated_is_diagnostic_item.rs:492-496 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/clippy/clippy_lints_internal/src/repeated_is_diagnostic_item.rs:439\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/tools/clippy/clippy_lints_internal/src/repeated_is_diagnostic_item.rs"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f3ff499a5e24da7b12ce56f0de681ca077944e65cf33c13c923811729c87c13"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/tools/clippy/clippy_utils/src/consts.rs:314-319 | src/tools/clippy/clippy_utils/src/consts.rs:367-372 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/clippy/clippy_utils/src/consts.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/tools/clippy/clippy_utils/src/consts.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b0db54753885c6ca495118c21fa2746643f6c409edb9fe8c164dc9d5bd896f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/tools/clippy/clippy_utils/src/consts.rs:336-340 | src/tools/clippy/clippy_utils/src/consts.rs:390-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_utils/src/consts.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"ced8e792a1eef45d3817fd069a4520172e777c3c5201e184ad9a2cdbb09b3ad7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/tools/clippy/clippy_utils/src/consts.rs:344-349 | src/tools/clippy/clippy_utils/src/consts.rs:400-405 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/clippy/clippy_utils/src/consts.rs:344\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/tools/clippy/clippy_utils/src/consts.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"8102ce721edb78fa359d8f22d483aa1538ef2c05f73f4bf192b03caaa4e81a9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/tools/clippy/clippy_utils/src/consts.rs:1112-1116 | src/tools/clippy/clippy_utils/src/consts.rs:1126-1130 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/clippy/clippy_utils/src/consts.rs:1112\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/tools/clippy/clippy_utils/src/consts.rs"},"region":{"startLine":1112}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b7109e2ac5c2f4658287c2ab3953b83b9aa27b1d07e454a2baedaa16d4433ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/tools/clippy/clippy_utils/src/mir/possible_borrower.rs:44-48 | src/tools/clippy/clippy_utils/src/mir/possible_origin.rs:26-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tools/clippy/clippy_utils/src/mir/possible_borrower.rs:44\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060cx\u0060 to \u0060\u0026\u0027a LateContext\u003C\u0027tcx\u003E\u0060 in one and \u0060\u0026LateContext\u003C\u0027tcx\u003E\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/tools/clippy/clippy_utils/src/mir/possible_borrower.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9b813f0f639af807c98c91cf49a1dadcf1e1b1df5932cc84df92058206318ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/tools/miri/src/intrinsics/aarch64.rs:66-70 | src/tools/miri/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/tools/miri/src/intrinsics/aarch64.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd379924adee0009be4b1103899bf116e44f7370c5d667f67a2f50b50a445ad9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/tools/miri/src/intrinsics/aarch64.rs:441-447 | src/tools/miri/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/tools/miri/src/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/tools/miri/src/intrinsics/aarch64.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"38560bda60219f3751ac2a4d5a1668c442201bb9ceb198c657c1660ad0413881"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 2): src/tools/miri/src/intrinsics/simd.rs:29-35 | src/tools/miri/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/tools/miri/src/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/tools/miri/src/intrinsics/simd.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"efc9c6eba09b63c871f1306d917535ed9e0eb0dcfd545c5a1842c4400d0251a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/tools/miri/src/intrinsics/x86/avx.rs:90-96 | src/tools/miri/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/tools/miri/src/intrinsics/x86/avx.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"4518c82ab64f10cff0ce66682f023d38698d519d4aba683ed7a55a547ad58132"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/tools/miri/src/intrinsics/x86/avx.rs:102-108 | src/tools/miri/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/tools/miri/src/intrinsics/x86/avx.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fac992204a03ce90f53eec4e51a3cde634ef66a159d645d56eb39775fc54395"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/tools/miri/src/intrinsics/x86/avx.rs:200-206 | src/tools/miri/src/intrinsics/x86/sse41.rs:153-159 \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/tools/miri/src/intrinsics/x86/avx.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"67e08d4a399c1f319c5bff7120407b2a5ffa029b4e27d43919f8a9c867b9d624"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/tools/miri/src/intrinsics/x86/avx512.rs:235-242 | src/tools/miri/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/tools/miri/src/intrinsics/x86/avx512.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"04a12e299c0e7cf41d08bc7b6f10ee0b540afc1fc5e38188067183291fa95f80"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/tools/miri/src/intrinsics/x86/mod.rs:746-750 | src/tools/miri/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/tools/miri/src/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/tools/miri/src/intrinsics/x86/mod.rs"},"region":{"startLine":746}}}],"partialFingerprints":{"codehealthFindingId/v1":"82158f5dc3c76bb7092a46c75fd21dc853fce8df6a43b6dff15765f48699531d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/tools/miri/src/intrinsics/x86/mod.rs:1173-1181 | src/tools/miri/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/tools/miri/src/intrinsics/x86/mod.rs"},"region":{"startLine":1173}}}],"partialFingerprints":{"codehealthFindingId/v1":"b53c12a7e4d1fbd07b22935b1fae5e2b87957368db3e991b6f5373a9abd764db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/tools/miri/src/shims/unix/fd.rs:385-389 | src/tools/miri/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/tools/miri/src/shims/unix/fd.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"826bded8047184afe3b72de6266d71448ad7e87cd9ae99d60b8e60169987af0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): src/tools/miri/src/shims/unix/foreign_items.rs:357-366 | src/tools/miri/src/shims/unix/linux/foreign_items.rs:55-65 \u2014 before extracting anything, compare \u0060src/tools/miri/src/shims/unix/foreign_items.rs\u0060 and \u0060src/tools/miri/src/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/tools/miri/src/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/tools/miri/src/shims/unix/foreign_items.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aa36f4681f6d8c996c89dfc9fc3cccc2b152b70850f6c16280b020df9c96651"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/tools/miri/src/shims/unix/foreign_items.rs:416-422 | src/tools/miri/src/shims/unix/macos/foreign_items.rs:76-82 \u2014 before extracting anything, compare \u0060src/tools/miri/src/shims/unix/foreign_items.rs\u0060 and \u0060src/tools/miri/src/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/tools/miri/src/shims/unix/foreign_items.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"19467967edb8ccd8e9cfd0bdd48ac6692196791c61803e7fb7ef501306772d84"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/tools/miri/src/shims/unix/foreign_items.rs:673-678 | src/tools/miri/src/shims/unix/solarish/foreign_items.rs:129-134 \u2014 before extracting anything, compare \u0060src/tools/miri/src/shims/unix/foreign_items.rs\u0060 and \u0060src/tools/miri/src/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/tools/miri/src/shims/unix/foreign_items.rs"},"region":{"startLine":673}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eec9c4e12fd6ae9a2d5dd841f152b3b45652ead96a6fb5bebe87b533957ae1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/tools/miri/src/shims/unix/foreign_items.rs:749-755 | src/tools/miri/src/shims/unix/solarish/foreign_items.rs:143-149 \u2014 before extracting anything, compare \u0060src/tools/miri/src/shims/unix/foreign_items.rs\u0060 and \u0060src/tools/miri/src/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/tools/miri/src/shims/unix/foreign_items.rs"},"region":{"startLine":749}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d514477c6fedf04f0466470b63ba0f7edb5be21c968b500d258beb8b0becdd6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/tools/miri/src/shims/unix/foreign_items.rs:1125-1129 | src/tools/miri/src/shims/unix/macos/foreign_items.rs:431-435 \u2014 before extracting anything, compare \u0060src/tools/miri/src/shims/unix/foreign_items.rs\u0060 and \u0060src/tools/miri/src/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/tools/miri/src/shims/unix/foreign_items.rs:1125\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/tools/miri/src/shims/unix/foreign_items.rs"},"region":{"startLine":1125}}}],"partialFingerprints":{"codehealthFindingId/v1":"7258a41f6a5205dedc39a459f98c5dd830633699f07e627e9d54ce187de63b20"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/tools/miri/src/shims/unix/thread.rs:53-57 | src/tools/miri/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/tools/miri/src/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/tools/miri/src/shims/unix/thread.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"443e38f38452476e4dc699e5408ba94ed0cf915e1633069f680b63b6ddc9d29c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-def/src/attrs.rs:896-901 | src/tools/rust-analyzer/crates/hir-def/src/attrs.rs:1188-1193 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/hir-def/src/attrs.rs:896\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/tools/rust-analyzer/crates/hir-def/src/attrs.rs"},"region":{"startLine":896}}}],"partialFingerprints":{"codehealthFindingId/v1":"40ca88a35e9cb983f5ec2c0d25340930b79718920ec5688062a2219ad97f8eee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): src/tools/rust-analyzer/crates/hir-def/src/expr_store/body.rs:111-115 | src/tools/rust-analyzer/crates/hir-def/src/expr_store/body.rs:117-121 | src/tools/rust-analyzer/crates/hir-def/src/expr_store/body.rs:122-126 \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/tools/rust-analyzer/crates/hir-def/src/expr_store/body.rs:122\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/tools/rust-analyzer/crates/hir-def/src/expr_store/body.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"446689d019c1cbbedf529cbdab2d8bc295588e7210dd735da2b9377d36ae2b5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-def/src/expr_store/lower.rs:1185-1189 | src/tools/rust-analyzer/crates/hir-def/src/expr_store/lower.rs:1196-1200 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/hir-def/src/expr_store/lower.rs:1185\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/tools/rust-analyzer/crates/hir-def/src/expr_store/lower.rs"},"region":{"startLine":1185}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e268f6b3528595dfcbc43d4da100b785887ceff931f36ac228b2ca5a3c7adc2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-ty/src/consteval.rs:154-160 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/ty.rs:697-703 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/consteval.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"08e9fdbf3a9b92edea9c07ae1159a39365b03d116f27923cf5fc46761b41f1a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-ty/src/consteval.rs:165-171 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/ty.rs:705-711 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/consteval.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6637f7e1ac40790afda2e21f73beeaabda1be90827f54dccf536288a145159e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-ty/src/consteval.rs:176-180 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/ty.rs:713-717 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/tools/rust-analyzer/crates/hir-ty/src/consteval.rs:181\u0060 calls \u0060default_float\u0060 and \u0060src/tools/rust-analyzer/crates/hir-ty/src/next_solver/ty.rs:718\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/tools/rust-analyzer/crates/hir-ty/src/consteval.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"c68705b8bc16a6d4725da4fd92ed44942b496a66da1bebf36bf248454ea7d3f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-ty/src/infer/cast.rs:460-464 | src/tools/rust-analyzer/crates/hir-ty/src/infer/cast.rs:490-494 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/hir-ty/src/infer/cast.rs:460\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/tools/rust-analyzer/crates/hir-ty/src/infer/cast.rs"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"af4fa415d40a056880824b9dd4f7df8f6f1d5c2811498393c48f8dc2bb006cf9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-ty/src/method_resolution.rs:591-596 | src/tools/rust-analyzer/crates/hir-ty/src/method_resolution.rs:707-712 \u2014 both copies are in the same file, so extract the block 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/tools/rust-analyzer/crates/hir-ty/src/method_resolution.rs:715\u0060 calls \u0060for_crate_and_deps\u0060, \u0060transitive_deps\u0060, \u0060iter\u0060 and \u0060src/tools/rust-analyzer/crates/hir-ty/src/method_resolution.rs:597\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/tools/rust-analyzer/crates/hir-ty/src/method_resolution.rs"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1da1a1edbc12eabf6f98b2088e08e87230a4c0365f213c4af35c4f8b04337d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-ty/src/mir/eval.rs:1828-1832 | src/tools/rust-analyzer/crates/hir-ty/src/mir/eval.rs:1840-1844 \u2014 both copies are in the same file, so extract the block 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/tools/rust-analyzer/crates/hir-ty/src/mir/eval.rs"},"region":{"startLine":1828}}}],"partialFingerprints":{"codehealthFindingId/v1":"133124eeadd05f2ec2f9948edc49379cf169ba28e9f072e144b9ddfbe9b1cad3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-ty/src/mir/eval.rs:1844-1850 | src/tools/rust-analyzer/crates/hir-ty/src/mir/eval.rs:1853-1859 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/hir-ty/src/mir/eval.rs:1844\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/tools/rust-analyzer/crates/hir-ty/src/mir/eval.rs"},"region":{"startLine":1844}}}],"partialFingerprints":{"codehealthFindingId/v1":"15d92c09e5f9cabef4904ba4fe321fc0c75e1733a42d5562f62fed7f455e93e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-ty/src/mir/eval/shim.rs:236-240 | src/tools/rust-analyzer/crates/hir-ty/src/mir/eval/shim.rs:1381-1385 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/hir-ty/src/mir/eval/shim.rs:236\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/tools/rust-analyzer/crates/hir-ty/src/mir/eval/shim.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fe3a097f5cb124c23b1f4b0866fda818162b41780a871d1d87becea5b63d8c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/tools/rust-analyzer/crates/hir/src/lib.rs:3909-3913 | src/tools/rust-analyzer/crates/hir/src/lib.rs:3927-3931 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/hir/src/lib.rs:3909\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/tools/rust-analyzer/crates/hir/src/lib.rs"},"region":{"startLine":3909}}}],"partialFingerprints":{"codehealthFindingId/v1":"4330c4bacc27df8b621fbe0a9f6e240ca787c2a3a34d86e76fad02513821d479"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/tools/rust-analyzer/crates/hir/src/semantics.rs:1166-1171 | src/tools/rust-analyzer/crates/hir/src/semantics.rs:1192-1197 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/hir/src/semantics.rs:1166\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/tools/rust-analyzer/crates/hir/src/semantics.rs"},"region":{"startLine":1166}}}],"partialFingerprints":{"codehealthFindingId/v1":"531c72c016e53ef690669f130b51bf3f3c438ea93ad6fd7b148c3c9e7cdc9e24"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/tools/rust-analyzer/crates/hir/src/source_analyzer.rs:865-869 | src/tools/rust-analyzer/crates/hir/src/source_analyzer.rs:899-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/tools/rust-analyzer/crates/hir/src/source_analyzer.rs:865\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir/src/source_analyzer.rs"},"region":{"startLine":865}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e8420fcd72f89aa17e498409650679c59c4f683330be424155aa8d21356c4aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/tools/rust-analyzer/crates/hir/src/source_analyzer.rs:1513-1518 | src/tools/rust-analyzer/crates/hir/src/source_analyzer.rs:1529-1534 \u2014 both copies are in the same file, so extract the block 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/tools/rust-analyzer/crates/hir/src/source_analyzer.rs"},"region":{"startLine":1513}}}],"partialFingerprints":{"codehealthFindingId/v1":"6306c278dd1c999b8d1606005d48206a9861b0b28deaa374f8a5ad7b33bd71e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/tools/rust-analyzer/crates/ide-assists/src/handlers/add_missing_impl_members.rs:182-189 | src/tools/rust-analyzer/crates/ide-assists/src/handlers/replace_derive_with_manual_impl.rs:261-268 \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/tools/rust-analyzer/crates/ide-assists/src/handlers/add_missing_impl_members.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f59b62a43912c84816a485a837bc6aa80488c8a3d9d69f9b1bb5fd6ce9bc5cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/tools/rust-analyzer/crates/ide-assists/src/handlers/apply_demorgan.rs:274-280 | src/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_iter_for_each_to_for.rs:225-231 \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/tools/rust-analyzer/crates/ide-assists/src/handlers/apply_demorgan.rs:274\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/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_iter_for_each_to_for.rs:223\u0060 calls \u0060MethodCallExpr\u0060 and \u0060src/tools/rust-analyzer/crates/ide-assists/src/handlers/apply_demorgan.rs:273\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/tools/rust-analyzer/crates/ide-assists/src/handlers/apply_demorgan.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbdca7d50cb4b224516e0ce16dc3e238a01ad2870bfe7dca232a3fb0077321da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_bool_to_enum.rs:494-501 | src/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_tuple_return_type_to_struct.rs:242-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_bool_to_enum.rs"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"b49151aa2b8377d21b35b244ab1d18ae98a8b9c1f00f28a0d3ceed58d5c4f1e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_named_struct_to_tuple_struct.rs:76-80 | src/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_tuple_struct_to_named_struct.rs:78-82 \u2014 before extracting anything, compare \u0060src/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_named_struct_to_tuple_struct.rs\u0060 and \u0060src/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_tuple_struct_to_named_struct.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 35 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_named_struct_to_tuple_struct.rs:76\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_tuple_struct_to_named_struct.rs:83\u0060 calls \u0060as_ref\u0060, \u0060either\u0060, \u0060syntax\u0060 and \u0060src/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_named_struct_to_tuple_struct.rs:82\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/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_named_struct_to_tuple_struct.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4e6218f2b8b15a6b92302b3f90cb4f8827c6636e2f6d1a1de4f2f728febbcc4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20135 lines \u00D7 3): src/tools/rust-analyzer/crates/ide-assists/src/handlers/extract_function.rs:1510-1514 | src/tools/rust-analyzer/crates/ide-assists/src/handlers/extract_function.rs:1529-1533 | src/tools/rust-analyzer/crates/ide-assists/src/handlers/extract_function.rs:1535-1537 \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/tools/rust-analyzer/crates/ide-assists/src/handlers/extract_function.rs:1510\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/tools/rust-analyzer/crates/ide-assists/src/handlers/extract_function.rs:1510\u0060 calls \u0060tuple_struct_pat\u0060, \u0060once\u0060, \u0060into\u0060 and \u0060src/tools/rust-analyzer/crates/ide-assists/src/handlers/extract_function.rs:1535\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/tools/rust-analyzer/crates/ide-assists/src/handlers/extract_function.rs"},"region":{"startLine":1510}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd7599acbe3ccafc4c436f4e06af89615937108dcb152c8f25835a685b96e024"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/tools/rust-analyzer/crates/ide-assists/src/utils/gen_trait_fn_body.rs:179-183 | src/tools/rust-analyzer/crates/ide-assists/src/utils/gen_trait_fn_body.rs:213-217 \u2014 both copies are in the same file, so extract the block 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/tools/rust-analyzer/crates/ide-assists/src/utils/gen_trait_fn_body.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2248d2ef1f554cf60d49d0510531c0a866d40dcf2ac282756de08c9de0f4aad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/tools/rust-analyzer/crates/ide-completion/src/completions/record.rs:32-36 | src/tools/rust-analyzer/crates/ide-completion/src/completions/record.rs:60-64 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/ide-completion/src/completions/record.rs:32\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/tools/rust-analyzer/crates/ide-completion/src/completions/record.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eaec7fd05cba3e175408bb920c35586dd404ad6bb2e6bce23d109c326668a58"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/tools/rust-analyzer/crates/ide-db/src/imports/merge_imports.rs:505-509 | src/tools/rust-analyzer/crates/ide-db/src/imports/merge_imports.rs:530-534 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/ide-db/src/imports/merge_imports.rs:505\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/tools/rust-analyzer/crates/ide-db/src/imports/merge_imports.rs"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac1b10582bfeb8f64dfa7adc10269039d345f95defb4f26ec8517e000773d8ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/tools/rust-analyzer/crates/ide-db/src/syntax_helpers/format_string.rs:254-258 | src/tools/rust-analyzer/crates/ide-db/src/syntax_helpers/format_string.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/tools/rust-analyzer/crates/ide-db/src/syntax_helpers/format_string.rs:254\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/tools/rust-analyzer/crates/ide-db/src/syntax_helpers/format_string.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"5beb14839ab0f588c6b336d9ef6570f1777546334badc93220524e225c3d187a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/tools/rust-analyzer/crates/ide-db/src/syntax_helpers/node_ext.rs:98-102 | src/tools/rust-analyzer/crates/ide-db/src/syntax_helpers/node_ext.rs:139-143 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/ide-db/src/syntax_helpers/node_ext.rs:98\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-db/src/syntax_helpers/node_ext.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fa53b1acab1d9da785b2a29439e591ec7a1d38fecdd169288495f5522d2e52e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/tools/rust-analyzer/crates/ide-ssr/src/fragments.rs:29-33 | src/tools/rust-analyzer/crates/ide-ssr/src/fragments.rs:52-56 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-ssr/src/fragments.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aee6ae36ddc5b981a3d5b261d19ca9bf011fc3fa389c8bf396d46545d4358e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/tools/rust-analyzer/crates/ide/src/goto_type_definition.rs:44-48 | src/tools/rust-analyzer/crates/ide/src/hover.rs:700-704 \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/tools/rust-analyzer/crates/ide/src/goto_type_definition.rs:44\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/tools/rust-analyzer/crates/ide/src/goto_type_definition.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fa3b1a8131234178e1311f271a2c5cbe697b30c8fa78343d883d39ab219c30c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/tools/rust-analyzer/crates/ide/src/interpret.rs:41-47 | src/tools/rust-analyzer/crates/ide/src/interpret.rs:69-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/tools/rust-analyzer/crates/ide/src/interpret.rs:41\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/tools/rust-analyzer/crates/ide/src/interpret.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7ec2a9c218d4d87f14380feaa3c68210e2655f652e68321d03c90ae09faf70c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/tools/rust-analyzer/crates/ide/src/navigation_target.rs:713-717 | src/tools/rust-analyzer/crates/ide/src/navigation_target.rs:785-789 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tools/rust-analyzer/crates/ide/src/navigation_target.rs:713\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/tools/rust-analyzer/crates/ide/src/navigation_target.rs"},"region":{"startLine":713}}}],"partialFingerprints":{"codehealthFindingId/v1":"55ed9997022107a5f494d76d04221ddd73e4be9fbd60cd59d034d5695ed9ea8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/tools/rust-analyzer/crates/parser/src/grammar/expressions/atom.rs:326-330 | src/tools/rust-analyzer/crates/parser/src/grammar/patterns.rs:225-231 \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/tools/rust-analyzer/crates/parser/src/grammar/expressions/atom.rs:326\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/tools/rust-analyzer/crates/parser/src/grammar/expressions/atom.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f9ec4fdf5dea0c1d98a4a2f43ddac01b56a43b1154c3d1c4fffb124c1d20d48"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/tools/rust-analyzer/crates/parser/src/grammar/items.rs:369-373 | src/tools/rust-analyzer/crates/parser/src/grammar/items.rs:378-382 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/parser/src/grammar/items.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3c8651c1f7a8b000cc3055b00a280551209fba20934cc15ebe09f6e24bc9a39"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20135 lines \u00D7 4): src/tools/rust-analyzer/crates/rust-analyzer/src/cli/analysis_stats.rs:1500-1504 | src/tools/rust-analyzer/crates/rust-analyzer/src/cli/analysis_stats.rs:1516-1520 | src/tools/rust-analyzer/crates/rust-analyzer/src/cli/analysis_stats.rs:1538-1540 | src/tools/rust-analyzer/crates/rust-analyzer/src/cli/analysis_stats.rs:1559-1561 \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/tools/rust-analyzer/crates/rust-analyzer/src/cli/analysis_stats.rs:1500\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/tools/rust-analyzer/crates/rust-analyzer/src/cli/analysis_stats.rs:1504\u0060 calls \u0060to_node\u0060, \u0060syntax\u0060, \u0060clone\u0060 and \u0060src/tools/rust-analyzer/crates/rust-analyzer/src/cli/analysis_stats.rs:1540\u0060 does not \u2014 after which the two agree again for 5 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/tools/rust-analyzer/crates/rust-analyzer/src/cli/analysis_stats.rs"},"region":{"startLine":1500}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d4b57746ef0d09c6d7cf6c00b76587783a543137182cdd08b06b54a35cb5dea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/tools/rust-analyzer/crates/rust-analyzer/src/handlers/request.rs:2224-2228 | src/tools/rust-analyzer/crates/rust-analyzer/src/handlers/request.rs:2264-2269 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/rust-analyzer/src/handlers/request.rs:2224\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/tools/rust-analyzer/crates/rust-analyzer/src/handlers/request.rs"},"region":{"startLine":2224}}}],"partialFingerprints":{"codehealthFindingId/v1":"926a49de2c337802c36e403873bfb08844ae8d8e3f7f8a18b436ea1c5a570d94"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/tools/rust-analyzer/crates/syntax-bridge/src/to_parser_input.rs:99-104 | src/tools/rust-analyzer/crates/syntax-bridge/src/to_parser_input.rs:111-116 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/syntax-bridge/src/to_parser_input.rs:99\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/tools/rust-analyzer/crates/syntax-bridge/src/to_parser_input.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb6644212edfe5ef03e314c6a6085b553757458de002cc9d360c35ea66074b29"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/tools/rust-analyzer/crates/syntax/src/syntax_editor/edits.rs:251-258 | src/tools/rust-analyzer/crates/syntax/src/syntax_editor/edits.rs:267-274 \u2014 both copies are in the same file, so extract the block 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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060fields\u0060 to \u0060impl IntoIterator\u003CItem = ast::RecordExprField\u003E\u0060 in one and \u0060impl IntoIterator\u003CItem = ast::RecordPatField\u003E\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/tools/rust-analyzer/crates/syntax/src/syntax_editor/edits.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e69418c1050c82964a6a14a8caa2d6866fd9a639765bd8c8696ebfe5fee1c56"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/tools/tidy/src/rustdoc_json.rs:39-43 | src/tools/tidy/src/rustdoc_json.rs:45-49 \u2014 both copies are in the same file, so extract the block 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/tools/tidy/src/rustdoc_json.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0523fdfc9c5f0178c1d21cd177486823f949d959179f9e8800007a432a8f214"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33 lines \u00D7 2): compiler/rustc_ast/src/ast.rs:2728-2760 | src/tools/rust-analyzer/crates/hir-def/src/hir.rs:519-551 \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":"compiler/rustc_ast/src/ast.rs"},"region":{"startLine":2728}}}],"partialFingerprints":{"codehealthFindingId/v1":"25fc69d6d1a009c6697a02f43c98654ad8a42a057ab1abf3f6d6de9ad7c627ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): library/alloc/src/rcs/arc.rs:1218-1240 | library/alloc/src/rcs/rc.rs:1064-1086 \u2014 before extracting anything, compare \u0060library/alloc/src/rcs/arc.rs\u0060 and \u0060library/alloc/src/rcs/rc.rs\u0060 as WHOLE FILES: this scan already matched 28 separate duplicated blocks between them, totalling at least 329 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":"library/alloc/src/rcs/arc.rs"},"region":{"startLine":1218}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4b9d7f160b58352bd41c5801e82ec2cd6946da1a3fb0df7b848fb473e7fe05b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): library/alloc/src/rcs/arc.rs:1271-1294 | library/alloc/src/rcs/rc.rs:1117-1140 \u2014 before extracting anything, compare \u0060library/alloc/src/rcs/arc.rs\u0060 and \u0060library/alloc/src/rcs/rc.rs\u0060 as WHOLE FILES: this scan already matched 28 separate duplicated blocks between them, totalling at least 329 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":"library/alloc/src/rcs/arc.rs"},"region":{"startLine":1271}}}],"partialFingerprints":{"codehealthFindingId/v1":"4911b3e3ce83c5b861e0260ec06d947fcb0feacacaedc4709c4e848b81eb827d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): library/alloc/src/rcs/arc.rs:4949-4969 | library/alloc/src/rcs/rc.rs:4528-4548 \u2014 before extracting anything, compare \u0060library/alloc/src/rcs/arc.rs\u0060 and \u0060library/alloc/src/rcs/rc.rs\u0060 as WHOLE FILES: this scan already matched 28 separate duplicated blocks between them, totalling at least 329 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":"library/alloc/src/rcs/arc.rs"},"region":{"startLine":4949}}}],"partialFingerprints":{"codehealthFindingId/v1":"3158fcc7909fb7d71924c3d8f2fe45895c09bf1061f2b02a3a2ae17bd864af0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (38 lines \u00D7 2): library/core/src/num/saturating.rs:46-83 | library/core/src/num/wrapping.rs:47-84 \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 \u0060library/core/src/num/saturating.rs:46\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":"library/core/src/num/saturating.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"4399c704e0ac8af6d90ad97cb1dbc8b3c1fd8fc10368bac05192f525095a76fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (48 lines \u00D7 6): library/std/src/os/aix/fs.rs:316-363 | library/std/src/os/hurd/fs.rs:316-363 | library/std/src/os/nto/fs.rs:44-91 | library/std/src/os/nuttx/fs.rs:44-91 | library/std/src/os/rtems/fs.rs:327-389 | library/std/src/os/vxworks/fs.rs:48-128 \u2014 \u0060library/std/src/os/nto/fs.rs\u0060 and \u0060library/std/src/os/nuttx/fs.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 1 separate duplicated blocks between them, totalling at least 81 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060library/std/src/os/vxworks/fs.rs:43\u0060 calls \u0060st_attrib\u0060 and \u0060library/std/src/os/aix/fs.rs:311\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/os/aix/fs.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"43a2dda193ce278905d057393bf6d49f7b5a5a4f47b35ab4ce2acdd4bb74a51b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (51 lines \u00D7 8): library/std/src/os/android/fs.rs:65-115 | library/std/src/os/dragonfly/fs.rs:71-130 | library/std/src/os/emscripten/fs.rs:65-115 | library/std/src/os/haiku/fs.rs:69-125 | library/std/src/os/illumos/fs.rs:64-114 | library/std/src/os/openbsd/fs.rs:73-135 | library/std/src/os/redox/fs.rs:347-397 | library/std/src/os/solaris/fs.rs:65-115 \u2014 \u0060library/std/src/os/android/fs.rs\u0060 and \u0060library/std/src/os/dragonfly/fs.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 1 separate duplicated blocks between them, totalling at least 63 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060library/std/src/os/dragonfly/fs.rs:65\u0060 calls \u0060st_lspare\u0060 and \u0060library/std/src/os/openbsd/fs.rs:67\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/os/android/fs.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bdeb094184f28bc680c8cdb1b11fd19a4e7ed1bde9450e78182b70a45659213"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (54 lines \u00D7 2): library/std/src/os/cygwin/fs.rs:48-101 | library/std/src/os/freebsd/fs.rs:75-142 \u2014 \u0060library/std/src/os/cygwin/fs.rs\u0060 and \u0060library/std/src/os/freebsd/fs.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 2 separate duplicated blocks between them, totalling at least 136 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":"library/std/src/os/cygwin/fs.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7f177ac25cc91a8ebc91efcb1c19a26cd83e6c56d18bc737a5e29091a345a75"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (48 lines \u00D7 3): library/std/src/os/cygwin/fs.rs:48-101 | library/std/src/os/freebsd/fs.rs:75-142 | library/std/src/os/fuchsia/fs.rs:47-94 \u2014 \u0060library/std/src/os/cygwin/fs.rs\u0060 and \u0060library/std/src/os/freebsd/fs.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 2 separate duplicated blocks between them, totalling at least 136 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":"library/std/src/os/cygwin/fs.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"22195547271b3d2eb9b7fa581fec1aaa10d72a9a91a6b2278f77c7df361a9d28"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): library/std/src/sys/path/sgx.rs:9-25 | library/std/src/sys/path/unsupported_backslash.rs:10-26 \u2014 before extracting anything, compare \u0060library/std/src/sys/path/sgx.rs\u0060 and \u0060library/std/src/sys/path/unsupported_backslash.rs\u0060 as WHOLE FILES: 86% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. 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":"library/std/src/sys/path/sgx.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"581d1ec0f1790259e58fbb02879f379d33dfd2cf2e35876a359b384f5b8b98ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): compiler/rustc_abi/src/wrapping_range.rs:215-222 | compiler/rustc_public/src/abi.rs:629-636 \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":"compiler/rustc_abi/src/wrapping_range.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"876c38b83d367b07703a1a15ef65ea957d6a48d058ae51c28399ebb71ba0491e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): compiler/rustc_ast/src/ast.rs:413-419 | compiler/rustc_hir/src/hir.rs:800-806 \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":"compiler/rustc_ast/src/ast.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"91d048be6589d446881a597f0dc03e614c078c14474014f4762f648aca357928"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): compiler/rustc_ast_pretty/src/pprust/state.rs:1485-1491 | compiler/rustc_hir_pretty/src/lib.rs:848-854 \u2014 before extracting anything, compare \u0060compiler/rustc_ast_pretty/src/pprust/state.rs\u0060 and \u0060compiler/rustc_hir_pretty/src/lib.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 54 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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060generic_params\u0060 to \u0060\u0026[ast::GenericParam]\u0060 in one and \u0060\u0026[hir::GenericParam\u003C\u0027_\u003E]\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":"compiler/rustc_ast_pretty/src/pprust/state.rs"},"region":{"startLine":1485}}}],"partialFingerprints":{"codehealthFindingId/v1":"88681c42fcc1966c3b7919986720ecae1d3884bd9e523a2677f7397f5f2e61c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): compiler/rustc_ast_pretty/src/pprust/state/expr.rs:205-212 | compiler/rustc_hir_pretty/src/lib.rs:1379-1386 \u2014 before extracting anything, compare \u0060compiler/rustc_ast_pretty/src/pprust/state/expr.rs\u0060 and \u0060compiler/rustc_hir_pretty/src/lib.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 47 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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060exprs\u0060 to \u0060\u0026[Box\u003Cast::Expr\u003E]\u0060 in one and \u0060\u0026[hir::Expr\u003C\u0027_\u003E]\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":"compiler/rustc_ast_pretty/src/pprust/state/expr.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3e53359775ef8c15c499c9b8b364741bf970d1a6c92a9195f8fb0bfa612a908"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): compiler/rustc_borrowck/src/polonius/liveness_constraints.rs:98-102 | compiler/rustc_infer/src/infer/outlives/test_type_match.rs:153-157 | compiler/rustc_lint/src/impl_trait_overcaptures.rs:548-552 \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 \u0060compiler/rustc_borrowck/src/polonius/liveness_constraints.rs:98\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":"compiler/rustc_borrowck/src/polonius/liveness_constraints.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"22a882d5e24bcb0b968901873522ae7a81c652d1b6c4448784b6ab935db97b3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): compiler/rustc_codegen_gcc/src/builder.rs:1899-1905 | compiler/rustc_codegen_llvm/src/builder.rs:666-672 \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":"compiler/rustc_codegen_gcc/src/builder.rs"},"region":{"startLine":1899}}}],"partialFingerprints":{"codehealthFindingId/v1":"2311d913d6d13963666f7b0cf77f507390f24c9d70514c26b4774b4e9f0b6549"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): compiler/rustc_codegen_gcc/src/type_.rs:89-96 | compiler/rustc_codegen_llvm/src/type_.rs:118-125 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_gcc/src/type_.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c1911f3ce17cce93a2f314a39a764eacbfd72d01ed47401d95df6595692d008"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): compiler/rustc_const_eval/src/check_consts/check.rs:511-526 | compiler/rustc_const_eval/src/check_consts/post_drop_elaboration.rs:59-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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060block\u0060 to \u0060\u0026BasicBlockData\u003C\u0027tcx\u003E\u0060 in one and \u0060\u0026mir::BasicBlockData\u003C\u0027tcx\u003E\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":"compiler/rustc_const_eval/src/check_consts/check.rs"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"65ae0c3d5d173c7c1f9ca26381ebeb98d2a1f2212744487deddeae5139ed4e5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): compiler/rustc_hir/src/pat_util.rs:21-25 | src/tools/rust-analyzer/crates/hir-ide/src/diagnostics/match_check/pat_util.rs:19-23 | src/tools/rust-analyzer/crates/hir-ty/src/utils.rs:181-185 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir/src/pat_util.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f5658c3c66f513be9d8124f51a50cc24c8b2200c75644d533c7304d3e067c53"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): compiler/rustc_hir_analysis/src/collect/item_bounds.rs:257-262 | compiler/rustc_trait_selection/src/traits/dyn_compatibility.rs:1010-1015 | src/tools/rust-analyzer/crates/hir-ty/src/lower.rs:2502-2507 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/collect/item_bounds.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"44737bdf745ce43886f42f87a1bf31554fe4e8782b63908797a0c66e2d6f83d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): compiler/rustc_hir_typeck/src/diagnostics.rs:403-410 | compiler/rustc_parse/src/diagnostics.rs:3676-3683 \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":"compiler/rustc_hir_typeck/src/diagnostics.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1751007b6b2bd71018d3fdf311689aa4905f5c9fc5f87b74f2e38613ca9d660"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): compiler/rustc_hir_typeck/src/fn_ctxt/adjust_fulfillment_errors.rs:283-288 | compiler/rustc_hir_typeck/src/op.rs:1307-1312 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060ty\u0060 to \u0060Ty\u003C\u0027tcx\u003E\u0060 in one and \u0060Ty\u003C\u0027_\u003E\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":"compiler/rustc_hir_typeck/src/fn_ctxt/adjust_fulfillment_errors.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e145eaa6b05f6a906f4e06939c50ee32edb0cc4ad83bbece5d0e293c2bae4b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): compiler/rustc_infer/src/infer/at.rs:439-444 | compiler/rustc_infer/src/infer/at.rs:454-459 | compiler/rustc_infer/src/infer/mod.rs:1797-1802 | compiler/rustc_infer/src/infer/mod.rs:1816-1821 \u2014 there are 4 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_infer/src/infer/mod.rs:1816\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060a\u0060 to \u0060Self\u0060 in one and \u0060Ty\u003C\u0027tcx\u003E\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":"compiler/rustc_infer/src/infer/at.rs"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9f1eaf3d8fb24289fc54b99267ce0cbbcc35f83a97eafd84ce347a0ce210e9b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): compiler/rustc_infer/src/infer/canonical/instantiate.rs:45-49 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/canonical/instantiate.rs:71-75 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060tcx\u0060 to \u0060TyCtxt\u003C\u0027tcx\u003E\u0060 in one and \u0060DbInterner\u003C\u0027db\u003E\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":"compiler/rustc_infer/src/infer/canonical/instantiate.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"86aca7425b2663e2ca3e1a7145dd4fad0a282c4a5481130c1fc730f78137ac5f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): compiler/rustc_infer/src/infer/mod.rs:653-657 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/mod.rs:347-351 \u2014 before extracting anything, compare \u0060compiler/rustc_infer/src/infer/mod.rs\u0060 and \u0060src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/mod.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 44 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":"compiler/rustc_infer/src/infer/mod.rs"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6c06979dfa905b815b814a814a46e77cf2e848795f0910212d8e6e2b5d9d699"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): compiler/rustc_infer/src/infer/mod.rs:773-778 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/mod.rs:1088-1093 \u2014 before extracting anything, compare \u0060compiler/rustc_infer/src/infer/mod.rs\u0060 and \u0060src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/mod.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 44 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":"compiler/rustc_infer/src/infer/mod.rs"},"region":{"startLine":773}}}],"partialFingerprints":{"codehealthFindingId/v1":"726c3f65568dcb1ba86fd9eaeb0e5d5e439a70f41697957f8d3ebd03c47f9b6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): compiler/rustc_infer/src/infer/mod.rs:1651-1656 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/mod.rs:1165-1170 \u2014 before extracting anything, compare \u0060compiler/rustc_infer/src/infer/mod.rs\u0060 and \u0060src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/mod.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 44 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":"compiler/rustc_infer/src/infer/mod.rs"},"region":{"startLine":1651}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1ff35d4c49a714c6c3361f0cec60083fc6531e2a53e4049a4fac8d29e664467"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): compiler/rustc_infer/src/infer/mod.rs:1763-1769 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/mod.rs:1257-1263 \u2014 before extracting anything, compare \u0060compiler/rustc_infer/src/infer/mod.rs\u0060 and \u0060src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/mod.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 44 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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060inspector\u0060 to \u0060ObligationInspector\u003C\u0027tcx\u003E\u0060 in one and \u0060ObligationInspector\u003C\u0027db\u003E\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":"compiler/rustc_infer/src/infer/mod.rs"},"region":{"startLine":1763}}}],"partialFingerprints":{"codehealthFindingId/v1":"d39528a9f6d6062df1e036763565706ae47b052e8dc496007f857f7ff1adb60d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): compiler/rustc_infer/src/infer/opaque_types/table.rs:78-84 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/opaque_types/table.rs:79-85 \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 \u0060compiler/rustc_infer/src/infer/opaque_types/table.rs:78\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":"compiler/rustc_infer/src/infer/opaque_types/table.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"88727dea8d2b1daf2160617c9fee0318850dbb2aa111de1d18484c83d9047193"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): compiler/rustc_infer/src/infer/region_constraints/mod.rs:859-865 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/region_constraints/mod.rs:613-619 \u2014 before extracting anything, compare \u0060compiler/rustc_infer/src/infer/region_constraints/mod.rs\u0060 and \u0060src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/region_constraints/mod.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 55 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":"compiler/rustc_infer/src/infer/region_constraints/mod.rs"},"region":{"startLine":859}}}],"partialFingerprints":{"codehealthFindingId/v1":"54292994c261c08c07ad941d5766519d3eb389edf0a6481a60823c3568fc93f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): compiler/rustc_infer/src/infer/region_constraints/mod.rs:909-917 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/region_constraints/mod.rs:663-671 \u2014 before extracting anything, compare \u0060compiler/rustc_infer/src/infer/region_constraints/mod.rs\u0060 and \u0060src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/region_constraints/mod.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 55 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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060vb\u0060 to \u0060VerifyBound\u003C\u0027tcx\u003E\u0060 in one and \u0060VerifyBound\u003C\u0027db\u003E\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":"compiler/rustc_infer/src/infer/region_constraints/mod.rs"},"region":{"startLine":909}}}],"partialFingerprints":{"codehealthFindingId/v1":"31887fbd1f802cd730352f71d24dbdd25b9b3f07c5d6cbe1c323e0b87ccd5842"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): compiler/rustc_infer/src/infer/relate/generalize.rs:481-490 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/relate/generalize.rs:422-431 \u2014 before extracting anything, compare \u0060compiler/rustc_infer/src/infer/relate/generalize.rs\u0060 and \u0060src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/relate/generalize.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 73 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 \u0060compiler/rustc_infer/src/infer/relate/generalize.rs:481\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":"compiler/rustc_infer/src/infer/relate/generalize.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"07738d60f64b9996c82a6cedfd288e129bd8908f7847a9865def19ed3cb59a23"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): compiler/rustc_infer/src/infer/relate/lattice.rs:300-304 | compiler/rustc_infer/src/infer/relate/type_relating.rs:366-370 \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 \u0060compiler/rustc_infer/src/infer/relate/lattice.rs:300\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":"compiler/rustc_infer/src/infer/relate/lattice.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5bbcd963b019fe78ec9ea19864919846ee6cc5b57a8803c653dcfd73416ae3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): compiler/rustc_infer/src/infer/relate/lattice.rs:306-315 | compiler/rustc_infer/src/infer/relate/type_relating.rs:372-381 \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":"compiler/rustc_infer/src/infer/relate/lattice.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e66eb879e63368e45923f32e1f31cbe6461546fcc2efba9d9066549ec060a41"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): compiler/rustc_infer/src/infer/resolve.rs:52-59 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/resolve.rs:54-61 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060ct\u0060 to \u0060Const\u003C\u0027tcx\u003E\u0060 in one and \u0060Const\u003C\u0027db\u003E\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":"compiler/rustc_infer/src/infer/resolve.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"02a50849fad372ff66bdc17e2e107c4c297c09198006722eb6dfe92032f3fb4c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): compiler/rustc_infer/src/infer/snapshot/mod.rs:48-58 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/snapshot/mod.rs:50-60 \u2014 before extracting anything, compare \u0060compiler/rustc_infer/src/infer/snapshot/mod.rs\u0060 and \u0060src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/snapshot/mod.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 48 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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":"compiler/rustc_infer/src/infer/snapshot/mod.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"927a996052b0e2d17ff53cc9cb920d81d4080e905568be2c32a27020fd9e5aad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): compiler/rustc_infer/src/infer/snapshot/mod.rs:61-69 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/snapshot/mod.rs:63-71 \u2014 before extracting anything, compare \u0060compiler/rustc_infer/src/infer/snapshot/mod.rs\u0060 and \u0060src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/snapshot/mod.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 48 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060snapshot\u0060 to \u0060CombinedSnapshot\u003C\u0027tcx\u003E\u0060 in one and \u0060CombinedSnapshot\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":"compiler/rustc_infer/src/infer/snapshot/mod.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c7957daf59c7ac8f4797edd32f63210a679fdda552761bd243190259c4f0527"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): compiler/rustc_infer/src/infer/snapshot/mod.rs:72-77 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/snapshot/mod.rs:74-79 \u2014 before extracting anything, compare \u0060compiler/rustc_infer/src/infer/snapshot/mod.rs\u0060 and \u0060src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/snapshot/mod.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 48 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060snapshot\u0060 to \u0060CombinedSnapshot\u003C\u0027tcx\u003E\u0060 in one and \u0060CombinedSnapshot\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":"compiler/rustc_infer/src/infer/snapshot/mod.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"242d2fe9a345ccbdfb5afdb5c008c235d551718102ce1d75a7672935f7805948"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): compiler/rustc_infer/src/infer/snapshot/undo_log.rs:158-170 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/snapshot/undo_log.rs:153-165 \u2014 before extracting anything, compare \u0060compiler/rustc_infer/src/infer/snapshot/undo_log.rs\u0060 and \u0060src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/snapshot/undo_log.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 50 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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060snapshot\u0060 to \u0060Snapshot\u003C\u0027tcx\u003E\u0060 in one and \u0060Snapshot\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":"compiler/rustc_infer/src/infer/snapshot/undo_log.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dd130b3d31425fd1f189a2e9d3246e7091491899332a1c3b0134c6acb49fbb7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): compiler/rustc_infer/src/infer/snapshot/undo_log.rs:182-187 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/snapshot/undo_log.rs:177-182 \u2014 before extracting anything, compare \u0060compiler/rustc_infer/src/infer/snapshot/undo_log.rs\u0060 and \u0060src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/snapshot/undo_log.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 50 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 \u0060compiler/rustc_infer/src/infer/snapshot/undo_log.rs:182\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060s\u0060 to \u0060\u0026Snapshot\u003C\u0027tcx\u003E\u0060 in one and \u0060\u0026Snapshot\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":"compiler/rustc_infer/src/infer/snapshot/undo_log.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fba7d4537f4ad16ee8a516599749f625f711dfd166428bf1725c428a4e7e815"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): compiler/rustc_infer/src/infer/type_variable.rs:50-55 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/type_variable.rs:53-58 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_infer/src/infer/type_variable.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3961bda75504f56223273f968411ae9624459565f00c8615c4fe219ae54d3f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): compiler/rustc_infer/src/infer/type_variable.rs:177-182 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/type_variable.rs:145-150 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060a\u0060 to \u0060ty::TyVid\u0060 in one and \u0060TyVid\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":"compiler/rustc_infer/src/infer/type_variable.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7cefe2618f550fd2d020670192202e51f6d61a8568ba844bd972497bebbcd14"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): compiler/rustc_infer/src/infer/type_variable.rs:188-192 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/type_variable.rs:156-160 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060a\u0060 to \u0060ty::TyVid\u0060 in one and \u0060TyVid\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":"compiler/rustc_infer/src/infer/type_variable.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1cf23a72e6d7f0306de7021c02dcd637c2d94e580ccf82e3a619e7f83c49d68"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): compiler/rustc_lexer/src/lib.rs:347-372 | src/tools/rust-analyzer/crates/parser/src/frontmatter.rs:270-295 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_lexer/src/lib.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b2a47057216ded59fa52331347c993877d38cea053078beab2e987aafdca383"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): compiler/rustc_llvm/src/lib.rs:37-42 | compiler/rustc_sanitizers/src/ignorelist/ffi.rs:66-74 \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":"compiler/rustc_llvm/src/lib.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae26e32c1967061b086ca938e197c5667a4396a2702a7337b00912b6624c232f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): compiler/rustc_macros/src/extension.rs:124-129 | src/tools/rust-analyzer/crates/macros/src/extension.rs:125-130 \u2014 before extracting anything, compare \u0060compiler/rustc_macros/src/extension.rs\u0060 and \u0060src/tools/rust-analyzer/crates/macros/src/extension.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 77 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":"compiler/rustc_macros/src/extension.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c19d57f8ce6cb6a882299f62a9c14aa771d09ba1d63b60c6758917360fc8b9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): compiler/rustc_middle/src/hir/place.rs:111-119 | src/tools/rust-analyzer/crates/hir-ty/src/infer/closure/analysis/expr_use_visitor.rs:105-113 \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":"compiler/rustc_middle/src/hir/place.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"441c8d051012883fc17b44399152116fdfa2bd2868aeaf742b2527eaf2e3c6ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): compiler/rustc_middle/src/traits/mod.rs:710-715 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/select.rs:200-205 \u2014 before extracting anything, compare \u0060compiler/rustc_middle/src/traits/mod.rs\u0060 and \u0060src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/select.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 30 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/traits/mod.rs"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aa89e41729f14ef212cc51531145306087bfdefc326415886232cc68de930e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): compiler/rustc_middle/src/traits/mod.rs:717-722 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/select.rs:207-212 \u2014 before extracting anything, compare \u0060compiler/rustc_middle/src/traits/mod.rs\u0060 and \u0060src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/select.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 30 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/traits/mod.rs"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba8b3e6704bafb9042ff09a9a321b73cdf4842c4e090fc7f88a08c559faeef1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): compiler/rustc_middle/src/traits/mod.rs:724-729 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/select.rs:214-219 \u2014 before extracting anything, compare \u0060compiler/rustc_middle/src/traits/mod.rs\u0060 and \u0060src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/select.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 30 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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 \u0060crate) fn borrow_nested_obligations_mut(\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":"compiler/rustc_middle/src/traits/mod.rs"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"0df5dab970254fac67772bf4f5fb72dbe3b9c760c9f8bf5c795eb60495a21843"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): compiler/rustc_middle/src/ty/consts/int.rs:216-229 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/consts/valtree.rs:394-407 \u2014 before extracting anything, compare \u0060compiler/rustc_middle/src/ty/consts/int.rs\u0060 and \u0060src/tools/rust-analyzer/crates/hir-ty/src/next_solver/consts/valtree.rs\u0060 as WHOLE FILES: this scan already matched 6 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":"compiler/rustc_middle/src/ty/consts/int.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ab3f525afce9d18282a7102b1b2bf8cbb5be55b9e8345c7242d4f45146e8423"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): compiler/rustc_middle/src/ty/consts/int.rs:249-253 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/consts/valtree.rs:427-431 \u2014 before extracting anything, compare \u0060compiler/rustc_middle/src/ty/consts/int.rs\u0060 and \u0060src/tools/rust-analyzer/crates/hir-ty/src/next_solver/consts/valtree.rs\u0060 as WHOLE FILES: this scan already matched 6 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":"compiler/rustc_middle/src/ty/consts/int.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d4e1f898bd9259b6d3f9fb36ffa5b4685715f8211b94bed719f9a056202c866"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): compiler/rustc_middle/src/ty/consts/int.rs:263-268 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/consts/valtree.rs:441-446 \u2014 before extracting anything, compare \u0060compiler/rustc_middle/src/ty/consts/int.rs\u0060 and \u0060src/tools/rust-analyzer/crates/hir-ty/src/next_solver/consts/valtree.rs\u0060 as WHOLE FILES: this scan already matched 6 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":"compiler/rustc_middle/src/ty/consts/int.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"fedf62e7fb5d06d631d02a7dc6f007875fe82c55cc3767c2ef3fb94a8f4e3eec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): compiler/rustc_middle/src/ty/consts/int.rs:384-390 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/consts/valtree.rs:541-547 \u2014 before extracting anything, compare \u0060compiler/rustc_middle/src/ty/consts/int.rs\u0060 and \u0060src/tools/rust-analyzer/crates/hir-ty/src/next_solver/consts/valtree.rs\u0060 as WHOLE FILES: this scan already matched 6 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":"compiler/rustc_middle/src/ty/consts/int.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"dad6711cb8b43199f7bf6330071c80b733edb7fcd09e8f39afcc0df19235fc28"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): compiler/rustc_middle/src/ty/consts/int.rs:639-653 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/consts/valtree.rs:715-729 \u2014 before extracting anything, compare \u0060compiler/rustc_middle/src/ty/consts/int.rs\u0060 and \u0060src/tools/rust-analyzer/crates/hir-ty/src/next_solver/consts/valtree.rs\u0060 as WHOLE FILES: this scan already matched 6 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":"compiler/rustc_middle/src/ty/consts/int.rs"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"717617f5299c34c395346e1831ce0d248a1eb130b14012eec415f6cba64b8b96"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): compiler/rustc_middle/src/ty/consts/int.rs:657-667 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/consts/valtree.rs:733-743 \u2014 before extracting anything, compare \u0060compiler/rustc_middle/src/ty/consts/int.rs\u0060 and \u0060src/tools/rust-analyzer/crates/hir-ty/src/next_solver/consts/valtree.rs\u0060 as WHOLE FILES: this scan already matched 6 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":"compiler/rustc_middle/src/ty/consts/int.rs"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"af21de3cd648f7e26ee4d5f275df1c168fd3e01fc5c43f321452cae8cf7da11b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): compiler/rustc_middle/src/ty/consts/valtree.rs:130-135 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/consts/valtree.rs:65-70 \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":"compiler/rustc_middle/src/ty/consts/valtree.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac064d1ad38efec96f3a10a1e67beb81a7a2afdf447d6bd38bde9b6d87679b8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): compiler/rustc_middle/src/ty/generic_args.rs:360-366 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/generic_arg.rs:364-370 \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":"compiler/rustc_middle/src/ty/generic_args.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c891ad8987ffcde1b4977cedef4d7c904dc972bcfd841f6deba3fae19915769"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): compiler/rustc_middle/src/ty/mod.rs:723-728 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/generic_arg.rs:307-312 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060tcx\u0060 to \u0060TyCtxt\u003C\u0027tcx\u003E\u0060 in one and \u0060DbInterner\u003C\u0027db\u003E\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":"compiler/rustc_middle/src/ty/mod.rs"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e7590bbece03a6c456345dab0e5cb61d2b293e4bcf82fa8b093c7254b52052e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): compiler/rustc_middle/src/ty/predicate.rs:114-119 | compiler/rustc_middle/src/ty/predicate.rs:123-128 | compiler/rustc_middle/src/ty/print/pretty.rs:3020-3025 | compiler/rustc_middle/src/ty/print/pretty.rs:3040-3045 \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":"compiler/rustc_middle/src/ty/predicate.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8f6628508f7b124c630ba44613d5baf463966680261d4c1c6fec6988ae59b14"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): compiler/rustc_middle/src/ty/predicate.rs:300-307 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/predicate.rs:98-105 \u2014 before extracting anything, compare \u0060compiler/rustc_middle/src/ty/predicate.rs\u0060 and \u0060src/tools/rust-analyzer/crates/hir-ty/src/next_solver/predicate.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 44 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":"compiler/rustc_middle/src/ty/predicate.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"936837bfcc180f223f9cd8ad021e4642638d427695106649a2a0380fb64dcb7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): compiler/rustc_middle/src/ty/predicate.rs:316-325 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/predicate.rs:121-130 \u2014 before extracting anything, compare \u0060compiler/rustc_middle/src/ty/predicate.rs\u0060 and \u0060src/tools/rust-analyzer/crates/hir-ty/src/next_solver/predicate.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 44 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 \u0060compiler/rustc_middle/src/ty/predicate.rs:316\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":"compiler/rustc_middle/src/ty/predicate.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"437e83449bae36bb122ca8700c6f2c028db97ae17861f2850b1becbd32c78749"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): compiler/rustc_middle/src/ty/predicate.rs:328-333 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/predicate.rs:107-112 \u2014 before extracting anything, compare \u0060compiler/rustc_middle/src/ty/predicate.rs\u0060 and \u0060src/tools/rust-analyzer/crates/hir-ty/src/next_solver/predicate.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 44 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":"compiler/rustc_middle/src/ty/predicate.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ad4baf5944bd803244090baf6396c0d0ec45c6f0a84df92b2d2d1035493115a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): compiler/rustc_middle/src/ty/predicate.rs:615-621 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/predicate.rs:723-729 \u2014 before extracting anything, compare \u0060compiler/rustc_middle/src/ty/predicate.rs\u0060 and \u0060src/tools/rust-analyzer/crates/hir-ty/src/next_solver/predicate.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 44 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":"compiler/rustc_middle/src/ty/predicate.rs"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"eed8be29aa2216ae99a540ccd12f7469cf7f9f72432afb27ed261e1e783bfec4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): compiler/rustc_middle/src/ty/predicate.rs:623-629 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/predicate.rs:731-737 \u2014 before extracting anything, compare \u0060compiler/rustc_middle/src/ty/predicate.rs\u0060 and \u0060src/tools/rust-analyzer/crates/hir-ty/src/next_solver/predicate.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 44 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":"compiler/rustc_middle/src/ty/predicate.rs"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"986cd9e606b59c44a2244b4b1607e40cb94b21a1f2997eb1bcffbef9ac2344b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): compiler/rustc_middle/src/ty/predicate.rs:632-637 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/predicate.rs:714-719 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/predicate.rs:740-745 \u2014 before extracting anything, compare \u0060compiler/rustc_middle/src/ty/predicate.rs\u0060 and \u0060src/tools/rust-analyzer/crates/hir-ty/src/next_solver/predicate.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 44 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":"compiler/rustc_middle/src/ty/predicate.rs"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbd6792f1e4a2f4cfa98fcdd5469dae8ca2b5ee7a5bef22e558db1458fc43de5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 7): compiler/rustc_middle/src/ty/print/pretty.rs:2757-2762 | compiler/rustc_next_trait_solver/src/placeholder.rs:110-115 | compiler/rustc_type_ir/src/fold.rs:430-435 | compiler/rustc_type_ir/src/fold.rs:562-567 | compiler/rustc_type_ir/src/fold.rs:730-735 | compiler/rustc_type_ir/src/region_constraint.rs:1250-1255 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/fold.rs:74-79 \u2014 there are 7 copies across 5 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_middle/src/ty/print/pretty.rs:2757\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":"compiler/rustc_middle/src/ty/print/pretty.rs"},"region":{"startLine":2757}}}],"partialFingerprints":{"codehealthFindingId/v1":"931bb9b9a0c51a0b993195119e157ef13e88cac2a863352d1e32cf845f514882"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): compiler/rustc_middle/src/ty/sty.rs:201-207 | src/tools/rust-analyzer/crates/hir-ty/src/infer/closure/analysis.rs:82-88 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/ty/sty.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"c171229cd667a89b507ba10b95e320fc1a4c9104df61619e0fbb23fbefe391f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): compiler/rustc_middle/src/ty/typeck_results.rs:528-536 | src/tools/rust-analyzer/crates/hir-ty/src/infer.rs:1611-1619 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_middle/src/ty/typeck_results.rs:528\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060inner\u0060 to \u0060\u0026hir::Pat\u003C\u0027_\u003E\u0060 in one and \u0060PatId\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":"compiler/rustc_middle/src/ty/typeck_results.rs"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a8e2fe59225f89c8945a68e503b873e0735380ca0b469face65f7689ff1ce36"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): compiler/rustc_mir_transform/src/check_enums.rs:243-254 | compiler/rustc_mir_transform/src/check_pointers.rs:234-245 \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 \u0060compiler/rustc_mir_transform/src/check_enums.rs:243\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/check_enums.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbf986726fb7bfb4fc243b78407d3ae5de907fcebf60d86538bb7bc886184f56"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): compiler/rustc_monomorphize/src/collector.rs:702-709 | compiler/rustc_monomorphize/src/mono_checks/move_check.rs:62-69 \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":"compiler/rustc_monomorphize/src/collector.rs"},"region":{"startLine":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"65a51aa7ca77a62d99d82540bfabafa0a4823709989a5ae384f468ffd8fdcdd0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): compiler/rustc_next_trait_solver/src/normalize.rs:91-96 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/normalize.rs:171-176 \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 \u0060compiler/rustc_next_trait_solver/src/normalize.rs:91\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":"compiler/rustc_next_trait_solver/src/normalize.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"89118b3e0ec69b0815acedf357f100fcd0def4cfb39c1b91cc0bf24cb6d26fb6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): compiler/rustc_next_trait_solver/src/placeholder.rs:240-248 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/util.rs:622-630 \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/tools/rust-analyzer/crates/hir-ty/src/next_solver/util.rs:622\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":"compiler/rustc_next_trait_solver/src/placeholder.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"e23568514a06a6ac25f094a3e074435dd8dfd67f9b277b32968ab33d519ad67f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): compiler/rustc_serialize/src/opaque.rs:463-468 | compiler/rustc_serialize/src/opaque/mem_encoder.rs:122-127 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060e\u0060 to \u0060\u0026mut FileEncoder\u003C\u0027_\u003E\u0060 in one and \u0060\u0026mut MemEncoder\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":"compiler/rustc_serialize/src/opaque.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"4797d476f73d246d14ba616bcaaefa963f9a4cb37c7f4c602a9477c2b36d1d20"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 5): compiler/rustc_target/src/callconv/bpf.rs:58-69 | compiler/rustc_target/src/callconv/csky.rs:62-73 | compiler/rustc_target/src/callconv/m68k.rs:35-46 | compiler/rustc_target/src/callconv/msp430.rs:40-51 | compiler/rustc_target/src/callconv/nvptx64.rs:93-104 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 5 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_target/src/callconv/bpf.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"29b95b451773e83adf2eed388e75bdce0d659ab868ff80f472141add75863ef4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): compiler/rustc_target/src/callconv/loongarch.rs:451-468 | compiler/rustc_target/src/callconv/riscv.rs:456-472 \u2014 before extracting anything, compare \u0060compiler/rustc_target/src/callconv/loongarch.rs\u0060 and \u0060compiler/rustc_target/src/callconv/riscv.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 328 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":"compiler/rustc_target/src/callconv/loongarch.rs"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"953861a8361de0d5c8dbbe5d4480c58492e542a49ba8e7484d0b5245eb21fe0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): compiler/rustc_trait_selection/src/solve/inspect/analyse.rs:81-87 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/inspect.rs:149-155 \u2014 before extracting anything, compare \u0060compiler/rustc_trait_selection/src/solve/inspect/analyse.rs\u0060 and \u0060src/tools/rust-analyzer/crates/hir-ty/src/next_solver/inspect.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 79 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/tools/rust-analyzer/crates/hir-ty/src/next_solver/inspect.rs:149\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/solve/inspect/analyse.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"7baa3c93b9c7d1fb254292f9c92d03f8090572d02b1898cfebba3b79589d5463"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): compiler/rustc_trait_selection/src/solve/inspect/analyse.rs:314-319 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/inspect.rs:407-412 \u2014 before extracting anything, compare \u0060compiler/rustc_trait_selection/src/solve/inspect/analyse.rs\u0060 and \u0060src/tools/rust-analyzer/crates/hir-ty/src/next_solver/inspect.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 79 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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060self\u0060 to \u0060\u0026\u0027a\u0060 in one and \u0060crate) fn candidates(\u0026\u0027a\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":"compiler/rustc_trait_selection/src/solve/inspect/analyse.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbfa523c36a01ae2697e245cd3b4cee9b29606ef44e8aefe32fa7ba3963984b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): compiler/rustc_trait_selection/src/solve/inspect/analyse.rs:324-330 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/inspect.rs:417-423 \u2014 before extracting anything, compare \u0060compiler/rustc_trait_selection/src/solve/inspect/analyse.rs\u0060 and \u0060src/tools/rust-analyzer/crates/hir-ty/src/next_solver/inspect.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 79 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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060self\u0060 to \u0060\u0026\u0027a\u0060 in one and \u0060crate) fn unique_applicable_candidate(\u0026\u0027a\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":"compiler/rustc_trait_selection/src/solve/inspect/analyse.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfee5aa7e9f731bfee82fc252cab48b8716900741975e52421f00748de67e34a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): compiler/rustc_trait_selection/src/solve/inspect/analyse.rs:365-372 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/inspect.rs:459-466 \u2014 before extracting anything, compare \u0060compiler/rustc_trait_selection/src/solve/inspect/analyse.rs\u0060 and \u0060src/tools/rust-analyzer/crates/hir-ty/src/next_solver/inspect.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 79 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":"compiler/rustc_trait_selection/src/solve/inspect/analyse.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"430dfe699f4c10fa594533f5889d27d577eeef89ffc66219cee28eef4c854a34"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): compiler/rustc_trait_selection/src/solve/normalize.rs:125-130 | compiler/rustc_trait_selection/src/traits/normalize.rs:386-391 \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 \u0060compiler/rustc_trait_selection/src/solve/normalize.rs:125\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":"compiler/rustc_trait_selection/src/solve/normalize.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0e50557a157c9934655264d795ebf04c3efb3f0f3670e53f665e4db93a7dfd6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): compiler/rustc_trait_selection/src/solve/normalize.rs:210-218 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/normalize.rs:43-51 \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":"compiler/rustc_trait_selection/src/solve/normalize.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"660f166c0593ca008d0beecccc7eed42842d6963ae0402241c1ccfd0c11fbd5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): compiler/rustc_trait_selection/src/traits/engine.rs:296-301 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/obligation_ctxt.rs:126-131 \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 \u0060compiler/rustc_trait_selection/src/traits/engine.rs:296\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/traits/engine.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8245a093d123faf49abd206d851506c66eec0a4d37477ba9cf97de213bf83e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): library/alloc/src/boxed/convert.rs:113-118 | library/alloc/src/boxed/convert.rs:190-195 | library/alloc/src/ffi/c_str.rs:801-806 \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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060cow\u0060 to \u0060Cow\u003C\u0027_, [T]\u003E\u0060 in one and \u0060Cow\u003C\u0027_, str\u003E\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":"library/alloc/src/boxed/convert.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"f67a9f24765b8dd3dffe741d73567d0a4e2e474180a41710ac05363ce7096aad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): library/alloc/src/collections/btree/map/entry.rs:36-41 | library/alloc/src/collections/btree/set/entry.rs:88-93 \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":"library/alloc/src/collections/btree/map/entry.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"84c62511df658a418ca97496ffe45f32d991e602e4bdf2dc614777f4d7b29b3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): library/alloc/src/collections/vec_deque/iter.rs:92-105 | library/alloc/src/collections/vec_deque/iter_mut.rs:157-170 \u2014 before extracting anything, compare \u0060library/alloc/src/collections/vec_deque/iter.rs\u0060 and \u0060library/alloc/src/collections/vec_deque/iter_mut.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 48 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/alloc/src/collections/vec_deque/iter.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"644d2ddfd773a46b5a03634649c0126441f04f4cd1953feeae0b7d0a91129d15"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): library/alloc/src/collections/vec_deque/iter.rs:147-158 | library/alloc/src/collections/vec_deque/iter_mut.rs:211-222 \u2014 before extracting anything, compare \u0060library/alloc/src/collections/vec_deque/iter.rs\u0060 and \u0060library/alloc/src/collections/vec_deque/iter_mut.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 48 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/alloc/src/collections/vec_deque/iter.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"7803a0632c524a17dd09d4a3910ea36b61e4a22611886b152beb94d0cd6c0de9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): library/alloc/src/collections/vec_deque/iter.rs:164-177 | library/alloc/src/collections/vec_deque/iter_mut.rs:228-241 \u2014 before extracting anything, compare \u0060library/alloc/src/collections/vec_deque/iter.rs\u0060 and \u0060library/alloc/src/collections/vec_deque/iter_mut.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 48 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/alloc/src/collections/vec_deque/iter.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"78d7d52fc19f43f8b324940ccb3bcf8ed5541aa10e03db8562ca0ed97b48985a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): library/alloc/src/rcs/arc.rs:312-316 | library/alloc/src/rcs/arc.rs:5043-5047 | library/alloc/src/rcs/rc.rs:386-390 | library/alloc/src/rcs/rc.rs:4621-4625 \u2014 before extracting anything, compare \u0060library/alloc/src/rcs/arc.rs\u0060 and \u0060library/alloc/src/rcs/rc.rs\u0060 as WHOLE FILES: this scan already matched 28 separate duplicated blocks between them, totalling at least 329 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060this\u0060 to \u0060Self) -\u003E (NonNull\u003CArcInner\u003CT\u003E\u003E\u0060 in one and \u0060Self) -\u003E (NonNull\u003CRcInner\u003CT\u003E\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060library/alloc/src/rcs/rc.rs:379\u0060 calls \u0060inner\u0060, \u0060as_ref\u0060 and \u0060library/alloc/src/rcs/arc.rs:310\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":"library/alloc/src/rcs/arc.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddb0f5929f4a62a942beb2cad5dc11f14e589ebcd6eb2f3efa0c53a287fd7569"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): library/alloc/src/rcs/arc.rs:1901-1907 | library/alloc/src/rcs/rc.rs:1728-1734 \u2014 before extracting anything, compare \u0060library/alloc/src/rcs/arc.rs\u0060 and \u0060library/alloc/src/rcs/rc.rs\u0060 as WHOLE FILES: this scan already matched 28 separate duplicated blocks between them, totalling at least 329 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":"library/alloc/src/rcs/arc.rs"},"region":{"startLine":1901}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3cc31bbdf84ad1c61f53a855c4cf9f8634a35a1357e10f744b37e0f0e28c4e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): library/alloc/src/rcs/arc.rs:3330-3336 | library/alloc/src/rcs/rc.rs:3612-3618 \u2014 before extracting anything, compare \u0060library/alloc/src/rcs/arc.rs\u0060 and \u0060library/alloc/src/rcs/rc.rs\u0060 as WHOLE FILES: this scan already matched 28 separate duplicated blocks between them, totalling at least 329 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":"library/alloc/src/rcs/arc.rs"},"region":{"startLine":3330}}}],"partialFingerprints":{"codehealthFindingId/v1":"818c51263ba5ac7e302bd693b6107f46e6ca1ead767ce700b8426b8ea74274bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): library/alloc/src/rcs/arc.rs:4454-4458 | library/alloc/src/rcs/rc.rs:4766-4770 \u2014 before extracting anything, compare \u0060library/alloc/src/rcs/arc.rs\u0060 and \u0060library/alloc/src/rcs/rc.rs\u0060 as WHOLE FILES: this scan already matched 28 separate duplicated blocks between them, totalling at least 329 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":"library/alloc/src/rcs/arc.rs"},"region":{"startLine":4454}}}],"partialFingerprints":{"codehealthFindingId/v1":"3087268715d2e92e8b7f25913cef9e5f94bf9113244accd33a9769ee7ff5fa46"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): library/alloc/src/rcs/arc.rs:4856-4868 | library/alloc/src/rcs/rc.rs:4435-4447 \u2014 before extracting anything, compare \u0060library/alloc/src/rcs/arc.rs\u0060 and \u0060library/alloc/src/rcs/rc.rs\u0060 as WHOLE FILES: this scan already matched 28 separate duplicated blocks between them, totalling at least 329 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":"library/alloc/src/rcs/arc.rs"},"region":{"startLine":4856}}}],"partialFingerprints":{"codehealthFindingId/v1":"76e0207ef5180a095cb924cd58a2b9ae4e987440b844b6a3063d0f6270406511"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): library/compiler-builtins/crates/symcheck/src/main.rs:963-967 | src/tools/run-make-support/src/obj.rs:87-91 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/compiler-builtins/crates/symcheck/src/main.rs"},"region":{"startLine":963}}}],"partialFingerprints":{"codehealthFindingId/v1":"8044d028203ca42945af666e7dd61a9087f8984ddc516c6ab334fb21e21fe4cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): library/compiler-builtins/libm/src/math/acosf.rs:25-29 | library/compiler-builtins/libm/src/math/asinf.rs:27-31 \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":"library/compiler-builtins/libm/src/math/acosf.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"0463d22ee10d5afecc3009489503433eb5844d61b20879d1ee5f598f910bf6e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): library/compiler-builtins/libm/src/math/generic/fmaximum_num.rs:18-30 | library/compiler-builtins/libm/src/math/generic/fminimum_num.rs:18-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/compiler-builtins/libm/src/math/generic/fmaximum_num.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"c302c11e9ee860a76ea712e41bb22c7d9353bff9168d186f5d879c560eb4904d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): library/core/src/num/f32.rs:1985-1991 | library/core/src/num/f64.rs:1967-1973 \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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060rhs\u0060 to \u0060f32\u0060 in one and \u0060f64\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":"library/core/src/num/f32.rs"},"region":{"startLine":1985}}}],"partialFingerprints":{"codehealthFindingId/v1":"34045017504aee667d21c3633c2836b0a705df9d287041dceafeeb5d4900768b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): library/std/src/os/unix/net/addr.rs:318-324 | library/std/src/os/windows/net/addr.rs:44-50 \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":"library/std/src/os/unix/net/addr.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea8f4b37fc2a3ad24b51b0f49e2bd96e14c2a3458febf6b8a1b74b86275dc00c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): library/std/src/sync/mpmc/array.rs:364-372 | library/std/src/sync/mpmc/list.rs:415-423 \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":"library/std/src/sync/mpmc/array.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d70c396fa0b20a7814b3274687de6a61b81714a28e266deb634358313cb4c57"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): library/std/src/sync/nonpoison/rwlock.rs:644-652 | library/std/src/sync/nonpoison/rwlock.rs:869-877 | library/std/src/sync/poison/rwlock.rs:778-786 | library/std/src/sync/poison/rwlock.rs:1004-1012 \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":"library/std/src/sync/nonpoison/rwlock.rs"},"region":{"startLine":644}}}],"partialFingerprints":{"codehealthFindingId/v1":"59b50a24e2fb046ef995e67d460033c3e50336f6cb6fcb4bdcea4a4680687f92"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): library/std/src/sys/fs/hermit.rs:225-229 | library/std/src/sys/fs/solid.rs:163-167 \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":"library/std/src/sys/fs/hermit.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"809712eeec7b829428f2ccc94459c82b80f70ce1d8ad65a6584648ec201a6d35"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): library/std/src/sys/fs/solid.rs:634-641 | library/std/src/sys/fs/vexos.rs:550-558 \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":"library/std/src/sys/fs/solid.rs"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f21d5340b8235581a015930da7f4bb78e5d9568a5fae8ecf1b55b9f0d7068d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): library/std/src/sys/net/connection/socket/hermit.rs:136-140 | library/std/src/sys/net/connection/socket/solid.rs:193-197 | library/std/src/sys/net/connection/socket/unix.rs:297-301 | library/std/src/sys/net/connection/socket/windows.rs:243-247 \u2014 before extracting anything, compare \u0060library/std/src/sys/net/connection/socket/hermit.rs\u0060 and \u0060library/std/src/sys/net/connection/socket/unix.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 35 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/net/connection/socket/hermit.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"474edde965c2ff1e0db4e1b0bb53aad535a2053979e43c6d817b8baeb2fcbf2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): library/std/src/sys/net/connection/socket/hermit.rs:236-244 | library/std/src/sys/net/connection/socket/solid.rs:304-312 \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":"library/std/src/sys/net/connection/socket/hermit.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7c903dc733e5679ab9cdb819586588a70c433375a275479541462cf25ae429b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): library/std/src/sys/net/connection/socket/hermit.rs:255-259 | library/std/src/sys/net/connection/socket/solid.rs:324-328 \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":"library/std/src/sys/net/connection/socket/hermit.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"333141d417ce6e7ecdf8a4777877e41905fc333bcd4a4a6648459b43c46ae994"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): library/std/src/sys/net/connection/socket/solid.rs:199-203 | library/std/src/sys/net/connection/socket/unix.rs:303-307 \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":"library/std/src/sys/net/connection/socket/solid.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b0c2bae44d701a6f6af8cbd383fe240eeae3ca00a37b7b371fc2fbbab81db7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): library/std/src/sys/pal/hermit/mod.rs:114-121 | library/std/src/sys/pal/unix/mod.rs:253-260 | library/std/src/sys/pal/wasi/mod.rs:56-63 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/pal/hermit/mod.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"e61e8de8d65dda786fed9f70ea6f1db23fbc44ac090eaa84bb069fcd5705cc45"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): library/std/src/sys/pal/unix/stack_overflow/handler_cygwin.rs:62-72 | library/std/src/sys/pal/windows/stack_overflow.rs:31-41 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/pal/unix/stack_overflow/handler_cygwin.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f7ddd3f5866a92a828f530d67afdbd2e07bf465a624ea931c4b64d47816f18a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): library/std/src/sys/process/unix/fuchsia.rs:236-241 | library/std/src/sys/process/unix/unix.rs:1103-1113 | library/std/src/sys/process/unix/vxworks.rs:218-228 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/process/unix/fuchsia.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"57e3b26ce6f19df4b3a22636721f92a160fae674a6400e42d44f7acd4ee67094"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): library/std/src/sys/thread/teeos.rs:90-94 | library/std/src/sys/thread/unix.rs:134-138 \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 after the matched lines, \u0060library/std/src/sys/thread/unix.rs:141\u0060 calls \u0060id\u0060 and \u0060library/std/src/sys/thread/teeos.rs:96\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":"library/std/src/sys/thread/teeos.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8b18e1b3721ca16d8672cc21a87f87d400c8ef445364139f370f55c08f58348"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): library/std_detect/src/detect/os/freebsd/auxvec.rs:35-45 | library/std_detect/src/detect/os/openbsd/auxvec.rs:31-41 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std_detect/src/detect/os/freebsd/auxvec.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f03b2548627b362508f3b4bf1c3143485abc716cf5e8f863cb4d59cd712886a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): library/stdarch/crates/core_arch/src/powerpc/altivec.rs:1374-1378 | library/stdarch/crates/core_arch/src/s390x/vector.rs:1265-1269 \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":"library/stdarch/crates/core_arch/src/powerpc/altivec.rs"},"region":{"startLine":1374}}}],"partialFingerprints":{"codehealthFindingId/v1":"053fae1d6c8dcd3065cbc3aace6132982b3438ab2a8d4e4aa8a28a43cd9c15ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): library/stdarch/crates/core_arch/src/powerpc/altivec.rs:1392-1396 | library/stdarch/crates/core_arch/src/s390x/vector.rs:1282-1286 \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":"library/stdarch/crates/core_arch/src/powerpc/altivec.rs"},"region":{"startLine":1392}}}],"partialFingerprints":{"codehealthFindingId/v1":"af4e1371a2020aa7a15cf210e77f925698e2661b1ca6598db5642fbcd90baba1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 8): library/stdarch/crates/core_arch/src/powerpc/altivec.rs:2665-2671 | library/stdarch/crates/core_arch/src/powerpc/altivec.rs:2677-2683 | library/stdarch/crates/core_arch/src/powerpc/altivec.rs:2703-2709 | library/stdarch/crates/core_arch/src/powerpc/altivec.rs:2715-2721 | library/stdarch/crates/core_arch/src/powerpc/altivec.rs:2727-2733 | library/stdarch/crates/core_arch/src/powerpc/altivec.rs:2753-2759 | library/stdarch/crates/core_arch/src/powerpc/vsx.rs:126-132 | library/stdarch/crates/core_arch/src/powerpc/vsx.rs:144-150 \u2014 there are 8 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 8 sites; resolving a subset leaves the remainder to drift apart. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060a\u0060 to \u0060vector_signed_char\u0060 in one and \u0060vector_signed_short\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060library/stdarch/crates/core_arch/src/powerpc/altivec.rs:2688\u0060 calls \u0060all\u0060, \u0060assert_instr\u0060 and \u0060library/stdarch/crates/core_arch/src/powerpc/vsx.rs:137\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":"library/stdarch/crates/core_arch/src/powerpc/altivec.rs"},"region":{"startLine":2665}}}],"partialFingerprints":{"codehealthFindingId/v1":"36af23da1ede7d75a073b71fb93c8f3a8f8eba13d2c825d007a1a3bdfd330429"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): library/stdarch/crates/core_arch/src/x86/avx.rs:616-622 | library/stdarch/crates/core_arch/src/x86/sse3.rs:73-79 \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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060a\u0060 to \u0060__m256d\u0060 in one and \u0060__m128\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":"library/stdarch/crates/core_arch/src/x86/avx.rs"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"93614d46d7636e253ca2ac1a543b69f48def3a01d2aecbca2c25a22a2aa7fc17"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): library/stdarch/crates/core_arch/src/x86/avx.rs:655-661 | library/stdarch/crates/core_arch/src/x86/sse3.rs:107-113 \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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060a\u0060 to \u0060__m256d\u0060 in one and \u0060__m128\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":"library/stdarch/crates/core_arch/src/x86/avx.rs"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a3a091ef2cf611a75b34582cc355cd76b25722ee1714a1412fa388e79e8464d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): library/stdarch/crates/core_arch/src/x86/avx512dq.rs:989-994 | library/stdarch/crates/core_arch/src/x86/avx512dq.rs:1036-1041 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:26063-26068 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:26170-26175 \u2014 before extracting anything, compare \u0060library/stdarch/crates/core_arch/src/x86/avx512dq.rs\u0060 and \u0060library/stdarch/crates/core_arch/src/x86/avx512f.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 53 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060a\u0060 to \u0060__m128\u0060 in one and \u0060__m256\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":"library/stdarch/crates/core_arch/src/x86/avx512dq.rs"},"region":{"startLine":989}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c7d1a03ed4dcbe291558a506b9cf7879db709661a3ea6ba7f0bf92580edaa8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): library/stdarch/crates/core_arch/src/x86/avx512dq.rs:1126-1131 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:26277-26282 \u2014 before extracting anything, compare \u0060library/stdarch/crates/core_arch/src/x86/avx512dq.rs\u0060 and \u0060library/stdarch/crates/core_arch/src/x86/avx512f.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 53 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060a\u0060 to \u0060__m128d\u0060 in one and \u0060__m512d\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":"library/stdarch/crates/core_arch/src/x86/avx512dq.rs"},"region":{"startLine":1126}}}],"partialFingerprints":{"codehealthFindingId/v1":"518a23047ab3d6d6ac3f7a16ab535b74b7cbc336fa14dcb7a4f715b09621ec05"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): library/stdarch/crates/core_arch/src/x86/avx512dq.rs:1217-1223 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:28493-28499 \u2014 before extracting anything, compare \u0060library/stdarch/crates/core_arch/src/x86/avx512dq.rs\u0060 and \u0060library/stdarch/crates/core_arch/src/x86/avx512f.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 53 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":"library/stdarch/crates/core_arch/src/x86/avx512dq.rs"},"region":{"startLine":1217}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a13abfe4e3e7070c5403d182b88259d329c7208521ef66e5aea70356abc55a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5): library/stdarch/crates/core_arch/src/x86/avx512f.rs:4321-4327 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:4573-4579 | library/stdarch/crates/core_arch/src/x86/avx512fp16.rs:7300-7306 | library/stdarch/crates/core_arch/src/x86/fma.rs:186-192 | library/stdarch/crates/core_arch/src/x86/fma.rs:352-358 \u2014 before extracting anything, compare \u0060library/stdarch/crates/core_arch/src/x86/avx512f.rs\u0060 and \u0060library/stdarch/crates/core_arch/src/x86/avx512fp16.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 31 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060a\u0060 to \u0060__m512d\u0060 in one and \u0060__m128h\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":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":4321}}}],"partialFingerprints":{"codehealthFindingId/v1":"31247a29076fa3f869bdb40101e9eb9765a92c13ffaf60b57481c36db949e112"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/bootstrap/src/core/build_steps/dist.rs:1467-1475 | src/bootstrap/src/core/build_steps/tool.rs:857-865 \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/bootstrap/src/core/build_steps/dist.rs"},"region":{"startLine":1467}}}],"partialFingerprints":{"codehealthFindingId/v1":"edf5b746cae64758b9f459a9adf8ef097b2b3c7f8546da047933417bb2e4be1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/tools/clippy/clippy_lints/src/assertions_on_constants.rs:86-94 | src/tools/clippy/clippy_lints/src/manual_take.rs:108-116 \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/tools/clippy/clippy_lints/src/assertions_on_constants.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"10c457d851f897e6bc97a408b34a5d5a4f9964c80e0a439255ed69f0403e3f08"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/tools/clippy/clippy_lints/src/bool_comparison.rs:170-177 | src/tools/clippy/clippy_lints/src/needless_bool.rs:347-354 \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/tools/clippy/clippy_lints/src/bool_comparison.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"57d60a23de383437202cd852b0fcb3ea7a79394ba8e6b1d331a0468d59afefec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/tools/clippy/clippy_lints/src/methods/ptr_offset_by_literal.rs:132-137 | src/tools/clippy/clippy_lints/src/methods/ptr_offset_with_cast.rs:76-81 \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/tools/clippy/clippy_lints/src/methods/ptr_offset_by_literal.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"708ebb2efa0324cf082404284d4aabee605051240aeba46f934ed042c061b767"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/tools/clippy/clippy_utils/src/usage.rs:208-217 | src/tools/clippy/clippy_utils/src/visitors.rs:317-326 \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/tools/clippy/clippy_utils/src/usage.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"90a8edb2954975c121eae40589664df083305d0e303a8a24b149ff927822e349"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/tools/compiletest/src/read2.rs:321-328 | src/tools/rust-analyzer/crates/stdx/src/process.rs:237-243 \u2014 before extracting anything, compare \u0060src/tools/compiletest/src/read2.rs\u0060 and \u0060src/tools/rust-analyzer/crates/stdx/src/process.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 103 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/tools/compiletest/src/read2.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a97e5178d083d5c0a07438766bd4e9a373c84d6c89ebbfd789804764d23db70"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/tools/miri/src/shims/unix/tcp_socket.rs:224-232 | src/tools/miri/src/shims/unix/udp_socket.rs:112-120 \u2014 before extracting anything, compare \u0060src/tools/miri/src/shims/unix/tcp_socket.rs\u0060 and \u0060src/tools/miri/src/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/tools/miri/src/shims/unix/tcp_socket.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"c48c983f55ab08e1df40938076e7e871b98adee55253beacee37d919287e129e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/tools/rust-analyzer/crates/base-db/src/lib.rs:433-438 | src/tools/rust-analyzer/crates/stdx/src/panic_context.rs:42-47 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/base-db/src/lib.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"1346e0dcd40d09afe0c6eb189069ae5c339dac70d80fbc30a7c49943acc48095"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-def/src/expr_store/pretty.rs:486-492 | src/tools/rust-analyzer/crates/hir-def/src/item_tree/pretty.rs:63-69 \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/tools/rust-analyzer/crates/hir-def/src/expr_store/pretty.rs"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"91a54ba5365b3ab97598e410a5f60bc060d7e92be75c60fb5b085aaa08d16771"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-def/src/lib.rs:860-867 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/def_id.rs:175-182 \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/tools/rust-analyzer/crates/hir-def/src/lib.rs"},"region":{"startLine":860}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa7697f4795fb1dee527c2c4810a0ebeeeaa444cd72332c639a93eec6d98d236"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/at.rs:213-218 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/at.rs:228-233 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/mod.rs:1330-1335 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/mod.rs:1345-1350 \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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060a\u0060 to \u0060Self\u0060 in one and \u0060Ty\u003C\u0027db\u003E\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/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/at.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e233064c70b25823560fed15fa624d335496f48bf7a5e78f1be7dd5d653a089"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/tools/rust-analyzer/crates/ide-db/src/imports/merge_imports.rs:647-653 | src/tools/rust-analyzer/crates/ide/src/folding_ranges.rs:385-391 \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/tools/rust-analyzer/crates/ide-db/src/imports/merge_imports.rs"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"88007a47423b5f08fd6ced07e82a3733ad80b6684396ab601a9d9124421fbb83"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/tools/rust-analyzer/crates/intern/src/intern.rs:102-107 | src/tools/rust-analyzer/crates/intern/src/symbol.rs:181-186 \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/tools/rust-analyzer/crates/intern/src/symbol.rs:181\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060storage\u0060 to \u0060\u0026\u0027static InternMap\u003CT\u003E\u0060 in one and \u0060\u0026\u0027static Map\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/tools/rust-analyzer/crates/intern/src/intern.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc44f1ded06cf8983568088411e62b0085679749a3bde42d3847e87fdf77c0a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/tools/rust-analyzer/crates/proc-macro-srv-cli/src/version.rs:28-35 | src/tools/rust-analyzer/crates/rust-analyzer/src/version.rs:27-34 \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/tools/rust-analyzer/crates/proc-macro-srv-cli/src/version.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bdc63e8ac3b8eb39c8b0ab3db1d99c52c6c5b91216a22c878c5b612c6666e66"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/tools/rust-analyzer/crates/proc-macro-srv/src/server_impl/rust_analyzer_span.rs:101-111 | src/tools/rust-analyzer/crates/proc-macro-srv/src/server_impl/token_id.rs:94-104 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tools/rust-analyzer/crates/proc-macro-srv/src/server_impl/rust_analyzer_span.rs:101\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/tools/rust-analyzer/crates/proc-macro-srv/src/server_impl/rust_analyzer_span.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e681c023e9513619087822f31e2e0ed1fe76f068cc97192739fbd1c264414ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): src/tools/rust-analyzer/crates/syntax/src/ast/expr_ext.rs:76-85 | src/tools/rust-analyzer/crates/syntax/src/ast/node_ext.rs:1138-1147 | src/tools/rust-analyzer/crates/syntax/src/ast/node_ext.rs:1160-1169 \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/tools/rust-analyzer/crates/syntax/src/ast/expr_ext.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"7983ba6fdbe984bd0700c633140a2be84dc2423b88b1b290a8120b642b32c9ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): compiler/rustc_ast_pretty/src/pprust/state/expr.rs:965-971 | compiler/rustc_hir_pretty/src/lib.rs:2371-2377 \u2014 before extracting anything, compare \u0060compiler/rustc_ast_pretty/src/pprust/state/expr.rs\u0060 and \u0060compiler/rustc_hir_pretty/src/lib.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 47 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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060capture_clause\u0060 to \u0060ast::CaptureBy\u0060 in one and \u0060hir::CaptureBy\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":"compiler/rustc_ast_pretty/src/pprust/state/expr.rs"},"region":{"startLine":965}}}],"partialFingerprints":{"codehealthFindingId/v1":"7efd9f51c9c0b79bb11491cc061b21cb8505a314d496c377bf1e71ceb5578b4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): compiler/rustc_attr_parsing/src/attributes/diagnostic/on_unimplemented.rs:51-59 | compiler/rustc_attr_parsing/src/attributes/diagnostic/on_unmatched_args.rs:37-45 \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":"compiler/rustc_attr_parsing/src/attributes/diagnostic/on_unimplemented.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"319cc7921bf5ffb5aa5aaeb3485d41ee31f1b73bb89410b878e71b7f8c5cc207"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): compiler/rustc_builtin_macros/src/autodiff.rs:32-36 | compiler/rustc_builtin_macros/src/offload.rs:15-19 \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 \u0060compiler/rustc_builtin_macros/src/autodiff.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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060id\u0060 to \u0060rustc_ast::AttrId\u0060 in one and \u0060ast::AttrId\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":"compiler/rustc_builtin_macros/src/autodiff.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"1095a8f0dc539c02f9e11380d3d1ecb91e9ec4707b1c362bcff3c602faa314df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): compiler/rustc_codegen_gcc/src/type_of.rs:23-32 | compiler/rustc_codegen_ssa/src/traits/type_.rs:65-74 \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":"compiler/rustc_codegen_gcc/src/type_of.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"03bd286c6cadc3b25ab18f9e26200766b8260da79de6c72b9a8d3cb3a005d51f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): compiler/rustc_index/src/slice.rs:68-72 | compiler/rustc_index/src/slice.rs:91-95 | compiler/rustc_index/src/vec.rs:146-150 \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 \u0060compiler/rustc_index/src/slice.rs:91\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":"compiler/rustc_index/src/slice.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0a0a7308a1fdfea96d9116f268fb8f6dad64783ff81f4fd0ebc76ee08de1049"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): compiler/rustc_infer/src/infer/mod.rs:1486-1491 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/mod.rs:1073-1078 \u2014 before extracting anything, compare \u0060compiler/rustc_infer/src/infer/mod.rs\u0060 and \u0060src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/mod.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 44 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 \u0060compiler/rustc_infer/src/infer/mod.rs:1486\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060vid\u0060 to \u0060ty::ConstVid\u0060 in one and \u0060ConstVid\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":"compiler/rustc_infer/src/infer/mod.rs"},"region":{"startLine":1486}}}],"partialFingerprints":{"codehealthFindingId/v1":"30c388ea11805e72e40bbc77247a807b04882a73c012af05f058269a15227a1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): compiler/rustc_type_ir/src/generic_visit.rs:74-79 | compiler/rustc_type_ir/src/visit.rs:163-168 \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":"compiler/rustc_type_ir/src/generic_visit.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e74a0128553bb8c61c5b6eb000d591b36656cab7f4095899561b97a8ec1db6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): compiler/rustc_type_ir/src/sty/consts.rs:144-149 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/ty.rs:554-559 \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":"compiler/rustc_type_ir/src/sty/consts.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4f74a485081df3baa5f8b4429fd36acfbccb6e2e7db48cc5a8f71c52225f35b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): library/alloc/src/collections/btree/map/entry.rs:282-287 | library/alloc/src/collections/btree/set/entry.rs:261-266 \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":"library/alloc/src/collections/btree/map/entry.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"273c494ad0ad77cffdefe833533f4adcb08a4510c8b07519eec80d94073f290a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): library/alloc/src/rcs/arc.rs:410-420 | library/alloc/src/rcs/rc.rs:293-303 \u2014 before extracting anything, compare \u0060library/alloc/src/rcs/arc.rs\u0060 and \u0060library/alloc/src/rcs/rc.rs\u0060 as WHOLE FILES: this scan already matched 28 separate duplicated blocks between them, totalling at least 329 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":"library/alloc/src/rcs/arc.rs"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"55993f46848c400043243ae57eb77fa7dfa94fb84141d4b904d49b8d3829d283"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): library/alloc/src/rcs/arc.rs:531-540 | library/alloc/src/rcs/arc.rs:564-573 | library/alloc/src/rcs/rc.rs:525-534 | library/alloc/src/rcs/rc.rs:557-566 \u2014 before extracting anything, compare \u0060library/alloc/src/rcs/arc.rs\u0060 and \u0060library/alloc/src/rcs/rc.rs\u0060 as WHOLE FILES: this scan already matched 28 separate duplicated blocks between them, totalling at least 329 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":"library/alloc/src/rcs/arc.rs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c7be0144f1ad63365e8812adb8a80dae419869edb090cd42aa0d4281918b790"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): library/alloc/src/rcs/arc.rs:639-648 | library/alloc/src/rcs/arc.rs:672-681 | library/alloc/src/rcs/rc.rs:614-623 | library/alloc/src/rcs/rc.rs:647-656 \u2014 before extracting anything, compare \u0060library/alloc/src/rcs/arc.rs\u0060 and \u0060library/alloc/src/rcs/rc.rs\u0060 as WHOLE FILES: this scan already matched 28 separate duplicated blocks between them, totalling at least 329 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060library/alloc/src/rcs/rc.rs:662\u0060 calls \u0060pin\u0060, \u0060new_unchecked\u0060 and \u0060library/alloc/src/rcs/arc.rs:682\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":"library/alloc/src/rcs/arc.rs"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"def76cef09542955a55c35955ec94ed7e6c27680a292400661275ddd3f2969d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 4): library/alloc/src/rcs/arc.rs:741-753 | library/alloc/src/rcs/arc.rs:779-791 | library/alloc/src/rcs/rc.rs:718-730 | library/alloc/src/rcs/rc.rs:756-768 \u2014 before extracting anything, compare \u0060library/alloc/src/rcs/arc.rs\u0060 and \u0060library/alloc/src/rcs/rc.rs\u0060 as WHOLE FILES: this scan already matched 28 separate duplicated blocks between them, totalling at least 329 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":"library/alloc/src/rcs/arc.rs"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"41fb7d1ad1d9aaac6f73cea9a0420ba3e4ad8b5cc98e718ca509565b606745e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 4): library/alloc/src/rcs/arc.rs:965-977 | library/alloc/src/rcs/arc.rs:1004-1016 | library/alloc/src/rcs/rc.rs:900-912 | library/alloc/src/rcs/rc.rs:939-951 \u2014 before extracting anything, compare \u0060library/alloc/src/rcs/arc.rs\u0060 and \u0060library/alloc/src/rcs/rc.rs\u0060 as WHOLE FILES: this scan already matched 28 separate duplicated blocks between them, totalling at least 329 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":"library/alloc/src/rcs/arc.rs"},"region":{"startLine":965}}}],"partialFingerprints":{"codehealthFindingId/v1":"a15ce7198f2136983d70d6a8b7454b8e2ae697994f9cf75aec3cd3a783566ef5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): library/alloc/src/rcs/arc.rs:1496-1500 | library/alloc/src/rcs/arc.rs:5111-5115 | library/alloc/src/rcs/rc.rs:1338-1342 \u2014 before extracting anything, compare \u0060library/alloc/src/rcs/arc.rs\u0060 and \u0060library/alloc/src/rcs/rc.rs\u0060 as WHOLE FILES: this scan already matched 28 separate duplicated blocks between them, totalling at least 329 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":"library/alloc/src/rcs/arc.rs"},"region":{"startLine":1496}}}],"partialFingerprints":{"codehealthFindingId/v1":"59c1277b8b634c6910006646160e75655683ff0968f7fca359d376ed5088e9fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): library/alloc/src/rcs/arc.rs:1554-1566 | library/alloc/src/rcs/rc.rs:1396-1408 \u2014 before extracting anything, compare \u0060library/alloc/src/rcs/arc.rs\u0060 and \u0060library/alloc/src/rcs/rc.rs\u0060 as WHOLE FILES: this scan already matched 28 separate duplicated blocks between them, totalling at least 329 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":"library/alloc/src/rcs/arc.rs"},"region":{"startLine":1554}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3f2cbf5130aabf15ee2d2e3ae42288dfa26ae4bedcfbffaa857c82b1511c334"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): library/alloc/src/rcs/arc.rs:1583-1597 | library/alloc/src/rcs/rc.rs:1425-1439 \u2014 before extracting anything, compare \u0060library/alloc/src/rcs/arc.rs\u0060 and \u0060library/alloc/src/rcs/rc.rs\u0060 as WHOLE FILES: this scan already matched 28 separate duplicated blocks between them, totalling at least 329 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":"library/alloc/src/rcs/arc.rs"},"region":{"startLine":1583}}}],"partialFingerprints":{"codehealthFindingId/v1":"463560beef0cd5c2fbcc351a15d1d0eefe27a9f6493fd707cd729f835c85b451"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): library/alloc/src/rcs/arc.rs:1633-1637 | library/alloc/src/rcs/rc.rs:1474-1478 \u2014 before extracting anything, compare \u0060library/alloc/src/rcs/arc.rs\u0060 and \u0060library/alloc/src/rcs/rc.rs\u0060 as WHOLE FILES: this scan already matched 28 separate duplicated blocks between them, totalling at least 329 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":"library/alloc/src/rcs/arc.rs"},"region":{"startLine":1633}}}],"partialFingerprints":{"codehealthFindingId/v1":"d56084eb0190ad14908f088dee15d5b1eece3058a0b773f0704d47fc4061c9fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): library/alloc/src/rcs/arc.rs:1928-1935 | library/alloc/src/rcs/arc.rs:5033-5040 | library/alloc/src/rcs/rc.rs:1754-1761 | library/alloc/src/rcs/rc.rs:4611-4618 \u2014 before extracting anything, compare \u0060library/alloc/src/rcs/arc.rs\u0060 and \u0060library/alloc/src/rcs/rc.rs\u0060 as WHOLE FILES: this scan already matched 28 separate duplicated blocks between them, totalling at least 329 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":"library/alloc/src/rcs/arc.rs"},"region":{"startLine":1928}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea5030560de6861a94a0e797ad8ed975b37414b4df54169e7e67a8bb1a26bab5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): library/alloc/src/rcs/arc.rs:2393-2402 | library/alloc/src/rcs/rc.rs:2490-2497 \u2014 before extracting anything, compare \u0060library/alloc/src/rcs/arc.rs\u0060 and \u0060library/alloc/src/rcs/rc.rs\u0060 as WHOLE FILES: this scan already matched 28 separate duplicated blocks between them, totalling at least 329 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":"library/alloc/src/rcs/arc.rs"},"region":{"startLine":2393}}}],"partialFingerprints":{"codehealthFindingId/v1":"2badb9e3133cc767af6eaad309ba4d8f47fb004be5ad86c09d750ac3a1b8bd19"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): library/alloc/src/rcs/arc.rs:3059-3069 | library/alloc/src/rcs/rc.rs:2333-2343 \u2014 before extracting anything, compare \u0060library/alloc/src/rcs/arc.rs\u0060 and \u0060library/alloc/src/rcs/rc.rs\u0060 as WHOLE FILES: this scan already matched 28 separate duplicated blocks between them, totalling at least 329 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":"library/alloc/src/rcs/arc.rs"},"region":{"startLine":3059}}}],"partialFingerprints":{"codehealthFindingId/v1":"54f8d84427aef41e0d2db9749e001c804a12f167c8736ebb02df9715ffdf93d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): library/alloc/src/rcs/arc.rs:3102-3108 | library/alloc/src/rcs/rc.rs:2372-2378 \u2014 before extracting anything, compare \u0060library/alloc/src/rcs/arc.rs\u0060 and \u0060library/alloc/src/rcs/rc.rs\u0060 as WHOLE FILES: this scan already matched 28 separate duplicated blocks between them, totalling at least 329 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":"library/alloc/src/rcs/arc.rs"},"region":{"startLine":3102}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fc8f5ef198de5a3f6b59099f12af7a5cfaf638a50336bc77a9895d20c24f524"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): library/alloc/src/rcs/arc.rs:3284-3297 | library/alloc/src/rcs/rc.rs:3565-3578 \u2014 before extracting anything, compare \u0060library/alloc/src/rcs/arc.rs\u0060 and \u0060library/alloc/src/rcs/rc.rs\u0060 as WHOLE FILES: this scan already matched 28 separate duplicated blocks between them, totalling at least 329 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":"library/alloc/src/rcs/arc.rs"},"region":{"startLine":3284}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1e6e1ba0cc60e32a234ae584d96ba1327482b5089049a69687939bc8c61fc5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): library/alloc/src/rcs/arc.rs:4132-4136 | library/alloc/src/rcs/rc.rs:3097-3101 \u2014 before extracting anything, compare \u0060library/alloc/src/rcs/arc.rs\u0060 and \u0060library/alloc/src/rcs/rc.rs\u0060 as WHOLE FILES: this scan already matched 28 separate duplicated blocks between them, totalling at least 329 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":"library/alloc/src/rcs/arc.rs"},"region":{"startLine":4132}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1a3bbfe590f3d1f268745f7c51cf2f0ea894727f439b05ea02c35771d4b87bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): library/alloc/src/rcs/arc.rs:4278-4286 | library/alloc/src/rcs/rc.rs:3243-3251 \u2014 before extracting anything, compare \u0060library/alloc/src/rcs/arc.rs\u0060 and \u0060library/alloc/src/rcs/rc.rs\u0060 as WHOLE FILES: this scan already matched 28 separate duplicated blocks between them, totalling at least 329 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060boxed_slice\u0060 to \u0060Arc\u003C[T], A\u003E\u0060 in one and \u0060Rc\u003C[T], A\u003E\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":"library/alloc/src/rcs/arc.rs"},"region":{"startLine":4278}}}],"partialFingerprints":{"codehealthFindingId/v1":"b78b6e3a0646bef032994da6df25d3940548307927bbca5a1d64ad3e60c70c40"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): library/alloc/src/rcs/arc.rs:4974-4989 | library/alloc/src/rcs/rc.rs:4553-4568 \u2014 before extracting anything, compare \u0060library/alloc/src/rcs/arc.rs\u0060 and \u0060library/alloc/src/rcs/rc.rs\u0060 as WHOLE FILES: this scan already matched 28 separate duplicated blocks between them, totalling at least 329 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":"library/alloc/src/rcs/arc.rs"},"region":{"startLine":4974}}}],"partialFingerprints":{"codehealthFindingId/v1":"09dc8f19ce3f87552b6d40f5ef85211dc7c6649d51f06d069b1a04be3fba0152"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): library/std/src/sync/nonpoison/mutex.rs:223-231 | library/std/src/sync/nonpoison/rwlock.rs:263-271 \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":"library/std/src/sync/nonpoison/mutex.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"b96e69dc7fe211dba9fe0e840200c0d158ab25af47b302c6b1910ed13c160f49"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): library/std/src/sync/nonpoison/mutex.rs:616-624 | library/std/src/sync/nonpoison/rwlock.rs:935-943 \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":"library/std/src/sync/nonpoison/mutex.rs"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"352ea08647dc3060d8a11403079da136f8f2acf6ebbc706137f8e09c0d38f0e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): library/std/src/sync/poison/mutex.rs:382-387 | library/std/src/sync/poison/rwlock.rs:297-302 \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":"library/std/src/sync/poison/mutex.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5177caf992c420e1b66d4052061317af98e7dbbfc8912dc8e19f3ca2f6e5982"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): library/std/src/sync/poison/mutex.rs:449-454 | library/std/src/sync/poison/rwlock.rs:366-371 \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":"library/std/src/sync/poison/mutex.rs"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"76c4ce5f0f3bb35df3796df7c3b51c39825b9241b57598dfd7f5c75d9240d836"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): library/std/src/sys/env/solid.rs:85-90 | library/std/src/sys/env/unix.rs:141-146 \u2014 before extracting anything, compare \u0060library/std/src/sys/env/solid.rs\u0060 and \u0060library/std/src/sys/env/unix.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 39 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":"library/std/src/sys/env/solid.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"2078b9422d0d56b26fe5b88f6b0ef068c4dab3594dcf589f86a478d50b8873b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): library/std/src/sys/net/connection/socket/hermit.rs:142-146 | library/std/src/sys/net/connection/socket/windows.rs:290-294 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/net/connection/socket/hermit.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"870b91702367e053cddad1e9e389909eca69f6f6328ba7166f8ba54d1c066c14"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 5): library/stdarch/crates/core_arch/src/riscv_shared/zb.rs:74-84 | library/stdarch/crates/core_arch/src/riscv_shared/zb.rs:99-109 | library/stdarch/crates/core_arch/src/riscv_shared/zb.rs:124-134 | library/stdarch/crates/core_arch/src/riscv_shared/zk.rs:64-74 | library/stdarch/crates/core_arch/src/riscv_shared/zk.rs:92-102 \u2014 there are 5 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 5 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/riscv_shared/zb.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a76a8516ad9d2c289c00cc6b2f744e2c5759ea475faadd6433cbe4ac4e5caaa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): library/stdarch/crates/core_arch/src/x86/avx.rs:566-571 | library/stdarch/crates/core_arch/src/x86/avx.rs:582-587 | library/stdarch/crates/core_arch/src/x86/sse41.rs:112-117 | library/stdarch/crates/core_arch/src/x86/sse41.rs:128-133 \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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060a\u0060 to \u0060__m256d\u0060 in one and \u0060__m256\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":"library/stdarch/crates/core_arch/src/x86/avx.rs"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9ca263024d0be274f436f2d492e0b71426537b7d4396c0deba5ae2f3b6e70c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 5): library/stdarch/crates/core_arch/src/x86/avx.rs:1622-1630 | library/stdarch/crates/core_arch/src/x86/avx.rs:1656-1664 | library/stdarch/crates/core_arch/src/x86/avx.rs:1723-1731 | library/stdarch/crates/core_arch/src/x86/sse.rs:1217-1227 | library/stdarch/crates/core_arch/src/x86/sse2.rs:2944-2952 \u2014 before extracting anything, compare \u0060library/stdarch/crates/core_arch/src/x86/avx.rs\u0060 and \u0060library/stdarch/crates/core_arch/src/x86/sse2.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 39 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060mem_addr\u0060 to \u0060*const f64\u0060 in one and \u0060*const f32\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060library/stdarch/crates/core_arch/src/x86/avx.rs:1676\u0060 calls \u0060_mm256_storeu_ps\u0060, \u0060write_unaligned\u0060 and \u0060library/stdarch/crates/core_arch/src/x86/sse.rs:1253\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":"library/stdarch/crates/core_arch/src/x86/avx.rs"},"region":{"startLine":1622}}}],"partialFingerprints":{"codehealthFindingId/v1":"3660e30f9459fbf4415047f5540cc3fea6c7bda74bca1a329bf5dbcd952b0576"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): library/stdarch/crates/core_arch/src/x86/avx.rs:1932-1940 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:31027-31035 \u2014 before extracting anything, compare \u0060library/stdarch/crates/core_arch/src/x86/avx.rs\u0060 and \u0060library/stdarch/crates/core_arch/src/x86/avx512f.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 50 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060a\u0060 to \u0060__m256i\u0060 in one and \u0060__m512i\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":"library/stdarch/crates/core_arch/src/x86/avx.rs"},"region":{"startLine":1932}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8e054bfedd1aeb0a9239999a44d7f6dfccc36a04db4b1521e7c0fc59bab09a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): library/stdarch/crates/core_arch/src/x86/avx.rs:1961-1969 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:31000-31008 \u2014 before extracting anything, compare \u0060library/stdarch/crates/core_arch/src/x86/avx.rs\u0060 and \u0060library/stdarch/crates/core_arch/src/x86/avx512f.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 50 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060a\u0060 to \u0060__m256d\u0060 in one and \u0060__m512d\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":"library/stdarch/crates/core_arch/src/x86/avx.rs"},"region":{"startLine":1961}}}],"partialFingerprints":{"codehealthFindingId/v1":"47f6bf88f5e408eeb94b26b9599eec4edda02ef47ef40a83cb2719551d950e45"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): library/stdarch/crates/core_arch/src/x86/avx.rs:1991-1999 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:30973-30981 \u2014 before extracting anything, compare \u0060library/stdarch/crates/core_arch/src/x86/avx.rs\u0060 and \u0060library/stdarch/crates/core_arch/src/x86/avx512f.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 50 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060a\u0060 to \u0060__m256\u0060 in one and \u0060__m512\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":"library/stdarch/crates/core_arch/src/x86/avx.rs"},"region":{"startLine":1991}}}],"partialFingerprints":{"codehealthFindingId/v1":"139b6eb15086976fe0e2967fa6b5c836e71f9b16228d872b1d7fee2d573991df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): library/stdarch/crates/core_arch/src/x86/avx.rs:2364-2371 | library/stdarch/crates/core_arch/src/x86/avx.rs:2383-2390 | library/stdarch/crates/core_arch/src/x86/sse.rs:1125-1132 | library/stdarch/crates/core_arch/src/x86/sse2.rs:2634-2641 \u2014 before extracting anything, compare \u0060library/stdarch/crates/core_arch/src/x86/avx.rs\u0060 and \u0060library/stdarch/crates/core_arch/src/x86/sse2.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 39 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060a\u0060 to \u0060__m256d\u0060 in one and \u0060__m256\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":"library/stdarch/crates/core_arch/src/x86/avx.rs"},"region":{"startLine":2364}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd1f90c6ab752414c5d16ba16934dbdb8f669f15b5fd59984eb6bc6996aca3f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): library/stdarch/crates/core_arch/src/x86/avx.rs:2539-2547 | library/stdarch/crates/core_arch/src/x86/sse2.rs:1258-1263 \u2014 before extracting anything, compare \u0060library/stdarch/crates/core_arch/src/x86/avx.rs\u0060 and \u0060library/stdarch/crates/core_arch/src/x86/sse2.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 39 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 \u0060library/stdarch/crates/core_arch/src/x86/avx.rs:2539\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":"library/stdarch/crates/core_arch/src/x86/avx.rs"},"region":{"startLine":2539}}}],"partialFingerprints":{"codehealthFindingId/v1":"9788640085457febbb2c9beab7a4a0b815341eef19a22a9f8c6e6773f8da3bb5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): library/stdarch/crates/core_arch/src/x86/avx.rs:2697-2707 | library/stdarch/crates/core_arch/src/x86/sse2.rs:1143-1150 \u2014 before extracting anything, compare \u0060library/stdarch/crates/core_arch/src/x86/avx.rs\u0060 and \u0060library/stdarch/crates/core_arch/src/x86/sse2.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 39 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 \u0060library/stdarch/crates/core_arch/src/x86/avx.rs:2697\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":"library/stdarch/crates/core_arch/src/x86/avx.rs"},"region":{"startLine":2697}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a0fe5f5ab3be5e2cd2b90fc5285353e4939e394376740f8865b789f7f6f21c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): library/stdarch/crates/core_arch/src/x86/avx2.rs:417-422 | library/stdarch/crates/core_arch/src/x86/sse41.rs:63-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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060a\u0060 to \u0060__m256i\u0060 in one and \u0060__m128i\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":"library/stdarch/crates/core_arch/src/x86/avx2.rs"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"83c77dd8005a21718c6b7327b8cf67d86efc922d5c86f181c1dd7c3c5ab9744c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5): library/stdarch/crates/core_arch/src/x86/avx2.rs:798-804 | library/stdarch/crates/core_arch/src/x86/avx2.rs:885-891 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:11900-11906 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:12111-12117 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:13354-13360 \u2014 before extracting anything, compare \u0060library/stdarch/crates/core_arch/src/x86/avx2.rs\u0060 and \u0060library/stdarch/crates/core_arch/src/x86/avx512f.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 53 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":"library/stdarch/crates/core_arch/src/x86/avx2.rs"},"region":{"startLine":798}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc51968fec349079df86886bd36c1ef296359ff12d676af6ba89ad9e7ecb439a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): library/stdarch/crates/core_arch/src/x86/avx2.rs:2204-2211 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:1740-1747 | library/stdarch/crates/core_arch/src/x86/sse2.rs:329-336 \u2014 before extracting anything, compare \u0060library/stdarch/crates/core_arch/src/x86/avx2.rs\u0060 and \u0060library/stdarch/crates/core_arch/src/x86/avx512f.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 53 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060a\u0060 to \u0060__m256i\u0060 in one and \u0060__m512i\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":"library/stdarch/crates/core_arch/src/x86/avx2.rs"},"region":{"startLine":2204}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd073b6a8a15b16444134ad4641ab38fe271568ab601683f18282b55c07f300c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): library/stdarch/crates/core_arch/src/x86/avx2.rs:2711-2720 | library/stdarch/crates/core_arch/src/x86/avx2.rs:3094-3103 | library/stdarch/crates/core_arch/src/x86/sse2.rs:543-552 | library/stdarch/crates/core_arch/src/x86/sse2.rs:746-755 \u2014 before extracting anything, compare \u0060library/stdarch/crates/core_arch/src/x86/avx2.rs\u0060 and \u0060library/stdarch/crates/core_arch/src/x86/sse2.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 39 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060library/stdarch/crates/core_arch/src/x86/sse2.rs:562\u0060 calls \u0060_mm_sll_epi16\u0060, \u0060transmute\u0060, \u0060psllw\u0060 and \u0060library/stdarch/crates/core_arch/src/x86/avx2.rs:3115\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":"library/stdarch/crates/core_arch/src/x86/avx2.rs"},"region":{"startLine":2711}}}],"partialFingerprints":{"codehealthFindingId/v1":"1317794c259f96268d401d39d9f55a30f778fc0c60e8fc1080a2185173c6563b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): library/stdarch/crates/core_arch/src/x86/avx2.rs:2732-2741 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:20457-20466 \u2014 before extracting anything, compare \u0060library/stdarch/crates/core_arch/src/x86/avx2.rs\u0060 and \u0060library/stdarch/crates/core_arch/src/x86/avx512f.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 53 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":"library/stdarch/crates/core_arch/src/x86/avx2.rs"},"region":{"startLine":2732}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d292553c302fbb4441ca90c6026dafae34b3d1513fa866fcebeef1a19934858"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): library/stdarch/crates/core_arch/src/x86/avx2.rs:3204-3213 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:31045-31054 \u2014 before extracting anything, compare \u0060library/stdarch/crates/core_arch/src/x86/avx2.rs\u0060 and \u0060library/stdarch/crates/core_arch/src/x86/avx512f.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 53 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060mem_addr\u0060 to \u0060*const __m256i\u0060 in one and \u0060*const __m512i\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":"library/stdarch/crates/core_arch/src/x86/avx2.rs"},"region":{"startLine":3204}}}],"partialFingerprints":{"codehealthFindingId/v1":"65e85aab98acffc756f86439b2d217bc8fe9de5a46b760e7bd4987615a15d5b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 10): library/stdarch/crates/core_arch/src/x86/avx512bw.rs:7590-7596 | library/stdarch/crates/core_arch/src/x86/avx512bw.rs:7628-7634 | library/stdarch/crates/core_arch/src/x86/avx512bw.rs:9695-9701 | library/stdarch/crates/core_arch/src/x86/avx512bw.rs:9733-9739 | library/stdarch/crates/core_arch/src/x86/avx512bw.rs:9771-9777 | library/stdarch/crates/core_arch/src/x86/avx512bw.rs:9864-9870 | library/stdarch/crates/core_arch/src/x86/avx512bw.rs:9902-9908 | library/stdarch/crates/core_arch/src/x86/avx512bw.rs:9940-9946 | library/stdarch/crates/core_arch/src/x86/avx512dq.rs:1475-1481 | library/stdarch/crates/core_arch/src/x86/avx512dq.rs:1536-1542 \u2014 there are 10 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 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 \u0060library/stdarch/crates/core_arch/src/x86/avx512bw.rs:7590\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060a\u0060 to \u0060__m128i\u0060 in one and \u0060i8\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":"library/stdarch/crates/core_arch/src/x86/avx512bw.rs"},"region":{"startLine":7590}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e4e3fc2c5fc6d72e4bab9e229041b529bc3b4f2eb76624cd63d4c91e2a33ede"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 10): library/stdarch/crates/core_arch/src/x86/avx512bw.rs:7607-7613 | library/stdarch/crates/core_arch/src/x86/avx512bw.rs:7645-7651 | library/stdarch/crates/core_arch/src/x86/avx512bw.rs:9712-9718 | library/stdarch/crates/core_arch/src/x86/avx512bw.rs:9750-9756 | library/stdarch/crates/core_arch/src/x86/avx512bw.rs:9788-9794 | library/stdarch/crates/core_arch/src/x86/avx512bw.rs:9881-9887 | library/stdarch/crates/core_arch/src/x86/avx512bw.rs:9919-9925 | library/stdarch/crates/core_arch/src/x86/avx512bw.rs:9957-9963 | library/stdarch/crates/core_arch/src/x86/avx512dq.rs:1494-1500 | library/stdarch/crates/core_arch/src/x86/avx512dq.rs:1555-1561 \u2014 there are 10 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 10 sites; resolving a subset leaves the remainder to drift apart. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060a\u0060 to \u0060__m128i\u0060 in one and \u0060i8\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":"library/stdarch/crates/core_arch/src/x86/avx512bw.rs"},"region":{"startLine":7607}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c480c0f0ff1ebc0bfbcc9b2bf253b45ecdffdc48cc51baf80f34891e11b8604"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): library/stdarch/crates/core_arch/src/x86/avx512bw.rs:7874-7879 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:21365-21370 \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":"library/stdarch/crates/core_arch/src/x86/avx512bw.rs"},"region":{"startLine":7874}}}],"partialFingerprints":{"codehealthFindingId/v1":"805c585f4fd67de6d8ffe4bce038b6503b132176168af9fea375cee5557036bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): library/stdarch/crates/core_arch/src/x86/avx512bw.rs:7894-7900 | library/stdarch/crates/core_arch/src/x86/avx512bw.rs:7932-7938 | library/stdarch/crates/core_arch/src/x86/avx512bw.rs:7970-7976 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:21385-21391 \u2014 there are 4 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/stdarch/crates/core_arch/src/x86/avx512bw.rs:7894\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":"library/stdarch/crates/core_arch/src/x86/avx512bw.rs"},"region":{"startLine":7894}}}],"partialFingerprints":{"codehealthFindingId/v1":"829e7e2374ba204302b5dcc38b5e432e8c730daaa8a32e0b9d8a08e78ea96f47"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): library/stdarch/crates/core_arch/src/x86/avx512bw.rs:7911-7917 | library/stdarch/crates/core_arch/src/x86/avx512bw.rs:7949-7955 | library/stdarch/crates/core_arch/src/x86/avx512bw.rs:7987-7993 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:21402-21408 \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":"library/stdarch/crates/core_arch/src/x86/avx512bw.rs"},"region":{"startLine":7911}}}],"partialFingerprints":{"codehealthFindingId/v1":"206b82e4e84451ae54536486b4556331e1ee80eda3c2348580b9743460a648c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): library/stdarch/crates/core_arch/src/x86/avx512bw.rs:11054-11058 | library/stdarch/crates/core_arch/src/x86/avx512bw.rs:11068-11072 | library/stdarch/crates/core_arch/src/x86/avx512dq.rs:4742-4746 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:30471-30475 \u2014 before extracting anything, compare \u0060library/stdarch/crates/core_arch/src/x86/avx512dq.rs\u0060 and \u0060library/stdarch/crates/core_arch/src/x86/avx512f.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 53 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060a\u0060 to \u0060__mmask32\u0060 in one and \u0060__mmask64\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":"library/stdarch/crates/core_arch/src/x86/avx512bw.rs"},"region":{"startLine":11054}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7b5a203f0204068bc9f5408363965c417e358f9f895b312d815db91edae89b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 9): library/stdarch/crates/core_arch/src/x86/avx512bw.rs:12175-12181 | library/stdarch/crates/core_arch/src/x86/avx512bw.rs:12218-12224 | library/stdarch/crates/core_arch/src/x86/avx512bw.rs:12261-12267 | library/stdarch/crates/core_arch/src/x86/avx512dq.rs:1859-1865 | library/stdarch/crates/core_arch/src/x86/avx512dq.rs:1926-1932 | library/stdarch/crates/core_arch/src/x86/avx512dq.rs:1995-2001 | library/stdarch/crates/core_arch/src/x86/avx512dq.rs:2076-2082 | library/stdarch/crates/core_arch/src/x86/avx512dq.rs:2144-2150 | library/stdarch/crates/core_arch/src/x86/avx512dq.rs:2214-2220 \u2014 there are 9 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 9 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/stdarch/crates/core_arch/src/x86/avx512bw.rs:12175\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":"library/stdarch/crates/core_arch/src/x86/avx512bw.rs"},"region":{"startLine":12175}}}],"partialFingerprints":{"codehealthFindingId/v1":"81e236135cd19cbce316f5fbe7b23d3891499ddacc671af5701b583debee15bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 24): library/stdarch/crates/core_arch/src/x86/avx512dq.rs:1882-1888 | library/stdarch/crates/core_arch/src/x86/avx512dq.rs:1949-1955 | library/stdarch/crates/core_arch/src/x86/avx512dq.rs:2018-2024 | library/stdarch/crates/core_arch/src/x86/avx512dq.rs:2099-2105 | library/stdarch/crates/core_arch/src/x86/avx512dq.rs:2167-2173 | library/stdarch/crates/core_arch/src/x86/avx512dq.rs:2237-2243 | library/stdarch/crates/core_arch/src/x86/avx512vbmi2.rs:1408-1414 | library/stdarch/crates/core_arch/src/x86/avx512vbmi2.rs:1465-1471 | library/stdarch/crates/core_arch/src/x86/avx512vbmi2.rs:1522-1528 | library/stdarch/crates/core_arch/src/x86/avx512vbmi2.rs:1579-1585 | library/stdarch/crates/core_arch/src/x86/avx512vbmi2.rs:1636-1642 | library/stdarch/crates/core_arch/src/x86/avx512vbmi2.rs:1693-1699 | library/stdarch/crates/core_arch/src/x86/avx512vbmi2.rs:1750-1756 | library/stdarch/crates/core_arch/src/x86/avx512vbmi2.rs:1807-1813 | library/stdarch/crates/core_arch/src/x86/avx512vbmi2.rs:1864-1870 | library/stdarch/crates/core_arch/src/x86/avx512vbmi2.rs:1921-1927 | library/stdarch/crates/core_arch/src/x86/avx512vbmi2.rs:1978-1984 | library/stdarch/crates/core_arch/src/x86/avx512vbmi2.rs:2035-2041 | library/stdarch/crates/core_arch/src/x86/avx512vbmi2.rs:2092-2098 | library/stdarch/crates/core_arch/src/x86/avx512vbmi2.rs:2149-2155 | library/stdarch/crates/core_arch/src/x86/avx512vbmi2.rs:2206-2212 | library/stdarch/crates/core_arch/src/x86/avx512vbmi2.rs:2263-2269 | library/stdarch/crates/core_arch/src/x86/avx512vbmi2.rs:2320-2326 | library/stdarch/crates/core_arch/src/x86/avx512vbmi2.rs:2377-2383 \u2014 there are 24 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 24 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/stdarch/crates/core_arch/src/x86/avx512dq.rs:1882\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":"library/stdarch/crates/core_arch/src/x86/avx512dq.rs"},"region":{"startLine":1882}}}],"partialFingerprints":{"codehealthFindingId/v1":"53546e5d39bfe890660a6d272162519e3229530bbfb6977e3bc7d45b471d35fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): library/stdarch/crates/core_arch/src/x86/avx512dq.rs:5926-5930 | library/stdarch/crates/core_arch/src/x86/avx512dq.rs:6216-6220 | library/stdarch/crates/core_arch/src/x86/avx512fp16.rs:10258-10262 | library/stdarch/crates/core_arch/src/x86/avx512fp16.rs:11016-11020 \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":"library/stdarch/crates/core_arch/src/x86/avx512dq.rs"},"region":{"startLine":5926}}}],"partialFingerprints":{"codehealthFindingId/v1":"83e9bbe3b79f97ff298eeb7f2b86aeb2c97fcf52ee9b0614048e521e4a16327e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): library/stdarch/crates/core_arch/src/x86/avx512dq.rs:5985-5989 | library/stdarch/crates/core_arch/src/x86/avx512dq.rs:6275-6279 | library/stdarch/crates/core_arch/src/x86/avx512fp16.rs:10316-10320 | library/stdarch/crates/core_arch/src/x86/avx512fp16.rs:11077-11081 \u2014 there are 4 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/stdarch/crates/core_arch/src/x86/avx512dq.rs:5985\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":"library/stdarch/crates/core_arch/src/x86/avx512dq.rs"},"region":{"startLine":5985}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c6fe3f5fc74878e870f359b24e6ea2bbcfbef463e60f34de4dfd5ff3a46e153"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 16): library/stdarch/crates/core_arch/src/x86/avx512f.rs:21864-21872 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:21912-21920 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:21960-21968 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:22008-22016 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:22152-22160 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:22200-22208 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:22248-22256 | library/stdarch/crates/core_arch/src/x86/avx512vbmi2.rs:503-511 | library/stdarch/crates/core_arch/src/x86/avx512vbmi2.rs:551-559 | library/stdarch/crates/core_arch/src/x86/avx512vbmi2.rs:599-607 | library/stdarch/crates/core_arch/src/x86/avx512vbmi2.rs:647-655 | library/stdarch/crates/core_arch/src/x86/avx512vbmi2.rs:695-703 | library/stdarch/crates/core_arch/src/x86/avx512vbmi2.rs:743-751 | library/stdarch/crates/core_arch/src/x86/avx512vbmi2.rs:791-799 | library/stdarch/crates/core_arch/src/x86/avx512vbmi2.rs:839-847 | library/stdarch/crates/core_arch/src/x86/avx512vbmi2.rs:887-895 \u2014 there are 16 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 16 sites; resolving a subset leaves the remainder to drift apart. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060a\u0060 to \u0060__m512i\u0060 in one and \u0060__m256i\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":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":21864}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c40c225170a25c6ba3e311031870d863c6f3a23a622cebf3ce02de50c98e3bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): library/stdarch/crates/core_arch/src/x86/avx512f.rs:37973-37981 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:38010-38018 | library/stdarch/crates/core_arch/src/x86/avx512fp16.rs:1201-1209 \u2014 before extracting anything, compare \u0060library/stdarch/crates/core_arch/src/x86/avx512f.rs\u0060 and \u0060library/stdarch/crates/core_arch/src/x86/avx512fp16.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 31 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060a\u0060 to \u0060__m128\u0060 in one and \u0060__m128d\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":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":37973}}}],"partialFingerprints":{"codehealthFindingId/v1":"917c567623196030fa59419485d6c677d8862464d05a0797b2170729f4e6ef09"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 9): library/stdarch/crates/core_arch/src/x86/avx512f.rs:43328-43335 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:43352-43359 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:43375-43382 | library/stdarch/crates/core_arch/src/x86_64/avx512f.rs:171-178 | library/stdarch/crates/core_arch/src/x86_64/avx512f.rs:194-201 | library/stdarch/crates/core_arch/src/x86_64/avx512f.rs:217-224 | library/stdarch/crates/core_arch/src/x86_64/avx512f.rs:240-247 | library/stdarch/crates/core_arch/src/x86_64/avx512f.rs:263-270 | library/stdarch/crates/core_arch/src/x86_64/avx512f.rs:286-293 \u2014 there are 9 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 9 sites; resolving a subset leaves the remainder to drift apart. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060a\u0060 to \u0060__m128d\u0060 in one and \u0060__m128\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":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":43328}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab1d0a60a5c4cf13921d82c8bdf7cea93f065c7736ef8b0da1899b46791c0f34"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/bootstrap/src/core/build_steps/compile.rs:1767-1771 | src/bootstrap/src/core/build_steps/tool.rs:1081-1085 \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/bootstrap/src/core/build_steps/compile.rs"},"region":{"startLine":1767}}}],"partialFingerprints":{"codehealthFindingId/v1":"7470d954d8de34f0da478882aeec27928259882acfe3a8e3deaf9a067c9d6340"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/tools/clippy/clippy_lints/src/operators/arithmetic_side_effects.rs:311-320 | src/tools/clippy/clippy_lints/src/operators/numeric_arithmetic.rs:89-99 \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/tools/clippy/clippy_lints/src/operators/arithmetic_side_effects.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"c82edede5ed1c791205a05fce1ea15c3d6c5dd7471435226444120e6b75083ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-def/src/item_scope.rs:977-982 | src/tools/rust-analyzer/crates/hir/src/lib.rs:2705-2710 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060db\u0060 to \u0060\u0026dyn SourceDatabase\u0060 in one and \u0060\u0026dyn HirDatabase\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/tools/rust-analyzer/crates/hir-def/src/item_scope.rs"},"region":{"startLine":977}}}],"partialFingerprints":{"codehealthFindingId/v1":"f44b0f49d3c38626416c5af08a08babec366941ce4ea0f4d6bc53b2017b0ba13"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-ty/src/lower.rs:2699-2703 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/util.rs:502-506 \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/tools/rust-analyzer/crates/hir-ty/src/lower.rs"},"region":{"startLine":2699}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a7db90e5a6a1a6b37e67c5b5ff887b21868d04d988ddb94b06b9fdcabe67522"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-ty/src/next_solver/consts.rs:69-77 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/ty.rs:93-101 \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/tools/rust-analyzer/crates/hir-ty/src/next_solver/consts.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"502a77e09a84039b7514dfc366a43f687a398a845e4fdac449bf0fdc1d67e457"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/tools/rust-analyzer/crates/hir/src/lib.rs:2797-2804 | src/tools/rust-analyzer/crates/hir/src/lib.rs:2818-2825 | src/tools/rust-analyzer/crates/ide-db/src/defs.rs:929-936 \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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060db\u0060 to \u0060\u0026dyn HirDatabase\u0060 in one and \u0060\u0026dyn hir::db::HirDatabase\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/tools/rust-analyzer/crates/hir/src/lib.rs"},"region":{"startLine":2797}}}],"partialFingerprints":{"codehealthFindingId/v1":"35d36c6628649dc33b30233d4dabbdb161949c63a4fb17cd953b040a7fe25846"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): compiler/rustc_codegen_cranelift/src/intrinsics/llvm_aarch64.rs:670-699 | compiler/rustc_codegen_cranelift/src/intrinsics/llvm_x86.rs:32-63 \u2014 before extracting anything, compare \u0060compiler/rustc_codegen_cranelift/src/intrinsics/llvm_aarch64.rs\u0060 and \u0060compiler/rustc_codegen_cranelift/src/intrinsics/llvm_x86.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 92 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 \u0060compiler/rustc_codegen_cranelift/src/intrinsics/llvm_aarch64.rs:670\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":"compiler/rustc_codegen_cranelift/src/intrinsics/llvm_aarch64.rs"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"11fb4abc321daa1e589385583505e2ce1bb46b6e2f85736f6e92e7e19c02e661"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 12): compiler/rustc_codegen_cranelift/src/intrinsics/llvm_aarch64.rs:732-743 | compiler/rustc_codegen_cranelift/src/intrinsics/llvm_aarch64.rs:803-814 | compiler/rustc_codegen_cranelift/src/intrinsics/llvm_aarch64.rs:910-921 | compiler/rustc_codegen_cranelift/src/intrinsics/llvm_aarch64.rs:1103-1114 | compiler/rustc_codegen_cranelift/src/intrinsics/llvm_x86.rs:975-998 | compiler/rustc_codegen_cranelift/src/intrinsics/llvm_x86.rs:1001-1024 | compiler/rustc_codegen_cranelift/src/intrinsics/llvm_x86.rs:1027-1050 | compiler/rustc_codegen_cranelift/src/intrinsics/llvm_x86.rs:1091-1114 | compiler/rustc_codegen_cranelift/src/intrinsics/llvm_x86.rs:1117-1140 | compiler/rustc_codegen_cranelift/src/intrinsics/llvm_x86.rs:1143-1166 | compiler/rustc_codegen_cranelift/src/intrinsics/llvm_x86.rs:1196-1224 | compiler/rustc_codegen_cranelift/src/intrinsics/llvm_x86.rs:1227-1250 \u2014 before extracting anything, compare \u0060compiler/rustc_codegen_cranelift/src/intrinsics/llvm_aarch64.rs\u0060 and \u0060compiler/rustc_codegen_cranelift/src/intrinsics/llvm_x86.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 92 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 \u0060compiler/rustc_codegen_cranelift/src/intrinsics/llvm_aarch64.rs:732\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":"compiler/rustc_codegen_cranelift/src/intrinsics/llvm_aarch64.rs"},"region":{"startLine":732}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff80cac3f9ef24e7268a7d551b1dfc1e34a2e87dbadf4d666ae9752436c27c4c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): compiler/rustc_codegen_cranelift/src/intrinsics/llvm_aarch64.rs:776-782 | compiler/rustc_codegen_cranelift/src/intrinsics/llvm_aarch64.rs:883-889 | compiler/rustc_codegen_cranelift/src/intrinsics/llvm_x86.rs:734-756 \u2014 before extracting anything, compare \u0060compiler/rustc_codegen_cranelift/src/intrinsics/llvm_aarch64.rs\u0060 and \u0060compiler/rustc_codegen_cranelift/src/intrinsics/llvm_x86.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 92 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 \u0060compiler/rustc_codegen_cranelift/src/intrinsics/llvm_aarch64.rs:776\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":"compiler/rustc_codegen_cranelift/src/intrinsics/llvm_aarch64.rs"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"62b45603703c9f0cc910caceed04c115db63c11840c5f355c77225a551b5c7b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/bootstrap/src/core/build_steps/llvm.rs:1464-1473 | src/bootstrap/src/core/build_steps/llvm.rs:1734-1754 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/bootstrap/src/core/build_steps/llvm.rs:1464\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/bootstrap/src/core/build_steps/llvm.rs"},"region":{"startLine":1464}}}],"partialFingerprints":{"codehealthFindingId/v1":"579408004ad560c46902966dcd8b87c6e90aee9ea2aff3069e03ed0399b5005a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/tools/compiletest/src/runtest/debuginfo.rs:73-82 | src/tools/compiletest/src/runtest/debuginfo.rs:449-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/tools/compiletest/src/runtest/debuginfo.rs:449\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/tools/compiletest/src/runtest/debuginfo.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f49a730ec9b861f9862a39192c74b8f892fbeecce2c2404aafdaf5411ddb89d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): compiler/rustc_mir_transform/src/validate.rs:893-908 | compiler/rustc_mir_transform/src/validate.rs:1464-1477 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_mir_transform/src/validate.rs:893\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":"compiler/rustc_mir_transform/src/validate.rs"},"region":{"startLine":893}}}],"partialFingerprints":{"codehealthFindingId/v1":"674c58e39a9a918a71be1bab382818150a3f337e78daf566d5ec26d7fac7fdac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): compiler/rustc_infer/src/infer/lexical_region_resolve/mod.rs:402-417 | compiler/rustc_infer/src/infer/lexical_region_resolve/mod.rs:435-450 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_infer/src/infer/lexical_region_resolve/mod.rs:402\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":"compiler/rustc_infer/src/infer/lexical_region_resolve/mod.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"a160e6d89d2d444e3c3f1a99afccb6ae436778eec0da51be4e093e8802fb1a82"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): library/stdarch/crates/stdarch-gen-loongarch/src/main.rs:1393-1408 | library/stdarch/crates/stdarch-gen-loongarch/src/main.rs:1413-1428 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/stdarch/crates/stdarch-gen-loongarch/src/main.rs:1393\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":"library/stdarch/crates/stdarch-gen-loongarch/src/main.rs"},"region":{"startLine":1393}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bfd00962c9c010e00e8ef1e8e615736d7e6d12634de7732f70a8943b41b9dc7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): src/librustdoc/html/render/print_item.rs:879-893 | src/librustdoc/html/render/print_item.rs:895-910 | src/librustdoc/html/render/print_item.rs:912-926 \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/librustdoc/html/render/print_item.rs:879\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/librustdoc/html/render/print_item.rs"},"region":{"startLine":879}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6b79ee7028fe2556b88d760153212d45c91dd3adb9603e17c00d1d485db0ec6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): compiler/rustc_trait_selection/src/diagnostics.rs:539-549 | compiler/rustc_trait_selection/src/diagnostics.rs:574-588 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_trait_selection/src/diagnostics.rs:539\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":"compiler/rustc_trait_selection/src/diagnostics.rs"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee17fe3a29919ab8fa5ce12bde2901b4d70d601e600ae3b470fa20c2ea722e30"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/tools/clippy/clippy_lints/src/doc/mod.rs:1186-1200 | src/tools/clippy/clippy_lints/src/doc/mod.rs:1230-1244 \u2014 both copies are in the same file, so extract the block 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/tools/clippy/clippy_lints/src/doc/mod.rs"},"region":{"startLine":1186}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9f0f8aee5f5ab275287ef876cecdba65792f3cda3561def5b38b2c152257203"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/tools/miri/src/shims/unix/mem.rs:160-174 | src/tools/miri/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/tools/miri/src/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/tools/miri/src/shims/unix/mem.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"f841ae65feb328c125926367429811a9b085cd0f4a500ba20ff8acf32af49905"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): library/compiler-builtins/libm/src/math/arch/x86/fma.rs:112-126 | library/compiler-builtins/libm/src/math/arch/x86/fma.rs:132-146 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/compiler-builtins/libm/src/math/arch/x86/fma.rs:112\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060y\u0060 to \u0060f64\u0060 in one and \u0060f32\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":"library/compiler-builtins/libm/src/math/arch/x86/fma.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e8f2a1c47bdd443f44c3d1d20ec5423243f5fb7a9ad9a458a4281dac1439f93"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): library/compiler-builtins/libm/src/math/arch/x86/fma.rs:72-86 | library/compiler-builtins/libm/src/math/arch/x86/fma.rs:92-106 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/compiler-builtins/libm/src/math/arch/x86/fma.rs:72\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060y\u0060 to \u0060f64\u0060 in one and \u0060f32\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":"library/compiler-builtins/libm/src/math/arch/x86/fma.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaf66f92c6d38d3cee5c51050a4b95025d6887ebab3cf4cf1af9349655a23b84"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/tools/clippy/clippy_lints_internal/src/collapsible_span_lint_calls.rs:217-231 | src/tools/clippy/clippy_lints_internal/src/collapsible_span_lint_calls.rs:245-258 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/clippy/clippy_lints_internal/src/collapsible_span_lint_calls.rs:217\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/tools/clippy/clippy_lints_internal/src/collapsible_span_lint_calls.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ceb4fbe5e9a5fc89539951899b3dbb2f61c9877b3c805c899ac37415bab82b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/tools/compiletest/src/directives/needs.rs:22-33 | src/tools/compiletest/src/directives/needs.rs:64-77 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/compiletest/src/directives/needs.rs:22\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/tools/compiletest/src/directives/needs.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"daafe71659b571c0825a164ec76e9112ba2559ea55f0895c74401343d7d2bd25"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): compiler/rustc_parse_format/src/lib.rs:977-990 | compiler/rustc_parse_format/src/lib.rs:994-1007 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_parse_format/src/lib.rs:977\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":"compiler/rustc_parse_format/src/lib.rs"},"region":{"startLine":977}}}],"partialFingerprints":{"codehealthFindingId/v1":"bed77360f790c758556372e14dc317e3ba9840631e636ee1dc061c9dc5c3184f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/tools/rust-analyzer/crates/rust-analyzer/src/cli/analysis_stats.rs:1011-1024 | src/tools/rust-analyzer/crates/rust-analyzer/src/cli/analysis_stats.rs:1115-1128 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/rust-analyzer/src/cli/analysis_stats.rs:1011\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/tools/rust-analyzer/crates/rust-analyzer/src/cli/analysis_stats.rs"},"region":{"startLine":1011}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed224c510011d1955be8259869728e780b1e546102b22bce17bfa948fd7a6118"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): compiler/rustc_borrowck/src/type_check/relate_tys.rs:405-416 | compiler/rustc_infer/src/infer/relate/lattice.rs:162-175 \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 \u0060compiler/rustc_infer/src/infer/relate/lattice.rs:162\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":"compiler/rustc_borrowck/src/type_check/relate_tys.rs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf2f49c6dd981af560f525801069da800157e2aecf9aa03249e3d2e1a0acf70c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): compiler/rustc_codegen_cranelift/src/intrinsics/llvm_aarch64.rs:202-214 | compiler/rustc_codegen_cranelift/src/intrinsics/llvm_aarch64.rs:296-308 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_codegen_cranelift/src/intrinsics/llvm_aarch64.rs:202\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":"compiler/rustc_codegen_cranelift/src/intrinsics/llvm_aarch64.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"e131d966c2250a87b7af3471cf01da8882b7e019ef59f40b7be4b83e0016d7e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/tools/miri/src/shims/unix/tcp_socket.rs:613-624 | src/tools/miri/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/tools/miri/src/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/tools/miri/src/shims/unix/tcp_socket.rs"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d35ca7df9ace70e5ea15cc560f44f4aef05d8966eeb45f67bfa9e152cb21789"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): compiler/rustc_codegen_cranelift/src/intrinsics/llvm_aarch64.rs:201-213 | compiler/rustc_codegen_cranelift/src/intrinsics/llvm_aarch64.rs:216-228 | compiler/rustc_codegen_cranelift/src/intrinsics/llvm_aarch64.rs:295-307 \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 \u0060compiler/rustc_codegen_cranelift/src/intrinsics/llvm_aarch64.rs:201\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":"compiler/rustc_codegen_cranelift/src/intrinsics/llvm_aarch64.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"659a621613e652c04b4bdd9ed8b4f637cd239b478cfe69e6af6d8fbe00412248"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/tools/clippy/clippy_lints/src/mem_replace.rs:199-211 | src/tools/clippy/clippy_lints/src/mem_replace.rs:222-234 \u2014 both copies are in the same file, so extract the block 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/tools/clippy/clippy_lints/src/mem_replace.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d1e8b62053e49801bc36cb69d7f31245ecee6f6829285ef4ca6fb103f4c9c18"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): compiler/rustc_resolve/src/late/diagnostics.rs:4607-4619 | compiler/rustc_resolve/src/late/diagnostics.rs:4620-4631 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_resolve/src/late/diagnostics.rs:4607\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":"compiler/rustc_resolve/src/late/diagnostics.rs"},"region":{"startLine":4607}}}],"partialFingerprints":{"codehealthFindingId/v1":"aabeaba1955122021cdb3b088dd989851160958d8a451635fe8b1cc4ab2541f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): compiler/rustc_parse_format/src/lib.rs:906-917 | compiler/rustc_parse_format/src/lib.rs:1017-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 \u0060compiler/rustc_parse_format/src/lib.rs:906\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":"compiler/rustc_parse_format/src/lib.rs"},"region":{"startLine":906}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b718158529b7574464d4ead9734db8df88c6606eba7455efe46df1b20ac970f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/tools/run-make-support/src/fs.rs:276-287 | src/tools/run-make-support/src/fs.rs:309-320 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/run-make-support/src/fs.rs:276\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/tools/run-make-support/src/fs.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"123f582877373e597e274e0a8b11edc7834d8d384ebbb1310b5a8713e61081a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/tools/miri/src/shims/unix/fs.rs:1034-1045 | src/tools/miri/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/tools/miri/src/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/tools/miri/src/shims/unix/fs.rs"},"region":{"startLine":1034}}}],"partialFingerprints":{"codehealthFindingId/v1":"b27f64ad5ccf42e33babe27953b3ef683c0eea0669abec4623e1bc7c4854e369"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/tools/rustfmt/src/patterns.rs:190-201 | src/tools/rustfmt/src/patterns.rs:216-227 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rustfmt/src/patterns.rs:190\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/tools/rustfmt/src/patterns.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"74216a04c8ad2dbb358c3b62cb0ea80e5eae93e2c85698e6255d20b46e8995f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): compiler/rustc_codegen_cranelift/src/intrinsics/llvm_aarch64.rs:188-199 | compiler/rustc_codegen_cranelift/src/intrinsics/llvm_aarch64.rs:282-293 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_codegen_cranelift/src/intrinsics/llvm_aarch64.rs:188\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":"compiler/rustc_codegen_cranelift/src/intrinsics/llvm_aarch64.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"bad35af3b0664ec89fc49456794c0c73f19b73eab0e341845b86518610ea980e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): library/stdarch/crates/intrinsic-test/src/loongarch/types.rs:149-160 | library/stdarch/crates/intrinsic-test/src/loongarch/types.rs:163-174 | library/stdarch/crates/intrinsic-test/src/loongarch/types.rs:177-188 | library/stdarch/crates/intrinsic-test/src/loongarch/types.rs:191-202 \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 \u0060library/stdarch/crates/intrinsic-test/src/loongarch/types.rs:149\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":"library/stdarch/crates/intrinsic-test/src/loongarch/types.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0cd92fb375fa850ad208a3d4ab8a21a308cc191c0011edd97f12e26302574a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-ide/src/display.rs:1551-1558 | src/tools/rust-analyzer/crates/hir-ide/src/display.rs:1610-1621 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/hir-ide/src/display.rs:1551\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/tools/rust-analyzer/crates/hir-ide/src/display.rs"},"region":{"startLine":1551}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e8bf576a77430733533e2cc1a8221d5ba827b0049cc4930b3d5ce83350d2563"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): compiler/rustc_attr_parsing/src/diagnostics.rs:1601-1612 | compiler/rustc_attr_parsing/src/diagnostics.rs:1636-1647 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_attr_parsing/src/diagnostics.rs:1601\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060compiler/rustc_attr_parsing/src/diagnostics.rs:1634\u0060 calls \u0060description\u0060 and \u0060compiler/rustc_attr_parsing/src/diagnostics.rs:1600\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":"compiler/rustc_attr_parsing/src/diagnostics.rs"},"region":{"startLine":1601}}}],"partialFingerprints":{"codehealthFindingId/v1":"926ed71f0a8ff80b38af581260229fb87b3df57dd0537d47f89bca8b58c7f597"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): compiler/rustc_interface/src/util.rs:137-148 | compiler/rustc_interface/src/util.rs:151-162 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_interface/src/util.rs:137\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":"compiler/rustc_interface/src/util.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"a492c7433fdaf21cd95df4b12cc18ad22bed62f099d7c47aefc6ad6c7f7a9766"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): library/stdarch/crates/intrinsic-test/src/loongarch/types.rs:205-216 | library/stdarch/crates/intrinsic-test/src/loongarch/types.rs:219-230 | library/stdarch/crates/intrinsic-test/src/loongarch/types.rs:233-244 | library/stdarch/crates/intrinsic-test/src/loongarch/types.rs:247-258 \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 \u0060library/stdarch/crates/intrinsic-test/src/loongarch/types.rs:205\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":"library/stdarch/crates/intrinsic-test/src/loongarch/types.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"0334ccc789455ffd52de9c8fa72b285d964f215ecbc851615567eda78706f166"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 6): compiler/rustc_codegen_cranelift/src/intrinsics/llvm_aarch64.rs:342-352 | compiler/rustc_codegen_cranelift/src/intrinsics/llvm_aarch64.rs:354-364 | compiler/rustc_codegen_cranelift/src/intrinsics/llvm_aarch64.rs:366-376 | compiler/rustc_codegen_cranelift/src/intrinsics/llvm_aarch64.rs:378-388 | compiler/rustc_codegen_cranelift/src/intrinsics/llvm_aarch64.rs:390-400 | compiler/rustc_codegen_cranelift/src/intrinsics/llvm_aarch64.rs:402-412 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_codegen_cranelift/src/intrinsics/llvm_aarch64.rs:342\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":"compiler/rustc_codegen_cranelift/src/intrinsics/llvm_aarch64.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"09cea3f8e5a640c87ac5110ef860cc70140a2f52c4c7f9e08801c4d80706a405"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): compiler/rustc_codegen_cranelift/src/intrinsics/llvm_x86.rs:936-946 | compiler/rustc_codegen_cranelift/src/intrinsics/llvm_x86.rs:955-965 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_codegen_cranelift/src/intrinsics/llvm_x86.rs:936\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":"compiler/rustc_codegen_cranelift/src/intrinsics/llvm_x86.rs"},"region":{"startLine":936}}}],"partialFingerprints":{"codehealthFindingId/v1":"47140908fbe7b75aab6d3c07356af463e0ae8fa9954a54b265b2d922b04bfc4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/tools/clippy/clippy_lints/src/arbitrary_source_item_ordering.rs:204-214 | src/tools/clippy/clippy_lints/src/arbitrary_source_item_ordering.rs:267-277 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/clippy/clippy_lints/src/arbitrary_source_item_ordering.rs:204\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060before_item\u0060 to \u0060ImplItemId\u0060 in one and \u0060TraitItemId\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/tools/clippy/clippy_lints/src/arbitrary_source_item_ordering.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4c3069eb659be7c0b7c3c60f9d42463691bd0eeef5a3e2d189845960edecddb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/tools/miri/src/shims/unix/linux_like/thread.rs:28-38 | src/tools/miri/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/tools/miri/src/shims/unix/linux_like/thread.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfbfa57583c668e94d9991a9eb586465408f24202d2a506b65137d65f849771a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/tools/miri/src/shims/unix/socket.rs:1187-1196 | src/tools/miri/src/shims/unix/socket.rs:1227-1237 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/miri/src/shims/unix/socket.rs:1187\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/tools/miri/src/shims/unix/socket.rs"},"region":{"startLine":1187}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d4e83ec35e692d38d6f0c3cab518b2f2fb3f01ed429d2ac9874ed0ac52c8051"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/bootstrap/src/core/build_steps/compile.rs:1726-1734 | src/bootstrap/src/core/build_steps/compile.rs:1795-1805 \u2014 both copies are in the same file, so extract the block 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/bootstrap/src/core/build_steps/compile.rs"},"region":{"startLine":1726}}}],"partialFingerprints":{"codehealthFindingId/v1":"b83754e9d5ed62096e952155f34f5b7308189abf22816e8825ac2f1643de78c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): src/tools/miri/src/shims/unix/foreign_items.rs:943-953 | src/tools/miri/src/shims/windows/foreign_items.rs:617-625 | src/tools/miri/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/tools/miri/src/shims/unix/foreign_items.rs:943\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/tools/miri/src/shims/unix/foreign_items.rs"},"region":{"startLine":943}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b6c987adc762f7ea72980ce1093a837b1cf97720dca2f9e05faab4137c8f296"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): compiler/rustc_builtin_macros/src/format_foreign/printf/mod.rs:462-472 | compiler/rustc_builtin_macros/src/format_foreign/printf/mod.rs:494-504 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_builtin_macros/src/format_foreign/printf/mod.rs:462\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":"compiler/rustc_builtin_macros/src/format_foreign/printf/mod.rs"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"18cd2136e32971f95fe59ffc3b84bf5f45ed87aaa501d2b7af9435f55b8c7086"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): library/stdarch/crates/stdarch-gen-hexagon/src/hvx.rs:313-323 | library/stdarch/crates/stdarch-gen-hexagon/src/scalar.rs:217-227 \u2014 before extracting anything, compare \u0060library/stdarch/crates/stdarch-gen-hexagon/src/hvx.rs\u0060 and \u0060library/stdarch/crates/stdarch-gen-hexagon/src/scalar.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 55 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 \u0060library/stdarch/crates/stdarch-gen-hexagon/src/hvx.rs:313\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":"library/stdarch/crates/stdarch-gen-hexagon/src/hvx.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"2097ba746984f2f903ed283d39320bbd8b2e6113df3ca1ece742dbbc2a62cca8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): compiler/rustc_codegen_gcc/build_system/src/fuzz.rs:170-193 | compiler/rustc_codegen_gcc/build_system/src/fuzz.rs:204-227 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_codegen_gcc/build_system/src/fuzz.rs:170\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_gcc/build_system/src/fuzz.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a0b788bba8ce48030e2a5e8a4be9c9c98bba10e7ca82244704f6502ad9ac4e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-ty/src/infer/coerce.rs:357-367 | src/tools/rust-analyzer/crates/hir-ty/src/infer/coerce.rs:828-832 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tools/rust-analyzer/crates/hir-ty/src/infer/coerce.rs:357\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/tools/rust-analyzer/crates/hir-ty/src/infer/coerce.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1a430873d90035bd400c3d8bb0eb76b33776fe037f1a22c04810888f9370217"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): compiler/rustc_codegen_cranelift/src/intrinsics/llvm_aarch64.rs:987-997 | compiler/rustc_codegen_cranelift/src/intrinsics/llvm_aarch64.rs:1011-1021 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_codegen_cranelift/src/intrinsics/llvm_aarch64.rs:987\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":"compiler/rustc_codegen_cranelift/src/intrinsics/llvm_aarch64.rs"},"region":{"startLine":987}}}],"partialFingerprints":{"codehealthFindingId/v1":"b618430ec2390e23aed6a67d434edfc941fa8b5a8a98ceadff5a845bf1150b9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): compiler/rustc_parse/src/diagnostics.rs:1543-1553 | compiler/rustc_parse/src/diagnostics.rs:1609-1619 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_parse/src/diagnostics.rs:1543\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":"compiler/rustc_parse/src/diagnostics.rs"},"region":{"startLine":1543}}}],"partialFingerprints":{"codehealthFindingId/v1":"520c48a51fc1ee2293e04afd644aba1e6638cf11ecd594528a826f5d5cff1d68"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): compiler/rustc_codegen_cranelift/src/intrinsics/llvm_aarch64.rs:218-228 | compiler/rustc_codegen_cranelift/src/intrinsics/llvm_aarch64.rs:230-240 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_codegen_cranelift/src/intrinsics/llvm_aarch64.rs:218\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/src/intrinsics/llvm_aarch64.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"42cfca07985d35d3343883ea770362066dba19a97b3e0860ff656b9a42f98e47"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): compiler/rustc_hir_typeck/src/fn_ctxt/checks.rs:2955-2964 | compiler/rustc_hir_typeck/src/fn_ctxt/checks.rs:2969-2978 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_hir_typeck/src/fn_ctxt/checks.rs:2955\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":"compiler/rustc_hir_typeck/src/fn_ctxt/checks.rs"},"region":{"startLine":2955}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad0ce563b92d737e835f18cf669c07e29e17a63d4e98b0223285f9e9bf3349c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): compiler/rustc_sanitizers/src/cfi/typeid/itanium_cxx_abi/encode.rs:289-298 | compiler/rustc_sanitizers/src/cfi/typeid/itanium_cxx_abi/mod.rs:50-59 \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 \u0060compiler/rustc_sanitizers/src/cfi/typeid/itanium_cxx_abi/encode.rs:289\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_sanitizers/src/cfi/typeid/itanium_cxx_abi/encode.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"435502c96c6a7968e96efa124d295dd38cf8d6c71b49f4e133244f845b755bbb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/tools/miri/src/intrinsics/aarch64.rs:338-347 | src/tools/miri/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/tools/miri/src/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/tools/miri/src/intrinsics/aarch64.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"19fbdc75a65647c16a7f69d8d43cf52ac7169b371d410e82cc87e98d214ebd57"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/tools/tidy/src/rustdoc_css_themes.rs:40-49 | src/tools/tidy/src/rustdoc_css_themes.rs:51-60 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/tidy/src/rustdoc_css_themes.rs:40\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also 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/tools/tidy/src/rustdoc_css_themes.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"7afd1591c57498d0fe439e7ab19723f4ed0e744270eb5b3e50114c264d863795"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-def/src/expr_store/pretty.rs:908-917 | src/tools/rust-analyzer/crates/hir-def/src/expr_store/pretty.rs:1010-1019 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/hir-def/src/expr_store/pretty.rs:908\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/tools/rust-analyzer/crates/hir-def/src/expr_store/pretty.rs"},"region":{"startLine":908}}}],"partialFingerprints":{"codehealthFindingId/v1":"d900fd0c05ebf39160bf1b8d6d65d426bbf1548cfda6ab201133173bf9bcb647"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): src/tools/rust-analyzer/crates/hir-ide/src/display.rs:1769-1778 | src/tools/rust-analyzer/crates/hir-ide/src/display.rs:1793-1802 | src/tools/rust-analyzer/crates/hir-ide/src/display.rs:1817-1826 \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/tools/rust-analyzer/crates/hir-ide/src/display.rs:1769\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/tools/rust-analyzer/crates/hir-ide/src/display.rs:1828\u0060 calls \u0060async_gen_item_ty_from_yield_ty\u0060, \u0060lang_items\u0060, \u0060unwrap_or\u0060 and \u0060src/tools/rust-analyzer/crates/hir-ide/src/display.rs:1780\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/tools/rust-analyzer/crates/hir-ide/src/display.rs"},"region":{"startLine":1769}}}],"partialFingerprints":{"codehealthFindingId/v1":"d97d8fccf407cd36149bab4b770c4d50f068896b902d95032226ccb686cdb1f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/bootstrap/src/core/build_steps/llvm.rs:1056-1064 | src/bootstrap/src/core/build_steps/llvm.rs:1082-1091 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/bootstrap/src/core/build_steps/llvm.rs:1056\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/bootstrap/src/core/build_steps/llvm.rs"},"region":{"startLine":1056}}}],"partialFingerprints":{"codehealthFindingId/v1":"0be57bf7534772c63e9593e504e8382715a907c0fc69fbf1f8a47905c14e4892"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): compiler/rustc_middle/src/mir/pretty.rs:966-975 | compiler/rustc_public/src/mir/pretty.rs:154-162 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_middle/src/mir/pretty.rs:966\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/mir/pretty.rs"},"region":{"startLine":966}}}],"partialFingerprints":{"codehealthFindingId/v1":"41f3d414bc511c925a7941f5ff76e042c0757f1933e16365b15287d948cf84b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): library/alloc/src/collections/linked_list.rs:85-94 | library/alloc/src/collections/linked_list.rs:122-131 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/alloc/src/collections/linked_list.rs:85\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/alloc/src/collections/linked_list.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf8ed91afb541281897afcbf1879709159ce0f2efcd6b57322b6b7efb3736621"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/tools/miri/src/borrow_tracker/stacked_borrows/mod.rs:701-710 | src/tools/miri/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/tools/miri/src/borrow_tracker/stacked_borrows/mod.rs"},"region":{"startLine":701}}}],"partialFingerprints":{"codehealthFindingId/v1":"71eac836565e6410f69a53ae5fa80074b9915baf79a8de41497a2e6b8148c76e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): compiler/rustc_codegen_llvm/src/builder.rs:477-485 | compiler/rustc_codegen_llvm/src/builder.rs:1447-1455 \u2014 both copies are in the same file, so extract the block 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":"compiler/rustc_codegen_llvm/src/builder.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"2740860fab0937e9265cca82aad5c58869a0bbd4f3d4c6f6964f0a9de2a67fb4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/tools/miri/src/shims/windows/foreign_items.rs:1203-1211 | src/tools/miri/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/tools/miri/src/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/tools/miri/src/shims/windows/foreign_items.rs"},"region":{"startLine":1203}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cae86a4727812a2abfe414d3666fac81230e5fe2965b96981d37b1bc40aedba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): compiler/rustc_session/src/options.rs:1359-1367 | compiler/rustc_structures/src/sanitizer_set.rs:134-142 \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":"compiler/rustc_session/src/options.rs"},"region":{"startLine":1359}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbe75d18e4db9a9ef274e637b54582ac65135eeaaf57d3eb23547c010fdebfb8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/tools/rust-analyzer/crates/rust-analyzer/src/handlers/request.rs:2235-2243 | src/tools/rust-analyzer/crates/rust-analyzer/src/handlers/request.rs:2280-2288 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/rust-analyzer/src/handlers/request.rs:2235\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/tools/rust-analyzer/crates/rust-analyzer/src/handlers/request.rs"},"region":{"startLine":2235}}}],"partialFingerprints":{"codehealthFindingId/v1":"586f776cb5cadc04eca97675cd1b5807ba5151607677bf8f076e17ff3f559e62"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_from_to_tryfrom.rs:55-63 | src/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_into_to_from.rs:68-76 \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/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_from_to_tryfrom.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/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_from_to_tryfrom.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"62abd0007915ffc807b564abd43c1389335e1266818d478f4a8f6b5848eaecb9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/tools/miri/src/shims/unix/fs.rs:813-821 | src/tools/miri/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/tools/miri/src/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/tools/miri/src/shims/unix/fs.rs"},"region":{"startLine":813}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4fe327612c98f52391decc63a888739934b13762bc6a16405afb83721103357"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-ty/src/mir/eval/shim.rs:635-643 | src/tools/rust-analyzer/crates/hir-ty/src/mir/eval/shim.rs:707-715 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/hir-ty/src/mir/eval/shim.rs:635\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/tools/rust-analyzer/crates/hir-ty/src/mir/eval/shim.rs"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fde1a022b7b80f61f25c5ce7310ecdfba4572545c7548459f497b435c0ced25"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/tools/miri/src/shims/unix/thread.rs:101-109 | src/tools/miri/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/tools/miri/src/shims/unix/thread.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"1abc15a67b59898bb42b20199787a9d788cb5f410b5bdf60fafbcc78c77e73cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): compiler/rustc_borrowck/src/region_infer/values.rs:446-454 | compiler/rustc_borrowck/src/region_infer/values.rs:457-465 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"compiler/rustc_borrowck/src/region_infer/values.rs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"7abf27405598d2f9bc234f8bb6ca0caeb8998f05949c9d501ff0dff80253eb51"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): library/stdarch/crates/stdarch-gen-arm/src/typekinds.rs:271-279 | library/stdarch/crates/stdarch-gen-arm/src/typekinds.rs:280-288 \u2014 both copies are in the same file, so extract the block 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":"library/stdarch/crates/stdarch-gen-arm/src/typekinds.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa6a066334a8be750ae1ed4a19fa52f15822c4778b0ce1a4916f98695ee03310"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): compiler/rustc_codegen_ssa/src/back/linker.rs:814-821 | compiler/rustc_codegen_ssa/src/back/linker.rs:1595-1603 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_codegen_ssa/src/back/linker.rs:814\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":"compiler/rustc_codegen_ssa/src/back/linker.rs"},"region":{"startLine":814}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ee0341252f76586183be2345280246710b22317cef8ea83eaeb4cad84e82b32"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/bootstrap/src/core/build_steps/llvm.rs:227-235 | src/bootstrap/src/core/build_steps/llvm.rs:1823-1830 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/bootstrap/src/core/build_steps/llvm.rs:227\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/bootstrap/src/core/build_steps/llvm.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"b95e315b669444732d0a343991c1ccd85a256801535819e0a2a096394e4ab3f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/tools/rust-analyzer/crates/cfg/src/cfg_expr.rs:64-72 | src/tools/rust-analyzer/crates/cfg/src/cfg_expr.rs:74-82 \u2014 both copies are in the same file, so extract the block 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/tools/rust-analyzer/crates/cfg/src/cfg_expr.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"78b476e73d3407af6653a493655bd5e63afc23c7101852b4d8ecbc57d55d8c2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/tools/compiletest/src/debuggers.rs:105-116 | src/tools/compiletest/src/debuggers.rs:126-137 \u2014 both copies are in the same file, so extract the block 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/tools/compiletest/src/debuggers.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"67fd2324914842b7b1565f0b4cfa66bfa7d8dcff66ef67a7ab5af26e8631df04"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/tools/miri/src/shims/unix/fs.rs:937-945 | src/tools/miri/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/tools/miri/src/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/tools/miri/src/shims/unix/fs.rs"},"region":{"startLine":937}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a78dfa209752809b4f042625459e7bae6ab5475e128ea9d852679bfcf93fba3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/tools/miri/src/shims/unix/macos/foreign_items.rs:340-348 | src/tools/miri/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/tools/miri/src/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/tools/miri/src/shims/unix/macos/foreign_items.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d57aafd1e69a01c2449f9e0f775391285f40ba960c67f657fedb3370b9534ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/tools/miri/src/shims/unix/fs.rs:1801-1808 | src/tools/miri/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/tools/miri/src/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/tools/miri/src/shims/unix/fs.rs"},"region":{"startLine":1801}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8f60448609611dffe7297a984c319dce72bc3f628918b5a8d64166b0ae5b9d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-ty/src/next_solver/def_id.rs:99-106 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/def_id.rs:113-120 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/hir-ty/src/next_solver/def_id.rs:99\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/tools/rust-analyzer/crates/hir-ty/src/next_solver/def_id.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b689742ee9a22cf568aa9067c4aa8159952c5433eb3fc44e29ca57e7a681d6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/tools/miri/src/shims/windows/foreign_items.rs:185-192 | src/tools/miri/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/tools/miri/src/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/tools/miri/src/shims/windows/foreign_items.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"f44bebf4094ed4c11291c90e855ead1c136c91bf5dac6694d90785c922c52152"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): compiler/rustc_expand/src/mbe/macro_rules.rs:1752-1759 | compiler/rustc_expand/src/mbe/macro_rules.rs:1790-1797 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_expand/src/mbe/macro_rules.rs:1752\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":"compiler/rustc_expand/src/mbe/macro_rules.rs"},"region":{"startLine":1752}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d9858127d6105199b949d697eaf1a8ba15091b9a2f219dbd73375a486fb3383"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/tools/rust-analyzer/crates/rust-analyzer/src/main_loop.rs:265-272 | src/tools/rust-analyzer/crates/rust-analyzer/src/reload.rs:646-653 \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/tools/rust-analyzer/crates/rust-analyzer/src/main_loop.rs:265\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/tools/rust-analyzer/crates/rust-analyzer/src/main_loop.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea6b1bbda1a4f3f6bce2dfee005060f1f579bec85fc2a7b0c091e865019a0b72"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): compiler/rustc_mir_build/src/thir/print.rs:959-965 | compiler/rustc_mir_build/src/thir/print.rs:983-990 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_mir_build/src/thir/print.rs:959\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":"compiler/rustc_mir_build/src/thir/print.rs"},"region":{"startLine":959}}}],"partialFingerprints":{"codehealthFindingId/v1":"76e224f23016f2055c3e035cea5eab5f8544b9fa1db2ef7d8d4e4fa262e6657c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/tools/miri/src/shims/unix/android/foreign_items.rs:68-75 | src/tools/miri/src/shims/unix/foreign_items.rs:499-504 \u2014 before extracting anything, compare \u0060src/tools/miri/src/shims/unix/android/foreign_items.rs\u0060 and \u0060src/tools/miri/src/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/tools/miri/src/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/tools/miri/src/shims/unix/android/foreign_items.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"03ba66d30df11d9e425f02840480714173304fc92c1bbdfc53ec35a1ac2ef021"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/tools/clippy/clippy_lints/src/methods/unnecessary_fold.rs:264-271 | src/tools/clippy/clippy_lints/src/methods/unnecessary_fold.rs:274-281 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/clippy/clippy_lints/src/methods/unnecessary_fold.rs:264\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/tools/clippy/clippy_lints/src/methods/unnecessary_fold.rs:273\u0060 calls \u0060check_fold_with_method\u0060 and \u0060src/tools/clippy/clippy_lints/src/methods/unnecessary_fold.rs:263\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/tools/clippy/clippy_lints/src/methods/unnecessary_fold.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf8c497e0328bb0cfa156fcd5a6a16ad7e8240b79dafeddd2d9790d2acd8a4a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/tools/miri/src/shims/unix/socket.rs:972-979 | src/tools/miri/src/shims/unix/socket.rs:1108-1115 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/miri/src/shims/unix/socket.rs:972\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/tools/miri/src/shims/unix/socket.rs"},"region":{"startLine":972}}}],"partialFingerprints":{"codehealthFindingId/v1":"673981bba4a33e900f94a070efc502d2188a9f41cc3a46dc9dc282e5f0822af7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/tools/miri/src/shims/unix/foreign_items.rs:372-379 | src/tools/miri/src/shims/unix/foreign_items.rs:437-443 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/miri/src/shims/unix/foreign_items.rs:372\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/tools/miri/src/shims/unix/foreign_items.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb1fcecd11b3dec4108730703379452fc0fbf0c45ae42de08e00f3185ee127dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-ty/src/infer/op.rs:339-346 | src/tools/rust-analyzer/crates/hir-ty/src/method_resolution.rs:241-248 \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/tools/rust-analyzer/crates/hir-ty/src/infer/op.rs:339\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/tools/rust-analyzer/crates/hir-ty/src/infer/op.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ea4c12af498b6324cb83feab86c0368555d1e44017238aa7f41da17f2b9c0af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): library/std/src/sys/net/connection/xous/udp.rs:83-90 | library/std/src/sys/net/connection/xous/udp.rs:296-303 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/std/src/sys/net/connection/xous/udp.rs:83\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/net/connection/xous/udp.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"e808548ce3d51f66b52b5563b194dff872bd68ae64fb882989704625ea9e04be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/tools/miri/src/shims/unix/foreign_items.rs:828-835 | src/tools/miri/src/shims/unix/foreign_items.rs:1236-1242 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/miri/src/shims/unix/foreign_items.rs:828\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/shims/unix/foreign_items.rs"},"region":{"startLine":828}}}],"partialFingerprints":{"codehealthFindingId/v1":"fce703c572e751007f9e6efac666a8281b9ed6c628fd990fc23ca953a8585876"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/bootstrap/src/core/build_steps/llvm.rs:222-229 | src/bootstrap/src/core/build_steps/llvm.rs:1355-1362 | src/bootstrap/src/core/build_steps/llvm.rs:1818-1825 \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/bootstrap/src/core/build_steps/llvm.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a5ba186ceefcf61e5e663bed3e7136a0d307b8545e4bf4c23ee5648435a919c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): compiler/rustc_builtin_macros/src/autodiff.rs:695-701 | compiler/rustc_builtin_macros/src/autodiff.rs:720-727 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_builtin_macros/src/autodiff.rs:695\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":"compiler/rustc_builtin_macros/src/autodiff.rs"},"region":{"startLine":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee5994c7a08376f2743fc1d353ddbbed3d463faa47428d98d1ccad936697d7b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): compiler/rustc_middle/src/mir/pretty.rs:1007-1014 | compiler/rustc_middle/src/mir/pretty.rs:1017-1024 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_middle/src/mir/pretty.rs:1007\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":"compiler/rustc_middle/src/mir/pretty.rs"},"region":{"startLine":1007}}}],"partialFingerprints":{"codehealthFindingId/v1":"19c0cea6869bd8bbb5d951e991c22781ab55565f9c2d0d296ed4b6243b68775b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/tools/miri/src/shims/unix/foreign_items.rs:197-204 | src/tools/miri/src/shims/unix/solarish/foreign_items.rs:223-230 \u2014 before extracting anything, compare \u0060src/tools/miri/src/shims/unix/foreign_items.rs\u0060 and \u0060src/tools/miri/src/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/tools/miri/src/shims/unix/foreign_items.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d4412072fc188cefc293b1a9d16aa75308c19df7580221bb539a6fdd26b7af9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/tools/miri/src/shims/unix/foreign_items.rs:139-144 | src/tools/miri/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/tools/miri/src/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/tools/miri/src/shims/unix/foreign_items.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c3e597909119b361a1062a5832c8a17ab43c844dc91aee298ed84bff59571ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/tools/miri/src/shims/unix/socket.rs:1183-1190 | src/tools/miri/src/shims/unix/socket.rs:1199-1206 | src/tools/miri/src/shims/unix/socket.rs:1223-1230 \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/tools/miri/src/shims/unix/socket.rs"},"region":{"startLine":1183}}}],"partialFingerprints":{"codehealthFindingId/v1":"4046c5e9be15e92e43f2994953791039aba2e9a647c7b117333ee0c195a9f550"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): compiler/rustc_codegen_cranelift/src/constant.rs:65-72 | compiler/rustc_codegen_cranelift/src/constant.rs:189-196 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_codegen_cranelift/src/constant.rs:65\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":"compiler/rustc_codegen_cranelift/src/constant.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"140dc26bc101be06d660afb1d3544d606d08dcf41d89fb8a4d4cf5008b01825c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/tools/miri/src/shims/windows/foreign_items.rs:407-413 | src/tools/miri/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/tools/miri/src/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/tools/miri/src/shims/windows/foreign_items.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"44b5a5b7bdc8d895c1afa3019b4f4e87b529ed535cdf875b809f5cd1ea9c40de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): compiler/rustc_mir_transform/src/validate.rs:831-837 | compiler/rustc_mir_transform/src/validate.rs:863-870 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_mir_transform/src/validate.rs:831\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":"compiler/rustc_mir_transform/src/validate.rs"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"b08e7636bdfaf2a032e13d1aec9ad8acfcba4c268a1f010c20715f84469affca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/tools/clippy/clippy_dev/src/utils.rs:176-183 | src/tools/clippy/clippy_dev/src/utils.rs:188-195 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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/tools/clippy/clippy_dev/src/utils.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f9055ede18704a8e1943d8839a37b56ee68a5fcf4f0d716612ec4f2c3f36d9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): library/stdarch/crates/stdarch-gen-loongarch/src/main.rs:1292-1299 | library/stdarch/crates/stdarch-gen-loongarch/src/main.rs:1301-1308 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/stdarch/crates/stdarch-gen-loongarch/src/main.rs:1292\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060library/stdarch/crates/stdarch-gen-loongarch/src/main.rs:1309\u0060 calls \u0060type_to_va\u0060, \u0060type_to_ct\u0060 and \u0060library/stdarch/crates/stdarch-gen-loongarch/src/main.rs:1300\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":"library/stdarch/crates/stdarch-gen-loongarch/src/main.rs"},"region":{"startLine":1292}}}],"partialFingerprints":{"codehealthFindingId/v1":"63b1490ee12f8f6e1c93c6137d65cc93c8088d6922aae9332f893ec5f7a39150"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): compiler/rustc_codegen_cranelift/build_system/rustc_info.rs:26-33 | compiler/rustc_codegen_cranelift/build_system/rustc_info.rs:39-46 | compiler/rustc_codegen_cranelift/build_system/rustc_info.rs:52-59 \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 \u0060compiler/rustc_codegen_cranelift/build_system/rustc_info.rs:26\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":"compiler/rustc_codegen_cranelift/build_system/rustc_info.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0c4dfae943f5cc720ebc9cc64b91a3e7c99e6722072ab6208f408a301388299"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/tools/clippy/clippy_dev/src/deprecate_lint.rs:22-29 | src/tools/clippy/clippy_dev/src/deprecate_lint.rs:69-76 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/clippy/clippy_dev/src/deprecate_lint.rs:22\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/tools/clippy/clippy_dev/src/deprecate_lint.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea24878357bc056e0bcb7193fcc4b0b3b2f56264a7b81dc8d4ddcb9f634c5019"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/tools/clippy/clippy_lints/src/floating_point_arithmetic/expm1.rs:39-46 | src/tools/clippy/clippy_lints/src/floating_point_arithmetic/log_base.rs:37-44 \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/tools/clippy/clippy_lints/src/floating_point_arithmetic/expm1.rs:39\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/tools/clippy/clippy_lints/src/floating_point_arithmetic/expm1.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"ade5d122f16093296fd8adaf1720cacd9f3ee2b89e9726063261103bf3dc9818"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/tools/miri/src/shims/windows/foreign_items.rs:194-201 | src/tools/miri/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/tools/miri/src/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/tools/miri/src/shims/windows/foreign_items.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"f37b1d70a2c0eaee66b0da32f0cd9f6bdae0cda7d3b713e9bce6235ac86c6134"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): compiler/rustc_mir_build/src/thir/print.rs:824-831 | compiler/rustc_mir_build/src/thir/print.rs:846-853 | compiler/rustc_mir_build/src/thir/print.rs:856-862 \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 \u0060compiler/rustc_mir_build/src/thir/print.rs:824\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":"compiler/rustc_mir_build/src/thir/print.rs"},"region":{"startLine":824}}}],"partialFingerprints":{"codehealthFindingId/v1":"08b826d75b45a187a8e39befc2e0b50ff1e4368e1a48375c2395d90ef0f08ff7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/librustdoc/html/highlight.rs:1106-1113 | src/librustdoc/html/highlight.rs:1136-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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/librustdoc/html/highlight.rs:1104\u0060 calls \u0060peek\u0060 and \u0060src/librustdoc/html/highlight.rs:1134\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/librustdoc/html/highlight.rs"},"region":{"startLine":1106}}}],"partialFingerprints":{"codehealthFindingId/v1":"8812c44321d88586143ea5f8a8254a49a0e484e04a24ecbf3a2d84b8b3e074fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/tools/miri/src/shims/unix/socket_address.rs:182-196 | src/tools/miri/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/tools/miri/src/shims/unix/socket_address.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdd430b4d24a437343be7fe95ae4347d0b30f2072d5fed706b8b870e0779b607"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): compiler/rustc_macros/src/type_visitable.rs:13-19 | compiler/rustc_macros/src/visitable.rs:10-15 | src/tools/rust-analyzer/crates/macros/src/lib.rs:42-48 \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 \u0060compiler/rustc_macros/src/type_visitable.rs:13\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_macros/src/type_visitable.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad594abc681d821b691089a914c976157e2df066ffa909bda4ee4d73e0ada409"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/tools/miri/src/shims/unix/foreign_items.rs:421-427 | src/tools/miri/src/shims/unix/foreign_items.rs:445-451 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/miri/src/shims/unix/foreign_items.rs:421\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/tools/miri/src/shims/unix/foreign_items.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"5da1743b2de136a1e772c8239b02010245710576f2beda91c38ab5751cd25c4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): compiler/rustc_driver_impl/src/pretty.rs:321-327 | compiler/rustc_driver_impl/src/pretty.rs:332-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 \u0060compiler/rustc_driver_impl/src/pretty.rs:321\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":"compiler/rustc_driver_impl/src/pretty.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f56d78b81601524447810b354230e1484f3201981b5e228becb51a0519f3247"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-ty/src/mir/eval/shim.rs:986-992 | src/tools/rust-analyzer/crates/hir-ty/src/mir/eval/shim.rs:1200-1206 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/hir-ty/src/mir/eval/shim.rs:986\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/mir/eval/shim.rs"},"region":{"startLine":986}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a3fbcf0cdf9bed17a19642ecbab438876c35fc88892e2bb0f64cccb0d5184fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 3): src/tools/miri/src/shims/unix/android/foreign_items.rs:65-74 | src/tools/miri/src/shims/unix/foreign_items.rs:496-503 | src/tools/miri/src/shims/unix/linux/foreign_items.rs:145-152 \u2014 before extracting anything, compare \u0060src/tools/miri/src/shims/unix/android/foreign_items.rs\u0060 and \u0060src/tools/miri/src/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/tools/miri/src/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/tools/miri/src/shims/unix/android/foreign_items.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eae01474fa479447a14f32b5704bd9ac46d429c834c9bc04d88299f5b9d2674"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/tools/miri/src/shims/unix/macos/foreign_items.rs:39-45 | src/tools/miri/src/shims/unix/solarish/foreign_items.rs:164-170 \u2014 \u0060src/tools/miri/src/shims/unix/macos/foreign_items.rs\u0060 and \u0060src/tools/miri/src/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/tools/miri/src/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/tools/miri/src/shims/unix/macos/foreign_items.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"b03fc8213b6b1758798b6e6b5bad2bafeb709c092d065ff8a6f926aa627b3c7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-ty/src/mir/eval/shim.rs:583-589 | src/tools/rust-analyzer/crates/hir-ty/src/mir/eval/shim.rs:655-661 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/hir-ty/src/mir/eval/shim.rs:583\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/tools/rust-analyzer/crates/hir-ty/src/mir/eval/shim.rs"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"653f03f5023450375a142a1fa91469fc54336bb36a423f681b5d7f023b48ebb6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/bootstrap/src/core/build_steps/llvm.rs:1911-1917 | src/bootstrap/src/core/build_steps/llvm.rs:1926-1931 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/bootstrap/src/core/build_steps/llvm.rs:1911\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/bootstrap/src/core/build_steps/llvm.rs"},"region":{"startLine":1911}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa1df921d0eee49526f0362ad4b2bf026ac94595f10dc4757159bbb9398118f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): library/stdarch/crates/stdarch-gen-loongarch/src/main.rs:469-475 | library/stdarch/crates/stdarch-gen-loongarch/src/main.rs:479-485 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/stdarch/crates/stdarch-gen-loongarch/src/main.rs:469\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":"library/stdarch/crates/stdarch-gen-loongarch/src/main.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"9420203ba5665c7a704e8a565d93a05d4816f5c2a58998a0d9680767e71e169d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/tools/miri/src/shims/unix/foreign_items.rs:812-818 | src/tools/miri/src/shims/unix/foreign_items.rs:820-826 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/miri/src/shims/unix/foreign_items.rs:812\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/tools/miri/src/shims/unix/foreign_items.rs"},"region":{"startLine":812}}}],"partialFingerprints":{"codehealthFindingId/v1":"1706bbbea4994b9b9c9ae1461c054be83821fa0fe51f1ac8b6f12078461b9c07"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): src/tools/miri/src/shims/unix/fs.rs:1782-1788 | src/tools/miri/src/shims/unix/fs.rs:1800-1806 | src/tools/miri/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/tools/miri/src/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/tools/miri/src/shims/unix/fs.rs"},"region":{"startLine":1782}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c5a8dd69687ff643fa8a7f9460501ddeac475b3ab6f39af0f6cd528be144f21"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): library/stdarch/crates/stdarch-gen-arm/src/intrinsic.rs:1200-1206 | library/stdarch/crates/stdarch-gen-arm/src/intrinsic.rs:1273-1279 \u2014 both copies are in the same file, so extract the block 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":"library/stdarch/crates/stdarch-gen-arm/src/intrinsic.rs"},"region":{"startLine":1200}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdd4d4fbc2a3c6d2916a5c099255e6ef5c846f2ebbed2b0dd91d000b36e33c95"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): src/tools/miri/src/shims/unix/fs.rs:1782-1788 | src/tools/miri/src/shims/unix/fs.rs:1800-1806 | src/tools/miri/src/shims/unix/fs.rs:1825-1830 | src/tools/miri/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/tools/miri/src/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/tools/miri/src/shims/unix/fs.rs:1822\u0060 calls \u0060deref_pointer\u0060 and \u0060src/tools/miri/src/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/tools/miri/src/shims/unix/fs.rs"},"region":{"startLine":1782}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc56c3b42add58ff3350a5fa254d8c9a619508985e28b0a08f7da563bca60578"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/tools/tidy/src/style.rs:441-447 | src/tools/tidy/src/style.rs:457-463 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/tidy/src/style.rs:441\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/tools/tidy/src/style.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b9535ede44fb26837898169b1f709b971dd76957593174c66a403a653f58daf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): compiler/rustc_expand/src/mbe/transcribe.rs:617-623 | compiler/rustc_expand/src/mbe/transcribe.rs:626-632 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_expand/src/mbe/transcribe.rs:617\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":"compiler/rustc_expand/src/mbe/transcribe.rs"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb06b0c08d0bc04f54b5864187ab94ae870ec5cf4a38283223050cf92158d26a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/tools/rust-analyzer/crates/ide-diagnostics/src/handlers/trait_impl_redundant_assoc_item.rs:33-39 | src/tools/rust-analyzer/crates/ide-diagnostics/src/handlers/trait_impl_redundant_assoc_item.rs:41-47 \u2014 both copies are in the same file, so extract the block 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/tools/rust-analyzer/crates/ide-diagnostics/src/handlers/trait_impl_redundant_assoc_item.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa876dfb7121adeea36a2137b6ed629c7394220576c08e4c4fc6672f97cd1aff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/tools/clippy/clippy_config/src/metadata.rs:24-30 | src/tools/clippy/clippy_config/src/metadata.rs:46-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tools/clippy/clippy_config/src/metadata.rs:24\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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/tools/clippy/clippy_config/src/metadata.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0bf87823457c1979a56dd520d20b18471ff45363f6956ee0a5a2aab97963d7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/tools/rust-analyzer/crates/rust-analyzer/src/cli/analysis_stats.rs:459-465 | src/tools/rust-analyzer/crates/rust-analyzer/src/cli/analysis_stats.rs:733-738 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tools/rust-analyzer/crates/rust-analyzer/src/cli/analysis_stats.rs:459\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/tools/rust-analyzer/crates/rust-analyzer/src/cli/analysis_stats.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a1c5d0414f9997bcd489d4439c2b21745d88e1640390e0aeb1360b4aabcebcb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): compiler/rustc_codegen_cranelift/src/intrinsics/llvm_aarch64.rs:273-279 | compiler/rustc_codegen_cranelift/src/intrinsics/llvm_aarch64.rs:321-327 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_codegen_cranelift/src/intrinsics/llvm_aarch64.rs:273\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":"compiler/rustc_codegen_cranelift/src/intrinsics/llvm_aarch64.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"918d71c0571b14b6e897b1c016c85411efc6e30c5dd7222a2121dd82587ae4cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/tools/clippy/clippy_lints/src/methods/bind_instead_of_map.rs:64-70 | src/tools/clippy/clippy_lints/src/methods/bind_instead_of_map.rs:75-81 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/clippy/clippy_lints/src/methods/bind_instead_of_map.rs:64\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/methods/bind_instead_of_map.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fe2845073859770afb1c489fdba9b22095f593427ba37f69ce12637601c8328"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-ty/src/infer/coerce.rs:1045-1051 | src/tools/rust-analyzer/crates/hir-ty/src/infer/coerce.rs:1052-1058 \u2014 both copies are in the same file, so extract the block 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/tools/rust-analyzer/crates/hir-ty/src/infer/coerce.rs"},"region":{"startLine":1045}}}],"partialFingerprints":{"codehealthFindingId/v1":"858a0da85d41d1960b13ecbc24da8c34d0eaa66bbee74c3edadf84746946338a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): library/core/src/fmt/builders.rs:157-163 | library/core/src/fmt/builders.rs:531-537 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/core/src/fmt/builders.rs:157\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, \u0060library/core/src/fmt/builders.rs:165\u0060 calls \u0060write_str\u0060 and \u0060library/core/src/fmt/builders.rs:539\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":"library/core/src/fmt/builders.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"af50a8005912f3b42bf4620748d5b2fe508321227dc829c7303df4716d4a6062"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/tools/rust-analyzer/crates/ide/src/signature_help.rs:508-514 | src/tools/rust-analyzer/crates/ide/src/signature_help.rs:635-641 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/tools/rust-analyzer/crates/ide/src/signature_help.rs:515\u0060 calls \u0060fields\u0060 and \u0060src/tools/rust-analyzer/crates/ide/src/signature_help.rs:642\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/tools/rust-analyzer/crates/ide/src/signature_help.rs"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"67b1011bec1a12c0f491d1aee2c306e31d81ee01366f05f04ca3f67430f22c98"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): compiler/rustc_hir_analysis/src/coherence/inherent_impls.rs:99-105 | compiler/rustc_hir_analysis/src/coherence/inherent_impls.rs:159-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/coherence/inherent_impls.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc68f904605d6ea6aca6d1491faed5cec234b0771372b672ccf4b0aa2094d667"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/tools/miri/src/shims/unix/fs.rs:1030-1036 | src/tools/miri/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/tools/miri/src/shims/unix/fs.rs"},"region":{"startLine":1030}}}],"partialFingerprints":{"codehealthFindingId/v1":"efec1f5571e02aa646d0c69bd56bcab3a8851e3f2096bc179abadefd1ce156d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): src/tools/rust-analyzer/crates/hir-ty/src/mir/eval/shim.rs:986-992 | src/tools/rust-analyzer/crates/hir-ty/src/mir/eval/shim.rs:1200-1206 | src/tools/rust-analyzer/crates/hir-ty/src/mir/eval/shim.rs:1305-1311 \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/tools/rust-analyzer/crates/hir-ty/src/mir/eval/shim.rs:986\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/mir/eval/shim.rs"},"region":{"startLine":986}}}],"partialFingerprints":{"codehealthFindingId/v1":"4840eba1228ad5904e6568c9ba5e027769ac60fc885526a0c41b3aa973ed8484"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): compiler/rustc_codegen_cranelift/build_system/bench.rs:101-107 | compiler/rustc_codegen_cranelift/build_system/bench.rs:127-131 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_codegen_cranelift/build_system/bench.rs:101\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, \u0060compiler/rustc_codegen_cranelift/build_system/bench.rs:126\u0060 calls \u0060current_dir\u0060, \u0060spawn_and_wait\u0060 and \u0060compiler/rustc_codegen_cranelift/build_system/bench.rs:101\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":"compiler/rustc_codegen_cranelift/build_system/bench.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"1611124e59bcb5b28c42d615aea4161bcaccd7ee34a9c8c8abfff18b21e5a140"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs:271-275 | compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs:319-325 \u2014 both copies are in the same file, so extract the block 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":"compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"35007dd692d4df364afd19ea00e5c2179db76a5e81ab85b92e454ba319d7b0c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): library/std/src/sys/net/connection/xous/tcplistener.rs:130-136 | library/std/src/sys/net/connection/xous/udp.rs:146-152 \u2014 before extracting anything, compare \u0060library/std/src/sys/net/connection/xous/tcplistener.rs\u0060 and \u0060library/std/src/sys/net/connection/xous/udp.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 74 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 \u0060library/std/src/sys/net/connection/xous/tcplistener.rs:130\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/net/connection/xous/tcplistener.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"e008e94fca23cfbf19737c07103ca75847022820b4cd5c5d1a8d719b2507624f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): compiler/rustc_target/src/callconv/mod.rs:455-461 | compiler/rustc_target/src/callconv/mod.rs:484-490 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_target/src/callconv/mod.rs:455\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":"compiler/rustc_target/src/callconv/mod.rs"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9395b6d54e220d0328773d41bb04fde4a6809b0b176e0a3debd5c7bb1871e70"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): compiler/rustc_hir_analysis/src/check/compare_impl_item.rs:1586-1591 | compiler/rustc_hir_analysis/src/check/compare_impl_item.rs:1606-1612 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_hir_analysis/src/check/compare_impl_item.rs:1586\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/check/compare_impl_item.rs"},"region":{"startLine":1586}}}],"partialFingerprints":{"codehealthFindingId/v1":"a911a17f1cead54485969da7333d87b187a807af820855e54beb518c4163504f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/tools/miri/src/shims/unix/fs.rs:991-996 | src/tools/miri/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/tools/miri/src/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/tools/miri/src/shims/unix/fs.rs:1029\u0060 calls \u0060read_pointer\u0060, \u0060read_scalar\u0060, \u0060to_i32\u0060 and \u0060src/tools/miri/src/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/tools/miri/src/shims/unix/fs.rs"},"region":{"startLine":991}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c74068d96ac75b79e36aed255589bc7fde7c03477b585ad65bbc753d20eb745"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/tools/rustfmt/src/patterns.rs:153-158 | src/tools/rustfmt/src/patterns.rs:181-186 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rustfmt/src/patterns.rs:153\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/tools/rustfmt/src/patterns.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d568e6d25e66cf188c4b0174b8eb3295fa617030d9830059eb73de1b018fa80"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/tools/rustfmt/src/parse/macros/cfg_if.rs:17-22 | src/tools/rustfmt/src/parse/macros/cfg_select.rs:33-38 \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/tools/rustfmt/src/parse/macros/cfg_if.rs:17\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/tools/rustfmt/src/parse/macros/cfg_if.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d24b2b15f3c41420c2da93835e0bd232b678adcb1c05dee963199bf1a33e73b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/tools/miri/src/intrinsics/aarch64.rs:317-322 | src/tools/miri/src/intrinsics/aarch64.rs:342-347 | src/tools/miri/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/tools/miri/src/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/tools/miri/src/intrinsics/aarch64.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce3600b1f80aea8eab2e0ce26ef5c6d288bb2b1ed88323a7ae989f839c6e9318"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-ty/src/mir/eval/shim.rs:745-750 | src/tools/rust-analyzer/crates/hir-ty/src/mir/eval/shim.rs:764-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/tools/rust-analyzer/crates/hir-ty/src/mir/eval/shim.rs:745\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/tools/rust-analyzer/crates/hir-ty/src/mir/eval/shim.rs"},"region":{"startLine":745}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce99a7596cd763ae583d9324778a134a5de6a076035ade5075cb8a47ff6d41ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): compiler/rustc_codegen_gcc/src/intrinsic/mod.rs:1192-1197 | compiler/rustc_codegen_gcc/src/intrinsic/mod.rs:1256-1261 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_codegen_gcc/src/intrinsic/mod.rs:1192\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":"compiler/rustc_codegen_gcc/src/intrinsic/mod.rs"},"region":{"startLine":1192}}}],"partialFingerprints":{"codehealthFindingId/v1":"97d3fc0ca5527149c6fe75b2c2112416ab5c474510742e3c8a2cd4ee0c444035"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/tools/miri/src/shims/unix/fs.rs:1074-1079 | src/tools/miri/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/tools/miri/src/shims/unix/fs.rs"},"region":{"startLine":1074}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8d5a49c6ac9407e12864d79a66b218503b468e7cd0b93b2e01ae2e1d7d27c0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): compiler/rustc_codegen_llvm/src/intrinsic.rs:1335-1340 | compiler/rustc_codegen_llvm/src/intrinsic.rs:1511-1516 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_codegen_llvm/src/intrinsic.rs:1335\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, \u0060compiler/rustc_codegen_llvm/src/intrinsic.rs:1342\u0060 calls \u0060append_sibling_block\u0060 and \u0060compiler/rustc_codegen_llvm/src/intrinsic.rs:1519\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":"compiler/rustc_codegen_llvm/src/intrinsic.rs"},"region":{"startLine":1335}}}],"partialFingerprints":{"codehealthFindingId/v1":"99194bde71b016bb9134835da208a471c1873581f6a70f87dd7a803c28c83367"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): library/core/src/fmt/builders.rs:252-257 | library/core/src/fmt/builders.rs:465-470 | library/core/src/fmt/builders.rs:1343-1348 \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 \u0060library/core/src/fmt/builders.rs:252\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":"library/core/src/fmt/builders.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"f19c023dbe8d84003a8c1b86f2239cf896c035e27a4bff41da961bdd29fba759"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 8): src/tools/rust-analyzer/crates/hir-ty/src/mir/eval/shim.rs:825-830 | src/tools/rust-analyzer/crates/hir-ty/src/mir/eval/shim.rs:847-852 | src/tools/rust-analyzer/crates/hir-ty/src/mir/eval/shim.rs:876-881 | src/tools/rust-analyzer/crates/hir-ty/src/mir/eval/shim.rs:887-892 | src/tools/rust-analyzer/crates/hir-ty/src/mir/eval/shim.rs:899-904 | src/tools/rust-analyzer/crates/hir-ty/src/mir/eval/shim.rs:911-916 | src/tools/rust-analyzer/crates/hir-ty/src/mir/eval/shim.rs:923-928 | src/tools/rust-analyzer/crates/hir-ty/src/mir/eval/shim.rs:937-942 \u2014 all 8 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/mir/eval/shim.rs"},"region":{"startLine":825}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd57dbb4c59995cbb4632290affdffa8eae72e80b822c80f8617ea95364b474d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): compiler/rustc_builtin_macros/src/compile_error.rs:15-20 | compiler/rustc_builtin_macros/src/source_util.rs:113-118 \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 \u0060compiler/rustc_builtin_macros/src/compile_error.rs:15\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, \u0060compiler/rustc_builtin_macros/src/source_util.rs:111\u0060 calls \u0060with_def_site_ctxt\u0060 and \u0060compiler/rustc_builtin_macros/src/compile_error.rs:13\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":"compiler/rustc_builtin_macros/src/compile_error.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"d60cd10770b765558fa3ea019a21bf9df64261456241faa56b02c127034bf61b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-ty/src/mir/eval/shim.rs:760-765 | src/tools/rust-analyzer/crates/hir-ty/src/mir/eval/shim.rs:779-784 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/hir-ty/src/mir/eval/shim.rs:760\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/tools/rust-analyzer/crates/hir-ty/src/mir/eval/shim.rs"},"region":{"startLine":760}}}],"partialFingerprints":{"codehealthFindingId/v1":"39419105e22115b527ca9742afc8d0f80a9ebbdfcfd5046256a6dc071c0f7ae3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/tools/miri/src/shims/unix/android/foreign_items.rs:108-113 | src/tools/miri/src/shims/unix/linux/foreign_items.rs:343-347 \u2014 \u0060src/tools/miri/src/shims/unix/android/foreign_items.rs\u0060 and \u0060src/tools/miri/src/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/tools/miri/src/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/tools/miri/src/shims/unix/android/foreign_items.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0e84c59302cd9ea4be08a5dfc3a37c1d8f135c5e6d86bf042e0292e1ced630a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/tools/miri/src/intrinsics/x86/sse.rs:152-157 | src/tools/miri/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/tools/miri/src/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/tools/miri/src/intrinsics/x86/sse.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c3f3667743d8ed149746c6b50eca3ec55976883cfbd208da37fe0ac9a6c6b9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/tools/miri/src/shims/unix/foreign_items.rs:656-661 | src/tools/miri/src/shims/unix/foreign_items.rs:723-728 | src/tools/miri/src/shims/unix/foreign_items.rs:731-736 \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/tools/miri/src/shims/unix/foreign_items.rs:656\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/tools/miri/src/shims/unix/foreign_items.rs"},"region":{"startLine":656}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ac0b90769b20e8aa9425c5476b4ffdb8da7c41005c3d1cfdb87dc98f3dc84cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/tools/miri/src/shims/unix/foreign_items.rs:461-466 | src/tools/miri/src/shims/unix/macos/foreign_items.rs:83-88 \u2014 before extracting anything, compare \u0060src/tools/miri/src/shims/unix/foreign_items.rs\u0060 and \u0060src/tools/miri/src/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/tools/miri/src/shims/unix/foreign_items.rs"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"37ef5f8435a0170345ca2d6cb475538949192834e6976d9184121db7068b920d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/tools/miri/src/shims/unix/foreign_items.rs:687-694 | src/tools/miri/src/shims/unix/solarish/foreign_items.rs:136-143 \u2014 before extracting anything, compare \u0060src/tools/miri/src/shims/unix/foreign_items.rs\u0060 and \u0060src/tools/miri/src/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/tools/miri/src/shims/unix/foreign_items.rs:687\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/tools/miri/src/shims/unix/foreign_items.rs"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"f27c8a7ea89c1bd10bcfd0b3fb4140ebb2e42df908a02f5259226a324810cddb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/tools/miri/src/shims/unix/foreign_items.rs:1238-1245 | src/tools/miri/src/shims/unix/foreign_items.rs:1248-1255 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/miri/src/shims/unix/foreign_items.rs:1238\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/tools/miri/src/shims/unix/foreign_items.rs"},"region":{"startLine":1238}}}],"partialFingerprints":{"codehealthFindingId/v1":"632e58ddc4f081c80c3ac159b91f994159249b4456bacbb84b3a2cb1d093b815"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): library/stdarch/crates/stdarch-gen-loongarch/src/main.rs:1407-1412 | library/stdarch/crates/stdarch-gen-loongarch/src/main.rs:1478-1483 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/stdarch/crates/stdarch-gen-loongarch/src/main.rs:1407\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":"library/stdarch/crates/stdarch-gen-loongarch/src/main.rs"},"region":{"startLine":1407}}}],"partialFingerprints":{"codehealthFindingId/v1":"a799b20b1be864c271e9bf3eddd5c882571b0f9f4ff6fecb920d62c0cb626e1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/tools/rust-analyzer/lib/lsp-server/src/stdio.rs:15-20 | src/tools/rust-analyzer/lib/lsp-server/src/stdio.rs:32-37 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/lib/lsp-server/src/stdio.rs:15\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/tools/rust-analyzer/lib/lsp-server/src/stdio.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"a882279cc29deb0abe23a61c35c518f43c13175d328131e6c226e3f7137104eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): library/stdarch/crates/stdarch-gen-loongarch/src/main.rs:560-565 | library/stdarch/crates/stdarch-gen-loongarch/src/main.rs:576-581 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/stdarch/crates/stdarch-gen-loongarch/src/main.rs:560\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":"library/stdarch/crates/stdarch-gen-loongarch/src/main.rs"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cf92c9eb38c000586613417a646edd6c2ad77fc375cd88d3090afd0da3871ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5): compiler/rustc_mir_build/src/thir/print.rs:276-281 | compiler/rustc_mir_build/src/thir/print.rs:285-290 | compiler/rustc_mir_build/src/thir/print.rs:376-381 | compiler/rustc_mir_build/src/thir/print.rs:385-390 | compiler/rustc_mir_build/src/thir/print.rs:401-406 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_mir_build/src/thir/print.rs:276\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, \u0060compiler/rustc_mir_build/src/thir/print.rs:373\u0060 calls \u0060print_block\u0060 and \u0060compiler/rustc_mir_build/src/thir/print.rs:398\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":"compiler/rustc_mir_build/src/thir/print.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"9540c28c1b5791adb6e2f38343a2920957446a2f9bdce53131af4fcbdc21ddc1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-ide/src/display.rs:922-927 | src/tools/rust-analyzer/crates/hir-ide/src/display.rs:1044-1049 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/hir-ide/src/display.rs:922\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/tools/rust-analyzer/crates/hir-ide/src/display.rs"},"region":{"startLine":922}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b17ad804e2f066eaab52f6fee848f953d2651714493f7c15334ca4338b29440"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/tools/rust-analyzer/crates/ide-assists/src/handlers/expand_glob_import.rs:58-63 | src/tools/rust-analyzer/crates/ide-assists/src/handlers/expand_glob_import.rs:119-124 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/ide-assists/src/handlers/expand_glob_import.rs:58\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/tools/rust-analyzer/crates/ide-assists/src/handlers/expand_glob_import.rs:116\u0060 calls \u0060get_export_visibility_kind\u0060 and \u0060src/tools/rust-analyzer/crates/ide-assists/src/handlers/expand_glob_import.rs:56\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/tools/rust-analyzer/crates/ide-assists/src/handlers/expand_glob_import.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b627d6258113b4f9777d0c53e36c9f047754cce30ef2e9f61e8fd4a7a47748a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs:279-284 | compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs:329-334 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"63daa920edc621e3f34bb3b2382f4fd8b30bcd318db5d70057764b0383731f08"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): compiler/rustc_ast_pretty/src/pprust/state/item.rs:503-508 | compiler/rustc_ast_pretty/src/pprust/state/item.rs:517-522 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_ast_pretty/src/pprust/state/item.rs:503\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 \u0060crate) fn print_impl_restriction(\u0026mut\u0060 in one and \u0060crate) fn print_mut_restriction(\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":"compiler/rustc_ast_pretty/src/pprust/state/item.rs"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"44e8b95e1a500835a2778daa796c4b36497d8c4916241a5c1799d0f6d9187b74"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-ty/src/mir/eval/shim.rs:470-475 | src/tools/rust-analyzer/crates/hir-ty/src/mir/eval/shim.rs:481-486 \u2014 both copies are in the same file, so extract the block 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/tools/rust-analyzer/crates/hir-ty/src/mir/eval/shim.rs"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"e75072237ea22b048e39250c91c88b5bcd1d23dda64234199907da3f82004c3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): compiler/rustc_builtin_macros/src/env.rs:32-37 | compiler/rustc_builtin_macros/src/gca.rs:14-19 \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 \u0060compiler/rustc_builtin_macros/src/env.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":"compiler/rustc_builtin_macros/src/env.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"de926371de30ba2156a23ade0f5ad7741956ffced757c3a8cd31e79e4c359ad7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-ty/src/mir/eval/shim.rs:1203-1207 | src/tools/rust-analyzer/crates/hir-ty/src/mir/eval/shim.rs:1280-1284 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/hir-ty/src/mir/eval/shim.rs:1203\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/tools/rust-analyzer/crates/hir-ty/src/mir/eval/shim.rs:1277\u0060 calls \u0060get\u0060 and \u0060src/tools/rust-analyzer/crates/hir-ty/src/mir/eval/shim.rs:1201\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/tools/rust-analyzer/crates/hir-ty/src/mir/eval/shim.rs"},"region":{"startLine":1203}}}],"partialFingerprints":{"codehealthFindingId/v1":"c04a84c7b6da9c9db4567e5b096bc2443354445560fc63a09ee69199956f2c78"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/tools/miri/src/shims/unix/foreign_items.rs:265-269 | src/tools/miri/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/tools/miri/src/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/tools/miri/src/shims/unix/foreign_items.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"987033b50a300b75b380153b933ccf0f05a978f235166f2c878c18025c77ffbb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): library/stdarch/crates/stdarch-gen-loongarch/src/main.rs:148-152 | library/stdarch/crates/stdarch-gen-loongarch/src/main.rs:853-857 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/stdarch/crates/stdarch-gen-loongarch/src/main.rs:148\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":"library/stdarch/crates/stdarch-gen-loongarch/src/main.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"75f227a54a4f0da5f91d29befa184bd998deeb96eff77aefda09ffef36a4a094"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/tools/miri/src/shims/unix/android/foreign_items.rs:59-63 | src/tools/miri/src/shims/unix/foreign_items.rs:490-494 \u2014 before extracting anything, compare \u0060src/tools/miri/src/shims/unix/android/foreign_items.rs\u0060 and \u0060src/tools/miri/src/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/tools/miri/src/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/tools/miri/src/shims/unix/android/foreign_items.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"518377ba87fcd7a077fe5a4b9ba597ad310b34b4059c660a8f0254ef5029ea81"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20135 lines \u00D7 3): compiler/rustc_codegen_gcc/src/intrinsic/llvm.rs:612-615 | compiler/rustc_codegen_gcc/src/intrinsic/llvm.rs:709-713 | compiler/rustc_codegen_gcc/src/intrinsic/llvm.rs:719-723 \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 \u0060compiler/rustc_codegen_gcc/src/intrinsic/llvm.rs:709\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":"compiler/rustc_codegen_gcc/src/intrinsic/llvm.rs"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a77c6be254034f27b095984502c8ffc1ac5286d2a73940e1fc49ded5e0e6087"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/tools/miri/src/intrinsics/x86/sse.rs:94-98 | src/tools/miri/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/tools/miri/src/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/tools/miri/src/intrinsics/x86/sse.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"a97d30974304ca3c404917df3d0b4dbb6dfef57097ad33ac77c60ed2779085d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/tools/clippy/clippy_dev/src/edit_lints.rs:228-232 | src/tools/clippy/clippy_dev/src/edit_lints.rs:244-248 \u2014 both copies are in the same file, so extract the block 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/tools/clippy/clippy_dev/src/edit_lints.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"d64525c8dce79b101ff1d04431acbb4deb6040fbfb00f80e2e5f30260d36fc86"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/tools/rust-analyzer/crates/rust-analyzer/src/handlers/request.rs:1923-1927 | src/tools/rust-analyzer/crates/rust-analyzer/src/handlers/request.rs:1962-1966 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060params\u0060 to \u0060CallHierarchyIncomingCallsParams\u0060 in one and \u0060CallHierarchyOutgoingCallsParams\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/tools/rust-analyzer/crates/rust-analyzer/src/handlers/request.rs"},"region":{"startLine":1923}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfe8f07d13ceecd104a8d6dca25e829fa8158e77a733bb885e8bc79feefe406d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/tools/miri/src/shims/unix/foreign_items.rs:471-475 | src/tools/miri/src/shims/unix/macos/foreign_items.rs:87-91 \u2014 before extracting anything, compare \u0060src/tools/miri/src/shims/unix/foreign_items.rs\u0060 and \u0060src/tools/miri/src/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/tools/miri/src/shims/unix/foreign_items.rs:471\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/tools/miri/src/shims/unix/foreign_items.rs"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd62159bc30c912a386a4c0dd45aa95b1e1594cb41c06e3e858abd4178f25d04"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-ty/src/mir/eval.rs:1491-1495 | src/tools/rust-analyzer/crates/hir-ty/src/mir/eval.rs:1507-1511 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/hir-ty/src/mir/eval.rs:1491\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/tools/rust-analyzer/crates/hir-ty/src/mir/eval.rs"},"region":{"startLine":1491}}}],"partialFingerprints":{"codehealthFindingId/v1":"640b4a820fac6317bc1a9f15789002990a63590db1a9d471ed826eff445d867c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): library/stdarch/crates/intrinsic-test/src/arm/types.rs:24-28 | library/stdarch/crates/intrinsic-test/src/arm/types.rs:59-63 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/stdarch/crates/intrinsic-test/src/arm/types.rs:24\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/intrinsic-test/src/arm/types.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"14297156000bbdb8930884c5c6c0a1240f93b491bd1663336ef238303213735c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/tools/miri/src/intrinsics/aarch64.rs:62-66 | src/tools/miri/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/tools/miri/src/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/tools/miri/src/intrinsics/aarch64.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b0969c8cf4cba650c9eaeab8f4b100f5f54d26c5b79a05e7a4a339d589ace12"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): compiler/rustc_codegen_llvm/src/intrinsic.rs:1342-1346 | compiler/rustc_codegen_llvm/src/intrinsic.rs:1517-1521 | compiler/rustc_codegen_llvm/src/intrinsic.rs:1626-1630 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060compiler/rustc_codegen_llvm/src/intrinsic.rs:1403\u0060 calls \u0060tcx\u0060, \u0060pointer_size\u0060, \u0060pointer_align\u0060 and \u0060compiler/rustc_codegen_llvm/src/intrinsic.rs:1546\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":"compiler/rustc_codegen_llvm/src/intrinsic.rs"},"region":{"startLine":1342}}}],"partialFingerprints":{"codehealthFindingId/v1":"4193f0d875e249c1fac703b5c888db382340c90bbbc09cf1197455e6d8e61019"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): compiler/rustc_codegen_llvm/src/consts.rs:755-759 | compiler/rustc_codegen_llvm/src/consts.rs:775-779 | compiler/rustc_codegen_llvm/src/consts.rs:838-842 \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":"compiler/rustc_codegen_llvm/src/consts.rs"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"98e5178e14d424aecbd435c823e914c9b208db6e339ccfa9aa9ca40dc03712ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): compiler/rustc_macros/src/type_foldable.rs:5-9 | src/tools/rust-analyzer/crates/macros/src/lib.rs:93-97 \u2014 before extracting anything, compare \u0060compiler/rustc_macros/src/type_foldable.rs\u0060 and \u0060src/tools/rust-analyzer/crates/macros/src/lib.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 31 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 \u0060compiler/rustc_macros/src/type_foldable.rs:5\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":"compiler/rustc_macros/src/type_foldable.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"51343ac296991ca7fdebd502d40242e07c7acf19d2a69699c7b83bf068bea89a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): compiler/rustc_mir_build/src/thir/print.rs:103-107 | compiler/rustc_mir_build/src/thir/print.rs:751-755 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_mir_build/src/thir/print.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":"compiler/rustc_mir_build/src/thir/print.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1ac574287fa0487bcb7adde62be79eede73c3bbb5f00b9f7b892523f7dd1df6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-ty/src/mir/eval/shim.rs:733-737 | src/tools/rust-analyzer/crates/hir-ty/src/mir/eval/shim.rs:742-746 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/hir-ty/src/mir/eval/shim.rs:733\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/tools/rust-analyzer/crates/hir-ty/src/mir/eval/shim.rs"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"79ca05f88d2a29cdef2e00c6103486a37bf12952530fb22e3785a2d5540f8388"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/tools/miri/src/shims/unix/android/foreign_items.rs:55-62 | src/tools/miri/src/shims/unix/foreign_items.rs:486-493 | src/tools/miri/src/shims/unix/linux/foreign_items.rs:92-99 \u2014 before extracting anything, compare \u0060src/tools/miri/src/shims/unix/android/foreign_items.rs\u0060 and \u0060src/tools/miri/src/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/tools/miri/src/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/tools/miri/src/shims/unix/android/foreign_items.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b38a234a629626ed4dbc9e0acf2945015a86444072d63cc92914d9c6d0039b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/tools/rust-analyzer/crates/parser/src/lexed_str.rs:365-369 | src/tools/rust-analyzer/crates/parser/src/lexed_str.rs:377-381 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/parser/src/lexed_str.rs:365\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/tools/rust-analyzer/crates/parser/src/lexed_str.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bf784d37f7dd0b433193e978a7cc98424082ff7a15b25ba7e7aeb1c1c409e22"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/tools/miri/src/shims/unix/foreign_items.rs:228-232 | src/tools/miri/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/tools/miri/src/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/tools/miri/src/shims/unix/foreign_items.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"37c7366d8b0df9a861db8adcf50550ca328d1034d043efd4e501f1bdd75edc19"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): compiler/rustc_const_eval/src/interpret/memory.rs:1021-1025 | compiler/rustc_const_eval/src/interpret/memory.rs:1040-1044 \u2014 both copies are in the same file, so extract the block 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":"compiler/rustc_const_eval/src/interpret/memory.rs"},"region":{"startLine":1021}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5c2c0b4670d14658d6922f737f9a58eaecc8dc6be78fa064a83e6a12155f520"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): src/tools/miri/src/shims/unix/foreign_items.rs:471-475 | src/tools/miri/src/shims/unix/linux/foreign_items.rs:181-185 | src/tools/miri/src/shims/unix/macos/foreign_items.rs:87-91 \u2014 before extracting anything, compare \u0060src/tools/miri/src/shims/unix/foreign_items.rs\u0060 and \u0060src/tools/miri/src/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/tools/miri/src/shims/unix/foreign_items.rs:471\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/tools/miri/src/shims/unix/foreign_items.rs"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d5ecd836a11a145643d52411285ba311a141e8926f64411c0418ba38cf81454"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/tools/miri/src/shims/unix/foreign_items.rs:679-683 | src/tools/miri/src/shims/unix/foreign_items.rs:693-697 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/miri/src/shims/unix/foreign_items.rs:679\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/shims/unix/foreign_items.rs"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"298534dc13199fe53a8ac2a4d95a4035ae91bb63ab10f6bedad9db4b267b1bf6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): compiler/rustc_builtin_macros/src/source_util.rs:35-39 | compiler/rustc_builtin_macros/src/source_util.rs:50-54 \u2014 both copies are in the same file, so extract the block 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":"compiler/rustc_builtin_macros/src/source_util.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f6157816303e9b93d3eb81b40f75d15436794d941db6ae848c6b1f97bd6a4ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/tools/miri/src/shims/unix/foreign_items.rs:281-287 | src/tools/miri/src/shims/unix/macos/foreign_items.rs:45-51 \u2014 before extracting anything, compare \u0060src/tools/miri/src/shims/unix/foreign_items.rs\u0060 and \u0060src/tools/miri/src/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/tools/miri/src/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/tools/miri/src/shims/unix/foreign_items.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"12ad94cd5f39f8ffd6f5b1d15654208d6771b9a5e740e391eb85db0ca76f7e09"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): src/tools/miri/src/shims/unix/foreign_items.rs:167-171 | src/tools/miri/src/shims/unix/foreign_items.rs:453-457 | src/tools/miri/src/shims/unix/foreign_items.rs:585-589 \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/tools/miri/src/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/tools/miri/src/shims/unix/foreign_items.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"536e5b6ed81d70999b129f292777a0bc287aa1eb932a0169bdcc4d173f451ca0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): src/tools/rust-analyzer/crates/parser/src/lexed_str.rs:365-369 | src/tools/rust-analyzer/crates/parser/src/lexed_str.rs:377-381 | src/tools/rust-analyzer/crates/parser/src/lexed_str.rs:389-393 | src/tools/rust-analyzer/crates/parser/src/lexed_str.rs:403-407 \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/tools/rust-analyzer/crates/parser/src/lexed_str.rs:365\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/tools/rust-analyzer/crates/parser/src/lexed_str.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d6abeb46a2bdbc0643c6dbe81aea33e9ed374a006f16c79acd02dd2a00256fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/tools/miri/src/shims/unix/android/foreign_items.rs:34-41 | src/tools/miri/src/shims/unix/foreign_items.rs:247-254 | src/tools/miri/src/shims/unix/linux/foreign_items.rs:71-78 \u2014 before extracting anything, compare \u0060src/tools/miri/src/shims/unix/android/foreign_items.rs\u0060 and \u0060src/tools/miri/src/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/tools/miri/src/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/tools/miri/src/shims/unix/android/foreign_items.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"7074b812cb15421eff6c2205dc3cd661b6ee21caee08c0092c22fa586a27b276"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/tools/tidy/src/codegen.rs:25-29 | src/tools/tidy/src/style.rs:286-290 \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/tools/tidy/src/codegen.rs:25\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/tools/tidy/src/style.rs:292\u0060 calls \u0060filter_dirs\u0060, \u0060skip_markdown_path\u0060 and \u0060src/tools/tidy/src/codegen.rs:31\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/tools/tidy/src/codegen.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"de2a7e404b65d17d10cfd81554f3dc3e15568b426a37c51202301f753e6d3e99"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): compiler/rustc_ast/src/attr/version.rs:31-35 | compiler/rustc_attr_parsing/src/attributes/util.rs:23-27 | compiler/rustc_macros/src/current_version.rs:34-38 \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 \u0060compiler/rustc_ast/src/attr/version.rs:31\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":"compiler/rustc_ast/src/attr/version.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c42fb27d676ba91585df4740a1cd52748a6e74cb21e21c2089d7389a05bb86a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): compiler/rustc_ast/src/util/literal.rs:152-157 | library/proc_macro/src/lib.rs:1721-1726 \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 \u0060compiler/rustc_ast/src/util/literal.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":"compiler/rustc_ast/src/util/literal.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ea0046a1c98feeccc0a846600c1c155d31f1395b65481b106a93b2552caf44a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): compiler/rustc_codegen_cranelift/src/discriminant.rs:34-39 | compiler/rustc_codegen_cranelift/src/discriminant.rs:97-102 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_codegen_cranelift/src/discriminant.rs:34\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/src/discriminant.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8032a5b02c72c615ffef4206162964a9e16ebed29bc9a828557c4e9d66cd997"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs:1442-1446 | compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs:1486-1490 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs:1486\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs"},"region":{"startLine":1442}}}],"partialFingerprints":{"codehealthFindingId/v1":"1adca589d0dce66c8a15dcb3321476342081c252be3dcf98aba6fb6f5812d954"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs:1063-1067 | compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs:1160-1164 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs:1068\u0060 calls \u0060layout\u0060, \u0060simd_size_and_type\u0060 and \u0060compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs:1165\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":"compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs"},"region":{"startLine":1063}}}],"partialFingerprints":{"codehealthFindingId/v1":"79329da39e5162ad0d1d9343aafd2871e928b9c6e768768f07d3fcfb62ec1086"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): compiler/rustc_codegen_cranelift/src/num.rs:331-335 | compiler/rustc_codegen_cranelift/src/num.rs:337-341 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"compiler/rustc_codegen_cranelift/src/num.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"b950fac92422fbfa18a6100ed10168bcaac6f46d7825af8b2aa27c54e1a59002"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): compiler/rustc_codegen_cranelift/src/unsize.rs:250-254 | compiler/rustc_codegen_cranelift/src/value_and_place.rs:39-43 \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 \u0060compiler/rustc_codegen_cranelift/src/unsize.rs:250\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":"compiler/rustc_codegen_cranelift/src/unsize.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"be5cfecc33ead3b4d7e7974123b099bdd57f52817d3ea69a7015464faf1cdb8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): compiler/rustc_codegen_cranelift/src/value_and_place.rs:871-875 | compiler/rustc_codegen_cranelift/src/value_and_place.rs:900-904 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_codegen_cranelift/src/value_and_place.rs:871\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":"compiler/rustc_codegen_cranelift/src/value_and_place.rs"},"region":{"startLine":871}}}],"partialFingerprints":{"codehealthFindingId/v1":"1616a1d6adb3a9bdc35a498b8a107b39a3e4494f785fba2d72d11fd86200e4a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): compiler/rustc_codegen_gcc/src/builder.rs:1448-1452 | compiler/rustc_codegen_gcc/src/builder.rs:1473-1477 \u2014 both copies are in the same file, so extract the block 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":"compiler/rustc_codegen_gcc/src/builder.rs"},"region":{"startLine":1448}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e3655aa997012615ac662f291f27a9730d34bba6992e2d25def2d771067241b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): compiler/rustc_codegen_gcc/src/common.rs:292-296 | compiler/rustc_codegen_llvm/src/common.rs:409-413 \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 \u0060compiler/rustc_codegen_gcc/src/common.rs:292\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":"compiler/rustc_codegen_gcc/src/common.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"51f9be95a3cfa1bb74e89dda08ab51247ecfc2df7d47d5d089641d91bf1dc3c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): compiler/rustc_codegen_gcc/src/intrinsic/llvm.rs:15-19 | compiler/rustc_codegen_gcc/src/intrinsic/llvm.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":"compiler/rustc_codegen_gcc/src/intrinsic/llvm.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8b9bb147e5596d11993d3a24236502ba56e5bb839fd70e809e6572f78eb13e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): compiler/rustc_codegen_llvm/src/va_arg.rs:432-436 | compiler/rustc_codegen_llvm/src/va_arg.rs:541-545 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/va_arg.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"a05239d2651be3e10f8665ef329bf518839fc1d382485ab3aee0cf2270a2cad6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): compiler/rustc_const_eval/src/interpret/operator.rs:81-87 | compiler/rustc_const_eval/src/interpret/operator.rs:252-258 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_const_eval/src/interpret/operator.rs:81\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":"compiler/rustc_const_eval/src/interpret/operator.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"2466ff2d464b82ea37f1b0aae92ddb2b77ed92e9fc9e24a4ee9c8029ad74c96e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): compiler/rustc_hir/src/hir.rs:4935-4940 | compiler/rustc_hir/src/hir.rs:4947-4952 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_hir/src/hir.rs:4935\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":"compiler/rustc_hir/src/hir.rs"},"region":{"startLine":4935}}}],"partialFingerprints":{"codehealthFindingId/v1":"01bcd10355cda5cfb5942bf2f7786adbf0f4f065076655dd947f06809b9827ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): compiler/rustc_hir/src/hir.rs:5156-5160 | compiler/rustc_hir/src/hir.rs:5184-5188 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_hir/src/hir.rs:5156\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, \u0060compiler/rustc_hir/src/hir.rs:5161\u0060 calls \u0060Some\u0060, \u0060Expr\u0060, \u0060Closure\u0060 and \u0060compiler/rustc_hir/src/hir.rs:5189\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":"compiler/rustc_hir/src/hir.rs"},"region":{"startLine":5156}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec495356c15695ffc0f8f29672240e1b372bdf1b4e9cfba6add6a375b496f13a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): compiler/rustc_lint/src/context.rs:830-834 | compiler/rustc_lint/src/context.rs:879-883 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_lint/src/context.rs:830\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, \u0060compiler/rustc_lint/src/context.rs:884\u0060 calls \u0060Def\u0060, \u0060hir_get_if_local\u0060 and \u0060compiler/rustc_lint/src/context.rs:835\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_lint/src/context.rs"},"region":{"startLine":830}}}],"partialFingerprints":{"codehealthFindingId/v1":"409bb62b163144550ac6ddbd3a61e76c93678d8a03b3a9ef39d3bd6a68d82456"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): compiler/rustc_lint/src/types/improper_ctypes.rs:1124-1128 | compiler/rustc_lint/src/types/improper_ctypes.rs:1172-1176 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_lint/src/types/improper_ctypes.rs:1124\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":"compiler/rustc_lint/src/types/improper_ctypes.rs"},"region":{"startLine":1124}}}],"partialFingerprints":{"codehealthFindingId/v1":"f61e0e9354cab77b8833b0fe59e454f8bb493e5d55e589b4e09a3a8b9c0b9c78"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): compiler/rustc_mir_build/src/builder/scope.rs:1857-1861 | compiler/rustc_mir_build/src/builder/scope.rs:1940-1944 \u2014 both copies are in the same file, so extract the block 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":"compiler/rustc_mir_build/src/builder/scope.rs"},"region":{"startLine":1857}}}],"partialFingerprints":{"codehealthFindingId/v1":"de32ea8c2f5dad857a31136c48574531d06be6e45232429ae5355fe8e30d6a9b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): compiler/rustc_mir_transform/src/abort_unwinding_calls.rs:53-58 | compiler/rustc_mir_transform/src/ffi_unwind_calls.rs:27-32 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_mir_transform/src/abort_unwinding_calls.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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060tcx\u0060 to \u0060TyCtxt\u003C\u0027tcx\u003E\u0060 in one and \u0060TyCtxt\u003C\u0027_\u003E\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":"compiler/rustc_mir_transform/src/abort_unwinding_calls.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"14c7ed095d15f2b748bbaa53f550cc4983e265ea0018ff92398684dc05f494c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): compiler/rustc_mir_transform/src/check_alignment.rs:49-57 | compiler/rustc_mir_transform/src/check_null.rs:39-47 \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":"compiler/rustc_mir_transform/src/check_alignment.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6aef16786c2b1ddf33c60f7ede762ba875117b0d949ceef72a56aa34bba8039"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): compiler/rustc_mir_transform/src/shim.rs:279-283 | compiler/rustc_mir_transform/src/shim/async_destructor_ctor.rs:85-89 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060compiler/rustc_mir_transform/src/shim/async_destructor_ctor.rs:81\u0060 calls \u0060from\u0060, \u0060mk_place_field\u0060 and \u0060compiler/rustc_mir_transform/src/shim.rs:277\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":"compiler/rustc_mir_transform/src/shim.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbb3de8de46d1f5322b395dcc5c5ad03848bcc0710c6e1037a33e2d382693fd8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): compiler/rustc_next_trait_solver/src/solve/assembly/structural_traits.rs:238-244 | compiler/rustc_trait_selection/src/traits/effects.rs:392-398 \u2014 before extracting anything, compare \u0060compiler/rustc_next_trait_solver/src/solve/assembly/structural_traits.rs\u0060 and \u0060compiler/rustc_trait_selection/src/traits/effects.rs\u0060 as WHOLE FILES: this scan already matched 7 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. 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 \u0060compiler/rustc_next_trait_solver/src/solve/assembly/structural_traits.rs:238\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":"compiler/rustc_next_trait_solver/src/solve/assembly/structural_traits.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd54fb2803f5f321d7d4f29c50088097fabc57058c9c3aa9341ef2983a57287e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): compiler/rustc_trait_selection/src/error_reporting/infer/mod.rs:932-936 | compiler/rustc_trait_selection/src/error_reporting/infer/mod.rs:937-941 \u2014 both copies are in the same file, so extract the block 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":"compiler/rustc_trait_selection/src/error_reporting/infer/mod.rs"},"region":{"startLine":932}}}],"partialFingerprints":{"codehealthFindingId/v1":"7405f676da5f3af70ab800f5fd8888939d1faa0f20de43e6908c8137466da212"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): library/compiler-builtins/libm/src/math/j1.rs:135-139 | library/compiler-builtins/libm/src/math/j1f.rs:85-89 \u2014 before extracting anything, compare \u0060library/compiler-builtins/libm/src/math/j1.rs\u0060 and \u0060library/compiler-builtins/libm/src/math/j1f.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 55 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 \u0060library/compiler-builtins/libm/src/math/j1.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 first that the copies are not typed on the same thing: the declarations holding them bind \u0060x\u0060 to \u0060f64\u0060 in one and \u0060f32\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":"library/compiler-builtins/libm/src/math/j1.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"67188cd2f59c7494074806537ca244300d62e22cce9b54b7be46b539676c7808"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): library/compiler-builtins/libm/src/math/lgamma_r.rs:311-315 | library/compiler-builtins/libm/src/math/lgammaf_r.rs:246-250 \u2014 before extracting anything, compare \u0060library/compiler-builtins/libm/src/math/lgamma_r.rs\u0060 and \u0060library/compiler-builtins/libm/src/math/lgammaf_r.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 91 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 \u0060library/compiler-builtins/libm/src/math/lgamma_r.rs:311\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":"library/compiler-builtins/libm/src/math/lgamma_r.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"5975713ebc0ad8f18dba0d8e336019d41d1430f2a2d9925d5e8afa273be6b28c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): library/compiler-builtins/libm/src/math/rem_pio2_large.rs:440-444 | library/compiler-builtins/libm/src/math/rem_pio2_large.rs:445-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/compiler-builtins/libm/src/math/rem_pio2_large.rs"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b370b75c11572c3e30e0d65531f21aa3fe864bfaec1cfc67fe132ce51b0ab36"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): library/core/src/num/imp/flt2dec/strategy/dragon.rs:152-156 | library/core/src/num/imp/flt2dec/strategy/dragon.rs:301-305 | library/core/src/num/imp/flt2dec/strategy/grisu.rs:171-175 \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":"library/core/src/num/imp/flt2dec/strategy/dragon.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba6347203b57b0bc0b4d8f3fbdeb0c4836f3ce967a5b29af6e46cde91b192da3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): library/std/src/sys/fs/unix.rs:1634-1638 | library/std/src/sys/fs/unix.rs:2243-2247 \u2014 both copies are in the same file, so extract the block 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":"library/std/src/sys/fs/unix.rs"},"region":{"startLine":1634}}}],"partialFingerprints":{"codehealthFindingId/v1":"b75b681ec194ef350b195312b5e8e09e4d6f996518032f439a548080fc440bd3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): library/std/src/sys/pal/sgx/abi/usercalls/alloc.rs:437-441 | library/std/src/sys/pal/sgx/abi/usercalls/alloc.rs:503-507 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/std/src/sys/pal/sgx/abi/usercalls/alloc.rs:437\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":"library/std/src/sys/pal/sgx/abi/usercalls/alloc.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d644169efd8eea73857ef514de01b1ac1a31eb4aa3522495ffc8949c9637a07"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): library/std/src/sys/process/unix/common.rs:363-367 | library/std/src/sys/process/windows.rs:355-359 \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":"library/std/src/sys/process/unix/common.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa967f2a0430eaa14964a07d6b24e2ef4621b74b1bdbee7a8ea669b840a32563"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): library/stdarch/crates/core_arch/src/x86/avx2.rs:3360-3364 | library/stdarch/crates/core_arch/src/x86/avx2.rs:3416-3420 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/stdarch/crates/core_arch/src/x86/avx2.rs:3360\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":"library/stdarch/crates/core_arch/src/x86/avx2.rs"},"region":{"startLine":3360}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0be979f34eda8a0e52fcf543c89f864d217a9cde705e7dd03b8678b9631c1bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): library/stdarch/crates/core_arch/src/x86/avx512dq.rs:1265-1270 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:28451-28456 \u2014 before extracting anything, compare \u0060library/stdarch/crates/core_arch/src/x86/avx512dq.rs\u0060 and \u0060library/stdarch/crates/core_arch/src/x86/avx512f.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 53 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":"library/stdarch/crates/core_arch/src/x86/avx512dq.rs"},"region":{"startLine":1265}}}],"partialFingerprints":{"codehealthFindingId/v1":"94be73cb8211b8e522404e72aa636fa85ce9a5bf4eb9f4aaae9a70779e2aea20"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): library/stdarch/crates/core_arch/src/x86/avx512f.rs:26079-26084 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:26186-26191 \u2014 both copies are in the same file, so extract the block 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":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":26079}}}],"partialFingerprints":{"codehealthFindingId/v1":"331226f439df3362bba99c541b00ae67ef326e488251a7ded557f94798f76908"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): library/stdarch/crates/core_arch/src/x86/avx512f.rs:26095-26100 | library/stdarch/crates/core_arch/src/x86/avx512f.rs:26202-26207 \u2014 both copies are in the same file, so extract the block 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":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":26095}}}],"partialFingerprints":{"codehealthFindingId/v1":"273e4c1dcffe7fe6e1c1b2673a8c45a2608b53d922a5ed881cc232b15fca962f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): library/stdarch/crates/core_arch/src/x86/kl.rs:274-278 | library/stdarch/crates/core_arch/src/x86/kl.rs:297-301 | library/stdarch/crates/core_arch/src/x86/kl.rs:320-324 | library/stdarch/crates/core_arch/src/x86/kl.rs:343-347 \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 \u0060library/stdarch/crates/core_arch/src/x86/kl.rs:274\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":"library/stdarch/crates/core_arch/src/x86/kl.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"d420328b96983894573470d05217cb47cc00bcbdf1143228971eddd685920aed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): library/stdarch/crates/core_arch/src/x86/ssse3.rs:210-214 | library/stdarch/crates/core_arch/src/x86/ssse3.rs:268-272 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/stdarch/crates/core_arch/src/x86/ssse3.rs:210\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/ssse3.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"d85cb6aeec92654f997021d8103e2e580cee7153c2fee12770fa64fa89ab0dbd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/librustdoc/html/render/sidebar.rs:412-417 | src/librustdoc/html/render/sidebar.rs:652-657 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/librustdoc/html/render/sidebar.rs:412\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/librustdoc/html/render/sidebar.rs"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"d52364aed4f9e0f532d28f85498d0dc5b6f88ac3ec217b789abc2634b03ef65f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/tools/clippy/clippy_lints/src/manual_pop_if.rs:209-213 | src/tools/clippy/clippy_lints/src/manual_pop_if.rs:368-372 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/tools/clippy/clippy_lints/src/manual_pop_if.rs:373\u0060 calls \u0060typeck_results\u0060, \u0060expr_ty\u0060, \u0060is_bool\u0060 and \u0060src/tools/clippy/clippy_lints/src/manual_pop_if.rs:214\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/tools/clippy/clippy_lints/src/manual_pop_if.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"67b74893d11349764c2c3a9cc8f955c9a538c0697ea4d402f2417bf4e28cd493"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/tools/clippy/clippy_lints/src/needless_nonzero_get.rs:88-92 | src/tools/clippy/clippy_lints/src/needless_nonzero_get.rs:99-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/tools/clippy/clippy_lints/src/needless_nonzero_get.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4168121772da1e364401ffe8866cadfe101512baa39be89eeb802228f55394f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/tools/miri/src/shims/unix/foreign_items.rs:569-573 | src/tools/miri/src/shims/unix/linux/foreign_items.rs:119-123 \u2014 before extracting anything, compare \u0060src/tools/miri/src/shims/unix/foreign_items.rs\u0060 and \u0060src/tools/miri/src/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/tools/miri/src/shims/unix/linux/foreign_items.rs:118\u0060 calls \u0060read_scalar\u0060, \u0060to_i32\u0060 and \u0060src/tools/miri/src/shims/unix/foreign_items.rs:567\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/tools/miri/src/shims/unix/foreign_items.rs"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"4126b785ad6593370075ef92a2fc7b283709079e20f35178c2fb807ab8028f50"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/tools/run-make-support/src/obj.rs:129-133 | src/tools/run-make-support/src/obj.rs:164-168 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/run-make-support/src/obj.rs:129\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/tools/run-make-support/src/obj.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff3fc268b3c57ddc32c6d2ec8d6f43da6c5994eb4979daaf87968151546ffa48"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-expand/src/builtin/fn_macro.rs:552-557 | src/tools/rust-analyzer/crates/hir-expand/src/builtin/fn_macro.rs:659-664 \u2014 both copies are in the same file, so extract the block 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/tools/rust-analyzer/crates/hir-expand/src/builtin/fn_macro.rs"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"5de7d979fc52f39c07ee50f04109b7462051e7924bb2a6224ad1484de8b1e89a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-ide/src/display.rs:877-881 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/consts/valtree.rs:121-125 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tools/rust-analyzer/crates/hir-ide/src/display.rs:877\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/tools/rust-analyzer/crates/hir-ide/src/display.rs"},"region":{"startLine":877}}}],"partialFingerprints":{"codehealthFindingId/v1":"a16c38ca1b8c04c3852e69ffe71fe9458fda10e6e39c50914918df98f3472db2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-ty/src/infer.rs:2387-2392 | src/tools/rust-analyzer/crates/hir-ty/src/infer.rs:2394-2399 \u2014 both copies are in the same file, so extract the block 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/tools/rust-analyzer/crates/hir-ty/src/infer.rs"},"region":{"startLine":2387}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d00e9bc4a5e8b1ef88faab114a5ecde0395f32a1f8e92ca9c9b25e3b4d96e64"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-ty/src/mir/eval.rs:1880-1886 | src/tools/rust-analyzer/crates/hir-ty/src/mir/eval.rs:1908-1914 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/hir-ty/src/mir/eval.rs:1880\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/tools/rust-analyzer/crates/hir-ty/src/mir/eval.rs"},"region":{"startLine":1880}}}],"partialFingerprints":{"codehealthFindingId/v1":"74ab9e7e97c4138cef56f3179b566bc2a22c51f6d12aebd5f03b0871f8d544a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/tools/rust-analyzer/crates/hir-ty/src/next_solver/def_id.rs:247-251 | src/tools/rust-analyzer/crates/hir-ty/src/next_solver/def_id.rs:273-277 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/hir-ty/src/next_solver/def_id.rs:247\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 \u0060value\u0060 to \u0060SolverDefId\u003C\u0027_\u003E\u0060 in one and \u0060SolverDefId\u003C\u0027db\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/tools/rust-analyzer/crates/hir-ty/src/next_solver/def_id.rs:278\u0060 calls \u0060AnonConstId\u0060, \u0060into\u0060 and \u0060src/tools/rust-analyzer/crates/hir-ty/src/next_solver/def_id.rs:252\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/tools/rust-analyzer/crates/hir-ty/src/next_solver/def_id.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"38e486c13917764e32a85e0809e90a65ec88c7b6329c1e694edb0a8e9aac532d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/tools/rust-analyzer/crates/hir/src/display.rs:393-397 | src/tools/rust-analyzer/crates/hir/src/display.rs:436-440 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir/src/display.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc37e4dc8254b8b2e5cc205bb1c7d8c737e7ab489c471f6c4dc9596db9fcf80c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/tools/rust-analyzer/crates/hir/src/lib.rs:487-491 | src/tools/rust-analyzer/crates/hir/src/lib.rs:502-506 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/hir/src/lib.rs:487\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/tools/rust-analyzer/crates/hir/src/lib.rs"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"615c1b0681fea8ca182688a8feefba67fcec6feef2bfd17d3fdb23daae8f6f78"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/tools/rust-analyzer/crates/hir/src/term_search/tactics.rs:480-484 | src/tools/rust-analyzer/crates/hir/src/term_search/tactics.rs:660-664 \u2014 both copies are in the same file, so extract the block 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/tools/rust-analyzer/crates/hir/src/term_search/tactics.rs"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7fb850c71ed6158d9cb8c024774fa51c53122839d55ca22ea8fb77905fb5b57"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/tools/rust-analyzer/crates/ide-assists/src/handlers/move_from_mod_rs.rs:24-28 | src/tools/rust-analyzer/crates/ide-assists/src/handlers/move_to_mod_rs.rs:24-28 \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/tools/rust-analyzer/crates/ide-assists/src/handlers/move_from_mod_rs.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"f36aa4d4ee551f9c6363f5f089d9a5e9a6175b452e855cf2454673e7716e1760"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): src/tools/rust-analyzer/crates/ide-assists/src/utils/gen_trait_fn_body.rs:120-124 | src/tools/rust-analyzer/crates/ide-assists/src/utils/gen_trait_fn_body.rs:384-388 | src/tools/rust-analyzer/crates/ide-assists/src/utils/gen_trait_fn_body.rs:655-659 \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/tools/rust-analyzer/crates/ide-assists/src/utils/gen_trait_fn_body.rs:120\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/tools/rust-analyzer/crates/ide-assists/src/utils/gen_trait_fn_body.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ff00f315a84ba42dffc704055134f9f990028389994f6fe5264962ce3db4244"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/tools/rust-analyzer/crates/ide-completion/src/completions/item_list/trait_impl.rs:296-301 | src/tools/rust-analyzer/crates/ide-completion/src/completions/item_list/trait_impl.rs:327-332 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/tools/rust-analyzer/crates/ide-completion/src/completions/item_list/trait_impl.rs:334\u0060 calls \u0060reset_indent\u0060 and \u0060src/tools/rust-analyzer/crates/ide-completion/src/completions/item_list/trait_impl.rs:305\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/tools/rust-analyzer/crates/ide-completion/src/completions/item_list/trait_impl.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb2213751dd1b2b4b6206e62f3f6095934c97e51e009ed0a5281b031291d155a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/tools/rust-analyzer/crates/ide-diagnostics/src/handlers/explicit_drop_method_use.rs:69-73 | src/tools/rust-analyzer/crates/ide-diagnostics/src/handlers/explicit_drop_method_use.rs:107-111 \u2014 both copies are in the same file, so extract the block 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/tools/rust-analyzer/crates/ide-diagnostics/src/handlers/explicit_drop_method_use.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"285a598087e52b979538f1a8d8bd32356447705bfc04d6de0577e5091c5cfee4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/tools/rust-analyzer/crates/ide/src/doc_links.rs:524-529 | src/tools/rust-analyzer/crates/ide/src/doc_links.rs:533-538 \u2014 both copies are in the same file, so extract the block 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/tools/rust-analyzer/crates/ide/src/doc_links.rs"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2807a0692bb4a6b18a16c8edb64dbd928f845701c2b1a72d92520e5f547f27a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:2343-2347 | src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:2362-2366 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:2343\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/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:2348\u0060 calls \u0060Some\u0060, \u0060map_node\u0060, \u0060syntax\u0060 and \u0060src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs:2367\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/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs"},"region":{"startLine":2343}}}],"partialFingerprints":{"codehealthFindingId/v1":"af7bbda16a1644f651731a7e92c5b4bce7819d424dc9e9402c5b9438f7a9caa4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/tools/rust-analyzer/crates/syntax/src/ast/token_ext.rs:310-314 | src/tools/rust-analyzer/crates/syntax/src/ast/token_ext.rs:356-360 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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/tools/rust-analyzer/crates/syntax/src/ast/token_ext.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbdb6d084b86c9dfa390f1935cacca26a7e60023841bff0111d25c6cf605289c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/tools/rustfmt/src/vertical.rs:47-51 | src/tools/rustfmt/src/vertical.rs:86-90 \u2014 both copies are in the same file, so extract the block 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/tools/rustfmt/src/vertical.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"b81d9e9918e8e6df17b3001337a148523577d2bbe6462057fa8e923eb08d4963"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (34\u201337 lines \u00D7 2): src/etc/debugger_tester/gdb/check_gdb.py:228-261 | src/etc/debugger_tester/lldb/check_lldb.py:310-346 \u2014 \u0060src/etc/debugger_tester/gdb/check_gdb.py\u0060 and \u0060src/etc/debugger_tester/lldb/check_lldb.py\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 92 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/etc/debugger_tester/gdb/check_gdb.py"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe6f44a68d54c95d3582441d7439f1505472c243f67b33535bb45df8b236f318"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): library/compiler-builtins/ci/ci-util.py:350-377 | library/compiler-builtins/etc/update-api-list.py:241-268 \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 \u0060library/compiler-builtins/ci/ci-util.py:350\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/compiler-builtins/ci/ci-util.py"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"68412f5c21e7c2eb8db0e41a2a0badd374cc54b8c49c5be9f19b3643d3049587"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26\u201328 lines \u00D7 2): src/etc/lldb_providers.py:429-456 | src/etc/lldb_providers.py:467-492 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/etc/lldb_providers.py:429\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/etc/lldb_providers.py"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb0bb4d0cecfec4f59eef7901fd346ec09861034fa81b5751f0b1af57d2c3818"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): src/etc/debugger_tester/gdb/check_gdb.py:318-338 | src/etc/debugger_tester/lldb/check_lldb.py:461-481 \u2014 \u0060src/etc/debugger_tester/gdb/check_gdb.py\u0060 and \u0060src/etc/debugger_tester/lldb/check_lldb.py\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 92 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. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/etc/debugger_tester/gdb/check_gdb.py"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"520214adc7683801d74e1f6c22e1f87ed834242cc66253c3f2392a3a7d9bb789"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): src/etc/lldb_providers.py:890-907 | src/etc/lldb_providers.py:956-972 \u2014 both copies are in the same file, so extract the block 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/etc/lldb_providers.py"},"region":{"startLine":890}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dabd61171324a8e5c6eecb2c36f53b824001e2a96a05101d8fc4d41772f7353"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 2): src/etc/lldb_providers.py:910-925 | src/etc/lldb_providers.py:989-1002 \u2014 both copies are in the same file, so extract the block 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/etc/lldb_providers.py"},"region":{"startLine":910}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbabc4e0b2c0fcdb8f09f6a9e890c09266ad5798d37e879eae192ee7b6dac48e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): src/etc/debugger_tester/gdb/check_gdb.py:130-142 | src/etc/debugger_tester/lldb/check_lldb.py:202-215 \u2014 \u0060src/etc/debugger_tester/gdb/check_gdb.py\u0060 and \u0060src/etc/debugger_tester/lldb/check_lldb.py\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 92 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/etc/debugger_tester/lldb/check_lldb.py: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 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/etc/debugger_tester/gdb/check_gdb.py"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"c98003fceb80332a79c3133611db49587fd0ee827ec0233954c67cff5aa52c82"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): src/etc/debugger_tester/common.py:637-649 | src/etc/debugger_tester/lldb/check_lldb.py:163-174 \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/etc/debugger_tester/common.py"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"074a20c30a29db34644b0517dc5947ca839329d7ac837f1ef1f98b1f4ab3375d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/etc/gdb_trim_paths.py:20-34 | src/etc/lldb_trim_paths.py:21-33 \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/etc/gdb_trim_paths.py"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b2928ae9f2ef7a72ce91e20a76d97959dae45b5712417ecdfba603bfd36f215"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/etc/lldb_providers.py:877-889 | src/etc/lldb_providers.py:936-948 \u2014 both copies are in the same file, so extract the block 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/etc/lldb_providers.py"},"region":{"startLine":877}}}],"partialFingerprints":{"codehealthFindingId/v1":"48a761b7fed544a376ab2d808455720075af07f7f4b00028e08bb4ddb6ab508f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): src/etc/lldb_providers.py:1423-1433 | src/etc/lldb_providers.py:1494-1505 \u2014 both copies are in the same file, so extract the block 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/etc/lldb_providers.py"},"region":{"startLine":1423}}}],"partialFingerprints":{"codehealthFindingId/v1":"a93ecc9e8023d4c15d692f7994a97d3f4f4bec3f1e59d05b0dcc4d6d5562b8d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/etc/debugger_tester/gdb/check_gdb.py:45-55 | src/etc/debugger_tester/lldb/check_lldb.py:57-67 \u2014 \u0060src/etc/debugger_tester/gdb/check_gdb.py\u0060 and \u0060src/etc/debugger_tester/lldb/check_lldb.py\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 92 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. 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/etc/debugger_tester/gdb/check_gdb.py"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"16bf919b5f55cd35cc5fb007a93c6df91e0456c824edf020ca0db2c7091a8b42"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/etc/debugger_tester/gdb/check_gdb.py:60-68 | src/etc/debugger_tester/lldb/check_lldb.py:72-80 \u2014 \u0060src/etc/debugger_tester/gdb/check_gdb.py\u0060 and \u0060src/etc/debugger_tester/lldb/check_lldb.py\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 92 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. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/etc/debugger_tester/gdb/check_gdb.py"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"065678726aa7720bb91dfe8016be997f6a5d37e650ab5f2eddf7bf70d7166d0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/etc/debugger_tester/lldb/check_lldb.py:416-420 | src/etc/debugger_tester/lldb/check_lldb.py:422-426 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/etc/debugger_tester/lldb/check_lldb.py"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"8122cae516b8236b87a86cf92e789666197c3e23aa103d295d8e70551ad59860"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (67 shared lines): compiler/rustc_codegen_cranelift/example/std_example.rs:17-187 | compiler/rustc_codegen_gcc/example/std_example.rs:14-111 \u2014 These two members are variants of one another: 67 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/example/std_example.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"02bb59a1c0776c2724af5b154c1ddc0d0776068e1e99ce5e26e4e7e0398e6fd4"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (61 shared lines): compiler/rustc_codegen_cranelift/example/mini_core_hello_world.rs:155-357 | compiler/rustc_codegen_gcc/example/mini_core_hello_world.rs:145-310 \u2014 These two members are variants of one another: 61 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/example/mini_core_hello_world.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5462a08bef63100800474be2417eed8eb4420fcdb61ff31dd45d6ded8c27a71"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): compiler/rustc_codegen_cranelift/example/subslice-patterns-const-eval.rs:73-102 | compiler/rustc_codegen_gcc/example/subslice-patterns-const-eval.rs:68-97 \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":"compiler/rustc_codegen_cranelift/example/subslice-patterns-const-eval.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4ea1ca94601358d8c0f480f8167ecb603ff797fb2fb86a1844469e9f0078840"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): compiler/rustc_codegen_cranelift/example/std_example.rs:315-338 | compiler/rustc_codegen_gcc/example/std_example.rs:145-168 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/example/std_example.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"36fbde2c563743dbca75d971723df2a16d7670e71ffd4aaf4ffa9730feec84ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): compiler/rustc_codegen_gcc/build_system/src/fuzz/reduce.rs:177-220 | compiler/rustc_codegen_gcc/build_system/src/fuzz/reduce.rs:223-261 \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":"compiler/rustc_codegen_gcc/build_system/src/fuzz/reduce.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"77716c783460a89a40bb33f210d3c256fc65a44a248cae94ad976f1b25869fb5"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): library/portable-simd/crates/test_helpers/src/lib.rs:331-346 | library/portable-simd/crates/test_helpers/src/lib.rs:369-384 | library/portable-simd/crates/test_helpers/src/lib.rs:408-434 | library/portable-simd/crates/test_helpers/src/lib.rs:448-463 \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":"library/portable-simd/crates/test_helpers/src/lib.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"cefa4a59a3873359410f822107bb76b67445d0f4a7d44a86e1ce5460d55ae717"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): src/bootstrap/src/core/build_steps/test.rs:720-792 | src/bootstrap/src/core/build_steps/test.rs:898-937 \u2014 These two members are one piece of code written twice and then edited apart: 40 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/build_steps/test.rs"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"abf14f6615c57e732d7612024ce61829398ab9b4b7851050e802aeafa1385bb9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (45 corresponding lines): compiler/rustc_codegen_gcc/build_system/src/fuzz/reduce.rs:264-308 | compiler/rustc_codegen_gcc/build_system/src/fuzz/reduce.rs:314-358 \u2014 These two members are one piece of code written twice and then edited apart: 45 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_gcc/build_system/src/fuzz/reduce.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa3f3ad19093934f8b5ff74d57ac52a4db799c77ab0d067670695c21efb76335"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): src/tools/miri/test-cargo-miri/subcrate/main.rs:4-33 | src/tools/miri/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":"src/tools/miri/test-cargo-miri/subcrate/main.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"f40988e36fe55f3e68e7a4e35f69c8184a8e1ddea0351bc68e546b80e9382b33"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): src/ci/docker/scripts/fuchsia-test-runner.py:30-52 | src/ci/docker/scripts/fuchsia-test-runner.py:58-93 \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/ci/docker/scripts/fuchsia-test-runner.py"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"87c7857b4bf1705443473137a5a9e46db00ec82e637e7ba20e78cb71eaaabc30"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): src/bootstrap/src/core/build_steps/test.rs:4569-4603 | src/bootstrap/src/core/build_steps/test.rs:4689-4714 \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/bootstrap/src/core/build_steps/test.rs"},"region":{"startLine":4569}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbc5cd1306a74c7937124ffcf0c4dc8c0177c78167a04feae28edb9657588c3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): library/portable-simd/crates/test_helpers/src/lib.rs:484-498 | library/portable-simd/crates/test_helpers/src/lib.rs:519-533 | library/portable-simd/crates/test_helpers/src/lib.rs:560-578 \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":"library/portable-simd/crates/test_helpers/src/lib.rs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"f949e3da44bbe5fe83b88374f0e34ee073b9f7da67340b1d6e194a0a7fd9dbe9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): compiler/rustc_codegen_cranelift/example/std_example.rs:620-635 | compiler/rustc_codegen_cranelift/example/std_example.rs:639-654 \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":"compiler/rustc_codegen_cranelift/example/std_example.rs"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"d475bcca84a00be611a984307a8dff9e4f74433525b101b70909b0e62cf40c64"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): library/portable-simd/crates/test_helpers/src/lib.rs:192-206 | library/portable-simd/crates/test_helpers/src/lib.rs:227-241 \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":"library/portable-simd/crates/test_helpers/src/lib.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"55d37abc1e0c3f21a2aa2e2867187112e49cdcb748f3b88786396c0c3b1418ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): src/bootstrap/src/core/build_steps/test.rs:4149-4173 | src/bootstrap/src/core/build_steps/test.rs:4176-4199 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/build_steps/test.rs"},"region":{"startLine":4149}}}],"partialFingerprints":{"codehealthFindingId/v1":"6041799d0d62f5a609ef992bda0ba86f1b223cb86c045534f0db27273ce441d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): library/alloc/src/collections/vec_deque/spec_extend.rs:18-41 | library/alloc/src/collections/vec_deque/spec_extend.rs:132-155 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/alloc/src/collections/vec_deque/spec_extend.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1262ef74fdd0617bc13341d48328fc01f581bfeb55001055d1758152c4db151"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): compiler/rustc_codegen_cranelift/example/mini_core_hello_world.rs:98-112 | compiler/rustc_codegen_gcc/example/mini_core_hello_world.rs:90-99 \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":"compiler/rustc_codegen_cranelift/example/mini_core_hello_world.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"f966b7317a32cc5b65c08e5fb7956c98ae2c250b25d3d43e9634f400999b3b6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 26\u002B corresponding lines): src/bootstrap/src/core/build_steps/test.rs:1891-1916 | src/bootstrap/src/core/build_steps/test.rs:1937-1962 | src/bootstrap/src/core/build_steps/test.rs:4947-4972 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 26 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/build_steps/test.rs"},"region":{"startLine":1891}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f396e6acfae582c65f76a9f2680f1504b3f3710cb4447e7301bf11b4043c2b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): compiler/rustc_codegen_cranelift/example/std_example.rs:673-688 | compiler/rustc_codegen_cranelift/example/std_example.rs:693-708 | compiler/rustc_codegen_cranelift/example/std_example.rs:713-728 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/example/std_example.rs"},"region":{"startLine":673}}}],"partialFingerprints":{"codehealthFindingId/v1":"566f18544796732e5c5df1507321cec991ff35fed85bd726d673dcbebda4bf6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): library/alloc/src/collections/vec_deque/spec_extend.rs:213-232 | library/alloc/src/collections/vec_deque/spec_extend.rs:239-260 \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":"library/alloc/src/collections/vec_deque/spec_extend.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc3ce64097da26f481b9388568efdf807dc3b352bb0ed640f82557f59a79a433"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 6\u002B corresponding lines): compiler/rustc_codegen_cranelift/example/std_example.rs:457-462 | compiler/rustc_codegen_cranelift/example/std_example.rs:553-559 | compiler/rustc_codegen_gcc/example/std_example.rs:279-284 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 6 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/example/std_example.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"5084acc5d5b203fca3762a9328226ec6ff8201bdbfb9c44f8a63dfd98601a29f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): src/tools/rust-analyzer/crates/test-fixture/src/lib.rs:146-153 | src/tools/rust-analyzer/crates/test-fixture/src/lib.rs:159-170 | src/tools/rust-analyzer/crates/test-fixture/src/lib.rs:216-226 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/test-fixture/src/lib.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6edcf390ce3aa9db5f589461b07b27d56dda3911d5944452572c071b0c42eba"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): compiler/rustc_codegen_cranelift/example/mini_core_hello_world.rs:118-124 | compiler/rustc_codegen_gcc/example/mini_core_hello_world.rs:128-132 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/example/mini_core_hello_world.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"75542640faf2187e582fe8429c7cf2c48ed55e0bca6d5aa2b6b7c1c80aae0ab4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): compiler/rustc_codegen_cranelift/example/std_example.rs:421-426 | compiler/rustc_codegen_gcc/example/std_example.rs:243-246 \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":"compiler/rustc_codegen_cranelift/example/std_example.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"ede4e0fceed3ff60528a8641cade7df7f4b5d3ab19b6eb366de589ef9b93be0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (37 lines \u00D7 2): compiler/rustc_codegen_cranelift/example/std_example.rs:20-56 | compiler/rustc_codegen_gcc/example/std_example.rs:15-51 \u2014 before extracting anything, compare \u0060compiler/rustc_codegen_cranelift/example/std_example.rs\u0060 and \u0060compiler/rustc_codegen_gcc/example/std_example.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 153 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060compiler/rustc_codegen_cranelift/example/std_example.rs:58\u0060 calls \u0060checked_mul\u0060 and \u0060compiler/rustc_codegen_gcc/example/std_example.rs:53\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":"compiler/rustc_codegen_cranelift/example/std_example.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"4424f786c9edaecf8fab2fa05421033530d8446e1c152e32d282f7fc6669bc3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): compiler/rustc_codegen_cranelift/example/std_example.rs:75-99 | compiler/rustc_codegen_gcc/example/std_example.rs:67-91 \u2014 before extracting anything, compare \u0060compiler/rustc_codegen_cranelift/example/std_example.rs\u0060 and \u0060compiler/rustc_codegen_gcc/example/std_example.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 153 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":"compiler/rustc_codegen_cranelift/example/std_example.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c93584d55f2c8e88485abce2e879db67af24939d55aaa62fb25d85a356ee967"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): compiler/rustc_codegen_cranelift/example/track-caller-attribute.rs:21-40 | compiler/rustc_codegen_gcc/example/track-caller-attribute.rs:21-40 \u2014 before extracting anything, compare \u0060compiler/rustc_codegen_cranelift/example/track-caller-attribute.rs\u0060 and \u0060compiler/rustc_codegen_gcc/example/track-caller-attribute.rs\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. 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":"compiler/rustc_codegen_cranelift/example/track-caller-attribute.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cb9ae577febc6f274ad07e41c26cf9ec31d379cbdbaab170fbfbad37a25633c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201318 lines \u00D7 3): compiler/rustc_codegen_gcc/build_system/src/fuzz/reduce.rs:178-187 | compiler/rustc_codegen_gcc/build_system/src/fuzz/reduce.rs:224-235 | compiler/rustc_codegen_gcc/build_system/src/fuzz/reduce.rs:265-282 \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 \u0060compiler/rustc_codegen_gcc/build_system/src/fuzz/reduce.rs:178\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":"compiler/rustc_codegen_gcc/build_system/src/fuzz/reduce.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"74167a5270a20238909f9c2ef6b2a87d317335aef4ae6fc40155b0071a069aa6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201318 lines \u00D7 3): src/tools/miri/test-cargo-miri/src/main.rs:34-49 | src/tools/miri/test-cargo-miri/subcrate/main.rs:14-30 | src/tools/miri/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 \u0060src/tools/miri/test-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":"src/tools/miri/test-cargo-miri/src/main.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e630810f3fec9718e1919e9f1cdff538c95826af81f7e143cb2c9df13d8f55c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): compiler/rustc_codegen_cranelift/example/mini_core.rs:632-647 | compiler/rustc_codegen_gcc/example/mini_core.rs:641-656 \u2014 before extracting anything, compare \u0060compiler/rustc_codegen_cranelift/example/mini_core.rs\u0060 and \u0060compiler/rustc_codegen_gcc/example/mini_core.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 34 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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":"compiler/rustc_codegen_cranelift/example/mini_core.rs"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4926f0b9fe633169708b95fab429571f347671f933b8e2d969a14f538e24d23"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201316 lines \u00D7 2): src/bootstrap/src/core/build_steps/test.rs:772-787 | src/bootstrap/src/core/build_steps/test.rs:924-932 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/bootstrap/src/core/build_steps/test.rs:772\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/build_steps/test.rs"},"region":{"startLine":772}}}],"partialFingerprints":{"codehealthFindingId/v1":"636cc5929ce99562d7fac551ca9d97216a83ed2854433f32f63e275746e96751"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): compiler/rustc_codegen_cranelift/example/mini_core_hello_world.rs:194-208 | compiler/rustc_codegen_gcc/example/mini_core_hello_world.rs:176-190 \u2014 before extracting anything, compare \u0060compiler/rustc_codegen_cranelift/example/mini_core_hello_world.rs\u0060 and \u0060compiler/rustc_codegen_gcc/example/mini_core_hello_world.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 73 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":"compiler/rustc_codegen_cranelift/example/mini_core_hello_world.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"d858c05d1961f639124199f18f9e074399c1cbf1ecabd65e2a33203d82fc544f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): compiler/rustc_codegen_cranelift/example/mini_core_hello_world.rs:229-241 | compiler/rustc_codegen_gcc/example/mini_core_hello_world.rs:212-224 \u2014 before extracting anything, compare \u0060compiler/rustc_codegen_cranelift/example/mini_core_hello_world.rs\u0060 and \u0060compiler/rustc_codegen_gcc/example/mini_core_hello_world.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 73 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 \u0060compiler/rustc_codegen_cranelift/example/mini_core_hello_world.rs:229\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":"compiler/rustc_codegen_cranelift/example/mini_core_hello_world.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc4a549747ee62dc827dd92264753be09be7453c337edb0732a691cec409570b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201313 lines \u00D7 2): compiler/rustc_codegen_cranelift/example/mini_core_hello_world.rs:245-254 | compiler/rustc_codegen_gcc/example/mini_core_hello_world.rs:228-240 \u2014 before extracting anything, compare \u0060compiler/rustc_codegen_cranelift/example/mini_core_hello_world.rs\u0060 and \u0060compiler/rustc_codegen_gcc/example/mini_core_hello_world.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 73 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 \u0060compiler/rustc_codegen_cranelift/example/mini_core_hello_world.rs:245\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/example/mini_core_hello_world.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"7581526478997bd7de6262ac3c4b32805abfbc0170e666c251959d650bed8787"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): compiler/rustc_codegen_gcc/build_system/src/test.rs:1198-1209 | compiler/rustc_codegen_gcc/build_system/src/test.rs:1396-1407 \u2014 both copies are in the same file, so extract the block 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":"compiler/rustc_codegen_gcc/build_system/src/test.rs"},"region":{"startLine":1198}}}],"partialFingerprints":{"codehealthFindingId/v1":"adca27e3e32a529844f6b4c4b15040cbeecac2f9c800e718cb623e2f22d72cbc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/bootstrap/src/core/build_steps/test.rs:1515-1526 | src/bootstrap/src/core/build_steps/test.rs:1677-1688 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/bootstrap/src/core/build_steps/test.rs:1515\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/bootstrap/src/core/build_steps/test.rs"},"region":{"startLine":1515}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e4fe12e77f9a9ee93e0c237842c1464a6d7f31fffcafc137e882aa19794941b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/bootstrap/src/core/build_steps/test.rs:4570-4581 | src/bootstrap/src/core/build_steps/test.rs:4690-4701 \u2014 both copies are in the same file, so extract the block 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/bootstrap/src/core/build_steps/test.rs"},"region":{"startLine":4570}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaa5d1b5bdef57c6deef5f1d667cc902c686ef771dc59584bebb3057e5e73f63"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): compiler/rustc_codegen_cranelift/example/std_example.rs:366-377 | compiler/rustc_codegen_gcc/example/std_example.rs:200-211 \u2014 before extracting anything, compare \u0060compiler/rustc_codegen_cranelift/example/std_example.rs\u0060 and \u0060compiler/rustc_codegen_gcc/example/std_example.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 153 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 \u0060compiler/rustc_codegen_cranelift/example/std_example.rs:366\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":"compiler/rustc_codegen_cranelift/example/std_example.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b9507234ad87e7ed76bd35662f74ceeec9bd3fc1e99d9b6d2dc89af4dc2f86a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): library/portable-simd/crates/test_helpers/src/lib.rs:193-202 | library/portable-simd/crates/test_helpers/src/lib.rs:228-237 | library/portable-simd/crates/test_helpers/src/lib.rs:263-272 \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 \u0060library/portable-simd/crates/test_helpers/src/lib.rs:193\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, \u0060library/portable-simd/crates/test_helpers/src/lib.rs:262\u0060 calls \u0060flush\u0060, \u0060fs\u0060, \u0060flush_in\u0060 and \u0060library/portable-simd/crates/test_helpers/src/lib.rs:192\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":"library/portable-simd/crates/test_helpers/src/lib.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4123368b1531db179dd7fbcd5b676c46c1c98448e902ff83d2badd6b5f86987"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (37\u201340 lines \u00D7 2): compiler/rustc_codegen_cranelift/example/dst-field-align.rs:30-66 | compiler/rustc_codegen_gcc/example/dst-field-align.rs:28-67 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_codegen_cranelift/example/dst-field-align.rs:30\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":"compiler/rustc_codegen_cranelift/example/dst-field-align.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"283a5773e0bcff3d5fc839012c850902d6118242534b9daf17f2c78db269f9fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): compiler/rustc_codegen_cranelift/example/std_example.rs:343-352 | compiler/rustc_codegen_gcc/example/std_example.rs:175-184 \u2014 before extracting anything, compare \u0060compiler/rustc_codegen_cranelift/example/std_example.rs\u0060 and \u0060compiler/rustc_codegen_gcc/example/std_example.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 153 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 \u0060compiler/rustc_codegen_cranelift/example/std_example.rs:343\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":"compiler/rustc_codegen_cranelift/example/std_example.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"9881457ff870e967958120fa88f6dbbca05c50049f9f7697981d2dfc8144fde2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): compiler/rustc_codegen_cranelift/example/std_example.rs:444-453 | compiler/rustc_codegen_gcc/example/std_example.rs:266-275 \u2014 before extracting anything, compare \u0060compiler/rustc_codegen_cranelift/example/std_example.rs\u0060 and \u0060compiler/rustc_codegen_gcc/example/std_example.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 153 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 \u0060compiler/rustc_codegen_cranelift/example/std_example.rs:444\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/example/std_example.rs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2ad8446bdc34d32f0df9347462bc8a22493f784032a0fb1eea95483324d4558"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): compiler/rustc_codegen_cranelift/example/mini_core_hello_world.rs:210-225 | compiler/rustc_codegen_gcc/example/mini_core_hello_world.rs:195-210 \u2014 before extracting anything, compare \u0060compiler/rustc_codegen_cranelift/example/mini_core_hello_world.rs\u0060 and \u0060compiler/rustc_codegen_gcc/example/mini_core_hello_world.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 73 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 \u0060compiler/rustc_codegen_cranelift/example/mini_core_hello_world.rs:210\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060compiler/rustc_codegen_gcc/example/mini_core_hello_world.rs:193\u0060 calls \u0060size_of_val\u0060 and \u0060compiler/rustc_codegen_cranelift/example/mini_core_hello_world.rs:208\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":"compiler/rustc_codegen_cranelift/example/mini_core_hello_world.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ea8b730aa398d6870603d423f926290f5ba18370bae41fabd1ec8ecb7039322"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): compiler/rustc_codegen_cranelift/example/std_example.rs:252-260 | compiler/rustc_codegen_gcc/example/std_example.rs:125-132 \u2014 before extracting anything, compare \u0060compiler/rustc_codegen_cranelift/example/std_example.rs\u0060 and \u0060compiler/rustc_codegen_gcc/example/std_example.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 153 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 \u0060compiler/rustc_codegen_cranelift/example/std_example.rs:252\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":"compiler/rustc_codegen_cranelift/example/std_example.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"865f70d6d85e04aebb39550dca050dd35b9d79b92f079e595e08b0dd8771d8f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): compiler/rustc_codegen_cranelift/example/std_example.rs:431-439 | compiler/rustc_codegen_gcc/example/std_example.rs:252-260 \u2014 before extracting anything, compare \u0060compiler/rustc_codegen_cranelift/example/std_example.rs\u0060 and \u0060compiler/rustc_codegen_gcc/example/std_example.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 153 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 \u0060compiler/rustc_codegen_cranelift/example/std_example.rs:431\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/example/std_example.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d17f03df9eddc78835568142aa65a1d1be3e9a5523b797a007829c44c97b2b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): compiler/rustc_codegen_cranelift/example/std_example.rs:627-635 | compiler/rustc_codegen_cranelift/example/std_example.rs:646-654 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_codegen_cranelift/example/std_example.rs:627\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":"compiler/rustc_codegen_cranelift/example/std_example.rs"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea8ca5d0f03862cb136b59972f4791eca3d13591f57c5d52746d4a217c804caf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): library/portable-simd/crates/test_helpers/src/lib.rs:338-346 | library/portable-simd/crates/test_helpers/src/lib.rs:455-463 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/portable-simd/crates/test_helpers/src/lib.rs:338\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":"library/portable-simd/crates/test_helpers/src/lib.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc5db085a0e54b07fc8285b3110b94ad4e6d3acdc34c4f5376fccaa4c90e2963"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): compiler/rustc_codegen_cranelift/example/std_example.rs:321-328 | compiler/rustc_codegen_cranelift/example/std_example.rs:329-336 | compiler/rustc_codegen_gcc/example/std_example.rs:151-158 | compiler/rustc_codegen_gcc/example/std_example.rs:159-166 \u2014 before extracting anything, compare \u0060compiler/rustc_codegen_cranelift/example/std_example.rs\u0060 and \u0060compiler/rustc_codegen_gcc/example/std_example.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 153 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":"compiler/rustc_codegen_cranelift/example/std_example.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"43e4418fef89d79b6a4a9245e591096f450cf27c8989ffc32b7df287234901c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): compiler/rustc_codegen_cranelift/example/subslice-patterns-const-eval.rs:80-90 | compiler/rustc_codegen_gcc/example/subslice-patterns-const-eval.rs:75-85 \u2014 before extracting anything, compare \u0060compiler/rustc_codegen_cranelift/example/subslice-patterns-const-eval.rs\u0060 and \u0060compiler/rustc_codegen_gcc/example/subslice-patterns-const-eval.rs\u0060 as WHOLE FILES: 97% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. 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":"compiler/rustc_codegen_cranelift/example/subslice-patterns-const-eval.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bb46e909979ac9288b96b2692d81a0358c3fc7deb22bec02b54176dd11a922f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5): library/portable-simd/crates/test_helpers/src/lib.rs:336-342 | library/portable-simd/crates/test_helpers/src/lib.rs:374-380 | library/portable-simd/crates/test_helpers/src/lib.rs:416-422 | library/portable-simd/crates/test_helpers/src/lib.rs:424-430 | library/portable-simd/crates/test_helpers/src/lib.rs:453-459 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/portable-simd/crates/test_helpers/src/lib.rs:336\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":"library/portable-simd/crates/test_helpers/src/lib.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"e98ebe2ff24237c29b6abe33e307f44d7f197b50f6d80b523f0e0f17f2533b49"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): compiler/rustc_codegen_cranelift/example/mini_core_hello_world.rs:299-305 | compiler/rustc_codegen_gcc/example/mini_core_hello_world.rs:281-287 \u2014 before extracting anything, compare \u0060compiler/rustc_codegen_cranelift/example/mini_core_hello_world.rs\u0060 and \u0060compiler/rustc_codegen_gcc/example/mini_core_hello_world.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 73 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":"compiler/rustc_codegen_cranelift/example/mini_core_hello_world.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"b68a31893e53adb296bc903fd1317de1d87d63635b49112cfa36e765034b270d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5\u20136 lines \u00D7 2): compiler/rustc_codegen_cranelift/example/std_example.rs:62-67 | compiler/rustc_codegen_gcc/example/std_example.rs:58-62 \u2014 before extracting anything, compare \u0060compiler/rustc_codegen_cranelift/example/std_example.rs\u0060 and \u0060compiler/rustc_codegen_gcc/example/std_example.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 153 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 \u0060compiler/rustc_codegen_cranelift/example/std_example.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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060compiler/rustc_codegen_gcc/example/std_example.rs:55\u0060 calls \u0060saturating_add\u0060 and \u0060compiler/rustc_codegen_cranelift/example/std_example.rs:61\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":"compiler/rustc_codegen_cranelift/example/std_example.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"19751962f0ff40d3aab089f5182a29bd95bdc5cb0bf9d0141ba47cdf4ec4f258"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): compiler/rustc_codegen_cranelift/example/std_example.rs:316-320 | compiler/rustc_codegen_cranelift/example/std_example.rs:324-328 | compiler/rustc_codegen_gcc/example/std_example.rs:146-150 | compiler/rustc_codegen_gcc/example/std_example.rs:154-158 \u2014 before extracting anything, compare \u0060compiler/rustc_codegen_cranelift/example/std_example.rs\u0060 and \u0060compiler/rustc_codegen_gcc/example/std_example.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 153 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":"compiler/rustc_codegen_cranelift/example/std_example.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c92449d4c343c2707532e2d44e339833a382e1101f553c10bf32972f5a8fbc2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): compiler/rustc_codegen_cranelift/example/arbitrary_self_types_pointers_and_wrappers.rs:53-61 | compiler/rustc_codegen_gcc/example/arbitrary_self_types_pointers_and_wrappers.rs:58-66 \u2014 before extracting anything, compare \u0060compiler/rustc_codegen_cranelift/example/arbitrary_self_types_pointers_and_wrappers.rs\u0060 and \u0060compiler/rustc_codegen_gcc/example/arbitrary_self_types_pointers_and_wrappers.rs\u0060 as WHOLE FILES: 88% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. 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":"compiler/rustc_codegen_cranelift/example/arbitrary_self_types_pointers_and_wrappers.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"0928ee190c65b1e09c745ffed0a23c9b466fa304e5d6ff17e8236815e8604dc9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): compiler/rustc_codegen_cranelift/example/std_example.rs:516-520 | compiler/rustc_codegen_cranelift/example/std_example.rs:530-534 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/rustc_codegen_cranelift/example/std_example.rs:516\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":"compiler/rustc_codegen_cranelift/example/std_example.rs"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"eda01b044d58013c2f81cd460c14b11bc780a85af6d768a0a22596827baee321"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): compiler/rustc_codegen_cranelift/example/example.rs:58-63 | compiler/rustc_codegen_gcc/example/example.rs:58-63 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/example/example.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"e32d6f52dbdd053c5306245446600269b4b02e55cc02fc2bf1d9d35d446d6b22"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): compiler/rustc_codegen_cranelift/example/mini_core.rs:536-545 | compiler/rustc_codegen_gcc/example/mini_core.rs:566-575 \u2014 before extracting anything, compare \u0060compiler/rustc_codegen_cranelift/example/mini_core.rs\u0060 and \u0060compiler/rustc_codegen_gcc/example/mini_core.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 34 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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":"compiler/rustc_codegen_cranelift/example/mini_core.rs"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"322537d86c97fd337c39771337984bc2ee9d738c7044c55be9e838de4cfac9d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): compiler/rustc_codegen_cranelift/example/mini_core.rs:651-658 | compiler/rustc_codegen_gcc/example/mini_core.rs:660-667 \u2014 before extracting anything, compare \u0060compiler/rustc_codegen_cranelift/example/mini_core.rs\u0060 and \u0060compiler/rustc_codegen_gcc/example/mini_core.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 34 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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":"compiler/rustc_codegen_cranelift/example/mini_core.rs"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5796467e2f0d4a10391da41f67c725ecf168654f14df9bcd020dc43e42ea6c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): compiler/rustc_codegen_cranelift/example/mini_core_hello_world.rs:595-603 | compiler/rustc_codegen_gcc/example/mini_core_hello_world.rs:439-447 \u2014 before extracting anything, compare \u0060compiler/rustc_codegen_cranelift/example/mini_core_hello_world.rs\u0060 and \u0060compiler/rustc_codegen_gcc/example/mini_core_hello_world.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 73 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":"compiler/rustc_codegen_cranelift/example/mini_core_hello_world.rs"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad4725db79ac206246f867c7f169957b618196a72e33340e7d33520244fc32fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): compiler/rustc_codegen_cranelift/example/std_example.rs:356-361 | compiler/rustc_codegen_gcc/example/std_example.rs:189-194 \u2014 before extracting anything, compare \u0060compiler/rustc_codegen_cranelift/example/std_example.rs\u0060 and \u0060compiler/rustc_codegen_gcc/example/std_example.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 153 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":"compiler/rustc_codegen_cranelift/example/std_example.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"21287bef1fa67c4e55e67452665b35656375d2e38aac00804d3cb44a669eaf13"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): compiler/rustc_codegen_cranelift/example/std_example.rs:381-386 | compiler/rustc_codegen_gcc/example/std_example.rs:216-221 \u2014 before extracting anything, compare \u0060compiler/rustc_codegen_cranelift/example/std_example.rs\u0060 and \u0060compiler/rustc_codegen_gcc/example/std_example.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 153 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":"compiler/rustc_codegen_cranelift/example/std_example.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce0b7907e3d55fffc25cefcf6f563566e85ec7c196f06ae5166a1ffd7c21e6ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): compiler/rustc_codegen_cranelift/example/std_example.rs:389-393 | compiler/rustc_codegen_gcc/example/std_example.rs:225-229 \u2014 before extracting anything, compare \u0060compiler/rustc_codegen_cranelift/example/std_example.rs\u0060 and \u0060compiler/rustc_codegen_gcc/example/std_example.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 153 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":"compiler/rustc_codegen_cranelift/example/std_example.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ff0fb973d1f7574273dc49c23529308a5a60eb0d48173e3f4daafcda66435eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/bootstrap/src/core/build_steps/test.rs:189-204 | src/bootstrap/src/core/build_steps/test.rs:4950-4966 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/bootstrap/src/core/build_steps/test.rs:189\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/build_steps/test.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"7928a2e1fbd79df3c9e50974ad3ace60ef052e34387d6f80c69aa7422b528d0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/bootstrap/src/core/build_steps/test.rs:1894-1909 | src/bootstrap/src/core/build_steps/test.rs:1940-1955 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/bootstrap/src/core/build_steps/test.rs:1894\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/bootstrap/src/core/build_steps/test.rs"},"region":{"startLine":1894}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fa15e8bcad3ae0340ed39a87f4fe887766c06e94346c84d4f91619af2d24790"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): src/bootstrap/src/core/build_steps/test.rs:188-200 | src/bootstrap/src/core/build_steps/test.rs:4427-4438 | src/bootstrap/src/core/build_steps/test.rs:4949-4961 \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/bootstrap/src/core/build_steps/test.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"51fcbb4573f9885d563b90db66bf70150537104a8c0262aeb22fc6e2857f10ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/bootstrap/src/core/build_steps/test.rs:4616-4627 | src/bootstrap/src/core/build_steps/test.rs:4738-4749 \u2014 both copies are in the same file, so extract the block 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/bootstrap/src/core/build_steps/test.rs"},"region":{"startLine":4616}}}],"partialFingerprints":{"codehealthFindingId/v1":"54a372caaad19844290f8feeb6f2176dbfd1e638cb1493a31cee728527dd6e91"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): compiler/rustc_codegen_gcc/build_system/src/test.rs:493-503 | compiler/rustc_codegen_gcc/build_system/src/test.rs:509-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_gcc/build_system/src/test.rs"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"83f414dc137794fa420f3257057070eb132c312183c34a155724953b917bc43f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): compiler/rustc_codegen_gcc/build_system/src/test.rs:252-262 | compiler/rustc_codegen_gcc/build_system/src/test.rs:266-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 \u0060compiler/rustc_codegen_gcc/build_system/src/test.rs:252\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":"compiler/rustc_codegen_gcc/build_system/src/test.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"542b68158542b0456e69a7a0ceea99fe618272a9c03df68ed1fb8ca427dc56c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/tools/rust-analyzer/crates/test-fixture/src/lib.rs:393-402 | src/tools/rust-analyzer/crates/test-fixture/src/lib.rs:488-497 \u2014 both copies are in the same file, so extract the block 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/tools/rust-analyzer/crates/test-fixture/src/lib.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c14d74f13d76e2a39b7322b51e39e8da6bad1efc95932c495dce29be3137644"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/tools/rust-analyzer/crates/test-utils/src/fixture.rs:220-226 | src/tools/rust-analyzer/crates/test-utils/src/fixture.rs:227-233 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tools/rust-analyzer/crates/test-utils/src/fixture.rs:220\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/tools/rust-analyzer/crates/test-utils/src/fixture.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4ec914be9de095abe13af8b676f2b39515e2da9c9c036049859e0e38d1599a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): compiler/rustc_codegen_cranelift/example/std_example.rs:458-462 | compiler/rustc_codegen_gcc/example/std_example.rs:280-284 \u2014 before extracting anything, compare \u0060compiler/rustc_codegen_cranelift/example/std_example.rs\u0060 and \u0060compiler/rustc_codegen_gcc/example/std_example.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 153 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 \u0060compiler/rustc_codegen_cranelift/example/std_example.rs:458\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":"compiler/rustc_codegen_cranelift/example/std_example.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6740cd493e139cbe5e06547c4da186d5cdabb3a3c79fcdf834526bd7c681d16"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project hir-ide: hir-ide has instability 0.90 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"01fe22e4045c9a5633636dc4ab21c3acdfa0c9e5e1869654fdbfcebd3f757c3e"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project ide: ide has instability 0.93 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"f20100be290615894111de6ae29fb9f6097942ce93566bea4eebaa62687796ac"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project ide-diagnostics: ide-diagnostics has instability 0.86 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"19cec4b69fae8522d6e7d35c8e61fa9ac9bd1238768617f2e5b1213b00c30a99"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project load-cargo: load-cargo has instability 0.90 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"e48d179f8ecb4f4694056563a08a95d29b2f44f9113f9fd000cb2dfa46608778"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project mbe: mbe has instability 0.86 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"632e992a17f5c2ac232013bb8c6f2b4b8ed102a57107ba5592965aaba0715504"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project rustc_ast_lowering: rustc_ast_lowering has instability 0.88 with 2 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"e990aa97e9eb6b8d2290f205539ac540c3648a958a5d741dd1ae121047b1cc19"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project rustc_ast_passes: rustc_ast_passes has instability 0.93 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"51a568fbee69d002cc53e15095c61eb399754ee583ae37f8afdcf9ca1b595a7e"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project rustc_borrowck: rustc_borrowck has instability 0.94 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"1e86047d23cf2d56d55187d4d4c3eadb91c65837bf36943f1b04dc558cfa5e44"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project rustc_builtin_macros: rustc_builtin_macros has instability 0.95 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"219943f437143edf71c67f2c095a8ea5fc24c3fefe3fd6a57d1bb48067691f17"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project rustc_codegen_llvm: rustc_codegen_llvm has instability 0.96 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"1e1f869ef14afd7fa247feb07aae46597bf32a3e99a63704bd0681718d659494"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project rustc_codegen_ssa: rustc_codegen_ssa has instability 0.86 with 4 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"1d3e8e6766060062f650d5720a5fae058fdf88a97aed8c06a48d376a6ba3392e"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project rustc_const_eval: rustc_const_eval has instability 0.86 with 3 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ea220522e7e771ccd1e90177035a715956e7dd189a2af1acc88014582eff1b0d"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project rustc_driver_impl: rustc_driver_impl has instability 0.94 with 2 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"37cbb9a249e1a76049c73a8d67b640c33eebc88c66e9c3d3661fcd07124be603"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project rustc_expand_queries: rustc_expand_queries has instability 0.83 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"7773f7978b6aa11960cfb464816e60bb7db5e19a86623d974b2c7d33ed74715c"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project rustc_hir_analysis: rustc_hir_analysis has instability 0.86 with 3 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0ae419fccdaae47e3ed77ab7f8c90a5d90d8e57b041bcc9ed3477d5b5d5a4050"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project rustc_hir_typeck: rustc_hir_typeck has instability 0.95 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"48ed7745516efd334dae142edc4847e5372a7045fe4a7782156693dda1378ac1"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project rustc_incremental: rustc_incremental has instability 0.86 with 2 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"f9651af41b635c0892296be9085bb783f6cc9459ab752205756f0bfc567c2294"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project rustc_interface: rustc_interface has instability 0.98 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"11b77dee09f89e80adcd4755a736bc11f711cc11a84c953353f38f8eb182040e"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project rustc_lint: rustc_lint has instability 0.88 with 3 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6dfceabbd6a12e8491de429da33af9cfe21dcdaa2edbd9738983f638d858514b"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project rustc_metadata: rustc_metadata has instability 0.82 with 5 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0a66f2da0b92023aeba255cc247bba83a94aa95682a48cf8e76f6cc91c586651"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project rustc_mir_build: rustc_mir_build has instability 0.88 with 2 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"a7d41e9f67f58e6226ad8ff9ca3e2ce9fd80291b90931dd0cbc5075adea32c65"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project rustc_mir_transform: rustc_mir_transform has instability 0.95 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"b45f1e698d4e0b5c3caa5e121e48ca9b9dc36c11f37524b6e80e22822a5f5480"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project rustc_monomorphize: rustc_monomorphize has instability 0.94 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"21b1c70bf909db8ad79ff386ce62785451c5fddea23180142afeec64e7fe5b3f"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project rustc_next_trait_solver: rustc_next_trait_solver has instability 0.83 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"a77a563cbcb905c8397fc1b24a88b6f1cc837ffc3f9636365094133133f9e0bd"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project rustc_passes: rustc_passes has instability 0.95 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"299301cbe582d5d1080a80611e5d8fdf985ad02207bed6dfbc4c9304c3f052b0"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project rustc_pattern_analysis: rustc_pattern_analysis has instability 0.90 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6ef68a3d7cf4410f1ce20b2d22e0ed636312f15888852f65524928a0e4decb95"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project rustc_privacy: rustc_privacy has instability 0.83 with 2 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"c4974b75f28fec90d90c4b6b985c2c835da3be5ba71e6f8fe139dcc3f1355119"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project rustc_public_bridge: rustc_public_bridge has instability 0.82 with 2 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"e92687b03a1a0c140d65f6555e52ee21e3ae5bbc9a2255502ae0b7ca682b7c54"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project rustc_query_impl: rustc_query_impl has instability 0.90 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ff278ee55d3a64c95dd970c5315b8957dcbf799f8f94eb16abcd161669124821"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project rustc_resolve: rustc_resolve has instability 0.90 with 2 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d72f4510653a12e0129fbf042a284b9956eae4b5e2af8679bd15587ee91e70b6"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project rustc_sanitizers: rustc_sanitizers has instability 0.89 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"19b2850e80f2f07f890d1cd638e328b6a822bb1a73546f11fcd31e5688a4752b"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project rustc_traits: rustc_traits has instability 0.83 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"09e45e6f65fc21b1ea02e33820c0ddb870875fad879220c9354a53d3de9d286d"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project rustc_transmute: rustc_transmute has instability 0.83 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"f4027f69d68504a6d72c83c0633788f4cb989c828dd708ebc94f225c952eb138"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project rustc_ty_utils: rustc_ty_utils has instability 0.94 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ea0a6821afac515e0d392e804d2e0d39e73695173de726d0eb8a62c037d03673"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project test-fixture: test-fixture has instability 0.90 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"39201c6ae6e679b7e17dc3042e227d9d65c36e83386f9eb3d21eb817be2fd4d3"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: build_helper: build_helper: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 7 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"bad023ee07e6dc4c2a4f9c7e4684ce3bc6e8e2897c1b49376eb0a6c39ddc78c2"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: declare_clippy_lint: declare_clippy_lint: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 2 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"756d8a587b4715c6bd8bc0efcd6c947f2ca3e8210c1203a128641ece8300ca44"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: edition: edition: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 2 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"8791443bf747d3978fb4536f3f03b9676ffb4bf24c1ccaa59f785a10d71168d4"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: paths: paths: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 9 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"bd9e65cfa92adf9a430f37c153a1e24323e61b875b378811b4280cfda9207fd8"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: profile: profile: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 4 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"8d7185b755b4a6faa9cef4e6a8e759bf93b801d410563808b759e3a73953041d"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: rustc_arena: rustc_arena: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 10 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d38d1cdc70f088f4f0cc12dab0ba7be05f3a4c688c694180674622191164e572"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: rustc_baked_icu_data: rustc_baked_icu_data: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d0dd16f24ff5ca9d733252c56c3b59e5fa49ed008d531d7feb5b8a4a7c88b3ce"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: rustc_fs_util: rustc_fs_util: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 7 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"c24e465d009203a52af509806f080c196addb304034eef095fa1f337883bedae"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: rustc_hashes: rustc_hashes: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 15 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"879fb0479d23f7e9ca00861ee0070466b986bc30aa171c7619e1ae1f91aa29ed"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: rustc_lexer: rustc_lexer: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 8 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"886d10e50e809983d97b5b4cc0edede1f17479be6d1bef94ce4d33388ba007cf"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: rustc_llvm: rustc_llvm: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"48e6d777ec5be9960da60b50e39963bea742c68ced8f83c8058240cd807bd522"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: rustc_tools_util: rustc_tools_util: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"819fce2e86f5c44874efb72db45c0f4c802c0adaf97f19a1eac29265e72c7a4f"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: rustc_windows_rc: rustc_windows_rc: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 2 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"4db70f0b537f3adbe16b302116a4be69785fc93c7a6ad87eb286ea1288cf480d"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: rustdoc-json-types: rustdoc-json-types: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 3 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"5952cfcabe879ef6380fede6e961ba839a1ef762cb24299497acaba330aab714"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: shim_utils: shim_utils: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 2 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"c0b60dc94841e1bca65e82d426675f6bed8b97343502dd95e56d4d696807a135"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: util: util: abstractness 1.00, instability 1.00, distance 1.00 \u2014 an application entry point, so it is concrete by design \u2014 the distance is expected; what is worth checking is that other projects depend on it at all, since a host should be a leaf of the graph."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"e927cbd62d2116be44bb62e591c05917a8782b0fc5fb8b6e1146722926ee22a3"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: rustc_thread_pool: rustc_thread_pool: abstractness 0.09, instability 0.00, distance 0.91 \u2014 zone of pain \u2014 concrete and depended on by 4 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"bc051d7f7e0918f5c50f37057adbd1b946de402c5a0fe38407daffb68cfea990"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: rustc_feature: rustc_feature: abstractness 0.00, instability 0.17, distance 0.83 \u2014 zone of pain \u2014 concrete and depended on by 15 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"1551c22a619c84d6533315586ac773010e0c5bbce698ac88c11d26ac7f9d9a74"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: stdx: stdx: abstractness 0.18, instability 0.00, distance 0.82 \u2014 zone of pain \u2014 concrete and depended on by 24 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"2a6d25a78eda0cac573cabc65708240efc83ccab8d554c2a5c3a7902480788fd"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: rustc_structures: rustc_structures: abstractness 0.00, instability 0.19, distance 0.81 \u2014 zone of pain \u2014 concrete and depended on by 22 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"a5739aa6b9d8fceac7554160abeec742265ace30ac0a7b299966d494667a58ad"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: rustc_span: rustc_span: abstractness 0.09, instability 0.10, distance 0.81 \u2014 zone of pain \u2014 concrete and depended on by 55 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"154fb087892acb06e771ed30e512f53e15c34f65b8fb4e765f3086c8aa33741e"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: rustc_log: rustc_log: abstractness 0.20, instability 0.00, distance 0.80 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"66c7db0f50f0a560f1f0002a57098c58ee49d89e5eaa2d6ef8bb99d8bec4b3d9"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: span: span: abstractness 0.05, instability 0.16, distance 0.79 \u2014 zone of pain \u2014 concrete and depended on by 16 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"18c14f3bd3d91e3d560c7eec2357fb2f5c2b268ae82531efba6e6374d9c8d16b"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: rustc_index: rustc_index: abstractness 0.13, instability 0.09, distance 0.78 \u2014 zone of pain \u2014 concrete and depended on by 32 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"c0bb2cf980d91330637b3f90408d61c5f0b9529faf64326495ef3dec3f6b1bbc"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: rustc_ast: rustc_ast: abstractness 0.07, instability 0.16, distance 0.77 \u2014 zone of pain \u2014 concrete and depended on by 31 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"5a8990c1c98529ab52e19d46d20dd1b44e7fb4aeba02284f288ce25dc7ee2769"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: cfg: cfg: abstractness 0.00, instability 0.25, distance 0.75 \u2014 zone of pain \u2014 concrete and depended on by 9 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"856a714254d9f7a61736039adb4d918f3c0f9b9622e104ae14e60a54074b4ef7"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: rustc_parse_format: rustc_parse_format: abstractness 0.00, instability 0.25, distance 0.75 \u2014 zone of pain \u2014 concrete and depended on by 3 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"48b7fbd86554d924717af188bf2b85a5d2e3dd74174f35915c6cb6c9e0644fe2"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: tidy: tidy: abstractness 0.00, instability 0.25, distance 0.75 \u2014 zone of pain \u2014 concrete and depended on by 3 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"19bf380102643a2a918b59f86516ea76c777ffc959c1f73982723ed3f2fd974b"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: parser: parser: abstractness 0.13, instability 0.13, distance 0.74 \u2014 zone of pain \u2014 concrete and depended on by 7 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"f34d1a282fc883997f4f59f52dee541072bc39626bfa72bd1cd446ec8cd674ba"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: core: core: abstractness 0.27, instability 0.00, distance 0.73 \u2014 zone of pain \u2014 concrete and depended on by 5 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"deda6fd6cb2c3d74f7dc0fecd76cc36d1d58966a5bcb861efc01f7e84f6f398d"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: clippy_utils: clippy_utils: abstractness 0.27, instability 0.00, distance 0.73 \u2014 zone of pain \u2014 concrete and depended on by 4 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"08a1f019897adb65f32cbb16969197657c2a2992c29f731105ef7d984cc7a6b2"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: rustc_abi: rustc_abi: abstractness 0.08, instability 0.20, distance 0.72 \u2014 zone of pain \u2014 concrete and depended on by 33 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"80e4365aee7a8afe306631767ca189617bc4aada8fe0617c8393f1141b7e8511"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: rustc_attr_ir: rustc_attr_ir: abstractness 0.07, instability 0.22, distance 0.71 \u2014 zone of pain \u2014 concrete and depended on by 32 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"767b4ebf9ea9afb0cda2ff74995384369cb4f4ed722762712a03e1df45075e4a"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: tt: tt: abstractness 0.05, instability 0.25, distance 0.70 \u2014 zone of pain \u2014 concrete and depended on by 9 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"eb93276d5b369fb20774c2da99a9193af33e82753f0185a9757ec9bf3c62ec8c"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Builder (LCOM4 35): Builder\u0027s methods fall into 35 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 35 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":"compiler/rustc_codegen_llvm/src/llvm/ffi.rs"},"region":{"startLine":718}}}],"partialFingerprints":{"codehealthFindingId/v1":"db93ed249c0d26a7a76f82f592ae2c03038539feb4fbbe5a1c7e601d1c1c59c5"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Socket (LCOM4 26): Socket\u0027s methods fall into 26 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 26 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":"library/std/src/sys/net/connection/socket/unix.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"263c39fe4f671e18338de054be1f0aa71b188304baa729246c5228715735cf2c"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Resolver (LCOM4 23): Resolver\u0027s methods fall into 23 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 23 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":"compiler/rustc_hir_typeck/src/writeback.rs"},"region":{"startLine":917}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3a9d8d49c8535105d968a15f899532e6735edc01f5aa59f06bd39479b5f6116"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: GenericCx (LCOM4 18): GenericCx\u0027s methods fall into 18 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 18 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":"compiler/rustc_codegen_llvm/src/context.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b4c8f92b9e5e9ea06222d168d8d2569ec8d1d519e2fa7a57344e295af99e05f"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: EnzymeWrapper (LCOM4 14): EnzymeWrapper\u0027s methods fall into 14 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 14 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":"compiler/rustc_codegen_llvm/src/llvm/enzyme_ffi.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d25e843f9f82c1897a091bae90ac91d8b093b7af2add12a26706ae02921170c"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: StatCollector (LCOM4 14): StatCollector\u0027s methods fall into 14 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 14 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":"compiler/rustc_passes/src/input_stats.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0d192986734982915a36dd69d78fb7e82b5fb677bc8323f48ba35eb16fd6fa7"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Completions (LCOM4 14): Completions\u0027s methods fall into 14 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 14 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/tools/rust-analyzer/crates/ide-completion/src/completions.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"90865ceb5856d5bb2fe67ea2f9e4e1cb364006e16101a7c419ada1bbaeb794a8"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: CodegenCx (LCOM4 13): CodegenCx\u0027s methods fall into 13 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 13 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":"compiler/rustc_codegen_gcc/src/context.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f938eb6187ae8547dcf398ea5e882db0b5c72a39893bc46371c9f3353de3397"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Diag (LCOM4 13): Diag\u0027s methods fall into 13 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 13 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":"compiler/rustc_errors/src/diagnostic.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e7826bd50676625dde6e056ad89c1f9cd3b761aec47ac40eaf79ffacece8bd1"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: FmtPrinter (LCOM4 12): FmtPrinter\u0027s methods fall into 12 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 12 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":"compiler/rustc_middle/src/ty/print/pretty.rs"},"region":{"startLine":2104}}}],"partialFingerprints":{"codehealthFindingId/v1":"864261b18a50965d3887433dc46eda7b1f51105cbe2f0cd3c9e7d8e6f6522dfc"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: NodeRef (LCOM4 12): NodeRef\u0027s methods fall into 12 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 12 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":"library/alloc/src/collections/btree/node.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"218344c1560dd9a6734adcd6b14d34eb884abf4325ccf129a52138f644c460da"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: EarlyContextAndPass (LCOM4 11): EarlyContextAndPass\u0027s methods fall into 11 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 11 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":"compiler/rustc_lint/src/early.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"c174cb084ee37a2f4f2cd5eb0b014804aaa61e74fbf2b3681dd27840cca3435d"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Rc (LCOM4 11): Rc\u0027s methods fall into 11 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 11 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":"library/alloc/src/rcs/rc.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed98cdf2b936bc6beb8687b5acf7516e756d72ca249b24cd19a40eac00978ad4"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: FnCtxt (LCOM4 10): FnCtxt\u0027s methods fall into 10 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 10 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":"compiler/rustc_hir_typeck/src/fn_ctxt/mod.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f54cdb9345814bf26f4986f779f9b460b64996307fc4a68773b6ce80d025c7c"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Parser (LCOM4 10): Parser\u0027s methods fall into 10 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 10 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":"compiler/rustc_parse_format/src/lib.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ff4577bb615f3a9d180deab883da47eaa62e52794bbba9bcd779e15784f2313"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Config (LCOM4 10): Config\u0027s methods fall into 10 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 10 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/tools/rust-analyzer/crates/rust-analyzer/src/config.rs"},"region":{"startLine":1116}}}],"partialFingerprints":{"codehealthFindingId/v1":"123b77ea3a1cc764c670d0ff702ce87cb763b4186f2e70ecc9f8597339b59d4f"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: CfgEval (LCOM4 9): CfgEval\u0027s methods fall into 9 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 9 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_builtin_macros/src/cfg_eval.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2259ea9e262335220d74293cc2b4a9a8e045a187a12e984d0418d2645327add"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Socket (LCOM4 9): Socket\u0027s methods fall into 9 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 9 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/net/connection/socket/hermit.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbd391ee54223c307888aa81249df6502586a1d61188d7bb58c5a0bd38b33561"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Socket (LCOM4 9): Socket\u0027s methods fall into 9 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 9 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/net/connection/socket/windows.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"28fa621fa8f510f49765342686688b8bac4c30521a0c9d046752a335fb684543"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Item (LCOM4 9): Item\u0027s methods fall into 9 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 9 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/clean/types.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"0126878c08635135a85c63948aefc1ad9f116d0f97a0aafeff4382482398526e"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: LateContextAndPass (LCOM4 8): LateContextAndPass\u0027s methods fall into 8 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 8 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_lint/src/late.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e980552ff056e2d8a1260a3301c7cad6543173fd0acea90c9b0d7384079d685"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Ty (LCOM4 8): Ty\u0027s methods fall into 8 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 8 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/ty/mod.rs"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0d812af1fc267cce16d711b0497d630407f42e50a120ea8cc1cccac9600b275"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: RegionInferenceContext (LCOM4 7): RegionInferenceContext\u0027s methods fall into 7 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 7 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":"compiler/rustc_borrowck/src/region_infer/region_context.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"48b71200b5d4623a30edb1eed5967e9cdf1a420b8dae56aad668b3c876a19aff"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: List (LCOM4 7): List\u0027s methods fall into 7 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 7 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":"compiler/rustc_macros/src/query.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0af580771cdb7421533799d0fa2caa50aae56ebe9f5de32a744f2753374819c"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Builder (LCOM4 7): Builder\u0027s methods fall into 7 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 7 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":"compiler/rustc_mir_build/src/builder/mod.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"afd88e42e002bd77718febdc70dfc81c2dede241e969099b2651051790bdddba"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Socket (LCOM4 7): Socket\u0027s methods fall into 7 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 7 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":"library/std/src/sys/net/connection/socket/solid.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"cee51762b4955655b11850a7209ec8f0b45f60de889939748126dd70535c831f"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Builder (LCOM4 7): Builder\u0027s methods fall into 7 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 7 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/bootstrap/src/core/builder/mod.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"19af8c7756c4c953ff58fffcc0a1c7aa79a8c9c245c72ea76e4cd9843cc72f89"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Interned (LCOM4 7): Interned\u0027s methods fall into 7 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 7 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/bootstrap/src/utils/cache.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9630eae1764ffb91036e77d05897164a69ec4d921258305e3cbe79cb678b6af"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: MsvcLinker (LCOM4 6): MsvcLinker\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/back/linker.rs"},"region":{"startLine":945}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a19c7452eba1f7dce97be0e40c89eb9cc2efdd463594b365e9ad34fa87e619d"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: WasmLd (LCOM4 6): WasmLd\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/back/linker.rs"},"region":{"startLine":1329}}}],"partialFingerprints":{"codehealthFindingId/v1":"64dd882d477dc28fe917f5f3d45039abb476f3b4b45d236ae608c7d1dfe4331d"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Body (LCOM4 6): Body\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/mir/mod.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6e3bd16f1dba3c742c02869b3f1438f03ee01a60caef1d1a2ff85ba9fde60dc"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: RustcPatCtxt (LCOM4 6): RustcPatCtxt\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_pattern_analysis/src/rustc.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"31b2dd9a7312fddbf30df744f1ebffc003a804f32f6f229c2f7ad13dd88e7652"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Cursor (LCOM4 6): Cursor\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/alloc/src/collections/btree/set.rs"},"region":{"startLine":2133}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0fcc2486d0721f64b4855fad6022493406800c5d32c0d7186d8e6a23e44cb4c"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: MacroCallId (LCOM4 6): MacroCallId\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-expand/src/lib.rs"},"region":{"startLine":1556}}}],"partialFingerprints":{"codehealthFindingId/v1":"1633c2f6cd33f508d811d4ee5b017e7deb1f903168dbe089e2e796d1b1a851ed"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: SyntaxContext (LCOM4 6): SyntaxContext\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/span/src/hygiene.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e760ff33dd287271a24791d184b319e2e65a74cc0387362f2aabd8dce824428"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ListFormatting (LCOM4 6): ListFormatting\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/lists.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"74e3ace91a62cdffc72c829f42d86c21e7704463b4bcfac75e62f881e9ff807f"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: VarianceExtractor (LCOM4 5): VarianceExtractor\u0027s methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/polonius/liveness_constraints.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"094e27e251adb81ee11a64ae3af00c03fa7b1ef1fed4d7e6dd344d7e0742be8a"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: LlvmCodegenBackend (LCOM4 5): LlvmCodegenBackend\u0027s methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/back/llvm_backend.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eab02e5ebf8c3f2bc7f4a7a6363fce60343830f02046e50321a5e38d47078ce"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: TypeNamePrinter (LCOM4 5): TypeNamePrinter\u0027s methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_const_eval/src/util/type_name.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"90b3aae7cb7628bd95cf748abac5cc1a6d05e8fb45c9ee24d4d47ea683afe152"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Rustc (LCOM4 5): Rustc\u0027s methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_expand/src/proc_macro_server.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"af6f598bfdf2544256a1adc509bc9a9e52ec22e1545898694f5e67406e71852e"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: AliasTerm (LCOM4 5): AliasTerm\u0027s methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_public/src/ty/tys.rs"},"region":{"startLine":788}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a62dd529d729cd4f890ff1087673def2e72941b69a965571d3845749692182f"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Span (LCOM4 5): Span\u0027s methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_span/src/span_encoding.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"79b14fa13fad74845e1e71114318c321ff8ec83ec9bbf72ed2424de45d7bdfc4"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Target (LCOM4 5): Target\u0027s methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_target/src/spec/mod.rs"},"region":{"startLine":2009}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4a8dc09d6cd43b52ed4ee5d663046272f666e52e1fa952efe1faad311e9501f"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: RegionFolder (LCOM4 5): RegionFolder\u0027s methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_type_ir/src/fold.rs"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"a005ca4719fb7c33ab06e36166caeea94a070269202c2f3b62ef72e8ec4f47a5"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Handle (LCOM4 5): Handle\u0027s methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/alloc/src/collections/btree/node.rs"},"region":{"startLine":830}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f2a0a98e3d47c52ec38eccac37c9d55bc49da75650e12e82ef148560dc5d37d"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Command (LCOM4 5): Command\u0027s methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/process.rs"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"77ed87e28604e9668de6c9ea76dadc5d6fd8289eb4f5818fb8fa5b3844b46f69"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ExpressionStore (LCOM4 5): ExpressionStore\u0027s methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/expr_store.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8b1cfaf1bca8b761e82d545e757987d63bb9e3feef1d3224f7990199d986ea5"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: DbInterner (LCOM4 5): DbInterner\u0027s methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/next_solver/interner.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"38bbd649ae90e2e932874febe10e03876c850b5be27b77d5aa58e3a2d970ecc4"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: PostExpansionVisitor (LCOM4 4): PostExpansionVisitor\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":"compiler/rustc_ast_passes/src/feature_gate.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"b84ccce15afd9090da47d6cee8d25994d75b9dae704409a0c46a9feec8881829"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Ty (LCOM4 4): Ty\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":"compiler/rustc_hir/src/hir.rs"},"region":{"startLine":3271}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc5dc4e39b5cd15c6509c7d090c985163e2df10e5eb8135a501740b7f65b7166"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: MatchAgainstHigherRankedOutlives (LCOM4 4): MatchAgainstHigherRankedOutlives\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":"compiler/rustc_infer/src/infer/outlives/test_type_match.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a41da90638d6ba10c4c083992f530228a16f92a158fc91724e63e258d5c7820"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: FunctionalVariances (LCOM4 4): FunctionalVariances\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":"compiler/rustc_lint/src/impl_trait_overcaptures.rs"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"76cee18f40d232b0fd4cd4fe7c6f96170b246860417c776572390be6aafd54a6"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: RegionEraserAndAnonymizerVisitor (LCOM4 4): RegionEraserAndAnonymizerVisitor\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":"compiler/rustc_middle/src/ty/erase_regions.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"c896a84c70b0a2403aceddadc730ab99c4c2ff9c6e3e488c1be042930f5a19db"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Pattern (LCOM4 4): Pattern\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":"compiler/rustc_middle/src/ty/pattern.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce324614334626fc6fad2dcbc0bcadcea079701c6a2a82d61c16eb3e1ce0af19"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: MaybeRequiresStorage (LCOM4 4): MaybeRequiresStorage\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":"compiler/rustc_mir_dataflow/src/impls/storage_liveness.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0df6ad29043ccccc6de583b2d665dc382e9c0921160313cd294af7d0e4f6a6a"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Integrator (LCOM4 4): Integrator\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":"compiler/rustc_mir_transform/src/inline.rs"},"region":{"startLine":1162}}}],"partialFingerprints":{"codehealthFindingId/v1":"751bae447b35a51f600cbced3e805ee815b0aa39692634d0a657080a48bfc3ac"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: OffloadManifestDecoder (LCOM4 4): OffloadManifestDecoder\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":"compiler/rustc_monomorphize/src/offload/manifest.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0966cc97868798c16c7f17654d4ef9fc84ad8c1966239adb1b4996c5d79ef03"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: IndexMap (LCOM4 4): IndexMap\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":"compiler/rustc_public_bridge/src/lib.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"c377c69017aeebbee32c6dc1d041a9f618c2ff590946f3bc595aec54575b054f"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ExpnId (LCOM4 4): ExpnId\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":"compiler/rustc_span/src/hygiene.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"714fef25bac9ace9e357e459882ca5dc69420b8e2a02cea063c65cd067eb8e4b"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: TypeErrCtxt (LCOM4 4): TypeErrCtxt\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":"compiler/rustc_trait_selection/src/error_reporting/mod.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd8600822771220541ec9ce971e8bbfc9b7d366316ab980427ccfa9f6491a710"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: SolverDelegate (LCOM4 4): SolverDelegate\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":"compiler/rustc_trait_selection/src/solve/delegate.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"e74fd84d27acb91d7b18525716466e645e54ebda44f03fe8d15c34f6f634f66f"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Drain (LCOM4 4): Drain\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":"library/alloc/src/collections/binary_heap/mod.rs"},"region":{"startLine":1851}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e2df09de394d907e5065984a2acb8e07e6fcf2917ab7ad068fd329e3c04cfe1"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Condvar (LCOM4 4): Condvar\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":"library/std/src/sys/pal/unix/sync/condvar.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"da8f2ff753c45311b2d18fc5bada6781669c16c7fb0e622f23480ee4113e5d53"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ArmType (LCOM4 4): ArmType\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":"library/stdarch/crates/intrinsic-test/src/arm/intrinsic.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa38de43a0ec0ef6b2847980e63d5cfb566007a0c64c8d28994247233712d58c"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: LoongArchType (LCOM4 4): LoongArchType\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":"library/stdarch/crates/intrinsic-test/src/loongarch/intrinsic.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae3979647b4332fb0f3bfc7546ca878b93ac70cae071efb5a415753598ae732b"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Cargo (LCOM4 4): Cargo\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/bootstrap/src/core/builder/cargo.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b07ff8435ffe8595d115bf7262bc827dcb4c9db2a9e38666d1291c09509d56e"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Config (LCOM4 4): Config\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/bootstrap/src/core/config/config.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"d71f0730e176a715e7b72c78da822b9a61a0fd5f0445696dba304ef38253672c"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Session (LCOM4 4): Session\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/bootstrap/src/core/session.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cfc02561b41c2f99bbbfc5ab222b35846a4c5f7e322afdfb90acf0effef1636"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: TraitBounds (LCOM4 4): TraitBounds\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/tools/clippy/clippy_lints/src/trait_bounds.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"f67d01ac393cde3a5cd676791a26519da3566eec9b86e6f1b943d001a86320be"}},{"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/tools/miri/src/borrow_tracker/tree_borrows/diagnostics.rs"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbec3bcccbcd48482bef4888197e99bb0ea706d091fdda5f4e0f21644d76f160"}},{"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/tools/miri/src/shims/unix/udp_socket.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"61093f91442ccdf9d94b3db1e319b08c2d0797439ecedae3549f48bef79cc98f"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ModuleIdLt (LCOM4 4): ModuleIdLt\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/tools/rust-analyzer/crates/hir-def/src/lib.rs"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"c115963cf087256dead8155256da18f8a2c6d95b0b7a4c7529504a1562c949da"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Diagnostic (LCOM4 4): Diagnostic\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/tools/rust-analyzer/crates/ide-diagnostics/src/lib.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6884e989d3f6e842be300a71876379fdbbdd7c92dbbf3e703341c1e56aba326"}},{"ruleId":"D12","level":"warning","message":{"text":"Yanked release: aes: \u0060aes\u0060 resolves to 0.9.0 in the committed Cargo.lock, and crates.io reports that release as YANKED. A yanked release is one the publisher has withdrawn and asked you to stop using; it keeps resolving only so existing locks do not break. The current stable release is 0.9.4. Run \u0060cargo update -p aes\u0060 and commit the updated lock."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"477026069f5742a1690b3d12d423d622964067d58fa23311a382fee88b12805c"}},{"ruleId":"D13","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":"961fe2390301827e83b853997c7e82a7acade469ad3168c6fa7ed644c53e7075"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D13","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":"f332d7ca3e91d7db026764a4dbae376b1ea81c56092c973f470f0109ace41dad"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D13","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":"0290b4413c097117cfd68d4d35e473f115d0effb807d28383c94ec08ec11a8a0"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D13","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":"548ffcd898d5f35d155e99863a4ed14a19e54ba8b60a1d56af434f988890acdf"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_codegen_llvm/src/intrinsic.rs: compiler/rustc_codegen_llvm/src/intrinsic.rs changed 53 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 264 in rustc_codegen_llvm::intrinsic::generic_simd_intrinsic at line 1979. 2 of those changes were fix/bug commits, and the other 51 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_codegen_llvm/src/intrinsic.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":"compiler/rustc_codegen_llvm/src/intrinsic.rs"},"region":{"startLine":1979}}}],"partialFingerprints":{"codehealthFindingId/v1":"15872cf4f0cddce670b2cbf9ce6664157472790d4c0befaeec3363c700bdc782"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tools/miri/src/shims/unix/foreign_items.rs: src/tools/miri/src/shims/unix/foreign_items.rs changed 49 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 47 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/tools/miri/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/tools/miri/src/shims/unix/foreign_items.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc4b64bcb1491309571731483f6e6ef0fada3b25a5deb657274d1030838e2437"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_trait_selection/src/error_reporting/traits/fulfillment_errors.rs: compiler/rustc_trait_selection/src/error_reporting/traits/fulfillment_errors.rs changed 46 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 104 in TypeErrCtxt::report_selection_error at line 93. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_trait_selection/src/error_reporting/traits/fulfillment_errors.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":"compiler/rustc_trait_selection/src/error_reporting/traits/fulfillment_errors.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"b49be6814feed38fc873ab0b633a9a34b6138bcabe96e9c81d6c2381b3564e41"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/bootstrap/src/core/build_steps/test.rs: src/bootstrap/src/core/build_steps/test.rs changed 41 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 113 in Compiletest::run at line 2339. 1 of those changes was a fix/bug commit, and the other 40 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/bootstrap/src/core/build_steps/test.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/bootstrap/src/core/build_steps/test.rs"},"region":{"startLine":2339}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca183f48df61e8703005a16858d6ebc88ddaf7f46fa6e73bd48d97fedcc8282d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_lints/src/methods/mod.rs: clippy_lints/src/methods/mod.rs changed 24 times in last 90 days, max cyclomatic complexity 191 in Methods::check_methods at line 5437. 2 of those changes were fix/bug commits, and the other 22 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/methods/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/methods/mod.rs"},"region":{"startLine":5437}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f2831c6fb77718a6c1a1dacac51cbbfb2337a81f733be317ff07f025ce77185"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/librustdoc/html/static/js/search.js: src/librustdoc/html/static/js/search.js changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 935 in search.initSearch 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/librustdoc/html/static/js/search.js\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/librustdoc/html/static/js/search.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"c10e13d9d3720ffe345b9be9df06e2fecf10eb59ce2bc4f30a7fe210ae99a1b6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_attr_ir/src/lang_items.rs: compiler/rustc_attr_ir/src/lang_items.rs changed 14 times in last 90 days, max cyclomatic complexity 234 in LangItem::from_u32 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_attr_ir/src/lang_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":"compiler/rustc_attr_ir/src/lang_items.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"a80e7144dc9931d56be85b55f291caa4a2b53d071734d53654307cee42e0fab5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/bootstrap/src/core/builder/cargo.rs: src/bootstrap/src/core/builder/cargo.rs changed 28 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 113 in Builder::cargo at line 700. 1 of those changes was a fix/bug commit, and the other 27 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/bootstrap/src/core/builder/cargo.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/bootstrap/src/core/builder/cargo.rs"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"4abf029e9224293fd7f9dbf17fadd4fd86fdace5fcf5301b0020a7a4058a3e03"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/bootstrap/src/core/config/config.rs: src/bootstrap/src/core/config/config.rs changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 120 in Config::parse_inner at line 385. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/bootstrap/src/core/config/config.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/config/config.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"5935717cb7a2e80cabf367acf3b28d79ccfa0106dda0ac9cc4e73688a269013f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_resolve/src/late/diagnostics.rs: compiler/rustc_resolve/src/late/diagnostics.rs changed 38 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 74 in LateResolutionVisitor::smart_resolve_context_dependent_help at line 2488. 1 of those changes was a fix/bug commit, and the other 37 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_resolve/src/late/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":"compiler/rustc_resolve/src/late/diagnostics.rs"},"region":{"startLine":2488}}}],"partialFingerprints":{"codehealthFindingId/v1":"3636546056e16ea2426e63cb511e2fc164a41117f8955e1a3ac6dba73982610f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs: compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 167 in rustc_codegen_cranelift::intrinsics::codegen_regular_intrinsic_call at line 386. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab9350f06e74ad0a9734d6ff5eb4bc7dbd74669595e8650a2223548d21adf2e0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_resolve/src/diagnostics/impls.rs: compiler/rustc_resolve/src/diagnostics/impls.rs changed 32 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 76 in Resolver::into_struct_error at line 799. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_resolve/src/diagnostics/impls.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":"compiler/rustc_resolve/src/diagnostics/impls.rs"},"region":{"startLine":799}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e8a7a94009526aa3fa1406178f109152d131da72c0bdd6bff5c84687697d5bd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tools/miri/src/shims/unix/fs.rs: src/tools/miri/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. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/tools/miri/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/tools/miri/src/shims/unix/fs.rs"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"53790bb544ae5c5e6d5fe3ffe385ed30764fbd77d3fee31b893462d4216ebcde"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/lib.rs: src/lib.rs changed 24 times in last 90 days, max cyclomatic complexity 95 in ide_diagnostics::semantic_diagnostics at line 377. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/lib.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lib.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c530fbeeba83c04da61dff30496df913b8ad97db9ae2ce4ec912d047bc7cc0a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tools/miri/src/shims/windows/foreign_items.rs: src/tools/miri/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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/tools/miri/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/tools/miri/src/shims/windows/foreign_items.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdee30a51f18ea8d7f6e91495daa0e00ae8d9e1342e6e4be4de0e7fe669a6931"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/bootstrap/src/core/build_steps/llvm.rs: src/bootstrap/src/core/build_steps/llvm.rs changed 35 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 60 in Llvm::run at line 440. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/bootstrap/src/core/build_steps/llvm.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/bootstrap/src/core/build_steps/llvm.rs"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7997903d84c56f1146be244bb7e3915767b41a43ce71ab12f4f4efdf6e9173d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_parse/src/parser/expr.rs: compiler/rustc_parse/src/parser/expr.rs changed 40 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 51 in Parser::parse_expr_bottom at line 1246. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_parse/src/parser/expr.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":"compiler/rustc_parse/src/parser/expr.rs"},"region":{"startLine":1246}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a27736762c04d9d2fafba0a4375969cf8b5ebe983f73014599b51031e515801"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tools/rust-analyzer/crates/ide-completion/src/context/analysis.rs: src/tools/rust-analyzer/crates/ide-completion/src/context/analysis.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 152 in ide_completion::context::analysis::classify_name_ref at line 967. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/tools/rust-analyzer/crates/ide-completion/src/context/analysis.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/tools/rust-analyzer/crates/ide-completion/src/context/analysis.rs"},"region":{"startLine":967}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6da15a3447ec705c6882de05d1e7f41c42e85f2968e93572acf51886f99ecaf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_ast_lowering/src/lib.rs: compiler/rustc_ast_lowering/src/lib.rs changed 58 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in LoweringContext::lower_ty at line 1534. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_ast_lowering/src/lib.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ast_lowering/src/lib.rs"},"region":{"startLine":1534}}}],"partialFingerprints":{"codehealthFindingId/v1":"342ccaa5e0e71c63e12798c958d459f73466304eb329504b7eedc984cb37ba40"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tools/miri/src/shims/foreign_items.rs: src/tools/miri/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. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/tools/miri/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/tools/miri/src/shims/foreign_items.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bb89bc912f2ff218212b6959e9237383ba27cf13132fd00922b56047b8f17cf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_codegen_llvm/src/asm.rs: compiler/rustc_codegen_llvm/src/asm.rs changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 93 in rustc_codegen_llvm::asm::reg_to_llvm at line 728. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_codegen_llvm/src/asm.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":"compiler/rustc_codegen_llvm/src/asm.rs"},"region":{"startLine":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"165326b2fb0de3d0df866b76de617958033158248f73508ebca85692e2e95456"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_metadata/src/rmeta/encoder.rs: compiler/rustc_metadata/src/rmeta/encoder.rs changed 31 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 57 in EncodeContext::encode_def_ids at line 1486. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_metadata/src/rmeta/encoder.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":"compiler/rustc_metadata/src/rmeta/encoder.rs"},"region":{"startLine":1486}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5bb475ef17620eeff281eb8d83670267759a5b6444318c6b8cddb5a04bd8f8b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/intrinsic/simd.rs: src/intrinsic/simd.rs changed 7 times in last 90 days, max cyclomatic complexity 252 in rustc_codegen_gcc::intrinsic::simd::generic_simd_intrinsic at line 28. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/intrinsic/simd.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/intrinsic/simd.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"19dbd960b2285cfdfcbc229778be0868b9b6407ec95a40a3bb4061da0bdd55b0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_codegen_gcc/src/intrinsic/mod.rs: compiler/rustc_codegen_gcc/src/intrinsic/mod.rs changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 86 in Builder::codegen_intrinsic_call at line 139. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_codegen_gcc/src/intrinsic/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_gcc/src/intrinsic/mod.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"f807f925347d4dabbaa18fe1fccf2aaf6b18d88f38746769ad77467ebb0d060a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_ast_lowering/src/expr.rs: compiler/rustc_ast_lowering/src/expr.rs changed 26 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 66 in LoweringContext::lower_expr_mut at line 219. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_ast_lowering/src/expr.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":"compiler/rustc_ast_lowering/src/expr.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"51bc311a62eb3c84a1ab5940b00c91085d1d6a90962ddcce20e6d75648f6a2fb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_codegen_llvm/src/context.rs: compiler/rustc_codegen_llvm/src/context.rs changed 30 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 56 in rustc_codegen_llvm::context::init_module at line 195. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_codegen_llvm/src/context.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":"compiler/rustc_codegen_llvm/src/context.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fd4d4806e286e7387a074ed67b5dba1f870c43765bea4656999de3dcc9cd7fb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_mir_build/src/thir/cx/expr.rs: compiler/rustc_mir_build/src/thir/cx/expr.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 112 in ThirBuildCx::make_mirror_unadjusted at line 392. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_mir_build/src/thir/cx/expr.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":"compiler/rustc_mir_build/src/thir/cx/expr.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aa2f2d8953f832ceac6cc380f2516ea7d660a6fafd945c335ddbdbb595b41e9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_trait_selection/src/traits/select/mod.rs: compiler/rustc_trait_selection/src/traits/select/mod.rs changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 67 in SelectionContext::evaluate_predicate_recursively at line 524. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_trait_selection/src/traits/select/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/traits/select/mod.rs"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"df74bda2bb7ecb08599491ec2416547012950aa073ab2011fd2eba0d26541e85"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_resolve/src/late.rs: compiler/rustc_resolve/src/late.rs changed 44 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in LateResolutionVisitor::resolve_expr at line 5512. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_resolve/src/late.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":"compiler/rustc_resolve/src/late.rs"},"region":{"startLine":5512}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb6413bcd321e95b80970018f0e0299ef11147a786500fdfea500101cedff0e6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_hir_typeck/src/expr.rs: compiler/rustc_hir_typeck/src/expr.rs changed 36 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in FnCtxt::check_expr_struct_fields at line 1920. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_hir_typeck/src/expr.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":"compiler/rustc_hir_typeck/src/expr.rs"},"region":{"startLine":1920}}}],"partialFingerprints":{"codehealthFindingId/v1":"80f00c60fea32f98ff2db42541a1426a617bf3e9b740938cc90d3cad7140dbf3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_hir_analysis/src/check/check.rs: compiler/rustc_hir_analysis/src/check/check.rs changed 26 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 63 in rustc_hir_analysis::check::check::check_item_type at line 762. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_hir_analysis/src/check/check.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":"compiler/rustc_hir_analysis/src/check/check.rs"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"44aceabe059d7a0b60ed8621daf123ff671043a6db3535e5a2a2700fd5611f0b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/librustdoc/clean/mod.rs: src/librustdoc/clean/mod.rs changed 34 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 47 in rustdoc::clean::clean_middle_ty at line 2136. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/librustdoc/clean/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/clean/mod.rs"},"region":{"startLine":2136}}}],"partialFingerprints":{"codehealthFindingId/v1":"bff9e4b061e11dd878452133b8a67c20d40dcd631208efb508c5080e9311d2cc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_ast_passes/src/feature_gate.rs: compiler/rustc_ast_passes/src/feature_gate.rs changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 74 in rustc_ast_passes::feature_gate::check_crate at line 403. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_ast_passes/src/feature_gate.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":"compiler/rustc_ast_passes/src/feature_gate.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"a965de6567b64eec7fdedc453f117d6675225ceb8276b83a0028bda12d469832"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_const_eval/src/const_eval/machine.rs: compiler/rustc_const_eval/src/const_eval/machine.rs changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 73 in CompileTimeMachine::call_intrinsic at line 477. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_const_eval/src/const_eval/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":"compiler/rustc_const_eval/src/const_eval/machine.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"053c9fb3329587f744c789a30f914437686c16f899fd10fa5f3248eaa24393a1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/intrinsic/mod.rs: src/intrinsic/mod.rs changed 16 times in last 90 days, max cyclomatic complexity 86 in Builder::codegen_intrinsic_call at line 139. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/intrinsic/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/intrinsic/mod.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"6695152483d147c31aa7f6f91234fe3e7fa74b9b51ddf9c8bdcbe79bcffd0487"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/librustdoc/html/render/mod.rs: src/librustdoc/html/render/mod.rs changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 55 in rustdoc::html::render::render_impl at line 1893. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/librustdoc/html/render/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/render/mod.rs"},"region":{"startLine":1893}}}],"partialFingerprints":{"codehealthFindingId/v1":"0470af3397a9843eb5f893d8828221c47ae0365644f7c55cadb56af817a1d5dd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_parse/src/parser/diagnostics.rs: compiler/rustc_parse/src/parser/diagnostics.rs changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 59 in Parser::expected_one_of_not_found at line 345. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_parse/src/parser/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":"compiler/rustc_parse/src/parser/diagnostics.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"da3468535593a76cd71d4bb6e9c973f152b92e1f432bc3f78b86997912ca54d6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_ty_utils/src/layout.rs: compiler/rustc_ty_utils/src/layout.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 84 in rustc_ty_utils::layout::layout_of_uncached at line 205. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_ty_utils/src/layout.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":"compiler/rustc_ty_utils/src/layout.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"647ca990042f49e498d67afb10f258c9c0ee7721c07a62fe7a52b7c297757f19"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tools/rust-analyzer/crates/hir-ty/src/mir/lower.rs: src/tools/rust-analyzer/crates/hir-ty/src/mir/lower.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 131 in MirLowerCtx::lower_expr_to_place_without_adjust at line 370. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/tools/rust-analyzer/crates/hir-ty/src/mir/lower.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/tools/rust-analyzer/crates/hir-ty/src/mir/lower.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1cede506109a91518e9f4e92082da7947108aef23860010a86317dbbbd63826"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tools/rust-analyzer/crates/hir-ty/src/mir/eval.rs: src/tools/rust-analyzer/crates/hir-ty/src/mir/eval.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 100 in Evaluator::eval_rvalue at line 1029. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/tools/rust-analyzer/crates/hir-ty/src/mir/eval.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/tools/rust-analyzer/crates/hir-ty/src/mir/eval.rs"},"region":{"startLine":1029}}}],"partialFingerprints":{"codehealthFindingId/v1":"d467cc1be5659377d28a7f490a147957765ac3f6926504a9121b9ed121e8238f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_middle/src/ty/print/pretty.rs: compiler/rustc_middle/src/ty/print/pretty.rs changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 58 in PrettyPrinter::pretty_print_type at line 761. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_middle/src/ty/print/pretty.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":"compiler/rustc_middle/src/ty/print/pretty.rs"},"region":{"startLine":761}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cfd42fd30156d3a95aa8f058002968f1eda3dcc6064f6f6cbd282799a279e43"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_const_eval/src/interpret/intrinsics.rs: compiler/rustc_const_eval/src/interpret/intrinsics.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 97 in InterpCx::eval_intrinsic at line 171. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_const_eval/src/interpret/intrinsics.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":"compiler/rustc_const_eval/src/interpret/intrinsics.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeaa9483f00b78d0c55c6fe304370181ab667f42ab4953e68270cf4ed87ef547"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_codegen_gcc/src/intrinsic/simd.rs: compiler/rustc_codegen_gcc/src/intrinsic/simd.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 252 in rustc_codegen_gcc::intrinsic::simd::generic_simd_intrinsic at line 28. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_codegen_gcc/src/intrinsic/simd.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":"compiler/rustc_codegen_gcc/src/intrinsic/simd.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"24955095735b8cadb4e7c8ebceb29f52a038cf6af03afc8602e3729e3e5b6e54"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/librustdoc/config.rs: src/librustdoc/config.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 88 in Options::from_matches at line 390. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/librustdoc/config.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/config.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2d1906ea847c087cb8bfc287fd359a2ca159e7bd102b45be37cad72b60ab6d9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_passes/src/check_attr.rs: compiler/rustc_passes/src/check_attr.rs changed 57 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in CheckAttrVisitor::check_repr at line 966. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_passes/src/check_attr.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":"compiler/rustc_passes/src/check_attr.rs"},"region":{"startLine":966}}}],"partialFingerprints":{"codehealthFindingId/v1":"55efea32721272c1be2847bcbc5462656eacae6a7a9f9eabe09a18292d5dd9d3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/bootstrap/src/core/build_steps/compile.rs: src/bootstrap/src/core/build_steps/compile.rs changed 29 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in Assemble::run at line 2122. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/bootstrap/src/core/build_steps/compile.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/bootstrap/src/core/build_steps/compile.rs"},"region":{"startLine":2122}}}],"partialFingerprints":{"codehealthFindingId/v1":"40ea5db41514cfa61ae919581cb68a12608dc6de6474377f021d7cb4f4f266ed"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_hir_typeck/src/fn_ctxt/suggestions.rs: compiler/rustc_hir_typeck/src/fn_ctxt/suggestions.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 64 in FnCtxt::suggest_deref_or_ref at line 2966. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_hir_typeck/src/fn_ctxt/suggestions.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":"compiler/rustc_hir_typeck/src/fn_ctxt/suggestions.rs"},"region":{"startLine":2966}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e3c4aaec69850465be08bffd33edf6d794945d4b7b879e0dafb0952fab3357a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_hir_typeck/src/fn_ctxt/checks.rs: compiler/rustc_hir_typeck/src/fn_ctxt/checks.rs changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 52 in FnCtxt::label_fn_like at line 1665. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_hir_typeck/src/fn_ctxt/checks.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":"compiler/rustc_hir_typeck/src/fn_ctxt/checks.rs"},"region":{"startLine":1665}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf44e2f9ea6d332f257daa6b26a706abf9dcbeddbb00003a28cc15e8fe273bf8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_codegen_ssa/src/back/link.rs: compiler/rustc_codegen_ssa/src/back/link.rs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 66 in rustc_codegen_ssa::back::link::link_natively at line 1232. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_codegen_ssa/src/back/link.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":"compiler/rustc_codegen_ssa/src/back/link.rs"},"region":{"startLine":1232}}}],"partialFingerprints":{"codehealthFindingId/v1":"021319b8caf78454a517606437146edd7d14c283fab1cd140e99735a6bc51994"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_codegen_ssa/src/mir/block.rs: compiler/rustc_codegen_ssa/src/mir/block.rs changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 59 in FunctionCx::codegen_call_terminator at line 955. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_codegen_ssa/src/mir/block.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":"compiler/rustc_codegen_ssa/src/mir/block.rs"},"region":{"startLine":955}}}],"partialFingerprints":{"codehealthFindingId/v1":"66461d47583e68d9be2e0da40b84dd330c9963d6f3c7db5f426f87f47325a573"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_hir_typeck/src/method/suggest.rs: compiler/rustc_hir_typeck/src/method/suggest.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 70 in FnCtxt::handle_unsatisfied_predicates at line 1705. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_hir_typeck/src/method/suggest.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":"compiler/rustc_hir_typeck/src/method/suggest.rs"},"region":{"startLine":1705}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d026ba2e17de9f54b5631624b79e25f2c3924e386731c88fde04ca5e6f60169"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_const_eval/src/interpret/intrinsics/simd.rs: compiler/rustc_const_eval/src/interpret/intrinsics/simd.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 139 in InterpCx::eval_simd_intrinsic at line 21. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_const_eval/src/interpret/intrinsics/simd.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":"compiler/rustc_const_eval/src/interpret/intrinsics/simd.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"b889e8354026453fb51b02decc9b4eaefe9c32c9583cb608dfd05c5b4f1d14a8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_codegen_ssa/src/codegen_attrs.rs: compiler/rustc_codegen_ssa/src/codegen_attrs.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 61 in rustc_codegen_ssa::codegen_attrs::process_builtin_attrs at line 58. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_codegen_ssa/src/codegen_attrs.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":"compiler/rustc_codegen_ssa/src/codegen_attrs.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ad1e1b6e11f3631725d5727b759137eaf7d347e0bfbbec54463f80f09f51167"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_ast_lowering/src/item.rs: compiler/rustc_ast_lowering/src/item.rs changed 42 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in LoweringContext::lower_item_kind at line 182. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_ast_lowering/src/item.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":"compiler/rustc_ast_lowering/src/item.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"d27482e1ae3936dbdde3e76ad4ec622df3d1f48002771c9153f391c4c9f8f107"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_utils/src/consts.rs: clippy_utils/src/consts.rs changed 15 times in last 90 days, max cyclomatic complexity 70 in ConstEvalCtxt::binop at line 1026. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- clippy_utils/src/consts.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":"clippy_utils/src/consts.rs"},"region":{"startLine":1026}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f2a2df3471641a22f60ae72c92aa00a32d44e6cc4f7f4015c110aabbff1e44f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tools/miri/src/shims/unix/linux/foreign_items.rs: src/tools/miri/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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/tools/miri/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/tools/miri/src/shims/unix/linux/foreign_items.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b2ffa65799fb695fc5e0bb86643e06ebd3a791ff00a138727882af00bbe0c7b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_trait_selection/src/error_reporting/infer/mod.rs: compiler/rustc_trait_selection/src/error_reporting/infer/mod.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 78 in TypeErrCtxt::note_type_err at line 1465. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_trait_selection/src/error_reporting/infer/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/error_reporting/infer/mod.rs"},"region":{"startLine":1465}}}],"partialFingerprints":{"codehealthFindingId/v1":"901ea74d2925a0533b21e19b353ba8ea4da31c1378f86a23381107d9cc9b9536"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_next_trait_solver/src/solve/eval_ctxt/mod.rs: compiler/rustc_next_trait_solver/src/solve/eval_ctxt/mod.rs changed 44 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in EvalCtxt::term_is_fully_unconstrained at line 1226. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_next_trait_solver/src/solve/eval_ctxt/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_next_trait_solver/src/solve/eval_ctxt/mod.rs"},"region":{"startLine":1226}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cc3e062751cf80f5ac94eba0701643327d1e4ca244be8f9b2a6af46c62202a6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_codegen_llvm/src/back/write.rs: compiler/rustc_codegen_llvm/src/back/write.rs changed 37 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in rustc_codegen_llvm::back::write::llvm_optimize at line 548. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_codegen_llvm/src/back/write.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":"compiler/rustc_codegen_llvm/src/back/write.rs"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"b09d5c8eee3c92dc8c3368634c59343c38da60c6a6b594600273d00127edf665"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_trait_selection/src/solve/delegate.rs: compiler/rustc_trait_selection/src/solve/delegate.rs changed 31 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in SolverDelegate::compute_goal_fast_path at line 151. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_trait_selection/src/solve/delegate.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":"compiler/rustc_trait_selection/src/solve/delegate.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b853057908c9da4f9c814f90add11f04aaaa9a18e1f630f123ad8f1e574f5ed"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_utils/src/lib.rs: clippy_utils/src/lib.rs changed 23 times in last 90 days, max cyclomatic complexity 42 in clippy_utils::is_never_expr at line 3021. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- clippy_utils/src/lib.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_utils/src/lib.rs"},"region":{"startLine":3021}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea245a7cd12e2f972f2c261dcbcf2a69cc1e934c6f2a62826611647e1e97400a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_codegen_ssa/src/back/write.rs: compiler/rustc_codegen_ssa/src/back/write.rs changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 48 in rustc_codegen_ssa::back::write::start_executing_work at line 1204. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_codegen_ssa/src/back/write.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":"compiler/rustc_codegen_ssa/src/back/write.rs"},"region":{"startLine":1204}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8351dbf4934082fcc8e265c15d834c06a4cb4db161891b6731391ecef851def"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_hir_typeck/src/fn_ctxt/_impl.rs: compiler/rustc_hir_typeck/src/fn_ctxt/_impl.rs changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 50 in FnCtxt::instantiate_value_path at line 1037. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_hir_typeck/src/fn_ctxt/_impl.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":"compiler/rustc_hir_typeck/src/fn_ctxt/_impl.rs"},"region":{"startLine":1037}}}],"partialFingerprints":{"codehealthFindingId/v1":"98c54ceb0579ae3314eb7620f4a475244e8755616fc686dce550afadcead4297"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_builtin_macros/src/deriving/debug.rs: compiler/rustc_builtin_macros/src/deriving/debug.rs changed 52 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in rustc_builtin_macros::deriving::debug::debug_body at line 63. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_builtin_macros/src/deriving/debug.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":"compiler/rustc_builtin_macros/src/deriving/debug.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"03f3497c9598f1e1a0ee80bd03f7e57829eb49dc4cd42572c86d9ad69a2b298e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_attr_parsing/src/interface.rs: compiler/rustc_attr_parsing/src/interface.rs changed 30 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in AttributeParser::parse_attribute_list at line 317. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_attr_parsing/src/interface.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":"compiler/rustc_attr_parsing/src/interface.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"74ab065b7f9a6a2b02841ce9049d7f62bd122970a85340189d2fc390681b4f41"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/asm.rs: src/asm.rs changed 10 times in last 90 days, max cyclomatic complexity 93 in rustc_codegen_llvm::asm::reg_to_llvm at line 728. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/asm.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/asm.rs"},"region":{"startLine":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"95b7b0f9076612ad5b3935d68e8fabe98ee3cd583ce14f8151c752ee8269a010"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tools/miri/src/shims/unix/macos/foreign_items.rs: src/tools/miri/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. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/tools/miri/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/tools/miri/src/shims/unix/macos/foreign_items.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"862dd95d597323b0cf68c712a889355778cb0348274f3e4684b6f8f61913722b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_utils/src/hir_utils.rs: clippy_utils/src/hir_utils.rs changed 13 times in last 90 days, max cyclomatic complexity 69 in HirEqInterExpr::eq_expr at line 504. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- clippy_utils/src/hir_utils.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":"clippy_utils/src/hir_utils.rs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"81f841d6548bfd9b36a3143a72ed936d1c7f1d846e2996a7b96ef356dd850292"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: library/stdarch/crates/stdarch-gen-loongarch/src/main.rs: library/stdarch/crates/stdarch-gen-loongarch/src/main.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 128 in stdarch_gen_loongarch::gen_bind_body at line 253. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- library/stdarch/crates/stdarch-gen-loongarch/src/main.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/stdarch-gen-loongarch/src/main.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6c49c807109865810340221b66e3321bd951b7e74a0521cb1893dd369577e0d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_parse/src/parser/ty.rs: compiler/rustc_parse/src/parser/ty.rs changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in Parser::parse_ty_common at line 291. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_parse/src/parser/ty.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":"compiler/rustc_parse/src/parser/ty.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"0303d2005b88b14bb8f0b9c0b7cb2876152aaea31aa75a236a3dd17da732b2fd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_driver_impl/src/lib.rs: compiler/rustc_driver_impl/src/lib.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 49 in rustc_driver_impl::print_crate_info at line 632. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_driver_impl/src/lib.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_driver_impl/src/lib.rs"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"519cd287e96cc2078ec8b9e5f540e587a3de5bbe02f7766259a63c4d42166cec"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_codegen_llvm/src/va_arg.rs: compiler/rustc_codegen_llvm/src/va_arg.rs changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 45 in rustc_codegen_llvm::va_arg::emit_va_arg at line 1070. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_codegen_llvm/src/va_arg.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":"compiler/rustc_codegen_llvm/src/va_arg.rs"},"region":{"startLine":1070}}}],"partialFingerprints":{"codehealthFindingId/v1":"68389770e3a13ade345df797beac4f3ad0ab08828e93e9ad116d9a8f35d8013a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_expand/src/expand.rs: compiler/rustc_expand/src/expand.rs changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in MacroExpander::expand_invoc at line 699. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_expand/src/expand.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":"compiler/rustc_expand/src/expand.rs"},"region":{"startLine":699}}}],"partialFingerprints":{"codehealthFindingId/v1":"9792e69d37d5d36a8518866395684500741c1ba46db4c820ac782e390638ae17"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/consts.rs: src/consts.rs changed 12 times in last 90 days, max cyclomatic complexity 70 in ConstEvalCtxt::binop at line 1026. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/consts.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/consts.rs"},"region":{"startLine":1026}}}],"partialFingerprints":{"codehealthFindingId/v1":"36b27f96827a13b8287e2bc54a9cb0fa8ec7c7202585c92b4588eb7f40cecae1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/librustdoc/passes/collect_intra_doc_links.rs: src/librustdoc/passes/collect_intra_doc_links.rs changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in rustdoc::passes::collect_intra_doc_links::resolution_failure at line 2106. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/librustdoc/passes/collect_intra_doc_links.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/librustdoc/passes/collect_intra_doc_links.rs"},"region":{"startLine":2106}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2fffa62793c264442665643b6cd9da388d870dd4314da31e442dcdcbf02a950"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/intrinsics/mod.rs: src/intrinsics/mod.rs changed 5 times in last 90 days, max cyclomatic complexity 167 in rustc_codegen_cranelift::intrinsics::codegen_regular_intrinsic_call at line 386. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/intrinsics/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/intrinsics/mod.rs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f089ac6faa682a9ef19dc1eaeb2b0102facef1b96bedc75b7d273669e4f2315"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_resolve/src/ident.rs: compiler/rustc_resolve/src/ident.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 52 in Resolver::visit_scopes at line 54. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_resolve/src/ident.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":"compiler/rustc_resolve/src/ident.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a2d3621551cc5ac85e9b9dbc20db2d45ba8d16dccd9a587e6dedad8c6090761"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_codegen_ssa/src/mir/intrinsic.rs: compiler/rustc_codegen_ssa/src/mir/intrinsic.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 83 in FunctionCx::codegen_intrinsic_call at line 56. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_codegen_ssa/src/mir/intrinsic.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":"compiler/rustc_codegen_ssa/src/mir/intrinsic.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"1430546f6d3adbc4c7510b904d4e2255a77df32687adbebdc9ec535f09ef5623"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_codegen_llvm/src/llvm_util.rs: compiler/rustc_codegen_llvm/src/llvm_util.rs changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in rustc_codegen_llvm::llvm_util::to_llvm_features at line 237. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_codegen_llvm/src/llvm_util.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":"compiler/rustc_codegen_llvm/src/llvm_util.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fb31ea3fc64814fcd07fec9290e0d4fa4cc178bde3a88d4df0934575a7f6f50"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tools/rust-analyzer/crates/hir-ide/src/display.rs: src/tools/rust-analyzer/crates/hir-ide/src/display.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 117 in Ty::hir_fmt at line 1281. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/tools/rust-analyzer/crates/hir-ide/src/display.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/tools/rust-analyzer/crates/hir-ide/src/display.rs"},"region":{"startLine":1281}}}],"partialFingerprints":{"codehealthFindingId/v1":"e549932beb99f2626a8b049237d63436b368e90cf3789dec59c968510b34d1d8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_parse/src/parser/item.rs: compiler/rustc_parse/src/parser/item.rs changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in Parser::parse_item_kind at line 254. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_parse/src/parser/item.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":"compiler/rustc_parse/src/parser/item.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"d29cff81690534ece85123d4a5aaa59ca754c87a4031212e72d8798261765209"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_attr_parsing/src/attributes/doc.rs: compiler/rustc_attr_parsing/src/attributes/doc.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in DocParser::parse_single_doc_attr_item at line 637. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_attr_parsing/src/attributes/doc.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":"compiler/rustc_attr_parsing/src/attributes/doc.rs"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e8cb0837c5ce215560c8c8e28d4c9de2823e51bde13dc48a94e2ebe69779f83"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/librustdoc/html/render/print_item.rs: src/librustdoc/html/render/print_item.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 62 in rustdoc::html::render::print_item::item_trait at line 630. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/librustdoc/html/render/print_item.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/librustdoc/html/render/print_item.rs"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"b55c80ede73ec9da7e19c54c81b6c554f159dd45470ffbf3b85ef1f882d62c15"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tools/tidy/src/style.rs: src/tools/tidy/src/style.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 92 in tidy::style::check_file_style at line 327. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/tools/tidy/src/style.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/tools/tidy/src/style.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"5826323f16b473dc8b49a38b19c492f85e0a5498871c6ffaab3959dadbddd157"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_mir_build/src/builder/expr/into.rs: compiler/rustc_mir_build/src/builder/expr/into.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 66 in Builder::expr_into_dest at line 26. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_mir_build/src/builder/expr/into.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":"compiler/rustc_mir_build/src/builder/expr/into.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f27156d95b4f3b9de5af3a2fdac75a10ce9416469762e616539ce690f660397"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_trait_selection/src/traits/wf.rs: compiler/rustc_trait_selection/src/traits/wf.rs changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in WfPredicates::visit_ty at line 775. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_trait_selection/src/traits/wf.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":"compiler/rustc_trait_selection/src/traits/wf.rs"},"region":{"startLine":775}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6c70e49352c7553124ae1636597d5c254b24eebdc56dd506fbc928414fc63ea"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tools/rust-analyzer/crates/hir-def/src/expr_store/lower.rs: src/tools/rust-analyzer/crates/hir-def/src/expr_store/lower.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 90 in ExprCollector::maybe_collect_expr at line 1417. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/tools/rust-analyzer/crates/hir-def/src/expr_store/lower.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/tools/rust-analyzer/crates/hir-def/src/expr_store/lower.rs"},"region":{"startLine":1417}}}],"partialFingerprints":{"codehealthFindingId/v1":"11fe12124fee1f43ec623d2366fa753d558571be2fbce06b34d92e02e7f79bc4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_hir_analysis/src/check/wfcheck.rs: compiler/rustc_hir_analysis/src/check/wfcheck.rs changed 42 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in rustc_hir_analysis::check::wfcheck::check_param_wf at line 795. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_hir_analysis/src/check/wfcheck.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":"compiler/rustc_hir_analysis/src/check/wfcheck.rs"},"region":{"startLine":795}}}],"partialFingerprints":{"codehealthFindingId/v1":"17c55f00628cecd74fd0d05de6fcdebacda2a4ce5e4fc8cbac2d65969444eff8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_codegen_llvm/src/builder.rs: compiler/rustc_codegen_llvm/src/builder.rs changed 31 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in Builder::cfi_type_test at line 1968. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_codegen_llvm/src/builder.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/builder.rs"},"region":{"startLine":1968}}}],"partialFingerprints":{"codehealthFindingId/v1":"77e0e33a48c2c138e94c0aae9a7971900b2e9dbf0bbb25020932c4dd3d3db945"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_hir_typeck/src/method/probe.rs: compiler/rustc_hir_typeck/src/method/probe.rs changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in ProbeContext::consider_probe at line 2000. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_hir_typeck/src/method/probe.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":"compiler/rustc_hir_typeck/src/method/probe.rs"},"region":{"startLine":2000}}}],"partialFingerprints":{"codehealthFindingId/v1":"98c60888679b947e3ebbdf9c1d691ae1d1505997781e49cf20d91271ac27e5a0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_trait_selection/src/traits/fulfill.rs: compiler/rustc_trait_selection/src/traits/fulfill.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 63 in FulfillProcessor::process_obligation at line 381. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_trait_selection/src/traits/fulfill.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":"compiler/rustc_trait_selection/src/traits/fulfill.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"76f29bee8c81fa7d8ea9dbd12fe5849d0c8e4ea7b05432b307d954d58a49ff24"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_hir_analysis/src/collect/type_of.rs: compiler/rustc_hir_analysis/src/collect/type_of.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 48 in rustc_hir_analysis::collect::type_of::type_of at line 22. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_hir_analysis/src/collect/type_of.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":"compiler/rustc_hir_analysis/src/collect/type_of.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"102132b6f98e0d9e3685090ecfbf2eae9e34097a159f37963f0f18de1ce702ab"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/context.rs: src/context.rs changed 12 times in last 90 days, max cyclomatic complexity 56 in rustc_codegen_llvm::context::init_module at line 195. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/context.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/context.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"6835ecdf989214d27d5b35b40a840844748fc23d5d6454a391810aab9c505a02"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tools/miri/src/shims/windows/fs.rs: src/tools/miri/src/shims/windows/fs.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in EvalContextExt::CreateFileW at line 109. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/tools/miri/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/tools/miri/src/shims/windows/fs.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"212c0072c402db292d996f876407595a0fadc6fc6d45fca0e7884f2e866171a2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_lints/src/doc/mod.rs: clippy_lints/src/doc/mod.rs changed 9 times in last 90 days, max cyclomatic complexity 72 in clippy_lints::doc::check_doc at line 1133. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/doc/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/doc/mod.rs"},"region":{"startLine":1133}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b4d83f24c2317fdc15f6a120645b1e326a0c7cbf77461dcd804f98bda79e02d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_errors/src/lib.rs: compiler/rustc_errors/src/lib.rs changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in DiagCtxtInner::emit_diagnostic at line 1145. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_errors/src/lib.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_errors/src/lib.rs"},"region":{"startLine":1145}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d02837cd32717c7b32fd0d43196166a77a99090227f7403a88292fab02be64b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tools/miri/src/shims/unix/socket.rs: src/tools/miri/src/shims/unix/socket.rs changed 39 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 948. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/tools/miri/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/tools/miri/src/shims/unix/socket.rs"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"497621bbc2653608204fff6981ef153e6da7357a0a0527b2e4c4a58be3774bc8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_lint/src/levels.rs: compiler/rustc_lint/src/levels.rs changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in LintLevelsBuilder::add_hir_inner at line 726. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_lint/src/levels.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":"compiler/rustc_lint/src/levels.rs"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4c927d5829cdb45a1f44be962f974c792a5c8bbb27d49d822635c64d60db050"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/librustdoc/html/format.rs: src/librustdoc/html/format.rs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in rustdoc::html::format::fmt_type at line 1116. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/librustdoc/html/format.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/librustdoc/html/format.rs"},"region":{"startLine":1116}}}],"partialFingerprints":{"codehealthFindingId/v1":"fee3533874653ff67ebfbf03b38b0b1048e964d09d0be0d4dd4d31eda635c868"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_trait_selection/src/error_reporting/infer/region.rs: compiler/rustc_trait_selection/src/error_reporting/infer/region.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in TypeErrCtxt::construct_generic_bound_failure at line 717. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_trait_selection/src/error_reporting/infer/region.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":"compiler/rustc_trait_selection/src/error_reporting/infer/region.rs"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"1023f405d77863acb34fbc4241a02a2c1dfd25c5b24e0bfb2728aaac312fa1ce"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_lints/src/dereference.rs: clippy_lints/src/dereference.rs changed 10 times in last 90 days, max cyclomatic complexity 60 in Dereferencing::check_expr at line 242. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/dereference.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":"clippy_lints/src/dereference.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fc1f6735f045f04b8d42f0ebaccabc45202db11bb3d6cc13c01e9d8386a81ff"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_next_trait_solver/src/solve/assembly/mod.rs: compiler/rustc_next_trait_solver/src/solve/assembly/mod.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in EvalCtxt::assemble_builtin_impl_candidates at line 615. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_next_trait_solver/src/solve/assembly/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_next_trait_solver/src/solve/assembly/mod.rs"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fdb544a0462202a05d5c1d5e90b313cc2e5013a03b11382b1e29e5bf671ca3c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tools/rust-analyzer/crates/hir/src/diagnostics.rs: src/tools/rust-analyzer/crates/hir/src/diagnostics.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 66 in AnyDiagnostic::inference_diagnostic at line 1578. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/tools/rust-analyzer/crates/hir/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/tools/rust-analyzer/crates/hir/src/diagnostics.rs"},"region":{"startLine":1578}}}],"partialFingerprints":{"codehealthFindingId/v1":"8beefb3fa3bf242b8d22f0aedebf0f360c8f08141003a90544f70032ea752741"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_target/src/target_features.rs: compiler/rustc_target/src/target_features.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in Target::abi_required_features at line 1333. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_target/src/target_features.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":"compiler/rustc_target/src/target_features.rs"},"region":{"startLine":1333}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad4531e82f56829735a8d87e0db06538c70f7895e5f2f0400508a5f504a08d3c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tools/rust-analyzer/crates/hir-ty/src/infer/expr.rs: src/tools/rust-analyzer/crates/hir-ty/src/infer/expr.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 84 in InferenceContext::infer_expr_inner at line 317. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/tools/rust-analyzer/crates/hir-ty/src/infer/expr.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/tools/rust-analyzer/crates/hir-ty/src/infer/expr.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"006ebe08e98ccdd5229cab9edb78673968d51915ee5ef52f36f9dd78d5aa893a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_builtin_macros/src/format.rs: compiler/rustc_builtin_macros/src/format.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 83 in rustc_builtin_macros::format::make_format_args at line 169. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_builtin_macros/src/format.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":"compiler/rustc_builtin_macros/src/format.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc624c14e2e954bd240119b103bf9f6e3753fbf491baffb58d693107ad127ff7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tools/rustfmt/src/expr.rs: src/tools/rustfmt/src/expr.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 58 in rustfmt_nightly::expr::format_expr at line 86. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/tools/rustfmt/src/expr.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/tools/rustfmt/src/expr.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"6774dd89cde33eeeb3cd58e7b371c169c9c73a49a59ff83f69a945176aeb56b8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_ast_pretty/src/pprust/state.rs: compiler/rustc_ast_pretty/src/pprust/state.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in State::print_pat at line 1923. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_ast_pretty/src/pprust/state.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":"compiler/rustc_ast_pretty/src/pprust/state.rs"},"region":{"startLine":1923}}}],"partialFingerprints":{"codehealthFindingId/v1":"21de22ae10e62fdda72b960bad4522c0d69b4df7a7f0425c99ed33990a38b946"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_builtin_macros/src/autodiff.rs: compiler/rustc_builtin_macros/src/autodiff.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in rustc_builtin_macros::autodiff::llvm_enzyme::gen_enzyme_decl at line 610. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_builtin_macros/src/autodiff.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":"compiler/rustc_builtin_macros/src/autodiff.rs"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"2401dda9d7763efda052155c94a13ad8eadd86462a6cb644c29b6dee856ff78f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_parse/src/lexer/mod.rs: compiler/rustc_parse/src/lexer/mod.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 71 in Lexer::next_token_from_cursor at line 162. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_parse/src/lexer/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/lexer/mod.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"1043d817a76c5f5d3caf50723d8e51cc3e43618ec15978953f0fb120ba54f77e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_trait_selection/src/error_reporting/infer/note_and_explain.rs: compiler/rustc_trait_selection/src/error_reporting/infer/note_and_explain.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 81 in TypeErrCtxt::note_and_explain_type_err at line 20. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_trait_selection/src/error_reporting/infer/note_and_explain.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":"compiler/rustc_trait_selection/src/error_reporting/infer/note_and_explain.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"e35661d398fc1125154c975644f9ca0ba62f929f7d7eae96d1a40b4d1658f16e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_utils/src/ast_utils/mod.rs: clippy_utils/src/ast_utils/mod.rs changed 9 times in last 90 days, max cyclomatic complexity 63 in clippy_utils::ast_utils::eq_expr at line 145. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- clippy_utils/src/ast_utils/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_utils/src/ast_utils/mod.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"91ab1d8df00da66382bc3f1ec18bb70f4e62eb5968c29b5e41d6512f896247ff"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_interface/src/interface.rs: compiler/rustc_interface/src/interface.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 51 in rustc_interface::interface::parse_check_cfg at line 116. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_interface/src/interface.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":"compiler/rustc_interface/src/interface.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"746618327f20f4806eeddbc9b83f390eecbd4b2d718c90aa642024aafa5d5c81"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/base.rs: src/base.rs changed 11 times in last 90 days, max cyclomatic complexity 51 in rustc_codegen_cranelift::base::codegen_stmt at line 610. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/base.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/base.rs"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe5757ca426e89f288935e85b2229c57ebcd1d008d3dd802992339273ad093d6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_symbol_mangling/src/v0.rs: compiler/rustc_symbol_mangling/src/v0.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 56 in V0SymbolMangler::print_type at line 521. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_symbol_mangling/src/v0.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":"compiler/rustc_symbol_mangling/src/v0.rs"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5c9a45a45ab852c331b4d64fb4ba380707557f7b23b306013429a2d1b140710"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/doc/rustc-dev-guide/ci/sembr/src/main.rs: src/doc/rustc-dev-guide/ci/sembr/src/main.rs changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in sembr::reformat at line 136. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/doc/rustc-dev-guide/ci/sembr/src/main.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/doc/rustc-dev-guide/ci/sembr/src/main.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"feee4358018d747c61f902504bd58f81fe53dd21f046abe9312ed98e5f993a0b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_mir_build/src/thir/pattern/check_match.rs: compiler/rustc_mir_build/src/thir/pattern/check_match.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in rustc_mir_build::thir::pattern::check_match::report_non_exhaustive_match at line 1250. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_mir_build/src/thir/pattern/check_match.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":"compiler/rustc_mir_build/src/thir/pattern/check_match.rs"},"region":{"startLine":1250}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec7c5ba1925f91d31539a7e446da660a1f43fedf2323fc104530b8ee2c0d7a9b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/builder.rs: src/builder.rs changed 23 times in last 90 days, max cyclomatic complexity 23 in Builder::cfi_type_test at line 1968. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/builder.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/builder.rs"},"region":{"startLine":1968}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a0c68ea9fced400ec922b44214c457cfc4bd778d6220d1ba51fe0b8d6c72e5f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_borrowck/src/diagnostics/region_errors.rs: compiler/rustc_borrowck/src/diagnostics/region_errors.rs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in MirBorrowckCtxt::point_at_dyn_trait_in_field_def at line 1002. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_borrowck/src/diagnostics/region_errors.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":"compiler/rustc_borrowck/src/diagnostics/region_errors.rs"},"region":{"startLine":1002}}}],"partialFingerprints":{"codehealthFindingId/v1":"f67afd24ebba4a1fc3348743e5acc71e7a0f343e0565a320abd8cf39026df8bf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_parse/src/parser/path.rs: compiler/rustc_parse/src/parser/path.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in Parser::parse_path_segment_with_path_span at line 313. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_parse/src/parser/path.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":"compiler/rustc_parse/src/parser/path.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"5798d0746339c249c6095dc14498acfcc7c53006bf38e93590aeaecfbe9d3c76"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_hir_typeck/src/upvar.rs: compiler/rustc_hir_typeck/src/upvar.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in FnCtxt::analyze_closure at line 243. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_hir_typeck/src/upvar.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":"compiler/rustc_hir_typeck/src/upvar.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"00154d25fce88eed38164787a4610e31bc63cbd6c585cd1ca3102bcaff7505ce"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_abi/src/layout.rs: compiler/rustc_abi/src/layout.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in LayoutCalculator::layout_of_univariant_biased at line 590. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_abi/src/layout.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":"compiler/rustc_abi/src/layout.rs"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"39dad84b654e8fd936d21b14ce8272cbe34571981cae83f4fa3d4e9c0a28fa4d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_ast_pretty/src/pprust/state/expr.rs: compiler/rustc_ast_pretty/src/pprust/state/expr.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 86 in State::print_expr_outer_attr_style at line 385. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_ast_pretty/src/pprust/state/expr.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":"compiler/rustc_ast_pretty/src/pprust/state/expr.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"05ab902aa0f8c79eb09ed60b75db34c3ed7978688cb43244bb8b890f1559760b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/librustdoc/clean/inline.rs: src/librustdoc/clean/inline.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in rustdoc::clean::inline::build_impl at line 473. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/librustdoc/clean/inline.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/librustdoc/clean/inline.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd359d60086d7fac68d5b8420e7e0cfd70610216a0b13eb2fe964eaa3907b346"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_trait_selection/src/error_reporting/traits/ambiguity.rs: compiler/rustc_trait_selection/src/error_reporting/traits/ambiguity.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 63 in TypeErrCtxt::maybe_report_ambiguity at line 206. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_trait_selection/src/error_reporting/traits/ambiguity.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":"compiler/rustc_trait_selection/src/error_reporting/traits/ambiguity.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d7f55e8898b65c907b769fb0542377a63833894c08f7ecb8d581ccd9d013e0f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_hir_typeck/src/cast.rs: compiler/rustc_hir_typeck/src/cast.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 55 in CastCheck::report_cast_error at line 290. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_hir_typeck/src/cast.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":"compiler/rustc_hir_typeck/src/cast.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"09e971f2d8d7c665b5f790d9c65abef75ca0bac1057aaeaa7e55829ff9ae2b36"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/intrinsic/llvm.rs: src/intrinsic/llvm.rs changed 11 times in last 90 days, max cyclomatic complexity 45 in rustc_codegen_gcc::intrinsic::llvm::adjust_intrinsic_arguments at line 119. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/intrinsic/llvm.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/intrinsic/llvm.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec4a17ea38d91c8f78b0890054cb41663935b7ec9311c70b427412f9d66228a4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/gcc_util.rs: src/gcc_util.rs changed 17 times in last 90 days, max cyclomatic complexity 29 in rustc_codegen_gcc::gcc_util::new_context at line 238. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/gcc_util.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/gcc_util.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"990fd1c759c145f66bb645785ce038f51db256e3893b07cb3b7641d35b3013bd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/bootstrap/src/core/sanity.rs: src/bootstrap/src/core/sanity.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 61 in bootstrap::core::sanity::check at line 81. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/bootstrap/src/core/sanity.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/bootstrap/src/core/sanity.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c0a84423b13146149045ab71755e88023c6e38a0293985fbed69566d4d02965"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_hir_analysis/src/check/compare_impl_item.rs: compiler/rustc_hir_analysis/src/check/compare_impl_item.rs changed 28 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in rustc_hir_analysis::check::compare_impl_item::report_trait_method_mismatch at line 1001. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_hir_analysis/src/check/compare_impl_item.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":"compiler/rustc_hir_analysis/src/check/compare_impl_item.rs"},"region":{"startLine":1001}}}],"partialFingerprints":{"codehealthFindingId/v1":"67edebbc426eae51d8a6e8e6d35a365055368365a6c7053e8d43f9f99f36c582"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tools/rust-analyzer/crates/ide-diagnostics/src/lib.rs: src/tools/rust-analyzer/crates/ide-diagnostics/src/lib.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 95 in ide_diagnostics::semantic_diagnostics at line 377. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/tools/rust-analyzer/crates/ide-diagnostics/src/lib.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-diagnostics/src/lib.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"da9bcfa29c8af2caa8d145f2455dd741c76c8944a666edcd4768d58b7ea2bd23"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_ty_utils/src/instance.rs: compiler/rustc_ty_utils/src/instance.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 47 in rustc_ty_utils::instance::resolve_associated_item at line 109. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_ty_utils/src/instance.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":"compiler/rustc_ty_utils/src/instance.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a3a18bddcbfb49af0b27d493bd5884609739e795ee9e9f1fb6e7e4b434004a7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tools/miri/src/diagnostics.rs: src/tools/miri/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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/tools/miri/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/tools/miri/src/diagnostics.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"debb2e35611d0f64c025777845f2e8344be9609f702eefd6bea6570a9aa41f24"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_mir_transform/src/validate.rs: compiler/rustc_mir_transform/src/validate.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 47 in TypeChecker::visit_projection_elem at line 668. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_mir_transform/src/validate.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":"compiler/rustc_mir_transform/src/validate.rs"},"region":{"startLine":668}}}],"partialFingerprints":{"codehealthFindingId/v1":"e73b982cea8080e03e0405989610677d321ee66cb4a790a168c514820a0368d0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_sanitizers/src/cfi/typeid/itanium_cxx_abi/encode.rs: compiler/rustc_sanitizers/src/cfi/typeid/itanium_cxx_abi/encode.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 52 in rustc_sanitizers::cfi::typeid::itanium_cxx_abi::encode::encode_ty at line 425. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_sanitizers/src/cfi/typeid/itanium_cxx_abi/encode.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":"compiler/rustc_sanitizers/src/cfi/typeid/itanium_cxx_abi/encode.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"e375dd0cb0feb0e3b8c07103414f396aa341bf27f4252e0b19b9d80bc596e718"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_codegen_llvm/src/debuginfo/metadata.rs: compiler/rustc_codegen_llvm/src/debuginfo/metadata.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in rustc_codegen_llvm::debuginfo::metadata::build_basic_type_di_node at line 753. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_codegen_llvm/src/debuginfo/metadata.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/debuginfo/metadata.rs"},"region":{"startLine":753}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f9b2a05ddb0512ab2dc0023af40ba3bf9c3e66dc8ff90dcb17c1a59bb371334"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_codegen_llvm/src/abi.rs: compiler/rustc_codegen_llvm/src/abi.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in FnAbi::apply_attrs_llfn at line 480. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_codegen_llvm/src/abi.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":"compiler/rustc_codegen_llvm/src/abi.rs"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"098564a270ee3312df807ec4c4d1cc745ea9b9b3dfb4017ab37fd3f863abbb19"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_trait_selection/src/traits/project.rs: compiler/rustc_trait_selection/src/traits/project.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in rustc_trait_selection::traits::project::assemble_candidates_from_impls at line 976. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_trait_selection/src/traits/project.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":"compiler/rustc_trait_selection/src/traits/project.rs"},"region":{"startLine":976}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bcf0f024d0bce99932842d11c7c7c1068d0691998cc91a7c5221f007955ae5b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_middle/src/ty/layout.rs: compiler/rustc_middle/src/ty/layout.rs changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in Ty::ty_and_layout_pointee_info_at at line 1057. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_middle/src/ty/layout.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":"compiler/rustc_middle/src/ty/layout.rs"},"region":{"startLine":1057}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4f57e050a9cabb6db82f883dd6c9a7f66acec4935d340486f439076d1206e16"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_mir_build/src/thir/pattern/const_to_pat.rs: compiler/rustc_mir_build/src/thir/pattern/const_to_pat.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in ConstToPat::valtree_to_pat at line 244. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_mir_build/src/thir/pattern/const_to_pat.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":"compiler/rustc_mir_build/src/thir/pattern/const_to_pat.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"22d88bac91c7ba914b999871a8022a990cc3fbd6a434939b987e3f55e733323d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tools/rust-analyzer/crates/ide-completion/src/render.rs: src/tools/rust-analyzer/crates/ide-completion/src/render.rs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in ide_completion::render::render_resolution_path at line 408. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/tools/rust-analyzer/crates/ide-completion/src/render.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/tools/rust-analyzer/crates/ide-completion/src/render.rs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"78b9bd85b88da40d51e70155d28c84930d68f7a11200321330006499bec94fb1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/librustdoc/clean/types.rs: src/librustdoc/clean/types.rs changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in Type::is_doc_subtype_of at line 1458. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/librustdoc/clean/types.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/clean/types.rs"},"region":{"startLine":1458}}}],"partialFingerprints":{"codehealthFindingId/v1":"247a380e309ea05c2ec3c7b66ed7c7a3421563a7de1829147975bb603cb2f920"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_interface/src/passes.rs: compiler/rustc_interface/src/passes.rs changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in rustc_interface::passes::configure_and_expand at line 136. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_interface/src/passes.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":"compiler/rustc_interface/src/passes.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c96e49ba9bf00696fa2d51baeec7a2748827fd29376306f5d5fd179ae76e4a1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_trait_selection/src/error_reporting/infer/nice_region_error/placeholder_error.rs: compiler/rustc_trait_selection/src/error_reporting/infer/nice_region_error/placeholder_error.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in NiceRegionError::report_trait_placeholder_mismatch at line 246. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_trait_selection/src/error_reporting/infer/nice_region_error/placeholder_error.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/error_reporting/infer/nice_region_error/placeholder_error.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"bca2d54dc4f9d3bc2aa0dc1789edadef3ef2af501fd98744ae3c5cb55ab66cae"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/librustdoc/formats/cache.rs: src/librustdoc/formats/cache.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in CacheBuilder::fold_item at line 301. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/librustdoc/formats/cache.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/librustdoc/formats/cache.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d2f36e8d11e3d13eed7b761610918fbf74207b9e6f5df15fb6c3f8cfcfbde73"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_lint/src/types/improper_ctypes.rs: compiler/rustc_lint/src/types/improper_ctypes.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in ImproperCTypesVisitor::visit_type at line 784. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_lint/src/types/improper_ctypes.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":"compiler/rustc_lint/src/types/improper_ctypes.rs"},"region":{"startLine":784}}}],"partialFingerprints":{"codehealthFindingId/v1":"32cd07532edef2250f6f155d7285e728e44449f6e7aba0a8e03a9f5b67c3da16"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_parse/src/parser/pat.rs: compiler/rustc_parse/src/parser/pat.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in Parser::parse_pat_with_range_pat at line 721. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_parse/src/parser/pat.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":"compiler/rustc_parse/src/parser/pat.rs"},"region":{"startLine":721}}}],"partialFingerprints":{"codehealthFindingId/v1":"b45d77a6ae75cacb403a4711688d9bcb684d5338d0bc66fe41ed720ccf06a14b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_hir_typeck/src/pat.rs: compiler/rustc_hir_typeck/src/pat.rs changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in FnCtxt::emit_err_pat_wrong_number_of_fields at line 1895. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_hir_typeck/src/pat.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":"compiler/rustc_hir_typeck/src/pat.rs"},"region":{"startLine":1895}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaf7ea0b73dad26e3e50fce51445ca8b8668836321cc1240a7eab47717c22903"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_lint/src/types.rs: compiler/rustc_lint/src/types.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in rustc_lint::types::lint_nan at line 225. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_lint/src/types.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_lint/src/types.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f4ef157c41672f0f53974cd27300fd55716513dc56587a88731800131a19771"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_errors/src/annotate_snippet_emitter_writer.rs: compiler/rustc_errors/src/annotate_snippet_emitter_writer.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 45 in AnnotateSnippetEmitter::emit_messages_default at line 163. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_errors/src/annotate_snippet_emitter_writer.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":"compiler/rustc_errors/src/annotate_snippet_emitter_writer.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bf027623008ee2997c3b45aca3aeaa69db3f8113f798d68876b38c58aecf850"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_trait_selection/src/traits/auto_trait.rs: compiler/rustc_trait_selection/src/traits/auto_trait.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in AutoTraitFinder::evaluate_nested_obligations at line 666. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_trait_selection/src/traits/auto_trait.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":"compiler/rustc_trait_selection/src/traits/auto_trait.rs"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"63d3586c23c72efb882e6b14401933a3ef4377694a33c9340adbebefbb263d46"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_resolve/src/build_reduced_graph.rs: compiler/rustc_resolve/src/build_reduced_graph.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in DefCollector::build_reduced_graph_for_use_tree at line 592. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_resolve/src/build_reduced_graph.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":"compiler/rustc_resolve/src/build_reduced_graph.rs"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7b52fde8d0fd85cce1d47052bade67b9ede3562aff14e7f3c3ce9f83f98f63c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_hir_typeck/src/callee.rs: compiler/rustc_hir_typeck/src/callee.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in FnCtxt::report_invalid_callee at line 927. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_hir_typeck/src/callee.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":"compiler/rustc_hir_typeck/src/callee.rs"},"region":{"startLine":927}}}],"partialFingerprints":{"codehealthFindingId/v1":"76c6582bd5b071ca4125777b34dccf1f583bec2369768575c8d7765bca2baedf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_hir_analysis/src/collect/generics_of.rs: compiler/rustc_hir_analysis/src/collect/generics_of.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in rustc_hir_analysis::collect::generics_of::generics_of at line 17. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_hir_analysis/src/collect/generics_of.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":"compiler/rustc_hir_analysis/src/collect/generics_of.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcf3a0082d4a32a79b6ac0d8726760e902b0e31ca98271bb7ff8fa1a98193c31"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/main.rs: src/main.rs changed 2 times in last 90 days, max cyclomatic complexity 198 in stdarch_gen_loongarch::gen_test_body at line 859. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/main.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main.rs"},"region":{"startLine":859}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9f4bd697ce412d5d6af59543f06e4a0481b7a56e4bd52631de4c8462fa4ed51"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_lints/src/useless_conversion.rs: clippy_lints/src/useless_conversion.rs changed 9 times in last 90 days, max cyclomatic complexity 44 in UselessConversion::check_expr at line 160. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/useless_conversion.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":"clippy_lints/src/useless_conversion.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"7473d296da437d7a04826150969df9bf8dcea69a153f93b679c951379a7fe214"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tools/rust-analyzer/crates/hir-ty/src/mir/eval/shim.rs: src/tools/rust-analyzer/crates/hir-ty/src/mir/eval/shim.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 197 in Evaluator::exec_intrinsic at line 560. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/tools/rust-analyzer/crates/hir-ty/src/mir/eval/shim.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/tools/rust-analyzer/crates/hir-ty/src/mir/eval/shim.rs"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3c648ea6834874ae22477fa0adcdcd536a0791290ed902466b1074549cd48ff"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/librustdoc/lib.rs: src/librustdoc/lib.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in rustdoc::main_args at line 826. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/librustdoc/lib.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/lib.rs"},"region":{"startLine":826}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f8f4ce612059eb1102acdfe55b2437941c007aa22056d0cef8317c8d9ab54ac"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_codegen_ssa/src/mir/rvalue.rs: compiler/rustc_codegen_ssa/src/mir/rvalue.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in FunctionCx::codegen_rvalue_operand at line 491. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_codegen_ssa/src/mir/rvalue.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":"compiler/rustc_codegen_ssa/src/mir/rvalue.rs"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d2419deab943b6802100ca08b440527db4deb495aa3c63125aeed897d4edc0a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_codegen_llvm/src/attributes.rs: compiler/rustc_codegen_llvm/src/attributes.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in rustc_codegen_llvm::attributes::llfn_attrs_from_instance at line 506. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_codegen_llvm/src/attributes.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":"compiler/rustc_codegen_llvm/src/attributes.rs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"0def2018fda370a11a92e9135d977abc568bb21bd9820761c6b5a1aed9d52e94"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tools/opt-dist/src/main.rs: src/tools/opt-dist/src/main.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in opt_dist::execute_pipeline at line 252. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/tools/opt-dist/src/main.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/opt-dist/src/main.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbcfee080c7d2253a5631657913a95006c400b95b3e144d9a7c5b9b354d2cca1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: build_system/src/test.rs: build_system/src/test.rs changed 21 times in last 90 days, max cyclomatic complexity 18 in TestArg::new at line 103. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- build_system/src/test.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":"build_system/src/test.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"10c0717d6fc756a29000937c12f6463600ebbb0b69f13bb643f9a88573c9ef2a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tools/rust-analyzer/crates/ide-completion/src/completions/expr.rs: src/tools/rust-analyzer/crates/ide-completion/src/completions/expr.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 75 in ide_completion::completions::expr::complete_expr_path at line 47. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/tools/rust-analyzer/crates/ide-completion/src/completions/expr.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/tools/rust-analyzer/crates/ide-completion/src/completions/expr.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"33138bc05aea186f91ae0138abd0106a383dcdba3dc7c52acb65b6d6e1102638"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/bootstrap/src/core/build_steps/dist.rs: src/bootstrap/src/core/build_steps/dist.rs changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in Rustc::run at line 529. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/bootstrap/src/core/build_steps/dist.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/bootstrap/src/core/build_steps/dist.rs"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad3f7d75d6b72a35e0c00b93a475a97a3413cb2d597cd87eec3cf44560684ce2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_sanitizers/src/cfi/typeid/itanium_cxx_abi/transform.rs: compiler/rustc_sanitizers/src/cfi/typeid/itanium_cxx_abi/transform.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in TransformTy::fold_ty at line 52. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_sanitizers/src/cfi/typeid/itanium_cxx_abi/transform.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":"compiler/rustc_sanitizers/src/cfi/typeid/itanium_cxx_abi/transform.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fe0aa2833b3548b2e94cfc6c6e616ea78d7f9756cab354274fd79621b2b3bcc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_trait_selection/src/traits/dyn_compatibility.rs: compiler/rustc_trait_selection/src/traits/dyn_compatibility.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in rustc_trait_selection::traits::dyn_compatibility::virtual_call_violations_for_method at line 440. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_trait_selection/src/traits/dyn_compatibility.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":"compiler/rustc_trait_selection/src/traits/dyn_compatibility.rs"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"63e5b873c9e5dceab29760de86608ad5beafe6978227877d80b41e4f3699c188"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_utils/src/check_proc_macro.rs: clippy_utils/src/check_proc_macro.rs changed 11 times in last 90 days, max cyclomatic complexity 32 in clippy_utils::check_proc_macro::ast_ty_search_pat at line 433. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- clippy_utils/src/check_proc_macro.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":"clippy_utils/src/check_proc_macro.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e7b326c0c4af0c804b31685663a3f8e7ac9c90199f65264b73292be2921de82"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_parse/src/parser/function.rs: compiler/rustc_parse/src/parser/function.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in Parser::parse_param_general at line 737. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_parse/src/parser/function.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":"compiler/rustc_parse/src/parser/function.rs"},"region":{"startLine":737}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bdead3ed88aab0db3eda077608da3123d90ba18e73e4a02682b04c81298f059"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_hir_pretty/src/lib.rs: compiler/rustc_hir_pretty/src/lib.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in State::print_item at line 602. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_hir_pretty/src/lib.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_pretty/src/lib.rs"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bac27bd151eed5ad07c543c128f0b3cf28bf3661c78e4a7d3f73bc98066870b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/abi.rs: src/abi.rs changed 12 times in last 90 days, max cyclomatic complexity 29 in FnAbi::apply_attrs_llfn at line 480. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/abi.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/abi.rs"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"2232d74197a543b1f81c0efa343d62fc2feaf1fab70e3751be885ac795ae01ae"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_builtin_macros/src/deriving/coerce_pointee.rs: compiler/rustc_builtin_macros/src/deriving/coerce_pointee.rs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in rustc_builtin_macros::deriving::coerce_pointee::expand_derive_coerce_pointee at line 19. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_builtin_macros/src/deriving/coerce_pointee.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":"compiler/rustc_builtin_macros/src/deriving/coerce_pointee.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"723526eeee12b461e5c34853e2241fdc4a600410c18ae3127aa36cbe4d4b8714"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_const_eval/src/interpret/call.rs: compiler/rustc_const_eval/src/interpret/call.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in InterpCx::init_stack_frame at line 472. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_const_eval/src/interpret/call.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":"compiler/rustc_const_eval/src/interpret/call.rs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"95795b05b2aeb2193e091d55c6dafa8512635d1b40c6ea279449a4ee13d5325c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/librustdoc/visit_ast.rs: src/librustdoc/visit_ast.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in RustdocVisitor::maybe_inline_local at line 252. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/librustdoc/visit_ast.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/librustdoc/visit_ast.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dfa0e1cde42f865c63b628b0b5eaaf8bd10e30c5d0fd6caae0e8ce0cde4be55"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/librustdoc/html/render/search_index.rs: src/librustdoc/html/render/search_index.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in SerializedSearchIndex::union at line 314. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/librustdoc/html/render/search_index.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/librustdoc/html/render/search_index.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e8b9e007fbcf1bf449e237eb44cec029c32ce3d47b3aba09fea05ef081a9e80"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_expand/src/mbe/macro_rules.rs: compiler/rustc_expand/src/mbe/macro_rules.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in rustc_expand::mbe::macro_rules::is_in_follow at line 1729. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_expand/src/mbe/macro_rules.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":"compiler/rustc_expand/src/mbe/macro_rules.rs"},"region":{"startLine":1729}}}],"partialFingerprints":{"codehealthFindingId/v1":"33d6b5b39e02e763454ec103607d3f5bee782ce60f69f0c83358ccc34138f682"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_target/src/callconv/mod.rs: compiler/rustc_target/src/callconv/mod.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in FnAbi::adjust_for_rust_abi at line 756. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_target/src/callconv/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_target/src/callconv/mod.rs"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"b72a9d613b597dd8e53679331d3e51823b6501dfa20f8f73df9bfd6782bd4141"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_codegen_ssa/src/back/symbol_export.rs: compiler/rustc_codegen_ssa/src/back/symbol_export.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in rustc_codegen_ssa::back::symbol_export::exported_generic_symbols_provider_local at line 309. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_codegen_ssa/src/back/symbol_export.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":"compiler/rustc_codegen_ssa/src/back/symbol_export.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"deca6d71847dc4500e741efbc81cdbc22564159a0717abb1a55f2be3182707f0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_trait_selection/src/traits/mod.rs: compiler/rustc_trait_selection/src/traits/mod.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in rustc_trait_selection::traits::try_evaluate_const at line 638. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_trait_selection/src/traits/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/traits/mod.rs"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3df9644b9473f2b8e6fcc0eb329418ab3d9541ec269594cfdb3381fbfcf32be"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_hir_typeck/src/coercion.rs: compiler/rustc_hir_typeck/src/coercion.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in CoerceMany::coerce_inner at line 1703. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_hir_typeck/src/coercion.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":"compiler/rustc_hir_typeck/src/coercion.rs"},"region":{"startLine":1703}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e664f01e4d72d3d401c5ff73f884c6fda8e9874d0316e7571de5968c59da2e8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tools/miri/src/shims/unix/solarish/foreign_items.rs: src/tools/miri/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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/tools/miri/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/tools/miri/src/shims/unix/solarish/foreign_items.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc9d803e63c68618e20cea1dfb79915a4155f0309fe4f8793b5f28e81215e3b0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_type_ir/src/fast_reject.rs: compiler/rustc_type_ir/src/fast_reject.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 59 in DeepRejectCtxt::types_may_unify_inner at line 265. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_type_ir/src/fast_reject.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":"compiler/rustc_type_ir/src/fast_reject.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"782ddcf6f745cd6486b73e159deee9ad0c8463a541165971fb43bf139738ce71"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_trait_selection/src/traits/select/candidate_assembly.rs: compiler/rustc_trait_selection/src/traits/select/candidate_assembly.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in SelectionContext::assemble_candidates_from_auto_impls at line 749. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_trait_selection/src/traits/select/candidate_assembly.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":"compiler/rustc_trait_selection/src/traits/select/candidate_assembly.rs"},"region":{"startLine":749}}}],"partialFingerprints":{"codehealthFindingId/v1":"02f210d3a9c66ec670b48108fd34fb41e9a78f8d230d4250824c50389f25bfa0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_passes/src/dead.rs: compiler/rustc_passes/src/dead.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in MarkSymbolVisitor::visit_node at line 542. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_passes/src/dead.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":"compiler/rustc_passes/src/dead.rs"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"03d3c8f795cd8df6638677418b294e32c38c9f615a84d720ec34a0f678402e71"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tools/rustfmt/src/types.rs: src/tools/rustfmt/src/types.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in Ty::rewrite_result at line 808. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/tools/rustfmt/src/types.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/types.rs"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"762d8ea21cd964210c74069b4c5298fb94fbeadbbdc42dc29e90729e3fa6e185"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tools/miri/priroda/src/debugger.rs: src/tools/miri/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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/tools/miri/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":"src/tools/miri/priroda/src/debugger.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"5998e76b0129eb63559afd6ab9496b010c2abaca49b03cb8095a9bb514adcda7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tools/miri/src/intrinsics/math.rs: src/tools/miri/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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/tools/miri/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/tools/miri/src/intrinsics/math.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe27654dea3681d874e2669cf62faf65747e2c8da8a1fec543936c91f17cfe6a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_builtin_macros/src/asm.rs: compiler/rustc_builtin_macros/src/asm.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in rustc_builtin_macros::asm::expand_preparsed_asm at line 265. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_builtin_macros/src/asm.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":"compiler/rustc_builtin_macros/src/asm.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"908d86268961798d767e73363a076f7da814c270e052c39593f216c3b8799ef1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/attributes.rs: src/attributes.rs changed 8 times in last 90 days, max cyclomatic complexity 35 in rustc_codegen_llvm::attributes::llfn_attrs_from_instance at line 506. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/attributes.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/attributes.rs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd6d5b1454fede401cb980163dc92851471e105eedc58828de392e19d4900af5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_codegen_llvm/src/builder/autodiff.rs: compiler/rustc_codegen_llvm/src/builder/autodiff.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in rustc_codegen_llvm::builder::autodiff::match_args_from_caller_to_enzyme at line 136. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_codegen_llvm/src/builder/autodiff.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":"compiler/rustc_codegen_llvm/src/builder/autodiff.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7579f288bdaf149d363b938fd2c54d311b11f310f2567ec2baf7ef2c0be7fc4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_const_eval/src/check_consts/check.rs: compiler/rustc_const_eval/src/check_consts/check.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in Checker::visit_terminator at line 723. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_const_eval/src/check_consts/check.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":"compiler/rustc_const_eval/src/check_consts/check.rs"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"59e8428a117f1bae864dbec4ca79de1d1634d22c27ab2a223cfb3b57b40c474c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_next_trait_solver/src/solve/normalizes_to.rs: compiler/rustc_next_trait_solver/src/solve/normalizes_to.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in NormalizesTo::consider_impl_candidate at line 255. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_next_trait_solver/src/solve/normalizes_to.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":"compiler/rustc_next_trait_solver/src/solve/normalizes_to.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"cae2f1302c2f019fdeeea8b17c74bb1799601b7e6cf681513758396a0dd7d429"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_mir_transform/src/liveness.rs: compiler/rustc_mir_transform/src/liveness.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in AssignmentResult::report_fully_unused at line 961. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_mir_transform/src/liveness.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":"compiler/rustc_mir_transform/src/liveness.rs"},"region":{"startLine":961}}}],"partialFingerprints":{"codehealthFindingId/v1":"430162f19305af457543b640fa690353c5bd413c6c1087fe73c94570ed34b4dd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_borrowck/src/diagnostics/explain_borrow.rs: compiler/rustc_borrowck/src/diagnostics/explain_borrow.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 54 in BorrowExplanation::add_explanation_to_diagnostic at line 58. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_borrowck/src/diagnostics/explain_borrow.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":"compiler/rustc_borrowck/src/diagnostics/explain_borrow.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fc597d5ff9a0705525999b731629a2fe9c0753a88a2e16cb07a7969cc8af3cf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_hir_typeck/src/inline_asm.rs: compiler/rustc_hir_typeck/src/inline_asm.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in InlineAsmCtxt::check_asm_operand_type at line 189. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_hir_typeck/src/inline_asm.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":"compiler/rustc_hir_typeck/src/inline_asm.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4d8c73508e4dac8b0d1679c9f62a738c134d973c4255971ac4c9496a773f2ab"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tools/rust-analyzer/crates/parser/src/lexed_str.rs: src/tools/rust-analyzer/crates/parser/src/lexed_str.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 53 in Converter::extend_token at line 206. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/tools/rust-analyzer/crates/parser/src/lexed_str.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/tools/rust-analyzer/crates/parser/src/lexed_str.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"540cae635c2cb6c9905538dc82a4934f8e9f202023e23060d7f2894bcc5be01b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_lints/src/lifetimes.rs: clippy_lints/src/lifetimes.rs changed 11 times in last 90 days, max cyclomatic complexity 24 in clippy_lints::lifetimes::could_use_elision at line 293. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/lifetimes.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":"clippy_lints/src/lifetimes.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"051315f55128a8a2ae628929667fb7758750e82883cb3a94245fb4130ce1023b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_codegen_llvm/src/consts.rs: compiler/rustc_codegen_llvm/src/consts.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in CodegenCx::codegen_static_item at line 473. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_codegen_llvm/src/consts.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":"compiler/rustc_codegen_llvm/src/consts.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb835f3f8f54d927e8cd5c853c70b3dd1f779f985e6ae3b32853e624a3e492c3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_ast_passes/src/ast_validation.rs: compiler/rustc_ast_passes/src/ast_validation.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in AstValidator::visit_fn at line 1937. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_ast_passes/src/ast_validation.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":"compiler/rustc_ast_passes/src/ast_validation.rs"},"region":{"startLine":1937}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e601a840aa9f87361bf0ae174539b4379b1ade81339bf94763bf93c6034d7c4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_codegen_ssa/src/mir/mod.rs: compiler/rustc_codegen_ssa/src/mir/mod.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in rustc_codegen_ssa::mir::arg_local_refs at line 450. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_codegen_ssa/src/mir/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/mir/mod.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f1342b517a58d956672dee35078cd4505d0d77b2d1863a1c25a0c98c4da82d4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/librustdoc/clean/cfg.rs: src/librustdoc/clean/cfg.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in Display::fmt at line 531. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/librustdoc/clean/cfg.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/librustdoc/clean/cfg.rs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"31e0d6f80928d18e052bec64b112212f6a78dd6a067a87ee6efb851ec202884f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_lints/src/arbitrary_source_item_ordering.rs: clippy_lints/src/arbitrary_source_item_ordering.rs changed 11 times in last 90 days, max cyclomatic complexity 23 in ArbitrarySourceItemOrdering::check_item at line 396. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/arbitrary_source_item_ordering.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":"clippy_lints/src/arbitrary_source_item_ordering.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5271b675f1e01e467f87bb2ef8344d3e9d48b4d072f88063c4db0b9685ddc90"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_const_eval/src/interpret/validity.rs: compiler/rustc_const_eval/src/interpret/validity.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in ValidityVisitor::check_safe_pointer at line 561. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_const_eval/src/interpret/validity.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":"compiler/rustc_const_eval/src/interpret/validity.rs"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"408cc5d1efcfd6b9c3ece0dc72bf33e29bd8b0da49915e5babc1bb38b9e42f89"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_lints/src/eta_reduction.rs: clippy_lints/src/eta_reduction.rs changed 7 times in last 90 days, max cyclomatic complexity 35 in clippy_lints::eta_reduction::check_closure at line 90. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/eta_reduction.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":"clippy_lints/src/eta_reduction.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfd937676e851a8a5de6a84c4e92f7d8088d469efefbe221d39cb92c9479394b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_codegen_llvm/src/type_of.rs: compiler/rustc_codegen_llvm/src/type_of.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in rustc_codegen_llvm::type_of::uncached_llvm_type 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_codegen_llvm/src/type_of.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":"compiler/rustc_codegen_llvm/src/type_of.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"d48fcf2d3b26d2286ad42990088d3e52ec52b9ded05165ed27e6820d849a7e14"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_mir_transform/src/dataflow_const_prop.rs: compiler/rustc_mir_transform/src/dataflow_const_prop.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in rustc_mir_transform::dataflow_const_prop::try_write_constant at line 777. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_mir_transform/src/dataflow_const_prop.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":"compiler/rustc_mir_transform/src/dataflow_const_prop.rs"},"region":{"startLine":777}}}],"partialFingerprints":{"codehealthFindingId/v1":"970bd2ac425b130cec88f3ff111eb99bf9a4c560fafe0797cfab2b9d464d05aa"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tools/miri/src/shims/unix/fd.rs: src/tools/miri/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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/tools/miri/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/tools/miri/src/shims/unix/fd.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"995840ce198d2215c56dbb46e17b93d4a93d26e304bac81b4840f3b5ae802ffb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_hir_analysis/src/diagnostics/wrong_number_of_generic_args.rs: compiler/rustc_hir_analysis/src/diagnostics/wrong_number_of_generic_args.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in WrongNumberOfGenericArgs::suggest_removing_args_or_generics at line 948. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_hir_analysis/src/diagnostics/wrong_number_of_generic_args.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":"compiler/rustc_hir_analysis/src/diagnostics/wrong_number_of_generic_args.rs"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"c422d5b00d09019191ec9601c0739fcaa1e7c890cae71714c6847daeefee2943"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_middle/src/lint.rs: compiler/rustc_middle/src/lint.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in rustc_middle::lint::emit_lint_base at line 383. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_middle/src/lint.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":"compiler/rustc_middle/src/lint.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b0ddd394ee81d8af12b22f90f9c46b4639db95cd2b6af6721057ccd1bc166e9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_borrowck/src/lib.rs: compiler/rustc_borrowck/src/lib.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in MirBorrowckCtxt::check_movable_place at line 1899. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_borrowck/src/lib.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/lib.rs"},"region":{"startLine":1899}}}],"partialFingerprints":{"codehealthFindingId/v1":"23d63e5832e63fd89b55a3f54b52d5dd66ad8b2d7d75d537428d7646728a0b50"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_lints/src/utils/author.rs: clippy_lints/src/utils/author.rs changed 5 times in last 90 days, max cyclomatic complexity 46 in PrintVisitor::expr at line 435. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/utils/author.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":"clippy_lints/src/utils/author.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"25104848cc3adb10a8ce2650478cf305b7c156cd55affe960e402e79c9a9a2e7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tools/rust-analyzer/crates/hir-ty/src/mir/lower/pattern_matching.rs: src/tools/rust-analyzer/crates/hir-ty/src/mir/lower/pattern_matching.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in MirLowerCtx::pattern_match_inner at line 117. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/tools/rust-analyzer/crates/hir-ty/src/mir/lower/pattern_matching.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/tools/rust-analyzer/crates/hir-ty/src/mir/lower/pattern_matching.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e1e9d86bb30c5023817070ab7091e7deac0a24fe54eb03c7aff1c27e68a9ee5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_mir_transform/src/shim.rs: compiler/rustc_mir_transform/src/shim.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in rustc_mir_transform::shim::make_shim at line 32. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_mir_transform/src/shim.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":"compiler/rustc_mir_transform/src/shim.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c70f5986fb27cfd80a27177e12c019f53d80cf7678d0d22a353a158818a30c4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_incremental/src/persist/fs.rs: compiler/rustc_incremental/src/persist/fs.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in rustc_incremental::persist::fs::garbage_collect_session_directories at line 555. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_incremental/src/persist/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":"compiler/rustc_incremental/src/persist/fs.rs"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ad1149bfaf880707bd80c8e46e01b114c6169a62cb03192ebacc3fbf019356b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_trait_selection/src/error_reporting/traits/mod.rs: compiler/rustc_trait_selection/src/error_reporting/traits/mod.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in TypeErrCtxt::report_fulfillment_errors at line 141. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_trait_selection/src/error_reporting/traits/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/error_reporting/traits/mod.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"48031d5fb80da7fee1e151ceb9ab7057c6b442531318caede6c2da8acebe7918"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_borrowck/src/region_infer/region_context.rs: compiler/rustc_borrowck/src/region_infer/region_context.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in RegionInferenceContextInner::best_blame_constraint at line 594. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_borrowck/src/region_infer/region_context.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":"compiler/rustc_borrowck/src/region_infer/region_context.rs"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"01d6edb74332e6838d66d46ca7abfcd104c8509636ad8f65b4238075cb7eab9e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_mir_transform/src/inline.rs: compiler/rustc_mir_transform/src/inline.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in rustc_mir_transform::inline::check_mir_is_available at line 700. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_mir_transform/src/inline.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":"compiler/rustc_mir_transform/src/inline.rs"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2e53dc19161143a458f4790249542f8963a95d9b1bb2652544e1ad3ef0f8554"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_lint/src/context.rs: compiler/rustc_lint/src/context.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in LintStore::check_lint_name at line 344. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_lint/src/context.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":"compiler/rustc_lint/src/context.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd7ad1b354f01affc528c78d564e9a481d4565f20763c250dfc1dde4f48d59f2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_lints/src/methods/unnecessary_to_owned.rs: clippy_lints/src/methods/unnecessary_to_owned.rs changed 11 times in last 90 days, max cyclomatic complexity 20 in clippy_lints::methods::unnecessary_to_owned::check at line 29. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/methods/unnecessary_to_owned.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/methods/unnecessary_to_owned.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5f2303b52567ade6b24fd1a3427825641d46b6727be201e135584366330d333"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_mir_transform/src/lower_intrinsics.rs: compiler/rustc_mir_transform/src/lower_intrinsics.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 55 in LowerIntrinsics::run_pass 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_mir_transform/src/lower_intrinsics.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":"compiler/rustc_mir_transform/src/lower_intrinsics.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e261fcb5c37d142ee11109f5823d12170afe9edffdd9d2a77389585fce505f7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_hir_typeck/src/demand.rs: compiler/rustc_hir_typeck/src/demand.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in FnCtxt::annotate_expected_due_to_let_ty at line 707. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_hir_typeck/src/demand.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":"compiler/rustc_hir_typeck/src/demand.rs"},"region":{"startLine":707}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff5eb4a5e67d8bbcb085ba4e65562ff518cae7da2d0a002c9585c86c25f15f07"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_ty_utils/src/consts.rs: compiler/rustc_ty_utils/src/consts.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in rustc_ty_utils::consts::recurse_build 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_ty_utils/src/consts.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":"compiler/rustc_ty_utils/src/consts.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"9579d7040bc53f8bacc72fdd62b805896ec1155943254ecafc94fe8561151d3f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_lints/src/attrs/mod.rs: clippy_lints/src/attrs/mod.rs changed 12 times in last 90 days, max cyclomatic complexity 18 in PostExpansionEarlyAttributes::check_attribute at line 663. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/attrs/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/attrs/mod.rs"},"region":{"startLine":663}}}],"partialFingerprints":{"codehealthFindingId/v1":"8921d8e736f75c102b38b147039041512e147fcbeb2546086d11e6bf2510dde4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/int.rs: src/int.rs changed 9 times in last 90 days, max cyclomatic complexity 24 in Builder::gcc_icmp at line 474. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/int.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/int.rs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"6daf401f3079cb149346ee8d3eef0448f20fe91afa88fde17ea4b05ed86f9532"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_lints/src/returns/needless_return.rs: clippy_lints/src/returns/needless_return.rs changed 11 times in last 90 days, max cyclomatic complexity 19 in clippy_lints::returns::needless_return::check_final_expr at line 119. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/returns/needless_return.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":"clippy_lints/src/returns/needless_return.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2c87126702c1479fcf0f209f89e429a1ce78e9d887ff89b94859ae5d2dad62d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tools/miri/src/machine.rs: src/tools/miri/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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/tools/miri/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/tools/miri/src/machine.rs"},"region":{"startLine":1463}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a047774d76b19b6ac4bf4308ef95c1d0a24b23096d04b7714832c82c6815998"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_codegen_gcc/src/builder.rs: compiler/rustc_codegen_gcc/src/builder.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in Builder::fptoint_sat at line 1924. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_codegen_gcc/src/builder.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_gcc/src/builder.rs"},"region":{"startLine":1924}}}],"partialFingerprints":{"codehealthFindingId/v1":"461d35ff95997e1f4c37f16fa9bd77be4a144928c9939a6a4042e0e0c487ce19"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_utils/src/eager_or_lazy.rs: clippy_utils/src/eager_or_lazy.rs changed 9 times in last 90 days, max cyclomatic complexity 23 in ExprEagernessVisitor::visit_expr at line 261. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- clippy_utils/src/eager_or_lazy.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":"clippy_utils/src/eager_or_lazy.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"28bde1183ea603ed5387b2cb09a3681fd4be2c44df8b3388587ccde6c0e12f80"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_ty_utils/src/layout/invariant.rs: compiler/rustc_ty_utils/src/layout/invariant.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in rustc_ty_utils::layout::invariant::layout_sanity_check at line 10. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_ty_utils/src/layout/invariant.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":"compiler/rustc_ty_utils/src/layout/invariant.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"f86f930ce4aa36105495ede888c51668f86069427d24d4494096eb922d1daaa6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_trait_selection/src/solve/fulfill/derive_errors.rs: compiler/rustc_trait_selection/src/solve/fulfill/derive_errors.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in BestObligation::visit_goal at line 424. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_trait_selection/src/solve/fulfill/derive_errors.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":"compiler/rustc_trait_selection/src/solve/fulfill/derive_errors.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c20a326906818ac8286113c7ff0c96641a026748f8ef3e24f2aade19b28f210"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/librustdoc/html/highlight.rs: src/librustdoc/html/highlight.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 51 in Classifier::advance at line 1060. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/librustdoc/html/highlight.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/librustdoc/html/highlight.rs"},"region":{"startLine":1060}}}],"partialFingerprints":{"codehealthFindingId/v1":"1699244ec6e3670c86234f107643eb0fbe000d367c393a1ad4170229b01b0777"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tools/rustfmt/src/comment.rs: src/tools/rustfmt/src/comment.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in CommentRewrite::handle_line at line 713. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/tools/rustfmt/src/comment.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/tools/rustfmt/src/comment.rs"},"region":{"startLine":713}}}],"partialFingerprints":{"codehealthFindingId/v1":"f637820ece3fa8a8881ebbc07e6875785373ac83982197d903d5333158ca70fb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_lints/src/matches/mod.rs: clippy_lints/src/matches/mod.rs changed 6 times in last 90 days, max cyclomatic complexity 33 in Matches::check_expr at line 1055. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/matches/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/matches/mod.rs"},"region":{"startLine":1055}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bb73dccb5396abce19a552641325974ec234613d8d8adf1fadc078a8f6b210f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_mir_build/src/builder/expr/as_rvalue.rs: compiler/rustc_mir_build/src/builder/expr/as_rvalue.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in Builder::as_rvalue 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_mir_build/src/builder/expr/as_rvalue.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":"compiler/rustc_mir_build/src/builder/expr/as_rvalue.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa75ebfa1a729974ff406bb80601d1d498550f5b074fc95722f184578176df27"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_expand/src/mbe/diagnostics.rs: compiler/rustc_expand/src/mbe/diagnostics.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in rustc_expand::mbe::diagnostics::emit_frag_parse_err at line 368. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_expand/src/mbe/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":"compiler/rustc_expand/src/mbe/diagnostics.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"35606acd9fa5130c3b4708f77988298ed1735439260caaa320d31e48a9239966"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_lints/src/non_copy_const.rs: clippy_lints/src/non_copy_const.rs changed 8 times in last 90 days, max cyclomatic complexity 24 in NonCopyConst::is_non_freeze_init_borrowed at line 568. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/non_copy_const.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":"clippy_lints/src/non_copy_const.rs"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"59ee85712499023c377d0f3473dea45c6adde0434dc141a8804859b849600af7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_ast_lowering/src/asm.rs: compiler/rustc_ast_lowering/src/asm.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 63 in LoweringContext::lower_inline_asm at line 25. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_ast_lowering/src/asm.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":"compiler/rustc_ast_lowering/src/asm.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"208939f8f99cd41f9e6cb900ca561e97591be9426eecd55a17e0e7acb09b0789"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_attr_parsing/src/target_checking.rs: compiler/rustc_attr_parsing/src/target_checking.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in AttributeParser::check_target at line 96. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_attr_parsing/src/target_checking.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":"compiler/rustc_attr_parsing/src/target_checking.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"960caeeb7f1202e76b315cb216bd586a15bd5a366ab74d285a1f95b1314113a2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tools/miri/src/intrinsics/x86/sse2.rs: src/tools/miri/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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/tools/miri/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/tools/miri/src/intrinsics/x86/sse2.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"82c00eda918c56ea156485d06e18d8c6a2db4264e98c16c2fc8db30a55ca7cbf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_pattern_analysis/src/rustc.rs: compiler/rustc_pattern_analysis/src/rustc.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in RustcPatCtxt::ctors_for_ty at line 306. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_pattern_analysis/src/rustc.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":"compiler/rustc_pattern_analysis/src/rustc.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"c00e211c8c91bd256aa7bec25578aa64e705a4cccc068a4138bcdb341b45407d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/librustdoc/passes/stripper.rs: src/librustdoc/passes/stripper.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in Stripper::fold_item at line 41. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/librustdoc/passes/stripper.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/librustdoc/passes/stripper.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"64fbe6f142698da9c96b6f3539f8eacfcf64d329b55507a117ab192b68bda574"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: library/std/src/sys/process/unix/unix.rs: library/std/src/sys/process/unix/unix.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in Command::posix_spawn at line 456. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- library/std/src/sys/process/unix/unix.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":"library/std/src/sys/process/unix/unix.rs"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"0148663e7950c047300ed4c5ba3b5777980194d7b2b034751093898e96e2aa91"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tools/miri/src/shims/unix/freebsd/foreign_items.rs: src/tools/miri/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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/tools/miri/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/tools/miri/src/shims/unix/freebsd/foreign_items.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"931ccfde7cf8b5e44954c063367e41795556813a37d81442ebd50ffff26c977c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tools/miri/src/shims/math.rs: src/tools/miri/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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/tools/miri/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/tools/miri/src/shims/math.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f77330b370d22747d1ccbe96bd8c1738870fbb60e6ec8be7e6799186cec6fa8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_target/src/callconv/mips64.rs: compiler/rustc_target/src/callconv/mips64.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in rustc_target::callconv::mips64::classify_arg at line 108. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_target/src/callconv/mips64.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":"compiler/rustc_target/src/callconv/mips64.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"31f76f5cca08bb259424292b1f98da357acdb1db695e1fbedc8fb2e7bc026d2c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tools/rust-analyzer/crates/hir-ty/src/lower.rs: src/tools/rust-analyzer/crates/hir-ty/src/lower.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in TyLoweringContext::lower_ty_ext at line 593. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/tools/rust-analyzer/crates/hir-ty/src/lower.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/tools/rust-analyzer/crates/hir-ty/src/lower.rs"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9b40f85578a9a3515d0b0b3954c8f6d0bcfb8d1d31a59212bcfc13c270df547"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_middle/src/mir/visit.rs: compiler/rustc_middle/src/mir/visit.rs changed 7 times in last 90 days, max cyclomatic complexity 25 in Visitor::super_rvalue at line 683. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_middle/src/mir/visit.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":"compiler/rustc_middle/src/mir/visit.rs"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"f895a13267dbeee862b3559785a9d7d1c0c4151896427691fffb5bd772828b78"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tools/miri/src/intrinsics/x86/avx2.rs: src/tools/miri/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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/tools/miri/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/tools/miri/src/intrinsics/x86/avx2.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"82bfe325ac32483094bccb486033996eea7fd67c001812f02fc2a0eccab8fde8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_ast_lowering/src/path.rs: compiler/rustc_ast_lowering/src/path.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in LoweringContext::lower_qpath at line 27. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_ast_lowering/src/path.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":"compiler/rustc_ast_lowering/src/path.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"7468684238e56248640923044a2ac8b5d05626a88ba86145604fcb5abc92bb2d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_utils/src/sugg.rs: clippy_utils/src/sugg.rs changed 7 times in last 90 days, max cyclomatic complexity 24 in DerefDelegate::borrow at line 937. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- clippy_utils/src/sugg.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":"clippy_utils/src/sugg.rs"},"region":{"startLine":937}}}],"partialFingerprints":{"codehealthFindingId/v1":"367c4561a3466b49f2d4e9849305dd1bc8cd3b09b40d02c7c3e8e8bc835f8f51"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_lints/src/loops/never_loop.rs: clippy_lints/src/loops/never_loop.rs changed 5 times in last 90 days, max cyclomatic complexity 33 in clippy_lints::loops::never_loop::never_loop_expr at line 293. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/loops/never_loop.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":"clippy_lints/src/loops/never_loop.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"937c55c0464b0f87b44ff38a8b7c5af3015ec3254d9dbdb97731984fc0ef9fbc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_mir_transform/src/pass_manager.rs: compiler/rustc_mir_transform/src/pass_manager.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in rustc_mir_transform::pass_manager::run_passes_inner at line 284. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_mir_transform/src/pass_manager.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":"compiler/rustc_mir_transform/src/pass_manager.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"c58992b7e87ffb608f653f21e7866881212bf724836e5ca30926b7b08c61c000"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_codegen_llvm/src/base.rs: compiler/rustc_codegen_llvm/src/base.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in rustc_codegen_llvm::base::compile_codegen_unit at line 63. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_codegen_llvm/src/base.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":"compiler/rustc_codegen_llvm/src/base.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"442c195ec6119a76df81c8a1f38cca6e3ade2a858ac26507daab5fef0bdb06d0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_target/src/callconv/sparc64.rs: compiler/rustc_target/src/callconv/sparc64.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in rustc_target::callconv::sparc64::classify at line 27. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_target/src/callconv/sparc64.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":"compiler/rustc_target/src/callconv/sparc64.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b77c4b765ea7b863ee4e5401edaf29c15c6012795a6126ed5ffdcf27bbbe89e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_lints/src/needless_borrows_for_generic_args.rs: clippy_lints/src/needless_borrows_for_generic_args.rs changed 8 times in last 90 days, max cyclomatic complexity 20 in clippy_lints::needless_borrows_for_generic_args::needless_borrow_count at line 167. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/needless_borrows_for_generic_args.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":"clippy_lints/src/needless_borrows_for_generic_args.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"cda010235f937d306d8d794c46d7e852148c4f7f86414ce79c8adf7268f1f540"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_ast_pretty/src/pprust/state/item.rs: compiler/rustc_ast_pretty/src/pprust/state/item.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in State::print_item at line 163. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_ast_pretty/src/pprust/state/item.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":"compiler/rustc_ast_pretty/src/pprust/state/item.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"59f531c27008dc2ef6674f1912d84e45e0b1e6f1e0dad524874ad83c3dc49054"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_hir_analysis/src/collect/clauses_of.rs: compiler/rustc_hir_analysis/src/collect/clauses_of.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in rustc_hir_analysis::collect::clauses_of::gather_explicit_clauses_of at line 83. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_hir_analysis/src/collect/clauses_of.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":"compiler/rustc_hir_analysis/src/collect/clauses_of.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c01cd09a0d0e2b43adc524865f4c4a74ec02081d65167779e532152b7488193"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_lints/src/methods/manual_inspect.rs: clippy_lints/src/methods/manual_inspect.rs changed 4 times in last 90 days, max cyclomatic complexity 40 in clippy_lints::methods::manual_inspect::check at line 19. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/methods/manual_inspect.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/methods/manual_inspect.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf0de143c875d0a36db65972c353a1d59aff39192d5a0914f699395232797ed4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_lints/src/tuple_array_conversions.rs: clippy_lints/src/tuple_array_conversions.rs changed 6 times in last 90 days, max cyclomatic complexity 26 in TupleArrayConversions::check_expr at line 64. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/tuple_array_conversions.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":"clippy_lints/src/tuple_array_conversions.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fd6218e20bac7904b6ac0a820378ba56d42595a8d6ed3ea97f1cb81b4ded813"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_lints/src/loops/explicit_iter_loop.rs: clippy_lints/src/loops/explicit_iter_loop.rs changed 5 times in last 90 days, max cyclomatic complexity 31 in clippy_lints::loops::explicit_iter_loop::is_ref_iterable at line 107. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/loops/explicit_iter_loop.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":"clippy_lints/src/loops/explicit_iter_loop.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0af0cac432ef4e466480b5cd8f24c81f0adf4496107ccee36035df1890ee2b5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_codegen_llvm/src/debuginfo/mod.rs: compiler/rustc_codegen_llvm/src/debuginfo/mod.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in Builder::dbg_scope_fn at line 129. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_codegen_llvm/src/debuginfo/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/debuginfo/mod.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"e61e8833002c534d41e6edf0f638f00efcbf794cbd47266bc78512a2ca81f195"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/librustdoc/passes/collect_trait_impls.rs: src/librustdoc/passes/collect_trait_impls.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in rustdoc::passes::collect_trait_impls::collect_trait_impls at line 19. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/librustdoc/passes/collect_trait_impls.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/librustdoc/passes/collect_trait_impls.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7fb9069e8b97ac7dda4f8df2ce156e72121d502030737179d6c7695cfd94d05"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_passes/src/reachable.rs: compiler/rustc_passes/src/reachable.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in ReachableContext::propagate_node at line 176. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_passes/src/reachable.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":"compiler/rustc_passes/src/reachable.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"87beeeb3abb3f809fea50e447f5ebfb133f8c294a8f57f12db7a1f3e00e79117"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_hir_analysis/src/hir_ty_lowering/generics.rs: compiler/rustc_hir_analysis/src/hir_ty_lowering/generics.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in rustc_hir_analysis::hir_ty_lowering::generics::generic_arg_mismatch_err at line 29. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_hir_analysis/src/hir_ty_lowering/generics.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":"compiler/rustc_hir_analysis/src/hir_ty_lowering/generics.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"309fdfa1d2cd1c1f446c05ebb918957cb6b75aa1a374f626d58830379c4d5a74"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_codegen_ssa/src/mir/naked_asm.rs: compiler/rustc_codegen_ssa/src/mir/naked_asm.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in rustc_codegen_ssa::mir::naked_asm::wasm_type at line 456. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_codegen_ssa/src/mir/naked_asm.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":"compiler/rustc_codegen_ssa/src/mir/naked_asm.rs"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7a8d3ea9fb4d23865fc422c75719517a2f6e727c1add8051c0fceb605357542"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_target/src/callconv/x86.rs: compiler/rustc_target/src/callconv/x86.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in rustc_target::callconv::x86::fill_inregs at line 196. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_target/src/callconv/x86.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":"compiler/rustc_target/src/callconv/x86.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"572d8689ef45c01139205561325046dcc544e3ad5f68947e750a9bd91fdb0b3b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tools/clippy/clippy_lints/src/non_copy_const.rs: src/tools/clippy/clippy_lints/src/non_copy_const.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in NonCopyConst::is_non_freeze_init_borrowed at line 568. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/tools/clippy/clippy_lints/src/non_copy_const.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/tools/clippy/clippy_lints/src/non_copy_const.rs"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf97c72acaa1195aaf88cea98f4c90bfdfc5bc423876906fc6c70bc1299005d9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tools/rust-analyzer/crates/ide-completion/src/render/function.rs: src/tools/rust-analyzer/crates/ide-completion/src/render/function.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in ide_completion::render::function::render at line 50. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/tools/rust-analyzer/crates/ide-completion/src/render/function.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/tools/rust-analyzer/crates/ide-completion/src/render/function.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"57c0df236dfa8011c2725bff4a1a95a52afd5aacc26d001b33049f0871a471f5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_builtin_macros/src/eii.rs: compiler/rustc_builtin_macros/src/eii.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in rustc_builtin_macros::eii::eii_ at line 56. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_builtin_macros/src/eii.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":"compiler/rustc_builtin_macros/src/eii.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"514a76211c518616eddbe97ff00da4f24a409f8046d7bdf0b2bcec38960992d9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tools/rust-analyzer/crates/ide-assists/src/handlers/extract_variable.rs: src/tools/rust-analyzer/crates/ide-assists/src/handlers/extract_variable.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in ide_assists::handlers::extract_variable::extract_variable at line 74. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/tools/rust-analyzer/crates/ide-assists/src/handlers/extract_variable.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/tools/rust-analyzer/crates/ide-assists/src/handlers/extract_variable.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"55f4afd76db2c91a4a86506433e9d341c61926b82663dfacf2dec72fcd4f95b2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_lints/src/loops/needless_range_loop.rs: clippy_lints/src/loops/needless_range_loop.rs changed 5 times in last 90 days, max cyclomatic complexity 28 in clippy_lints::loops::needless_range_loop::check at line 25. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/loops/needless_range_loop.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":"clippy_lints/src/loops/needless_range_loop.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"a75f0178567d389f844efd936c28c213c6e6f8db81988d22aa96afbefed7f764"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_dev/src/edit_lints.rs: clippy_dev/src/edit_lints.rs changed 7 times in last 90 days, max cyclomatic complexity 20 in clippy_dev::edit_lints::rename_update_fn at line 375. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- clippy_dev/src/edit_lints.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":"clippy_dev/src/edit_lints.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"c17ceb0b995f7dd458a2c5325cbde056f6b63e9632bbdcc967fb1ce54b824d16"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_lints/src/matches/collapsible_match.rs: clippy_lints/src/matches/collapsible_match.rs changed 6 times in last 90 days, max cyclomatic complexity 23 in clippy_lints::matches::collapsible_match::check_arm at line 75. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/matches/collapsible_match.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":"clippy_lints/src/matches/collapsible_match.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"26640a930409488a14b89eafe84df1aa0da23a8adbe62ccfbcf8521f2a143b57"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/etc/debugger_tester/lldb/batchmode.py: src/etc/debugger_tester/lldb/batchmode.py changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in batchmode.main at line 223. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/etc/debugger_tester/lldb/batchmode.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/etc/debugger_tester/lldb/batchmode.py"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"d95cbcf6b3abf02f354bd8a9413dd6dafad0394887a0c94f2750b2069b780101"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_const_eval/src/interpret/intrinsics/atomic.rs: compiler/rustc_const_eval/src/interpret/intrinsics/atomic.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in InterpCx::eval_atomic_intrinsic at line 14. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_const_eval/src/interpret/intrinsics/atomic.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":"compiler/rustc_const_eval/src/interpret/intrinsics/atomic.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbf3d7f0d1a635a66acf92bc9c8684e30b518f03e7771c3c7e64e6db567d2bd5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tools/rust-analyzer/crates/hir-ty/src/infer/coerce.rs: src/tools/rust-analyzer/crates/hir-ty/src/infer/coerce.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in InferenceContext::try_find_coercion_lub at line 926. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/tools/rust-analyzer/crates/hir-ty/src/infer/coerce.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/tools/rust-analyzer/crates/hir-ty/src/infer/coerce.rs"},"region":{"startLine":926}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c9d6ab3a1a4a67845e9f9b797297e557006540d73d52b7ab1a4a45d14c7c848"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_const_eval/src/interpret/step.rs: compiler/rustc_const_eval/src/interpret/step.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in InterpCx::eval_terminator at line 547. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_const_eval/src/interpret/step.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":"compiler/rustc_const_eval/src/interpret/step.rs"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a05c8ef987198d49bc1b573e1ae22eb1c32da930ac4f9bcb8b79ad06a978c4e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tools/rust-analyzer/crates/ide-completion/src/completions/type.rs: src/tools/rust-analyzer/crates/ide-completion/src/completions/type.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in ide_completion::completions::type::complete_type_path 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/tools/rust-analyzer/crates/ide-completion/src/completions/type.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/tools/rust-analyzer/crates/ide-completion/src/completions/type.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"454853d4045c46d00f9a1638a8e150a2878a594d6ace3990f7aae2a4cedcd190"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_trait_selection/src/traits/const_evaluatable.rs: compiler/rustc_trait_selection/src/traits/const_evaluatable.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in rustc_trait_selection::traits::const_evaluatable::is_const_evaluatable at line 26. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_trait_selection/src/traits/const_evaluatable.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":"compiler/rustc_trait_selection/src/traits/const_evaluatable.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdf680ced818843f64eeaec16f878218a4eac2c2a563579cf5d30d9931be770b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_lints/src/matches/single_match.rs: clippy_lints/src/matches/single_match.rs changed 6 times in last 90 days, max cyclomatic complexity 22 in PatState::add_pat at line 355. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/matches/single_match.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":"clippy_lints/src/matches/single_match.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"8de98754fbff9f961fd62011ed305e0398c3ee5b67171c426e43ce9655b5c784"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tools/rust-analyzer/crates/hir-ide/src/diagnostics/unsafe_check.rs: src/tools/rust-analyzer/crates/hir-ide/src/diagnostics/unsafe_check.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in UnsafeVisitor::walk_expr at line 266. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/tools/rust-analyzer/crates/hir-ide/src/diagnostics/unsafe_check.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/tools/rust-analyzer/crates/hir-ide/src/diagnostics/unsafe_check.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"c11890bc7a4ce74112c609f4201879d73f3bdfebc6d7f06f22d7b49bc62d45c9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_target/src/callconv/x86_64.rs: compiler/rustc_target/src/callconv/x86_64.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in rustc_target::callconv::x86_64::classify_arg at line 50. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_target/src/callconv/x86_64.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":"compiler/rustc_target/src/callconv/x86_64.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb2c83404db2620c9cda68167427c64a8f5090c6545dd3b016aee8aed0eabb88"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_lints/src/large_unopt_stack_frames.rs: clippy_lints/src/large_unopt_stack_frames.rs changed 8 times in last 90 days, max cyclomatic complexity 16 in LargeUnoptStackFrames::check_fn at line 164. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/large_unopt_stack_frames.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":"clippy_lints/src/large_unopt_stack_frames.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfb2305fa70c6c79740b734c78c4187ecbbaa9fbdbe22a4a2a8f8e3a2e2d5f4c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_lints/src/ranges.rs: clippy_lints/src/ranges.rs changed 6 times in last 90 days, max cyclomatic complexity 21 in clippy_lints::ranges::check_possible_range_contains at line 208. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/ranges.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":"clippy_lints/src/ranges.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"e78b12e8db11bb603efebe3306510c0e2bdc42db778af8431fbca2c551b23cc5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tools/miri/src/intrinsics/x86/avx512.rs: src/tools/miri/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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/tools/miri/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/tools/miri/src/intrinsics/x86/avx512.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"928a9889ba9140565c71b817786bd0f951f974c3df6b48f67c4536749eeaa003"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tools/rust-analyzer/crates/hir/src/source_analyzer.rs: src/tools/rust-analyzer/crates/hir/src/source_analyzer.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in hir::source_analyzer::resolve_hir_path_ at line 1873. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/tools/rust-analyzer/crates/hir/src/source_analyzer.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/tools/rust-analyzer/crates/hir/src/source_analyzer.rs"},"region":{"startLine":1873}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb1e5a97a69b69eadab519894c46d72e6617ede2e43c24bf1c8b148a7647d9e8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_session/src/config/cfg.rs: compiler/rustc_session/src/config/cfg.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in rustc_session::config::cfg::default_configuration at line 165. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_session/src/config/cfg.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":"compiler/rustc_session/src/config/cfg.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3ea266bd7a8185ec2e30a18e6d250748359abeb5878cbaf5c837b8563904c07"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_hir_analysis/src/check/compare_impl_item/refine.rs: compiler/rustc_hir_analysis/src/check/compare_impl_item/refine.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in rustc_hir_analysis::check::compare_impl_item::refine::check_refining_return_position_impl_trait_in_trait at line 21. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_hir_analysis/src/check/compare_impl_item/refine.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":"compiler/rustc_hir_analysis/src/check/compare_impl_item/refine.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"cec0774e27c6f394e8034aa09428045ff79448fd7ef2ecf52f75dd8920b24a83"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tools/miri/src/intrinsics/x86/sse42.rs: src/tools/miri/src/intrinsics/x86/sse42.rs changed 4 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/tools/miri/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/tools/miri/src/intrinsics/x86/sse42.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f71b324ed047a09b26ddf3cc3214ecc4fea167df2b43e22e96732737320f0f9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tools/rust-analyzer/crates/hir-ty/src/infer/pat.rs: src/tools/rust-analyzer/crates/hir-ty/src/infer/pat.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in InferenceContext::infer_ref_pat at line 1356. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/tools/rust-analyzer/crates/hir-ty/src/infer/pat.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/tools/rust-analyzer/crates/hir-ty/src/infer/pat.rs"},"region":{"startLine":1356}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd689528a02a578d82dbc656213c70dac1807ac914c0ec670321a585129893ff"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_lints/src/ptr/ptr_arg.rs: clippy_lints/src/ptr/ptr_arg.rs changed 6 times in last 90 days, max cyclomatic complexity 20 in clippy_lints::ptr::ptr_arg::check_ptr_arg_usage at line 309. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/ptr/ptr_arg.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":"clippy_lints/src/ptr/ptr_arg.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b0fe07a95c6e8c5bed6fe18fa9cc44a28129d1584907fb25b85fd8fdf070ad5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_hir_analysis/src/delegation.rs: compiler/rustc_hir_analysis/src/delegation.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in rustc_hir_analysis::delegation::create_mapping at line 179. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_hir_analysis/src/delegation.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":"compiler/rustc_hir_analysis/src/delegation.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"67d239d1b217848e4ccf5a5d66d12afc4ec4d4b5084c47fb3ab2b67f691d07e4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/type_of.rs: src/type_of.rs changed 5 times in last 90 days, max cyclomatic complexity 24 in rustc_codegen_llvm::type_of::uncached_llvm_type 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/type_of.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/type_of.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2b40a9dde00e5f03f5f7d3f4ef833093acc90f2c753d79e19983bc40d573e05"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_mir_dataflow/src/move_paths/builder.rs: compiler/rustc_mir_dataflow/src/move_paths/builder.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in MoveDataBuilder::gather_terminator at line 454. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_mir_dataflow/src/move_paths/builder.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_dataflow/src/move_paths/builder.rs"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cd6d0c8af68bb18510928b4d19752bbeaa58671e408cbcf0c0f6ac71fa07446"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_type_ir/src/flags.rs: compiler/rustc_type_ir/src/flags.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in FlagComputation::add_kind at line 254. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_type_ir/src/flags.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":"compiler/rustc_type_ir/src/flags.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb6ed902836234b2d9987cf0d874732af2ec4161d9d98943efca47b89f319992"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tools/rustfmt/src/lists.rs: src/tools/rustfmt/src/lists.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 58 in rustfmt_nightly::lists::write_list at line 264. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/tools/rustfmt/src/lists.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/tools/rustfmt/src/lists.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d7bf3978602f55c3da61614978ca6b41e945fe95ce0c124a0892e6cfcfe67f6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tools/miri/src/shims/unix/linux_like/sync.rs: src/tools/miri/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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/tools/miri/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/tools/miri/src/shims/unix/linux_like/sync.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"638653d9d5ce84a3a4581d0560f904dfc112cc4274e7d6f319222650627e8e75"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_lexer/src/lib.rs: compiler/rustc_lexer/src/lib.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 57 in Cursor::advance_token at line 539. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_lexer/src/lib.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_lexer/src/lib.rs"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcf228042f95e17da2cb770efa8126aa8e091972446cac5afc91419f2a797e21"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_hir_typeck/src/opaque_types.rs: compiler/rustc_hir_typeck/src/opaque_types.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in FnCtxt::compute_definition_site_hidden_types at line 90. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_hir_typeck/src/opaque_types.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/opaque_types.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"46bd019faa6940a210c935d9b8ff046e45c812996b9a33c3a08836f476b81127"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_utils/src/qualify_min_const_fn.rs: clippy_utils/src/qualify_min_const_fn.rs changed 7 times in last 90 days, max cyclomatic complexity 16 in clippy_utils::qualify_min_const_fn::check_rvalue at line 136. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- clippy_utils/src/qualify_min_const_fn.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":"clippy_utils/src/qualify_min_const_fn.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b8919973c7255a44eeb5ad90e8ec49f68c2820fb9cd852e6690930567f787a9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_dev/src/generate.rs: clippy_dev/src/generate.rs changed 7 times in last 90 days, max cyclomatic complexity 16 in ParsedLints::gen_decls 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- clippy_dev/src/generate.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":"clippy_dev/src/generate.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f99c2bd4af37f782f926d5ac1203dba808008e10acbdab5d0021412749d5445"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tools/rust-analyzer/crates/proc-macro-api/src/legacy_protocol/msg/flat.rs: src/tools/rust-analyzer/crates/proc-macro-api/src/legacy_protocol/msg/flat.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in Reader::read_tokenstream at line 871. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/tools/rust-analyzer/crates/proc-macro-api/src/legacy_protocol/msg/flat.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/tools/rust-analyzer/crates/proc-macro-api/src/legacy_protocol/msg/flat.rs"},"region":{"startLine":871}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad88388d83e2d94c00157182f767714adcac1e54df86846b6432d041202d0bd6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_borrowck/src/diagnostics/region_name.rs: compiler/rustc_borrowck/src/diagnostics/region_name.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in RegionName::highlight_region_name at line 107. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_borrowck/src/diagnostics/region_name.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":"compiler/rustc_borrowck/src/diagnostics/region_name.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"929675e25e32d97076d4bb79d506a6a0f0da5d5eb10b01fefef7609314ab524a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_ty_utils/src/abi.rs: compiler/rustc_ty_utils/src/abi.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in rustc_ty_utils::abi::fn_abi_sanity_check at line 417. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_ty_utils/src/abi.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":"compiler/rustc_ty_utils/src/abi.rs"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d5d7c30a9d443f164f015f567c83d6bb0ed4992884663614d6c8f899e2e21fa"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/etc/debugger_tester/lldb/check_lldb.py: src/etc/debugger_tester/lldb/check_lldb.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in check_lldb.var_matches at line 199. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/etc/debugger_tester/lldb/check_lldb.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/etc/debugger_tester/lldb/check_lldb.py"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ebe04a5be2645d24486d6f49de709b8ef4fcc35e1dd22206bea17e1a17e4f06"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_utils/src/visitors.rs: clippy_utils/src/visitors.rs changed 5 times in last 90 days, max cyclomatic complexity 22 in clippy_utils::visitors::for_each_unconsumed_temporary at line 673. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- clippy_utils/src/visitors.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":"clippy_utils/src/visitors.rs"},"region":{"startLine":673}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e239ab779d0de377891fc935dcfb294ea333e28a86908f8cf450e048768bb00"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_lints/src/indexing_slicing.rs: clippy_lints/src/indexing_slicing.rs changed 4 times in last 90 days, max cyclomatic complexity 27 in IndexingSlicing::check_expr at line 111. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/indexing_slicing.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":"clippy_lints/src/indexing_slicing.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c7b6ad5342e0314ba40f3da9206ed9a729f8bafadf8651c56c5b6a954b5eca7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_lints/src/methods/unnecessary_map_or.rs: clippy_lints/src/methods/unnecessary_map_or.rs changed 5 times in last 90 days, max cyclomatic complexity 21 in clippy_lints::methods::unnecessary_map_or::check at line 124. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/methods/unnecessary_map_or.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":"clippy_lints/src/methods/unnecessary_map_or.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eb16a39e2ab34762e503ffd6562e41ec3eeb1ee3c6f560a9d99a38d1c1cee5e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_lints/src/booleans.rs: clippy_lints/src/booleans.rs changed 5 times in last 90 days, max cyclomatic complexity 21 in Hir2Qmm::run at line 261. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/booleans.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":"clippy_lints/src/booleans.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"eed602970cbe9b24950c26b2350f5b2ec65a3b1eca6748e24452bb8b2e64da28"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_utils/src/paths.rs: clippy_utils/src/paths.rs changed 5 times in last 90 days, max cyclomatic complexity 21 in clippy_utils::paths::local_item_child_by_name at line 287. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- clippy_utils/src/paths.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":"clippy_utils/src/paths.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"f87ce7d11646a4a944a71aae66284531b88767b72f729f4b5958b23dab6c6182"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tools/rust-analyzer/crates/ide-assists/src/handlers/inline_call.rs: src/tools/rust-analyzer/crates/ide-assists/src/handlers/inline_call.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 51 in ide_assists::handlers::inline_call::inline at line 349. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/tools/rust-analyzer/crates/ide-assists/src/handlers/inline_call.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/tools/rust-analyzer/crates/ide-assists/src/handlers/inline_call.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b2ca3d45eedae8bd0599b6aa426dfa0104c3a3d93851e1ba5b12d9bef08d9b2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_lints/src/methods/needless_collect.rs: clippy_lints/src/methods/needless_collect.rs changed 4 times in last 90 days, max cyclomatic complexity 25 in IterFunctionVisitor::visit_expr at line 516. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/methods/needless_collect.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":"clippy_lints/src/methods/needless_collect.rs"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"0343543083e82422e375c0dfa7cb2492a8ba2c1e1f3f969287d2d75d5de4a4a3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/librustdoc/passes/strip_hidden.rs: src/librustdoc/passes/strip_hidden.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in Stripper::fold_item 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/librustdoc/passes/strip_hidden.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/librustdoc/passes/strip_hidden.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"51fe1a474a6affebdb2883780b03c283420a5255ff78807ef56dc70e70091939"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_dev/src/main.rs: clippy_dev/src/main.rs changed 4 times in last 90 days, max cyclomatic complexity 25 in clippy_dev::main 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- clippy_dev/src/main.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_dev/src/main.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f61cf1fb5ad950b2bc98547490c460c41421bfe44cacb5359b7bfdf7349ba1f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_lints/src/pass_by_ref_or_value.rs: clippy_lints/src/pass_by_ref_or_value.rs changed 5 times in last 90 days, max cyclomatic complexity 20 in PassByRefOrValue::check_poly_fn at line 128. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/pass_by_ref_or_value.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":"clippy_lints/src/pass_by_ref_or_value.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e679b6878f2e1110380ce1184f4be0ff664c77864d55524ea6159581bf3ce14"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_lints/src/methods/map_clone.rs: clippy_lints/src/methods/map_clone.rs changed 5 times in last 90 days, max cyclomatic complexity 20 in clippy_lints::methods::map_clone::check at line 45. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/methods/map_clone.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":"clippy_lints/src/methods/map_clone.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c4544d5c6f355f3efb5667efd720a60114bed0415e1a42a7281a0914979f10b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_mir_transform/src/cross_crate_inline.rs: compiler/rustc_mir_transform/src/cross_crate_inline.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in rustc_mir_transform::cross_crate_inline::cross_crate_inlinable 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_mir_transform/src/cross_crate_inline.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":"compiler/rustc_mir_transform/src/cross_crate_inline.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"5482710267e8a652a3ec5a942fa52d2e17010f0bf9a7c323842801669b3d25cf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_next_trait_solver/src/solve/assembly/structural_traits.rs: compiler/rustc_next_trait_solver/src/solve/assembly/structural_traits.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in rustc_next_trait_solver::solve::assembly::structural_traits::extract_tupled_inputs_and_output_from_async_callable at line 447. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_next_trait_solver/src/solve/assembly/structural_traits.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":"compiler/rustc_next_trait_solver/src/solve/assembly/structural_traits.rs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a6b07ecd6d2a6545ea65b33c2bb709be3ff630ee5356cfb2720fa4909394c85"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_const_eval/src/interpret/memory.rs: compiler/rustc_const_eval/src/interpret/memory.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in InterpCx::mem_copy_repeatedly at line 1473. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_const_eval/src/interpret/memory.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":"compiler/rustc_const_eval/src/interpret/memory.rs"},"region":{"startLine":1473}}}],"partialFingerprints":{"codehealthFindingId/v1":"c919db9a7cdd6cbc056c3126d48e82ba12305b0bc722cb0644d6dfac3cc1b77d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tools/miri/src/shims/unix/freebsd/sync.rs: src/tools/miri/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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/tools/miri/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/tools/miri/src/shims/unix/freebsd/sync.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"737c24c74e8b98d5133b08a9f0dd6a522ed4dcf18f8aab4aeaacb4dce63344a0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_ty_walk/src/lib.rs: compiler/rustc_ty_walk/src/lib.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in rustc_ty_walk::walk_types at line 20. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_ty_walk/src/lib.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ty_walk/src/lib.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"491ce611a578e1a82bc77713ecaedff66a0bfacec0dc297f0cda5930ae43c978"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/back/write.rs: src/back/write.rs changed 2 times in last 90 days, max cyclomatic complexity 48 in rustc_codegen_ssa::back::write::start_executing_work at line 1204. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/back/write.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/back/write.rs"},"region":{"startLine":1204}}}],"partialFingerprints":{"codehealthFindingId/v1":"7073338af9fb00f43d228240a4eec6b165bb30b725c97164be2adcd4e0037eff"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tools/rust-analyzer/crates/ide-completion/src/completions/attribute/cfg.rs: src/tools/rust-analyzer/crates/ide-completion/src/completions/attribute/cfg.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in ide_completion::completions::attribute::cfg::complete_cfg 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/tools/rust-analyzer/crates/ide-completion/src/completions/attribute/cfg.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/tools/rust-analyzer/crates/ide-completion/src/completions/attribute/cfg.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"e30215184afcd1ace23ea3ff5995e969e4b2674f6c5f5d6508ff0dff26ceb426"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/inline_asm.rs: src/inline_asm.rs changed 2 times in last 90 days, max cyclomatic complexity 48 in InlineAsmCtxt::get_asm_ty at line 70. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/inline_asm.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/inline_asm.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"22751bf6abaeb3eb3477b98f7066c4a03a22b0acc86d43ebff00757687ebade9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_monomorphize/src/partitioning.rs: compiler/rustc_monomorphize/src/partitioning.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in rustc_monomorphize::partitioning::mono_item_visibility at line 803. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_monomorphize/src/partitioning.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":"compiler/rustc_monomorphize/src/partitioning.rs"},"region":{"startLine":803}}}],"partialFingerprints":{"codehealthFindingId/v1":"15648c963bfaada16402f53295bb168c40b8bb6f8b26f13ed0d97caf395f1d63"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_metadata/src/native_libs.rs: compiler/rustc_metadata/src/native_libs.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in Collector::build_dll_import at line 229. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_metadata/src/native_libs.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":"compiler/rustc_metadata/src/native_libs.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"02e9cca1ef1550258db0447fd69a356ef5e70b3d83166a4a6f8353f68d8cb706"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tools/rust-analyzer/crates/syntax-bridge/src/lib.rs: src/tools/rust-analyzer/crates/syntax-bridge/src/lib.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in syntax_bridge::convert_tokens at line 208. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/tools/rust-analyzer/crates/syntax-bridge/src/lib.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/syntax-bridge/src/lib.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"14ebf8a7e4b3cec77459d260e7cd4a4fa2ad648ccc232962fe17611e66e36e04"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tools/rust-analyzer/crates/ide-completion/src/completions/postfix.rs: src/tools/rust-analyzer/crates/ide-completion/src/completions/postfix.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 45 in ide_completion::completions::postfix::complete_postfix at line 33. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/tools/rust-analyzer/crates/ide-completion/src/completions/postfix.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/tools/rust-analyzer/crates/ide-completion/src/completions/postfix.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"b00e1f84f9adcb7b770e6cf52ef61a21ba74ea4af0893c06c574f59e95222cda"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_lints/src/default.rs: clippy_lints/src/default.rs changed 5 times in last 90 days, max cyclomatic complexity 18 in Default::check_block at line 111. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/default.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":"clippy_lints/src/default.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9b30eadea9db92c1fe538a2e552caa102f2cccb52fae9dc44598119c69e3c8d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tools/rust-analyzer/crates/ide/src/hover.rs: src/tools/rust-analyzer/crates/ide/src/hover.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in ide::hover::hover_offset at line 159. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/tools/rust-analyzer/crates/ide/src/hover.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/tools/rust-analyzer/crates/ide/src/hover.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7f89084ba7ce264e86e2a5dfcb56b11f8d94b8be9c4094e80f1633cbe952e0e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_lints/src/format.rs: clippy_lints/src/format.rs changed 5 times in last 90 days, max cyclomatic complexity 18 in UselessFormat::check_expr at line 55. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/format.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":"clippy_lints/src/format.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"358a523ccc9de15a66079c3e75eee70c9d5122f3c121a36393a01247de434d76"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tools/rust-analyzer/crates/test-fixture/src/lib.rs: src/tools/rust-analyzer/crates/test-fixture/src/lib.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in ChangeFixture::parse_with_proc_macros at line 250. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/tools/rust-analyzer/crates/test-fixture/src/lib.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/test-fixture/src/lib.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"f63cf1dd694e2f39aaf2b8029276d8187145865c5e5483ed71844ed9c3be0fe1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_dev/src/fmt.rs: clippy_dev/src/fmt.rs changed 4 times in last 90 days, max cyclomatic complexity 22 in clippy_dev::fmt::fmt_conf at line 66. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- clippy_dev/src/fmt.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":"clippy_dev/src/fmt.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6236884d46f0983d990122a861638b48a0018e4bcfe960b9204d2234fbfc717"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_lints/src/transmute/transmute_undefined_repr.rs: clippy_lints/src/transmute/transmute_undefined_repr.rs changed 3 times in last 90 days, max cyclomatic complexity 29 in clippy_lints::transmute::transmute_undefined_repr::check 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/transmute/transmute_undefined_repr.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":"clippy_lints/src/transmute/transmute_undefined_repr.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9ea0bfe49714e6e87e43504c23d09941a086f029052fb94f63e79c4bb5083e5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/bootstrap/src/core/config/toml/pgo.rs: src/bootstrap/src/core/config/toml/pgo.rs changed 2 times in last 90 days, max cyclomatic complexity 43 in Pgo::merge at line 23. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/bootstrap/src/core/config/toml/pgo.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/bootstrap/src/core/config/toml/pgo.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"56a67b595bab0e756d3793c1848247349f2a6f2e801b088b0fd5d56398fe9d91"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tools/compiletest/src/runtest/ui.rs: src/tools/compiletest/src/runtest/ui.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in TestCx::run_ui_test at line 16. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/tools/compiletest/src/runtest/ui.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/tools/compiletest/src/runtest/ui.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"306aee93296cc8e2e5a7475bd2613ec59ffdd89cdeed31dc1430061cf25acb68"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tools/rust-analyzer/crates/hir-def/src/lang_item.rs: src/tools/rust-analyzer/crates/hir-def/src/lang_item.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in hir_def::lang_item::crate_lang_items at line 41. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/tools/rust-analyzer/crates/hir-def/src/lang_item.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/tools/rust-analyzer/crates/hir-def/src/lang_item.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"5047308ba5b2161ad1cf4e8627a15a383cfbc871a3a99267483e78824f31b090"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_lints/src/wildcard_imports.rs: clippy_lints/src/wildcard_imports.rs changed 5 times in last 90 days, max cyclomatic complexity 16 in WildcardImports::check_use_tree at line 140. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/wildcard_imports.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":"clippy_lints/src/wildcard_imports.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"51b8499ea43a162adcbd62ced2a7b02e51488e6397112602cb764168e6a4609e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_lints/src/unnecessary_wraps.rs: clippy_lints/src/unnecessary_wraps.rs changed 5 times in last 90 days, max cyclomatic complexity 16 in UnnecessaryWraps::check_fn at line 77. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/unnecessary_wraps.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":"clippy_lints/src/unnecessary_wraps.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a146bb15e7ed0ac352f61f6eff38b68caedbefdf9637b1a785b43772d29bc55"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_target/src/callconv/s390x.rs: compiler/rustc_target/src/callconv/s390x.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in rustc_target::callconv::s390x::classify_arg at line 55. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_target/src/callconv/s390x.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":"compiler/rustc_target/src/callconv/s390x.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9e5ac8855c1c14ffc0c8244b9891f0b3fe4ef3e0a9618992058b0403267bd68"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tools/tidy/src/deps.rs: src/tools/tidy/src/deps.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in tidy::deps::check_permitted_dependencies at line 962. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/tools/tidy/src/deps.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/tools/tidy/src/deps.rs"},"region":{"startLine":962}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1d0fcffcd04f6910ddcb49b37078bc2d86336ef055efb97c506f6c16c19bf40"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: build_system/src/config.rs: build_system/src/config.rs changed 3 times in last 90 days, max cyclomatic complexity 26 in ConfigInfo::setup at line 354. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- build_system/src/config.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"build_system/src/config.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba5e6d656844d6efa8694bbbd6652d3bff4c8f4b70ccdea1ec0f2b2e7170a8cf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_lints/src/types/mod.rs: clippy_lints/src/types/mod.rs changed 3 times in last 90 days, max cyclomatic complexity 26 in Types::check_ty at line 575. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/types/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/types/mod.rs"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"90b0d5742706735ef8c06a1fb86313bc49c7e75d7fdd74cc4605e7d277a9e58b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_lints/src/implicit_return.rs: clippy_lints/src/implicit_return.rs changed 4 times in last 90 days, max cyclomatic complexity 19 in clippy_lints::implicit_return::lint_implicit_returns at line 102. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/implicit_return.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":"clippy_lints/src/implicit_return.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7abb0af26e86fb461163ce07efd364f316ce95ebf25336c2db155d4f2eec79e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_lints/src/methods/unnecessary_sort_by.rs: clippy_lints/src/methods/unnecessary_sort_by.rs changed 3 times in last 90 days, max cyclomatic complexity 25 in clippy_lints::methods::unnecessary_sort_by::mirrored_exprs at line 32. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/methods/unnecessary_sort_by.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":"clippy_lints/src/methods/unnecessary_sort_by.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"790dfb3013a8057f7ad31e02a846cb1826b24e78e5a3aa4ceeceaa83ae7cf9e4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tools/rust-analyzer/crates/ide-completion/src/completions/attribute.rs: src/tools/rust-analyzer/crates/ide-completion/src/completions/attribute.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in ide_completion::completions::attribute::complete_attribute_path at line 70. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/tools/rust-analyzer/crates/ide-completion/src/completions/attribute.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/tools/rust-analyzer/crates/ide-completion/src/completions/attribute.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"358a3be3f10ce60fb55e43441e1b5d561e74a59d5e1a673d55881482c0eaf8e0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_hir_analysis/src/variance/mod.rs: compiler/rustc_hir_analysis/src/variance/mod.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in rustc_hir_analysis::variance::variance_of_opaque at line 97. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_hir_analysis/src/variance/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/variance/mod.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"04c51e514886227bc79178e66f5974bbfc8134cda0a336b4c2e5a91ea30e0853"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_lints/src/casts/unnecessary_cast.rs: clippy_lints/src/casts/unnecessary_cast.rs changed 2 times in last 90 days, max cyclomatic complexity 36 in clippy_lints::casts::unnecessary_cast::check at line 21. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/casts/unnecessary_cast.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":"clippy_lints/src/casts/unnecessary_cast.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a56a5555dc46329617067918d6c16f8ec1dbc3931b65b0023fa662b2066c023"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_lints/src/entry.rs: clippy_lints/src/entry.rs changed 4 times in last 90 days, max cyclomatic complexity 18 in InsertSearcher::visit_expr at line 491. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/entry.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":"clippy_lints/src/entry.rs"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"900d8aa6a16bf51a5becf4f41f68a3cd9ee0ffc09f992578a6721f9df010c19f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tools/clippy/clippy_lints/src/casts/unnecessary_cast.rs: src/tools/clippy/clippy_lints/src/casts/unnecessary_cast.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in clippy_lints::casts::unnecessary_cast::check at line 21. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/tools/clippy/clippy_lints/src/casts/unnecessary_cast.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/tools/clippy/clippy_lints/src/casts/unnecessary_cast.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"468ab0cd1a9c1370cabe7f9c7fa097782339579f9b9d89136600b8d0ae322fc9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_lints/src/methods/useless_asref.rs: clippy_lints/src/methods/useless_asref.rs changed 4 times in last 90 days, max cyclomatic complexity 18 in clippy_lints::methods::useless_asref::check at line 45. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/methods/useless_asref.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":"clippy_lints/src/methods/useless_asref.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a516caf2b00acac2c7742c95a0c54c56d6a501fe2730a270e1f54deb2233eb7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_lints/src/option_if_let_else.rs: clippy_lints/src/option_if_let_else.rs changed 3 times in last 90 days, max cyclomatic complexity 24 in clippy_lints::option_if_let_else::try_get_option_occurrence at line 120. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/option_if_let_else.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":"clippy_lints/src/option_if_let_else.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"62274a3f4bda16738a880304a9ad9e41865b729e1855ca4b8aa22f172b96f12e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_lints/src/missing_const_for_fn.rs: clippy_lints/src/missing_const_for_fn.rs changed 3 times in last 90 days, max cyclomatic complexity 23 in MissingConstForFn::check_fn at line 89. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/missing_const_for_fn.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":"clippy_lints/src/missing_const_for_fn.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0f60429b668c2b1a33e13aabcfbb0dc20b3d17be9f3de372cb941efdfb4bcae"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/constant.rs: src/constant.rs changed 3 times in last 90 days, max cyclomatic complexity 23 in rustc_codegen_cranelift::constant::mir_operand_get_const_val at line 498. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/constant.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/constant.rs"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3b8df9b14c773564ecfefb202e5565bb1e30e9407859078c9da6c455a06b3d7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tools/miri/src/intrinsics/aarch64.rs: src/tools/miri/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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/tools/miri/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/tools/miri/src/intrinsics/aarch64.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bb70c4e5ce25c63b4163dd10e79fd1d4985205c9332518ce7a3f44d26801a19"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_lints/src/manual_clamp.rs: clippy_lints/src/manual_clamp.rs changed 4 times in last 90 days, max cyclomatic complexity 16 in clippy_lints::manual_clamp::is_call_max_min_pattern at line 347. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/manual_clamp.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":"clippy_lints/src/manual_clamp.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"38c8f71c536c9fb22c95f82703bfe237cbf733fa13fb4a5bca9c0211d5098b3e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_mir_build/src/builder/expr/as_place.rs: compiler/rustc_mir_build/src/builder/expr/as_place.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in Builder::expr_as_place at line 416. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_mir_build/src/builder/expr/as_place.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":"compiler/rustc_mir_build/src/builder/expr/as_place.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"78a686435a593012c3427f18fe71bfc251b223e60f35fd70a48d32d278132cfb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: library/compiler-builtins/libm/configure.rs: library/compiler-builtins/libm/configure.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in libm::configure::emit at line 104. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- library/compiler-builtins/libm/configure.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":"library/compiler-builtins/libm/configure.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"8458913e4f5f9fd21063bdddf179520a53bb9f626a35eaed6ceba41d03604bf4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_attr_parsing/src/attributes/deprecation.rs: compiler/rustc_attr_parsing/src/attributes/deprecation.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in DeprecatedParser::convert at line 75. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_attr_parsing/src/attributes/deprecation.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":"compiler/rustc_attr_parsing/src/attributes/deprecation.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"658c25ee699857f21b078de6d0c4c5a2a9f98724f736d8819622f9a2a0f1c5c0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tools/rust-analyzer/crates/ide-completion/src/completions/pattern.rs: src/tools/rust-analyzer/crates/ide-completion/src/completions/pattern.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in ide_completion::completions::pattern::complete_pattern at line 13. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/tools/rust-analyzer/crates/ide-completion/src/completions/pattern.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/tools/rust-analyzer/crates/ide-completion/src/completions/pattern.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"2738fbed0d58e0b5ccfcacf1ed47c40f5746873739b48eee5b963fbb2b43ec43"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/callee.rs: src/callee.rs changed 2 times in last 90 days, max cyclomatic complexity 31 in FnCtxt::report_invalid_callee at line 927. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/callee.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/callee.rs"},"region":{"startLine":927}}}],"partialFingerprints":{"codehealthFindingId/v1":"a20d32b680bc486b4e87f98d2ee3e51126506df98e459aced5b5f2f83716f5d5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_lints/src/matches/manual_utils.rs: clippy_lints/src/matches/manual_utils.rs changed 2 times in last 90 days, max cyclomatic complexity 30 in clippy_lints::matches::manual_utils::check_with at line 20. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/matches/manual_utils.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":"clippy_lints/src/matches/manual_utils.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb544a3bc0778365ccbfd0c992bdd4b5da666bab7f752a044a0c5b20a74ca796"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_lints/src/no_effect.rs: clippy_lints/src/no_effect.rs changed 3 times in last 90 days, max cyclomatic complexity 20 in clippy_lints::no_effect::reduce_expression at line 330. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/no_effect.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":"clippy_lints/src/no_effect.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"67d29d91d976c39374f6fad7155f14ee440402fb067329ff565c153d3fdd8ad0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/librustdoc/doctest/rust.rs: src/librustdoc/doctest/rust.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in HirCollector::visit_testable at line 118. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/librustdoc/doctest/rust.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/librustdoc/doctest/rust.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"22908729f7fc46fd286cc45d507895765988d9edee2173582bb8333220646d24"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_lints/src/default_numeric_fallback.rs: clippy_lints/src/default_numeric_fallback.rs changed 3 times in last 90 days, max cyclomatic complexity 20 in NumericFallbackVisitor::visit_expr at line 128. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/default_numeric_fallback.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":"clippy_lints/src/default_numeric_fallback.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad59824d548abfe0bf0357a820f95cb98852fcd9e8b0ba61783d3280942730e5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_lints/src/string_patterns.rs: clippy_lints/src/string_patterns.rs changed 3 times in last 90 days, max cyclomatic complexity 20 in clippy_lints::string_patterns::check_manual_pattern_char_comparison at line 140. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/string_patterns.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":"clippy_lints/src/string_patterns.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"10794e0620d63315849037e41159ba92ca598c5d090ffc700ff9020c852afe78"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_utils/src/ty/type_certainty/mod.rs: clippy_utils/src/ty/type_certainty/mod.rs changed 3 times in last 90 days, max cyclomatic complexity 20 in clippy_utils::ty::type_certainty::expr_type_certainty at line 32. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- clippy_utils/src/ty/type_certainty/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_utils/src/ty/type_certainty/mod.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0643facda48ddcd58d847e4a7a0799120ab2971fcc3d90c6ce753b40ec3cd94"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/codegen_f16_f128.rs: src/codegen_f16_f128.rs changed 2 times in last 90 days, max cyclomatic complexity 29 in rustc_codegen_cranelift::codegen_f16_f128::codegen_cast at line 163. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/codegen_f16_f128.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/codegen_f16_f128.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce9021cccfc2211fe87a141f296192e39aa54d3a272d45ba87df9240694bf629"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: library/core/src/fmt/num.rs: library/core/src/fmt/num.rs changed 3 times in last 90 days, max cyclomatic complexity 19 in core::fmt::num::exp_u128 at line 636. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- library/core/src/fmt/num.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":"library/core/src/fmt/num.rs"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"a90e88aab07d10135383936f24b9e60916abbeaf1b7e2352ab09241a16214ff9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_lints/src/needless_pass_by_ref_mut.rs: clippy_lints/src/needless_pass_by_ref_mut.rs changed 3 times in last 90 days, max cyclomatic complexity 19 in NeedlessPassByRefMut::check_fn at line 123. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/needless_pass_by_ref_mut.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":"clippy_lints/src/needless_pass_by_ref_mut.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"5757f25ea6e86d5777b1b0379b49b2bfb307495dfcbfea749f3f4c7d7771b30c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_expand/src/mbe/quoted.rs: compiler/rustc_expand/src/mbe/quoted.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in rustc_expand::mbe::quoted::parse_tree at line 233. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_expand/src/mbe/quoted.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":"compiler/rustc_expand/src/mbe/quoted.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e4b2e342151aeea8c429666cb697e427972cb3f23cae03b0d632c7aefc755c8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_lints/src/manual_option_as_slice.rs: clippy_lints/src/manual_option_as_slice.rs changed 3 times in last 90 days, max cyclomatic complexity 18 in ManualOptionAsSlice::check_expr at line 55. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/manual_option_as_slice.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":"clippy_lints/src/manual_option_as_slice.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"5592b3e4aa1ebea5abf0f6eac49cd17b7ab85c514b9cb6a6694aff15cfbf0193"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_lints/src/loops/mod.rs: clippy_lints/src/loops/mod.rs changed 3 times in last 90 days, max cyclomatic complexity 18 in Loops::check_expr at line 859. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/loops/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/loops/mod.rs"},"region":{"startLine":859}}}],"partialFingerprints":{"codehealthFindingId/v1":"09ed85b52da84dcdf038110f01f05064c4cf9e8b82f6f2e16f7e24962c7403a0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_lints/src/new_without_default.rs: clippy_lints/src/new_without_default.rs changed 3 times in last 90 days, max cyclomatic complexity 18 in NewWithoutDefault::check_item at line 61. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/new_without_default.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":"clippy_lints/src/new_without_default.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2d7155494119d150b7808ed052d4901f02ebd18d41424eae25dad6f8f1d019d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_attr_parsing/src/stability.rs: compiler/rustc_attr_parsing/src/stability.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in AttributeParser::check_attribute_stability at line 22. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_attr_parsing/src/stability.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":"compiler/rustc_attr_parsing/src/stability.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0b7a2d3dd87d385c97766d10c1903b6beb14ceca9b307fe3d3823823769374a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tools/rust-analyzer/crates/project-model/src/cargo_workspace.rs: src/tools/rust-analyzer/crates/project-model/src/cargo_workspace.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in CargoWorkspace::new at line 316. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/tools/rust-analyzer/crates/project-model/src/cargo_workspace.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/tools/rust-analyzer/crates/project-model/src/cargo_workspace.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"23d9d70aaff18651310fcdaa63981f03de6adeb94d1de85719014ed7d5b65e02"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/librustdoc/passes/lint/invalid_markdown_table.rs: src/librustdoc/passes/lint/invalid_markdown_table.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in rustdoc::passes::lint::invalid_markdown_table::visit_item at line 32. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/librustdoc/passes/lint/invalid_markdown_table.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/librustdoc/passes/lint/invalid_markdown_table.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6991a7975f619ef6254094eaf02e3f42ef45316c0a50bbe31cb290473f03a43"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_codegen_llvm/src/callee.rs: compiler/rustc_codegen_llvm/src/callee.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in rustc_codegen_llvm::callee::get_fn at line 19. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_codegen_llvm/src/callee.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":"compiler/rustc_codegen_llvm/src/callee.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8b30ea752d7d7c9e4149233d42f8d2d740b78635f6292b9fc33fd55491842e0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tools/miri/src/concurrency/scheduler.rs: src/tools/miri/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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/tools/miri/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/tools/miri/src/concurrency/scheduler.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"c198ed3f759cf5ade7b258a5386d4608ecfede5ed2af7b38dc98ec7db5f8eb04"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_borrowck/src/places_conflict.rs: compiler/rustc_borrowck/src/places_conflict.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in rustc_borrowck::places_conflict::place_components_conflict at line 131. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_borrowck/src/places_conflict.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":"compiler/rustc_borrowck/src/places_conflict.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bd4560bd778e4fa04b9d676ed64f1bc9f07cac767711d7fb9f0009e8c6d7563"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_lints/src/panic_unimplemented.rs: clippy_lints/src/panic_unimplemented.rs changed 3 times in last 90 days, max cyclomatic complexity 16 in PanicUnimplemented::check_expr at line 107. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/panic_unimplemented.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":"clippy_lints/src/panic_unimplemented.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e97ef8d7cc9d0068786a81d5ffd4a602932eac934f9212c190feddcf66ffdc3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lintcheck/src/main.rs: lintcheck/src/main.rs changed 3 times in last 90 days, max cyclomatic complexity 16 in Crate::run_clippy_lints at line 68. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- lintcheck/src/main.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lintcheck/src/main.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd3c99c4da38c1ed1d6d0897ba4fad21836f4d2dc52b4ef490223aa95209a122"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_lints/src/question_mark.rs: clippy_lints/src/question_mark.rs changed 3 times in last 90 days, max cyclomatic complexity 16 in clippy_lints::question_mark::check_if_let_some_or_err_and_early_return at line 518. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/question_mark.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":"clippy_lints/src/question_mark.rs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f856cc810ca8b24fbbbcc21f71722239e5f69b878d55977789a812562cdc3ff"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_lints/src/functions/too_many_lines.rs: clippy_lints/src/functions/too_many_lines.rs changed 3 times in last 90 days, max cyclomatic complexity 16 in clippy_lints::functions::too_many_lines::check_fn 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/functions/too_many_lines.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":"clippy_lints/src/functions/too_many_lines.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"f682f2c68fbe653b712de11870099011c44152c62aba0939098d23ab6ec251b3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/common.rs: src/common.rs changed 2 times in last 90 days, max cyclomatic complexity 23 in rustc_codegen_cranelift::common::clif_type_from_ty at line 50. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/common.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/common.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"89d136f8829c4a898c77c2329ffc88c901f4ca95125b72bcf7019da91d323578"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_lints/src/loops/while_let_on_iterator.rs: clippy_lints/src/loops/while_let_on_iterator.rs changed 2 times in last 90 days, max cyclomatic complexity 21 in clippy_lints::loops::while_let_on_iterator::needs_mutable_borrow at line 238. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/loops/while_let_on_iterator.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":"clippy_lints/src/loops/while_let_on_iterator.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f658a65646194d1404f441ac905a69b6b62cd9df022db6c35b500c62d645490"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/driver.rs: src/driver.rs changed 2 times in last 90 days, max cyclomatic complexity 21 in clippy::driver::main at line 196. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/driver.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/driver.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"f777f5860c8ad9b071e934269b93447ccdba8e0abb604fb3c2d259dd695c25b6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tools/clippy/src/driver.rs: src/tools/clippy/src/driver.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in clippy::driver::main at line 196. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/tools/clippy/src/driver.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/tools/clippy/src/driver.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f3a5c3bffcfc82bdd83e8dfea52c4248e70c769474c51181018676dd6a714b6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_lints/src/only_used_in_recursion.rs: clippy_lints/src/only_used_in_recursion.rs changed 2 times in last 90 days, max cyclomatic complexity 20 in OnlyUsedInRecursion::check_expr at line 367. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/only_used_in_recursion.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":"clippy_lints/src/only_used_in_recursion.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"a977becdf2d4c38c54faecce54f1e8579493139be5e5ae73eebc112d1a5f851e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_lints/src/unit_types/let_unit_value.rs: clippy_lints/src/unit_types/let_unit_value.rs changed 2 times in last 90 days, max cyclomatic complexity 20 in clippy_lints::unit_types::let_unit_value::check at line 19. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/unit_types/let_unit_value.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":"clippy_lints/src/unit_types/let_unit_value.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"5786cb004491323e55e0dedc586f85ceca8a7c89e05f988ea064b3a5201e37d6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_lints/src/single_component_path_imports.rs: clippy_lints/src/single_component_path_imports.rs changed 2 times in last 90 days, max cyclomatic complexity 20 in SingleComponentPathImports::track_uses at line 171. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/single_component_path_imports.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":"clippy_lints/src/single_component_path_imports.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae112c84c19591c684f4efc94bfe973f064c26c7986919b15fbec3867ddfa966"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_lints/src/manual_let_else.rs: clippy_lints/src/manual_let_else.rs changed 2 times in last 90 days, max cyclomatic complexity 19 in clippy_lints::manual_let_else::replace_in_pattern at line 219. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/manual_let_else.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":"clippy_lints/src/manual_let_else.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"8173d08e1df4a5d05e506897ea67af214d8ba9d45b65630739832a972691d263"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_lints/src/methods/iter_overeager_cloned.rs: clippy_lints/src/methods/iter_overeager_cloned.rs changed 2 times in last 90 days, max cyclomatic complexity 19 in clippy_lints::methods::iter_overeager_cloned::check at line 37. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/methods/iter_overeager_cloned.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":"clippy_lints/src/methods/iter_overeager_cloned.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b24c2b09437ba2951f2e066e9dc37b353f9c69b15c3c3a1e19ce91d998c599b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_lints/src/methods/option_as_ref_deref.rs: clippy_lints/src/methods/option_as_ref_deref.rs changed 2 times in last 90 days, max cyclomatic complexity 19 in clippy_lints::methods::option_as_ref_deref::check 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/methods/option_as_ref_deref.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":"clippy_lints/src/methods/option_as_ref_deref.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d32b85c08fffc4355e7097a5b755ff263b2837e429b2675d5bedf90ec7b8731"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_lints/src/floating_point_arithmetic/radians.rs: clippy_lints/src/floating_point_arithmetic/radians.rs changed 2 times in last 90 days, max cyclomatic complexity 19 in clippy_lints::floating_point_arithmetic::radians::check at line 17. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/floating_point_arithmetic/radians.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":"clippy_lints/src/floating_point_arithmetic/radians.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"5956cede97a40fa2d34990715cd3be105574a63e0bbdb6d6aae36a29c6079412"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_lints/src/methods/filter_map.rs: clippy_lints/src/methods/filter_map.rs changed 2 times in last 90 days, max cyclomatic complexity 18 in OffendingFilterExpr::check_map_call at line 109. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/methods/filter_map.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":"clippy_lints/src/methods/filter_map.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b28684427c6066fffab1cf11ae763167644b805134195c64097fa9b1622263f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_lints/src/methods/str_splitn.rs: clippy_lints/src/methods/str_splitn.rs changed 2 times in last 90 days, max cyclomatic complexity 18 in clippy_lints::methods::str_splitn::parse_iter_usage at line 274. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/methods/str_splitn.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":"clippy_lints/src/methods/str_splitn.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"80d69b9807f7c58ac0b4ed32011f28d17e2867f27bd8c2b870c5b467782816cd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_mir_build/src/builder/expr/as_temp.rs: compiler/rustc_mir_build/src/builder/expr/as_temp.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in Builder::as_temp at line 16. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_mir_build/src/builder/expr/as_temp.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":"compiler/rustc_mir_build/src/builder/expr/as_temp.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"7779b2a147cf7b7d03d2ea8ce11e36496540922ef2de8ac7f026d57bdcb7a495"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_lints/src/non_expressive_names.rs: clippy_lints/src/non_expressive_names.rs changed 2 times in last 90 days, max cyclomatic complexity 18 in SimilarNamesNameVisitor::check_ident at line 222. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/non_expressive_names.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":"clippy_lints/src/non_expressive_names.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb10ddb7163acf3bcdcc9e3ea794eb91b2c2fc18105d5e5ce8f49310e29c720c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_lints/src/operators/cmp_owned.rs: clippy_lints/src/operators/cmp_owned.rs changed 2 times in last 90 days, max cyclomatic complexity 17 in clippy_lints::operators::cmp_owned::check_op at line 38. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/operators/cmp_owned.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/operators/cmp_owned.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a1e43a9f5b9a2946c5e47388127d58eb45917e475b42fce830834dabcbb0af4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tools/clippy/clippy_lints/src/operators/cmp_owned.rs: src/tools/clippy/clippy_lints/src/operators/cmp_owned.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in clippy_lints::operators::cmp_owned::check_op at line 38. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/tools/clippy/clippy_lints/src/operators/cmp_owned.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/operators/cmp_owned.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"d29d8e77b30e50c172220586a4e8bb5a5085e2079d2defde58be540254a38bb6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_lints/src/casts/needless_type_cast.rs: clippy_lints/src/casts/needless_type_cast.rs changed 2 times in last 90 days, max cyclomatic complexity 17 in clippy_lints::casts::needless_type_cast::has_generic_return_type at line 129. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/casts/needless_type_cast.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":"clippy_lints/src/casts/needless_type_cast.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fc9462d361fd0e4028ad0760e1ae5dab51cab7994b5b8b3717cd5ea1c48b1d7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_lints/src/attrs/useless_attribute.rs: clippy_lints/src/attrs/useless_attribute.rs changed 2 times in last 90 days, max cyclomatic complexity 17 in clippy_lints::attrs::useless_attribute::check at line 10. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/attrs/useless_attribute.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":"clippy_lints/src/attrs/useless_attribute.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"42363d414591efd448f23b912a9718b18d36093790a76f7d902c031aa89c4764"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_lints/src/casts/cast_possible_truncation.rs: clippy_lints/src/casts/cast_possible_truncation.rs changed 2 times in last 90 days, max cyclomatic complexity 17 in clippy_lints::casts::cast_possible_truncation::apply_reductions at line 29. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/casts/cast_possible_truncation.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":"clippy_lints/src/casts/cast_possible_truncation.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cdd141d72ae127687aa07010256437e9b908e5579b52fe1d455de3cb4486662"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_lints/src/doc/too_long_first_doc_paragraph.rs: clippy_lints/src/doc/too_long_first_doc_paragraph.rs changed 2 times in last 90 days, max cyclomatic complexity 17 in clippy_lints::doc::too_long_first_doc_paragraph::check 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/doc/too_long_first_doc_paragraph.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":"clippy_lints/src/doc/too_long_first_doc_paragraph.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"412db87d72711b9de99156d45a63ea2f587938b90f29127abb525162099bee81"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_lints/src/floating_point_arithmetic/mul_add.rs: clippy_lints/src/floating_point_arithmetic/mul_add.rs changed 2 times in last 90 days, max cyclomatic complexity 17 in clippy_lints::floating_point_arithmetic::mul_add::check at line 32. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/floating_point_arithmetic/mul_add.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":"clippy_lints/src/floating_point_arithmetic/mul_add.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"dba45765bd52d654d1c60ff6be1a4d2c0042fb538355b093e19ea55bce10cc0d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_lints/src/methods/search_is_some.rs: clippy_lints/src/methods/search_is_some.rs changed 2 times in last 90 days, max cyclomatic complexity 17 in clippy_lints::methods::search_is_some::check at line 19. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/methods/search_is_some.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":"clippy_lints/src/methods/search_is_some.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"20892a110541a1564dff7c793d728819abb3a9c100e1961c9cac0e8ae6dc6064"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_symbol_mangling/src/export.rs: compiler/rustc_symbol_mangling/src/export.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in Ty::abi_stable_hash at line 57. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- compiler/rustc_symbol_mangling/src/export.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":"compiler/rustc_symbol_mangling/src/export.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"0207b78c1b4af762dc32043d7f1168b1ad2ad3c312dea69c5b89a822b1982c09"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_lints/src/methods/map_unwrap_or.rs: clippy_lints/src/methods/map_unwrap_or.rs changed 2 times in last 90 days, max cyclomatic complexity 16 in clippy_lints::methods::map_unwrap_or::check at line 21. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/methods/map_unwrap_or.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":"clippy_lints/src/methods/map_unwrap_or.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c8731b3ced1e5ef2687ce87ef7ddcd23ad3119f842164c1bfe044786cb2ceb9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/debuginfo/unwind.rs: src/debuginfo/unwind.rs changed 2 times in last 90 days, max cyclomatic complexity 16 in UnwindContext::add_function at line 117. 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 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/debuginfo/unwind.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/debuginfo/unwind.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b3d4be4c452d42911bd74b8f1dae57a3d02c455ab3fa12448c625d66e0f2faa"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/tools/rustfmt/src/parse/macros/cfg_select.rs: src/tools/rustfmt/src/parse/macros/cfg_select.rs changed 7 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is rustfmt_nightly::parse::macros::cfg_select::parse_items_from_cfg_select_inner at line 43), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(cfg_select): don\u0027t lose comments/attrs between \u0060=\u003E\u0060 and arm expr\u201D; \u201Cfix(cfg_select): don\u0027t use concise format when in-between comments exist\u201D; \u201Cfix: Add some extra heuristic checks for CfgSelectArm::double_block_inner\u201D; \u201Cfix: prevent rustfmt from removing necessary blocks in \u0060cfg_select!\u0060 arms\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/tools/rustfmt/src/parse/macros/cfg_select.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/tools/rustfmt/src/parse/macros/cfg_select.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"43f22e0392792c8187fe6bf7473bd6727cf1e2b59cbc1bf28f0cfac4d1fb23e1"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/tools/rustfmt/src/config/config_type.rs: src/tools/rustfmt/src/config/config_type.rs changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 3 (its worst body is rustfmt_nightly::config::config_type::is_stable_option_and_value at line 628), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201CRevert \u0022Fixes adjustment of max_width within macros\u0022\u201D; \u201CRevert \u0022Use saturating arithmetics for \u0060adjust_max_width\u0060\u0022\u201D; \u201Cfix(config): use saturating arithmetics in \u0060adjust_max_width\u0060\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/tools/rustfmt/src/config/config_type.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/tools/rustfmt/src/config/config_type.rs"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"883870e1b81bece145a80b1b916e1fbcfe12d170055e1c065323e0bb90db6fba"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/tools/rust-analyzer/crates/ide-completion/src/completions/mod_.rs: src/tools/rust-analyzer/crates/ide-completion/src/completions/mod_.rs changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 14 (its worst body is ide_completion::completions::mod_::complete_mod at line 15), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: complete \u0027main\u0027 \u0027lib\u0027 module in sub module\u201D; \u201Cfix: dedup raw-ident module name\u201D; \u201Cfix: escape keyword module name completions\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- src/tools/rust-analyzer/crates/ide-completion/src/completions/mod_.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-completion/src/completions/mod_.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"25263ecbf37f94b862ba13d9498f24e20a96bbba1b28a50acac58d4f1f47574a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: clippy_lints/src/matches/manual_filter.rs: clippy_lints/src/matches/manual_filter.rs changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 6 (its worst body is clippy_lints::matches::manual_filter::get_cond_expr at line 21), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201CRevert \u0022Remove indirection for \u0060Expr\u0060 in \u0060Body\u0060\u0022\u201D; \u201CFix clippy\u201D; \u201C  fix: [\u0060manual_filter\u0060] don\u0027t lint when the condition needs \u0060\u0026mut\u0060 access\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 19:23:44 \u002B00:00\u0027 --until=\u00272026-11-13 19:23:44 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/matches/manual_filter.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":"clippy_lints/src/matches/manual_filter.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"74c9bdc28815a3322eb9ec372400690dd3c21457239a4d50ea0e609e815aabd0"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 18 significant file(s) lose their only recent owner: src/tools/rust-analyzer/crates/ide-completion/src/context/analysis.rs, src/tools/rust-analyzer/crates/ide-completion/src/context.rs, src/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_documentation_template.rs, src/tools/rust-analyzer/crates/ide-diagnostics/src/handlers/missing_match_arms.rs, src/tools/rust-analyzer/crates/ide-completion/src/completions.rs, src/tools/rust-analyzer/crates/ide-completion/src/render/function.rs, src/tools/rust-analyzer/crates/ide-assists/src/handlers/inline_local_variable.rs, src/tools/rust-analyzer/crates/ide-assists/src/handlers/apply_demorgan.rs (\u002B10 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"bc5992551a617bb3d9acc472e24ddeb196d715c798792114e91b6b0ba081cfd8"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #2: If anonymized user #2 becomes unavailable, 15 significant file(s) lose their only recent owner: src/tools/rustfmt/src/imports.rs, compiler/rustc_ast/src/tokenstream.rs, compiler/rustc_mir_transform/src/dataflow_const_prop.rs, src/tools/clippy/clippy_utils/src/source.rs, src/tools/clippy/clippy_lints/src/attrs/mod.rs, compiler/rustc_mir_dataflow/src/framework/graphviz.rs, src/tools/miri/src/concurrency/vector_clock.rs, compiler/rustc_parse/src/parser/attr_wrapper.rs (\u002B7 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"5ff223b2b5372a585252b5b28e948aa82b1ee3d074c25a9f8ffeaad473434396"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #3: If anonymized user #3 becomes unavailable, 12 significant file(s) lose their only recent owner: library/compiler-builtins/libm/src/math/rem_pio2_large.rs, library/compiler-builtins/libm-test/src/builtins_wrapper.rs, library/compiler-builtins/libm-test/src/run_cfg.rs, src/tools/run-make-support/src/command.rs, library/compiler-builtins/libm-test/src/generate/spaced.rs, library/core/src/slice/sort/stable/quicksort.rs, library/compiler-builtins/crates/libm-macros/src/parse.rs, library/compiler-builtins/libm/src/math/fmaf16.rs (\u002B4 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"cb6edc4c9a44cc025a11685e91d47939b0575f6fcf2e2a2044699acdbe07c629"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #4: If anonymized user #4 becomes unavailable, 11 significant file(s) lose their only recent owner: src/tools/rust-analyzer/crates/tt/src/storage.rs, src/tools/rust-analyzer/crates/ide-assists/src/handlers/auto_import.rs, src/tools/rust-analyzer/crates/ide/src/annotations.rs, src/tools/rust-analyzer/crates/mbe/src/expander/transcriber.rs, src/tools/rust-analyzer/crates/hir/src/attrs.rs, src/tools/rust-analyzer/crates/hir-ty/src/next_solver/consts.rs, src/tools/rust-analyzer/crates/stdx/src/lib.rs, src/tools/rust-analyzer/crates/hir-def/src/upvars.rs (\u002B3 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"aead3902b208bb815a0f86fdd13e9e48ff9c391ba4150594f9d2b3c8f8b4efd9"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #5: If anonymized user #5 becomes unavailable, 10 significant file(s) lose their only recent owner: src/tools/miri/src/borrow_tracker/tree_borrows/tree.rs, compiler/rustc_middle/src/mir/interpret/allocation.rs, compiler/rustc_graphviz/src/lib.rs, compiler/rustc_const_eval/src/interpret/operator.rs, compiler/rustc_middle/src/mir/interpret/value.rs, src/tools/miri/src/concurrency/scheduler.rs, library/std/src/net/socket_addr/tests.rs, compiler/rustc_const_eval/src/interpret/visitor.rs (\u002B2 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9c2a0eb6e5f0ab50ca300a1458fbba84666c3a6e685563410fd9ba9e259917a1"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #6: If anonymized user #6 becomes unavailable, 9 significant file(s) lose their only recent owner: src/tools/rust-analyzer/crates/hir-expand/src/files.rs, src/tools/rust-analyzer/crates/hir-def/src/macro_expansion_tests/mod.rs, src/tools/rust-analyzer/crates/hir-expand/src/proc_macro.rs, src/tools/rust-analyzer/crates/hir-ty/src/next_solver/fulfill.rs, src/tools/rust-analyzer/crates/ide-diagnostics/src/handlers/unresolved_method.rs, src/tools/rust-analyzer/crates/stdx/src/variance.rs, src/tools/rust-analyzer/crates/hir-def/src/dyn_map.rs, src/tools/rust-analyzer/crates/hir-def/src/src.rs (\u002B1 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"80106d065e33a9fc911cb986d0d2c5818ffc70a76c2ea85a6d0f61e25df93071"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #7: If anonymized user #7 becomes unavailable, 8 significant file(s) lose their only recent owner: src/bootstrap/src/core/build_steps/toolstate.rs, src/bootstrap/src/core/build_steps/gcc.rs, compiler/rustc_mir_build/src/builder/coverageinfo.rs, compiler/rustc_codegen_llvm/src/coverageinfo/mapgen/covfun.rs, src/bootstrap/src/cli_main.rs, compiler/rustc_codegen_llvm/src/coverageinfo/mapgen.rs, compiler/rustc_codegen_llvm/src/coverageinfo/mod.rs, src/bootstrap/src/utils/channel.rs. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"a3cdd0ad1b6b53bf2088092c1766d00d3480a627e125e0ac211d781626924c64"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #8: If anonymized user #8 becomes unavailable, 7 significant file(s) lose their only recent owner: src/etc/debugger_tester/common.py, src/etc/lldb_lookup.py, src/etc/debugger_tester/lldb/check_lldb.py, src/etc/debugger_tester/lldb/from_lldb.py, src/etc/debugger_tester/lldb/batchmode.py, src/etc/debugger_tester/gdb/check_gdb.py, src/etc/debugger_tester/gdb/from_gdb.py. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9300d58f5c8957a1cf1730863b9978005763e92f0a05509af7ca4679067a38ee"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #9: If anonymized user #9 becomes unavailable, 7 significant file(s) lose their only recent owner: compiler/rustc_codegen_gcc/build_system/src/config.rs, compiler/rustc_codegen_gcc/build_system/src/utils.rs, library/std/src/os/windows/net/stream.rs, library/std/src/os/linux/fs.rs, library/std/src/os/windows/net/listener.rs, compiler/rustc_codegen_gcc/src/back/write.rs, compiler/rustc_codegen_gcc/tools/generate_intrinsics.py. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"4e718b543b0f824206f10a8426115bded7614800e49841040e0014b4c176b542"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #10: If anonymized user #10 becomes unavailable, 6 significant file(s) lose their only recent owner: src/tools/rust-analyzer/crates/ide-db/src/defs.rs, src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/errors.rs, src/tools/rust-analyzer/crates/test-utils/src/lib.rs, src/tools/rust-analyzer/crates/intern/src/gc.rs, src/tools/rust-analyzer/crates/ide/src/inlay_hints/closure_captures.rs, src/tools/rust-analyzer/crates/rust-analyzer/src/session.rs. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"41cf2518341b2ca815bb0932c6b1221bf4ea8ce1fb549b6f1dc7e1e5d3447343"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #11: If anonymized user #11 becomes unavailable, 6 significant file(s) lose their only recent owner: compiler/rustc_builtin_macros/src/deriving/generic/mod.rs, compiler/rustc_builtin_macros/src/format_foreign/printf/mod.rs, compiler/rustc_builtin_macros/src/deriving/coerce_pointee.rs, compiler/rustc_builtin_macros/src/deriving/default.rs, compiler/rustc_builtin_macros/src/deriving/clone.rs, compiler/rustc_builtin_macros/src/deriving/partial_eq.rs. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"f8f7479e430bce061dd0a03111f7597e44dbd622f8455c1e6d40bde063d55bcb"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #12: If anonymized user #12 becomes unavailable, 6 significant file(s) lose their only recent owner: src/ci/citool/src/analysis.rs, library/std_detect/src/detect/os/linux/aarch64.rs, src/ci/citool/src/main.rs, src/tools/compiletest/src/executor.rs, src/ci/citool/src/test_dashboard.rs, src/ci/citool/src/jobs/tests.rs. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"dcf7bfc89bf7ee859925877bf3136a3380849ced460db97ba50bf9a06bb2e112"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #13: If anonymized user #13 becomes unavailable, 6 significant file(s) lose their only recent owner: src/tools/clippy/clippy_lints/src/loops/manual_memcpy.rs, src/tools/clippy/clippy_lints/src/operators/identity_op.rs, compiler/rustc_type_ir/src/sty/consts.rs, compiler/rustc_type_ir/src/sty/mod.rs, library/core/src/num/bfloat.rs, src/tools/clippy/clippy_lints/src/methods/utils.rs. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"81a35708d177524f7d7157c3a666d409d1bffe33d1442bf6d781328fb7320932"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #14: If anonymized user #14 becomes unavailable, 6 significant file(s) lose their only recent owner: library/std/src/error.rs, library/std/src/sys/args/windows.rs, library/std/src/sys/pal/windows/api.rs, library/core/src/slice/sort/select.rs, library/std/src/sys/path/windows.rs, compiler/rustc_driver_impl/src/signal_handler.rs. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"cda6b2c837d72640c19f4faaa735d77f3505a6264128920e481bd1aa9626d5ac"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #15: If anonymized user #15 becomes unavailable, 5 significant file(s) lose their only recent owner: library/stdarch/crates/core_arch/src/s390x/vector.rs, compiler/rustc_codegen_cranelift/src/intrinsics/llvm_x86.rs, library/core/src/num/complex.rs, library/stdarch/crates/stdarch-test/src/disassembly.rs, compiler/rustc_target/src/callconv/powerpc.rs. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"3ad953e9dd66d9c1c473ba1f95684228408868e37c2edc078c0af2cbaeff9875"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #16: If anonymized user #16 becomes unavailable, 5 significant file(s) lose their only recent owner: library/core/src/io/cursor.rs, library/alloc/src/io/util.rs, library/alloc/src/io/mod.rs, library/alloc/src/io/buffered/mod.rs, library/alloc/src/io/buffered/bufreader/buffer.rs. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"a27ad95691e237aff88b2e403b032d913583ad285a1f1e8f6ba54f63cd81e06a"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #17: If anonymized user #17 becomes unavailable, 5 significant file(s) lose their only recent owner: src/tools/rustfmt/src/rustfmt_diff.rs, src/tools/rustfmt/src/emitter/json.rs, src/tools/rust-analyzer/editors/code/src/util.ts, src/tools/rust-analyzer/editors/code/src/new_project.ts, src/tools/rust-analyzer/editors/code/src/toolchain.ts. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"4b3ba15a420e7cec10ce625951b1eba80aeea54bfad4d523b33a2cb7dd51df8b"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #18: If anonymized user #18 becomes unavailable, 4 significant file(s) lose their only recent owner: library/compiler-builtins/libm-test/src/mpfloat.rs, library/compiler-builtins/libm-test/src/generate/case_list.rs, library/compiler-builtins/crates/api-list-common/src/lib.rs, library/compiler-builtins/libm/src/libm_helper.rs. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"b3dbfa47f4c48737721a14b7f15e4a6271bb976b8cd60648ab1a8c5905ead699"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #19: If anonymized user #19 becomes unavailable, 4 significant file(s) lose their only recent owner: src/tools/rust-analyzer/crates/syntax/src/syntax_editor.rs, src/tools/rust-analyzer/crates/syntax/src/syntax_editor/edit_algo.rs, src/tools/rust-analyzer/crates/syntax/src/ast.rs, src/tools/rust-analyzer/crates/syntax/src/syntax_editor/mapping.rs. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0ee75fec365a1480aa68263af6723668f5792ac599c8e907ae16705a7830718d"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #20: If anonymized user #20 becomes unavailable, 4 significant file(s) lose their only recent owner: library/std/src/os/xous/ffi.rs, compiler/rustc_incremental/src/diagnostics.rs, library/compiler-builtins/compiler-builtins/src/int/mul.rs, compiler/rustc_codegen_gcc/src/debuginfo.rs. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ecadb09ce2d58c2da6cbb7dd471b2f9186091d08913df1ce3bb07bb462edcb18"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #21: If anonymized user #21 becomes unavailable, 4 significant file(s) lose their only recent owner: library/std/src/sys/pal/sgx/abi/usercalls/mod.rs, library/std/src/sys/sync/unsafe_list.rs, library/std/src/sys/pal/sgx/waitqueue/mod.rs, library/std/src/sys/sync/unsafe_list/tests.rs. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"40b8d48dd71e57751536d094c66e9ec5643fa411d1de51f5a216cece214838a5"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #22: If anonymized user #22 becomes unavailable, 4 significant file(s) lose their only recent owner: compiler/rustc_data_structures/src/vec_cache.rs, library/core/src/iter/adapters/chain.rs, library/core/src/iter/adapters/copied.rs, compiler/rustc_middle/src/query/caches.rs. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"63cc8e51fda9eb3328e7fe0e801ca67212a348420c8a92823ac6ee85ae7d2c8d"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #23: If anonymized user #23 becomes unavailable, 3 significant file(s) lose their only recent owner: library/stdarch/crates/core_arch/src/x86_64/amx.rs, library/stdarch/crates/stdarch-verify/src/lib.rs, library/stdarch/crates/stdarch-gen-arm/src/fn_suffix.rs. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"b1e38b8a07fd526e4aef9af35d96903762d79ddeb531ee377ec25eb44c34b4ad"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #24: If anonymized user #24 becomes unavailable, 3 significant file(s) lose their only recent owner: compiler/rustc_middle/src/mir/interpret/allocation/init_mask.rs, compiler/rustc_attr_ir/src/attribute_docs.rs, compiler/rustc_attr_ir/src/stability.rs. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"30ef461e709b841e0736aab2f3827dc827b4291dede9da9b7684066e5f4bf55f"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #25: If anonymized user #25 becomes unavailable, 3 significant file(s) lose their only recent owner: compiler/rustc_parse/src/parser/token_type.rs, compiler/rustc_parse/src/parser/expr/diagnostics.rs, src/librustdoc/clean/blanket_impl.rs. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9601a08208c0d4d6c4f5b5904a6bc5fed2a10e3b99b8b61798b19513c5faec8e"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #26: If anonymized user #26 becomes unavailable, 3 significant file(s) lose their only recent owner: compiler/rustc_borrowck/src/session_diagnostics.rs, compiler/rustc_driver_impl/src/highlighter.rs, library/core/src/async_iter/async_iter.rs. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"c32e4fec22c1e4d4db6f7d8f779e0d3153b99345561cf6f74611ab9e435e71ba"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #27: If anonymized user #27 becomes unavailable, 3 significant file(s) lose their only recent owner: src/tools/rust-analyzer/crates/ide-assists/src/handlers/replace_qualified_name_with_use.rs, src/tools/rust-analyzer/crates/cfg/src/tests.rs, src/tools/rust-analyzer/crates/cfg/src/lib.rs. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ff235b91b3d3fb867fe2ac5be6e32eb6f508514bbcb7da4e0269f0322e688297"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #28: If anonymized user #28 becomes unavailable, 3 significant file(s) lose their only recent owner: library/compiler-builtins/libm/src/math/support/big/tests.rs, library/compiler-builtins/libm/src/math/support/modular.rs, library/compiler-builtins/libm/src/math/support/int_traits/narrowing_div.rs. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"cdeacfc3b96783313be6181575b1a5d351f6ee968773b110e66e47e9361bc43d"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #29: If anonymized user #29 becomes unavailable, 3 significant file(s) lose their only recent owner: library/compiler-builtins/compiler-builtins/src/int/specialized_div_rem/mod.rs, compiler/rustc_target/src/asm/loongarch.rs, library/compiler-builtins/compiler-builtins/src/int/leading_zeros.rs. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"95631f6206f78bf9bae3705232d0d511b80bd184ff3267fc09286b8a5b96d5a8"}},{"ruleId":"D16","level":"note","message":{"text":"Further sole-owners (lower concentration): 89 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 (284 single-owned of 2565 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; 2565 of the 6286 production source files in this repository met that bar). They are anonymized user #30 (2 file(s)), anonymized user #31 (2 file(s)), anonymized user #32 (2 file(s)), anonymized user #33 (2 file(s)), anonymized user #34 (2 file(s)), anonymized user #35 (2 file(s)) (\u002B83 more) \u2014 spread or document their files in the same way, at lower priority than the named off-boarding risks above. The files folded here: src/tools/rust-analyzer/crates/ide-assists/src/handlers/unwrap_return_type.rs, src/tools/rust-analyzer/crates/ide-assists/src/handlers/promote_local_to_const.rs, compiler/rustc_data_structures/src/profiling.rs, library/core/src/iter/traits/collect.rs, library/std/src/num/f128.rs, library/std/src/num/f16.rs, src/tools/miri/priroda/src/frontend/dap.rs, src/tools/miri/priroda/src/frontend/cli.rs (\u002B93 more)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6eac528f2429e724e1a97ed868f79eefbcf1888dab4af9a9e673429369bb5b2f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Some of them shouldn\u0027t be. \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-fulldeps/pprust-parenthesis-insertion.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"716389cb3b0d5567c9e9f68f6c940105df646d412ec478d748bcb9506c031040"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: no parentheses 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":"tests/ui-fulldeps/pprust-parenthesis-insertion.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"707d4f3c063b93bc7833886cc7421066c8b4e54286e0e965d95311dd579b1e1d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: pretty-printer produces invalid syntax. \u00602 \u002B 2 as T \u003C U\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/ui-fulldeps/pprust-parenthesis-insertion.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"5076c9fe9c08f25b0c2ed3da7c50919af285fcd447e8e9d2aecc9c40f0b21f7f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: pretty-printer produces invalid syntax. \u0060if (let _ = () \u0026\u0026 Struct {}.x) {}\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/ui-fulldeps/pprust-parenthesis-insertion.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"472de72dc671d1f735fc9fba35a892245a1d0d921bbf712c5e93d58bf3ba4c13"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: pretty-printer produces invalid syntax. \u0060for _ in 1..{ 2 } {}\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/ui-fulldeps/pprust-parenthesis-insertion.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a84406a360b1d8bb429007bee14e14b5deee3dcfcb41ac0c0b3567b92598140"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: pretty-printer loses the attribute. \u0060{ let Struct { field } = s; }\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/ui-fulldeps/pprust-parenthesis-insertion.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"17ef0e91e169b47d02db46105f18da7a20c64970788bec409127fb81890a4919"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: pretty-printer turns this into a range. \u00600..to_string()\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/ui-fulldeps/pprust-parenthesis-insertion.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4611cba968f20dc1205d694a6870446a137d72762b3da9c6371460ae9986574"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(rustc_public): add \u0060read_ptr\u0060 to \u0060Allocation\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/ui-fulldeps/rustc_public/check_allocation.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec4c4822bcabaf96bcf08fc465f3a5c29d6260a7275b015dae18030cd33764e3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We are currently missing primitive type methods and trait implementations for external \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-fulldeps/rustc_public/check_crate_defs.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"14d1c3142021c1494131faba543eff7512aa9d617abba91d59c9934b9d6e546a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(ada4a): this will currently lint, and suggest adding a derive, even though ther\u0027s already \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-fulldeps/internal-lints/missing-generic-type-visitable-derive.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"d329d4bd91ffcfaf6e441c5ce1033af061fa50c3f76afe757468eac8f0e54138"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: both \u0060feat_bar\u0060 and \u0060feat_moo\u0060 are needed to pass this test, \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/unstable-feature-bound/unstable-feature-bound-two-error.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba78771e4a338d765d715053bf9c987e6ae844826f7ad64221e5e6a98fb67b55"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME(tiif): we haven\u0027t allowed marking trait and impl method 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/ui/unstable-feature-bound/unstable_inherent_method.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"008ec6dce4ad1864b73bd4787cd46c31b31bb47fd10275d6c4667e6604951c68"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: https://github.com/rust-lang/rust/issues/112504"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/unsafe/unsafe_op_in_unsafe_fn/wrapping-unsafe-block-sugg.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b2fa8d52b64d8b7bc18eba6d059f8b2e94f8cc94289941ffd67e9de2d7af679"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: ~^ NOTE an unsafe function restricts its caller, but its body is safe by default \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/unsafe/unsafe_op_in_unsafe_fn/wrapping-unsafe-block-sugg.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"0022bf56b7594215b0c0dbb83d5b60779204098fae5f2134eb6523db924ead09"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment repeated across 49 files: The identical FixmeComment appears in 49 files (49 occurrences) \u2014 almost certainly one boilerplate line from a single migration or decision, not 49 independent debts. Fix the systemic cause once rather than file-by-file. Text: \u0022// FIXME(static_mut_refs): use raw pointers instead of references\u0022. Source code is not a task system: track the cleanup where tasks live. (Every occurrence still counts toward the score and metrics.)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/union/union-drop-assign.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cc02ecad6b04f9a724df15511107c1eb723661d9be916f544dca6f643e83cb0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment repeated across 77 files: The identical FixmeComment appears in 77 files (77 occurrences) \u2014 almost certainly one boilerplate line from a single migration or decision, not 77 independent debts. Fix the systemic cause once rather than file-by-file. Text: \u0022//@ build-pass (FIXME(62277): could be check-pass?)\u0022. Source code is not a task system: track the cleanup where tasks live. (Every occurrence still counts toward the score and metrics.)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/uninhabited/privately-uninhabited-dead-code.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"79eb05359f1a4444a2889605ee7fcb2314eee235e83126f7ec32ab05f624bf32"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(jieyouxu): this test is NOT run-rustfix because this test contains conflicting \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/typeck/issue-112007-leaked-writeln-macro-internals.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"b86c39c3f9e9890351c8257b1f6b92d4153bf4f2031c4dbfb6ebb226af1d8aec"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(jieyouxu): this test is currently NOT run-rustfix because there are conflicting \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/typeck/question-mark-operator-suggestion-span.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"38ab5a0e02a11412d27b144f7226b1fc2ce7c198af210cf822b7261ba80cf243"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // type E: _; // FIXME: make the parser propagate the existence of \u0060B\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/ui/typeck/typeck_type_placeholder_item.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"25e96ece8d9c44d44752227bc9467da10227e3451acd205ef45744a20cc8d05e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(type-alias-impl-trait): We could probably make this 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":"tests/ui/type-alias-impl-trait/nested-tait-inference.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc205b04ec8fb7141409b75f921e4a92d65a31ba65da0e2c408323dd4bc9fa21"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //FIXME(oli-obk): these currently cause cycle errors \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/type-alias-impl-trait/not_a_defining_use.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"590961c0ec76faadea7a3a16510e8ecb4bf8799ab18922e57affe9dad625c27c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this is ruled out for now but should 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":"tests/ui/type-alias-impl-trait/type-alias-impl-trait-fn-type.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f8b1854aecf6bf85174d2c07429950ce9ec1ea8e6f693c1f1e402fb8eb1647a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(type_alias_impl_trait): What does this test? This needs a comment \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/type-alias-impl-trait/coherence/coherence_generalization.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"95aaeb28370a3cfb6c591c9af72fee18ae99ead6a08efdef41d6347b18528c03"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: these are sub-optimal, ideally the \u0060for\u003C...\u003E\u0060 would be printed. \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/type/type-name-basic.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4aa284cba48f021b7e18d64bdb65ff95f53941cfc6898deb473b12f4a61b23a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //FIXME(compiler-errors): This fixup should suggest the full box path, not just \u0060Box\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/ui/type/type-recursive-box-shadowed.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"51760a02b80d903e802d3bff2446fcda8cfee5aeef09566975ce8721917c30da"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: confusing diagnostic because \u0060not\u0060 can be a binding \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/type/pattern_types/bad_pat.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"d663864a943a23d1738427dcffe46f270104514d13b953299588cc4c8eec2bd7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: reject with a type mismatch \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/type/pattern_types/bad_pat.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"855649fb9d08bae6d675a458b6ff722bb3ae8e3dd638b4f75715d110c0677531"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //@ ignore-windows FIXME: We get an extra E0283 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/ui/traits/issue-77982.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4328f005d8fa14b95c0c46b5be005cd91b6b6b477955e6cc8c8a2661dd19a96"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //@ ignore-windows FIXME: We get an extra E0283 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/ui/inference/issue-71584.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a4efcb439030d914f7e70f41a8ab7ff8e1485a84fa89cbd0be695e54061debc"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(eddyb) shorten the name so windows doesn\u0027t choke on 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":"tests/ui/traits/object/with-self-in-projection-output-repeated-supertrait.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd154a2fdc1f49e60c99b76132dff69e98f03ff023d49bc39a00f91031675405"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //! FIXME(non_lifetime_binders): provide better diagnostics. Should non-lifetime binders \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/traits/non_lifetime_binders/closure-expected-sig-bound-type-154537.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"29030c0b43901e8122ea799d355bbf73081ecba4595cde4114417416f30a098a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(-Znext-solver): These error messages are horrible and some of them \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/traits/next-solver/dyn-incompatibility.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"72d84a35e4004850716adb7de9ff5a74e016dad690c330e9f0d0ef41e2024204"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#149379): This was previously accepted by the next-solver, thanks to its"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/traits/next-solver/lazy-nested-obligations-2.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"5636b6fb05897e2905ce2270f3ae37ae126c1d3ac0a5b18fbab9b5f752da2c70"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this probably should compile and we shall fix duplicate \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/traits/next-solver/overflow/dont-drop-obligations-on-overflow-2.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b62fefa14fe805932b1f1c84760909a74fd33867d6ebdfc66b6a93a699e47e7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: The diagnostics here are suboptimal. \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/traits/next-solver/diagnostics/overflowing-opaque-incorrectly-unconstrained.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cae17d162db5f2b5214d9186957806cd32b8cbb1b21f3f711771b8d7f172155"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: This impls is necessary so that the impl above is well-formed. \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/traits/next-solver/cycles/fixpoint-rerun-all-cycle-heads.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad3b54ce304301581806eb3597617e397f49709e6e23d7724dbc96003d47ecff"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(trait-system-refactor-initiative#305): Now, actually, the first"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/traits/next-solver/assembly/item-bound-eq-modulo-placeholder-constraint.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"00a3e339b183d5bcd641cfaaacb2f49c00f46f08418b39bce2a82fb07e652beb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(deferred_projection_equality): add a test that this is true during coherence \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/traits/next-solver/alias-relate/alias_eq_cant_be_furthur_normalized.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e3c5d19ac213131a350d796f5e86ff412da027e7c24104156fe065b232ebe0a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const_trait_impl): Somehow emit \u0060the trait bound \u0060T: const Trait\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/ui/traits/const-traits/unsatisfied-const-trait-bound.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6dd32a42eb7a292001990defe56eeceb00f2bea9955aea87f31d5ffe00130f3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const_trait_impl): Instead of suggesting \u0060\u002B const Trait\u0060, suggest \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/traits/const-traits/unsatisfied-const-trait-bound.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bed8a116e49b9f804806ad1386209b96259309f93fe2685c735bb63f83a373f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment repeated across 25 files: The identical FixmeComment appears in 25 files (35 occurrences) \u2014 almost certainly one boilerplate line from a single migration or decision, not 35 independent debts. Fix the systemic cause once rather than file-by-file. Text: \u0022// FIXME\u0022. Source code is not a task system: track the cleanup where tasks live. (Every occurrence still counts toward the score and metrics.)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/threads-sendsync/sync-send-iterators-in-libcore.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"293665e82a754f08244fd474825b249ffde2eda24b648a626a5ed1984219d210"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //@ ignore-windows FIXME(134939): thread_local \u002B no_mangle doesn\u0027t work 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/ui/threads-sendsync/thread-local-extern-static.rs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"63d23bc750c6c46ea9ae01e825ef4bc18e4c6b66078efc628645435ca07ce74d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //@ ignore-windows FIXME(134939): thread_local \u002B no_mangle doesn\u0027t work 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/ui/feature-gates/feature-gate-cfg-target-thread-local.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9eacb209b44c1edd5c78460aafc45920d64694957127f59249736c74c2c7027"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#147881): *disable* the feature again for minicore as otherwise that will fail to build."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/target-feature/abi-incompatible-target-feature-flag-enable.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"aca82d98c923a752dc244186ea3eb1464a8b3d2523f9a764921b06c853ca9165"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#147881): *disable* the features again for minicore as otherwise that will fail to build."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/target-feature/tied-features-cli.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac8529995c358f02edf3b97b63bac75216f78d8e71282afc506308a39a87ff6f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#147881): *disable* the features again for minicore as otherwise that will fail to build."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/target-feature/tied-features-no-implication-1.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"755668075e2f3a0c0b9648244f691261c7e83a53ca80d86db8baeed0b84fd61c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#147881): *disable* the features again for minicore as otherwise that will fail to build."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/target-feature/tied-features-no-implication.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"c23ce416f82c65c346088ca56721a9357c3953ab56a7aeaf6d89de18b1c20395"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(eddyb) this was supposed to be \u0060RefMutZst\u0060 with \u0060\u0026mut []\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/ui/symbol-names/const-generics-structural-demangling.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"e618590f09099126475f789a2346192458561c63890fb05fdcd66bab2aeb9791"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK(eddyb) the full mangling is only in \u0060.stderr\u0060 because we can normalize \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/symbol-names/const-generics-structural-demangling.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"e36000ac35e8563759edf26dfbdad643ba3b9a61378a59b59fcd6c045ac97570"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK(eddyb) the full mangling is only in \u0060.stderr\u0060 because we can normalize \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/symbol-names/const-generics-structural-demangling.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0fc99d60f55463da4d78b4754294c0e26d5116aa9471701074f2505af9951b7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Can\u0027t use \u0060#[rustc_dump_symbol_name]\u0060 on the \u0060foo\u0060 call to check its symbol, \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/symbol-names/const-in-global-asm.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"6830415aaa20e08aa9cea3fa53d254624316cb15e8e811f90a7bf362e808a391"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //FIXME(#114050) ~| HELP use \u0060Option::as_ref\u0060 to convert \u0060Option\u003CString\u003E\u0060 to \u0060Option\u003C\u0026String\u003E\u0060"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/suggestions/copied-and-cloned.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bffe9a66979cbed79e625a33fde548e2b99e7b00294865da063629f7e85af4c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: the following cases need to suggest more things to make users reach a working end state. \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/suggestions/impl-on-dyn-trait-with-implicit-static-bound-needing-more-suggestions.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"93b6c43e322bcefc9bdab4fb310c7fe2a5e25e6c96f70037bc939e5646e9381a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#96332): We should be able to suggest a fix and automatically fix."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/suggestions/impl-on-dyn-trait-with-implicit-static-bound.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"54cc837910c424c721e6e9ea813004442e7ba4b26789cb77b43c8640ae82106a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Re-enable this test once we support choosing \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/suggestions/incompatible-types-in-try-expression-59756.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9dc5cbac1951e6a5a98d4d79034b8fd9bf8e047f86642ab16617a9e0aa30d7b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This case doesn\u0027t really check that \u0060from_be\u0060 is a valid function in \u0060i32\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/ui/suggestions/let-binding-init-expr-as-ty.rs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eb4235e1a0a31b8a003375ea46ec340bf1b7838476e130e55f431e846cfc759"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this should also suggest a function pointer, as the closure is non-capturing \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/suggestions/unnamable-types.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"13c20365a4e72ef38ec2ffb7804518629097658747baf73afe3311f2a3970bb3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: would really like a suggestion here too \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/suggestions/dont-suggest-ref/duplicate-suggestions.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcf28863ecbb6d3905df4518244d5ecc37088fd6a17d735336846a19b7fdb5e3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: would really like a suggestion here too \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/suggestions/dont-suggest-ref/duplicate-suggestions.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"3312e15eba21e98bbdb8ad4f2df9a4bb36b5a7a1e40501aabf2c368e9df05b04"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: would really like a suggestion here too \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/suggestions/dont-suggest-ref/simple.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"60a2d2f6d4048e1b1f9c0fed9dd2f7a75122371cc6ad104d34bb3624baeaf5c4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: would really like a suggestion here too \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/suggestions/dont-suggest-ref/simple.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"03c5836bbe5715659cd1cf854122e41a1529dddc8f5d12250d424bd4f5fb7979"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: would really like a suggestion here too \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/suggestions/dont-suggest-ref/simple.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fe657fef088f0c5ad3034195809d30f152933c70658b16c4e853ab8dc037db2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: should suggest removing \u0060ref\u0060 too \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/suggestions/dont-suggest-ref/move-into-closure.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"27e519799c207143fcbce587cbaa1361313279ba55cd63d36ae2cf1c6cea7428"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: should suggest removing \u0060ref\u0060 too \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/suggestions/dont-suggest-ref/move-into-closure.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f6fb887e5a696d6ccbfec3af4051c3fb147560b46e92351a677c747be03899d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: should suggest removing \u0060ref\u0060 too \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/suggestions/dont-suggest-ref/move-into-closure.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"a78f32f4f138d274a865739a1db7c6676839a722228d99aaf69aba52bcc73afa"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: should suggest removing \u0060ref\u0060 too \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/suggestions/dont-suggest-ref/move-into-closure.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fc68f229ad65d3d3d2b4ebae833fe328d830a16f6a7f8f4bbdd57e5b4d94a5a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: should suggest removing \u0060ref\u0060 too \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/suggestions/dont-suggest-ref/move-into-closure.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"a972a04eef7a7aa685960a6de75a5b96d9543cac3c47167d13775915417b1803"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: should suggest removing \u0060ref\u0060 too \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/suggestions/dont-suggest-ref/move-into-closure.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"17fca9aa5f7d65ad9233fd58b907fc38c9c51095659b51bfd4efb22d9c511987"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: should suggest removing \u0060ref\u0060 too \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/suggestions/dont-suggest-ref/move-into-closure.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b18800f76e6f77196a6a94abfc907d7f2a7a6e160ce3e4f89830aca87539756"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: should suggest removing \u0060ref\u0060 too \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/suggestions/dont-suggest-ref/move-into-closure.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"2efa88015e8b76e036d5305b210acf72a8068e1975cdb5dc9b35832d24bbc6e8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: should suggest removing \u0060ref\u0060 too \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/suggestions/dont-suggest-ref/move-into-closure.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c794884c759a0e4339cf9129bba438aa1981c1829b89be29314ab88c86a24d2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: should suggest removing \u0060ref\u0060 too \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/suggestions/dont-suggest-ref/simple.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"66540a97143300171ed33a088a5c72b20f589a0a6fda9c47c53f2380889db026"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: should suggest removing \u0060ref\u0060 too \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/suggestions/dont-suggest-ref/simple.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"295255b3bfd436917e8a71306e1cbcb77b2a786afd80ed9410d265fadcd08e15"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: should suggest removing \u0060ref\u0060 too \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/suggestions/dont-suggest-ref/simple.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a66214ff95c30214382154abfe55c3c7101bfa943917012f4f7f4dcd1e0abce"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: should suggest removing \u0060ref\u0060 too \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/suggestions/dont-suggest-ref/simple.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"f146accf7738efae4cba7155cd3c9a869ee2b75f9c02e6cf1a1e33608b6784a7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: should suggest removing \u0060ref\u0060 too \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/suggestions/dont-suggest-ref/simple.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a7150538db09a33f1fd4a02b3aac4ce182993b534c119b7e105eaa2f13f4eda"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: should suggest removing \u0060ref\u0060 too \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/suggestions/dont-suggest-ref/simple.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5c4f402fe2676ac1a176c1e030af29e9bc5110eb588818701b90564c9f08c3e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: These should have suggestions. \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/suggestions/dont-suggest-ref/simple.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"007b15995768d368ed969a23ff037f2e76e77d439fcdce6e74cc25518fb1d716"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //@ ignore-emscripten (FIXME: test hangs on emscripten) \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/std/thread-sleep-ms.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"a643a044c304309b16a8950e5d8217ff9e688bc5f4af142acb57c93fd76bfa84"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this function should not suggest the \u0060foo\u0060 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/ui/stability-attribute/issue-109177.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3f5e5281ded1328f4fd656d66bc1c2bca07153bb474867d646366dfa8f84dbe"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //! FIXME(splat): The 255 argument limit is a temporary performance 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":"tests/ui/splat/splat-255-limit-fail.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c5873cd58da563b10f18fe19c446181d95513084777235159df91534304c6ac"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //! FIXME(splat): The 255 argument limit is a temporary performance 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":"tests/ui/splat/splat-255-limit-pass.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8b114a0d312dec48388a6f0700a32729dc2bd9910f2b85a6cae069a5f709e0a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(splat): Some errors are reported on the callee, but they would be more ergonomic on 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/splat/splat-dyn-asref-tuple-fail.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4f6b139c4af13fdad7f9f6bae83b29ad49daea2120631545ab7471980e21155"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(rustfmt): the attribute gets deleted by rustfmt \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/splat/splat-fn-ptr-generic.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"49614d6850368bb8a6bcb31c31f8356188391e3eecd2911e94072c670f48a21e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(rustfmt): the attribute gets deleted by rustfmt \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/splat/splat-fn-ptr-ptr-tuple.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"34fad8afb633b00b513e6250d7351a09beb8a1b775debafaa5bbec032b16ab1e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(rustfmt): the attribute gets deleted by rustfmt \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/splat/splat-fn-ptr-rust-call.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e610564769e2c6dba8bdaa88310357f9ead06c618bcbb466b3242e732d6cf5c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(rustfmt): the attribute gets deleted by rustfmt \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/splat/splat-fn-ptr-tuple-const.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"596b7a2feb62e0f1d47f47b7b91e4b4f20404e6912885f3d37ec95fae4a840f6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(rustfmt): the attribute gets deleted by rustfmt \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/splat/splat-fn-ptr-tuple-fail.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"c45594aa7897c24f0d10d62a93f395d26756ecd2fa3fe5cba0c7ca3fe9b32a6f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(rustfmt): the attribute gets deleted by rustfmt \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/splat/splat-fn-ptr-tuple.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"5179632ad51d7d76b686d718965f22c870b1d2e3de11990b3cc505b5cdf9b518"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(rustfmt): the attribute gets deleted by rustfmt \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/splat/splat-mangling.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"88e70be343dcd5278b8d2f136471a0985b81c5fdc86611dc45792d216c89f741"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(unused_variables): This is obviously used \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/splat/splat-fn-ptr-generic.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5c0da207d6a4ae82e6d9f674639bffc1909fadf8c5fd6e8cd0e491f2ac277a1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(unused_variables): This is obviously used \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/splat/splat-fn-ptr-ptr-tuple.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b211352f55ebe3509379eaf71a7cf4aa72dd6459a9e09514900085b2041089e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(unused_variables): This is obviously used \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/splat/splat-fn-ptr-tuple.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"60dfe8b71798c1309601e196501f078be9e66d2c31ad47f27e3046e4e4380d21"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(unsafe): dereferencing *const should require unsafe \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/splat/splat-fn-ptr-ptr-tuple.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"b63932b520f6fa441118592f8b707e3e9cf7b10736c2bb24529d542d5b61045b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(unsafe): dereferencing *mut should require unsafe \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/splat/splat-fn-ptr-ptr-tuple.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab2cefc31276f8ea06ed95309470088a8247bcd035902986d492637bcc5b11a1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(splat): tuple layouts are unspecified. Should this error in addition 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":"tests/ui/splat/splat-invalid.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"df28c3bf1781dbcae0e486f02f56346a032d70efd63e0ff7f5ea61fd7e3353f6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: When rustc-demangle/94 is in rust\u0027s deps, change this to \u0027{16}\u0027 (fixed-length hashes) \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/splat/splat-mangling.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"50519f7fffa60026ba4d610e455aa8670fc701b6795e783f76105f46df86c3d3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(splat): ERROR cannot use \u0060rustc_splat\u0060 attribute; the splatted argument type... \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/splat/splat-non-tuple.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"4360a6ddd3d865ca16fce4c7cf7be2ec98574575bc974833290566f1dec1f98f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(splat): ERROR cannot use \u0060rustc_splat\u0060 attribute; the splatted argument type... \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/splat/splat-non-tuple.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c7554d17e67402f8cdeff9bb7943d1c477671e45dd90659f1513993e10ba806"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(splat): ERROR cannot use \u0060rustc_splat\u0060 attribute; the splatted argument type... \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/splat/splat-non-tuple.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"e16b862b2227d1a16b5b83c9446333b62c28f7165185b57c4976f8aa331ea081"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(splat): ERROR cannot use \u0060rustc_splat\u0060 attribute; the splatted argument type... \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/splat/splat-non-tuple.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7d3a55ff874a126933952135f72f4e0b2f82accc6aefebc16cbb223bd47569b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(splat): is it enough for just the definitions/callees to 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":"tests/ui/splat/splat-non-tuple.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5a3ebe2ec9e8e09788e8af1e4f29f0def0ff50babb025ec923c31e74a9a7c02"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(JohnTitor): Centril pointed out this looks suspicions, we should revisit 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":"tests/ui/specialization/issue-39618.rs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"68e6becbd8065e1b3edd1e725b35302d8d5ff16963e75c26475f07953387d445"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#154045): Turn this pre-expansion warning into an error and remove the post-expansion gate."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/specialization/soft-feature-gate-specialization.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c4ff357ddba52cf4a38022868722e02a2ece194176cba1fc6c357a38abb870c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#154045): Turn this pre-expansion warning into an error and remove the post-expansion gate."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/feature-gates/soft-feature-gate-auto_traits.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"39102bf4d407c76c2749710e685bed54f1814279f0b96a4e203f4d55c2354885"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#154045): Turn this pre-expansion warning into an error and remove the post-expansion gate."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/feature-gates/soft-feature-gate-decl_macro.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1c54fdaec961f7aa285afdec244b7c48d4648cf99cd44fa9571a967fce0929a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#154045): Turn this pre-expansion warning into an error and remove the post-expansion gate."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/feature-gates/soft-feature-gate-negative_impls.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ee6341bb7eba8dc697d733a452275848ac8ca43774cac1b4c2e133d057a4467"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#154045): Turn this pre-expansion warning into an error and remove the post-expansion gate."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/feature-gates/soft-feature-gate-trait_alias.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"b25fcbf89f5f82a763a5ef684c0d4cfcbc6402db4398cc418f44ae120bc087c3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#154045): Turn this pre-expansion warning into an error and remove the post-expansion gate."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/feature-gates/soft-feature-gate-try_blocks.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"777da16397441d6e289d24a91141e9ccc0b01022d2b28164ada1c63def9d5cd9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this doesn\u0027t work yet... \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/specialization/specialization-supertraits.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b322c5decfa69854232af65a11386cb554cd0fb43513fe097c819d7632e760b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this passes if we use \u0060\u003C(), ()\u003E\u0060 here instead of \u0060\u003C(), Opaque\u003E\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/ui/specialization/min_specialization/impl-on-opaque2.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c0f73ec30d9ef6de7a599770db1c90a65599e142c1049e8ad4bba7be0895c58"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: it would be nice for this to at least cause a warning. \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/sized/recursive-type-pass.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca4f6d016c27f5c3113b861fe89001d9865e0422aa057ba96ccc71be34a9710c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: broken codegen on big-endian (https://github.com/rust-lang/rust/issues/127205)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/simd/simd-bitmask-notpow2.rs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"a083add80a17eb00f0ee4cd329b97dc5f946eadb80c14688d08d44df61f69126"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //@ ignore-fuchsia must translate zircon signal to SIGILL, FIXME (#58590)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/simd/target-feature-mixup.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7657e5d577a2193a2f5ef1f60bd60a0ae5adcc829781c1540fa7ea9709aa81a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this test fails on arm-android because the NDK version 14 is too old. \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/simd/intrinsic/float-math-pass.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f172111df1e1bad7532a4eb6e6c6f1736786bded0941d5dc6a23f922dca77ca"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: re-enable when the intrinsic works on floats again. \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/simd/intrinsic/generic-reduction-pass.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c5b6e5ec1770f52c46c5d3bd3a7d5c3785e8e05235124c56eb0500c2d3b2345"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(Centril): extend with the rest of the non-\u0060async fn\u0060 test \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/self/arbitrary_self_types_pin_lifetime-async.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bcdb6fcf7d7befc6089d8d61f9df0003df5ca636b99d3ecdeb5e99941bd0e44"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME. We currently fail to recognize this as the self type, which \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/self/elision/ref-alias-async.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"7916de2071fee18f7e5db1e206f893d5291df2f6039c63bfb2c10438968d73f4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME. We currently fail to recognize this as the self type, which \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/self/elision/ref-alias.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"d12f4fbdd2220d1583a7755fed11b105ee5d9710e7aaab01f831043f1be42981"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: element type of a scalable vector must be a primitive scalar \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/scalable-vectors/illformed-element-type.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"11c280889dd6c4762533698667ef9afb53c4a53f1b96f739d3972bcd80035b6f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME the unoptimized case actually has that text in the output too, per \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/sanitizer/memory-eager.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"94fadafef18d82a8f34f27bc9df599cd3dc1bf379e5d88e6ec84aea714691332"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment repeated across 14 files: The identical FixmeComment appears in 14 files (14 occurrences) \u2014 almost certainly one boilerplate line from a single migration or decision, not 14 independent debts. Fix the systemic cause once rather than file-by-file. Text: \u0022// FIXME(#122848) Remove only-linux once OSX CFI binaries work\u0022. Source code is not a task system: track the cleanup where tasks live. (Every occurrence still counts toward the score and metrics.)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/sanitizer/cfi/async-closures.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae95f0626dc11382752a2141c4a09557dc60bb54d142fadc2b43df262e270f15"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME remove once drops are working. \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/sanitizer/cfi/closures.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"679b68349a979c679289da3204b40a87447f6ca852c18005cb22f9f641e5c207"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#122848): Remove only-linux when fixed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/sanitizer/cfi/drop-in-place.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2993ddd6ea84fbe23a67e6b5071313e0895f84f7fa4e875da3e7a8d95c5183e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#122848) Remove only-linux once OSX CFI binaries works"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/sanitizer/cfi/drop-no-principal.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e69e80d0be8671f6c079b64e066134c443ac22c2c2097e83a8b523dc249f61b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#118761) Should be run-pass once the labels on drop are compatible."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/sanitizer/cfi/drop-no-principal.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"56042532324875ebf660d8aba519cd4b94ea9e971a5b6f639c8db153ea5faae7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: These should be consistent. \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/rust-2018/edition-lint-inter-outlives/edition-lint-infer-outlives-macro.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"95d6e6810c983df40b4be963a22e3dc7f64c776c320ceb15f2beb912583d49ac"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: replacement span is corrupted due to a collision in metavar span table. \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/rust-2018/edition-lint-inter-outlives/edition-lint-infer-outlives-macro.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"9201ef22e7634f5e2e2787ec003c67db76ded2c0b5d7a48c7654854fd384196d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: replacement span is corrupted due to a collision in metavar span table. \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/rust-2018/edition-lint-inter-outlives/edition-lint-infer-outlives-macro.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"84ef4b0f1e536361db14437e655aeced9975f57b23f7d732dee542cb7c024428"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#18285): we cannot include the current position because"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/runtime/backtrace-debuginfo.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"8527d091875bdac885d24adec54b809cc98084637497592f55b5b6b51b5210a3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //@ ignore-android: FIXME (#20004)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/runtime/out-of-stack.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a98cf97132c52e1b8ec6492e90280bff64b0c8b29f734806bf4dd2f6453f70a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //@ ignore-fuchsia must translate zircon signal to SIGABRT, FIXME (#58590)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/runtime/out-of-stack.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"02248d6547997220fe92166bdfe8460919f4e4320c8a09ddcfc4777a266aabef"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: The error here actually comes from line 34. 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/rfcs/rfc-2528-type-changing-struct-update/lifetime-update.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"08bc3a33de58b2fdcb63f182d5f67922e1eec7cee72a8cc3bbafaa23b8a3a68d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(tschottdorf): this test should pass. \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/rfcs/rfc-2005-default-binding-mode/const.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"90faf8d8b79829740b02b74af782ec8228d62d799064aa1ce1250813407c0765"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(tschottdorf): #44912."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/rfcs/rfc-2005-default-binding-mode/general.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"096fdd622c76fba41bf02a7498801cfb98e9a48a1faba62b96d2e77302d70f69"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(tschottdorf): This should compile. See #44912."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/rfcs/rfc-2005-default-binding-mode/issue-44912-or.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f059d2aba696b007586ce5296552e930dbba49e5ef0917ddde831fb6178e9191"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(tschottdorf): we want these to compile, but they don\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":"tests/ui/rfcs/rfc-2005-default-binding-mode/lit.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a85f13f9a0d99afc076cb1fa84fd66541048d742be54f179bc3abf312c14223b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: implement this check \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/return/return-impl-trait-bad.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4b1eafe963e5fadf59356f81571fb0d8f6cd2b8e5361e0b5523394a2eb8a74c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME, this and \u0060use Tr::{self};\u0060 should be an 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":"tests/ui/resolve/resolve-bad-import-prefix.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"0da29692d713787e342a200cdc9db8eb45a87f053674d06bdfe304dae2acb693"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME. Except we don\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":"tests/ui/regions/forall-wf-ref-reflexive.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeb8cd25c0360cb13e8ff1b7f7a7b0995c952fe99673231cf3cf5199316efa25"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME. This ought to be accepted, presumably. \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/regions/forall-wf-ref-reflexive.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe75bee4b04f4f9f60df2cc9528ea2a67b8f0c62934d621c97fb458eb851b8c7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This test should pass as the first two fields add implied bounds that \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/regions/higher-ranked-implied.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d84a67d8c99a3fa2b401721479c334f4978a16e8c56ed83df772349a02f807da"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME (#54943) NLL doesn\u0027t enforce WF condition in unreachable code if"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/regions/regions-outlives-projection-container.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"f08ddbcc9a78c5dc0380cf84de6df8aada201d927da7e37fd60435de5c52bc49"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#61117): Respect debuginfo-level-tests, do not force debuginfo-level=0"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/recursion/many-statements-no-overflow.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbffd0566f1734d6e784ca8484736e5efc0274ff6c92dfa4899c3f23bf819627"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#61117): Respect debuginfo-level-tests, do not force debuginfo-level=0"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/panics/issue-47429-short-backtraces.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"d80689cde4b31514bc390fe96962c7abe2301b530596bf245c362e5d1188a8b6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#61117): Respect debuginfo-level-tests, do not force debuginfo-level=0"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/panics/runtime-switch.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbd470e4b2766429ce4fcbfcc24f657dedcc57207683806bd6b989ec4f323b21"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#61117): Respect debuginfo-level-tests, do not force debuginfo-level=0"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/diagnostic-flags/colored-session-opt-error.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"76dbb853217625ce5a04ec25c1d7d652e5702f0567f3a47c6857afdfbdecb50f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: more platforms? \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/process/env-null-vars.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ceee90d49f26f968111d5c79fd566ad13deb3b690049c9bd859826178a12444"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //@ ignore-fuchsia code returned as ZX_TASK_RETCODE_EXCEPTION_KILL, FIXME (#58590)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/process/signal-exit-status.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff0a831e335159d45574abaf7e8087be0f655aaf250652970609a7701a726983"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: should have a type error here and assert it works but it doesn\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":"tests/ui/proc-macro/attribute-with-error.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"e252301f29d50dd2ee1b6fd29858d6ec279afc04b8ff292f702db3c46c48f71c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: should have a #[recollect_attr] attribute here and assert that it works \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/proc-macro/attribute-with-error.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ab81b12daa7b996cc050a07bf80e833833eaa33d5c26c264980dab311e425dd"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This don\u0027t work when crate-type is specified by attribute \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/proc-macro/crt-static.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cf5ab91afb5d2ca0362df8068463bfce3198732dd0b028b6e669bf8f5042365"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We currently lose spans here (see issue #43081)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/proc-macro/issue-75930-derive-cfg.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"0255be53a2235a0f3c568e85c64b4d523f4d5b4cb20b6adaab31a6668f1f689c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: should be a run-pass test once invalidly parsed tokens no longer result in diagnostics \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/proc-macro/nonfatal-parsing.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f621390159a974ae9747c3cda09dafb932848ea4d8ab8aa38501d7a16fe6a58"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: enable this once the standalone backend exists \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/proc-macro/nonfatal-parsing.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"4016649c9258fcac8038f7941809967f1d2d10773159348caed07a97e790355d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(quote): \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/proc-macro/quote/auxiliary/basic.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"8300a40f6de3ca14f9cd704ec8f6b9247b1e869e706ab8a781d6b2cfc8548ab5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: all cases should become \u0060NormalOk\u0060 or \u0060NormalErr\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/ui/proc-macro/auxiliary/nonfatal-parsing-body.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba8b0cdc732ef10c0347fffe7f5ef02d4783481592982b48335a1880b2fa8481"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: all of the cases below should return an Err and emit no diagnostics, but don\u0027t yet. \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/proc-macro/auxiliary/nonfatal-parsing-body.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"3357b6fb653a5101d603afb8063983fca301a3c9fb3ad71420b337bed96713d2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME - this shouldn\u0027t be necessary \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/proc-macro/auxiliary/span-from-proc-macro.rs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f8af457a66d3edc0ab9eedd9bd6dafe68affcbe85125b1a8d6067a28c46d753"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: \u0060Ident\u0060 does not yet implement \u0060PartialEq\u003CIdent\u003E\u0060 directly (#146553)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/proc-macro/auxiliary/api/ident.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef04258c02bab91acf2f877edd0fcc7c1d99aaa71f2e5dc03c8643a5c677d64f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME no longer an 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":"tests/ui/privacy/associated-item-privacy-trait.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"b98fe3086f7003c1816e1318b4212e9263fb2c9ff4ae072915933173be23b396"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This should trigger. \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/privacy/pub-priv-dep/diamond_deps.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f03c3c4812a46bb868fa2074a1e7e7aec47b039e5ada186ae20114e03383217"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Should this trigger? \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/privacy/pub-priv-dep/shared_direct_private.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"d33f25d1ba618ba0f5d90ff904033d37c547c729de9161eb357e05a88e37aad5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#61117): Respect debuginfo-level-tests, do not force debuginfo=0"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/print_type_sizes/async.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f1ded0ae0edcc11368e3f5b07ea277c6c46a21a972be7a6d9782944670021e6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#61117): Respect debuginfo-level-tests, do not force debuginfo=0"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/async-await/future-sizes/async-awaiting-fut.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0442e0beee0d73d89f022021778c3b469267b597bd5a54d3887d7f97c211bda3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#61117): Respect debuginfo-level-tests, do not force debuginfo=0"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/async-await/future-sizes/large-arg.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"02c851c6f3f2c1d9e02f812572c9ca7da31894837e8868f229394f926b928175"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //     FIXME: consider using an attribute instead of side-effects. \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/print_type_sizes/generics.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"62b04a16b26a93f1c6a22192d6e4b2fdcafa92b42cf2d33d6f8b8163d4186a78"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //     FIXME: consider using an attribute instead of side-effects. \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/print_type_sizes/no_duplicates.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"8215e62fed556ecda73d6bb3c04f0c4f97f4e0a44d8b013b7936818cf2af8d21"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //     FIXME: consider using an attribute instead of side-effects. \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/print_type_sizes/packed.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a4956a8934c592012a8f1e6213a9a72135f198f8a1e22af5026ba6a7511f599"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //     FIXME: consider using an attribute instead of side-effects. \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/print_type_sizes/repr-align.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee68407ad445a751850704ff7dadcc443f567887edf039730c1aee99bda6e59f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //     FIXME: consider using an attribute instead of side-effects. \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/print_type_sizes/uninhabited.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"5311f7b60a78236b0a9c7c9b00c340141308bf80f5ce47410cd208c20540432b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //      FIXME: consider using an attribute instead of side-effects. \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/print_type_sizes/niche-filling.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"c43f6bf6bd5d3d3727b95bcc7a319609187e0bda14f341a400db6bfb6f8c30ec"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: musl targets are currently statically linked, but running on a musl 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":"tests/ui/print-request/supported-crate-types.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae14ec1c9c4a45dedecd85220cda8f519c4981a09b1f7a4685bfc841f5f3726f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: delegation macros are not tested yet (how 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":"tests/ui/pin-ergonomics/pin_v2-attr.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"6952c93c31a86aaea4288033cc0faed104d7d64e41681d3ffeaae94997bae699"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(trait-system-refactor-initiative#293): This currently causes an ICE."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/pattern/usefulness/impl-trait.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5d821a9f1296083193d09bb9a6f416032981665a33802f75ce7cf00a964b6fc"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(guard_patterns): mismatched bindings are not yet 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/ui/pattern/rfc-3637-guard-patterns/name-resolution.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d5066477fd70bfd9d8febf113e14bbc765ba82509ea408f6677051b2a889a8c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(guard_patterns): liveness lints don\u0027t work yet; this will ICE without the \u0060_\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/ui/pattern/rfc-3637-guard-patterns/only-gather-locals-once.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2b3ce7526182b4aeac89f0ac6f3a82e646126323645317c7ef9e3385cc2e867"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(inline_const_pat): if \u0060inline_const_pat\u0060 is reinstated, there should be a case here for \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/pattern/deref-patterns/implicit-const-deref.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8ca1446b5d0bad11d39e0e89a11ac008236788d9f31310f9e9e41e30e3ad0d3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(deref_patterns): there should be a special diagnostic for missing \u0060DerefPure\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/ui/pattern/deref-patterns/unsatisfied-bounds.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fac1c06506f2bad0304753e755bb3b38524bfaf81c8afd46ec2efa995ef302d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(deref_patterns): On stabilization, cases for deref patterns could be worked into that file \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/pattern/deref-patterns/usefulness/empty-types.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4bdac689a2318b35815ffa55e73b0caca00864e85da21955c31ffdfa8bdc819"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: The binding name value used above makes for problematic diagnostics. \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/pattern/bindings-after-at/borrowck-pat-ref-mut-twice.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2be9deb882e24a2323d0c115d521381567eb4917d7482b907993e884e5a2eab"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // fn p() { // FIXME(explicit_tail_calls): this currently trips an assertion... \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/parser/bad-let-else-statement.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e1fc4e84bc80d6e47a959282c750ec2a311b7885416bffe950116bc62fab36c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#78168)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/parser/block-no-opening-brace.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1e4567e150b89c13d4ad04275cb38d36c5807730167ab7fad22da7ca8f06d75"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#78168)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/parser/block-no-opening-brace.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"77c77811eef4ae337f01902ff0f53e70fe4548df495e1288e09fc54015d0543b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Remove \u0060box\u0060 from the list of tokens that can begin expressions which would make us take \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/parser/box-can-begin-expr.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"e02ab74536f6424dc04ff484f1f6344d1a4499bb9d7d43340bcf641eb0c59fc0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(Centril): For now closures are an exception. \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/parser/self-param-semantic-fail.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fbc5b4e10a8303f16298f38ed558ff89bd4ac204db0e243013da5f5357a37bc"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(Centril): For now closures are an exception. \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/parser/self-param-syntactic-pass.rs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"61b449684c23baa53d26a3847124d9b347128d8ee92d0ca7794d60d0798eebb5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Better recover and also report a diagnostic for the other two fields. \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/parser/struct-expr-pat-tuple-index-shorthand.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"e38f0a51c71503a51ec0b2a9eaa035b04135d47c47e7efc41a5cbb8cb7268888"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: It\u0027d be great if we could suggest removing the parentheses here too. \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/parser/trait-object-lifetime-parens.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"4be9dd6a6a12bd4911f3b6b1c8907207367fdcd7b42dcc471aa4e20ded4c0013"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(31528) we emit a bunch of silly errors here due to continuing past 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/parser/issues/issue-10636-2.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"220776b893ffc147146d72a463302cb4a20f0d00835e180aa3741854644a3cf4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this case need more work to fix \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/parser/issues/issue-68987-unmatch-issue-2.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d36e7bee8026c60407318c2847640508e471978d95c2c7839668f135b194ad8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const_block_items): \u0060pub\u0060 is useless 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":"tests/ui/parser/const-block-items/pub.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d41a39b7cb8bd8f863b8427c3e0afd509c16247397c9aa68008d5994e1957e8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Allow attributes in pattern constexprs? \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/parser/attribute/attr-stmt-expr-attr-bad.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceb91c8433f9ce6a21977364e05b610105226ab8dc8ae72dddbd11634e032b32"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment repeated across 10 files: The identical FixmeComment appears in 10 files (10 occurrences) \u2014 almost certainly one boilerplate line from a single migration or decision, not 10 independent debts. Fix the systemic cause once rather than file-by-file. Text: \u0022//@ ignore-android FIXME #17520\u0022. Source code is not a task system: track the cleanup where tasks live. (Every occurrence still counts toward the score and metrics.)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/panics/issue-47429-short-backtraces.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5777e43b560d23d309b93a7f57a8aac12cf44c4b301b69d24de66f1dbf3d0a9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //@ ignore-arm-unknown-linux-gnueabihf FIXME(#146996) Try removing this once #146996 has been fixed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/panics/panic-abort-backtrace-without-debuginfo.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d6bc0fdf7b8b8bc596053bfa7078836a3cb1d229293d09dee56c4b98c54c733"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK assert_eq! would panic here because it stores the LHS and RHS in two locals. \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/overloaded/overloaded-autoderef.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"01a5f9f8ce7557ab958e950016b12520791b63c6c51e2c4bc237e674ae3136e6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(fmease): Update comment. \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/offset-of/offset-of-tuple.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"4095eeafb2390823a3d3e2f908cb4df17705296bf344aee18a79e15f2deae736"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(offload): Binding a tuple to a variable would currently bypass 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/offload/non_tuple_args.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e9e62a7b911353abba3df264208a2d37d94041eb58858b909f194f46ea75694"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Ideally, we\u0027d elaborate \u0060dyn Bar\u0060 to \u0060dyn Bar \u002B \u0027a\u0060 instead of rejecting 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":"tests/ui/object-lifetime/object-lifetime-default-assoc-ty-binding-item-bounds-non-static.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"636fc5113024e0725ae692207fa94f72547ab271ac457593324c96a5106f393a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Ideally, we\u0027d elaborate \u0060dyn Bar\u0060 to \u0060dyn Bar \u002B \u0027static\u0060 instead of rejecting 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":"tests/ui/object-lifetime/object-lifetime-default-assoc-ty-binding-item-bounds.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"4114669eaec745bba3b6dfeec5517e39c2eb3b05097bd99329ae0dbe6524669d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Ideally, we\u0027d elaborate \u0060dyn Bar\u0060 to \u0060dyn Bar \u002B \u0027static\u0060 instead of rejecting 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":"tests/ui/object-lifetime/object-lifetime-default-assoc-ty-binding-item-bounds.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5a3f6a094bfa9c60a8598aaf48805113c39053270aeecad64b670ee4e8509fb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Ideally, we\u0027d elaborate \u0060dyn Inner\u0060 to \u0060dyn Inner \u002B \u0027static\u0060 here instead of rejecting 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":"tests/ui/object-lifetime/object-lifetime-default-gat-binding-item-bounds.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"2137ab0354c65cd83323aba48361f585b4b7fe3f138a3a797229601f593ba86a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Ideally, we\u0027d elaborate \u0060dyn Inner\u0060 to \u0060dyn Inner \u002B \u0027r\u0060 here instead of rejecting 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":"tests/ui/object-lifetime/object-lifetime-default-gat-binding-item-bounds.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"d422a897fa2f48be3d5aaf0a27436d1adca209f745ca1ee639f5bc7b4e9898a7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Ideally, we\u0027d elaborate \u0060dyn Inner\u0060 to \u0060dyn Inner \u002B \u0027r\u0060 instead of rejecting 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":"tests/ui/object-lifetime/object-lifetime-default-gat-binding.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"63dfb52faf1bbe1c4ac48ffa51e9815155e3cb4798d728b72a79e61fcc3bb0fc"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Ideally, we\u0027d elaborate \u0060dyn Inner\u0060 to \u0060dyn Inner \u002B \u0027r\u0060 instead of rejecting 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":"tests/ui/object-lifetime/object-lifetime-default-gat-binding.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"b56e8c50eff6c2472c8feff32eed9baa8c4c37d8014fb21f710a9a1d290877f7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Ideally, this test would be check-pass. See below for details. \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/object-lifetime/object-lifetime-default-inherent-gac.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4a43e8e868259f36bfe2ee50611e3b842f631137c0a340e840c456aa31caa1d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Ideally, this test would be check-pass. See below for details. \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/object-lifetime/object-lifetime-default-inherent-gat.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"165edc308bab588c3a3d5a90e0001d632ce0fb7675a5e289d59debc48789b823"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Ideally, we would deduce \u0060dyn Trait \u002B \u0027r\u0060 from the bound \u0060\u0027a\u0060 on ty param \u0060T\u0060 of \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/object-lifetime/object-lifetime-default-inherent-gac.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ea74ce5147ecb2de8ec4c0e8cb212f8e7d165b1ad4ab597025b65815838ada8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Ideally, we would deduce \u0060dyn Trait \u002B \u0027r\u0060 from the bound \u0060\u0027a\u0060 on ty param \u0060T\u0060 of \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/object-lifetime/object-lifetime-default-inherent-gat.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"aebcd368b707d9a567a291baa7f3766906a0a202c10dd55a7c6a46709d059889"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Ideally, we would deduce \u0060dyn Trait \u002B \u0027r\u0060 from the bound \u0060\u0027a\u0060 on ty param \u0060T\u0060 of \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/object-lifetime/object-lifetime-default-inherent-gat.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bb286947e37cbd5c5f1610eb1d996086c3e3d9ab21e56693dc9dc856e8167aa"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //FIXME: Ideally, we would deduce \u0060dyn Trait \u002B \u0027r\u0060 from the bound \u0060\u0027a\u0060 on ty param \u0060T\u0060 of \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/object-lifetime/object-lifetime-default-inherent-gac.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4211d2feb355b9d239bf3f4cfde55fe02b79c03c0bb9314fe5e2d9d9a233484"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Ideally, we would deduce \u0060dyn Inner \u002B \u0027r\u0060 from bound \u0060\u0027a\u0060 on ty param \u0060T\u0060 of assoc ty \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/object-lifetime/object-lifetime-default-type-relative-gat.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"39d6282968624f3ad9b9c7ddef2de9f5dce14d3a68d254dc5bd6f4f2796c14ca"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Ideally, we would deduce \u0060dyn Inner \u002B \u0027r\u0060 from the bound \u0060\u0027a\u0060 on ty param \u0060T\u0060 of assoc \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/object-lifetime/object-lifetime-default-type-relative-gat.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cb0bd1f70456488c1417b0933c5a9b60d9186a5db7570ade1c4043e83670952"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(30524): uncomment this test when it\u0027s 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/ui/numbers-arithmetic/num-wrapping.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a6f1b3ea80cf82ed5ed364e2c946bf2490c481039161b084c7dd7ce5295f5ec"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(30524): uncomment this test \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/numbers-arithmetic/num-wrapping.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"84e5c8ef7d9e499ec0dfd39b815b4a6914f97088c9e818f2980ea8b9647eb222"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#23545): Uncomment the remaining tests"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/numbers-arithmetic/num-wrapping.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"8612d3fa67c1671d3fefffa88a9574c27861a2a9b724ef3b4c3266d0bb778866"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#23545): Uncomment the remaining tests"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/numbers-arithmetic/num-wrapping.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cf070fbd494f12eac9eecd9e392b2b0b5ae66a0aaeaa5e2af1ff69bd190c66b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME emscripten does not support i128 \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/numbers-arithmetic/saturating-float-casts-impl.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4037a20d483034fe83b5dae6d0e7872e953f01033cf02d3041916392b78d7b4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME emscripten does not support i128 \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/numbers-arithmetic/saturating-float-casts-impl.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ed2a6cca7d5185fa2b6288152d59fd4c8e8e186813009096de05d9b4edfd6e9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME emscripten does not support i128 \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/numbers-arithmetic/saturating-float-casts-impl.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"829b9d7fd745e4b61d9fcfba4972119853bea986b693d3d3d70d085d81701575"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME emscripten does not support i128 \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/numbers-arithmetic/saturating-float-casts-impl.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbf490f1f6e016c907ad1d8d82f2649dfde85e2e4d1465e91e9f123b46fb92fd"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME emscripten does not support i128 \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/numbers-arithmetic/saturating-float-casts-impl.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"d54bbcfbb937db2fcca6e06a82f5f3079e025f2ff84cfbd0d8fbbdec489989ae"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME emscripten does not support i128 \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/numbers-arithmetic/saturating-float-casts-impl.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"a479aa56621756bbad5b26bae2da94df42014e6c4c516604d65bfe083b955d15"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#54366) - We probably shouldn\u0027t allow #[thread_local] static mut to get a \u0027static lifetime."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/nll/borrowck-thread-local-static-mut-borrow-outlives-fn.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2422496dee013105360d99bd69bad0735b246e44e8bb06e47feacbc4ffa281b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#54943) This test targets the scenario where proving the WF requirements requires"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/nll/issue-54943-3.rs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"815794ae6aa62e4a936f91ac0a8b0f407d15f9884b06b8fed3b5c1e0dc443678"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(@compiler-errors): This error message is less than helpful. \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/nll/issue-57362-2.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cd7d6eb5ec432ccc623de1eabf05b16a36454117df22dd85fae31f294d364f4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME ^ Should not error in the future with implicit dtors, only manually implemented 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":"tests/ui/nll/maybe-initialized-drop-implicit-fragment-drop.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a9bfdf6fd9e0944131c03178665a417ae5391d566247cbdb9e3101e764f3039"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME ^ This currently errors and it should not. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/nll/maybe-initialized-drop-with-uninitialized-fragments.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"a66578a98cbcd4fe259b32bbe985dc8ea0065cb0ced4866826806d8f3276b01e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: ideally, we suggest \u0027a: \u0027b \u002B \u0027c, but as of today (may 04, 2019), the null 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":"tests/ui/nll/outlives-suggestion-simple.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c91cad1638da2932aca1276f7140eead91699fcc16bfb8a27f0bd4f101d9429"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#98437). This regressed at some point and"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/nll/snocat-regression.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff4660592271eec82d56d4b5658c427bf2c260a95cac8e4e9c27fe731139214a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#98437). This regressed at some point and"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/generic-associated-types/collectivity-regression.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"f23ef8ae046b107a0267d72a477601a6c926196e0f4190ccfc237acac4a9ec7f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: remove this cfg when removing the datalog implementation \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/nll/polonius/lending-iterator-sanity-checks.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"19f2ff5f7a251dc6b2d04598090377958c5da5f6b1ac0f7b4fc90b2ade1bc51c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This *could* be considered a read of \u0060!\u0060, but we\u0027re not that sophisticated.. \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/never_type/diverging-place-match.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e80c546f6a848c6a462e9d4ee42d8a9e877d7b47e48e8e050612c20d12062e6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: the unused lint is probably incorrect 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":"tests/ui/never_type/fallback_change/lint-never-type-fallback-flowing-into-unsafe.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"b48b3f2ed8aadae556e1e61a8fb17da88306ab8ecbaf27ee9367ac592b54dbb7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(mir-drop): use the vec![..] macro \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/mir/mir_augmented_assignments.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"463f327bc7033fc4241ac63dd8a01715361900549fd78857fa19615ce01129c6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: please improve this when we get monomorphization 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/ui/mir/mir_raw_fat_ptr.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"51c7d5cb474e66345b532271d7acfe52b1afc98ff076e300f9cda783b35c4912"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: error message is confusing \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/match/validate-range-endpoints.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"8de609066a024b0670027892ac8ca8ec81eba532f07809887e47d75494da1daa"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //FIXME: remove error-pattern (see #141896)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/macros/borrowck-error-in-macro.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c858bc99c787610cbc7afa8fe1d43db7bbe823b18f2c94ad1b1765bc3d81f9c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(dtolnay): We actually want both of these to work. I think it\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":"tests/ui/macros/format-args-temporaries-in-write.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccd42d3cd5815cf543acda88a2ec9f68d3a57941c078f34b50ded1e7b2b7f1d5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //@ build-pass (FIXME(62277): should be check-pass) \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/macros/non-fmt-panic.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb46322beda34bc900df69dc91e892433c10b462e3fee368fc9d561a999dfbec"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: 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":"tests/ui/macros/stringify.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d436dd2d5f1c3c681ffd4d6b25a1a9395ca12cef21423e8f51ee5b60ed36815"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: 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":"tests/ui/macros/stringify.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"826773735e56f3ed6e805de470179689035e41d2834b9d1318cd794dfc41867b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: 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":"tests/ui/macros/stringify.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0c216cdaffc7e2e95324d86c03477c4d8ab159bdf437db6458b59241ba502b0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: 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":"tests/ui/macros/stringify.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f6634a3ed2d769802a92f7e596cc26a7a882ff0a917c8f9788328e58264d4f9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: 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":"tests/ui/macros/stringify.rs"},"region":{"startLine":769}}}],"partialFingerprints":{"codehealthFindingId/v1":"0df7081f66a9fdebf3ce5624de766a74ed86095261751959a7fd3e83aa7c5e48"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(macro_metavar_expr_concat): this error message could be improved \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/macros/macro-metavar-expr-concat/empty-input.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"863ef6cbd85985cf00ec1efbac7a6d2b2bb62553873ac92e44c1ff27bc49a8b8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(macro_metavar_expr_concat): this error message could be improved \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/macros/macro-metavar-expr-concat/in-repetition.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8323f751f784e60e323eed636debb86463dab6a76195980184cc3b1f3e4bb01"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Cannot use a \u0060pub\u0060 macro 2.0 in a staged API crate due to reachability issues. \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/macros/auxiliary/unstable-macros.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fb1ada083d4bbc1ef89314c3fba8b46bf09f50dbc9c9cede26c7a481968fc34"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#73154) Pure NLL checker without leak check accepts this test."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/lub-glb/old-lub-glb-hr-noteq2.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"126eece114e96bbc6f2f34a28cce0056208d4d32f5904367e01c5364ed61cf02"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //@ build-pass (FIXME(55996): should be run on targets supporting avx) \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/lto/lto-avx-target-feature.rs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ce32be8af88a146bce1ef46b2d60d4a24bcc471fbd81ac14bc1ee0ffe2878f4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Arguably this should be an error, but the WARNINGS group 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":"tests/ui/lint/forbid-group-group-1.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"6db390cbc1af07c572878f6d9eb47c5bcf5683e79d3a36bfc7c61ccd1d477d92"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: add support for \u0060// only-atomic\u0060 to compiletest/header.rs \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/lint/lint-invalid-atomic-ordering-int.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"251f3c56e983b2450572e028767e84b9302c2a47306986078a6933f6fabb6168"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: false positive. This parenthesis is required. \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/lint/lint-unnecessary-parens.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae6495be85359c7e902957846dd3b7ba9ec9224e0c84cdc2e4621f70f4456290"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: the old names for rustdoc lints should warn by default once \u0060rustdoc::\u0060 makes it to 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/lint/rustdoc-renamed.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b90c8f257a800b29f8a83c2c60653c93f925658213b58c3c8b317bb43e2bf8f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: should be run-rustfix, but rustfix doesn\u0027t currently support multipart suggestions, see \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/lint/unused/issue-67691-unused-field-in-or-pattern.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e854f1de69fba37db046f8a6452ad0d26b961f712ef309d68cad4a7a842e5a88"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: It\u0027d be great if we could also warn them. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/lint/unused/issue-74883-unused-paren-baren-yield.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"c19fe4869dc2befafc1e5ef2737b5d825ffa733e587fbf2392d637f6e8eb27df"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Here\u0027s a false positive, \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/lint/unused/lint-unused-mut-variables.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee050d2baf929969ce2c28fb1531b28355634a7c59c0ecd565b1265c8488831f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(Urgau): For some unknown reason the spans we get are not \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/lint/unused/must-use-macros.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3108f38affdbe96111292f167ad3f6dff51d5a2ae4e3e924b59400348af2411"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(jdonszelmann) this error is given twice now. I\u0027ll look at this in the future \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/lint/unused/unused-attr-duplicate.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c65262fcbbc4adbd8c021ab2d66749ed19b7c5d808eae4123ec9b1508d0c4e2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Bring back duplication of the \u0060#[expect]\u0060 attribute when deriving. \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/lint/rfc-2383-lint-reason/derive-expect-issue-150553-3.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd3ee385b65d602d3cc023d795cb894499ebe33be2edfe7a75de921c0d997b2a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //FIXME ~^^ WARN this lint expectation is unfulfilled \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/lint/rfc-2383-lint-reason/derive-expect-issue-150553-3.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8b7b437ffceb4913cddb3315cdab1550f4fc7af008a99b924b8b79ac81fd4af"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Lint attributes currently don\u0027t work directly on macros, 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":"tests/ui/lint/rfc-2383-lint-reason/expect_lint_from_macro.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab479c35dc2a292fde7d630ecf643e01bf2d48096ddbad19a0bd3a52df29d03b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#159078): \u0060--test\u0060 causes rustc to treat this library as an"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/lint/dead-code-pub-in-binary/library-test.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"3049072046baa6a91721840ead5146759c53de18ec41b994fa8436e959d1b184"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //^ FIXME: should 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":"tests/ui/lint/dangling-pointers-from-temporaries/calls.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"930e33ccc99ed9b9c2946fdb6a4ef1e9a85756606ffc310bd5df2eedeb31ac4f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(raw_dylib_elf): Debug the failures on other targets. \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/linkage-attr/raw-dylib/elf/multiple-libraries.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"25b2d9e6688dce368e21e5f872e7cc77c275b7ec940d5e0b7412c4acbc6e5b58"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(raw_dylib_elf): Debug the failures on other targets. \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/linkage-attr/raw-dylib/elf/single-symbol.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a0064aaef83eee62cafc22927da05d4d3b3733918a8480095181e0fc698bb31"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(raw_dylib_elf): Debug the failures on other targets. \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/linkage-attr/raw-dylib/elf/verbatim.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"83b4294f53b75429b48feaee88519331a6d01f8689992bb1af648aaa6ff21434"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(raw_dylib_elf): Debug the failures on other targets. \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/run-make/raw-dylib-elf-verbatim-absolute/rmake.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeabdd1cced14dbb91d293d5a2d21d653e3f131065eb3250b5781552abdc16ec"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(raw_dylib_elf): Debug the failures on other targets. \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/run-make/raw-dylib-elf-verbatim/rmake.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0a4b56115f8eb882bb93ba9339e1f43f4737fe60b98f85e32be566337d98a03"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(raw_dylib_elf): Debug the failures on other targets. \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/run-make/raw-dylib-elf-extern-types/rmake.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ba67738c53988af487f7399c6a5563b71ef80c811098af1531af42a1116c8b3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(raw_dylib_elf): Debug the failures on other targets. \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/run-make/raw-dylib-elf/rmake.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"182ab69ba2af2733874068b3291e7174471cc5f0bf60f256873c48355c843c4e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#61117): Remove revisions once x86_64-gnu-debug CI job sets rust.debuginfo-level-tests=2"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/limits/huge-array-simple-64.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6321e9569562c4f5c88fbebadaaf8cbae8a1e55bc52dcf39ac29d75e7ff3dbed"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#61117): Remove revisions once x86_64-gnu-debug CI job sets rust.debuginfo-level-tests=2"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/limits/huge-array.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b6aadc7d41a341c6e59258cc775355557ea7aaff1df263db9b85341eada576e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#61117): Remove revisions once x86_64-gnu-debug CI job sets rust.debuginfo-level-tests=2"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/limits/huge-enum.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bff8fa14f1f7b6bd8f2a3c5489a24316db978db3394e0fc7a5c6c4b57e7ebca"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#61117): Remove revisions once x86_64-gnu-debug CI job sets rust.debuginfo-level-tests=2"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/limits/issue-15919-64.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3c9173aa39b46d8f735863899cc55e103047258c5e34e423b99493d990eacbe"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#61117): Remove revisions once x86_64-gnu-debug CI job sets rust.debuginfo-level-tests=2"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/layout/size-of-val-raw-too-big-64.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1278c8cca118ae2cee8bc19a24084678c11361e4ebb36630448fffc3d51c9b41"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // hack to get negative numbers without negation operator! \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/layout/hexagon-enum.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb6ab15e5def4f7825d58917b6a470d6697822da67017289dda693bb16d3939b"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // hack to get negative numbers without negation operator! \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/layout/thumb-enum.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"b31300489d79cef0c5c3946b9ff0110e420b313ab5d0b9a25cedd504af7ced84"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This could be made more robust, possibly with a variant of \u0060rustc_dump_layout\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/ui/layout/trivial-bounds-sized.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bcd417a07ed459aacef07db04c6c272216f3adb9037e94b33578fa017823a23"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Once the size of iterator adapters is further reduced, \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/iterators/issue-58952-filter-type-length.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c7a7ab637cb5f9117df654abacf4c2a99f252bb2e51c406ad0679ebbfd41385"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //@ ignore-wasm32 FIXME: ignoring wasm as it suggests slightly different impls \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/inference/issue-72616.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"859eba543c60d7a4eb63b40bf537d3c4baee0c34cc2ae9440aea55afbe3bd53c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This should also emit an 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":"tests/ui/inference/need_type_info/type-alias.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b97692c5827ac4e1cb9bd2fcf90a4fef73956507f3e88e4ff39e043b5a35a85"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: these two should *fail* because they can\u0027t be fixed by fixing the glob import in \u0060foo\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/ui/imports/import-from-missing-star-2.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"d208605ead83745113117c180c5378031be6f7a4aef8466eca606d835acb2895"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: should error but doesn\u0027t because as soon as there\u0027s a single glob import error, we \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/imports/import-from-missing-star-3.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c666760633884f094dd93b2f0fa11a22207a04be4470c35371ba7649711a36f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: should error but doesn\u0027t because as soon as there\u0027s a single glob import error, we \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/imports/import-from-missing-star-3.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"c294c98f95038486152e7bb33563e7a0536358137cff9d3f38bbef7ec9506093"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(yukang) Test remove NestedFullUnused \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/imports/suggest-remove-issue-121315.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"672811d90d63ff8256b2660941b5dc3b4275bb919ecf0b89543f8d6a3c26b18f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(yukang): Test remove both redundant and unused \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/imports/suggest-remove-issue-121315.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c911713b8f601a8b1fd94bf6be9d7477eda03ba418b9c875782b281c6b11969"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: the error is pretty bad, this should say \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/implied-bounds/hrlt-implied-trait-bounds-guard.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce521485dffa41362e952d9c949da199e61c5f7284d1b9be412ed05462e08551"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME(#51525) -- the shorter notation \u0060T::Assoc\u0060 winds up referencing \u0060\u0027static\u0060 here"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/impl-trait/bound-normalization-pass.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"84f9d4cf8a2e39e4389c0b32445458eb2f189dbfa8e5289a87effdd7d98826bb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME(#51525) -- the shorter notation \u0060T::Assoc\u0060 winds up referencing \u0060\u0027static\u0060 here"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/impl-trait/bound-normalization-pass.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"e99e098af765a82a42c77a5deb28edb3ee8f02919bb7184b4c4c7d49ffc2886b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //! FIXME: always look through the bounds of an opaque type to see if there 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":"tests/ui/impl-trait/call_method_without_import.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"eee0f2621a2183d032ce383a671e78cd3f2ac946ce47ee6b25bc8c16e848f477"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK(eddyb): only needed because \u0060impl Trait\u0060 can\u0027t be \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/impl-trait/example-calendar.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"30c0b39fe22c7ff16589d3cddbae68c73668b74e2c374c12d1d85af929767b6a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(oli-obk): make \u0060expected_inputs_for_expected_output\u0060 support this \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/impl-trait/hidden-type-is-opaque-2.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"586de0f7b84e4bd8fe34796edd5ee437e56a1c3645c9162c2f93f1a0522ec6e8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This doesn\u0027t display a useful Rust 2024 suggestion :( \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/impl-trait/precise-capturing/migration-note.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7d89c39eeca97887ac844978d73d2f661761b030b6cf86e0f525e7a44fa2085"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(-Znext-solver): This currently incompletely constrains 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/impl-trait/non-defining-uses/avoid-inference-constraints-from-blanket-2.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"873ad651f783d3ad655cf25f8960750dd11af7ddb4c9051b3859154578125bdb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(-Znext-solver): This currently incompletely constrains 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/impl-trait/non-defining-uses/avoid-inference-constraints-from-blanket-3.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c35ecdbd51eca6de9cf1ba7fd78a90d8cd1751bfc7e254517403dc012998bc2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //@ build-pass (FIXME(62277): could be check-pass? \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/impl-trait/multiple-lifetimes/ordinary-bounds-pick-original-elided.rs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"28a1c20898216c9a0eeaa552c91ca18b223d2e315808ecf36904319968b13887"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(-Znext-solver): ideally we would note that the inference variable \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/impl-trait/method/would-constrain-opaque.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"6683c3a7f4d173faac19f390b2557664bdaf544fb9ab23d7c97ecfd373d7bc49"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(type_alias_impl_trait): inform the user about why \u0060F\u0060 is not available here. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/impl-trait/issues/issue-78722-2.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"f18a8e86e4e2d54c1bd8263bbe335349370f1ddbc7f74368c5f022acfd21be42"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(compiler-errors): I\u0027m not exactly sure if this is expected to pass or not. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/impl-trait/in-trait/specialization-broken.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ec9a1d1ec4f9da8839ae496c223bfd7a61993a27893ff690e6a9a2fe65a4bca"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This should ideally use a fully qualified 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":"tests/ui/impl-trait/diagnostics/fully-qualified-path-impl-trait.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"181c3e7a2ee9dbf023c64f248c56dd54646e990ba7550829b8415331c391991b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: The positioning of \u0060impl(..)\u0060 may be confusing. \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/impl-restriction/recover-incorrect-impl-restriction.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3233f4d2b9099049ad9409dba86a860b635e6b013ea6b5d29c157b7c2828299"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: The following cases are not checked for now, \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/impl-restriction/recover-incorrect-impl-restriction.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"8513e8ed290f3df1d8e36d8576a0de60f8047a4da08b4a2505a3e10143df82b4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: It\u0027s not clear that this code ought to report \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/higher-ranked/trait-bounds/issue-59311.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ab640b6f670960d7a9496cbd4de337a99345683bfe9a9c70aa55a275301e162"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(Centril): perhaps these should be semantic restrictions. \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/half-open-range-patterns/half-open-range-pats-inclusive-no-end.rs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"b69ba07bd529d1bbe6303b3a35d4b98c1e59ff9b9e9494f2e80ec7f6e0712194"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(default_type_parameter_fallback): Consider reallowing them once they work properly. \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/generics/invalid-type-param-default.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"41d091262a2451c19d2187e06a8bc80e1af86a037dda1c54396f409d3a73bd63"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(default_type_parameter_fallback): Consider reallowing them once they work properly. \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/generic-const-items/parameter-defaults.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"658632dcb92bf5be6e4ac3dc0b40f7442fbcb0b1b77bd4a2eccb794d3054c27a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(generic_const_items): We should provide a structured sugg to merge the 1st into the 2nd WC. \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/generic-const-items/duplicate-where-clause.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"16ee1b29b928642b76e40bff2af7758e6546de2120313253a3c8d24ae63917a8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(generic_const_items): Try to get rid of error \u0022entering unreachable error\u0022, it\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":"tests/ui/generic-const-items/trivially-unsatisfied-bounds.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"357d5fdd5bc8822c9553dd26341c35455977e25f2e7b40fd0d0c7524be56dc6a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(generic_associated_types): Remove one of the below bounds \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/generic-associated-types/issue-88595.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"19b3058250f3d430a29804bef57825eb187a0fd162336b7e137f81d9573740ff"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This error is bogus, but it arises because we try to validate \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/generic-associated-types/issue-91139.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d5e8a64b05f537f39cc06a0286864d37e3dfb80605823b3ef51aa91bb841a06"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#44265) add tests for type-generic and const-genertic associated types."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/generic-associated-types/parameter_number_and_kind_impl.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd4d90a2b31e47a447341b6e67f6616dd78e08940360db07e94da28f5d518741"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: we require two bounds (\u0060where Self: \u0027a, Self: \u0027b\u0060) when we should only require 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/ui/generic-associated-types/self-outlives-lint.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ee2360209e4c3f3950f0343ed951a84ee1bf5d7669b00b54ee814cd3b08ea27"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: we require two bounds (\u0060where Self: \u0027a, Self: \u0027b\u0060) when we should only require 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/ui/generic-associated-types/self-outlives-lint.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea67461fd0aa90010c62a7b8ff1dfab9e21464b3dd1115805123329ec6df705e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(frontmatter): make this diagnostic better \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/frontmatter/location-after-tokens.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"3751b64c4b87bb8afe11c01f6595dfe17e275ca2918ae444cc51bea1e6ffc3fe"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(frontmatter): make this diagnostic better \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/frontmatter/multifrontmatter.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d024f3c8cf3a838b8a15687a468ccb12ccee312d2c8b45ffac8361670820b0e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(f16b): \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/float/f16b.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2073dd57231c45e46014976c3389eeecf9196176c342bc01de765c9a70a7431c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: these assertions fail if only x87 is enabled \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/float/int-to-float-miscompile-issue-105626.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"95fc50a06d2dc80ec280a2ddfe7d8e7847ed7b1c056570667ef5c4ca1d2a9005"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(FRTs): adjust error message to mention \u0060field_of\u0060 \u0026 prevent double errors \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/field_representing_types/invalid.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf8acbec158493aa2b58ecbd9b2a2cca0ac3aeed009910cbd5bd73479ef398de"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(FRTs): improve this error message, point to the \u0060union\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/ui/field_representing_types/non-struct.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"665ec96da4dcb9cb50069eb85375ba010fc6319a46195c1ac31e3454dd2c9a33"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(FRTs): improve this error message, point to the \u0060enum\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/ui/field_representing_types/non-struct.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fbeeef0bd03292489a1c84c32579f47d1d89bb844d3b774a25302bc8c520f50"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(FRTs): make the error mention the variant too. \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/field_representing_types/nonexistent.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef0422daa283f6ec3e640c1e87a0efa2f0050cfc0351537484499601830862e5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(FRTs): select correct 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":"tests/ui/field_representing_types/nonexistent.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"b235b5a596ac6f1701cfadec39e81991287f3f47115e9be4b8e346702e0c2a61"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(FRTs): improve this error message, point to the \u0060repr(packed)\u0060 span. \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/field_representing_types/not-field-if-packed.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"85679da0176909236dc16699fba8d150d10e4985ddb419e1018e73e96ae85367"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(FRTs): this requires relaxing the \u0060Base: ?Sized\u0060 bound in 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/field_representing_types/not-field-if-unsized.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"f44cc9f06b31e83bec9cd77e9376609403e1508c0f8f74d25d5578c72825f7a9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(FRTs): improve this error message, point to the \u0060dyn Trait\u0060 span. \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/field_representing_types/not-field-if-unsized.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff03ec0ad108a1dcad0d1e1cceba9acfa03514462ead2648658a7dddee9bdb9c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(FRTs): need to mark these fields as used by the \u0060field_of!\u0060 macro. \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/field_representing_types/offset.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdc312e762ef47ad5338acb23af1aeb7f27c1e46068a405d38e8bc616dd3937a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(jdonszelmann): empty attributes are currently ignored, since when its empty no actual \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/feature-gates/feature-gate-allow-internal-unstable-struct.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5f0ec867eb9ecef7673bf7078783c6281ad83c470422236b81a40a79d86dfdb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment repeated across 12 files: The identical FixmeComment appears in 12 files (12 occurrences) \u2014 almost certainly one boilerplate line from a single migration or decision, not 12 independent debts. Fix the systemic cause once rather than file-by-file. Text: \u0022// FIXME(#82232, #143834): temporarily renamed to mitigate \u0060#[align]\u0060 nameres ambiguity\u0022. Source code is not a task system: track the cleanup where tasks live. (Every occurrence still counts toward the score and metrics.)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/feature-gates/feature-gate-fn_align.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2ceb85eebaef7fd06497934a2e6eef1c32cd9489ff2ed7334f2708a51e96c49"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(mgca): add suggestion for mgca to this 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":"tests/ui/feature-gates/feature-gate-gca-macroless-args.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"610f6a1e22fd242e4efab4f249cce1b74baa541e16892f87802b1221411a566f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(mgca): add suggestion for mgca to this 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":"tests/ui/feature-gates/feature-gate-gca-min-const-items.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ea1a5f854b54698bd58f0e0e1242f0394267ec4761d7c65f0cba002c19845dd"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(@rust-lang/lang-team): consider relaxing this? \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/expr/if/if-no-match-bindings.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"419217e5de2ee1fdb9c5fe0c905f0b1d2e7bb0eb522c7c9df570f52e01b05879"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(60254): deduplicate first error in favor of second. \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/expr/if/if-without-else-as-fn-expr.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1589564b9e69b799a514ff1fffee22367b3ff5372aef1e681f619d25af302b9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(explicit_tail_calls): overloaded index is represented like \u0060[\u0026]*x.index(i)\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/ui/explicit-tail-calls/become-operator.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"02990673b708d36cb16ecdbb3da21c8e87d5aa355f7cee0d54bae614d2f75102"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Right now, the wrong field is blamed. \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/errors/traits/blame-trait-error-spans-on-exprs.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d0b01686fb37430e3d04e022e7ca14312989ecf7243ea251181c20136ea5657"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment repeated across 39 files: The identical FixmeComment appears in 39 files (39 occurrences) \u2014 almost certainly one boilerplate line from a single migration or decision, not 39 independent debts. Fix the systemic cause once rather than file-by-file. Text: \u0022// FIXME(#125418): linking on Windows GNU targets is not yet supported.\u0022. Source code is not a task system: track the cleanup where tasks live. (Every occurrence still counts toward the score and metrics.)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/eii/eii_impl_with_contract.rs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"58fd91fef1b01ec65026d1256ad5d40b444707d8c0a2a352d6a9c84bb4ccee4f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#157649): static EII defaults currently fail to link on Apple targets."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/eii/static/default.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3dcf71a1aba2d3ab0ee0b5a96fe65f181092d048a4a9ab50ce4fdd8cb915923"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#157649): static EII defaults currently fail to link on Apple targets."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/eii/static/default_cross_crate.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb2d3e5a5e62e5b9ecffa43a0792da5ead1493d18be91e630cf30bc92b2a6ce0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#157649): static EII defaults currently fail to link on Apple targets."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/eii/static/default_cross_crate_explicit.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"63ead25fc64ae8a90480d2e8f4cce6346017a2ef4c77f6c5c06070f7c54e1d02"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#157649): static EII defaults currently fail to link on Apple targets."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/eii/static/default_explicit.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ab2b69d0489f1604539f357594920c4e4f7b3aa9b776a572ce848508fafbc90"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Edition hygiene bug, async here is 2018 and reserved \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/editions/edition-keywords-2018-2015-parsing.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"e83cdfd3b4a8bdba267ee4a82d663258cf61323b589cc5e10abc1162b70ce514"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Edition hygiene bug, async here is 2018 and reserved \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/editions/edition-keywords-2018-2018-parsing.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"500192d94a15f396af53d71622214e6e98f7770f85bd834861e37de12c911b9d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#47949) Any use of this indicates a bug in rustc: we should never"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/drop/dynamic-drop.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"6661f9b6d7d8884ae89616ef9b274d20b2ef98e7652ff7362f3545d824887ead"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME (#47949) We leak values when we panic in a destructor after"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/drop/dynamic-drop.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d35ee64fa1e759379b70c3993a0998db13c826daa8a64de8f66885d7fa889db"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME (#47949)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/drop/dynamic-drop.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0bdc37689f1942955011bbef3ea9994111947e1544b6a6edb88c5b9923bb943"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME (#47949)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/drop/dynamic-drop.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"59275f4f75e357f5902c9efd16c605272f50908a98168cd956e4b55690e26422"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME (#47949)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/drop/dynamic-drop.rs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"0afddb9fff846b467e7e9e543629ea2ec7f7349257b7fe007b14d9296da0bba3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME (#47949)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/drop/dynamic-drop.rs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f06f3cfd322055877c36e68247e7638eeb14cb12dd910844bd4e2ac1fb73845"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#124794): the previous three structs all have a trivial \u0060Copy\u0060-aware"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/derives/deriving-all-codegen.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e9af0b7ff9529ee4c6ebfcf1dd1e8f6b8465e38b314fa619d5c52ff734bbaef"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this case should also have a trivial \u0060PartialOrd\u0060 impl. \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/derives/deriving-all-codegen.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"02d87b7bef41ec3532af5149e0acc27f7dd8e10108ac0144abbd24205c1882ea"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(fn_delegation): support heuristics to wrap return value \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/delegation/self-mapping-arguments-errors.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"90c345988bb4166123e9ec7282117d1aa090cba1b05aae81f04a623f2eb4d36e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Inherited \u0060impl Trait\u0060s create query cycles when used inside trait impls. \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/delegation/unsupported.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"24961146c7b984670a65ef54790f88445e386c92599d0f76b621b8bd9bfdf5ac"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(fn_delegation): Uncomment those tests when proper support for \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/delegation/generics/mapping/trait-to-trait-pass.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0a9dc9bb89d3429c8161b0c76285750786e5032134273135254ef2615f5bded"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#140620): the error is reported on different lines on different targets"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/debuginfo/debuginfo-type-name-layout-ice-94961-2.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"190e9bade91901901e3924ea333bc30142706e657b8ed56edcf7696931cbfede"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: \u0060test_case\u0060 is currently ignored on anything other than \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/custom_test_frameworks/full.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3a7ce13ac2209adb42e5b8bc87fc5d2bc627a0d1ee176d81391e57e58d745cd"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: as above. \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/custom_test_frameworks/full.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"5904919bf820826dae642a76a662905a4d60faaac1f61386d8189510d3487b36"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //@ ignore-ios FIXME(madsmtm): For some reason the necessary dylib isn\u0027t copied to the remote? \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/cross-crate/exporting-impl-from-root-causes-ice-2472.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e761bd6f950c1ac8f320ebe8c32f3bf557cc880925f8d6702d3594b4fccc421"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //@ ignore-tvos FIXME(madsmtm): For some reason the necessary dylib isn\u0027t copied to the remote? \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/cross-crate/exporting-impl-from-root-causes-ice-2472.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ed55dca2b8b2da144112537c62265e799340699abdd93708b2f00a3b4340cb8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //@ ignore-watchos FIXME(madsmtm): For some reason the necessary dylib isn\u0027t copied to the remote? \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/cross-crate/exporting-impl-from-root-causes-ice-2472.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"497b854a3234f572cb1313db3bdd277be344ad6490c792d1376a9c91fa313fd9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //@ ignore-visionos FIXME(madsmtm): For some reason the necessary dylib isn\u0027t copied to the remote? \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/cross-crate/exporting-impl-from-root-causes-ice-2472.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"28203ad40214005c0d37d72fe35fafc13d8ffd672b19a6416f26de6b6f1e551b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#130766): When the \u0060coverage\u0060 attribute is stabilized,"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/coverage-attr/bad-attr-ice.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"799051e6cf5e18aab631397cad17a659211e06bf814c1fbf5a47773f9d86c53e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#63818): niches in coroutines are disabled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/coroutine/discriminant.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"07979cb41fbb431130d018c8c1073e9ccc2430a8d291f3410a1686da601cf24c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#63818): niches in coroutines are disabled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/coroutine/discriminant.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f40a3e9699d6f062654dffe4c69bccb01b1178d1687e205f25d22a68052c453"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#63818): niches in coroutines are disabled. Should be \u0060assert_eq\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/coroutine/niche-in-coroutine.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"81ab568a4ae80014131a21ee0a9f94225c3b871408b865a4ae4d52ce6775f07a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this should compile. \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/coroutine/parent-expression.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"b449d91e2acac8de0a3f318d27c2df8bcddc48b7a55f76540cd39fbdd79f06db"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Improve the error message here. The macro thinks this is a 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/ui/contracts/disallow-contract-annotation-on-non-fn.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6343c06963b0425495c4859fd3086bd7bbfb67fd81aa6928530300df2687601"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const_trait_impl) aux-build:closure-in-foreign-crate.rs \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/consts/closure-in-foreign-crate.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d59b1926777ff06158201435fc51a41d7dfc5355637f2a50ebb203a534deadc3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const_trait_impl) extern crate closure_in_foreign_crate; \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/consts/closure-in-foreign-crate.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a1cd50c58b3c9980a136eb66454f706d15381295c364c7879c558cda6dae652"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const_trait_impl) const _: () = closure_in_foreign_crate::test(); \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/consts/closure-in-foreign-crate.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"34440cf1c0848ee15c96b1dd9e19646ef0161ba18866c571339a5a33170cd63d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const_trait_impl) make it pass; requires const comparison of pointers (#53020)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/consts/const_cmp_type_id.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbf4c9eed4e5e815fac83923c2ef02b15fceb30993b9e60b315ec4ecdca59b51"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this method cannot be called in const-eval yet, as Box isn\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":"tests/ui/consts/const_forget.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"8273339d8ab432d4407a030e09b6de287d5dbbe4cc5bc1905852fb967f3dfa02"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME the span here is wrong, should be pointing at the line below, not above. \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/consts/interior-mut-const-via-union.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"3da12a1ba368b3e0d385c0744a0f5c557fd1f7f5c3cc03973b7b794f5fd294ec"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME (#135952) In some cases on AArch64 Linux the diagnostic does not trigger"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/consts/large_const_alloc.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"7264554a9a32fda06e098e5325568e4be69272769e23523310ff19909666e0ff"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME (#135952) In some cases on AArch64 Linux the diagnostic does not trigger"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/consts/promoted_running_out_of_memory_issue-130687.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"904f3f8048b8d28b5a603552753f0d20240b005216c1320461cdaf382aca4c98"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This could return \u0060Some\u0060 on platforms where function pointers\u0027 addresses actually \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/consts/ptr_comparisons.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b241194b540ddc7f54faa4c532d1b58765cf20a1274ff8e627968de11d9fb37"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: we make these associated consts to work around \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/consts/qualif-indirect-mutation-fail.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"07242d1e737b52c2393af6f45831f77757bd047601500afea66bc4eefb7ab562"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME check-pass \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/consts/unstable-const-fn-in-libcore.rs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"042f3978eeb178995f6d573add54d5e9a75a177b4c07ca8d97a8854e60c246d9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //FIXME ~^ ERROR destructor of \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/consts/unstable-const-fn-in-libcore.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0067635ced75620fb52a9d5b72e75e99d99068d69cab713fb7f5d0fc5223ee5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //FIXME ~| ERROR destructor of \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/consts/unstable-const-fn-in-libcore.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2f6eb3b6e1e42c65c1a48c1812ad6b2948c6735062eac7fead21acb54026dc5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //FIXME ~^ ERROR cannot call \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/consts/unstable-const-fn-in-libcore.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fad153469fef5ae3920154cf267edbcc48d0f12b0286496d6ca1f16b8ef2f4c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: the error message makes no sense \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/consts/extra-const-ub/pointee-type-with-error-issue-159560.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"af9386eed68452ac5f0232e454d04cdf796c2c2416427742da3fead7e5908cec"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this should error someday \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/consts/const-eval/const_fn_ptr_fail.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"56cff3f2c07f1511f4852421e2c38919b2f2c925bca00ed318217141e3908723"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: should fail to typeck someday \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/consts/const-eval/const_fn_ptr_fail2.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"c72c4b094d9bdbcf395c2547f5abe7f27683c19a6e92bdf11928957d59c262c2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: should fail to typeck someday \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/consts/const-eval/const_fn_ptr_fail2.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b21392bbc1365815cf26f8d7860897d940427a0def5737dc043b6f22fc219d9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: currently we do not detect this UB, since we don\u0027t want the result of const-eval \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/consts/const-eval/const_fn_target_feature.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3b85afda0ac93383523115b8a7bab3ee30dbfec5d2d175ad6906a975d20209e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(oli-obk): this should instead panic (not hard-abort) at runtime. \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/consts/const-eval/promoted_const_fn_fail_deny_const_err.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"56c59514d45879a243ee417458b7b4973bc892c8fb2c5404a3019e666c6f09c4"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: this test passes only because this is a const fn that is written to metadata \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/const_prop/ice-assert-fail-div-by-zero.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf8446482c396f6ce199e2dbf0c2b51b8faf56ab360d2f3578861419feae6f0c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: currently the compiler let this pass \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/const-generics/allow-self-in-const-generics.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"500287a04f969b9744055ef39aafa7b0f9ecaf34ec14a6f17cb92b72769d7024"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(fmease): This one is pretty bad. \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/const-generics/bad-const-generic-exprs.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"beb48aa480bb2b9e1fac50b6cc10de345edfe81e64432ba3e8ad7a58b13e73a7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Only works cross-crate \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/const-generics/legacy-const-generics.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b52b0e9c333c157c8b6625dfb98fc94051ba04718a48d11f0f24c209d4acf72"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const_generics): we should hide this error as we\u0027ve already errored above \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/const-generics/type-mismatch-in-nested-goal.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d4053f95d7ec91dc6a43a3101631ff33998da5479ef0b57f8d704185e867f6a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const_generics): these diagnostics are awful, because trait objects without \u0060dyn\u0060 were \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/const-generics/min_const_generics/const-expression-suggest-missing-braces.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb8bb626625ef6f185bb408b7310b0ed063db095bbae9c8628be562c6b13afcf"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(gca_min_const_items): this shouldn\u0027t have to do silly (expr,).0 hacks \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/const-generics/mgca/adt_expr_infers_from_value.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"e306620ea9b4cd2bd07b196743760156a7d6d0a553132c87f807a5b1c0f31dd4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(gca_min_const_items): using statics as direct const arguments should error instead of \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/const-generics/mgca/static-const-arg.rs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ee04e47c9596e239c141c07d543e667630cdc245b438c9a74979e8e693a7a30"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(mgca): need support for ctors without anon 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":"tests/ui/const-generics/mgca/type_const-not-constparamty.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"29dc71e415b7307a26511fe73a8ece8b4e60152eeda164f06b581980457cbaf7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(mgca): need support for ctors without anon 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":"tests/ui/const-generics/mgca/type_const-not-constparamty.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aa85c78c6fda82cafd287ef8e6316571ad934949dbef7354dfa56c114aa0b87"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const_generics): Ideally we wouldn\u0027t report the above 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":"tests/ui/const-generics/issues/index_array_bad_type.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"5826ea92a5b3a443df83df1c59a398abdbca3f1acbbfe0ab348bef78903e7371"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const_generics): Currently this only suggests one const parameter, \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/const-generics/infer/one-param-uninferred.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6eed9f3e4724352231dd1f4a89b58f84e3767fd873b0100ab18483207544eb5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(generic_const_exprs): come up with a less brittle test for this using assoc consts \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/const-generics/generic_const_exprs/nested_uneval_unification-2.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dd2064329c7defc7df9ab26a5e7d984587ffd7c5e239edff3aa6c3c92ac15fb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(generic_const_exprs): Revisit this before 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":"tests/ui/const-generics/generic_const_exprs/type-alias-bounds.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"84354d6b4250a7746811ba7cb0a66e57e932c9c00b0333c856b07bb2d7a6d083"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(generic_const_exprs): Revisit this before 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":"compiler/rustc_lint/src/builtin.rs"},"region":{"startLine":1288}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c29eab4c0322fa24ba093437a3da344b07c87d327cdade65d88efb60fa88304"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(bootstrap): This isn\u0027t a known bug, we just don\u0027t want to write any error annotations. \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/const-generics/early/const_arg_trivial_macro_expansion-1.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa85cbb2728fd89c917d70f61f06efe0febdd0f816c3ddc48030cc5955c6023a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const_generics_defaults): It seems like we aren\u0027t testing the right thing 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":"tests/ui/const-generics/defaults/default-annotation.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"dafba9fbcff195e728610852147f0b2879fd97c71511e4049465bb8623f345bb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(mgca): Ideally this would compile -- at least if the user annotated the instantiated type \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/const-generics/associated-const-bindings/dyn-compat-self-const-projections-in-assoc-const-ty.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"55f3c5aeb7eb8fe2b2b8572dba9e2b11abbc4cec007f14fd13e3002ebc5bc300"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(mgca): Legacy mangling still crashes: \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/const-generics/associated-const-bindings/dyn-compat-symbol-mangling.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f3f23da152ac73236b3f9cb64675dbf6e6331e2fb907ae3bd6ae5953ea59b3f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Currently shows \u0022cannot determine\u0022 but should be \u0060false\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/ui/conditional-compilation/cfg_accessible-bugs.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"eebc815ed469cab1f3a6b274009bab534e4cb414c04d8959dbf4a19a6d6be8aa"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Currently shows \u0022not sure\u0022 but should be \u0060false\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/ui/conditional-compilation/cfg_accessible-bugs.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ea43e27a42102baa17a3c00431e3a116896afc1e00d436cea6b1ec3d895c72f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Should be an error for edition \u003E 2015 \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/conditional-compilation/cfg_accessible-not_sure.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ede0761e789aba7d83eb0addc370996e645b48b526b10c1f7e83a2f9f25b7e6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(comptime): closures should work, too. \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/comptime/comptime_closure.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"748d89f68dbb35cd5d9b8e047e1776f25844ea0ee1c4590d443ed58e6a080948"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#149379): This should pass, but fails due to fudged expactation"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/coercion/fudge-inference/expectated-input-not-satisfying-fn-bounds-issue-149881.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"77f7db7367f5dbdf215b17a260c269a8154d393a5f993b2c1ec8da43eddec983"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#149379): This should pass, but fails due to fudged expactation"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/coercion/fudge-inference/expectated-input-not-satisfying-fn-bounds-issue-89299.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca1ce3f2319eef64e8aae645c2dd2882c2262ee2b4a1a0ea89d838e751385fbf"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#149379): This should pass, but fails due to fudged expactation"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/coercion/fudge-inference/fn-ret-trait-object-propagated-to-inputs-issue-149379-2.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"8919912f68a4a8e383fdb1a8bbf642791b67cb8569d82f04ac9a380c3eb6e324"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#149379): This should pass, but fails due to fudged expactation"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/coercion/fudge-inference/fn-ret-trait-object-propagated-to-inputs-issue-149379-3.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"344028b9a743a1fc344f1dbab4a2ec04fa2fa7a410d85e031305f863d249e6a2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(eddyb) Improve unoptimized codegen to avoid the temporary, \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/codegen/issue-28950.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"89e578da18e20c368ff56b788cb2c2bd3b5be4804996b1a8f46e0e7e5d747492"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(eddyb) this can be vec![[0: LEN]] pending \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/codegen/issue-28950.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa5fe9d64f84a5e2a73040759aef958fca41d4f90b2c27c17ddcf82964fca4ec"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#135985): On its own, this test should probably just be check-pass."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/closures/2229_closure_analysis/unresolvable-upvar-issue-87987.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f1ec90a971c65b129b065063797b3959b5af51b3e095a370651b709ae1a7293"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(arora-aman): Change \u0060_x\u0060 to \u0060_\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/ui/closures/2229_closure_analysis/wild_patterns.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b767944f3f4d93e2a5e50ca63e15051e2ac66c953ba4222ad9883cd2cf590e5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(arora-aman): Change \u0060_x\u0060 to \u0060_\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/ui/closures/2229_closure_analysis/wild_patterns.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"933f07ee54cde8144ef9fce1996e46e69260faacda5ded72c44a605fce377d5f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(arora-aman): Change \u0060_x\u0060 to \u0060_\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/ui/closures/2229_closure_analysis/wild_patterns.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"32fede32abf17e552f9b3b510631316648e166ea4bf7880b7436b4a135847340"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(checked_type_aliases): I consider #100041 to be a stabilization-blocking concern for CTA!"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/checked-type-aliases/unused-generic-arguments-not-wfchecked.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"03d239212684904ea30ba6aa69e50c018bdbcff476189c08249c634edf1c0bdf"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: \u0060str: Sized\u0060 unsatisfied \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/checked-type-aliases/unused-generic-arguments-not-wfchecked.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"7901026eba1661bf8ca7540b20f7b03cc044ccc5274532a8181f02acf12feace"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: \u0060str: Sized\u0060 unsatisfied \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/checked-type-aliases/unused-generic-arguments-not-wfchecked.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa88790f405f44a879946e3feefd02d1105e0169b6e726428c5b10e23feba25c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: \u0060panic!()\u0060 diverging \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/checked-type-aliases/unused-generic-arguments-not-wfchecked.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a1eb7f6ac87be7f05f89190e90223cb92a2c9905430363f12b53ecc013b5d5b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(checked_type_aliases, #100041): At the time of writing however, that\u0027s not the case."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/checked-type-aliases/unused-generic-parameters.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"53b2f4c33a047eeb8a986be53e422e75c2fbdb206ae721163a6b5e4e4a3e8a68"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(checked_type_aliases): Revisit this before stabilization (it\u0027s not blocking tho): \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/checked-type-aliases/variance-0.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff5f7b9fd9ded4add68f93fcdac5748c12fc22af383ee5671d777d4c0c48f377"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(checked_type_aliases): Revisit this before stabilization (altho it\u0027s not blocking): \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/checked-type-aliases/variance-1.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5ad69aa51ef6f5d6efb15dcbc1f31f6315ed4bb4b9f765ca54f08e1f40ba30d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: add a roundtrip test for c_longdouble and the types it aliases (x87 f80 and ibm 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":"tests/ui/c-variadic/roundtrip.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bacab061ecb63fc6ba7fe25e1e84e7597b5fe0b47b08c3a7f4342a2d353ec6b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Ideally we could give an unreachable warning \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/c-variadic/variadic-unreachable-arg-error.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcc1e6fab3f0379ed58c1a9dc402e60ab188a9e8e9e71e648a37b29cfbb95c1d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#54987)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/borrowck/assign_mutable_fields.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9cdbaecc795d9cfbf8459d6fb56f6289d2271ea8b99ea6dcfa37b677a6baf11"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#21232)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/borrowck/reassignment_immutable_fields.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"defb51b2805fc80e212c7e2b6d9e23ee4dff0d7780a070ca7f5057b66838ed77"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: ideally \u0060LocalKind\u0060 would carry more information to more accurately explain the problem. \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/borrowck/return-local-binding-from-desugaring.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cd99381fa3be348442d751cd84258f9ba54f8b2e3c470488b2741f2f5933f9c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: for clarity, diagnostics for these cases might be better off \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/borrowck/two-phase-activation-sharing-interference.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca5a81ff34417f8f7757c1ea5188265b01e2de6862eb4fa88572f728ceab1907"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: we should be able to suggest borrowing both side \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/binop/borrow-suggestion-109352-2.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7c2d1eb25adb2d8fff5d3b158dd86050dd6179adf7398376d680aefb1c97044"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK(eddyb) work around the fact that verbosely demangled stack traces \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/backtrace/backtrace.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"b29709a86561908ae6e4aa6c17eed4bf7363dcda0f5b51d55f104e91ccd1221e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(jieyouxu): use proper \u0060BacktraceFrame\u0060 accessors when it becomes available. Right now, \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/backtrace/dylib-dep.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"ace11b5c871c43acc50e546ada9dead4ba08626e10b34e1111e45da19633c2f4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(jieyouxu): make this test use proper accessors on \u0060BacktraceFrames\u0060 once it has \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/backtrace/dylib-dep.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d3aa4f4b839ed489dcbb91680381ec9c75c6d7857bd4ea09c9a28181eb16aec"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: we use string matching. Replace this by getting the actual data out of 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":"tests/ui/backtrace/line-tables-only.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b4da7d6b99896205c3022073c94ea5c4a5589f767ba6fd17f7d74d80cf3d2f3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(jieyouxu): for some forsaken reason on i686-msvc \u0060foo\u0060 doesn\u0027t have an entry in 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/backtrace/line-tables-only.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"be0dea6a3be550d3ef4a5aa3cf97b7bb7ba956ecb056beafd1405bb1980a3d38"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // that. FIXME: Give a nicer error and suggest to the user to have a \u0060\u0026mut Foo\u0060 input 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":"tests/ui/autodiff/autodiff_illegal.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"78e94e7008e3f8779d09891d921b9e7dd88fa59e36419157e45f17d134eb81b1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: make sure we have tests for these targets. \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/attributes/dump_generics.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea79a3a608448a2168e0b7d3d0baa390cd8ea081a2c2661394f9ddea193fe5cb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#623): - these aren\u0027t supported yet"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/attributes/item-attributes.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"df2375f0bd889e2c64f4f04fdc094ca12a38889282a48178afd83f0160e4e050"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME?: \u0060bar\u0060 here expands before \u0060stringify\u0060 has a chance to expand. \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/attributes/key-value-expansion-on-mac.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"68e60af8f9e21f3344f78f82d41d125bfc89e8279c1548b71e498c0c0c8e2747"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#126763): the field access span should be \u0060$a.$f\u0060 in the macro body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/attributes/show_spans_macros.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"05936767dc9dc9405c9167451a0586ba5d38c23e8f5eda7372884f2c812c4a70"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#165450): RFC3791 says the injected \u0060#![\u0060 and \u0060]\u0060 should not be taken into account in spans"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/attributes/z-crate-attr/position.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"1282e8c8306cf3b071f20f58cc4a89ad26a1c59e53fee22b2eb777409cfab9df"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: It would be nice for this to work. See #94067."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/async-await/field-assign-nonsend.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"194ec6244ea67b1775d243d0676b5bc0fb8db741fadae0f5757de0bb0520f9ff"}},{"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":"tests/ui/async-await/witness-auto-trait/higher-ranked-auto-trait-9.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"99daa79b16bd6ab1f500c725a0b8d172f3db70bad249181ffbd8efbf5f068d65"}},{"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/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_function.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0203427fe3df2e5e331bf70e90c96ef169bcc84d4f4fb98a1e23269ce794718"}},{"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/tools/rust-analyzer/crates/ide-assists/src/handlers/unwrap_type_to_generic_arg.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"71eca761e5d03d612f2cdb1344cb41c5ae5eff3f7d73ea39df21c39622e204dd"}},{"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/tools/rust-analyzer/crates/ide-assists/src/handlers/unwrap_type_to_generic_arg.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"915286131d47cf05ead8c44b0fadb8509fd1c87e5afc9469e46ce307fe194326"}},{"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":"compiler/rustc_hir_typeck/src/fn_ctxt/suggestions.rs"},"region":{"startLine":1412}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa3b286c491589343adae45f5e45c405e84305213600cf3a722b4ed2f9ee37d1"}},{"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/ui/async-await/track-caller/panic-track-caller.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"a593e9738776cc8525019aef45e7fbe8415407a241bdd814d227706430f79e89"}},{"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":"src/tools/miri/tests/pass/async-panic-track-caller.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"4138eeef043f5a8807aaba7bf4e0da308b3782295661cd75634cd9611a250f24"}},{"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/ui/async-await/track-caller/panic-track-caller.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"49e87d3b268acb54002a8b572acfb1c5ba4780cd67d8b6bef8a835a562da445b"}},{"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":"src/tools/miri/tests/pass/async-panic-track-caller.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"055aa204e3fc417bcafe5bc92f0907f599ac5324bef14b7d6fd6277dee23a547"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME ~^ ERROR \u0060impl Future\u003COutput = ()\u003E\u0060 needs to have the same ABI as a 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":"tests/ui/async-await/dyn/wrong-size.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c097ca1d703be83fb28d4e55f710d76d575229c1faf805f340fa8c1135c32c3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(async_drop): boxed dyn pointees should eventually use async drop \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/async-await/async-drop/async-drop-box.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bb91ce1be296224cf9c0ec8c76c534a902a6f613ac97e32f250d87700f31abe"}},{"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/ui/async-await/async-drop/async-drop-initial.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a48db19ea62bd8c9919013467da6aae644aca1edb47bf56aeb297d2f91a48e9"}},{"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/mir-opt/coroutine/async_drop.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4b5290bb8a1d902ee484bbd720f7599f85cdc29ab21582ca0126bdb7b87389b"}},{"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":"src/tools/miri/tests/pass/async-drop.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a2a4fe60d6b179eab07b2ad16257c32ed752826305647de4b5895975b74ab7e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(zetanumbers): This check fully depends on the layout of \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/async-await/async-drop/async-drop-initial.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cc12ffba1ac72493924a5496c3c0b14c0d5336dc11825adf80f2be5426a0d31"}},{"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/ui/async-await/async-drop/async-drop-initial.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"64a2f7ca7e5766e21997fb17400fa2513bf423ae6fc9b5987ee88e54adf84422"}},{"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":"src/tools/miri/tests/pass/async-drop.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"34d9974b9bb2811260c9f53279c270030ed6e5e7aa5fa7b704a6d9c3d4d8e5d9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(async_closures): This needs a better error message! \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/async-await/async-closures/not-fn.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"a14781c9cf15bb788b6700d737de5b3135bdd5dc23775f0876ef63bff550548e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: ^ this should raise an ERROR: unsatisfied lifetime constraint from -Zassumptions-on-binders \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/assumptions_on_binders/alias_outlives.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b26664e94006fed9ac16d67a7d34a15b49d05ed33dd3be9ba3a4f0f9ee855eb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(-Zassumptions-on-binders): this should be \u0060impl\u003C\u0027b, \u0027c: \u0027b\u003E\u0060, not \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/assumptions_on_binders/same-universe-placeholder-outlives.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d168be20beb0bd9d573a28fb76b081c644860e91764833f7060c9f12520792d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(-Zassumptions-on-binders): this should be \u0060impl\u003C\u0027b, \u0027c: \u0027b\u003E\u0060, not \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/assumptions_on_binders/test-infra-works.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fbc66c66544ae7d5d1874041ab887ad4a85c0a9afb70e817e00679bbe0bd07f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(-Zassumptions-on-binders): this probably shouldn\u0027t compile, the exit for the top-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/ui/assumptions_on_binders/test-infra-works.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc1b6b26e0e3df1609c37e01f894bfa563814f87f9fdf8c53f3cf2db802b3226"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(-Zassumptions-on-binders): this probably shouldn\u0027t compile, the exit for the top-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/ui/assumptions_on_binders/test-infra-works.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"9367d913f4eccc353daec6e74da70d89010d0c90d35ae83b773d50acbff5a903"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(eddyb) This one doesn\u0027t even compile because of the unsupported syntax. \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/associated-types/associated-types-project-from-hrtb-in-struct.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"a82ddf2c4866b895a9469c077c799db851a8d2b100b9857840bdf94778e2ddde"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(rust-lang/lang): I think this behavior is logical if we want to allow \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/associated-type-bounds/assoc-type-eq-with-dyn-atb-fail.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d87ea3a596e022b83ce713780826714cd6523a3d75e6b2b4c01cce2223f445e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: requires lazy normalization. \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/associated-type-bounds/fn-inline.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6d5df1e77b1cf19af4e74db87417a639ccc555fb2bdd75852bdb8a3c612c69c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: requires lazy normalization. \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/associated-type-bounds/fn-wrap-apit.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a94e8341b9ee3ee8f956138b5a16a41816f3fdc0fb99f2d8b68385bbeb1bc60"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: requires lazy normalization. \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/associated-type-bounds/struct-bounds.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6ec2162033b779fe386d950fc135fea1d0a929db27ddc880063ebfbd7413f07"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(inherent_associated_types): Revisit this decision once the implementation is smarter. \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/associated-inherent-types/dont-select-if-disabled.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"acae478c018cfb263e95701a9bd66f799823296511e2a9cd17f14dd01eb08d2d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#142006): This only covers the bare minimum, we also need to disqualify inherent"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/associated-inherent-types/fall-back-to-trait-candidate.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3757873856c2ac51342be5165de9232e523ebf5e67b10aa2a5b0a0d52089408"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(inherent_associated_types): Avoid emitting two diagnostics (they only differ in span). \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/associated-inherent-types/issue-109789.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6ccc02720305e51f11ca5ba7a7dc987a59cb2a8687ffda921b1cb20864d4dcb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(inherent_associated_types): Enhancement: Spruce up the diagnostic by saying something like \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/associated-inherent-types/issue-109789.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"823f15810a908c6cb82f5d18c441844f27cb9ac12f70a5e4d3789e718f615287"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(fmease): I\u0027d prefer to report a cycle error here instead of an overflow 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/ui/associated-inherent-types/normalization-overflow.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"46bc74fc451e93589bd7da190653e69b336193354c8458fafe1e98f46d816091"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(inherent_associated_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":"tests/ui/associated-inherent-types/type-alias-bounds.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"a354d5dcb2b4380f538472f536618008ee6d891cd8abf018bd2dc0460cfcf0c5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(inherent_associated_types): This should fail. \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/associated-inherent-types/bugs/wf-check-skipped.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"a085944194a2b609098d38f0e4ea7e59da5f5904a447b67f70f26e4634774716"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: see FIXME in compiler/rustc_target/src/asm/sparc.rs. \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/asm/sparc/bad-reg.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"a23ed7cba719bf5b412c8a2b599b66176957a7b7712638c8ebf8209221186f30"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: should be ok if vsx is available \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/asm/powerpc/bad-reg.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"9125f12ec24dcece7bd00c02819241eb05b76ec828ecb6062a394854daa4cdc2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: should be ok if vsx is available \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/asm/powerpc/bad-reg.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"30e4fca86d3db58dbf7d69a91a83d964b9f6e56f090409e8d4a81be068805ba2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: should be ok if vsx is available \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/asm/powerpc/bad-reg.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"37d57da680a8daf618650e4b7b9a2b8bf1575490487c9e475c890700bc572910"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: should be ok if vsx is available \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/asm/powerpc/bad-reg.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"8295a057539e5fb8bea05f3172a610cb1a6b8b1b68b19eb0f1a27f9833e479a9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: should be ok if vsx is available \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/asm/powerpc/bad-reg.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"212097bf9fe9d37daea33ab353bdeb179455774573891c114d6fb3199acec340"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: should be ok if vsx is available \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/asm/powerpc/bad-reg.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"4117aed24425c6f5608ef2a540ef155666b11aca61edee96656c7467c19b66da"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: call guards \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/array-slice-vec/vec-matching-fold.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"84d97edf320e54630f8411198dd314a0797550d6bcdd3bcf774967db68edeca1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: call guards \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/array-slice-vec/vec-matching-fold.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c5684cc3d86e2ab8781e1e7aeb1c0c6928225c38f34afe654fabd47ad58f7c1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(try_as_dyn): should probably allow builtin impls that \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/any/builtin_bound.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"85ee48b03e50388228b048e2ec534efc6a8d07bf66bae87b060f78f3b2d4ff77"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: some targets are broken in various ways. \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/abi/compatibility.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"573ee987592f51cbc352132984497f18b92a15857ca3cfb67ae5901af01ed5e6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //@ ignore-fuchsia must translate zircon signal to SIGSEGV/SIGBUS, FIXME (#58590)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/abi/segfault-no-out-of-stack.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"d513e516fabdddec8432ee73eec0c3f116a8ce4683df830c37aa0dca1b049427"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: \u002Bsoft-float itself doesn\u0027t set -vector \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/abi/simd-abi-checks-s390x.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff769d741017ab94e1907a66661e0b629cf05d5d22c9f196c798f243db2a1fa7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: should be rejected \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/abi/sparcv8plus.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"12afbaa536b4a2244a8e4247ab52f7008e29e21fd996aafdb257a376b723b258"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //[sparc_feature_v8plus]~^ ERROR \u002Bv8plus,-v9 (FIXME) \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/abi/sparcv8plus.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"2df7875c1a0a1491d4ad53b713c56e87b7c6ff37b99dba1dd3c2f57ef4cde0a1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //@ ignore-musl FIXME #31506"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/abi/stack-probes-lto.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"b24734c9c7281ad58ad9a2d2c77ae7f57eeb69a4c5a6d85796ef91454d0431ff"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(workingjubilee): add revisions and generalize to other platform-specific varargs ABIs, \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/abi/unsupported-varargs-fnptr.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f86cb399bcf526f8bfe7d0026d666799622e3230252172ba698944d94438c6dc"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#114479): LLVM miscompiles loading and storing \u0060f32\u0060 and \u0060f64\u0060 when SSE is disabled on"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/abi/numbers-arithmetic/return-float.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"f443a26e8cdd7668ffe83811f1baa2e461ae3cd02840a09ae66590281ded63e1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this test is inherently not FFI-safe. \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/abi/extern/extern-pass-empty.rs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b857cbd7c1c7df8e00059fae39ad081e20a05911649ffa4503093b3d59a0044"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#96009): Don\u0027t emit \u0060unused_doc_comments\u0060 here, we already emit an error anyway."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/rustdoc-ui/check-doc-alias-attr-location.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"e336096a5232dd131abc7f36bf07ba2fa1905818ecbf56696528ea49861c3afd"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#85497): make this a deny instead so it\u0027s more clear what\u0027s happening"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/rustdoc-ui/doc-include-suggestion.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"38a37a81dae2b59532ea1e38916212bb5ae0254508af3e9a2c1d00c930f1570f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment repeated across 11 files: The identical FixmeComment appears in 11 files (11 occurrences) \u2014 almost certainly one boilerplate line from a single migration or decision, not 11 independent debts. Fix the systemic cause once rather than file-by-file. Text: \u0022// FIXME: if/when the output of the test harness can be tested on its own, this test should be\u0022. Source code is not a task system: track the cleanup where tasks live. (Every occurrence still counts toward the score and metrics.)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/rustdoc-ui/remap-path-prefix-failed-doctest-output.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"533c1c6366f7d943514d2378438f5f66588cf7c41b395c106fbcc35d3271c60b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this should say that it was skipped (maybe an allowed by default lint?) \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/rustdoc-ui/intra-doc/errors.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"e51e2d606cd96c504eee5d4326b34bcb7b1b74ded415773cda0a224dccd80537"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: intra-links resolve in their nearest module scope, not their actual scope in cases \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/rustdoc-ui/intra-doc/in-bodies.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"188f2d1c7369bc67ebcc82f4053d267ef915e23d433ba1a8c90a1999aa8aa210"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#74563) support UFCS"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/rustdoc-ui/intra-doc/malformed-generics.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ca9ca92ea30982db62b2ddb0295f564c1b7c16dc6134769aff83f28e07decc7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Associated items on some primitives aren\u0027t working, because the impls \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/rustdoc-ui/intra-doc/non-path-primitives.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"891d32c788cefb95d217ca140d49d8a539783c37475f4c3abf8c9e86c38fcced"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#78800): This breaks because it\u0027s a blanket impl"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/rustdoc-ui/intra-doc/non-path-primitives.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0d329b5b4809543aaec49cc7a932c1ff1578895f43e97575ac3550936bed63f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Ideally, we would actually support linkifying type-dependent paths 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":"tests/rustdoc-ui/generate-link-to-definition/anon-consts.rs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"741d3d2b0e5b1cb97682f2e113989dbebcd95a11ba0a5c5325a599c7d67d2399"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: compiletest doesn\u0027t support \u0060// RAW\u0060 for doctests because the progress messages aren\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":"tests/rustdoc-ui/doctest/force-merge-default-not-override.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a8cf54bf30b26c53e48210b317f21e7b36b9295ccefd0ab0d49db3096f58aca"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: compiletest doesn\u0027t support \u0060// RAW\u0060 for doctests because the progress messages aren\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":"tests/rustdoc-ui/doctest/force-merge.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"c99f9bbd2c8d419872c2a1392e684749e9fde20457b937cd73020d0e24229dad"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: compiletest doesn\u0027t support \u0060// RAW\u0060 for doctests because the progress messages aren\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":"tests/rustdoc-ui/doctest/merge-doctests-auto.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa2462e30ad732b2f365cd566a4e34f767fddf2304f23613d66ec9fa91306736"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Should the trait be mentioned in both the decl and generics? \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/rustdoc-json/traits/trait_alias.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"45c4911cd49d987ac152248a9cc3fd0020cfd03a0122ef436b0093070df24c73"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: /// Hack A \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/rustdoc-json/reexport/private_twice_one_inline.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"c33a73e9135c9a59fe2bbacf6129e5644192425dd3fb668adf8c0995278c16bc"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: /// Hack B \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/rustdoc-json/reexport/private_twice_one_inline.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"65a20cf900397d55f4e0140da838f886fd31efa5dd6363ba01eceb32d46f6d50"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#111564): Is this the right behaviour?"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/rustdoc-json/impls/impl_item_visibility.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"0db4f71df70963046fdc1ec434f141490a6dc81954d1bc164089f81fda87ce63"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#111564): Is this the right behaviour?"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/rustdoc-json/impls/impl_item_visibility_show_hidden.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"f78862944d47e45f553854715f6294f580057f6305dd6a7e2129fa07d7c4b443"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#111564): Is this the right behaviour?"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/rustdoc-json/impls/impl_item_visibility_show_hidden.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"52dbb77809d29540f1b141ce3f265d9648ae297bfaac145edf8b6d5c65e1e3ae"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#111564): Is this the right behaviour?"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/rustdoc-json/impls/impl_item_visibility_show_private.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"62a898045e5baf146bd4f2bdbf5da85eb91659f070dc1dc4815e194d529df6ae"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#101695): Test bool\u0027s \u0060impls\u0060 include \u0022Local for bool\u0022"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/rustdoc-json/impls/local_for_local_primitive.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ad301b5e90681ad42492bc8138f2b3f89e87d57dd89d7614d486fb0634c5078"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Only \u0060get_i32\u0060 should be listed, this is a bug. \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/rustdoc-html/deref-to-alias.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce4a581b48a3c0d924b14cde08a03b7e51e3c08e2509cfed979c4bbdf9b5e410"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Should be \u0060@!has\u0060: https://github.com/rust-lang/rust/issues/111249"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/rustdoc-html/file-creation-111249.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"69c8fca171f3541ec88d5cd8f98eec759ef3f81bb428a3a4baeb500a6272ef07"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Should be \u0060@!has\u0060: https://github.com/rust-lang/rust/issues/111249"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/rustdoc-html/reexport/redirect.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"da70eaeeaa74b54e56bb87f288a9c18edaa1771bc99112fd02add4402c6eaa59"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Should be \u0060@!has\u0060: https://github.com/rust-lang/rust/issues/111249"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/rustdoc-html/reexport/reexport-trait-from-hidden-111064-2.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"6808001881a1ba5893fe9cb2f8c90fdc1edc7310e5c314781230e09c7f80e027"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(inherent_associated_types): Below we link to \u0060Proj\u0060 but we should link to \u0060Proj-1\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/rustdoc-html/inherent-projections.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"691d219d58f35a35a6377ada46d7dc9ab65ea5b905fe05bb8099e610359fff0e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this doesn\u0027t test as much as I\u0027d like; ideally it would have these query too: \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/rustdoc-html/task-lists.rs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"f607ccb1b64929b63ca92877932645fa3bc7134d125a37228f25154077607262"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: One can only \u0022disambiguate\u0022 intra-doc links to trait aliases with \u0060type@\u0060 but not 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":"tests/rustdoc-html/trait/trait-aliases.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"540f69867350b8816baa8b754545681825ccbd7a09e2f0b43c20ebfba3313ac9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: If two macros in the same module have the same name \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/rustdoc-html/private/macro-document-private-duplicate.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"9322ee78ea35b54d4a6667868bf9a44393adc799a04418e5a5bdab0ed0d6bf93"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Make use of (m)GCA assoc consts once they no longer ICE! \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/rustdoc-html/jump-to-def/assoc-items-extra.rs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"73da9353d6e58b12e5ea953908a7273951a1616f33a3092779af3ffa46e92d6b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Support this: \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/rustdoc-html/jump-to-def/assoc-items-extra.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9f3df81d8a70f0b256bf14617d53a84bb3c1e083979e0bbe999d8828d717d1c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Support this: \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/rustdoc-html/jump-to-def/assoc-items.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"147f667a78f0d044893959ed3e3c33c6356e98866739ca345124b7dff0a59450"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Support this: \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/rustdoc-html/jump-to-def/assoc-items.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d1229e591cceb89fcc338bdf5a7bf8a933fa50be7e696f857065b7197b7384a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Support this: \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/rustdoc-html/jump-to-def/assoc-items.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"3584ec46c33e5d2f831384a6356b0c4700e2053be757c1ec3db4aa671b9eb9d6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(GuillaumeGomez): This is a bug, it should link the trait method on the item\u0027s page, \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/rustdoc-html/jump-to-def/hidden-links.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"33a4dea51d9828a71aa91b16cc1f06913064d23bd3ee9c88c25b45a8e0b3524b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: would be nice to be able to check both the class and the href at the same time so \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/rustdoc-html/jump-to-def/patterns.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1d08cd17fa0a791cdbc7af593ecc4731901df0ea7b6fef48be0578c12d1d994"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: would be nice to be able to check both the class and the href at the same time so \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/rustdoc-html/jump-to-def/prelude-types.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd08acf87d7e1650736022e755086e20eb630f595e8836c2d01564fccbee69d4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this one should resolve to alias since it\u0027s impl Trait for TheEnumAlias \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/rustdoc-html/intra-doc/adt-through-alias.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8e00c12109442000b179defde0fd62ad162a461a9baaba8c8ab4905d53daeda"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this one should resolve to alias \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/rustdoc-html/intra-doc/adt-through-alias.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"6123cd30c8ee5eeef20084cf3e6589513e0a22696bc67a8d6fdff0f311c477b3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this one should resolve to alias \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/rustdoc-html/intra-doc/adt-through-alias.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"07f28d4926fa2dcef3ecdd9d4206427509b959ebe508fb64bcba5743233f493f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: there is no way to disambiguate these. \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/rustdoc-html/intra-doc/associated-items.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"256f7b2581032f934b023bb95e953b3efa6dabbd4f419721728c48c65dbdebc7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this will turn !() into ! alone \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/rustdoc-html/intra-doc/disambiguators-removed.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"07d8fb7e324c559e271a451a657ca954168e3c63588bf26ada5da71d0690c1f4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(inherent_associated_types): The intra-doc link below should point to \u0060Proj-1\u0060 not \u0060Proj\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/rustdoc-html/intra-doc/inherent-associated-types.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"781c0260bd8ce1b33251ee68243932e16752a71d5cb067983ee0976d5f6965a1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(HtmlDocCk): Ideally I would\u0027ve used the following XPath 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":"tests/rustdoc-html/inline_cross/doc-auto-cfg.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"3787e8effe5045ecbb6b3b6f5521775c2f9888b07766c33e83a425180c95c266"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: because rustdoc doesn\u0027t normalize types, it doesn\u0027t inline the impl in foo \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/rustdoc-html/inline_cross/impl-for-projection-reexport.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b649ceeab28715034663667b56f15562c2f0095f0744d0fcaec5359b70b7080"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Once the line below compiles, make this a test that \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/rustdoc-html/constant/hide-complex-unevaluated-const-arguments.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"238f3810cbc987336e5891417f43c18c3c26d976f201da302116305e28ba18c8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const_trait_impl) add \u0060const_trait\u0060 to \u0060Fn\u0060 so we use \u0060[const]\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/rustdoc-html/constant/rfc-2632-const-trait-impl.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"416539215ab2c095adebd43d0866c056ca998cb1f73f5c8ccd96448a3644622e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const_trait_impl) restore \u0060const_trait\u0060 to \u0060Destruct\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/rustdoc-html/constant/rfc-2632-const-trait-impl.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"807c3bd42edb3ca0cbc5fb2ad9ffb01140111458243a1b815f93d20c95962b0d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //! FIXME: https://github.com/rust-lang/rust/issues/128733 this test uses external"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/run-make-cargo/thumb-none-qemu/rmake.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"932e44d314cdc497a994bf3e8ff6c059ae0964b8d1795fcb07e6f6f478429392"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: requires an internet connection https://github.com/rust-lang/rust/issues/128733"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/run-make-cargo/thumb-none-cortex-m/rmake.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"af342b94c3a67b142b7846c864c67316468fb42c02e6b1fd337d14e3b51a8f73"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(build-std): ideally, \u0060panic_abort\u0060 should always be compiled 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":"tests/run-make-cargo/panic-strategies/rmake.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"64ddc1e79076d5fa8a272f73eeece768a7e5811aebfef5760c53bb9c4af0acfb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment repeated across 58 files: The identical FixmeComment appears in 58 files (58 occurrences) \u2014 almost certainly one boilerplate line from a single migration or decision, not 58 independent debts. Fix the systemic cause once rather than file-by-file. Text: \u0022// FIXME: Once GCC backend is fixed, remove this \u0060ignore-backends\u0060.\u0022. Source code is not a task system: track the cleanup where tasks live. (Every occurrence still counts toward the score and metrics.)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/run-make/wasm-unexpected-features/rmake.rs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"4897ca14ae28719ff9478bd7565e9501a1c03908b7ad02c4c84496c3d05975b9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#126180): This test can only run on \u0060x86_64-gnu-debug\u0060, because that CI job sets"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/run-make/wasm-override-linker/rmake.rs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f09b4eba51c43dac802a2e39dfc81bfaa4805c339d160e85a5fd279065d7cb1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //@ ignore-musl (FIXME: can\u0027t find \u0060-lunwind\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/run-make/used-proc-macro/rmake.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"b00d66c5106d86d4494ad294639c5d03708e0db0fd3dbcfec61021af8c288914"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //@ ignore-musl (FIXME: can\u0027t find \u0060-lunwind\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/run-make/track-path-dep-info/rmake.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3aa44e20a0703a2e60c6aabeccdf9dbfe7499c6f71eb545cf601d10186a6205"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //@ ignore-musl (FIXME: can\u0027t find \u0060-lunwind\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/run-make/rustc-macro-dep-files/rmake.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6334ec58fb9742532ac8623fa6c55bbf11b6d700436ec0a9b741fb538a3a1f0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //@ ignore-musl (FIXME: can\u0027t find \u0060-lunwind\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/run-make/proc-macro-three-crates/rmake.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0d1c80d58ad57628965aa853178fe8d4805a7bfb99247caae7c5e7ce9152d25"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //@ ignore-musl (FIXME: can\u0027t find \u0060-lunwind\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/run-make/proc-macro-global-asm-changes-crate-hash/rmake.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"09320401dfd1646f0bcb400da1dfd16695109638a51cddaad6dac7bf4b48ced0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //@ ignore-musl (FIXME: can\u0027t find \u0060-lunwind\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/run-make/proc-macro-env-changes-crate-hash/rmake.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b25e9b0158c1b06cf32a7b7ff595654ce87d62647e53c521a1d5030ff944214"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //@ ignore-musl (FIXME: can\u0027t find \u0060-lunwind\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/run-make/proc-macro-dep-source-changes-crate-hash/rmake.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"54f32c09ba520156cb8d4c87a1c069529589fc2fc0f6cce84a8810807eb1cc71"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //@ ignore-musl (FIXME: can\u0027t find \u0060-lunwind\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/run-make/env-dep-info/rmake.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f8dc28e40695941382081d8ed026e205635132052ba60975ca628d52cf59c3f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(nbdd0121): This is broken in MinGW, see https://github.com/rust-lang/rust/pull/95604#issuecomment-1101564032"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/run-make/symbol-visibility/rmake.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bb02098f8b30e0d7aec1665f57a4b0dce6492ae3fc65a60463b732dc47b4531"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(nbdd0121): This is broken in MinGW, see https://github.com/rust-lang/rust/pull/95604#issuecomment-1101564032"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/run-make/symbol-visibility/rmake.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"a645633aab26cb7bfbd478b400924be7f2201459c24f572004cd6a124200f530"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //! - FIXME(#111540): this test has insufficient coverage in relation to trim-paths RFC, see also"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/run-make/split-debuginfo/rmake.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"14d20379e258ab02eb58c433fa1bdf546dfe3047d0499b77148574f9f8d9cf2b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#135531): the \u0060Makefile\u0060 version practically didn\u0027t test \u0060-C split-debuginfo\u0060 on Windows"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/run-make/split-debuginfo/rmake.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf136362687b84fa12fc7db1cb277da8d35c49b153a930b7ea23c0f3f9304dd1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this is very fragile because the output format can be load-bearing, but doing this \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/run-make/split-debuginfo/rmake.rs"},"region":{"startLine":1298}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa93ab458090ccf281a184d4246f754688ac71249b7b8c1a8afb65e0b4eb02a9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this check is insufficiently precise, it should probably also match on suffix \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/run-make/split-debuginfo/rmake.rs"},"region":{"startLine":1324}}}],"partialFingerprints":{"codehealthFindingId/v1":"860e2294718aafff81260231ece839c73728c114660cf625d55c16197e5b5ad3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: the windows-msvc test coverage is sparse at best. \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/run-make/split-debuginfo/rmake.rs"},"region":{"startLine":1367}}}],"partialFingerprints":{"codehealthFindingId/v1":"8578727855cf1001e58dd0cc4d40cc2ac7b9e03a5f22d014733a41b90ab88b0e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#135531): the \u0060Makefile\u0060 version didn\u0027t test windows at all. I don\u0027t know about the"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/run-make/split-debuginfo/rmake.rs"},"region":{"startLine":1381}}}],"partialFingerprints":{"codehealthFindingId/v1":"64de431081577eab643d5da164d747c6584201409f036a29de770c6cad5cab25"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: the darwin test coverage is sparse at best. \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/run-make/split-debuginfo/rmake.rs"},"region":{"startLine":1386}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b88d8ec542901b88e341b256a6d81fb3070c292dbe626eab2a50a342747c5c7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this \u0060uname\u0060 check is very funny, it really should be refined (e.g. llvm bug \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/run-make/split-debuginfo/rmake.rs"},"region":{"startLine":1405}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9204e182c5d4aa36b1c307141ba569006aaaee78904bbc9f79e74b242ef18f6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: we should add a test with scope \u0060split-debuginfo,split-debuginfo-path\u0060 that greps \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/run-make/split-debuginfo/rmake.rs"},"region":{"startLine":1412}}}],"partialFingerprints":{"codehealthFindingId/v1":"229f3cde299c78fc3f3cebc1bb9ef756e6da0e27d3be6c7e7c33435d11c817f5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: the remapping tests probably need to be reworked, see \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/run-make/split-debuginfo/rmake.rs"},"region":{"startLine":1496}}}],"partialFingerprints":{"codehealthFindingId/v1":"beda8c2653823ec0ccabe9884f7bbb160a3d26eb766664bdf9b6bb923977ee37"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // - FIXME(#143198): On \u0060i686-pc-windows-msvc\u0060: the assert_eq! on line 37 fails, almost seems like"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/run-make/short-ice/rmake.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"203c6875cead12e324322c1019938db40f618c30a4dd72bf7c7ac9fe0a0f485e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // - FIXME(#143198): On \u0060x86_64-pc-windows-msvc\u0060: full backtrace sometimes do not contain matching"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/run-make/short-ice/rmake.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"76db738d6588a215a7fd9015bbddba7e7ba0978622d915ed65c8e928755bb39c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: The riscv64gc-gnu and armhf-gnu build containers run as root, \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/run-make/rustdoc/io-error/rmake.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5295af82fac53e40a8a32bba7dd9d2ffdc5b0b3ac324f641a161773209dce49"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: merged output of compile_fail tests is broken \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/run-make/rustdoc/doctest/junit/rmake.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d312ee6c07becc60523c9f7a4904439300433334fc5259843f8d1c1837d6f1f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(Oneirical): Building with crate type set to \u0060bin\u0060 AND having -Cdebuginfo=2 \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/run-make/reproducible-build/rmake.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcc740ebf8a25004c3053275ea07655dbee6a345e6498e43657f59483830e2b7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(Oneirical): Bin builds are not reproducible on non-Linux targets. \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/run-make/reproducible-build/rmake.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2cbae5b230120b8c77e4d6a04201c709d7bff75aedcee1a3b2e4e0002be266a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(Oneirical): Bin builds are not reproducible on non-Linux targets. \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/run-make/reproducible-build/rmake.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"447e4b2b6ec664fa1241649397722e6b07cfa4a657be3bc1d320b9eeb2e2625d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(Oneirical): This specific case would fail on Linux, should -Cdebuginfo=2 \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/run-make/reproducible-build/rmake.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"71a1c146428c321b93f89e02cf87a8737fc96ef4c5c60cc8d6543390c789623f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#129117): Windows rlib \u002B \u0060-Cdebuginfo=2\u0060 \u002B \u0060-Z remap-cwd-prefix=.\u0060 seems"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/run-make/reproducible-build/rmake.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f32a560bc528d0efe0828d3b580bd3de7524dfa6cc38e979e72fafd8c046051"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //FIXME(Oneirical): These could be generalized into run_make_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/run-make/remap-path-prefix/rmake.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aa60d2f42c4bbb141683ebc6f322a024409a0c547b71e914e0397307d234920"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(raw_dylib_elf): Read the NEEDED of the library to ensure it\u0027s the absolute 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":"tests/run-make/raw-dylib-elf-verbatim-absolute/rmake.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bbf5f1ecd09d03de267ed6d409f2e03697a0bf8393288318154272334a37261"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: 91167 \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/run-make/raw-dylib-alt-calling-convention/lib.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"450c345124a636c85bff72bf1b5c494f77b2c4649be3953524da3edee749421b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(jieyouxu): there has to be a better way to do this, without the needs-llvm-components 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":"tests/run-make/print-to-output/rmake.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"0275a17f43e7a929739d904f19fd72ba152cb114a2738d42f74158c208e31efe"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(jieyouxu): there has to be a better way to do this, without the needs-llvm-components 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":"tests/run-make/print-target-list/rmake.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"88c4c885834e0629389a0ad9ff1d10c4bcf62ce4097000a9d34cf16b750b4323"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#127877): certain experimental targets fail with creating a \u0027LLVM TargetMachine\u0027 in CI, so"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/run-make/print-target-list/rmake.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0b9170075b9bee4c34c3dff7a68d58b8faa9efc8ca62de70be53a0327332177"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#132514): Is needs-llvm-components actually necessary for this test?"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/run-make/print-target-cpus-native/rmake.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"433855ba235d9190dcc9675aecab797c1df22ec4460d49e575e0e986d2c76de1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: \u002Bpc was only recently added to LLVM \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/run-make/pointer-auth-link-with-c/rmake.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca99c3551a5b9dfbd9c9f54add8ec6bd860f2ac379858d0a6edc485bdd41fd92"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment repeated across 11 files: The identical FixmeComment appears in 11 files (11 occurrences) \u2014 almost certainly one boilerplate line from a single migration or decision, not 11 independent debts. Fix the systemic cause once rather than file-by-file. Text: \u0022// FIXME: remove the ignore gcc once fixed.\u0022. Source code is not a task system: track the cleanup where tasks live. (Every occurrence still counts toward the score and metrics.)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/run-make/parallel-reproducible-build/static-muts-lib-issue-162203/rmake.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6ad17bab982066aef25e4966f0e4b55a989af2dc53b2b192e8c3b5fb1b21a79"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(Oneirical): the DW_CFA symbol appears on Windows-gnu, because uwtable \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/run-make/panic-abort-eh_frame/rmake.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a39477649fd6f16551f38037aba5fbcddf487814408715bd26b28a1655e5d0d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: it would be good to check that it\u0027s actually the rightmost 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/run-make/override-aliased-flags/rmake.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2b7308c6a5a87d261a851db16e7cabd0566212bb02e5086012af9c823d595a1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: make this work on windows (gnu and msvc). See the PR \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/run-make/naked-symbol-visibility/rmake.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc0dcd39bb1f5a14f2987a5ee707653428af6fb22cf660bf9eb00f034088922c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //@ ignore-test (FIXME #141600)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/run-make/mte-ffi/rmake.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a6d6256e46f8c0af74f97dd9ae5fe4070731edf81ccc9e4685c233f11e247c7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#141600): this test is broken in two ways:"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/run-make/mte-ffi/rmake.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"faaab8569d0f1e3cb8643f96edd0c68ebb965b094fb58c5dc4114d8c40259705"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(@ChrisDenton): this doesn\u0027t currently work with llvm\u0027s lld-link for other reasons. \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/run-make/msvc-wholearchive/rmake.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"91b1705f5074db476552f11ed6f1da6b90c413cf87f9fbf75e3e3d42229981b4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //FIXME(Oneirical): This could be adapted to work on Windows by checking 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":"tests/run-make/lto-avoid-object-duplication/rmake.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"f30825cdf620d33050604ee9447f1a014ec4bd4a8d02370de2783e252f955450"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: we should have a version of this for mac and 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/run-make/linker-warning/rmake.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"791449caf4f1fd3460d0a9efffaeef1fddd09cf31089e9b3af09811c2d45d14f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#110321): the Makefile version had a disabled check:"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/run-make/jobserver-error/rmake.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"39b9874663c4c1abf31c3aa7b293759dc7d0da9f8898b28ee8fc6f446bdcc9d3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this should probably be a UI test instead of a run-make test, but I *cannot* find a way 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":"tests/run-make/issue-125484-used-dependencies/rmake.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e63523d21fbc49d120935a53c5af79211e452863a82e70531fbaef6dfe35ebc"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: The riscv64gc-gnu build container runs as root, and can always write \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/run-make/inaccessible-temp-dir/rmake.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dbefb2b7f29274d2db8f2fc846ed68add9c5c5fa2c8b93be5645e5bd8a7e029"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(kobzol): llvm-objdump currently chokes on the BOLTed librustc_driver.so file. \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/run-make/glibc-symbols-x86_64-unknown-linux-gnu/rmake.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"e449a4b3088d198970262f18ef41548edc8e9659977609c8a685f255b8044dec"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: If this test fails and the compiler does print to the console, \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/run-make/emit-to-stdout/rmake.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"29d19f1a83ca324d96cccdf467a0a4515d3b397748e9e9906a432947c50b27a8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this probably shouldn\u0027t have a suffix \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/run-make/emit-shared-files/rmake.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"4269393d5ef4e81189174e750254634198967e13167c1d20e7695d12450d6b5d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this is technically incorrect (see \u0060write_shared\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/run-make/emit-shared-files/rmake.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"29d72ca61f7f8eb8dd04a93469eeda2142344361751b7c02fc0c8099079bebe2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(Oneirical): Except that due to the reliance on llvm-profdata, this test \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/run-make/cross-lang-lto-pgo-smoketest-clang/rmake.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"b770dba0326c4b02f553e89bf328dea35efdfaec1640fe98cd8affb94f86df22"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //FIXME(Oneirical): There was a strange workaround for MSVC on this test \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/run-make/cross-lang-lto-pgo-smoketest-clang/rmake.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"738635c3c5ea9c0a122e828680c86233a578cc1dc7d3a2d7e9759669d56b505c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This test isn\u0027t comprehensive and isn\u0027t covering all possible combinations. \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/run-make/compressed-debuginfo/rmake.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7d3f1d4576eaf9957236fa533c7b352f59091b350547ea8ec2e348e35170ef6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //@ ignore-android: FIXME(#142855)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/run-make/complex-abi/rmake.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"a89b61750997e2e68a000c52f6617f765072d4597ceb0f9bc84e52b29c05b78e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //@ ignore-android: FIXME(#142855)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/run-make/c-link-to-rust-va-list-fn/rmake.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"676f39806efc94cd9ee82b57cae34ce45e9cab93d49b605238caf7e64fd25ce1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(jieyouxu): check cross-compile setup \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/run-make/comment-section/rmake.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f9da3569f2c3639ae8eb2ef1389a92f62338c53797fc5c1efd1bf23a0a41426"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#131436): on macOS rustc is still reporting the std broken pipe io error panick but it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/run-make/broken-pipe-no-ice/rmake.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a445e18d74437f540b43968ef26551d9a29ff45fa06a8dfe806d0efc7eeec5d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#93754): increase the test coverage of this test."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/run-make/branch-protection-check-IBT/rmake.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e0b1bb8a14a963d648bd7b178ac08a1a4eae94490495c7fb4809defd2a09b33"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(madsmtm): This uses the current deployment target \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/run-make/apple-sdk-version/rmake.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3eadaea66a8cb06580cfd6daa253d8f85f8e7ea1b37d3667ee40d81bac06ede"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(madsmtm): Xcode\u0027s version of Clang seems to require a minimum \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/run-make/apple-deployment-target/rmake.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"698b47c10f56136bb55255d9a6213b26e3c5c76aef51aadd57e2850f2cf822a0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(madsmtm): Incremental cache is not yet busted \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/run-make/apple-deployment-target/rmake.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"065962151430c2fe10e71ace1d18f77da6391bd35eab220ebcb3d3ac497cb686"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(madsmtm): See above for aarch64-apple-watchos. \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/run-make/apple-deployment-target/rmake.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d92a423d8b24d959811c514d8eced33ff017d9589c24e8eb1cb431f1d95e9ec"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#115985): rust-lld on gnu targets may spuriously fail with"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/run-make/amdgpu-kd/rmake.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"0440ab9a5410381706ca97b35823683f7563b0668694a63f1288679f21ee925f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: \u0060\u0027a\u0060 before \u0060self\u0060 is omitted \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/pretty/hir-lifetimes.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa95680f29e4c2de9a7f93d4c2354a2c92e947c6d1ff5167a9f207a03434714e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: impl Traits printed as just \u0060/*impl Trait*/\u0060, ugh \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/pretty/hir-lifetimes.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc3b01d6577e3e162a5781fc8073caa76a947834b6959af21a9767f10564b63c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(?): attr printing is weird \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/pretty/hir-lifetimes.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"612b16d86b3a0bed2246218f5e10bcf63d9db8b51a2c200e943cb0e0f0567124"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: \u0060switchInt\u0060 will have three targets after \u0060UnreachableEnumBranching\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/mir-opt/early_otherwise_branch.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce821d628d30b7e1458eb6ccc29279fe3e51674392206f59a17d1227efcd6dbe"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: \u0060switchInt\u0060 will have three targets after \u0060UnreachableEnumBranching\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/mir-opt/early_otherwise_branch_3_element_tuple.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"a985de70d520ba0347a89fc5d046c297baf3bd34290631a36d02ab67e63bea7e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This test was broken by the derefer 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":"tests/mir-opt/early_otherwise_branch_68867.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"c79121196aa50f5fd4b76ba54c185e36f8070d5354154f3a81dbc84fb94ed4b6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: ReferencePropagation transform this pattern. \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/mir-opt/gvn.rs"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"15297e4f57833e9f53d7d798d30b461c4a8f12c9240882a8888aa5fbe446a8c6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This can be simplified to \u0060Copy\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/mir-opt/gvn_copy_aggregate.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff5c884e7b72f1c0af972edb8ea038a0b745e7f634f4117bb7b379a6beeb6068"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This can be simplified to \u0060Copy\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/mir-opt/gvn_copy_aggregate.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d7de05e045adf39c9a7cc18a1c1116b6642c9780210feded0d79589cbc97afa"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME this could be [[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":"tests/mir-opt/reference_prop.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bdac0bd0375419fe131a323c8a3bf2d73112d944c19192a34a31a84e73850cb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME this could be [[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":"tests/mir-opt/reference_prop.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b7a9988e1b5432792186b3be564571fe1d7e7570a97fce7ce00ac7d6b4569bb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME this could be [[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":"tests/mir-opt/reference_prop.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"afede93e6328a17fef8f790e68273934f7cd4eddbc81f1ab464323ac443a1c21"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME this could be [[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":"tests/mir-opt/reference_prop.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"f708ed96191cebd55c778d629db77b0cafc75228e836e144b1860045a4467dfa"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME this could be [[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":"tests/mir-opt/reference_prop.rs"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"d902e7ca16cbc0dddf4ba76d1e7c814ea2e751475e0fa72e9bcca3765fb66e76"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME this could be [[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":"tests/mir-opt/reference_prop.rs"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"aca99e24c7224ad15f2841de6a0094aa88603150972ba9f7436ad64b390e77dd"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This features waits for DWARF implicit pointers in LLVM. \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/mir-opt/reference_prop.rs"},"region":{"startLine":851}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3ba917e58d736088251ed555e01e203f83e7f620b7c9c99e72a9dde3552ec4f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This features waits for DWARF implicit pointers in LLVM. \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/mir-opt/reference_prop.rs"},"region":{"startLine":883}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3583e54a4d878c56c2a9fde2cabfb415fe3d204f6a66e3cd4f5dbd6f95f0676"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: \u0060if\u0060 forces a temporary (unlike \u0060match\u0060), so the const isn\u0027t direct \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/mir-opt/single_use_consts.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"5baa4fa4d4601aaa19b20877485e7d8b87576688a1f103d349a8aded17ddba5b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#138544): It\u0027s not yet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/mir-opt/pre-codegen/checked_ops.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"c22914220a4ab72e1094fecb3eabdcb3f0601e91916e3ad751dfbb4b2f842657"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#138544): Similarly here, the \u0060Option\u0060 ought to optimize away"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/mir-opt/pre-codegen/checked_ops.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf4570e612596e7c3301714efad52f0da98f2934bd0f1e0eb34113631be59df1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#138544): Ideally this would optimize out the \u0060ControlFlow\u0060 local."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/mir-opt/pre-codegen/simple_option_map.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"34efd5a5e89863fe4e5f9947da40346ed7550b9d7a2c23af991807e2f0412bd3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: add checks for x2. Currently, their MIRs are not symmetric in the two \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/mir-opt/dataflow-const-prop/enum.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"8df827b66070335e69fe8ee043f71cbf36356e4557602545498a28a1d53b2457"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME-CHECK: _0 = const -1_i8; \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/mir-opt/dataflow-const-prop/transmute.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"38344207ac3bee75726d693f6f77e95645d054f65fa056c5a418885974d009f7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Currently, copy propagation will not unify borrowed locals. \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/mir-opt/copy-prop/copy_prop_storage_removed_when_local_borrowed.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"39366b4dc48c0ff70e7d94dd6b4e628889f667235974a42f1f40b5cf9c556a8d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(wesleywiser): Ideally, we could const-prop away all of this and just be left 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":"tests/mir-opt/const_prop/discriminant.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fa7b1405be6f9e6aedd31267420917ba4f7771368800f9513c70e358c0c51b1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This doesn\u0027t get an around-the-end range today, 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":"tests/mir-opt/building/enum_cast.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"66d5e192aa5610adf20190423d937e926e9c222e45e6c29f2c3282dc1513dfdb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment repeated across 38 files: The identical FixmeComment appears in 38 files (38 occurrences) \u2014 almost certainly one boilerplate line from a single migration or decision, not 38 independent debts. Fix the systemic cause once rather than file-by-file. Text: \u0022// FIXME(#62277): could be check-pass?\u0022. Source code is not a task system: track the cleanup where tasks live. (Every occurrence still counts toward the score and metrics.)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/incremental/change_crate_dep_kind.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"71ccaa53a003f4bf256bbaa912e0997f99564869b8238b20566b8d5808b4886b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME should be reused \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/incremental/lto.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fde9b75eef34bf14c8873f9b2ce60e5c2c283881c6147b88bdffa5c82c005bd"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME should be reused \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/incremental/lto.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"f71c2903e0d45e5c0c587cea6728dfa88e38f11067309a2cbeea9bed6b2106ec"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(michaelwoerister):Interesting. I would have thought that that changes the MIR. And 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":"tests/incremental/hashes/enum_constructors.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"01d17a522586c7167eafc37763370e5032cbbe9ec6b18e1d76ceb72db2900ed7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#38501) This should preferably always be clean."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/incremental/hashes/trait_defs.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"84f1517f0a0b42f99c2ba106450b2769b236625722430101df0c5ab0dcd69d79"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#165796): flaky on ARM64 MSVC"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/debuginfo/basic-stepping.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"b98d8246c7780e38b93a231d45fd5b3174eaffdb1447fb0d1a267f5a313dcfb4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(f128): gdb doesn\u0027t support Rust \u0060f128\u0060 yet. \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/debuginfo/basic-types-globals-metadata.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c1bdce77294a497165bbe23ec98f3f5b8b14c02037562a0fa20204d834467c4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(f128): gdb doesn\u0027t support Rust \u0060f128\u0060 yet. \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/debuginfo/basic-types-globals.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd24015c3aa4ac35e4259792efbbceafc3582075f126a59b9e14cc5e9f170e4a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(f128): gdb doesn\u0027t support Rust \u0060f128\u0060 yet. \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/debuginfo/basic-types-metadata.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a99d6ff95ed36a8d5dd4a7b571cab8ae3cc46234b3118984b1ae1177b16c269"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(f128): gdb doesn\u0027t support Rust \u0060f128\u0060 yet. \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/debuginfo/basic-types-mut-globals.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"3681009d0c87c3dfd91b9a0493de705becf001138e77988aa57767b329eee21a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(f128): gdb doesn\u0027t support Rust \u0060f128\u0060 yet. \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/debuginfo/basic-types-mut-globals.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"b16ebdebe7b515b3b1882439d6c484209f5e56f8f7638e7b3b18f240ea2d7fbf"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(f128): gdb doesn\u0027t support Rust \u0060f128\u0060 yet. \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/debuginfo/borrowed-basic.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2f1c5a90fbe8577a070cc315f9ca2d09f504e2f6fd8a18bcac2ffe1fc1579ca"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(f128): gdb doesn\u0027t support Rust \u0060f128\u0060 yet. \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/debuginfo/borrowed-unique-basic.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"17671ae9c8c05d6da02c4ab56b42f01b0296b077af6701e06acdc6c5ebd43bf7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(f128): gdb doesn\u0027t support Rust \u0060f128\u0060 yet. \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/debuginfo/reference-debuginfo.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ce80a64cb69f2132f52d298e595066ff959761866892acd83c1278ec42019ba"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(f128): gdb doesn\u0027t support Rust \u0060f128\u0060 yet. \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/debuginfo/basic-types/main.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3687f351747bf757d26649ce31cce5b64d74d747f21b575f87696901ff275eb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(f16): Including f16 and f32 in the same tuple emits \u0060__gnu_h2f_ieee\u0060, which \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/debuginfo/basic-types-globals-metadata.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"408dce41bd3784872df6aab977f4fba7516ec248efb15f68d43518f156af9781"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(f16): Including f16 and f32 in the same tuple emits \u0060__gnu_h2f_ieee\u0060, which \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/debuginfo/basic-types-globals.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb7377022209b0dc56ec7758a68697bb4d9befd5515ca2d458526630ed6b124e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(f128): Merge \u0060-apple\u0060 revisions once Apple releases Xcode with LLVM 22. \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/debuginfo/basic-types-globals.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"2758d29946bab11be0bf8be908495cf9ce3710d96199a1b741ea8260c85b86aa"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(f128): Merge \u0060apple\u0060 revision once Apple releases Xcode with LLVM 22. \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/debuginfo/basic-types-mut-globals.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b01004eac777cbb5e35964f0eda38d9da24e5f0714a9faf8a2933d529e35fce"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(f128): Merge \u0060apple\u0060 revision once Apple releases Xcode with LLVM 22. \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/debuginfo/borrowed-basic.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"306be076ad1a0b4cb1e00a2fa3a78983a2e3938afba48dd6d37d3ef96b48321d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(f128): Merge \u0060apple\u0060 revision once Apple releases Xcode with LLVM 22. \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/debuginfo/borrowed-unique-basic.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"344d942f06849aca87f827838e55d28d23941389fa0c3423a255921c057f50fd"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(f128): Merge \u0060apple\u0060 revision once Apple releases Xcode with LLVM 22. \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/debuginfo/reference-debuginfo.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b8a39e98aba8effdaa83fae0be1a8daf855de97f363afe838689a1cacd75d48"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //@ ignore-aarch64-unknown-linux-gnu (gdb tries to read from 0x0; FIXME: #128973)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/debuginfo/by-value-non-immediate-argument.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e2230a26fecdca79cbae839fa54ee3e353d80c664a65cc9d281037c5334c7dc"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#148097): Change \u0060// cdb-checksimple_closure\u0060 to \u0060//@ cdb-check:simple_closure\u0060"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/debuginfo/closures.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"71c428c290ed34cde554969fa9ad2586c154840340b8971cb806b7309620ecef"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //@ ignore-msvc: FIXME coroutine captured var \u0060a\u0060 seems to not get proper debug info on MSVC \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/debuginfo/coroutine-locals.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"391679edf848e587b6db3fddc7d09c9325b0be32283d119269cd24aee52ebaf5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: stepping with \u0022next\u0022 in a debugger skips past end-of-scope drops \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/debuginfo/drop-locations.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"77d5231f2b94a0f59c053a5fefa33ce3ce77d9412ab162f5c04c3a73662c7877"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Investigate why test fails without SimplifyComparisonIntegral pass. \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/debuginfo/dummy_span.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"680b8dcc34fa521ffc3bbdc511a47064a26f5ab7204828bac4be1f813636c314"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //@ ignore-android: FIXME(#10381)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/debuginfo/empty-string.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dd3a9f4ab516083655e53c2ef0490ef4f78f804d0e2b57c4e4c80932570526b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //@ ignore-android: FIXME(#10381)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/debuginfo/gdb-pretty-struct-and-enums.rs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"93cf6ed86e0c5ddb3210604739a9fc691a74a92dd32440d6e38830cd12eb7308"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //@ ignore-android: FIXME(#10381)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/debuginfo/pretty-huge-vec.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"31be64a975bae2ff1aebe778d0c9c89173fd47e2b5a1db931f602a568e5c5f5c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //@ ignore-android: FIXME(#10381)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/debuginfo/pretty-slices.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"02d12497d3265bbbe08d16957d985056097444337e1cc70194008cc1f0f79db8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //@ ignore-android: FIXME(#10381)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/debuginfo/pretty-std-collections.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cd3e1aa34a3926c8d896567ee677610c1a00a76fa634cfabdf6e8ef7bee8f4a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //@ ignore-android: FIXME(#10381)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/debuginfo/pretty-uninitialized-vec.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea3a88ace769bfe1bc9339717ca72b78c2f410d3b12452708ede1db2fef8dccf"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //@ ignore-android: FIXME(#10381)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/debuginfo/step-into-match.rs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"44982100a17c9f8fbd17f69e8aaf6ad040dea7ebef4da81587ea2bc52b1a05ac"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //@ ignore-android: FIXME(#10381)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/debuginfo/pretty-std/main.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"35444580e7c90a4ab6c4c67391e2b3627357a61bbc115867f55667a1e50de143"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#128973): Needed to avoid \u0060\u003Coptimized out\u003E\u0060 prints before #128973 has been fixed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/debuginfo/function-arg-initialization.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"b84a782dfd536a0a7df601ec9d8f8909077d646316c63e3db68c221314284c79"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //@ ignore-lldb: FIXME(#27089)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/debuginfo/generic-enum-with-different-disr-sizes.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"33826a8de68291b6b52032b6e1f53c01738642fd052884b1501b086124816cf3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: what about loc6? \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/debuginfo/macro-stepping.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"79c96f7d77f3a57c8a5816b6404b4b6f66786c8648c48d5f78ce3c05203500f2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(rylev, wesleywiser): uncommenting this item breaks the test, and we\u0027re not sure 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":"tests/debuginfo/no_mangle-info.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"825860543ee3d5ee5ce4c749276492043d2dd482075e1d1235c0854903ee63de"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#133107): this is temporarily marked as \u0060only-64bit\u0060 because of course 32-bit msvc has"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/debuginfo/numeric-types.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"712cac368f99b4f3e4c6ec92130ee4c253163a80099907e0050f9b9c27e8256f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#156886): \u0022error: Invalid type: Cannot determine size\u0022"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/debuginfo/numeric-types.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cc2fa7c49ce8cb351852e2f53f81dacb00426f977d677743baefab64e2d03c8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#156886): \u0022error: Invalid type: Cannot determine size\u0022"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/debuginfo/numeric-types.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f76e11573fba6ffc8c622d40e85f42d8e633639de6d21f305f982371f39e070"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //@ ignore-aix: FIXME(#137965)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/debuginfo/pretty-huge-vec.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ba11b8d08d079b122fa80ca083cfd4642790c5f28d2f9bb243bc6ffef2e6382"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(jieyouxu): triple check in CI if the directive actually works \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/debuginfo/range-types.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ee9232eff8c7709df6efac51a74bca6536358d7ebd60c8f22846b01e8a4c598"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: LLVM generates invalid debug info for variables requiring \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/debuginfo/simd.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"f13d22b35c658536c8d43bbf4db571f2cec0803aea79edf8b13bc180555adeee"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(jieyouxu): triple check if this works in CI \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/debuginfo/unit-type.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"feba05ef43f51be5b07259096a6630654d00474ee65a2d998064b8fa3106b7c8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(min-lldb): re-enable once CI is updated to LLDB 23 \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/debuginfo/vec_visualizer/main.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1de83b0ca21e2b0751d6f229e3e44d418d231882622a105f1a964fba51e5fd9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#88840, #148743, #88796): since approx. Windows SDK 20348, the corresponding cdb (and/or"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/debuginfo/pretty-std/main.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"38036ff53019f4a7302e0a36dfa28048b0422760b632ad4f41345a8b9bf6da94"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#88840): The latest version of the Windows SDK broke the visualizer for str."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/debuginfo/basic-types/main.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0803c43d647f0b50bcaa4512bc0f96cc28c24183464c20928c282e17f9c5ffd"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(Swatinem): Fix known issue that coverage code region columns need to be offset by 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/coverage-run-rustdoc/doctest.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0e39591d11108e7ff2443d9ad51fc2d573830f84b9d49a55745a8f7927cdba7"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // Hack to get the correct size for the length part in slices \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/codegen-llvm/adjustments.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f16d6bb4f29a47c58592eeccac207e0cca47e06915e33603b909babb884aa9e"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // Hack to get the correct size for the length part in slices \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/codegen-llvm/function-arguments.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"61e39e41fa880311bf86e638494cb04f9dff840ae2926f3fc596ee61d4fc4807"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // Hack to get the correct size for the length part in slices \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/codegen-llvm/refs.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"f048c1161ca65e21e11ece8ffdc9cf3a74724909bb2b811c0e127f9cdf65fcaf"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // Hack to get the correct size for the length part in slices \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/codegen-llvm/zst-offset.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"8829bfa63503ca9d8968814b24a380d496137c1b6ce2b0d5fea084149a03ca0a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME also check \u0060gen\u0060 et al \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/codegen-llvm/align-fn.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"56bf677da6af969afcde422d88a41f83b2783e8adc8e7655ec7723d60ef4d3fb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: No way to reliably check the filename. \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/codegen-llvm/async-fn-debug-msvc.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6d732cf0a6149f2b0faa072bf7423e805f7b37be02aace74566a020eab56bff"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: No way to reliably check the filename. \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/codegen-llvm/async-fn-debug.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"c960723e88826ad1809308e2738e520023cbb89bd690f690a651979338894a77"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: No way to reliably check the filename. \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/codegen-llvm/coroutine-debug-msvc.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"6115cea70a4205ce32cfac3f2887e233bf61f44e25f01010d75cb6403962e52d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: No way to reliably check the filename. \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/codegen-llvm/coroutine-debug.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d1c0b81659462cef7b36cd457e4ad4953f9cb44af39480ac0f1b2f32ffd8ed7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This test only wants to ensure that there are at most two allocas of \u0060T\u0060 created, 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":"tests/codegen-llvm/box-default-debug-copies.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"d951e54df38dc3c11180a26bc3e9fb34c321a36f678dee6a537cd035c66181b3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //@ ignore-riscv64 FIXME \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/codegen-llvm/catch-unwind.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0be872b21b51e1d1636bde1b1bb6fb176b8f329d5e4b28a9c1c770e31fa882e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //@ ignore-s390x FIXME \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/codegen-llvm/catch-unwind.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb8586a231c61a010ddab672e7e75d26553f9bf34fc91f92d54bce88db5e030c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //@ ignore-loongarch64 FIXME \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/codegen-llvm/catch-unwind.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8f7f4c394d2f8dfb2cdbfc2c4192192e3d88b75e0f5cf8ebe7927eacb8f0ae4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: the revisions below are deliberately disabled for now. \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/codegen-llvm/complex-abi.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f7ae8b6492681431d62faa9b67651f6c49fd44eabe6344390186965905e2a5e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This can be a valid value. \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/codegen-llvm/debuginfo-dse.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e7c1a8d4fb7c87abbf5d6d6b99fc738884d51775916e71db6378f52e1882608"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This can be a valid value. \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/codegen-llvm/debuginfo-dse.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"027189f76de87baaec507c31501d879cfd49d29c005b51b9d41647088ade697b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(tmiasko) replace with custom MIR, instead of expecting MIR optimizations to turn this \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/codegen-llvm/deduced-param-attrs.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c063cc79332b0490b31b0ea367183d3631e3ff603f8fc74849c0151b990a248"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(eddyb) the \u0060void @\u0060 forces a match on the instruction, instead of 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/codegen-llvm/drop.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"7655a34aecea8ec7558b6f09d38b06e62c3141fb0ae1a536a92fd692989bf772"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // Hack to get the correct type for usize \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/codegen-llvm/dst-offset.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cb04f794d399e06eeed23b1d5b4a9e74847095613788d4347693eee9dc0cc8b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#134288): This may change for the \u0060-msvc\u0060 targets in the future."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/codegen-llvm/i128-x86-callconv.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"d72f48a41c43342abb39ee02c756d1c8f0f7083a02aa935956bd7630b247e98e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#134288): This may change for the \u0060-msvc\u0060 targets in the future."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_target/src/callconv/x86_win64.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"527006d9f91bc4bf4c7a531c235acb1d2b1b275e5e8f18008f1b1573bf31a1fb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(eddyb) \u0060legacy\u0060 mangling uses \u0060{{closure}}\u0060, while \u0060v0\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/codegen-llvm/internalize-closures.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"106f189db0b1919ef1468170a203fd80ba7aadee8cc766e0ac80e3f08f4f220a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: turn on nrvo then check-not: @llvm.memcpy \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/codegen-llvm/nrvo.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"4154ce6621556587498463c69687c5a855062e7a6666fd7e69cf9230ac404242"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#49892)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/codegen-llvm/option-niche-eq.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"fba030533c53b8c9e001c4602eebaad3ce0de9aa47990400a3d45c8be7e85810"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // Hack to get the correct size for usize \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/codegen-llvm/range-attribute.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"59163b2ac86588df9aabdcfeac3d64b175ae10b7e94a1381e9b52f8221c1099f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: undef bytes can just be initialized with the same value 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/codegen-llvm/slice-init.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"21d108f927574a54e36b815af9af334728ff5a849bf410f53b7351612a820a0f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This could be optimized into a memset. \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/codegen-llvm/slice-init.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"9568b497cea7f6ad85aaa8ebdd107e4b1df4e5c6d0fce5e56046f7960b0809da"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: See #115212 for why this has an alloca again"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/codegen-llvm/swap-small-types.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0820bfb61fd3df7e300251a866e60d72d5337e66887fd2194f520f2caeab5ed"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //@ ignore-windows FIXME(#134939)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/codegen-llvm/thread-local.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"79a107d4e258604c3a6d9f6c6f039e318905eeefd07f7cbbbc84304df9c8ad42"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //@ ignore-std-debug-assertions (FIXME: checks for call detect scoped noalias metadata) \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/codegen-llvm/vec-in-place.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"25029c9f1c5b5351ce3a65e87f70a36b9859016cc17736645dfe1928c5723354"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //@ ignore-std-debug-assertions (FIXME: checks for call detect scoped noalias metadata) \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/codegen-llvm/vecdeque-drain.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7a78c76c2394baee777315423ce79934c30fbdd9114bfe36af9ab1f6bf01b25"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Here should be invoke. \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/codegen-llvm/virtual-call-attrs-issue-137646.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b5e46aab7d6762ace79757e4aef6bdd8f40361e3b668980f8dfeaa1af3f1865"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Here should be invoke. \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/codegen-llvm/virtual-call-attrs-issue-137646.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0f58c45febace50f4cc8c4618b6060a9d255f7a59832e05d248eb381f2be288"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Is a memcpy really the best we can do? \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/codegen-llvm/simd/packed-simd-alignment.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"36e1bdd9be0e5670742f6bf27cbef015bea00b31ef244c172b561a140ede2505"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(rcvalle): Enforce autotraits ordering when encoding (e.g., alphabetical order) \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/codegen-llvm/sanitizer/cfi/emit-type-metadata-id-itanium-cxx-abi-trait-types.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"a59044a19eed5ce505624b12eff1ef68847ed95e8a624ccb15ec72fd8336f739"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(cuviper) x86-64-v3 in particular regressed in #131563, and the workaround"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/codegen-llvm/issues/issue-101082.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"90c723960051cb75a26f79c0369eb18c57f5493d203c1ebb406928bc8215cc69"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This should be improved once our LLVM fork picks up the fix for \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/codegen-llvm/enum/enum-discriminant-eq.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb32a06059241cbd3e6ad066fde8e30ff0fb9b14cbe72ac0ae7dac495d65da6e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: once our min-bar LLVM has \u0060range\u0060 attributes, update the various \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/codegen-llvm/enum/enum-match.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0ff27045302b5b277a9592887406810de6b88c32eefae9d7276b246f36daf4c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(nagisa): remove the flags below once all targets support \u0060asm!\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/codegen-llvm/asm/sanitize-llvm.rs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"96391851155408dba38f019d156711d351c96225f4d7b7bb7ad7dec5712a1504"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: \u0060cfg(minisimd_const)\u0060 is used to toggle use of const trait impls, which require a few \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/auxiliary/minisimd.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0c51f5e53bab8751d6784be4a2e8825dce03bd5a5169d1f6ec8b663b728162f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: Remove once \u003Chttps://github.com/rust-lang/rust/issues/119826\u003E is fixed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/auxiliary/minisimd.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"c479a8bf1d5b1fa1376904f18986f57ac3583f13703ae0ad2d17f8f93246681a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(denzp): add tests for \u0060core::sync::atomic::*\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/assembly-llvm/nvptx-atomics.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"001e4fb12933d42e1175c26481505128c2363d20465233df995cfb130218485f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Migrate these code after PR #130693 is landed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/assembly-llvm/rust-abi-arg-attr.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"c396ebf562e4ab0497220518c2a4e09530a0241acb33e7f057e4e63fc6c7d289"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(llvm23): This should also get checked to generate a gather instruction for avx2. \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/assembly-llvm/simd-intrinsic-gather.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"d68608c32304419b20333e727d41f12ec537eb3a32a29659120b99d5399ebddf"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: on msvc we should pass the 4th argument indirectly, but currently don\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":"tests/assembly-llvm/win32-byte-count-suffix.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"b957039ee490680a9057c79584f4b64c74b5f0123b99bc00ef7f9ffa3605f356"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: the mangled name for this type is incorrect on msvc, where the argument is passed \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/assembly-llvm/win32-byte-count-suffix.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab942e30278f3fbcda70251aeb3e1796594dd25713a8fb44e0e145b1ea049003"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#114479): LLVM miscompiles loading and storing \u0060f32\u0060 and \u0060f64\u0060 when SSE is disabled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/assembly-llvm/x86-return-float.rs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"7051fb7300f1fa4e19c3e3f8e6fad6bcb392e6e91cb95f94bd327c78b41e4b19"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: disabled since it fails on CI saying the csky component is missing \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/assembly-llvm/targets/targets-elf.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2cedf8480ad5f85ad8993c4fb9b3a0eca1816c8c7affb5f77f1c9917eaca2b7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: disabled since it fails on CI saying the csky component is missing \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/tools/tidy/src/target_policy.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d2e202b74f6a1d946a59fa2b4d4826370d871221f6dd48bb05f0446f7036849"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: u128 started to break compilation with disabled CI \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/assembly-llvm/nvptx-kernel-abi/nvptx-kernel-args-abi-v7.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"d18669d34e00fe19f7175db6b5238187a05074e175bb1a8f9302e715c001f165"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(f128): Change back to \u0060$func(x: $ty) -\u003E $ty\u0060 once arm64ec can pass and return \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/assembly-llvm/asm/aarch64-types.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"af1f6c911a5eb71eef71e672ea934b0265ffab1aaf593741c6d19e78387441d6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(f128): See FIXME in \u0060check!\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/assembly-llvm/asm/aarch64-types.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"30ddbdd0c83fdc41fda9a410e40b70fd8878b7bc8a547a7454eda6bb5b2cba87"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#126797): \u0022d0\u0022 should work with \u0060i64\u0060 and \u0060f64\u0060 even when \u0060d32\u0060 is disabled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/assembly-llvm/asm/arm-types.rs"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"a41821af9538150d04b72bb8dddfd7c9c64ca867162c1b2b17b082378de0fff9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(f16): This test will need to be updated if/when the \u0060f16\u0060 ABI gets standardised. \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/assembly-llvm/asm/powerpc-types.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc2d10f91ccb9b4923ad308d9f9c56e066c48d359b2d883e36d7ea978eec1988"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(f128): Replace \u0060\u0026$ty\u0060 with \u0060$ty\u0060 once \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/assembly-llvm/asm/powerpc-types.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b999db3f0f2309e59051541b1d55adeae37bf17d82878d19a90b9f431df797c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(f128): Replace \u0060\u0026$ty\u0060 with \u0060$ty\u0060 once \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/assembly-llvm/asm/powerpc-types.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"409c79eb6e61cfdb7c3086bc7fc710ad529d2553ba70802f98acc0059203e231"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: should be allowed for sparcv8plus but not yet supported in LLVM \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/assembly-llvm/asm/sparc-types.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc34046794addecdc2fd6a049ff014a4a7b6db09cacb8be00da416e526084931"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: should be allowed for sparcv8plus but not yet supported in LLVM \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/assembly-llvm/asm/sparc-types.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"abfdd5673f5e3bac236d77019ef181d4a3b9c5426f8530406343007dd1b5a639"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: should be allowed for sparcv8plus but not yet supported in LLVM \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/assembly-llvm/asm/sparc-types.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"f986cabe0406c3ea603dbeba66eb76e9a52e63bf8d8263f4256a2a6c96caa16e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # noqa: F401 FIXME: py2 \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/tools/publish_toolstate.py"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"fae8d2deb2a2d749883419fcea1159a6d62c7c5246d78a0e1919efb1a818f038"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const-hack): Revert to \u0060slice::get\u0060 when slice indexing becomes possible in 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/tools/unicode-table-generator/src/range_search.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab4b2167e756fae7ce06b55d95266d5ed9b4f4ab255685f90e57e214af1998eb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const-hack): Revert to \u0060slice::get\u0060 when slice indexing becomes possible in 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/tools/unicode-table-generator/src/range_search.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"055cb4be4891f44c08bd4762b4ca6b84cf1a362ecdd9d20680571c1648d3a889"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Experiment with choosing most common words in overall data 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/tools/unicode-table-generator/src/raw_emitter.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac813e85fc92cbdb32540f52776ac2e9aa5b355eade11aa420218778b0d16857"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: work harder -- there are more possibilities for mapping \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/tools/unicode-table-generator/src/raw_emitter.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"d52a77e9de945be15ed5fa11880f7cd8d9b84600ea38ab229778ad3dfb98dffe"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: check when rust-installer test sh files will be removed, \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/tools/tidy/src/bins.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a648743ae37ff1017791c0db612d0078fa1a4c4bcd833ebf0ae51625af01393"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: we don\u0027t need to look at all binaries, only files that have been modified in this branch \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/tools/tidy/src/bins.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"410f3195f426197637e9b3f2541c03b90bcac3ef3883c193361abaaf40974e6e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //! Tidy check for codegen backend TODO policy. \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/tools/tidy/src/codegen.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4145aa2e441addc6869bb81b86a245c1182e7dbf9c2050d2b5831bddfdb7b8c7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO policy for codegen-only trees. \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/tools/tidy/src/codegen.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"b155cb74de99af8f1936edddd0904a44852c38d4eb37dac5bb6534696879d9b2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // foldhash (FIXME: see PERMITTED_STDLIB_DEPENDENCIES) \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/tools/tidy/src/deps.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca133bc91a494f10e287164dc49c12ef5a63466e9620a3824215e184f4c8a2df"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME auto detect all cargo workspaces \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/tools/tidy/src/deps.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"3337d820885e92522ca04dd296b50a24b712efe80bc82fd8155d120747646a80"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME uncomment once all deps are vendored \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/tools/tidy/src/deps.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"f477472fb762476a0fd9253b480100a65681839128793ef07cbe3b6fd570565b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // libstd but only for \u0060sgx\u0060 target. FIXME: this dependency violates the documentation comment above. \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/tools/tidy/src/deps.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"7db18510d1ea0dda079aac08823f764e68bb7d0ec19500b3948ca164d8d86bba"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: only appears in Cargo.lock due to https://github.com/rust-lang/cargo/issues/10801"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/tidy/src/deps.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"b81f3f23a31bee5597d08c784eb6a504b38938c04b2a7f5b07cbc2aeefa5e3ad"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: only appears in Cargo.lock due to https://github.com/rust-lang/cargo/issues/10801"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/tidy/src/deps.rs"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d3f170a82031edb7393ef7687fae47431f426b9448306e5fb9e67f5ee66361a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME check other workspaces too \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/tools/tidy/src/extdeps.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b17024dfe8096d3658fbbd022b6f636624b9bc45db06b0cad2f2ec53bb1c772"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: platform-specific code should be moved to \u0060sys\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/tools/tidy/src/pal.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"beb4b0a4bc0d130255de6bf35056424f32fe4462d539c54a72a8067d3560b31b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(reddevilmidzy) normalize subdirs title in tests/rustdoc-html/README.md \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/tools/tidy/src/rustdoc_html_tests.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"51bc39f827f0e02b693d6f7f604973c7a4ad204259003bb590ef729ff3103c19"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK(Ezrashaw): there is no way to split a markdown header over multiple lines \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/tidy/src/style.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7c20b9a57360dfcffdd590bab5c15d4cde97f38520692effed2495b7d6ac188"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: disabled since it requires a custom LLVM until the upstream LLVM adds support for the target (https://github.com/espressif/llvm-project/issues/4)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/tidy/src/target_policy.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"f91d726d72ada57b03c6ebfa4405d9204c2fd38baffa300733e6a2d0f78a5b80"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(reddevilmidzy) normalize subdirs title in tests/ui/README.md \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/tools/tidy/src/ui_tests.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b484329ed11bdc670562da699617630aa9dd12031445d1d064e773f3e0a061f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME remove those exceptions once no longer necessary \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/tools/tidy/src/unit_tests.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"99e94303b7af6265525c781650c385fd8e92c1bc31adbe7262daac94ec49c429"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(jieyouxu) Ideally these checks would be integrated into compiletest\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":"src/tools/tidy/src/unknown_revision.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"18a644135eedb66b4e9f3e3ef24687f929a4433c565db25251f56d6d09cda5af"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: do know \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/tools/tidy/src/style/directive.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"7430932e77ea88f1e89322a03d4b54d700738811956f3c9875c23d33d44c13df"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // #[unstable(feature = \u0022foo\u0022)] // FIXME: Is not putting \u0060issue\u0060 really fine? \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/tools/tidy/src/features/tests.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"15c2ba9d89a8691fd4120b72015df15e38d8cdddc10d78a6d24e05f11bb13a1d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Implement this struct \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/tools/rustfmt/tests/target/enum.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ede0f3a79149b5691e805dccb2c5c10f6297efee60ef28e6080198217a2149d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Implement this struct \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/tools/rustfmt/tests/source/enum.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e13b9bbee6733f47c3b1ea583685ba6ddc20766d305583149a98506460baa91"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO make Dict \u0022structlike\u0022 AKA name the two values. \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/tools/rustfmt/tests/target/enum.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"b17e9b0d82293a679dca66eb66baf156340d04630c15148bc277e36c484e4740"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO make Dict \u0022structlike\u0022 AKA name the two values. \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/tools/rustfmt/tests/source/enum.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceb41678bf239017268cbe8eb0a00c1aa945728d3090fc4d1d79bc6056faef1f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME this one could be done better. \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/tools/rustfmt/tests/target/expr.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"4577f10688d98cf289e66b68a58beb765b229485fd1d3e4dd8b3e549128c9745"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME this one could be done better. \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/tools/rustfmt/tests/source/expr.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fa2ed498068b4cd583ef149358ce746c80ab0608851212d7c54f50aaa8f99d7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO adjust code to only work with upper triangular half of cooccurrence matrix \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/tools/rustfmt/tests/target/issue-2896.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5cb09027527d6af39535473a54ab29eb3ca18cbbc68b94e8855493b1822beb4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO adjust code to only work with upper triangular half of cooccurrence matrix \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/tools/rustfmt/tests/source/issue-2896.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3804d63d10d691d8c7ecd2135ecc63c782e00f42cdeca03164e1ebe84de6867"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // //TODO compute top-k \u0022similar items\u0022 per item \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/tools/rustfmt/tests/target/issue-2896.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ec07cc40e4e7465fe195c1a62737ae985996b17488bd80aa1c092428e8949fb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // //TODO compute top-k \u0022similar items\u0022 per item \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/tools/rustfmt/tests/source/issue-2896.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"7512db97d0cc0d3a2744da1c974805eedda671b33247833c451ea9d2773c8b07"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME (#3300): Should allow items to be anonymous. Right now"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/tests/target/issue-539.rs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"55940684845c7360748f5aafa5e197bbe2b41d5bc63965b2f2b5e320a4676598"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME (#3300): Should allow items to be anonymous. Right now"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/tests/target/issue-683.rs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"5468ebe2d6773b674d3c5357e1f321fea5909ea3d46913e25539c720c176d146"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: provide instructions to override default libm link and how to link 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/tools/rustfmt/tests/target/issue-691.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"26e668aa04c3a991235a5bcced99bddfaf32bcc06e5bb56da5d7e9a6c7480e21"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO uncomment when vertical whitespace is handled better \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/tools/rustfmt/tests/target/match.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"474ce8f7b8d93d993012a2da7a47e8e9b20d5f423185b120ca10c9496461cdec"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO uncomment when vertical whitespace is handled better \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/tools/rustfmt/tests/source/match.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e48105d8fa0d00d7634fb6ae8d18e2c0ed8446bea2e595486536f5d33c700c4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // We push the whole expr to a new line, TODO split this macro as well \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/tools/rustfmt/tests/target/match.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd09ebdc67e5f5b0cf6c4ea09b4acb6245f0ed0d788d76e7dc79d8356492e0cf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // We push the whole expr to a new line, TODO split this macro as well \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/tools/rustfmt/tests/source/match.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e6bad717c9a199c28cb77a292d8580d66804eda6570b75f87974fdbeafca291"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME split this into multiple, self-contained 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":"src/tools/rustfmt/tests/target/multiple.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5661a6dd2e1b8538edb83fb5b216df827eb9a567b69408aa069edec652fa0de"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME split this into multiple, self-contained 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":"src/tools/rustfmt/tests/source/multiple.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a5237d5b05f637789ace4326f8636cbeef5df9e48e19a613f7035b1e39e63e4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(calebcartwright) - Hopefully one day we can \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/tools/rustfmt/tests/target/statements.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f89d1e560ef61e5a4679b38cdf6ed11fccc99d5b7988adc82c15831167571326"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(calebcartwright) - Hopefully one day we can \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/tools/rustfmt/tests/source/statements.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"84a6ef6ca4a522cace25e4df785dd71c3aee599dfd455e518db93b3fc0f601b5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO note \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/tools/rustfmt/tests/target/struct_field_doc_comment.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7d2df3fc42605e8a23d014723c9640eef8fff7b55af08120fd17b821b5cbadd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO note \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/tools/rustfmt/tests/target/struct_field_doc_comment.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bc9896a2e1d3603defa55242007e0397684553b10abc778c80d1004dda1c2fa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO note \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/tools/rustfmt/tests/target/struct_field_doc_comment.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d26ba181962e7a80c4574c3fdc957cae54e9d9ccb9859c3a5a5de8607ad5f7e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO note \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/tools/rustfmt/tests/target/struct_field_doc_comment.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"c24d9d0de9a5ee09f544636ac6be2fc149b7a27232d44a010adaecfe304bd27c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO note \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/tools/rustfmt/tests/source/struct_field_doc_comment.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"396f5485c1023bb4e2dd3042d0f42ba733f2a2316ca76bcb05625fa29393943e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO note \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/tools/rustfmt/tests/source/struct_field_doc_comment.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"2edf4e287cc17219b14c6d6cf70cae4832360022b071eff13edd906cd59207f3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO note \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/tools/rustfmt/tests/source/struct_field_doc_comment.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c9dffe375903f0f853b71010e07edcbe9e933440e584bb24238d9b4bf38647c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO note \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/tools/rustfmt/tests/source/struct_field_doc_comment.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"82fa05e2fc59fdf78e80bdef6afb44e21d80ad503d23122a910a4ce61dd21c3d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: use \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/tools/rustfmt/tests/target/structs.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cb38658dd6458c7f049d20fa6f7f6bf37ce3938afd59b8abaab1706c00aad1f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: use \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/tools/rustfmt/tests/target/unions.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"355b466312a637c0b497f58f733c4b4eec9dd7494edb393fc5ee3cb7dfea7a91"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: use \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/tools/rustfmt/tests/target/configs/struct_field_align_threshold/20.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"41f3fc53457b4a5d5a8bf67d7743f5c870cacbb6b824c6df299a9f7d69186253"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: use \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/tools/rustfmt/tests/source/structs.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"a56be41bd3679bd0a376981c045c305fdc48f68a5c203847cf719b31d8952375"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: use \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/tools/rustfmt/tests/source/unions.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"84b5befa0b3685924e093d7b479566fcd8a800b9da8170b1a833dbf30c10229e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: use \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/tools/rustfmt/tests/source/configs/struct_field_align_threshold/20.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3e7f53bf6ba2bffaace04ba8df198691bdd51b2140a2f549c0645af424322d2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // Qux (FIXME #572 - doc comment)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/tests/target/structs.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"1074b924e4b3a90378bb474ffe48538071f902ed1aebb0426e0e7238421d476e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // Qux (FIXME #572 - doc comment)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/tests/target/configs/struct_field_align_threshold/20.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"845c16304eae16e7cca3d71490840ea9bf373cd0efc98da97c6e0aa4e394979f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // Qux (FIXME #572 - doc comment)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/tests/source/structs.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"700f2f40b3b011edcdbe70356936b23bcd8c0236be8674605eeec6e8a668b709"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // Qux (FIXME #572 - doc comment)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/tests/source/configs/struct_field_align_threshold/20.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"d20edf00970bc34095cd7a219efd15f0c4a3f8a36be0092d9b622bd8e20714a2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(emilio): It may make sense to make this range [.01, 10.0], to align \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/tools/rustfmt/tests/target/trailing_comments/hard_tabs.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"0083bb5db0ebf13b6574f86346e38e02e1423c17ee16aebc988af027a4ef59ab"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(emilio): It may make sense to make this range [.01, 10.0], to align \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/tools/rustfmt/tests/target/trailing_comments/soft_tabs.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"258a61b7e6b459c189a82118febc45aa29974bc24439b3d04fa7684ca1940e1e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: \u0060Into::into\u0060 is not inline, but due 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/tools/rustfmt/tests/target/issue-2917/packed_simd.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec937f61f07f7c097ae81d535cb2aa9ddb9f8ee741b1ff4eeda21d1c0ae856f2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: \u0060Into::into\u0060 is not inline, but due 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/tools/rustfmt/tests/source/issue-2917/packed_simd.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"f620d305bfd0cca8081a46316ff09a9c5670fcbd935e4d169357bbfbda50e943"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Return client notifications along with diagnostics to inform the user \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/tools/rustfmt/tests/target/issue-2179/one.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"eda742e813898f9f1f2049545773be3a2c61b836fe1d20c079f8b1a1ab4754c5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Return client notifications along with diagnostics to inform the user \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/tools/rustfmt/tests/target/issue-2179/two.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c9cd6cc660a3f9912af7918451e9b37d302d2a3df51e4bdcaf10e36ae7fcef5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Return client notifications along with diagnostics to inform the user \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/tools/rustfmt/tests/source/issue-2179/one.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"25447649b8c67d5a1951efea63065a228c7100400f0197be74a4ff7aa14639ed"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Return client notifications along with diagnostics to inform the user \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/tools/rustfmt/tests/source/issue-2179/two.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"e828b9b8a9c8b72975c071623e98d19dad27c0d3c7a7262615153e528abf3f90"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //                          ^^^^ FIXME: why is this 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":"src/tools/rustfmt/tests/target/configs/indent_style/block_call.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffbf6a000ae6ce726e5fd8c26f40a7c3b66892a9ec6dd59f9827bf9d26273a20"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //                          ^^^^ FIXME: why is this 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":"src/tools/rustfmt/tests/source/configs/indent_style/block_call.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4e3bc6e679ebd4a309b35df5ac37f20f14f1cad2607758b62ac6b33839400fc"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME. Prevent wrapping back up to the next line \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/tools/rustfmt/tests/target/cfg_select/cfg_select.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"af96efd2429db95ea8b5e85d9b05b4f418eb4324f702cdc49725d12373e9de03"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME. Prevent wrapping back up to the next line \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/tools/rustfmt/tests/target/cfg_select/cfg_select.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d5f96a340f348f34baf21476c681d2070d1f615744e2a9b83def03560085261"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME. Prevent wrapping back up to the next line \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/tools/rustfmt/tests/target/cfg_select/cfg_select.rs"},"region":{"startLine":694}}}],"partialFingerprints":{"codehealthFindingId/v1":"1180a332490ae66ddbe7d4431ee315e209286a68a23cd7941625fc01e668e001"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME. Prevent wrapping back up to the next line \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/tools/rustfmt/tests/target/cfg_select/cfg_select.rs"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea4dc740965cac103dbee02d378ff3ab6441791ad9370935b37800bf9f770c20"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME. Prevent wrapping back up to the next line \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/tools/rustfmt/tests/source/cfg_select/cfg_select.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fbef0c9b39148339cfe92d34149fc6d4b3f527cc340bc62d9e0fb0763e120da"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME. Prevent wrapping back up to the next line \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/tools/rustfmt/tests/source/cfg_select/cfg_select.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0231a51fc52868b5be2fba5b646fd5f5508aba54350e3736ad9f143a06f3d79"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME. Prevent wrapping back up to the next line \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/tools/rustfmt/tests/source/cfg_select/cfg_select.rs"},"region":{"startLine":748}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8f5ba70ce9ea12da5981d53555cfadeb9b73149659a80c30c6b7c87b9f1d9a5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME. Prevent wrapping back up to the next line \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/tools/rustfmt/tests/source/cfg_select/cfg_select.rs"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"297b93f33fef5e8b6062737ee27bc2f2bcf90eed075f15901d8d782d7240ccb4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: not formatted, a line comment before \u0060=\u003E\u0060 would comment out the \u0060=\u003E\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/tools/rustfmt/tests/target/cfg_select/cfg_select.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cf6326160e0161ddd1002b089333eb1030a29aca6f3b15084f871cfccde1beb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: not formatted, a line comment before \u0060=\u003E\u0060 would comment out the \u0060=\u003E\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/tools/rustfmt/tests/source/cfg_select/cfg_select.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab74b7ce9445ce71d67f526b462a174d73246320941ebe204871cab9c767a9f7"}},{"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/tools/rustfmt/tests/target/cfg_select/issue_7045.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"45628e2d319d7fa2ed277465861ddbd415cca7e03d7961b8e45a7f49e1e8e6e7"}},{"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/tools/rustfmt/tests/source/cfg_select/issue_7045.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"084111d2cbdf326da679f9d5e482ab5ab385237210bb6ae8107a6e1bfb1de188"}},{"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/tools/miri/src/shims/unix/fs.rs"},"region":{"startLine":826}}}],"partialFingerprints":{"codehealthFindingId/v1":"76c24e6786bf26d4030d3954473b2172217d23ba4c3e68e9bc219dd722ee5cfe"}},{"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/tools/miri/src/shims/unix/fs.rs"},"region":{"startLine":854}}}],"partialFingerprints":{"codehealthFindingId/v1":"14320d50ab5af25923ce1c59aa62405232c905221a63d01a92bd4110f156ae3e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this way of making sure that the cache is large enough 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":"src/tools/rustfmt/tests/target/cfg_if/detect/cache.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"19ea9c9ad7f832f70d9c97e0234b2ae6c4daa3cdee73aceb60db4d7e901bb25f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this way of making sure that the cache is large enough 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":"src/tools/rustfmt/tests/target/cfg_if/detect/cache.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"8427ce0e79cddee5f5b794a650406739366473e04b590ff993f2cace830f5fdd"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this way of making sure that the cache is large enough 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":"src/tools/rustfmt/tests/source/cfg_if/detect/cache.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"04ae1569ff1fd69afb27c4ac9c7045f92295133cb2f6d523f30ccb333e502932"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this way of making sure that the cache is large enough 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":"src/tools/rustfmt/tests/source/cfg_if/detect/cache.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6990c880eec12cffeb1fdf2eab2bdc96ff8c3091d41ccaf26aa6154001a985b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // 64-bit names. FIXME: In 32-bit compatibility mode /proc/cpuinfo will \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/tools/rustfmt/tests/target/cfg_if/detect/os/linux/aarch64.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6fd4a9c139ca0e1c8ac6723d2ac34ffb90bfa843874f32b8343a1228518091b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // 64-bit names. FIXME: In 32-bit compatibility mode /proc/cpuinfo will \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/tools/rustfmt/tests/source/cfg_if/detect/os/linux/aarch64.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"2af13b49c838a947ae284ab0b58a775fdb4e659fbc3e95a88dcd8a16dc2ca642"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: on mips/mips64 getauxval returns 0, and /proc/self/auxv \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/tools/rustfmt/tests/target/cfg_if/detect/os/linux/auxvec.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0796580d3d15a76760b10c6114355c54e149faa61ca3a094d44b68cbf0dfd82"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: on mips/mips64 getauxval returns 0, and /proc/self/auxv \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/tools/rustfmt/tests/source/cfg_if/detect/os/linux/auxvec.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8a44a148677272ab344ed6b75abff6a9cf3b06dbcefedb8f8ef91524bef0c21"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: on mips/mips64 getauxval returns 0, and /proc/self/auxv \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":"library/std_detect/src/detect/os/linux/auxvec/tests.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"98add5a0a00258e66a67dd3ae6e4d42dbb8e68bba28d9c52552cb0c98f9bf281"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: fall back via \u0060cpuinfo\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/tools/rustfmt/tests/target/cfg_if/detect/os/linux/mips.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b60c3bb513aca65f94c8aca7f113f25487570c9b1324ecaab1f764f92a008ce"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: fall back via \u0060cpuinfo\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/tools/rustfmt/tests/source/cfg_if/detect/os/linux/mips.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f42dd73de5e47997e771907637f5fe2a21074d115641cf9877b2a34efd0ce70"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this should be removed once we rename Aarch64 neon to asimd \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/tools/rustfmt/tests/target/cfg_if/detect/arch/aarch64.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec15d67ab4a88cedc24473f1ed43263ece5f0224c2d5512af9f9f29f06e6d8a7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this should be removed once we rename Aarch64 neon to asimd \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/tools/rustfmt/tests/source/cfg_if/detect/arch/aarch64.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"35bbb376e6016bc8df036fe67fe8c19067ad86c808d45e043ade66eb2d66acbc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(emilio): It may make sense to make this range [.01, 10.0], to align with css-fonts-4\u0027s range of [1, 1000]. \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/tools/rustfmt/tests/source/trailing_comments/hard_tabs.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"8448e6ddc02332339cbc05c41975ac9bccac6a7319435b006a73e5e5672c0f90"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(emilio): It may make sense to make this range [.01, 10.0], to align with css-fonts-4\u0027s range of [1, 1000]. \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/tools/rustfmt/tests/source/trailing_comments/soft_tabs.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"653ffb2187aa455fb540d3fe0f21d08112f9a3ab2eca566e57954f8e34b4e542"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(cfg_select): ungate when \u0060cfg_select!\u0060 formatting can be enabled on stable. \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/tools/rustfmt/tests/rustfmt/main.rs"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"02254e522ea022c160466e57099b7ebd961c6f620c0d42c9be7f36796ba58187"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(ding-young): Currently returning None when the given span is out of the range \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/tools/rustfmt/src/chains.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"81d35c2c3cc15ce84ddbcea210d424abb5ad0a592cc70ab6a338c4d87bbf13ba"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(ding-young): Consider calling format_overflow_style() \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/tools/rustfmt/src/chains.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"1738513698f102dd802b5545a7b624a07fdd76ee62b08e8c76ca3dfea73e39e4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: we can\u0027t use a reference here because to convert \u0060try!\u0060 to \u0060?\u0060 we \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/tools/rustfmt/src/chains.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"627412eab3d467f880486bca5a600871141b692223429e13a8ca11063392c335"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(calebcartwright) \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/tools/rustfmt/src/chains.rs"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bafd42a0d627658582c7e72b31a52902b7a570a8f7e1935327aa0bb75ab85f3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(calebcartwright) \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/tools/rustfmt/src/expr.rs"},"region":{"startLine":2213}}}],"partialFingerprints":{"codehealthFindingId/v1":"40930a82a0609087ab666951b6980f70e48fe46644b6f0944a6604072bfb618f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(calebcartwright): self.shared.permissibly_overflowing_parent, \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/tools/rustfmt/src/chains.rs"},"region":{"startLine":1026}}}],"partialFingerprints":{"codehealthFindingId/v1":"132ec006facd5eb551ec344c5e67b09caf02a0b7a091a133e50c38b66f36370d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME - the below is probably no longer true in full. \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/tools/rustfmt/src/closures.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ac0cc19ddf67071c6ee1f8cbb41cec01aa6bf075eaf2fe24d5cd81505324494"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: Work around mut borrow. \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/comment.rs"},"region":{"startLine":1473}}}],"partialFingerprints":{"codehealthFindingId/v1":"f30b659683b998afe6ba1b764dd3f670416780487550d3c253952278e8a6dcfc"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: format comments between operands and operator \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/tools/rustfmt/src/expr.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"e03cf13c3e07f8568a6ba3adc2d20bb2c101a86ed5a7a86bce653722fdbb7da6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: 9 sounds like \u0060\u0022do catch \u0022.len()\u0060, so may predate the rename \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/tools/rustfmt/src/expr.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c9a19ce347555f9a17f961e641460bf20b51ae53b9cfd9822fbb50ae9afffe8"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: \u0060true\u0060 if this is an \u0060if\u0060 expression in an \u0060else if\u0060. \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/expr.rs"},"region":{"startLine":701}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4558a495be1cac2e96e50a9ffbd98128c26eee35d266dcc12436e6905805ee1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Refactor this. \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/tools/rustfmt/src/expr.rs"},"region":{"startLine":714}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb822edcdd9af4137d6a0a7808283962c8a2c6ccbeebab905416c52107162b38"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: incorrectly returns false when comment is contained completely within \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/tools/rustfmt/src/expr.rs"},"region":{"startLine":1312}}}],"partialFingerprints":{"codehealthFindingId/v1":"82804c7acc5370cdf4552ada540bd1c6e835ef1eab144e5a6fb04b62ce97592d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME if context.config.indent_style() == Visual, but we run out \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/tools/rustfmt/src/expr.rs"},"region":{"startLine":1946}}}],"partialFingerprints":{"codehealthFindingId/v1":"a15f6248506c2674db45bc61ed07353a9612c8c5fc67e178a0e371910afb913c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(ytmimi) comments could appear between \u0060let\u0060 and the \u0060pat\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/tools/rustfmt/src/expr.rs"},"region":{"startLine":2104}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cc3dd0eaa9cb904e1a3668b749bd99d10f273d2a939b576e6973fb372082a0d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(ytmimi) comments could appear between \u0060pat\u0060 and \u0060=\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/tools/rustfmt/src/expr.rs"},"region":{"startLine":2115}}}],"partialFingerprints":{"codehealthFindingId/v1":"969af0eb0718874a9489e4afd62359a824943c5aff0080c75682f59722c1b538"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this is probably not correct for multi-line Rewrites. we should \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/tools/rustfmt/src/expr.rs"},"region":{"startLine":2181}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6806c3ebeb29d52e72deaf0a7e70d001a9086f065902b5c15e75a47e1638996"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(ding-young) Ideally, we can replace unknown_error() with max_width_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/tools/rustfmt/src/expr.rs"},"region":{"startLine":2384}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e08e0b7d4790389459b34a7659cedb584a957bae163c50bae6c4b45ba52128a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(calebcartwright) - we need to determine how we\u0027ll handle 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/tools/rustfmt/src/formatting.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"03a2c8d4472d4d30d2d9588da2c4d518ca3a9e85117f8c4ad8d61dfba73a6f42"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#20): other stuff for parity with make tidy."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/formatting.rs"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"2105902de8f3c1ca5ffd3243aab19d6c75d7b4b941fcee978cff4075f11b4f3c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(fee1-dead): preserve (potentially misaligned) comments instead of reformatting \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/tools/rustfmt/src/header.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b5db72a12add173c390fa7ee7fd478d3d44d02dc38492b4f1059d4876dc76d6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(fee1-dead): comments around parens \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/tools/rustfmt/src/header.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"624e9b3d849cd92201c1bbe7cba783a58fcb164b0f67acab58555828609d1c4a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#2531): we should unify the comparison code here with the formatting"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/imports.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2881c7dc3eff4cee49116bf0aa734ea4ec95ea19c5eb5ddbbccb7e93e6599d1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME we do a lot of allocation to make our own representation. \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/tools/rustfmt/src/imports.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"37b452641fa90ef26a91c5256aa19bd352d89bdade7dbb4643dc7108f597ccf9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Use correct span? \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/tools/rustfmt/src/imports.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"12d7cbbc4e96d27e291cd85119a6226926e959678079b8c3202d0b96c827eb5a"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // Hack around borrow checker. \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/imports.rs"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"63647791023741d6c275ff64a6cfacaab5a87f38baea6b8e77678ff45de2f541"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: deletes any comments in between super and let \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/tools/rustfmt/src/items.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"950202f7afc8979e9db4fe911c0779f8f0c82af4d96b86f1bd84a37a63f7d908"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME convert to using rewrite style rather than visitor \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/tools/rustfmt/src/items.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad896e2f4d4ad2ef0350990e4b17aac2a1525951f6453d37acb271939f0cbdb8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME format modules in this style \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/tools/rustfmt/src/items.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"c72fa33ee8f845188529b69d3f58e46d5389f2fe6f64706dbfba113e101ae9b0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this skips comments between the extern keyword and the opening \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/tools/rustfmt/src/items.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"48c66435080d1b4b34f15dbc12d1a99aa8214126d7260b52851b8d0b376363d4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#2055): rustfmt fails to format when there are comments between trait bounds."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/items.rs"},"region":{"startLine":1207}}}],"partialFingerprints":{"codehealthFindingId/v1":"af6baabc401d03ee2e301cb8951c076fd246ea4c4cce7bbc54fa6cd3c93f7501"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(default_field_values): Implement formatting. \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/tools/rustfmt/src/items.rs"},"region":{"startLine":1949}}}],"partialFingerprints":{"codehealthFindingId/v1":"556eca09192dec7098645cfaee375973bdce351de3b0e768399a117da43b3017"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(calebcartwright) - This is a hack around a bug in the handling of TyKind::ImplTrait. \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/tools/rustfmt/src/items.rs"},"region":{"startLine":2197}}}],"partialFingerprints":{"codehealthFindingId/v1":"09f80f9f348f884f0b723fbeab2335e4c430ba5ca6416c8d40171a7c453c3bb3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: we might want to check that using the param indent \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/tools/rustfmt/src/items.rs"},"region":{"startLine":2668}}}],"partialFingerprints":{"codehealthFindingId/v1":"206b9f202df6c90c15b92bd2ea304d6019420dae78be92bbfd410ea5abd41a96"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: convert bounds to where-clauses where they get too big or if \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/tools/rustfmt/src/items.rs"},"region":{"startLine":3017}}}],"partialFingerprints":{"codehealthFindingId/v1":"df55094f78900df33b62735c2a5a9a56b76bf0eac68165a20bd15242c8a6d596"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: if indent_style != Visual, then the budgets below might \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/tools/rustfmt/src/items.rs"},"region":{"startLine":3243}}}],"partialFingerprints":{"codehealthFindingId/v1":"00453c1fce34a54a7655b9af42d09f0f20ee458fa6193676f9c05aa322b7474e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: we don\u0027t need to collect 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/tools/rustfmt/src/items.rs"},"region":{"startLine":3266}}}],"partialFingerprints":{"codehealthFindingId/v1":"77dbc876efc9c0a530c4ba4a2461cfbaf88f04ce14b950f34368af689cae5b65"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this may be a faulty span from libsyntax. \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/tools/rustfmt/src/items.rs"},"region":{"startLine":3488}}}],"partialFingerprints":{"codehealthFindingId/v1":"e35fb877990ee6e49622e2f81100fdc299162da4e904f5cbac4a8bea3fbcc3b6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#21): we\u0027re dropping potential comments in between the"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/items.rs"},"region":{"startLine":3529}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd49c23d7d8063bbb2963f0ebe200954ad51f06d9d436cc5e820c34852c89637"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#3441): post_snippet includes \u0027const\u0027 now"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/lists.rs"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"899aafa61ce308d9013fb50369ebb8a9b63ef114d5f9c1887632597c2f4db203"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(ding-young) We should also report macro parse failure to tell users why given snippet \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/tools/rustfmt/src/macros.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"82fb1e7d1f5b93269e2677854d24a102dda431e43a398451241eb151003d6f35"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(ding-young) report rewrite error even if we return Ok with original snippet \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/tools/rustfmt/src/macros.rs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"096539d3fdbd19d77ddc32e1746281905fe467fc5c076aff2f45c20b0624b13d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Support macro def with repeat. \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/tools/rustfmt/src/macros.rs"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fe4423bbe7a5c5a20440ea7bb515ed3d1b08a376b1ac7d06c5a8fd1795f5610"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: it would be more efficient to use references to the token streams \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/tools/rustfmt/src/macros.rs"},"region":{"startLine":1299}}}],"partialFingerprints":{"codehealthFindingId/v1":"13bb386839164c048a19a297effd236dc1567b1138b51d4194c1244edb701895"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#1539): implement for non-sugared macros."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/macros.rs"},"region":{"startLine":1318}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbaa85e25d890dbc24ed6feaef4c43d6917026c8ee46ad7faa65a2849b0ca1b0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this could be *much* more efficient. \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/tools/rustfmt/src/macros.rs"},"region":{"startLine":1420}}}],"partialFingerprints":{"codehealthFindingId/v1":"2512a5579fd9b828f544b24f640fda82f424189fcc058e9f7f096481ea12b39c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(ytmimi): the \u0060rewrite_match_body\u0060 branch also handles \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/tools/rustfmt/src/macros.rs"},"region":{"startLine":1701}}}],"partialFingerprints":{"codehealthFindingId/v1":"90d8893e8289f513d8724848e3939f21b23fabedbcf2db374cb58941e6b47947"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK(topecongiro): we use \u0060format_missing()\u0060 to extract a missing comment between \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/missed_spans.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"0865bbe56aae4f64505371360c46a5e6d76d65f85f833e465eb88b653408643f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Why don\u0027t we consider \u0060SegmentParam\u0060 to be simple? \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/tools/rustfmt/src/overflow.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2eee93f6bc48a15aa70ffdcb1bcfa63de9678c4234ed1b2ab53192f716611a5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: If we also fix \u0060SegmentParam\u0060, then we should apply the same \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/tools/rustfmt/src/overflow.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba550d71af247c2b18f52aafd3872c1f68050b8c880dfeee4df34115d54a022d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME would be nice to reuse the lists API for this, but because each separator \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/tools/rustfmt/src/pairs.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e26e29f2b723dcc8f9876f0810e1e68b9f0ed99284f1dcb73b6db66dd5372d8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#2455): Reorder trait items."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/reorder.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"14d0b4361ef5ce40acf88df90082a1d0f3e1dc7eb76381054c7d4b5bb76b4ee9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Remove duplicated 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/tools/rustfmt/src/reorder.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9e6006c8725123006979ea0bde826cff8c6d63d474a365da0ab5def2a19a03d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(default_field_values): This needs to be adjusted. \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/tools/rustfmt/src/spanned.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba8ec13686d0eeb666574fd39a22c7dc9188bb719a9e3717dc91b8ebd42ab257"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME(issue#3281): We must follow UAX#14 algorithm instead of this."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/string.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"420a091e73d2c0186ba2fb83b1963d97bcf5acaacf63725af4c17aa1df29903e"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: squeeze out the span between the identifier and the parameters. \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/types.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"451bc0f8a0aa5157bbf522da19a731d713e48efe82ec3a2709e3792c9443d649"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: dead spans? \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/tools/rustfmt/src/types.rs"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"c36490fa2c28ccff7dde5a22f2d5f00a8d033db00124ebdbb9a6384816dd5d3c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: If there are more than one attributes, this will force multiline. \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/tools/rustfmt/src/types.rs"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"9536e71f995f9d335e63d2910114a8009d8cd9953ba7717f3e93189253490af1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: we drop any comments here, even though it\u0027s a silly place to put \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/tools/rustfmt/src/types.rs"},"region":{"startLine":923}}}],"partialFingerprints":{"codehealthFindingId/v1":"669fe0c185978cd29ec697cb317be1c136338d345eaca506a065a913ef1203e9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME use \u0060segments_iter.intersperse(\u0022::\u0022).collect::\u003CString\u003E()\u0060 once \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/tools/rustfmt/src/utils.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a7f08681511739c595fe489cffd82ddbb7ac36d1df297e17d2c68d5c6568a5b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: use an RAII util or closure for indenting \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/tools/rustfmt/src/visitor.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"0651468e11ee34b3f7223ddb8df9134d3ef5b351653ebea30dc2bcdd439f981a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(calebcartwright 2021-01-03) - This exists strictly to maintain legacy \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/tools/rustfmt/src/visitor.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab59082b6fe182a9f3a966b81440be43837d416d86a1612cbba08d8401a85445"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(calebcartwright 2021-01-03) - This exists strictly to maintain legacy \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/tools/rustfmt/src/visitor.rs"},"region":{"startLine":947}}}],"partialFingerprints":{"codehealthFindingId/v1":"32641fc0fe9062db14396c8c852ded443e27af25f5119fcd7dd0b43a9b8b0656"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(calebcartwright): consider enabling box_patterns feature gate \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/tools/rustfmt/src/visitor.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b73630fa70e280f88ed7ac5b637aeefacdc28a642afc4fd5cc3c065f85cf9b3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(calebcartwright): consider enabling box_patterns feature gate \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/tools/rustfmt/src/visitor.rs"},"region":{"startLine":675}}}],"partialFingerprints":{"codehealthFindingId/v1":"198b9d88027463c080d22d3263611d252aa5b855a4d2463c35e58c7b51063f0c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: rewrite delegation items once syntax is established. \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/tools/rustfmt/src/visitor.rs"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"e62b8c74b92640817c3388e6679ca59b5b7423329270ff826ec786d78392c3db"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(calebcartwright): Not sure the skip spans are 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/tools/rustfmt/src/visitor.rs"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"accf7aa07585039d1152d425e839e4110648ee61fa4ea1b78f906eb55872d058"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(ytmimi) #![feature(fn_delegation)] \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/tools/rustfmt/src/visitor.rs"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"08ffa703f5e4dd1165df20e28678104b6516822b55ceb00177703106e2855304"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO[reviewer-help]: This is roughly \u0022does it end in 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/tools/rustfmt/src/visitor.rs"},"region":{"startLine":1101}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8216f6aea4f5b1bf6ebdca7e5e1cc30785f9efd3afd48c78430f484d163075f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: needs a better name, more explanation. \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/tools/rustfmt/src/test/mod.rs"},"region":{"startLine":1098}}}],"partialFingerprints":{"codehealthFindingId/v1":"5be1ff5821330fee2d5cfaddf1791e12e71d8ee0f59f2683e9f37848b16bd4ef"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(calebcartwright): Preemptive, currently unused addition \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/tools/rustfmt/src/parse/session.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"01c1509b9c2e3d4ddd72efcd7ff16b90277a5e4e7a4939ae680b8a1037d9beea"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(ytmimi) would be nice if rustfmt didn\u0027t need to implement parsing logic on its own \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/tools/rustfmt/src/parse/macros/cfg_select.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b0f48056a79b09f1cb3ab236b012807356ec239a09238a39e5ef9e59d797f63"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: These \u0060eat_*\u0060 calls should be converted to \u0060parse_or\u0060 to avoid \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/tools/rustfmt/src/parse/macros/lazy_static.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"620775cc6ade77a06c95fe58a33bd0b5ce4689c3f43a5237850741e7c45132a3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(emilio): We could avoid this most of the time if needed, 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/tools/rustfmt/src/format-diff/main.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"75686552052ccf1badc51bcac73334c58d63bdc4f17b98e49525720affb5f98b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: 4 is probably unnecessary and duplicative \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/tools/rustfmt/src/config/config_type.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"72af3b152b4f54ece378f14660fcf8183bb5048264c80236a0655d896ff65c6d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(calebcartwright) - remove \u0027version\u0027 at some point \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/tools/rustfmt/src/config/mod.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"77f8086ed2a3dacbfdd7990bb2538a8bae066a278ff92144dc42c2fa0e718c0f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: Issue-3581: this should be renamed to ItemsLayout when publishing 2.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":"src/tools/rustfmt/src/config/options.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5ff16ede8c3e33121f44e72ed3f9af6a0e014fac0ce5d784ae5f0172fe2a07f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: should update to Edition2027 when it becomes available \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/tools/rustfmt/src/config/options.rs"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"bff10f63a444022d48e598c882deadd3cedba758979a1a57a81559d5337cf483"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(ytmimi): Update \u0060StyleEdition::Edition2027\u0060 logic 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":"src/tools/rustfmt/src/config/options.rs"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"9362cd1bac0bc3374b763e894e387362ac6319a2b15efe850fcb3f9d02e51f4e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(ytmimi) Some of the configuration values have a \u0060Config\u0060 suffix, while others don\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/tools/rustfmt/src/config/options.rs"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"abfad7cc5c09409eeb1a118189d693a61f9f486c15a9f0dfaf494da66a3fd151"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: should update macro when default_2027 becomes available \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/tools/rustfmt/src/config/style_edition.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b965e71e0123c7083229766142fbc82c0c731d22eff99ffddba15f3a01c7725"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Implement this on struct. \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/tools/rustfmt/config_proc_macro/src/config_type.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"738446095d1d929926ef9a5ad3d2d17998639595ab492282c9e5521f46e346ac"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: still needed? Kept for compatibility for now. \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/tools/rust-installer/src/scripter.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"b016f6d466e7eaa9e006e5751045c1765fe564da60655ca62c55683e0863884f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: still needed? Kept for compatibility for now. \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/tools/rust-installer/src/scripter.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"3de7b2438fd01e3be8bb457e92f62b8fd72ed28b62117c975f8283326e2c801e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: what about Windows? Are default ACLs executable? \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/tools/rust-installer/src/util.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"cce57de8e14483fee86d62f56a975667fed97d7bea05cb312e6b8642295ce407"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: find a way to bring this back \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/tools/rust-analyzer/xtask/src/dist.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce718aa162f413e0d088ba9506cc785c3d0b4c6889e022f2332b60545845a878"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: switch to \u0060--revision\u0060 here around 2035 or so \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/tools/rust-analyzer/xtask/src/pgo.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"621abf2c9269a7e2e59a3049138e5a63e91beba37d8783c1fad983bed4d52a44"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK for const fn: math on primitives only \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/lib/text-size/src/range.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"f82aa943aa3d14ec85e25e89dc44ee0163344e4023f0759109d6d0fb19b230a5"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK for const fn: math on primitives only \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/lib/text-size/src/range.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"edd7ed6271f29beea49dae8eda25bd0dff9a8be94a5f2c7fbb929d426713d6fe"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: fix the lints \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/tools/rust-analyzer/lib/expect-test/src/lib.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1945b790b9215dc4a5b8fa659f14108a0865bd8fc5427c635021cee702763ff"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: This is a workaround, when the client has been disposed, VSCode \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/editors/code/src/client.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"31ddc334e46ebf4cf2af4e94bcb6f74864aede616f823edfe0951e9e3014625b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We currently emit this diagnostic way too early, before we have \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/tools/rust-analyzer/editors/code/src/client.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"d33d081a53966a9d497c2ffb75c75f291d8936d37ab4ae8aee85339349879be9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this is a workaround until vscode-languageclient supports doing the SnippeTextEdit conversion itself \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/tools/rust-analyzer/editors/code/src/commands.ts"},"region":{"startLine":1137}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1df2a101f36aac47fde10bf9d91a975559e4755aad15964d8d2d80d8c5c5bbc"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Merge this with \u0060substituteVSCodeVariables\u0060 above \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/tools/rust-analyzer/editors/code/src/config.ts"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9de1faaaecfca51425f9c2ab69c867726d8ceb756277759a37bd8eff865362f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: support for remote workspaces? \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/tools/rust-analyzer/editors/code/src/config.ts"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"d06989bf1038f362bee63c99b359f9189b49879702beae70587ef81c80b89b33"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We should re-use the client, that is ctx.deactivate() if none of the configs have changed \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/tools/rust-analyzer/editors/code/src/ctx.ts"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"80e9d1b20f8a04ef15e2d3c96c560213c0293576c9f773512c8b7f15f142aca7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We should re-use the client, that is ctx.deactivate() if none of the configs have changed \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/tools/rust-analyzer/editors/code/src/main.ts"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2ffa2dff4185904f2a367e17a96f997388e6667eaa06b726f3e3008faf22095"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: remove lldb-dap-specific post-processing once \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/tools/rust-analyzer/editors/code/src/debug.ts"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"7654bb42428b89cabf4e14d35e4d5d3abb7dc3f77891152ee4ef39fc41769a47"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Neither crates\\rust-analyzer\\src\\main_loop\\handlers.rs \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/tools/rust-analyzer/editors/code/src/debug.ts"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2504a483d188696abc8697378df561d32784c8493a7438dd5ba8a8a3f51c7d0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this should be non-optional \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/tools/rust-analyzer/editors/code/src/main.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cb845f1fff1bddadf35823ceb088d215cbdf7db2e198cedf1034914fecb864f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: The server should provide this \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/tools/rust-analyzer/editors/code/src/tasks.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"8691673f88b6d7a233b63a2c091ec8952f968cacce5a1e656c93185720431058"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: The server should provide this \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/tools/rust-analyzer/editors/code/src/toolchain.ts"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f16d6231775704e8c272f662e80d8e11fae270208909152b35720b3160f6b42"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: The server should provide cargo \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/tools/rust-analyzer/editors/code/src/tasks.ts"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bb15e06ae3603273a62043285d5f3d508f4bf2c44b72e84b725dc7b3f1909c9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(hack_recover_crate_name): We eagerly resolve every test if we got a lazy top level response (detected \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/tools/rust-analyzer/editors/code/src/test_explorer.ts"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae56f1120fa41059f450bc7461a4a1f553f028e8c1fafddbb8b6b9d9d08944ef"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //!     todo: panic \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/tools/rust-analyzer/crates/test-utils/src/minicore.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"16afbb686c22b4e5472317767a74c1cfd6444e19934a6b82f415056cb8443193"}},{"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/tools/rust-analyzer/crates/test-utils/src/minicore.rs"},"region":{"startLine":2512}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c7c46d13bb7f06897d808b6171a3456e24ffa2b6a47eb0d75288a13af32a7b2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This is less than ideal \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/tools/rust-analyzer/crates/test-fixture/src/lib.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d353496bf90d59d5a97970e238c3b3642c38b5a3d2260feac0c710850a2b6ed"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This is less than ideal \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/tools/rust-analyzer/crates/hir-def/src/nameres/tests/incremental.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1e07c4c0689d6a07ae266b67f6d295192acd47623ee68cd5f5af6711b858d98"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX Currently replaces any literals with an empty string, but supporting \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/tools/rust-analyzer/crates/test-fixture/src/lib.rs"},"region":{"startLine":1056}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa2b1a27bd362425ca7786fe9ad053ac8603889e5b4b393ed722f360cc82cd64"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: we probably should re-think  \u0060token_tree_to_syntax_node\u0060 interfaces \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/tools/rust-analyzer/crates/syntax-bridge/src/lib.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fdedd31105d103b57bc3a13b4c1d8a54db38fa168fc31c549b12ad659bbfc7b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: record an error somewhere if we\u0027re closing more than one tree 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/tools/rust-analyzer/crates/syntax-bridge/src/lib.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"6be5c26f5d5e1e5ca34eda2241ae009f654453a25ee95cdcd371d89c5a1b591e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this might still be an unmatched closing delimiter? Maybe we should assert 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/tools/rust-analyzer/crates/syntax-bridge/src/lib.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c742da2663c54cce66b19b4f58c7ef36153777b4c97362676cda05b88e0c6c5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: record an error somewhere? \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/tools/rust-analyzer/crates/syntax-bridge/src/lib.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a451d15442906f31b9a954084cd945976f3e31c58ad86897173a89cc797cc6c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Span splitting \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/tools/rust-analyzer/crates/syntax-bridge/src/lib.rs"},"region":{"startLine":885}}}],"partialFingerprints":{"codehealthFindingId/v1":"50c5e225b590c7fe5f26f8503272ab4563a73d7cce68b5138e29eccaa7056ccc"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Emitting whitespace for this is really just a hack, we should get rid of 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/tools/rust-analyzer/crates/syntax-bridge/src/lib.rs"},"region":{"startLine":1017}}}],"partialFingerprints":{"codehealthFindingId/v1":"092c94149e34efc64a499145beec9d6240d86ef19a141de2041f93384fa1ed4e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this branch is for \u0060=\u003E\u0060 in macro_rules!, which is currently parsed 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":"src/tools/rust-analyzer/crates/syntax-bridge/src/prettify_macro_expansion.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"10be19c2c6cf801167bf770c2a15b58b5a638a276630bf0d1ff0f9acb2a5cb47"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Why input included WHITESPACE? \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/tools/rust-analyzer/crates/syntax-bridge/src/prettify_macro_expansion.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"94ac362cd0b9c63eada987b79143abe2d82201f375d989699fea5cdfabef6311"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: validation errors are not handled 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/tools/rust-analyzer/crates/syntax/src/lib.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"07eeb7875d71aac8ae2ded5f8ddbe188d76262c7e521e3de10c4ba84fe3f89b2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment repeated across 10 files: The identical FixmeComment appears in 10 files (10 occurrences) \u2014 almost certainly one boilerplate line from a single migration or decision, not 10 independent debts. Fix the systemic cause once rather than file-by-file. Text: \u0022// FIXME:\u0022. Source code is not a task system: track the cleanup where tasks live. (Every occurrence still counts toward the score and metrics.)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/syntax/src/validation.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe39e5a21eb610e22b1ed54832401964492820c0e5a995f53f2431fed8ff81cf"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: move this function to outer scope (https://github.com/rust-lang/rust-analyzer/pull/2834#discussion_r366196658)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/syntax/src/validation.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"01671b88320e4bfefa5b3d9c1b441cd5ea2ee1bed753c560257b54a6524365f4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: lift this lambda refactor to \u0060fn\u0060 (https://github.com/rust-lang/rust-analyzer/pull/2834#discussion_r366199205)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/syntax/src/validation.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2990a1ceb80cb432ff2c6e8bdfa2c99d4408f024893afecc2b1160850303c96"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Emit lexer warnings \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/tools/rust-analyzer/crates/syntax/src/validation.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aa018ca9345c599e6f96e9cd1dcfb7a22cd2cd95ebe7bb8d22e6bc13cdcdfeb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: disable validation if there\u0027s an attribute, since some proc macros use this syntax. \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/tools/rust-analyzer/crates/syntax/src/validation.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"b292509b408a10217525c4f056cea217465b5ebb59020f30aeddd1dfa8b3e8f0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This is not a validation error, this is a context dependent parse 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/tools/rust-analyzer/crates/syntax/src/validation.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"9946cb29a34ee8e34b0767962c8af22fb0fa999a902cdf3b08221ea34d60de1f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This is not a validation error, this is a context dependent parse 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/tools/rust-analyzer/crates/syntax/src/validation.rs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"265b77e6c5b69d2868530a119e7b508286338e5fc6201a92bbbd4d1e0426731c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: some test here actually test token reparsing \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/tools/rust-analyzer/crates/syntax/src/parsing/reparsing.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"db18a6d671de6d7f7deb5bd36c704f941d6310e79c0c44989731fe28b233671f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: reparse only int literal 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/tools/rust-analyzer/crates/syntax/src/parsing/reparsing.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d8aae99c32153d1d59bcb1a66641d3caa79f222ed8136b16f42880f2e7ca7fa"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: replace stringly-typed constructor with a family of typed ctors, a-la \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/tools/rust-analyzer/crates/syntax/src/ast/make.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"50b71fb70dd082ccd6521259f6b034ca1a9e7249ea14acf72b44633fb23e4de5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: path concatenation operation doesn\u0027t make sense as AST op. \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/tools/rust-analyzer/crates/syntax/src/ast/make.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d29a6cdad2d44d530b9a7eeb4fd41cbfd48300e38f6bec6e6619b1efd040231"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: should not be pub \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/tools/rust-analyzer/crates/syntax/src/ast/make.rs"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7aafa4767cdc3489674b023fa975448ab921a2a276c390817dfea983017ff3e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: should not be pub \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/tools/rust-analyzer/crates/syntax/src/ast/make.rs"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"d71429104fe8b7017b576b70b2a9ffaac648e57df0ff04854a6148e4546ddde1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: replace usages of this with the mutable syntax tree 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/tools/rust-analyzer/crates/syntax/src/ast/make.rs"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"c50e1b56f1ce6322e11c7b02a88547c6d0d808cc787e8eecd1175d242818ee58"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: remove when no one depends on \u0060generate_impl_text_inner\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/tools/rust-analyzer/crates/syntax/src/ast/make.rs"},"region":{"startLine":1121}}}],"partialFingerprints":{"codehealthFindingId/v1":"92b7fe5ed06beb83c743d1f7e8153787c7729da36b537c08c43eea81f8608cfc"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: remove all these methods, they belong to ast::StmtList \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/tools/rust-analyzer/crates/syntax/src/ast/node_ext.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec85ebb34429e34f0d5e7d313b1970f39524b84475acd2e79c7f6c229416e66f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: Calling this is almost always incorrect, as \u0060cfg_attr\u0060 can contains multiple \u0060Meta\u0060s. \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/tools/rust-analyzer/crates/syntax/src/ast/node_ext.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"18039bd8b61e4f760f9b25b1a6234f89b81a08769a4e26df6e9cf005455f3413"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Move this over to \u0060ast::TypeAnchor\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/tools/rust-analyzer/crates/syntax/src/ast/node_ext.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"3948f658d23342abb40da8cef18b4b2f9641b7e8fccf40d81dfeab2031952b39"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Accepting floats here to reject them in validation later \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/tools/rust-analyzer/crates/syntax/src/ast/node_ext.rs"},"region":{"startLine":815}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a38bac4c82f1041546f68e3d921d502063c6dafe3541428426ed48d7b716089"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#17451) Use \u0060expected: f128\u0060 once \u0060f128\u0060 is stabilised."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/syntax/src/ast/token_ext.rs"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"52efb2eeb27e77718e5141b0fcbc42a193558d1f885b5be98ad7b9b0bf4f3b83"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Technically \u0060ThinVec\u0060\u0027s layout isn\u0027t guaranteed unless we enable the \u0060gecko-ffi\u0060 feature. Should we enable 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/tools/rust-analyzer/crates/stdx/src/thin_map.rs"},"region":{"startLine":904}}}],"partialFingerprints":{"codehealthFindingId/v1":"0882f2a2e53341249e75a0a52a3f00698548a6b647f2ffd7d4e0cb58799dbb67"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Switch to \u0060Box::into_non_null()\u0060 once stable. \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/tools/rust-analyzer/crates/stdx/src/thin_map.rs"},"region":{"startLine":971}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd3ed531b7468deeca68120bff689e5e40bced906f93d62f45cfa096ffbdb9e1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Windows has QoS APIs, we should use them! \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/stdx/src/thread/intent.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bde5477bdeff3679ea9ec7610967d824996ec24d26e28872ab8fa6714d562e7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: If we store the final \u0060UseTree\u0060 instead of the top-level \u0060Use\u0060, we can store its name, \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/tools/rust-analyzer/crates/span/src/ast_id.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"387ba533de5cf577753ed49a0953a30fc50b0677f08489bc74137c314609c607"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Is this the correct thing to do? Macro calls might actually be more incremental if \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/tools/rust-analyzer/crates/span/src/ast_id.rs"},"region":{"startLine":673}}}],"partialFingerprints":{"codehealthFindingId/v1":"33d82cc0ecca088d535a383fa9b077fab76618e3210075a45d3bb781b160fb84"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Technically there could be an extern block inside another item, e.g.: \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/tools/rust-analyzer/crates/span/src/ast_id.rs"},"region":{"startLine":779}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ab7e7ebc6ca998af4caf6136e541c8952464a0ffe1cdbb34d82b8baec646a91"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: The None case needs to encode the context crate id. We can encode that as the MSB of \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/tools/rust-analyzer/crates/span/src/hygiene.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"95b22dc444531909cc9901670883ff0ada488fcc72a55e4ce2bcb8141d8904c9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Give this a better fitting name \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/tools/rust-analyzer/crates/span/src/lib.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fd6b6397e82aeb4a9f00274d1ebfef90bcfb94d194c44d83ecaa98bab9dc78a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Does it make sense to have this 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/tools/rust-analyzer/crates/span/src/map.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"773d762ebe053693b39e53d22bff33c19ea5ddefbf49253fa53f55cef7e62b22"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this might be wrong? \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/tools/rust-analyzer/crates/span/src/map.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"928d4b35444970a689a858dfb6b1640b1a77bf086bde0b60e04f1003b32cca1a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: SortedVec\u003C(TextSize, ErasedFileAstId)\u003E? \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/tools/rust-analyzer/crates/span/src/map.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3268129d8ac9d6851e8025d25be14d7f688e4dc8c8997ba1e46af40679becc6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This test is failing too frequently (therefore we disable it on CI). \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/tools/rust-analyzer/crates/rust-analyzer/tests/slow-tests/main.rs"},"region":{"startLine":896}}}],"partialFingerprints":{"codehealthFindingId/v1":"19f7df1aeee15600d479b2ba39e604ce99563bc83b152cd7b0f02679d9a1f125"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME @alibektas : This test is atm not valid. \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/tools/rust-analyzer/crates/rust-analyzer/tests/slow-tests/ratoml.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"a88b94bf960a52cc3e618bbde14444a838f882e8f6215d41fc4800b21b82952b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME @alibektas : \u0022locality\u0022 is according to ra that, which is simply in the file system. \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/tools/rust-analyzer/crates/rust-analyzer/tests/slow-tests/ratoml.rs"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"905adffa6460344104ababcf821c6a43e916c4712852e0a71024d686f10582c6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: rewrite in terms of \u0060#![feature(exact_length_collection)]\u0060. See: #149266"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/tests/slow-tests/support.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"48f7da52b9ed2f08077110ba2ffc23dcb671cfeea27548dc32bfa515ebb30a43"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: rewrite in terms of \u0060#![feature(exact_length_collection)]\u0060. See: #149266"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-completion/src/tests/raw_identifiers.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc94dd7093411755e6ea385c9cae6e5bafd15897e6ada759a0c88e7d1eac5e67"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: rewrite in terms of \u0060#![feature(exact_length_collection)]\u0060. See: #149266"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_bool_then.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c2df6818456d281a89cb395b2fdaa1a81328d9ae6786311b28a67d65325fc58"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: rewrite in terms of \u0060#![feature(exact_length_collection)]\u0060. See: #149266"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-expand/src/builtin/fn_macro.rs"},"region":{"startLine":805}}}],"partialFingerprints":{"codehealthFindingId/v1":"b93cf51e312f3be50d5de404eb9c7e7d572e296204b738984e867b49e795bd90"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: /// XXX: remove the tempdir last \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/tools/rust-analyzer/crates/rust-analyzer/tests/slow-tests/support.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"3577ad784d3404e0dd32f1480f93bdbaa77ae7b9c8bf3cfcf785dc049115768e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(@poliorcetics): move to multiple targets here too, but this will need more 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/tools/rust-analyzer/crates/rust-analyzer/src/config.rs"},"region":{"startLine":875}}}],"partialFingerprints":{"codehealthFindingId/v1":"c08098a9c0f1df5e5360c624935ea395ead9caf13d8126e7b65ec46c17c6b307"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME @alibektas : Server\u0027s health uses error sink but in other places it is not used atm. \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/tools/rust-analyzer/crates/rust-analyzer/src/config.rs"},"region":{"startLine":1206}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ba2f5cf880d07b171e129dafff6106c5933ad0c6fefa113ab641f75fb2900c9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME @alibektas : This is the only config that is confusing. If it\u0027s a proper configuration \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/tools/rust-analyzer/crates/rust-analyzer/src/config.rs"},"region":{"startLine":1980}}}],"partialFingerprints":{"codehealthFindingId/v1":"29405a9b299e7ecac3546455ee4797c2a4050fc21b20231cc3c68d25cda31420"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Also detect the proposed lsp version at caps.workspace.workspaceEdit.snippetEditSupport \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/tools/rust-analyzer/crates/rust-analyzer/src/config.rs"},"region":{"startLine":2703}}}],"partialFingerprints":{"codehealthFindingId/v1":"386102119894a01933ac917f7c9682ca554d3eb8039b63068bee307bdd560505"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: check alias first, to work around the VS Code where it pre-fills 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/tools/rust-analyzer/crates/rust-analyzer/src/config.rs"},"region":{"startLine":3651}}}],"partialFingerprints":{"codehealthFindingId/v1":"51a4c834320d86ab44f2f2300a840ee47b0a62c0a88f40b596f5043d8ccf73e2"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: check alias first, to work around the VS Code where it pre-fills 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/tools/rust-analyzer/crates/rust-analyzer/src/config.rs"},"region":{"startLine":3679}}}],"partialFingerprints":{"codehealthFindingId/v1":"d29a33a702b2151fe115a51f6f5f19139281003203a0b8996b33ee6bc3c66948"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: should be FxHashMap\u003CFileId, Vec\u003Cra_id::Diagnostic\u003E\u003E \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/tools/rust-analyzer/crates/rust-analyzer/src/diagnostics.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0d8a081cd8a787e9382b3542cb029163687cad4fbb05b86efc1edda6ccc3755"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Doing the merge step of a merge sort here would be a bit more performant \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/tools/rust-analyzer/crates/rust-analyzer/src/diagnostics.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"15905298ac0c743b36e29b54e8eae891d944fb9b8cafe6720de06e8f1f33dde0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: are we sure the extra env should be empty? \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/tools/rust-analyzer/crates/rust-analyzer/src/discover.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"7daa4d1e5c90040df20ba0a936f5fa52dbc3a52c416df0692a9b07d5ecf7bb8f"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: drop order is significant \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/tools/rust-analyzer/crates/rust-analyzer/src/flycheck.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e8a1f00e5a381bff90228ed0d4db78bfc7543a0431a93b647d88b142b000686"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: \u0026affected_workspace \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/tools/rust-analyzer/crates/rust-analyzer/src/flycheck.rs"},"region":{"startLine":979}}}],"partialFingerprints":{"codehealthFindingId/v1":"f540715dd09cc537a6819120ef6a8f3f48a32e39c95fa92c2db47d7cf180c331"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: /// HACK: Workaround for \u003Chttps://github.com/rust-lang/rust-analyzer/issues/19709\u003E \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/global_state.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"905bb19b8b9f048b58a28335d8ed68ebe1e1abb5f1095827d95fa78964e99743"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This should move to the VFS once the rewrite is done. \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/tools/rust-analyzer/crates/rust-analyzer/src/global_state.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"feebcae63f1c9c89d5ac9dc0aaa97fb03dcb54c2a66e434f647774c08606e7d8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Can we derive this from somewhere else? \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/tools/rust-analyzer/crates/rust-analyzer/src/global_state.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7efb9c00816573ffad9b256ba543f4fd5709ed4420d384217fda6b2fdc9c14f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Consider doing normalization in the \u0060vfs\u0060 instead? That allows \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/tools/rust-analyzer/crates/rust-analyzer/src/global_state.rs"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ff8d9a667083c11111422cedcdf55a0f7e22236f0702686836937cea94c511a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME @alibektas : This is silly. There is no reason to use VfsPaths when there is SourceRoots. But 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/tools/rust-analyzer/crates/rust-analyzer/src/global_state.rs"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"aee0be5b5f854ba6578f7b6246c86c61b07d8113c8e9057f6420a538070bfbbc"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: \u0060workspace_structure_change\u0060 is computed from \u0060should_refresh_for_change\u0060 which 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":"src/tools/rust-analyzer/crates/rust-analyzer/src/global_state.rs"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"66d17ce4c6a385ac308868fb32353aec9926bf70e7b8e42c1a35ed9b5d5ece0a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: ideally we should only trigger a workspace fetch for non-library changes \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/global_state.rs"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdc551317abe4500c056c001440e645bef2368a83fe05ea5c03f00c06b6e57e4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We should cancel the in-progress fetch 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/tools/rust-analyzer/crates/rust-analyzer/src/global_state.rs"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"df76cf77dd116caff37de3cb51d452940a22a3a4e338759b9628565d9b7e3adc"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Remove this in favor of a more general QueuedTask, see \u0060handle_did_save_text_document\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/tools/rust-analyzer/crates/rust-analyzer/src/main_loop.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"138941441d39b513ea1f7aebf93872efc8ee347b14c50e069a615f1ddd905652"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME This feels a bit off, this should go through similar machinery as build scripts? \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/tools/rust-analyzer/crates/rust-analyzer/src/main_loop.rs"},"region":{"startLine":962}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccc952ca8007d41e524900becabbe1e05bbb662cf7ed7cff1071380196b68353"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Check whether these files could be build script related \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/tools/rust-analyzer/crates/rust-analyzer/src/main_loop.rs"},"region":{"startLine":1116}}}],"partialFingerprints":{"codehealthFindingId/v1":"2be925bc8d8f5bc74d2cbc36e3a88fccd150285c6aaa6e292aa45c760d3e47d9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Retrying can make the result of this stale? \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/tools/rust-analyzer/crates/rust-analyzer/src/main_loop.rs"},"region":{"startLine":1377}}}],"partialFingerprints":{"codehealthFindingId/v1":"25858884015be6d843f2e7767b6f1d7882deff34effac255d6f058cbe0f5fd7d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Retrying can make the result of this stale \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/tools/rust-analyzer/crates/rust-analyzer/src/main_loop.rs"},"region":{"startLine":1379}}}],"partialFingerprints":{"codehealthFindingId/v1":"103785161d645f8a39178f86607d0603e57f087366f4f5d5082aec4dc8ea4aa2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Some of these NO_RETRY could be retries if the file they are interested didn\u0027t 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/tools/rust-analyzer/crates/rust-analyzer/src/main_loop.rs"},"region":{"startLine":1384}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8258555d5f8f42e3e4bdb4fd8a2f5b840aa3d6aa90c7acb90874673ac2c41a2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This is a mess that needs some untangling 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/tools/rust-analyzer/crates/rust-analyzer/src/reload.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"07e1039c5e19f55a5d977457b0f8cc061d6eb707d0b29b9a9314b045f899bb5f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: can we abort the build scripts here if they are already running? \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/tools/rust-analyzer/crates/rust-analyzer/src/reload.rs"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"32cb880baf0c7f5e5093a73fd945e511938a0c1a073d951018e6bed1d4f877e0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Move this into load-cargo? \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/tools/rust-analyzer/crates/rust-analyzer/src/reload.rs"},"region":{"startLine":981}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcd272b66118dac80c20767f23239f9a707b2fd1ee2eef038b85554fc0bec334"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: remove \u0060.with_filter(LevelFilter::OFF)\u0060 on the \u0060None\u0060 branch. \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/tools/rust-analyzer/crates/rust-analyzer/src/tracing/config.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"81f078ed212a4d3a990e0584f75d2874ed145be84f5660c323ff1acfa7f042c7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: remove \u0060.with_filter(LevelFilter::OFF)\u0060 on the \u0060None\u0060 branch. \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/tools/rust-analyzer/crates/rust-analyzer/src/tracing/config.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d94e78edb698176d816817ef20243f07ba21a968b77148c37ace05dde92c1c8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: ideally we\u0027d put this on \u0060SnippetWorkspaceEdit.change_annotations\u0060, but that doesn\u0027t 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/tools/rust-analyzer/crates/rust-analyzer/src/lsp/ext.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0f3a8804af49d4a349b5ae1fa3bf8fc4c95a338cc534eeb65e17b74ffafeba6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: The cause for this is likely our request retrying. Commented out as this log is just too chatty and very easy to trigger. \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/tools/rust-analyzer/crates/rust-analyzer/src/lsp/from_proto.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad6f109b3b049b06d28dc8c07f538a71da5c06556d8625d8a774faa999a8ed33"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: use the \u0060_runnable\u0060 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/tools/rust-analyzer/crates/rust-analyzer/src/lsp/to_proto.rs"},"region":{"startLine":2014}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3050c6c58d37b9549dd0cfbe27e7bfa91cb08c9ed5a6a7fb418c9f4d1ff4586"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We should move this check into a QueuedTask and do semantic resolution of \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/tools/rust-analyzer/crates/rust-analyzer/src/handlers/notification.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"df971191fee6e6f6b629ca2464c1940b415bd09407f112b1f869460bbd0bc42c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Because triomphe::Arc\u0027s auto UnwindSafe impl requires that the inner type \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/tools/rust-analyzer/crates/rust-analyzer/src/handlers/notification.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"e768976b79f42137e94d52d192b31ecb59b94e6fff3c98de9561cfd98360f9a7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Set deprecation \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/tools/rust-analyzer/crates/rust-analyzer/src/handlers/request.rs"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"81b64618aef2c5d776e7d01ff128dd957c2a4ea759fe5e9e02ca69123c4db375"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We should fix up the position when retrying the cancelled request 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":"src/tools/rust-analyzer/crates/rust-analyzer/src/handlers/request.rs"},"region":{"startLine":1174}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4d2c9741704dd9419524fc90efa4800b87cdd54bd8064d7918ce69593a3b966"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We should fix up the position when retrying the cancelled request 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":"src/tools/rust-analyzer/crates/rust-analyzer/src/handlers/request.rs"},"region":{"startLine":1226}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b595de2c3013f42be79a15d5cbf764b655f063cd4d661c667fa161b3fcae405"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this mapping is awkward and shouldn\u0027t exist. Refactor \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/tools/rust-analyzer/crates/rust-analyzer/src/handlers/request.rs"},"region":{"startLine":1568}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3651add846d3b37177fd6ececf10cb7ad1256089980c1a0dc24f77a07db85c2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: use \u0060rustfmt --config-path\u0060 once \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/tools/rust-analyzer/crates/rust-analyzer/src/handlers/request.rs"},"region":{"startLine":2418}}}],"partialFingerprints":{"codehealthFindingId/v1":"2078e3e7009b876263860184eafd197982cfb654bc9d1abb389d6d861683ed24"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Set RUSTUP_TOOLCHAIN \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/tools/rust-analyzer/crates/rust-analyzer/src/handlers/request.rs"},"region":{"startLine":2447}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc9a6671daeb1dc1ce832649568064a62a3c8a7c65f8782635b449917d2a0ea4"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: special case for \u0060warnings\u0060 rustc lint. \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/diagnostics/flycheck_to_proto.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"5da81f57064129d4ede717a9398086f4ab82332bd21cdf95c75f003b924f5e46"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: special case for \u0060warnings\u0060 rustc lint. \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/diagnostics/flycheck_to_proto.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"a148c13c340b55dacc85cb40b018f853b2d4843d0f8b23f968b5e84385b1aee2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: current rustc does not seem to emit \u0060\u003Cmacro file\u003E\u0060 files anymore? \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/tools/rust-analyzer/crates/rust-analyzer/src/diagnostics/flycheck_to_proto.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"2abee2ee2df938855949b0d11995a4be6b54532642eb4b0184e356e5dc1aa9e8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: there\u0027s no good reason to use edit_map 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/tools/rust-analyzer/crates/rust-analyzer/src/diagnostics/flycheck_to_proto.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a04e4ec63a434b6d240df7661701ae7bbb0aa2e8d8ff489b42df58c22219e53"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(salsa-transition): bring back stats for ParseQuery (file size) \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/tools/rust-analyzer/crates/rust-analyzer/src/cli/analysis_stats.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"87b0080522b76b816b603ef914994301ff22baefbb7f35ba7242cd38ac11aa5a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: In some rare cases \u0060AssocItem::container_or_implemented_trait\u0060 returns \u0060None\u0060 for trait 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/tools/rust-analyzer/crates/rust-analyzer/src/cli/analysis_stats.rs"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"85b6af8268998ef1183ca708ae5be7600dd0d272734d0a92b8526f002f387cb0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We don\u0027t have access to the necessary types here (nor we should have). \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/tools/rust-analyzer/crates/rust-analyzer/src/cli/analysis_stats.rs"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed525e40b5040109ee9ea320bd6e6ac50e62a060a1b7802040e1551078848006"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(salsa-transition): bring this back whenever we implement \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/tools/rust-analyzer/crates/rust-analyzer/src/cli/analysis_stats.rs"},"region":{"startLine":1661}}}],"partialFingerprints":{"codehealthFindingId/v1":"23a5be5b5eba81778a7dfca172902bf1c10e9117e6206504cf4cc9c3d3663a20"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME @alibektas : What happens to errors without logging? \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/tools/rust-analyzer/crates/rust-analyzer/src/cli/scip.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"51298816d495da956e918d72ec464480cb04c5f205742255cfcc96455a71294d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: See #18772. Duplicate SymbolInformation for inherent impls is"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/cli/scip.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bb3c46c604a43ee899f2f519e89199179e22fbbbbf7fcfb8b56d0ee4ed67207"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Known buggy cases are described 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/tools/rust-analyzer/crates/rust-analyzer/src/cli/scip.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef3c2eea764a5d6295cf780e9b3d468926e37cedc8e418729affe86d4c991935"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This test represents current misbehavior. \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/tools/rust-analyzer/crates/rust-analyzer/src/cli/scip.rs"},"region":{"startLine":912}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dc97dc92a0762947e57f8b4910b6999d5920e726ce27fe22d89a7a31b4d3dc1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This test represents current misbehavior. \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/tools/rust-analyzer/crates/rust-analyzer/src/cli/scip.rs"},"region":{"startLine":928}}}],"partialFingerprints":{"codehealthFindingId/v1":"814280778c19922ad00453b06402b883df30dea9d2f8c0a3449fc6053734e926"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This test represents current misbehavior. \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/tools/rust-analyzer/crates/rust-analyzer/src/cli/scip.rs"},"region":{"startLine":944}}}],"partialFingerprints":{"codehealthFindingId/v1":"74ca0700424c0cea65df1750430d1c09b10547c21e5a856349292a554f169898"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This test represents current misbehavior. \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/tools/rust-analyzer/crates/rust-analyzer/src/cli/scip.rs"},"region":{"startLine":960}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccd644a3d66528752448a28a26e28c347374defbe8f765ccfda487746197c9f8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This should be a local: \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/tools/rust-analyzer/crates/rust-analyzer/src/cli/scip.rs"},"region":{"startLine":923}}}],"partialFingerprints":{"codehealthFindingId/v1":"c38569ca45f0a5f589505561f6d594c307530f2e6e394cafa8503b43e17d49e8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This should be a local: \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/tools/rust-analyzer/crates/rust-analyzer/src/cli/scip.rs"},"region":{"startLine":939}}}],"partialFingerprints":{"codehealthFindingId/v1":"78ae0d301e4991fa259ef07ccf255d161ae8e661fd10d0a4676d81dd705fc0b5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This should be a local: \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/tools/rust-analyzer/crates/rust-analyzer/src/cli/scip.rs"},"region":{"startLine":955}}}],"partialFingerprints":{"codehealthFindingId/v1":"aad550f6b4bba72bbe1b1238637474ad4f8071ce98e8d1d84e450f3a6614a54a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This should be a local: \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/tools/rust-analyzer/crates/rust-analyzer/src/cli/scip.rs"},"region":{"startLine":971}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f2a2c3ae2d1f8fe8f6eb0111244ea925b3404e7ea3205fe5530d4cfeed01afb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Find a better way to know if it is a dylib. \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/tools/rust-analyzer/crates/project-model/src/build_dependencies.rs"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"533b4f9f955d21514c10b86b0f5feb61bbda655d8b1cfd02c3eaef7ac9dc3ed6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: ask Cargo to provide this data instead of re-deriving. \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/tools/rust-analyzer/crates/project-model/src/env.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"4635cd32afaad9628e56c1214a288dee11409857db5aba369dbabf14c9e6c098"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Missing variables: \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/tools/rust-analyzer/crates/project-model/src/env.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9b5099fddb1066b9e17f40fb1f254051a11cff83b34ac223e27796b7ff0adf0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Remove this, that will bump our project MSRV to 1.82 \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/tools/rust-analyzer/crates/project-model/src/sysroot.rs"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"b930e8a70cc8ae7a019d8886d84b89335ee358335282250a1181514013e31e51"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: make this a per-crate map, as, eg, build.rs might 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/tools/rust-analyzer/crates/project-model/src/workspace.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"d40b3cd3fe6ca2b600631b3ba003cb6752eb880b4eafd1074f9a41d8c1f47283"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: The primary limitation of this approach is that the set of detached files needs to be fixed at the beginning. \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/tools/rust-analyzer/crates/project-model/src/workspace.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"2354726f91abeddf1082c3b3fb23728f3e440740e1f63c94b4b064ae819841f3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This looks incorrect but I don\u0027t think this matters. \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/tools/rust-analyzer/crates/project-model/src/workspace.rs"},"region":{"startLine":1125}}}],"partialFingerprints":{"codehealthFindingId/v1":"89d363e1ef4df9b28d51966092ac8ebea5ee121571e0ca548dde391c8833a34d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Remove this once rustc switched over to rust-project.json \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/tools/rust-analyzer/crates/project-model/src/workspace.rs"},"region":{"startLine":1460}}}],"partialFingerprints":{"codehealthFindingId/v1":"cac4bcd071b4d09b4b948a7f5a819aab25c5396f08bb8e8da927b49a6282fe39"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This looks incorrect but I don\u0027t think this causes problems. \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/tools/rust-analyzer/crates/project-model/src/workspace.rs"},"region":{"startLine":1468}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbfc9642f589fe196d5ea69c74d22e18790e1bb9768d1d7c9da708b71c0cae60"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This looks incorrect but I don\u0027t think this causes problems. \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/tools/rust-analyzer/crates/project-model/src/workspace.rs"},"region":{"startLine":1493}}}],"partialFingerprints":{"codehealthFindingId/v1":"b907cb646b2bd79d11f522624a612b6337c2ef2dbb27dd1b68bf844051c7206d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: There shouldn\u0027t really be a need for duplicating all of this? \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/tools/rust-analyzer/crates/project-model/src/workspace.rs"},"region":{"startLine":1535}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3ee370538a6157365c7d7438fb388abb4ea300bb9ef6900bec36bd00678fd6b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Passing extra_env is somewhat dubious here, for the same reason we don\u0027t pass \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/tools/rust-analyzer/crates/project-model/src/workspace.rs"},"region":{"startLine":2000}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d55c30a08ebe9ef42de8d2535354f7fb9c611750e37171a51ca2710c526a226"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Once we can talk back to the client, implement a \u0022long join\u0022 request for anchors \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/tools/rust-analyzer/crates/proc-macro-srv/src/lib.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae5a67e20356077b7cdfc150884afb8f4c4634d80abe31c1a0298ea5b57fb086"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Error on edition \u003E= 2024 ... I dont think the proc-macro server can fetch editions 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/tools/rust-analyzer/crates/proc-macro-srv/src/token_stream.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"b37d81e304bafa38f22cd26ef90d5ebec571fe368078d74b84f44534be53d4ff"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME handle diagnostic \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/tools/rust-analyzer/crates/proc-macro-srv/src/server_impl/rust_analyzer_span.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"01ffff1c6375bc4b4504216e013a99dde7d848d42a81585c28673d7466cf93ad"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: requires db, more importantly this requires name resolution so we would need 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/tools/rust-analyzer/crates/proc-macro-srv/src/server_impl/rust_analyzer_span.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"41435816956f2656d97a0758259f2483fc408182404464a7789b409fd5dc3703"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME, quote is incompatible with third-party tools \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/tools/rust-analyzer/crates/proc-macro-srv/src/server_impl/rust_analyzer_span.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c1d0e02f92d0f55b54c23e191316e3612718f1d27e4e4426911ba505734adaf"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME, quote is incompatible with third-party tools \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/tools/rust-analyzer/crates/proc-macro-srv/src/server_impl/rust_analyzer_span.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b7973618497bb5ee89b1d417db54801704d1d4481c8041cd4eecc0e55b3e449"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: nfc-normalize and validate idents \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/tools/rust-analyzer/crates/proc-macro-srv/src/server_impl/rust_analyzer_span.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"a510e617d0295eed33f7450f1116d1c7c02fdd2041f51a13bddcbd52428dcf02"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: nfc-normalize and validate idents \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/tools/rust-analyzer/crates/proc-macro-srv/src/server_impl/token_id.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"90ff849bd50089cd40a807c973e3464e3330fbb4b88d6495f493910d4ff6c31e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Avoid \u0060AssertUnwindSafe\u0060 by making the callback \u0060UnwindSafe\u0060 once \u0060SourceDatabase\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/tools/rust-analyzer/crates/proc-macro-api/src/bidirectional_protocol.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a81848ca8171e523c338aa881cf6069f3ebc8a89bcc72dcb1c715dfff3febaa"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(ChayimFriedman2): We don\u0027t handle forced keywords here yet, to be done after https://github.com/rust-lang/rust-analyzer/pull/23152."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/proc-macro-api/src/legacy_protocol/msg/flat.rs"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"a68df48dabbc73cf6a619a35fdb96bba22cdaa6e4adba52b976c0945104e0adc"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: \u0060count()\u0060 walks over the entire iterator. \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/tools/rust-analyzer/crates/proc-macro-api/src/legacy_protocol/msg/flat.rs"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"38290d1544eace9192ecc75d89f51f90237b674f1b804afb251df58b3af1b635"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: we iterate subtrees in reverse to guarantee \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/tools/rust-analyzer/crates/proc-macro-api/src/legacy_protocol/msg/flat.rs"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae04f82c0d099c88e20ba705e9ef2eb50633cb6f8ecf70a5a7c2c0a19b5ce22b"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: we iterate subtrees in reverse to guarantee \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/tools/rust-analyzer/crates/proc-macro-api/src/legacy_protocol/msg/flat.rs"},"region":{"startLine":888}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e01dfc37bc9f0303754f506dcc19b7eeb527404fdcdae0a2b2958cd20c6f66a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: The protocol does not yet encode entire spans ... \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/tools/rust-analyzer/crates/proc-macro-api/src/legacy_protocol/msg/flat.rs"},"region":{"startLine":986}}}],"partialFingerprints":{"codehealthFindingId/v1":"00c1ba19bd79bfa2ba77683ce540dba1c156de90e5e244816784e13d457e52dd"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Ideally this should be handled in fixup in a structured way, but our list \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/tools/rust-analyzer/crates/parser/src/grammar.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f09c8488009bd900940dc50642d1d02bcc40d41d6d289cbe1ac39f09503d47c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This is not correct, see https://rust-lang.zulipchat.com/#narrow/channel/185405-t-compiler.2Frust-analyzer/topic/Mismatch.20versus.20rustc.20parsing.20in.20foundation/with/632168944."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/parser/src/lexed_str.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f9454eb85927eab48da9156eb224687b26e6aedf0b5cf841f23241a8df30f54"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: rustc does something better for recovery. \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/tools/rust-analyzer/crates/parser/src/lexed_str.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"34e856adfe906daee54a99bef56bf0788239059ff32a0c559152d0aefd583ed2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: panic!? \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/tools/rust-analyzer/crates/parser/src/parser.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"47003730aae9ae2824fff3e0d75904c111dd7a73090e9088242d373001088b96"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: this should be much more fancy and 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":"src/tools/rust-analyzer/crates/parser/src/parser.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"058fa8c5edc09ff05e6d8e9ce8af454652da1b17f7af5768471cffca20238044"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This shouldn\u0027t be accepted as path actually. \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/tools/rust-analyzer/crates/parser/src/tests/prefix_entries.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3941fc6559c8cf4632193929b385c745fe5495b849ebc08989b2c9a0e468f2c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This shouldn\u0027t consume the semicolon. \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/tools/rust-analyzer/crates/parser/src/tests/prefix_entries.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbe68079f12f4c12bca73586aae0e1c4e492e03b6bdaeb56fea9aeee09c95a7d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Trees are not ideal, but like #23477 will break things like MACRO_STMTS"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/parser/src/grammar/expressions.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"979e0d2e631a52ed1f34de70fc7ee6722cc95b49fd7994c730466cef17c3823c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: not all box patterns should be 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":"src/tools/rust-analyzer/crates/parser/src/grammar/patterns.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"77f8c5f404faae99e479d32bf3ed8b740c979444a4fc3c8ffb433124c0b9eefc"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //FIXME: special case \u0060(\u0060 error message \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/tools/rust-analyzer/crates/parser/src/grammar/items/adt.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"798394e13e7ea3715f66fcc80c441e2ed3b44941a23a008d7f072194bef6a8f5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Recover on statics with generic params/where clause. \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/tools/rust-analyzer/crates/parser/src/grammar/items/consts.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"572cf35539bf09b75d856adf90213b23f5e2dbb216c0469a4f4964741073e6a4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Showing these errors could be nicer. \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/tools/rust-analyzer/crates/mbe/src/lib.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"9973da13efe91b0f87725e722e7c9c5860e334701c9bbb650eea037090d25b80"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We need to split the tree properly here, but mutating the token trees \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/tools/rust-analyzer/crates/mbe/src/lib.rs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1bf7775591775b8974098b39426b409824c87b33e1fd7bf2c2fc618df9e9421"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Add support for \u0060attr(..)\u0060 rules with attribute 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":"src/tools/rust-analyzer/crates/mbe/src/parser.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c23a4bea169c42f34315d6f294c97726c5c43988ada8e53a62a936fac055caf"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Move more of the nameres independent tests from \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/tools/rust-analyzer/crates/mbe/src/tests.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"d418c3f5c698ce5bdd6992b7ed53540cbe976af9c1f52b88a294f88427c70a9c"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: here we use \u0060meta_result\u0060 to pass \u0060TtIter\u0060 back to caller because \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/mbe/src/expander/matcher.rs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"57795f175ddbc8f3a07283d23eeaa411433063d0e7fb010fd72f6768561dc585"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: here we use \u0060meta_result\u0060 to pass \u0060TtIter\u0060 back to caller because \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/mbe/src/expander/matcher.rs"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"67744e99de7281d5aea3dff91a37b0644b20719e891e8c0de4462b61f8ffff78"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: If there are multiple items, it\u0027s definitely redundant (and it\u0027s hacky! \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/tools/rust-analyzer/crates/mbe/src/expander/matcher.rs"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"b76d8a879b4538a3651290a1cea079c0a9411999862f5dd44041ef5493a166c6"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: Macro expansion should not be done using \u0022rollback and try another alternative\u0022. \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/mbe/src/expander/matcher.rs"},"region":{"startLine":791}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f2a77914923e0353b6f5a6942a9548721f49a69a26ff4632b6e39518b4efff9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Meta and Item should get proper defaults \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/mbe/src/expander/transcriber.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"97d15c57e589fb644caf3bb5b6f7244c3f393b9fb1ca9a157a2488a7d4acac30"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: The error gets dropped if there were any previous errors. \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/tools/rust-analyzer/crates/mbe/src/expander/transcriber.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"083a29f2057056c14dc87bd865c3441cfe18caaa63b2b4d7f5f74a5d2118caab"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: to be 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":"src/tools/rust-analyzer/crates/mbe/src/expander/transcriber.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"56d3da064885fdf0b08f19f37e7f5d3db5d009405026e8fc614890bfab8b6ee4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Breaking here and proceeding to \u0060count()\u0060 isn\u0027t the most \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/tools/rust-analyzer/crates/mbe/src/expander/transcriber.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"377440594dd0969583cc16df194d886e607f8a0ebf69c28fec780a1db47c3767"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This isn\u0027t really correct wrt. escaping, but that\u0027s what rustc does and anyway \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/tools/rust-analyzer/crates/mbe/src/expander/transcriber.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"b64a3b9b4c707f701cd4e083ff4c672b1468d1dd5d544542937fbb918157fe40"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Do what rustc does for repetitions. \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/tools/rust-analyzer/crates/mbe/src/expander/transcriber.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2d6bd9247b2ea1029df124d67b07e78b4b1643205dea5b77a2e326d9d0f0360"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: NFC normalize 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/tools/rust-analyzer/crates/mbe/src/expander/transcriber.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"14ab3665488bee2b0cbee82ae7bea0580fab5021b20457a4ac33e8153916b11c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This is a bug here, we get here when we shouldn\u0027t, see https://github.com/rust-lang/rust-analyzer/issues/18910."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/mbe/src/expander/transcriber.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c60308922a89379a7e9046e27f22732586a7b884fb005edc9b3185ff8d23eb6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: implement this \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/tools/rust-analyzer/crates/load-cargo/src/lib.rs"},"region":{"startLine":740}}}],"partialFingerprints":{"codehealthFindingId/v1":"347d54a7bfde0292206ece7c20cb650545627655da7b5a15e1e3bb57aef62300"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We should ideally have a test that checks that we edit local roots and not library \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/tools/rust-analyzer/crates/ide-ssr/src/search.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"14685fd46939e1c02fc652ca46f0df54b5cc1253d7154edb21cb85dc0e7b9a5b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Properly handle use declarations. At the moment, if our search pattern is \u0060foo::bar\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/tools/rust-analyzer/crates/ide-ssr/src/search.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"df2b5273db58020bfa9aed5af7ac738e76b0a97ee34c95c00746ffe716583d5e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Take the scope of the resolved path into account. e.g. if there are any paths that 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":"src/tools/rust-analyzer/crates/ide-ssr/src/search.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"27b4e3f9ae0ec64f88d9eeb9c9e27aba2232a5a1ab41763bf5133a88f31fb993"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Whitespace is not part of the matched block \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/tools/rust-analyzer/crates/ide-ssr/src/tests.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c6dad1345baa3359adb02ce6fc12eaed591b638c04c6506b554d1fbe7005da7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Figure out why this doesn\u0027t work anymore \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/tools/rust-analyzer/crates/ide-ssr/src/tests.rs"},"region":{"startLine":884}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f5d8c114b0a26e28c1af5713038850a49b8d33fb948ab626e5da71336893326"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Rustc lints are not always warning, but the ones that are currently implemented are all warnings. \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/tools/rust-analyzer/crates/ide-diagnostics/src/lib.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"67d96aba08cf28aec3147ef1a6203e815698522035ddf1f92a112faea7d66de4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We can make this configurable, and if the user uses \u0060cargo clippy\u0060 on flycheck, we can \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/tools/rust-analyzer/crates/ide-diagnostics/src/lib.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbf096c9eab0721d80308535d41a50debec9baf2a8e33b340c4e516ec89902a6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We may want to include a whole \u0060AssistConfig\u0060 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/tools/rust-analyzer/crates/ide-diagnostics/src/lib.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fd7b8c2c8c6343365b64e81f0323b610a48ba2ae10c1f010b5d6ddb4d39c057"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This iterates the entire file which is a rather expensive operation. \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/tools/rust-analyzer/crates/ide-diagnostics/src/lib.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca52c579251cfda888f479384b96d16779bad2e84e48614f67550d0884c93a19"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Point to the correct error span here, not just the macro-call name \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/tools/rust-analyzer/crates/ide-diagnostics/src/lib.rs"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"44a9aba6dee819d69bfe64b9a649f650c8361e84f4a5cead962828e62dbe8ee1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Autogenerate this instead of enumerating by hand. \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/tools/rust-analyzer/crates/ide-diagnostics/src/lib.rs"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"22cfe303dd605509ef8d951e0f223386e5f7e5a22675cd4b5d84b5fe7e70b54e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Switch this to analysis\u0027 \u0060expand_cfg_attr\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/tools/rust-analyzer/crates/ide-diagnostics/src/lib.rs"},"region":{"startLine":792}}}],"partialFingerprints":{"codehealthFindingId/v1":"51e5361c26075e5c8360404b8ef48a3ba8b5640b3aa02e469e2fcd6623e8f9b8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We should panic on duplicates instead, but includes currently cause us to report \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/tools/rust-analyzer/crates/ide-diagnostics/src/tests.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6aab990d0332b73b7ccd925556e2260383abc53026fd7f00454dd35040de8c9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Maybe we should merge copy and clone in a single flag? \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/tools/rust-analyzer/crates/ide-diagnostics/src/tests.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"01da419fd60c4ed31a331f6535db4eb587008127e94913dd24d9231edd9654ab"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: handle macro calls. Rough plan: \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/tools/rust-analyzer/crates/ide-diagnostics/src/handlers/explicit_drop_method_use.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"f09dc81e67aa7f62d8a750fea20dfdb09e1eab221f7b4e95cef49d11968dc9ec"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: make this work in macros? Might not be worth it, as this is a niche way to trigger this \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/tools/rust-analyzer/crates/ide-diagnostics/src/handlers/explicit_drop_method_use.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"800048b48987b036451502620aaf97370c5e2c43b9a563c55182c6e6c6e6a3cc"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This shouldn\u0027t be a diagnostic \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/tools/rust-analyzer/crates/ide-diagnostics/src/handlers/inactive_code.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"bac902ec1bb615fad5df55eada2cb759a998581f9f19be9057a730681ab83bcb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This is a false-positive, the file is actually linked in via \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/tools/rust-analyzer/crates/ide-diagnostics/src/handlers/macro_error.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c4f790154d28801285dc6dc5e93d1f018b477f43f8761b57c0af5bfa6a84a02"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: The diagnostic here is duplicated for each eager expansion \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/tools/rust-analyzer/crates/ide-diagnostics/src/handlers/macro_error.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0b0dfab59e87d3677a927e332772047cf2b984a6812fed76110ed54b988924b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this also currently discards a lot of whitespace in the input... we really need a formatter 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/tools/rust-analyzer/crates/ide-diagnostics/src/handlers/missing_fields.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c6e3f5f67d9a2d2890e5feaa90406398f460d7374a9dc6fba812df3101c2526"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Ideally, should emit generic default forbidden as well \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/tools/rust-analyzer/crates/ide-diagnostics/src/handlers/missing_lifetime.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaddb619096b35c1690e7a8f27196019140349d83efe4b74b86acc6525f8c7cf"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: make facilities to test this directly like \u0060tests::check_infer(..)\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/tools/rust-analyzer/crates/ide-diagnostics/src/handlers/missing_match_arms.rs"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"b84279771017da6ceb886e63abe568c5ea203a953e7230494487579e84612e9a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: quickfix for pattern \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/tools/rust-analyzer/crates/ide-diagnostics/src/handlers/no_such_field.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f23b2b2cd162ea844438895da372c5614a69619fda4c86d2afb287498f46982"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: check submodule instead of FileId \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/tools/rust-analyzer/crates/ide-diagnostics/src/handlers/no_such_field.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"50559e8ca3b694165a89d4644396431e23edff92234aeec43019dd08da28538e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: add quickfix \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/tools/rust-analyzer/crates/ide-diagnostics/src/handlers/private_assoc_item.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc43262208040d5811e635bd9b4f7d195d81a6aad4ef80d63ac9a97b6b4bdd20"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: add quickfix \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/tools/rust-analyzer/crates/ide-diagnostics/src/handlers/unresolved_method.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcb5196701b8eebacc35d0696a3f224ab0f926d897417db995ba5f4b02268145"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Our infra can\u0027t handle allow from within macro expansions rn \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/tools/rust-analyzer/crates/ide-diagnostics/src/handlers/remove_trailing_return.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9162abff820cfd5e3ccef3a0eb82d8cd55f1cf50515ddef3d3e962d75eb9062"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Our infra can\u0027t handle allow from within macro expansions rn \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/tools/rust-analyzer/crates/ide-diagnostics/src/handlers/remove_unnecessary_else.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"87a8fe4eb3a52e58069eb3d1820f02ad29a61acb17f2e1f09258e697401a9dab"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME cannot generate generic parameter and bounds \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/tools/rust-analyzer/crates/ide-diagnostics/src/handlers/trait_impl_redundant_assoc_item.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"e28047a7b3c38b551a08fef01af0456d377106b29339c72e237db7a07c11d242"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: support inside MacroCall? \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/tools/rust-analyzer/crates/ide-diagnostics/src/handlers/type_mismatch.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"08dc90d358d231cb6a7aa8132a6c892b1348a918188687abf9e1a9f64da46ad9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: support inside MacroCall? \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/tools/rust-analyzer/crates/ide-diagnostics/src/handlers/type_mismatch.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"d74011d248cf5e3d39a0b2740e473cd2c3a384d3aaa0975d859ae5903903ab63"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME do this properly \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/tools/rust-analyzer/crates/ide-diagnostics/src/handlers/type_mismatch.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"55336530e23b3b2aea9a5c0fb8629f76529334c3b1cd7a0c58cf1bfad43b93ab"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: maybe should check if ctx is async \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/tools/rust-analyzer/crates/ide-diagnostics/src/handlers/type_mismatch.rs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"15b85d40e0ffe8deaf6ff264fff067241629f7502b435a8eeeeaaa705e8c2290"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this should suggest making the reference mutable instead: \u0060\u0026Foo -\u003E \u0026mut Foo\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/tools/rust-analyzer/crates/ide-diagnostics/src/handlers/type_mismatch.rs"},"region":{"startLine":818}}}],"partialFingerprints":{"codehealthFindingId/v1":"fed436f4ff92786156bc52a62b43ea162abc0a0e845454ff33b9dc3b8b5908cb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: add some 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/tools/rust-analyzer/crates/ide-diagnostics/src/handlers/type_mismatch.rs"},"region":{"startLine":1015}}}],"partialFingerprints":{"codehealthFindingId/v1":"f504512319ef87b53c5ca55f8fe77ea728368f6bf3f36c07c3e51404a53e878d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // Do some adjustments to the node: FIXME: We should probably do that at the emitting site. \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/tools/rust-analyzer/crates/ide-diagnostics/src/handlers/type_must_be_known.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dbd1333cbbe7836d9fed090010cab420dec5d2bb8e1a3bab4915495244d5c78"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This should trigger an assist because \u0060main\u0060 matches via *coercion* \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/tools/rust-analyzer/crates/ide-diagnostics/src/handlers/typed_hole.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9ae800fde5b28897c2eba5dbd262f46345048d7eac3432b921723fd9f825e15"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This should trigger 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/tools/rust-analyzer/crates/ide-diagnostics/src/handlers/typed_hole.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"55c87e31ae1bb643d6091ab33f70e023e46b7020818acfc1295c90e37c0c6096"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This is a hack for the vscode extension to notice whether there is an autofix or not before having to resolve diagnostics. \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/tools/rust-analyzer/crates/ide-diagnostics/src/handlers/unlinked_file.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"77131167a86344890d3dd03f4e2eea0632f28bd81e2b48580608dfdc5663f691"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This shouldnt need to access the crate def map directly \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-diagnostics/src/handlers/unlinked_file.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf801593a2181c816349e2383133cbaf43e0d0193ee645992525560059287b2e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Add Snippet 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":"src/tools/rust-analyzer/crates/ide-diagnostics/src/handlers/unresolved_field.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4cb4fad561d3aa80d7f49c5a053dc241ce9fa2abcafd2a4339d1cce9a0c77da"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Allow for choosing a visibility modifier see https://github.com/rust-lang/rust-analyzer/issues/11563"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-diagnostics/src/handlers/unresolved_field.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8cc275fcaba2f8dc39bdb788794508311e26ff9356d06ce7706d04cc5e447cb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Allow for choosing a visibility modifier see https://github.com/rust-lang/rust-analyzer/issues/11563"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-diagnostics/src/handlers/unresolved_field.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9eb71831fcb6270e6736930017347099dbe8f7fc6627634a0dfdae5ea0a8335"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Add support for Tuple Structs. Tuple Structs are not sent to this diagnostic \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/tools/rust-analyzer/crates/ide-diagnostics/src/handlers/unresolved_field.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5a1a20c78785cc58e867152291c0adcc5c545bd87d9a95d49b071546a450d9a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We should fill out the call here, move the cursor and trigger signature help \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/tools/rust-analyzer/crates/ide-diagnostics/src/handlers/unresolved_field.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"548e701740443a8b45b364be18473c861056da88104cff1c0e506210947ae8f0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: it fails when type of \u0060b\u0060 is \u0060Box\u0060 with other generic param different from \u0060receiver\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/tools/rust-analyzer/crates/ide-diagnostics/src/handlers/unresolved_method.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"489e04790accda9180e11e1eaf7ef23fc0e7b2abcb376309b4df4d36681c7c69"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We don\u0027t record the resolutions for this anywhere atm \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/tools/rust-analyzer/crates/ide-db/src/active_parameter.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"d45e3851b819183d5a6b521c17e2d5251d52b94a53ff5ede1307b0c48b41535e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this badly needs rename/rewrite (matklad, 2020-02-06). \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/tools/rust-analyzer/crates/ide-db/src/defs.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e6cc223b508e3355392a99119f936a557ef7c7160779d0de09ee73188b17747"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: a more precise name would probably be \u0060Symbol\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/tools/rust-analyzer/crates/ide-db/src/defs.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"23f4897385d79383068d0747257c264b773b93e81b11b538e076d10618d1998f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: IdentClass as a name no longer fits \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/tools/rust-analyzer/crates/ide-db/src/defs.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"0025d7ba69cc613a280a8ca605e989d95a643d0c1d028d48e9bd41c49bef487f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This is a weird 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":"src/tools/rust-analyzer/crates/ide-db/src/helpers.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"892f1246906d8d988d0bf1d48bf71d1ce863a480df6871806cd241e2d9586413"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This is a weird 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":"src/tools/rust-analyzer/crates/ide/src/static_index.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"b884fdca76883c51e8c1c349fb2840d09a8212d3af8ca1a040c0748d13eadef8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Do callbacks instead to avoid allocations. \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/tools/rust-analyzer/crates/ide-db/src/items_locator.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"a85f22a324959defb554442621ca4eeee47b72b3c6896ae9918c590b5352bda3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Revisit this commit now that we migrated to the new salsa, given we store arcs in this \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/tools/rust-analyzer/crates/ide-db/src/lib.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aaa01761442e4ecf848dca7170df77a621665ed4cbfdb9eb648deaa16625221"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(salsa-transition): bring this back; allow changing LRU settings at runtime. \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/tools/rust-analyzer/crates/ide-db/src/lib.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"3992c133509a4358e96e9617ac2df76567c06377cc76b42b931aeab85a9d2d5a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: expressions in curly brackets can cause ambiguity after insertion \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/tools/rust-analyzer/crates/ide-db/src/path_transform.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"db8ef16dd9a7d49abfc8dc0d8d9006b74cfbf9058361ebba5f11835477e4a954"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: It would probably be nicer if we could get this via HIR (i.e. get 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/tools/rust-analyzer/crates/ide-db/src/path_transform.rs"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"48584f66c2a20b0500df11b07d7ad481387787e4fba2545cc9b5ce8d909af204"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We should do it unconditionally if the configuration is set to default 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/tools/rust-analyzer/crates/ide-db/src/prime_caches.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8c5148ac506280b85fe09ecc0fc459090257bf2df63fbb14291a54c674a67be"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This should be doable in theory \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/tools/rust-analyzer/crates/ide-db/src/rename.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e45a2aa071c2be6e237bb040fb9d123684bda5cfaf109defb23c932437ed0e0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We could maybe skip ifs 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/tools/rust-analyzer/crates/ide-db/src/rename.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"d15f2fe4b0c632ef6cbf82d1d8019d0bb914c9fd0ef543ddf97b9a259bcf577b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: instead of splitting the shorthand, recursively trigger a rename of 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/tools/rust-analyzer/crates/ide-db/src/rename.rs"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3fd4403ad5942f25736e6340ad8386bdae0c2a3465c0c5f741d0faa7e260ff6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Add this variant and delete the \u0060retain_adt_literal_usages\u0060 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":"src/tools/rust-analyzer/crates/ide-db/src/search.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"42a0597e96d2be3798abf6f6e3b41be718b0c9d0e101097dd1e55b539f4f452f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This is just a temporary fix for not handling import aliases like \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/tools/rust-analyzer/crates/ide-db/src/search.rs"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"496386ac265c6242df57d74cc7a330bdff8ba31c491293023e6cb32aeaf488d5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Extend this to other cases, such as associated types/consts/enum variants (note those can be \u0060use\u0060d). \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/tools/rust-analyzer/crates/ide-db/src/search.rs"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c22aa4e6428f021e8f4cc5bc2e8ef610fd09e3aa85add81b7f52e5caac2f3f2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: \u0060use\u0060s have no easy way to determine their search scope, but they are rare. \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/tools/rust-analyzer/crates/ide-db/src/search.rs"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"e57014fa5cb4f4ab2c78dd738cdccb4cc0b204bd81b78c86dddc92bb77ce1ea7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Maybe this needs to be relative to the project size, or at least to the initial search scope? \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/tools/rust-analyzer/crates/ide-db/src/search.rs"},"region":{"startLine":816}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4e3d2edcec52b7012b2a73a23b1f5ee281ec2c865822bf799432d401d434cbd"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: If Rust ever gains the ability to \u0060use Struct::method\u0060 we\u0027ll also need to account for free \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/tools/rust-analyzer/crates/ide-db/src/search.rs"},"region":{"startLine":887}}}],"partialFingerprints":{"codehealthFindingId/v1":"333e64c5f8f15476488e4db7f9038115877fa7eabb7339fb29181e9d25b1e245"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Is the trait scope needed for trait impl assoc items? \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/tools/rust-analyzer/crates/ide-db/src/search.rs"},"region":{"startLine":934}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e21385ba7dfde4adf871a1f4e096f27e12f66cc928dbed4ee0be1b7b13236f1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This assumes the crate name is always equal to its display name when 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/tools/rust-analyzer/crates/ide-db/src/search.rs"},"region":{"startLine":956}}}],"partialFingerprints":{"codehealthFindingId/v1":"4de20faf509b0e40777ffd0bb8c7c564c70c5aef3e02ad5cdcde261d34cf8b53"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This should probably depend on the number of the results (specifically, the number of false results). \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/tools/rust-analyzer/crates/ide-db/src/search.rs"},"region":{"startLine":987}}}],"partialFingerprints":{"codehealthFindingId/v1":"90785759b53954c84b555960d22d8996a4a27bff356fb081b06dbf99fd248855"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: special case type aliases, we can\u0027t filter between impl and trait defs here as we lack the substitutions \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/tools/rust-analyzer/crates/ide-db/src/search.rs"},"region":{"startLine":1255}}}],"partialFingerprints":{"codehealthFindingId/v1":"9562d1bd7e9d641ffcd3e2e56c4381e33d998da1215910291547ce4786a53966"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: mutable patterns should have \u0060Write\u0060 access \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/tools/rust-analyzer/crates/ide-db/src/search.rs"},"region":{"startLine":1334}}}],"partialFingerprints":{"codehealthFindingId/v1":"49c4f1cdb3e5f49961079cd14843f5b27360c0c0b2a0e905a4f6d90f07182784"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: only until we can resolve them correctly, see FIXME above \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/tools/rust-analyzer/crates/ide-db/src/search.rs"},"region":{"startLine":1351}}}],"partialFingerprints":{"codehealthFindingId/v1":"86f9b0ff161c5090892d7245848757bf8c5d8f297b16ac8ffc8366c9223668be"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // (covers fields and locals). FIXME: This is not terribly accurate. \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/tools/rust-analyzer/crates/ide-db/src/search.rs"},"region":{"startLine":1416}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1ad011cbd27df6c445f644c7a8c94bd5b8a831721b46e3569ef09895b065d21"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This can probably be re-implemented via the HIR? \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/tools/rust-analyzer/crates/ide-db/src/syntax_helpers/format_string.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"b72ddad29fa242a962b359b66e5bbee3b34004b8fad8ee9b25310eaec0af1a08"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Remove this, we can use rustc_format_parse 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":"src/tools/rust-analyzer/crates/ide-db/src/syntax_helpers/format_string.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"e72a90a25060e3b02563b9b80b9386159ead0ea5cfc48c33c16d67ca1adcb65e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME Remove this, we have this information in the HIR now \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/tools/rust-analyzer/crates/ide-db/src/syntax_helpers/format_string_exprs.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b3a76cb9698f3ac9dcdd15cee0df7f32f41a088b89fb2dafa095b8f573c7d28"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Make the control flow more proper \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/tools/rust-analyzer/crates/ide-db/src/syntax_helpers/node_ext.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbd125d4e3bc6f6872ecb030832484899ef8deb7ff961639a9a5197beb6151a2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this is horribly inefficient. I bet there\u0027s a cool algorithm to diff trees properly. \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/tools/rust-analyzer/crates/ide-db/src/syntax_helpers/tree_diff.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"af5accea84423e9dee51d7bd8732b94f4035dee3002da4b14483baab4ccee3f9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Distinguish between attr and derive macros. \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/tools/rust-analyzer/crates/ide-db/src/imports/import_assets.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3e6e6b6350a56068c044f4fbd7d02133a060941965d82a7239ec5379a54e4d9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// (the structure is not entirely correct, since there can be situations requiring two imports, see FIXME below for the details) \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/tools/rust-analyzer/crates/ide-db/src/imports/import_assets.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d5040b215994da3e6d67e08907930983407b9119bd83c551fd4b48a1d725d12"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: we could look up assoc items by the input and propose those in completion, \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/tools/rust-analyzer/crates/ide-db/src/imports/import_assets.rs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dba0adc5336ca0f4c68ceffdfa42a0a6abd984155c2d26fcd3682c13e5504b5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This doesn\u0027t handle visibility \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/tools/rust-analyzer/crates/ide-db/src/imports/import_assets.rs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"545b3150c62ba9e795e67cf5b735d9033876d010b68bdb150c79a0344cc85b16"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This doesn\u0027t consider visibilities. \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/tools/rust-analyzer/crates/ide-db/src/imports/import_assets.rs"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1d12829563fe0421db6ed4dcd1d38d1c316cde0a8200b0b8c1c4b4e1dc3cc45"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: A trait can have an assoc type that has a function/const, that\u0027s two segments before last. \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/tools/rust-analyzer/crates/ide-db/src/imports/import_assets.rs"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d9706919cbb6448067b906c5c21fdcf758c9b62f43879535fa3921cc296bf55"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Support extra trait imports \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/tools/rust-analyzer/crates/ide-db/src/imports/import_assets.rs"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"c96391f0b415e6f405daac88302587ecc30582c3b65cff00a3c23ee43df6a12a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // or FIXME: annotate inserted imports with the same cfg \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/tools/rust-analyzer/crates/ide-db/src/imports/insert_use.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"762b81c44757a42d42c91c2454f822aca49f7b8c8f06232b77eb65273e72a70c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Maybe it is possible to infer based on semantic analysis? \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/tools/rust-analyzer/crates/ide-db/src/imports/insert_use.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1e1470dc177030ceaab7d8b756908069a71f1b07f57af514f1573a9bbad4c4a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This is suboptimal, we want to get \u0060use std::fmt::{self, Result}\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/tools/rust-analyzer/crates/ide-db/src/imports/insert_use/tests.rs"},"region":{"startLine":925}}}],"partialFingerprints":{"codehealthFindingId/v1":"efccafe1f14affe0dc6a5e1f6c595ddd420e9ad878dcac1dfefb2668d6cad515"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Add try_tok and default_tok \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/tools/rust-analyzer/crates/ide-completion/src/context.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cb1b3552cd662b2113b1f8d59978d78ed07ced27e4df92a5c98952da0b3385b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This should probably be the crate of the current token? \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/tools/rust-analyzer/crates/ide-completion/src/context.rs"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfc98e5b52a2a6df54925e5e6fc63b133964a551c25a754bf6b6d66a98eab6ed"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This should be part of \u0060CompletionAnalysis\u0060 / \u0060expand_and_analyze\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/tools/rust-analyzer/crates/ide-completion/src/context.rs"},"region":{"startLine":930}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c90e4143518b9eb4545c013a3a093c6b60ce836c26b769b674d63d6b050ed05"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Find a way to keep this up to date 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":"src/tools/rust-analyzer/crates/ide-completion/src/context.rs"},"region":{"startLine":1020}}}],"partialFingerprints":{"codehealthFindingId/v1":"9002c647b6679835ee0f52d08913729bc7c5dbee8e6cf4360d0c685b1b7f2dcb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Make this with \u0060\u0027db\u0060 lifetime. \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/tools/rust-analyzer/crates/ide-completion/src/item.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"d31717b732313deaec285f7c9aa4ba95f4a37b06fe747e97bac4550b111ee115"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Make this with \u0060\u0027db\u0060 lifetime. \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/tools/rust-analyzer/crates/ide-completion/src/item.rs"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"81001be4346df0b6cacb5734c25b5836e5ab6283a49e8eb46312ddf8c8258024"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We shouldn\u0027t expose Mutability here (that is HIR types at all), its fine for now though \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/tools/rust-analyzer/crates/ide-completion/src/item.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff6ee7f32db6c904947d36ede37c8025ff2a4f0af45c4dc489f7d47d345ade85"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //FIXME: split the following feature into fine-grained 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":"src/tools/rust-analyzer/crates/ide-completion/src/lib.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a8083ecc0476e8ea0325a1bf0832180e62dda82875692b6436c0d49042097c1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: remove this \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/tools/rust-analyzer/crates/ide-completion/src/render.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0212242e06329733210a102696012eb5fa66954cde0eeda400c9fd83df9d0ce"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Temporary workaround for handling aliased import. \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/tools/rust-analyzer/crates/ide-completion/src/render.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"31ae804d60f2315d2c40391eb5e9a9f613cb4ad654207fd0675eb50d16b08eb3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This checks types without possible coercions which some completions might want to do \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/tools/rust-analyzer/crates/ide-completion/src/render.rs"},"region":{"startLine":673}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d3b6d27eca77371f78eab4c309bb9adea056c61ddc76ba71885a87cf6e823ad"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This might create inconsistent completions where we show a ref match in macro inputs \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/tools/rust-analyzer/crates/ide-completion/src/render.rs"},"region":{"startLine":788}}}],"partialFingerprints":{"codehealthFindingId/v1":"58349d50b8c7b6018b5d7a48db498290c33a8c2bafe2460241e801de11d549be"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: It is best to test \u0060S.in\u0060 if speculative execution 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":"src/tools/rust-analyzer/crates/ide-completion/src/render.rs"},"region":{"startLine":3126}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f3c1b8357066821596f978ce18b9cfc0610f59645a882679d1c55c2ad0e1b8f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: There are many \u0060S\u0060 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/tools/rust-analyzer/crates/ide-completion/src/render.rs"},"region":{"startLine":3524}}}],"partialFingerprints":{"codehealthFindingId/v1":"29d1014e493251614f75cb9c03150c867dfafb6dc83dc86740828f27933fbe7e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME baz() should be an exact type match \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/tools/rust-analyzer/crates/ide-completion/src/render.rs"},"region":{"startLine":4457}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aa41446a9817edd1a3e74a9a4636042e4040f2c99fa7c046c91acb22cd801d2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: support else completion after ast::RecordExprField \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/tools/rust-analyzer/crates/ide-completion/src/tests/expression.rs"},"region":{"startLine":2306}}}],"partialFingerprints":{"codehealthFindingId/v1":"adfde6db95d04b931869117ff3090e48ada1392d6f13863fa320af180141dcb3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This does not work, we need to change the 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/tools/rust-analyzer/crates/ide-completion/src/tests/flyimport.rs"},"region":{"startLine":1878}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe7907c2e7b82385b2f2ac6a70533e1a05064c96fde2dbf70dbc5a80521ac1f1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This shouldn\u0027t be completed 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/tools/rust-analyzer/crates/ide-completion/src/tests/item.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"260e588c2dc1acbff0ce805fd550693e816df42393702e442678fcca2b1c2b5a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: \u0060for\u0060 kw \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/tools/rust-analyzer/crates/ide-completion/src/tests/predicate.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c2d0045301996187c84981292ffc6af8238f44c1ea33330f27b7a2821a4b317"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: should only show lifetimes here, that is we shouldn\u0027t get any completions here when not typing \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/tools/rust-analyzer/crates/ide-completion/src/tests/predicate.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ad4f36cc6e36fa98bdc6136d211159e355cebfc259169e04ea3f20b51813b13"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This should filter out all completions that do not have the type \u0060Foo\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/tools/rust-analyzer/crates/ide-completion/src/tests/record.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cbb64c4e40069d655a60e35eefc9ea1f6104167748264d0c2d6386e529a32fc"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This should probably also suggest completions for types, at least those that have \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/tools/rust-analyzer/crates/ide-completion/src/tests/type_pos.rs"},"region":{"startLine":1186}}}],"partialFingerprints":{"codehealthFindingId/v1":"9db76c556a0bd35b754d08e60a2f291a92f71772991228d082239d5a52b4cf2e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Support speculative expansion with \u0060cfg_attr\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/tools/rust-analyzer/crates/ide-completion/src/context/analysis.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"4355044bf5255f0bde2125e615b4d1f1989a040efad2221287fee57eb8c48972"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This check can be removed once we use speculative database forking for completions \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/tools/rust-analyzer/crates/ide-completion/src/context/analysis.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e219d1394c01efa73d1e5fa4197f52ee30302a302e2ed82747c5451bc0e2a5a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Heuristic hack for PathExpr in ArgList \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/tools/rust-analyzer/crates/ide-completion/src/context/analysis.rs"},"region":{"startLine":883}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fbeb60b722bdc86126f46940ac8353fecc0ccc63ac8daafa22521186f0478d7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This operates on the syntax tree and will produce incorrect results 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":"src/tools/rust-analyzer/crates/ide-completion/src/context/analysis.rs"},"region":{"startLine":1252}}}],"partialFingerprints":{"codehealthFindingId/v1":"46a35cf44baf63676740f8d86ca48380484588bb4cc302821016504247d4c06b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME make this work, currently fails due to pattern recovery eating the \u0060:\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/tools/rust-analyzer/crates/ide-completion/src/context/tests.rs"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a23f5520ccb0ee00318507a3f2e8c414c5f9edd6d34b3d5bee0571a9ddf0c22"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: For parity with Rust bug #22519, this does not complete Ty::AssocType."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-completion/src/completions/expr.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d5d0a1a54d1735a6f3bd037ff0152a4c28d6ec6e651aca478f520272cc8795f"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: For parity with Rust bug #22519, this does not complete Ty::AssocType."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-completion/src/completions/type.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"58b1afdfa778fb5132ff4f08ebfa58d47dbaef902e4cd0d091587c15d683d508"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Render the assoc item with the trait qualified \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/tools/rust-analyzer/crates/ide-completion/src/completions/expr.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"53b59626535373a22b08e4684d573a902d88050e37cba9d160477828964ef9b0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Append \u0060::\u0060 to the thing here, since a trait on its own won\u0027t 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/tools/rust-analyzer/crates/ide-completion/src/completions/expr.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd4f5a9fc1258a3aea936eea0859f8a027fa4567db8b5bcf97b4f2b591522b60"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Make this a submodule of [\u0060pattern\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/tools/rust-analyzer/crates/ide-completion/src/completions/fn_param.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"62fe4d7f2f3605a0f87b6a3b096c48c242087857a8792c72973f9d8f2e1b5916"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: \u0060#[attr] it: i32\u0060 -\u003E \u0060#[attr] mut it: i32\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/tools/rust-analyzer/crates/ide-completion/src/completions/fn_param.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"64a4a6a09605faba24ffc8c3a50e60fe728b4dba0b95f327d78876cc34299714"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME binary modules are not supported in tests properly \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/tools/rust-analyzer/crates/ide-completion/src/completions/mod_.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebccd3ce947997ff03e90f4e7344ce6046e908a11d41e4505211548b15ae0de6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: ideally, we should look at the type we are matching against 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":"src/tools/rust-analyzer/crates/ide-completion/src/completions/pattern.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a81f16637a98a58f6f1b28ded4185d0049932393795026a16048a4644c71dde"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: we should check what kind of pattern we are in and filter accordingly \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/tools/rust-analyzer/crates/ide-completion/src/completions/pattern.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"d141425731e9d3b74ef06b7d8340f47f8fb9d26a7e4bbfc641ee6fd77a671857"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // fixme \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/tools/rust-analyzer/crates/ide-completion/src/completions/postfix.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef688310d60bea412b27c3b6cc9b4992682fd72fb2590ead00d36dd5667acd79"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Why add parentheses \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/tools/rust-analyzer/crates/ide-completion/src/completions/postfix.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b173521ee702d926893515f05ce3bcf10107604f313806f2870405d7b76c59c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This should make use of scope_def like completions so we get all the other goodies \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/tools/rust-analyzer/crates/ide-completion/src/completions/record.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c57e50ed4f4ee1beb5ec1ec5a9bebf58bbc7eaa091cde43f371a86960cdefb8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Paths in nested macros are not handled well. See \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/tools/rust-analyzer/crates/ide-completion/src/completions/item_list/trait_impl.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dda051e17bb1d284b4d942406a96e60fa400fa183ddc54afd1817e6c746d213"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Paths in nested macros are not handled well. See \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/tools/rust-analyzer/crates/ide-completion/src/completions/item_list/trait_impl.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc1d3707dc4b2a913902e4ada280b8b22cdb5b26da9ea7b4dc1b31c7d8e330aa"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Paths in nested macros are not handled well. See \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/tools/rust-analyzer/crates/ide-assists/src/utils.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"9789a24e967dd2840dc8f5332648e5d2e35b002e700a1655cae2bb9bd27dc2ac"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: \u0060T\u0060 in \u0060ty!(T)\u0060 should be replaced by \u0060PathTransform\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/tools/rust-analyzer/crates/ide-completion/src/completions/item_list/trait_impl.rs"},"region":{"startLine":1483}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e9cf1b68ba565aaa5078a8fbaaf1553856427f07ee7c72db1a51b18a76dc928"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: \u0060T\u0060 in \u0060ty!(T)\u0060 should be replaced by \u0060PathTransform\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/tools/rust-analyzer/crates/ide-assists/src/handlers/add_missing_impl_members.rs"},"region":{"startLine":2130}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ecbad9aabbda85ec61a4b2bdb1d53f8429872f109c7cb5a04067519de4f0375"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Move this into context/analysis.rs \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/tools/rust-analyzer/crates/ide-completion/src/completions/attribute/cfg.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"78d03dd099df752012543d07c5b092724f8a73b2811e6c908be353363984fab5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: change \u0060Lint\u0060\u0027s label to not store a path in it but split the prefix off 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":"src/tools/rust-analyzer/crates/ide-completion/src/completions/attribute/lint.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d58d558ab67b6a68290b1608e68c287cf6cc17ae9263a2aa34cc2bdf9b65dc1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: instead of having a separate function here, maybe use \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/tools/rust-analyzer/crates/ide-assists/src/tests.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bd9031f87718892fd397d297662a13630ae2d3664d33e3e663b53eb01391ec7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: change the new fn checking to a more semantic approach when that\u0027s more \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/tools/rust-analyzer/crates/ide-assists/src/utils.rs"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"feb6b1ea8816376755af6b8f7ba7e7308f2950ca4bd605f22df1fe27d02a6224"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this partially overlaps with \u0060find_impl_block_*\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/tools/rust-analyzer/crates/ide-assists/src/utils.rs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d8f1191926027723143f7c4b7f52be08f72d14c7b74e1d20a1ef6c95d9b36f5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: handle e.g. \u0060struct S\u003CT\u003E; impl\u003CU\u003E S\u003CU\u003E {}\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/tools/rust-analyzer/crates/ide-assists/src/utils.rs"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e22854073d90a40a02c472fad08bdbcf8570c7510060a92c286586746ea1945"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: It should return a new hir::Type, but currently constructing new types is too cumbersome \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/tools/rust-analyzer/crates/ide-assists/src/utils.rs"},"region":{"startLine":856}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc09399554f6f3e2f03ca02785fdbf23693af95bd2831a1059cddf7c8bc070a7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: #20460 When hir-ty can analyze the \u0060never\u0060 statement at the end of block, remove it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/utils.rs"},"region":{"startLine":1218}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fa3866ec55463ff4e6a8919ab0351c382b5d0a032e2e53482f7d68b8cc97b46"}},{"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/tools/rust-analyzer/crates/ide-assists/src/handlers/add_missing_impl_members.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"547e5d9028e22fdef7efb1e0d833d8f1e6b9875958fd9f7e63bce82c434605a4"}},{"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/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_blanket_trait_impl.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8a1e1967db88abdbef71d549cc9388386c8613134b187c2f547bf54e954542e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Hack for syntax trees not having great support for macros \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/tools/rust-analyzer/crates/ide-assists/src/handlers/add_missing_match_arms.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cb5d527cc694ace314087eb9e3ea9110a3b22e31d63b781d32dd6078db6335c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // Fixme: this is still somewhat limited, use hir_ty::diagnostics::match_check? \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/tools/rust-analyzer/crates/ide-assists/src/handlers/add_missing_match_arms.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"afff53b3eacd94665cc1bce660cda24e1ba7996dec5d59dca35e73bc5a994fb3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // Fixme: cannot handle deep patterns \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/tools/rust-analyzer/crates/ide-assists/src/handlers/add_missing_match_arms.rs"},"region":{"startLine":1454}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf5767aac15910d19846d3c564cc74458c203309ed164d4c4e142e133cde99a0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Preserving comments is quite hard in the current transitional syntax editing 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":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/add_missing_match_arms.rs"},"region":{"startLine":1675}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6c9a3f6ca6bf030e9a2f5176749b703f295ac30f60b7edaf842e22be0c7bece"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Preserving comments is quite hard in the current transitional syntax editing 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":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/add_missing_match_arms.rs"},"region":{"startLine":1706}}}],"partialFingerprints":{"codehealthFindingId/v1":"d876eb7405f6cbdb1da213d7ea89be0216698f5a6c60815bbfc499bc409fe95a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Expand this \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/tools/rust-analyzer/crates/ide-assists/src/handlers/auto_import.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"43360d69f88ec0fd32f33ef27676f52c8ebf22fcad91aa12d55d8123ea6cd1a6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Expand this \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/tools/rust-analyzer/crates/ide-assists/src/handlers/auto_import.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"945716b0f58a1fccc30df9e433dbb26f1dda7adb5503b2886c9c3f0e83848fab"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME wrong import \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/tools/rust-analyzer/crates/ide-assists/src/handlers/auto_import.rs"},"region":{"startLine":1699}}}],"partialFingerprints":{"codehealthFindingId/v1":"f786a1c08d63048d9926625d4d0aa7193db6304228e8fcba1fdaa75514eb6068"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME wrong import \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/tools/rust-analyzer/crates/ide-assists/src/handlers/auto_import.rs"},"region":{"startLine":1725}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1ea3e6963af6e06a43227f5f891fbbc82cb422e711071a2243440e555e9f768"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME applies to match as well \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/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_bool_then.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"757719d9afef1acac58f7d72b75895bb27e4e3e34b1725681c20c3e5cce28e1d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: The import is missing \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/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_bool_to_enum.rs"},"region":{"startLine":1110}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f7e8e7d6faad7a9d375756497461f225231c2faa48ae1274977b3672d0d3e2a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Allow configuring the replacement of \u0060self\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/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_closure_to_fn.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"e61221719178ddefca601e282771636502e034780b8d97ae88063c2f9c8c47b8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Maybe we can indent this properly, adding newlines and all, but this is hard. \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/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_closure_to_fn.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc67824157784f1bb3aef7f0640d595008487691b3fcb221e0e05f29834039ad"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Place the cursor at \u0060fun_name\u0060, like rename does. \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/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_closure_to_fn.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f910f90e3794e744f3d8d79936b0afdbc4cdc30686318ca7d25156343783b48"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Consider generic parameters that do not appear in params/return type/captures 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/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_closure_to_fn.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"37a720d1f651316297c58ae6360f9c1d98db4dc2d8797397d5b2afe85dcbfcb0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This text manipulation seems risky. \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/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_closure_to_fn.rs"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"f17a4c0f0fdd093c0cca9a6a4363dec4ee6196a287c75ae53cbcd6d4fd2e1ad5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this should be a diagnostic \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/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_into_to_from.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"51b862e877b2d9373abf9a61f119f5f376fd4ae9950acf3b2e1bb4c0676b2763"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Do this with \u0060SyntaxEditor\u0060 in \u0060rename_variable()\u0060, it\u0027s just difficult right now \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/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_match_to_let_else.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"824f0ec7999b08ec203138979da7f337181b8307c734c363b0efd250f2c97559"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: We don\u0027t currently provide this assist for struct definitions inside macros, but if we \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/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_named_struct_to_tuple_struct.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fb597ecda5230888fce93b0d8c087a1f9a15fd2491a4d6601a85d62bdcb89b2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Processing RecordPat and RecordExpr for unordered fields, and insert RestPat \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/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_named_struct_to_tuple_struct.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"205897c1abc32d26b6a070cf95dc2c1152f912069a24215718fc7b3e986893f3"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: SyntaxEditor cannot insert after deleted element \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/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_tuple_struct_to_named_struct.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"f823d24d2c7efaf6d0c6064427a043f6451be06333a094dfd355e1799ab5634f"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: SyntaxEditor cannot insert after deleted element \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/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_tuple_struct_to_named_struct.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0aa76c09023123c24c9829240870cf47cd6fb52b6d2cd840ea1ba311636475a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: After removing ted, it may be possible to reuse destructure_struct_binding::Target \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/tools/rust-analyzer/crates/ide-assists/src/handlers/destructure_tuple_binding.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"75cb494af6407c39471ca156d546f19f95671d16c02cb88b63511da679d751a2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: macro allows no arg -\u003E is valid. But assist should result in invalid 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/tools/rust-analyzer/crates/ide-assists/src/handlers/destructure_tuple_binding.rs"},"region":{"startLine":1609}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed4c17210f310e0997c92aed9338677b8835b1762751d791726c8f4ffef44e71"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: doesn\u0027t need deref * parens. But \u0060ctx.sema.resolve_method_call\u0060 doesn\u0027t resolve trait implementations \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/tools/rust-analyzer/crates/ide-assists/src/handlers/destructure_tuple_binding.rs"},"region":{"startLine":1941}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ca2521fbcddcaf12ca68c342bee95dab57be5063c47083697f1d9aee70ea3a6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: wrap non-adt 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/tools/rust-analyzer/crates/ide-assists/src/handlers/extract_function.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"9094e65c659c3acb3d340db1f4b8299db894a978585181303f69873066d333a0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: ControlFlow and ContainerInfo both track some function modifiers, feels like these two should \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/tools/rust-analyzer/crates/ide-assists/src/handlers/extract_function.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eb264bbace488bcbc60478a9ee46b52f50dd79538cbabf553aa68db3a08fcf7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: use lang items to determine if it is std type or user defined \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/tools/rust-analyzer/crates/ide-assists/src/handlers/extract_function.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"8142c564adb1cfdfb5496fd386ca7145105c2d54385dcfc0f91c8adfcc3dc00d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: make trait 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":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/extract_function.rs"},"region":{"startLine":936}}}],"partialFingerprints":{"codehealthFindingId/v1":"6be2c9817d67acc1912e720d2c72e5b92de8509458811d0ee24f8016e3a0cbb2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Do unsafe analysis on expression, sem highlighting knows this so we should be able \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/tools/rust-analyzer/crates/ide-assists/src/handlers/extract_function.rs"},"region":{"startLine":1030}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fc9fc02056e0520b1e5d311feb76b1742e17fc61eda5001bb51d2577b0059d3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this quite an incorrect way to go about doing this :-) \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/tools/rust-analyzer/crates/ide-assists/src/handlers/extract_function.rs"},"region":{"startLine":1180}}}],"partialFingerprints":{"codehealthFindingId/v1":"afba8026c6b6f5681202d28848209b2b85097bb1743a55a0a4d1e5062f20da2e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this doesn\u0027t work well with macros \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/tools/rust-analyzer/crates/ide-assists/src/handlers/extract_function.rs"},"region":{"startLine":1261}}}],"partialFingerprints":{"codehealthFindingId/v1":"8479568290b0ce438aa28ddd804ef5693e151446a28fcc6a9216c804d2ea036e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We should emit a \u0060\u003CT: Debug\u003E\u0060 generic argument for the generated 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":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/extract_function.rs"},"region":{"startLine":5881}}}],"partialFingerprints":{"codehealthFindingId/v1":"03d8b143c11bc27ca2568b8565019e6e58c0c69915af754f4d6eaa5b2e03f30f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: double semicolon \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/tools/rust-analyzer/crates/ide-assists/src/handlers/extract_function.rs"},"region":{"startLine":6200}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ddebcfc46a1a5fe50e7ae01ba643084c00a6f76a13769c8961c36ba9ea1153b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: replace with a \u0060ast::make\u0060 constructor \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/tools/rust-analyzer/crates/ide-assists/src/handlers/extract_struct_from_enum_variant.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"8692addf137ed1b5b7c55642d8774d053c786e1b768f69ea0e7ef3866d9a9979"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This is not quite correct, but good enough(tm) for the sorting heuristic \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/tools/rust-analyzer/crates/ide-assists/src/handlers/extract_variable.rs"},"region":{"startLine":2079}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a22638a2190f7220ac686b405cd0802f445c4dd04da8d6482e02419ad802d2d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Extract to inside the macro instead of outside the macro \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/tools/rust-analyzer/crates/ide-assists/src/handlers/extract_variable.rs"},"region":{"startLine":3079}}}],"partialFingerprints":{"codehealthFindingId/v1":"977452060f4b1537626fd617302d450b51c4445bd912b741c164b500ebc8d5b8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: broken test, this should fix visibility of the re-export \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/tools/rust-analyzer/crates/ide-assists/src/handlers/fix_visibility.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac1b2784b1227922cbf8c7c7decf52ddfa95ec102fc6cce0aeea694e4d8b6159"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME :  We can omit already implemented impl_traits \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/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_delegate_trait.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1d3569f8d777753d212bcfd42f802f24ada917f4ace1c9e63e4a3c5d1dd87a4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME : Handle MacroCall case. \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/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_delegate_trait.rs"},"region":{"startLine":737}}}],"partialFingerprints":{"codehealthFindingId/v1":"7caad817c1aca8f17bef05bdaa594c517cfea081fe4861e6a2c5930ee882aef5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME : We can\u0027t rely on \u0060make::path_qualified\u0060 for now but it would be nice to replace the following with 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/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_delegate_trait.rs"},"region":{"startLine":753}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e47c20bf158ec1ad0c44d9cd8bf97578fb07115c544d55b187c99e19820c802"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(next-solver): it would be nice to not be *required* to resolve 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/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_from_impl_for_enum.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ac348c72b0ffac144adb9aeba2b5df323e836a24c60a0cb008530784cedf2d7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME : const and unsafe are not handled yet. \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/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_function.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d05fc9e3a26445951299dc9e1fb17150773275112a82df865058924c8b15499"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: adt may have generic params. \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/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_function.rs"},"region":{"startLine":742}}}],"partialFingerprints":{"codehealthFindingId/v1":"e42fe83c3425ea455bfe9dad103c338f4754f6f966ca989d4ab8a1c9221dd309"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: It might be a good idea to handle lifetime parameters too. \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/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_function.rs"},"region":{"startLine":1050}}}],"partialFingerprints":{"codehealthFindingId/v1":"62428b2f2cbbfec4afa41e2c18688c59c3fee2a4cd642bcf3be175a79cebc84e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// (FIXME?: The latter clause might be overstating. We may want to include the bound if the self \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/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_function.rs"},"region":{"startLine":1099}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c4ea950f44f6253d22abbf975e968dd77100543cd4e948144d3ed67dbde9289"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Generic parameter \u0060T\u0060 should be part of impl, not method. \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/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_function.rs"},"region":{"startLine":1911}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a784fb204b3e1cb2058f66bad3de867e33383f47f60dd4c1cbaa22e83d29302"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: where predicates should be on next lines. \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/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_function.rs"},"region":{"startLine":1949}}}],"partialFingerprints":{"codehealthFindingId/v1":"5360ff9261cc7ce434343d273d1a012d9e373b7375b08552de4923b5fa87169e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: where predicates should be on next lines. \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/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_function.rs"},"region":{"startLine":1993}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bb34c3154df212ab6942a0012942b83e92f30bb03f99f6354948ff5e296d594"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Generate proper \u0060index_mut\u0060 method body refer to \u0060index\u0060 method body may impossible due to the unpredictable case [#15581]."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_mut_trait_impl.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4ad201477e6f21c49928579d25f7e1aff02ae244f142d91b42b0dd611b7da79"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: do not handle callsites in macros\u0027 parameters, because \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/tools/rust-analyzer/crates/ide-assists/src/handlers/inline_call.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"77c2bc0a62b2234cd704edb53c7ea4fc9d9881567c07a18564e14afe23bff8fb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: we need to fetch all locals declared in the parameter 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/tools/rust-analyzer/crates/ide-assists/src/handlers/inline_call.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"2def906efa36e7192130077e2ee3a4234c99e410841f3e4dfdf42277f301e533"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Add support to handle type aliases for builtin scalar 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/tools/rust-analyzer/crates/ide-assists/src/handlers/inline_const_as_literal.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c19af9dcaa5c8b7280ea70d0a1c72f1953065db85d6fd5221737625d1ea667c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Saving fuel when \u0060\u0026\u0060 repeating might not be a good idea if there\u0027s no TCO. \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/tools/rust-analyzer/crates/ide-assists/src/handlers/inline_const_as_literal.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b5773d5d232c213019f389105a1bfccef24b2d76e3af7fc1c986b851cbe2902"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Add support for nested ref slices when using \u0060render_eval\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/tools/rust-analyzer/crates/ide-assists/src/handlers/inline_const_as_literal.rs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0721e78b84fa1bad9b9d8c5fd3dc067f7994c27672b857b63b4ec560dfb512b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Add support for unary tuple expressions when using \u0060render_eval\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/tools/rust-analyzer/crates/ide-assists/src/handlers/inline_const_as_literal.rs"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff2bc0afadc5238d4a28cb41d144605a1b82c040ddf197125505ddacc7803fb9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: process let-expr in macro, but this case is very rare \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/tools/rust-analyzer/crates/ide-assists/src/handlers/inline_local_variable.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"89b7af7f5e3ac6d53cbb0c4c4535c240f1414d79311cb33538d4f590a40d7cca"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This is a bug. The macro should not expand, but it\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":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/inline_macro.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bd558d9d3b4e26d1b9730d8310f20ffce24bd2bb71a46476e5b540f0efa9f7c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: How can we handle renaming any one of multiple anonymous lifetimes? \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/tools/rust-analyzer/crates/ide-assists/src/handlers/introduce_named_lifetime.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"af4156a8af1d9236a497506580b7d2f7bd4141446f37bf590486597bac0c09e7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: should also add support for the case fun(f: \u0026Foo) -\u003E \u0026$0Foo \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/tools/rust-analyzer/crates/ide-assists/src/handlers/introduce_named_lifetime.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7744f2f3ed33660ce833bf0000d1bd09c87a1214e7a32b5052918ec62b00498"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: non-trait assoc items completion is unsupported yet, see FIXME in the import_assets.rs for more details \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/tools/rust-analyzer/crates/ide-assists/src/handlers/qualify_path.rs"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"9148b2548a79f662189184ad4ca7f8f1354ccb54cdbc4f1f072b5b602ee2a983"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: make this work in macro files \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/tools/rust-analyzer/crates/ide-assists/src/handlers/replace_derive_with_manual_impl.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1faa535d11e6ff3abd304daa7d20eb8252842b37ad941839322df86e9daca62"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Perhaps we can extract a let statement to improve \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/tools/rust-analyzer/crates/ide-assists/src/handlers/replace_if_let_with_match.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"418ed8b775fd813357596c8d7c52d02dc8994d6b90cdc93542b5cd3a8d329485"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Use descend pat for sema analysis \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/tools/rust-analyzer/crates/ide-assists/src/handlers/replace_if_let_with_match.rs"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac9306b7377c25d6dcf3e0730eae8f3c5c4e8377911d01ff1bb06a545f773194"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Check that this has the form of \u0060() -\u003E T\u0060 where T is the current type of the argument \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/tools/rust-analyzer/crates/ide-assists/src/handlers/replace_method_eager_lazy.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"cad5c506b8869e770a5793012499c0dda0b1eea9cb5a340e2ee9cebe514461ed"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Check that the arg is of the form \u0060() -\u003E T\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/tools/rust-analyzer/crates/ide-assists/src/handlers/replace_method_eager_lazy.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9ad9a9734165391cd1ae0b0596648cc49ac4a262db851254ae2a48d12d91f14"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This isn\u0027t true due to \u0060super::*\u0060 imports? \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/tools/rust-analyzer/crates/ide-assists/src/handlers/replace_qualified_name_with_use.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"701bacfffbe5abbf0395ce42e93265ded492b2224e40a39d4f891735d1aa1a6b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This ought to be a diagnostic lint. \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/tools/rust-analyzer/crates/ide-assists/src/handlers/unnecessary_async.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"c370bfb07360c1b2f7a84346b27072a6cb9f23b3262ae018f960e594fef3f119"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Use the toolchains channel instead of nightly \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/tools/rust-analyzer/crates/ide/src/doc_links.rs"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfbf8f822ec5db7c65ccc2d90eb5ef002ef012e2bd56e4186e7440bf99464e68"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: These should not attempt to link to docs.rs! \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/tools/rust-analyzer/crates/ide/src/doc_links.rs"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"12eabb303980d36e409c4a7f18bb37e1ff8bb6192d66348cc1a7ba8d60a0835e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: clicking on the link should just open the file in the editor, \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/tools/rust-analyzer/crates/ide/src/doc_links.rs"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"f101d81a4222a2174b1ebe4f13f8c719150eb845789bd1e0bbe3ce6cd9021099"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: clicking on the link should just open the file in the editor, \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/tools/rust-analyzer/crates/ide/src/doc_links.rs"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"f308bb162712bc29aeb519408952d1cde2403175e7d52184ce50a7ef33c7b20c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(trait-alias): url should be traitalias. for aliases \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/tools/rust-analyzer/crates/ide/src/doc_links.rs"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"a69d69bcea41b784845a1a7362da270cc5b5819ec31a8f836a128780e39110b1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME fragment numbering \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/tools/rust-analyzer/crates/ide/src/doc_links.rs"},"region":{"startLine":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfb305fa8a898e2d386341a5486c913b0c06d48c9e79fd59af063efb7dd2e840"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // hack until we get hygiene working (same character amount to preserve formatting as much as possible) \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/expand_macro.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"223c2efa7d50d752350275f5ae47c20d3914a5c71ce8e57039769c64cc697af1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: use \u0060ceil_char_boundary\u0060 from \u0060std::str\u0060 when it gets stable \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/tools/rust-analyzer/crates/ide/src/extend_selection.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6f3c687ec1b7fdc9261269782a3ebd4045aa328feefadb6837df10f8aa5d757"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Support \u0060Poll\u003CResult\u003E\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/tools/rust-analyzer/crates/ide/src/goto_definition.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa57dc1d2dc3965fc094e0016ff6abf4c8fec6c20fddbb9b3dad1be838e87f59"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: requires the HIR to somehow track these hrtb lifetimes \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/tools/rust-analyzer/crates/ide/src/goto_definition.rs"},"region":{"startLine":2084}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6c82ca47b19753f1cfeb8c303d7bd696b96a3d49cc851e297b3e6dff1c1bb65"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: requires ForTypes to be 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":"src/tools/rust-analyzer/crates/ide/src/goto_definition.rs"},"region":{"startLine":2103}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6070e681f40b133aa6ceacd6bcd3b0528ee7e996a4cd8d3fe8c13668a702d39"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(next-solver): it would be nice to be able to also point to \u0060\u0026Foo\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/tools/rust-analyzer/crates/ide/src/goto_implementation.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9792a50dbb252e67a4a9deb3802e570e38b0620867e3d6103da68d5e3c56591"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This needs to be more precise. Reference category makes sense only \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/tools/rust-analyzer/crates/ide/src/highlight_related.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc91b83bb44d595b5f78728e185f9d8d03a80b3ba4027134e7cf9848320a6e21"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Definition should include known lints and the like instead of having this special case 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/tools/rust-analyzer/crates/ide/src/hover.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b0fe16ac90fa754f8c0ac94bf1de47c13f321e4a4333ba6273eca889c06ebe5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: make this work in attributes \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/tools/rust-analyzer/crates/ide/src/hover.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d43cae608b9ca4d8684ceb1b92bfc72617bafcb7f175ff5950dfdb871731ab8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Why is this pub(crate)? \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/tools/rust-analyzer/crates/ide/src/hover.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"b217a95cd568a841f36820b367973b4beb17f0cbf833b427be9b496a54807797"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This can miss some hints that require the parent of the range to calculate \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/tools/rust-analyzer/crates/ide/src/inlay_hints.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"808b50226035fc67945c76c434fce35951c39a4c8cbd4685c2c1410a9d6a1855"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: At some point when our hir infra is fleshed out enough we should flip this and traverse 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/tools/rust-analyzer/crates/ide/src/inlay_hints.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec6e01a3dbae12173b1fd302003b7a99b8c18217be00dd2e6455c8c09b6e66fd"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: trait object type elisions \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/tools/rust-analyzer/crates/ide/src/inlay_hints.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"daadea6999b05c3c500d74bfdb2210295890ff04a7e1f6e111a08dd5313f75ad"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Limit the length and bail out on excess 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":"src/tools/rust-analyzer/crates/ide/src/inlay_hints.rs"},"region":{"startLine":906}}}],"partialFingerprints":{"codehealthFindingId/v1":"cefec2a8e73cff1836f6076f16e7696d1b4db0db6badc905a757262f941139e8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We trim the start because some inlay produces leading whitespace which is not properly supported by our annotation extraction \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/tools/rust-analyzer/crates/ide/src/inlay_hints.rs"},"region":{"startLine":1005}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7b0b2a70bc723a816255a75eb2fd7320b5ed1eb8617a692c107c591d77d1fb6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: cfg options \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/tools/rust-analyzer/crates/ide/src/lib.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e6747182e01db0e7456cc7f5c7f6e1883d3743677b25f49513c926c3ab20ce0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME edition \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/tools/rust-analyzer/crates/ide/src/lib.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"53ae72b75fae5c2519cf7197662b22302aa50aad72b24189287c80133a058294"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Edition \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/tools/rust-analyzer/crates/ide/src/lib.rs"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd6010c8da14ce2031df29f484569764a98559f3911a4c6d9a36bfd0885dae42"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: ///   \u0060BuiltinLifetime\u0060, \u0060TupleField\u0060, \u0060ToolModule\u0060, and \u0060InlineAsmRegOrRegClass\u0060. TODO: it might be \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/tools/rust-analyzer/crates/ide/src/moniker.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"e66509f7a6b85f5719562d6919e3a06d162cf1b2b1db3f37e73f4b9d59630e22"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: \u0060applySnippetTextEdits\u0060 does not support non-empty selection ranges \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/tools/rust-analyzer/crates/ide/src/move_item.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"8112532fa4cff7caf385eb7c7907997f0fa5e8f789a0799edbfdbf305cfdf7c8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: The focus range should be set to the helper declaration \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/tools/rust-analyzer/crates/ide/src/navigation_target.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"8915e414eedda4a6d7e27039cb6a9fca10d7e07a64a5c4a915c603f17335d723"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Handle owners of blocks correctly 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/tools/rust-analyzer/crates/ide/src/navigation_target.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"384ed9def2e505d738b3c3eec3d23346c3eaebf8ff4cbe2f0b31bd7aff667767"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Also make use of the syntax context to determine which site we are at? \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/tools/rust-analyzer/crates/ide/src/navigation_target.rs"},"region":{"startLine":924}}}],"partialFingerprints":{"codehealthFindingId/v1":"58054dd56599ee33423ace8d9f24076ec6a3fd0e9612cd8b9a4452e90b72483a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Do this differently, this is very inflexible the caller \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/tools/rust-analyzer/crates/ide/src/navigation_target.rs"},"region":{"startLine":951}}}],"partialFingerprints":{"codehealthFindingId/v1":"00c55ea188217d41f28a2660335a8c575f643aa34477c43abf1ade1c8b1eb38d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This can be improved \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/tools/rust-analyzer/crates/ide/src/navigation_target.rs"},"region":{"startLine":970}}}],"partialFingerprints":{"codehealthFindingId/v1":"01ea2e710ec2c43a93940971802ef51b1ad8731889b4b3a335433a38bfa4c540"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: The ranges here are volatile when minicore changes, that\u0027s not good. \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/tools/rust-analyzer/crates/ide/src/references.rs"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"591d5152a9ee4777bbd2c420438cb8f3290f340c06bc3336e8919db993e124b2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: import is classified as 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":"src/tools/rust-analyzer/crates/ide/src/references.rs"},"region":{"startLine":2239}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f2c0373386b768052090c9262278930ce2b9102405daab8109acc20de6c072c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: import is classified as 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":"src/tools/rust-analyzer/crates/ide/src/references.rs"},"region":{"startLine":2271}}}],"partialFingerprints":{"codehealthFindingId/v1":"252741a07b3e99f2446b96f065c3004f865248ae862a5d3cf298bf44e6db96a0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This can use the \u0060ide_db::rename_reference\u0060 (or def.rename) method once we can \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/tools/rust-analyzer/crates/ide/src/rename.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"06c7fe758e3834a8552e2589d690fa6ba8d5ce749c76baa6eb58ad3e6af2d821"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: hack - removes the usage that triggered this rename operation. \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/tools/rust-analyzer/crates/ide/src/rename.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"f252a88bd314938c098828c9383318d5a08cae68e75fd0e42d712147f7eced77"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Should support \u0060extern crate\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/tools/rust-analyzer/crates/ide/src/rename.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"a346514c87e9a90c4424260dcb212db96a9c7746ba824f80c0154f4ad12a74a8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: uncomment this once we resolve to usages to extern crate declarations \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/tools/rust-analyzer/crates/ide/src/rename.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae821015264b72b2a767402e7df160173fe7bad438331cfa903008e96c67f3bd"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: uncomment this once we resolve to usages to extern crate declarations \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/tools/rust-analyzer/crates/ide/src/rename.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cdf6e248d302625e6706b755855304c692b9b70b647a527dd5727d12f1cfe8f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We always put it as \u0060Trait::function\u0060. Is it better to use \u0060Type::function\u0060 (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/tools/rust-analyzer/crates/ide/src/rename.rs"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef7f5982e8d6ecd2f70bd6295afba82ac7bbf5602e17daa54f2577e0b1f7ec68"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: replace above check_prepare with this once we resolve to usages to extern crate declarations \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/tools/rust-analyzer/crates/ide/src/rename.rs"},"region":{"startLine":3365}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e0678f74e2133ed71db60327de22c0cb6f1ac7b59a9dd8a812975fc4ede2371"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: replace above check_prepare with this once we resolve to usages to extern crate declarations \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/tools/rust-analyzer/crates/ide/src/rename.rs"},"region":{"startLine":3418}}}],"partialFingerprints":{"codehealthFindingId/v1":"a492e6f5062b048aa943bfdaf573624d33057729390323e2bcb8bfbd21054101"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: replace above check_prepare with this once we resolve to usages to extern crate declarations \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/tools/rust-analyzer/crates/ide/src/rename.rs"},"region":{"startLine":3443}}}],"partialFingerprints":{"codehealthFindingId/v1":"dde411c9288b4b2c1779f95edf027e4df469dafe0041ed5f64dd45702c0f0cb5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: replace above check_prepare with this once we resolve to usages to extern crate \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/tools/rust-analyzer/crates/ide/src/rename.rs"},"region":{"startLine":3392}}}],"partialFingerprints":{"codehealthFindingId/v1":"df710254599024298ed2d732d243a3489cd7beff75d9d6ee1f592d7344a400e6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: why is this using references::find_defs, this should use ide_db::search \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/tools/rust-analyzer/crates/ide/src/runnables.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bd77027ae61f868029de6dc50b9435c474d04bc9e0b0cd63dfa77d2531c405f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Render docs of the concrete trait impl 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":"src/tools/rust-analyzer/crates/ide/src/signature_help.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"d75f663d853ee59c4788f158916597c7a2a97b539f7924238dc0b951ffd8f5f5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // (see FIXME in tests::impl_trait) and falling back on any unknowns. \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/tools/rust-analyzer/crates/ide/src/signature_help.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"327f6707e60f6af82294763109e97e09a511ce4a96a4f2305a4f65552fab6fd2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: The ide layer loses the calling info here so we get an ambiguous trait solve 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/tools/rust-analyzer/crates/ide/src/signature_help.rs"},"region":{"startLine":1616}}}],"partialFingerprints":{"codehealthFindingId/v1":"b50accb520953ae1847f390989de8af3d7938266e0294f60a484ca0272149758"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Substitute type vars in impl trait (\u0060U\u0060 -\u003E \u0060i8\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/tools/rust-analyzer/crates/ide/src/signature_help.rs"},"region":{"startLine":2009}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ca3da48aed142f1b704a875fbbfdb90929255e584211a07a802798812135b83"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(next-solver): There should be signature help available here. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/signature_help.rs"},"region":{"startLine":2074}}}],"partialFingerprints":{"codehealthFindingId/v1":"1689ccdbb29617918f514ea2e9b6d101573ad65bcca1226265df6fd104913b6a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Should typeck report a 4-ary tuple for the expression 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/tools/rust-analyzer/crates/ide/src/signature_help.rs"},"region":{"startLine":2310}}}],"partialFingerprints":{"codehealthFindingId/v1":"649902c0b03d2fa90cf7aa6d9f8d632d98c3bb4cc98d72e3965592bd39bdf83c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This is wrong, this should not mark the last as active \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/tools/rust-analyzer/crates/ide/src/signature_help.rs"},"region":{"startLine":2418}}}],"partialFingerprints":{"codehealthFindingId/v1":"5288989d8197268efb6d62cbb1b77599c8569dbd234a47ce0ab14a16a55400c0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Should typeck report a 3-ary tuple for the pattern 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/tools/rust-analyzer/crates/ide/src/signature_help.rs"},"region":{"startLine":2510}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a5232e1c6fd1bc2a6aa93365ccac3dba38ec5aabf446b928a0864388ca4616c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Make this have the lifetime of the database. \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/tools/rust-analyzer/crates/ide/src/static_index.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"096849f46d62cdf7c174091c4bd540322f2bc9ed2dfbfb212f9b6b66d763fee5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: accommodate range highlighting \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/tools/rust-analyzer/crates/ide/src/syntax_highlighting.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"c11c31c3b2501cb7fe49239674f90c7c53da0464035a463506611ad9702d44fb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: accommodate range highlighting \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/tools/rust-analyzer/crates/ide/src/syntax_highlighting.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"12013ce1c6c2e9772c7f3cf0256f6947b43014a4f6707f3408e72025113509b0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: accommodate range highlighting \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/tools/rust-analyzer/crates/ide/src/syntax_highlighting.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea743c1b9e55b295a7a5542360db95465253dc07f6355b734322f30a79a14f72"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: these are not perfectly accurate, we determine them by the real file\u0027s syntax tree \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/tools/rust-analyzer/crates/ide/src/syntax_highlighting.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f0c834a8df48165641d3ac855bb86729bd6fd7ed8261593ecf97e4b35c0f8e4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: ExpressionStore signatures and variant fields \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/tools/rust-analyzer/crates/ide/src/syntax_highlighting.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"50fc6f66e96cc17487271f35f10eaea9447389fa9c2e09e4bf7d807446e88bce"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Consider checking ctx transparency for being opaque? \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/tools/rust-analyzer/crates/ide/src/syntax_highlighting.rs"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e8fa06009b7a64eb1bfa145be624ca32d8ff843dc6e91e1942c004fa579e531"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: use a snippet completion instead of this hack 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/tools/rust-analyzer/crates/ide/src/typing.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcf0342be0fccd1bafca7e9b5d21b4d001000b8f0dbd6a0d32cdb3981651ee57"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Replace this with the HIR info we have now. \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/tools/rust-analyzer/crates/ide/src/syntax_highlighting/format.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"e53bb71d4d87de548b5f4ff6864e8fd3e074d102c453b9e3bc1eb826fb2f048b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Fallback for \u0027_, as we do not resolve these yet \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/tools/rust-analyzer/crates/ide/src/syntax_highlighting/highlight.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"576800d581061f69d9af4ec3c1f02e446348ce612539c41408719f3954988c43"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This is required for helper attributes used by proc-macros, as those do not map down \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/tools/rust-analyzer/crates/ide/src/syntax_highlighting/highlight.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7c441267af176ea460dd67113af017ac5846ed04c5d57e8ff19c91cef0b1936"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Passing \u0060None\u0060 here means not-unsafe functions with \u0060#[target_feature]\u0060 will be \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/tools/rust-analyzer/crates/ide/src/syntax_highlighting/highlight.rs"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d23f053bbba024ffe528ca8d7937a754b0f0210383a4ae34ff995a1093a92a1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This should be the edition of the call. \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/tools/rust-analyzer/crates/ide/src/syntax_highlighting/highlight.rs"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f0f901d87b64ad76529db383714c073027787c5440262d540822c063a779b2c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //FIXME: like, real html escaping \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/tools/rust-analyzer/crates/ide/src/syntax_highlighting/html.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cdf823b493681f9ef61a833afc623c933388d0668e61564a04086460e789829"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Support general path 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/tools/rust-analyzer/crates/ide/src/inlay_hints/lifetime.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3357a2548e368bf6ba0666c371364fc8709d1c83d2c1b495fb03476ba3b3230"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: check path 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/tools/rust-analyzer/crates/ide/src/inlay_hints/lifetime.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9d219253715d59cd173b6b82a00aa5cd0b7b1e47afe62e65aecfccb941c15da"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Show the data of unsized structs \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/tools/rust-analyzer/crates/ide/src/hover/tests.rs"},"region":{"startLine":6402}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd95b15b5e08c361d075cfda28b3c071c86b428a54b17c56a1a83d1ec119ee37"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(next-solver): this fails to normalize the const, probably due to the solver \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/tools/rust-analyzer/crates/ide/src/hover/tests.rs"},"region":{"startLine":6486}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c8e2bfd1c48b6ed5ac626cd638c5400b2cb4ee1edea877207a690974288001d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME #9694: [\u0060Struct::Type\u0060]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/doc_links/tests.rs"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f36d240fc50b70bd47d9a4185283872ab342a7ad25e830c5d003f459a6fb809"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: The recursion limit for \u0060Autoderef\u0060 is currently 20, so \u0060Vec::contains()\u0060 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/tools/rust-analyzer/crates/hir-ty/src/autoderef.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"b99d77e2df547825e1ac35e8b58994b8784e4b8cb6f88a3bb6923b97425092dc"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: Fake the param. \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/builtin_derive.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"e28009ffd9bb135af67d5195fa3f22f8f769f2cf27751aa379157496d59ce3b7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Report an 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/tools/rust-analyzer/crates/hir-ty/src/consteval.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f8010aed3a48f07b73b7f0a95fe5804ed88e710815f34b37bcda1fbed420533"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Collapse \u0060mir_body_for_closure\u0060 into \u0060mir_body\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/tools/rust-analyzer/crates/hir-ty/src/db.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce17b2422c6f528053802962aad1b53f6bc249b46653bd438aab77848e9fa701"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: We need this for MIR intrinsic \u0060type_name()\u0060, and it can\u0027t access the display infra because it is inside \u0060hir-ide\u0060. \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/db.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"f90e4ffb4efbf0b3b5f75a97158096c947ad30d24c30e8f208340a10ec5d5929"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Coroutine witness. \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/tools/rust-analyzer/crates/hir-ty/src/drop.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f96ecf94ac91738da52dc7e303f24228e3982d51df6d65231dd409c70975e23"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: That seems problematic to fake a generic param like that? \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/tools/rust-analyzer/crates/hir-ty/src/dyn_compatibility.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb155069b62ca901bc121089ec3a483122957f8cce2d9903e39c0e4262cad656"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This should be emitted in body lowering \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/tools/rust-analyzer/crates/hir-ty/src/infer.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3dc2d30abe9b3165ef08db018738b7be3ab40d38ad3626930845ae2db58c080"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We should use this when appropriate. \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/tools/rust-analyzer/crates/hir-ty/src/infer.rs"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc5b66244c6f706457b8d7353bbfca37884691099d297ecbb18fe43fc7377000"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This isn\u0027t as useful as initially thought due to us falling back placeholders 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/tools/rust-analyzer/crates/hir-ty/src/infer.rs"},"region":{"startLine":785}}}],"partialFingerprints":{"codehealthFindingId/v1":"dab86b8e0f8cc666b302a62caeefbad8a80b91eb4b6ad702de354a5895e41425"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Remove this, change it to be in \u0060InferenceContext\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/tools/rust-analyzer/crates/hir-ty/src/infer.rs"},"region":{"startLine":791}}}],"partialFingerprints":{"codehealthFindingId/v1":"84dd749badeb627120ca91b112ed08383fef9e1c1141986f6f4aef8307fa8251"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Report an error 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":"src/tools/rust-analyzer/crates/hir-ty/src/infer.rs"},"region":{"startLine":2020}}}],"partialFingerprints":{"codehealthFindingId/v1":"da8616036bae1c5ed49a9b1ec439520108019dbc387975fec201eacd57dc07ae"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Report errors. \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/tools/rust-analyzer/crates/hir-ty/src/infer.rs"},"region":{"startLine":2026}}}],"partialFingerprints":{"codehealthFindingId/v1":"f05f5b9592b375b435490104336aa931829e8bd17751d2df251281efd3c31c40"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: fetch the limit properly \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/tools/rust-analyzer/crates/hir-ty/src/infer.rs"},"region":{"startLine":2066}}}],"partialFingerprints":{"codehealthFindingId/v1":"72ef07cd0f928fc5460a97ba9590c9226e25ae4eaad03385df70f23cdfffbe9f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Emit diagnostic. \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/tools/rust-analyzer/crates/hir-ty/src/infer.rs"},"region":{"startLine":2215}}}],"partialFingerprints":{"codehealthFindingId/v1":"560f848864142cff27df9ed332709a977e3b3cd623a0d507fa4d440831cb99b7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Report error if there are generics on the variant. \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/tools/rust-analyzer/crates/hir-ty/src/infer.rs"},"region":{"startLine":2325}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd57244b963a2038f7fc5938cba7e3ee0e7424260ba86dbedacc8e9dfb2e43ac"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Report an 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/tools/rust-analyzer/crates/hir-ty/src/infer.rs"},"region":{"startLine":2336}}}],"partialFingerprints":{"codehealthFindingId/v1":"e112c95ab4471ac41cb0e20f238931b0696f7c21094ff6f1240f19034e4dcc00"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Report an 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/tools/rust-analyzer/crates/hir-ty/src/infer.rs"},"region":{"startLine":2445}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eeec25161d8a6fbf16f4edbb72d03f67146379fb8857ac825de519b475f80ab"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Report an 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/tools/rust-analyzer/crates/hir-ty/src/infer.rs"},"region":{"startLine":2507}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b664b8dacf76f5f2507b4715d6a3fb391020083c7c024f19363f38ab7bd2497"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Report an 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/tools/rust-analyzer/crates/hir-ty/src/lower.rs"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"06fdad475247f872a56e99b4c7cb046477db2a37e0b52889bef5e5526d5f5e74"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Report an 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/tools/rust-analyzer/crates/hir-ty/src/lower.rs"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5851248e86a2954f58be955ac40d15de1bea6c326c10b648fd6f91fcdc4de10"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Report an 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/tools/rust-analyzer/crates/hir-ty/src/lower.rs"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9bc2fb053977912b685b64f94fcdbfeaafce13f7679df0e74105be6d0f3adec"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Report an 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/tools/rust-analyzer/crates/hir-ty/src/lower.rs"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"a14a29af1b84b4193e6f349690b139694a8497850a8fb3cdbd8f79aedb9f4243"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Report an 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/tools/rust-analyzer/crates/hir-ty/src/lower.rs"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"674ec2af95e0e33932bc19e7a3da59dadeb64ded3b39d586c8001f3ab5528b14"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Report an 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/tools/rust-analyzer/crates/hir-ty/src/lower.rs"},"region":{"startLine":1071}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0634e86d4e244d92a7ade91db30cae35adec93d572421e80f7fd61257e316b5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Report an 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/tools/rust-analyzer/crates/hir-ty/src/lower.rs"},"region":{"startLine":1082}}}],"partialFingerprints":{"codehealthFindingId/v1":"e50e185661c90449a596154109127bd770e01cc8eb41cbce731d68cbef5111fc"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Report an 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/tools/rust-analyzer/crates/hir-ty/src/lower.rs"},"region":{"startLine":1243}}}],"partialFingerprints":{"codehealthFindingId/v1":"a55d4351bdf8f73282b92179ab7140573b30c7298c0ace1806a18977ea0f324b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Report an 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/tools/rust-analyzer/crates/hir-ty/src/method_resolution/probe.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"654c2f902b3d774d4af8da0671dfb00dc6521d6c281fb9ea886f6fc70e21c6b1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Report an 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/tools/rust-analyzer/crates/hir-def/src/expr_store/lower/path.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"76bb2961d7ed46c2b92428aa69cd0c99d89b026d1f4ae41138d64f7a8fa6491c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Report an 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/tools/rust-analyzer/crates/hir-def/src/expr_store/lower/path.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"2314a23a126b6dd16dcebae32f8087c9082bcce7f6fc5bd1286066ab04e32882"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Report an 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/tools/rust-analyzer/crates/hir-def/src/expr_store/lower/path.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"33c4eee6ca307e1e656dd131928178879b670366c8632821e908d72aa11a597e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: with \u0060inherent_associated_types\u0060 this is allowed, but our \u0060lower_partly_resolved_path()\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/tools/rust-analyzer/crates/hir-ty/src/infer.rs"},"region":{"startLine":2452}}}],"partialFingerprints":{"codehealthFindingId/v1":"622605fd74bc519dfd403383fba8752bbc3ff081bafd33ab9a4be5057c2569f6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME Error E0071, expected struct, variant or union type, found enum \u0060Foo\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/tools/rust-analyzer/crates/hir-ty/src/infer.rs"},"region":{"startLine":2476}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4318edbbb7a4100154c56adeb6f92386c0f6de0894addd92ff3ad7bf66405a1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME Error E0071, expected struct, variant or union type, found enum \u0060Foo\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/tools/rust-analyzer/crates/hir-ty/src/infer.rs"},"region":{"startLine":2517}}}],"partialFingerprints":{"codehealthFindingId/v1":"97ce9ff98323a0915f9b39bd5acc18f9030b41eab97959fd6f7fd1e2e1a43496"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME Error E0071, expected struct, variant or union type, found enum \u0060Foo\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/tools/rust-analyzer/crates/hir-ty/src/infer.rs"},"region":{"startLine":2580}}}],"partialFingerprints":{"codehealthFindingId/v1":"a341902181862e34ebd9cea13f49d70af9d5190aa7cf4589b2cad4eaf5a8f05c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME this could happen in array size expressions, once we\u0027re checking them \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/infer.rs"},"region":{"startLine":2538}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe1e2ba37226b93c9368dd985aff6497555645a74c0b184e7f9e977f042a3293"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME potentially resolve assoc type \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/tools/rust-analyzer/crates/hir-ty/src/infer.rs"},"region":{"startLine":2542}}}],"partialFingerprints":{"codehealthFindingId/v1":"def2cf92272272a74584875dc9ea92b0cff25e46761ee578194f213f9883e08c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME potentially resolve assoc type \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/tools/rust-analyzer/crates/hir-ty/src/infer.rs"},"region":{"startLine":2595}}}],"partialFingerprints":{"codehealthFindingId/v1":"e15c9e37b5eed6d53a9fe2e5ae00e6d8f7398c443997dfc5aef4fc894c3dcbf3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME diagnostic \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/tools/rust-analyzer/crates/hir-ty/src/infer.rs"},"region":{"startLine":2546}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b452e383936509d12f2c04dd4fbe1ddf0085d43c06292e51dac12f0851a2d12"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME diagnostic \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/tools/rust-analyzer/crates/hir-ty/src/infer.rs"},"region":{"startLine":2559}}}],"partialFingerprints":{"codehealthFindingId/v1":"809ec9c320dcc33545095ddbffc36e56e5467e3ad18e58cc73456bab7adf2fb6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME diagnostic \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/tools/rust-analyzer/crates/hir-ty/src/infer.rs"},"region":{"startLine":2599}}}],"partialFingerprints":{"codehealthFindingId/v1":"66c9485f202d17bab2eed27ac98e6a5d8d91d4cec16ef1a3369243b169aed848"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: get rid of this? \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/tools/rust-analyzer/crates/hir-ty/src/infer.rs"},"region":{"startLine":2640}}}],"partialFingerprints":{"codehealthFindingId/v1":"b395fde98a58d7cc09ef9eee4728ed6c625d0a979bf5f2f6e604810abfe9275b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Turn this into a query, it can be quite slow \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/tools/rust-analyzer/crates/hir-ty/src/inhabitedness.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"36a8e3e4f3346f143a16624ca46470cb150fbd9ca84e083ae05f3cb9c63aaf22"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Turn this into a query, it can be quite slow \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/tools/rust-analyzer/crates/hir-ty/src/inhabitedness.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"862c36cc57964ddddbd4655d0550ca37f991e24133a861aa33f67ee359e91e47"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Remove more variants once they get added to LayoutCalculatorError \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/tools/rust-analyzer/crates/hir-ty/src/layout.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"e723b16f8eaafb8c40606abb6ca849e7a906d8f7bbd6fd9922e498597ed6723f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: move this to the \u0060rustc_abi\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/tools/rust-analyzer/crates/hir-ty/src/layout.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"22807720a9c73481be663f5ab2fb3cb56f4b6c17ebf3ebac9d7873ff256b75b9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(next-solver) \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/tools/rust-analyzer/crates/hir-ty/src/layout.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdecb97b8de16ff608357b8407cb93fc7e8d24d4bfd469343ec946e494171ea2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(next-solver) \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/tools/rust-analyzer/crates/hir-ty/src/layout.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"f19c9ad68d788f77b954c20954125c7456e61459c13f935c301bb1bcc061b53f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(next-solver) \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/tools/rust-analyzer/crates/hir-ty/src/next_solver/interner.rs"},"region":{"startLine":1668}}}],"partialFingerprints":{"codehealthFindingId/v1":"9251a6ab96c665a86eaa27584194f720a58a95864883a774c80d078885261e0a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(next-solver) \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/tools/rust-analyzer/crates/hir-ty/src/next_solver/interner.rs"},"region":{"startLine":1855}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a341eee41272e7d6e1282d199d3399d49a1000e358fad0d1321b3140cf82a57"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(next-solver) \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/tools/rust-analyzer/crates/hir-ty/src/next_solver/interner.rs"},"region":{"startLine":1866}}}],"partialFingerprints":{"codehealthFindingId/v1":"392af978b7f1c481c7eb25613ec3481d64b86c8fb85541aad40ae1ef8c46ffce"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(pattern_types): create implied bounds from pattern types in signatures \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/tools/rust-analyzer/crates/hir-ty/src/layout.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bcde9ede183601cd5012516898d9404311fe9bd51af6a5e878400c69a99ba98"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(pattern_types): create implied bounds from pattern types in signatures \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":"compiler/rustc_ty_utils/src/layout.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"18cfbd298a05054f1ac9f39fc076a7997a376debf430de20d67c7b27c2a6d4ce"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We used to import \u0060rustc_*\u0060 deps from \u0060rustc_private\u0060 with \u0060feature = \u0022in-rust-tree\u0022 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/tools/rust-analyzer/crates/hir-ty/src/lib.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a099482fb1e53f5cc5a96f9c38b73af7980e29e4b8efaede3acfcf3094bd582"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(splat): handle splatted 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":"src/tools/rust-analyzer/crates/hir-ty/src/lib.rs"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f919366fb163046ab5d201eec329c9044dd7e2eb20830751a96fbbc7a04ebce"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(splat): handle splatted 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":"src/tools/rust-analyzer/crates/hir-ty/src/lower.rs"},"region":{"startLine":800}}}],"partialFingerprints":{"codehealthFindingId/v1":"031aff3888d3ea794e3165d1612ef3da395016e4cb791aeb7cf9c421405dd1ae"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We should use the elided lifetime here, or \u0060ElisionFailure\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/tools/rust-analyzer/crates/hir-ty/src/lower.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f41b3f187728d5cf10184981b2f9a6ceceffb77642af891576f7efc832d8323"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: It should infer the eldided lifetimes instead of stubbing with 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/tools/rust-analyzer/crates/hir-ty/src/lower.rs"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7516ebce2c411bf3ee55fbf599d404ca60b99a289910586afca81cabd2d753f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: report 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/tools/rust-analyzer/crates/hir-ty/src/lower.rs"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed7d8435c0517ba188ca014a06e53e4bdac4af798664ca3145d893968e28683f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: report 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/tools/rust-analyzer/crates/hir-ty/src/lower.rs"},"region":{"startLine":1300}}}],"partialFingerprints":{"codehealthFindingId/v1":"cae37968be320322edaac6f857b1891e1521e4c32a96e2cda5d350d5bc45a531"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: report 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/tools/rust-analyzer/crates/hir-ty/src/lower/path.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a592ebddc31318692d980d9f3a8b6b85e0bdfbaff561e54e4871a1ca533d70d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(trait_alias): We need to handle trait alias 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/tools/rust-analyzer/crates/hir-ty/src/lower.rs"},"region":{"startLine":889}}}],"partialFingerprints":{"codehealthFindingId/v1":"eba0b3572efac768418556bc814ce6b5a04520dd6b0406da071c6dcb8dbaad13"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(sized-hierarchy): Remove this bound modifications once we have 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":"src/tools/rust-analyzer/crates/hir-ty/src/lower.rs"},"region":{"startLine":965}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0f43bb0b09d8763eb2a1194e9dd98a10e34eaeffb7f3029be28624f4c1b0751"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Report \u0022conflicting associated type\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/tools/rust-analyzer/crates/hir-ty/src/lower.rs"},"region":{"startLine":1132}}}],"partialFingerprints":{"codehealthFindingId/v1":"abc38ab66e69056cadeb7a7ba4b2bc54e3ba332fcb5204517ac68af4f747e622"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(negative_bounds): Handle this correctly... \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/tools/rust-analyzer/crates/hir-ty/src/lower.rs"},"region":{"startLine":1162}}}],"partialFingerprints":{"codehealthFindingId/v1":"df62d8b19537314e1cd84706eb5ce8139e2e99c56d6ab189186b6e987534dce5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(negative_bounds): Handle this correctly... \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":"compiler/rustc_hir_analysis/src/hir_ty_lowering/dyn_trait.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f9556fd936d63fd3a6db8ec0750207a94cb7fb1d50bc74bfdde1e6a0eb08087"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(mgca): We should walk the const instead of not doing anything \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/tools/rust-analyzer/crates/hir-ty/src/lower.rs"},"region":{"startLine":1182}}}],"partialFingerprints":{"codehealthFindingId/v1":"997e5a4d8d9d29807b2c88b7f766060063e2277d569c9198e4b8550fe0854b0f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We should normalize projections here, like rustc does. \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/tools/rust-analyzer/crates/hir-ty/src/lower.rs"},"region":{"startLine":2756}}}],"partialFingerprints":{"codehealthFindingId/v1":"57638d28ccd35c315e49a3f56cc559c5efb248767721d5a3ad3a76cd9ad0551f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Report 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/tools/rust-analyzer/crates/hir-ty/src/method_resolution.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"94696c689b35e91dcf8d632cbcb14d94a08fbe2d86c08b7912be5e0b3ac9f3d9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We should stop passing \u0060None\u0060 for the failure case \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/tools/rust-analyzer/crates/hir-ty/src/method_resolution.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea36e2631015a87efe917b4757815cc32a567aa4f9c0f5eda2b826c580be55e4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We should stop passing \u0060None\u0060 for the failure case \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":"compiler/rustc_hir_typeck/src/method/mod.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6d6885d8322fb6b80994a0109d47d9151da665af9551c027e345925af06a966"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: decide whether inferred regions should be replaced with error or erased. \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/tools/rust-analyzer/crates/hir-ty/src/method_resolution.rs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"13deefdb9917657adb64bbe354a800f84ea53fd519d1fdbc7884f0fc4ca53b81"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Reservation impls should be considered during coherence checks. If we 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":"src/tools/rust-analyzer/crates/hir-ty/src/method_resolution.rs"},"region":{"startLine":747}}}],"partialFingerprints":{"codehealthFindingId/v1":"997de7964717cfc8486dfaf23ad8b972b088661ea9a8b4644fce3268b9a4a263"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME : This should actually just be of type \u0060MirSpan\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/tools/rust-analyzer/crates/hir-ty/src/mir.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb03ae1f3c72c1da56b7b80dd0a97f4071c25e2ea27aefb5bb54b4bb1b31dedd"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// glue is special - this would be part of Rust\u0027s memory model. (**FIXME**: due we have an \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/tools/rust-analyzer/crates/hir-ty/src/mir.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbaa92a83e242dd9445e65ae7ea125b41be66d57a104395777c4c734618ef42b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// **FIXME**: Document exactly which \u0060CastKind\u0060s allow which types of casts. Figure out 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/tools/rust-analyzer/crates/hir-ty/src/mir.rs"},"region":{"startLine":886}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8878d79a1d946ae03a85f64235a1de3fc6900240417f24b2ee2ff620d8e5937"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME link to \u0060pointer::offset\u0060 when it hits stable. \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/tools/rust-analyzer/crates/hir-ty/src/mir.rs"},"region":{"startLine":890}}}],"partialFingerprints":{"codehealthFindingId/v1":"874ee1c9ec1ccb98211df0d573c02afcce21f899b66a3ab640950964bbcbbcd5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME TyKind::Coroutine... \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/tools/rust-analyzer/crates/hir-ty/src/mir.rs"},"region":{"startLine":1207}}}],"partialFingerprints":{"codehealthFindingId/v1":"98ec629e768d892b6e19b65f3dd35f6c6a84357e09a4c102e152ad9b7f03a1e8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME TyKind::Coroutine / TyKind::CoroutineClosure... \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/tools/rust-analyzer/crates/hir-ty/src/mir.rs"},"region":{"startLine":1222}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a7037d6d65c3d33895c11819d754816bc0006a166f2cf11faf9fa6e1461990f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Collect opaques from \u0060#[define_opaque]\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/tools/rust-analyzer/crates/hir-ty/src/opaques.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5b3520fddefe19c89dfc06a01f38ec7761b8ce519fd6ba0ddd10192a75bdf72"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Support general TAITs, or decisively decide not 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/tools/rust-analyzer/crates/hir-ty/src/opaques.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ae3a76355f11d9d507c3004095c7d6a41d95bbe88d84b762680f420ce2066eb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#11924) allow zero-length arrays?"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/representability.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4829566a055a3badc708afdc28e8479e4d934d10cdc1ffd79e00be889e91978"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#11924) allow zero-length arrays?"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ty_utils/src/representability.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"104fe40433ac1ae031910c61d48b56457ab707c9f5bf0986f9244670de6c75a3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Handle more error kinds. \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/tools/rust-analyzer/crates/hir-ty/src/solver_errors.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8695718bdc82cf1e642398915a24166010fda562ce955f626865f7c8c827ead"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Check impl constness (when we implement const impls). \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/tools/rust-analyzer/crates/hir-ty/src/specialization.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce8957fd96d1a7d91ffaf3260fd4b475a4eaeb8a9df5a2a7d2229af0b9258dc1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(next-solver): I believe this should be \u0060PostAnalysis\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/tools/rust-analyzer/crates/hir-ty/src/traits.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"387683f17cbeb3a73a5388c2e06d8748fdbf4ccabd94b9f508f5435db41a2d45"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: param coverage \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/tools/rust-analyzer/crates/hir-ty/src/traits.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ec3af46df8c2c2e121d74382a1df20da8d00b82bce6f305de66838b510f9133"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Probably not correct wrt. opaques. \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/tools/rust-analyzer/crates/hir-ty/src/variance.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"1654a55a1fb32469275430f011dc6377ad9f69effb55e2b25eb185b8868b40d2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: See \u0060ParamTy\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/tools/rust-analyzer/crates/hir-ty/src/next_solver/consts.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8a5128c4fd023cb3f54b065235d6079a5b27ca62c8865fda349954e21a0724a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: See \u0060ParamTy\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/tools/rust-analyzer/crates/hir-ty/src/next_solver/region.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8f9ff86090eb1f4f513b76c32e17c84e93bba798f49947655fb9069c58f079e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: should use \u0060ClosureSubst\u0060 when possible \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/tools/rust-analyzer/crates/hir-ty/src/next_solver/generic_arg.rs"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba36b0bbfec92e8060363491e72abc222d5f2e50a15d9ff7c16275bd7383a570"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We ignore the expected term of \u0060NormalizesTo\u0060 goals \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/tools/rust-analyzer/crates/hir-ty/src/next_solver/inspect.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"36143fd34348c19739ce94979afef47e880dc7ce9ed898dc7eba00e3edb51ce3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(-Znext-solver): This does not handle impl candidates \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/tools/rust-analyzer/crates/hir-ty/src/next_solver/inspect.rs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"2174cf0c88096e436db7bb7298f3b4b7375138aacd3d15aab930c64904b0aaf5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(-Znext-solver): This does not handle impl candidates \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":"compiler/rustc_trait_selection/src/solve/inspect/analyse.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa1bbea6e601a577e3e6b0e13c106ac69650e0cbb8382234f0529f6d54708b06"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This transmute is not safe as 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":"src/tools/rust-analyzer/crates/hir-ty/src/next_solver/interner.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dc4bde19d210807c7e33f8863d802b922c1ae3eadeed7ab4804b8f1739c612b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: very wrong, see https://github.com/rust-lang/rust/pull/144808"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/next_solver/interner.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"b079ab535ad0fc5f4a190cd01f6152141ea084a7577ca6f1f0ca248da500ab23"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(next-solver): remove this method \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/tools/rust-analyzer/crates/hir-ty/src/next_solver/interner.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"27ec5a1abcf8b323dedf7ed44ed69c63ae2a7b72f8325bcc1fb63a3d8d12702c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(next-solver): track variances \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/tools/rust-analyzer/crates/hir-ty/src/next_solver/interner.rs"},"region":{"startLine":1049}}}],"partialFingerprints":{"codehealthFindingId/v1":"76634d01d8eec49347c0eac0a6599e7ec15f2d14cc9fba9090ed5fa9130554e1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(next-solver): This uses the types of \u0060query mir_borrowck\u0060 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/tools/rust-analyzer/crates/hir-ty/src/next_solver/interner.rs"},"region":{"startLine":1080}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b7ec20a39aecc782477b3e371e57181b58f3d18497492afc6dc6c3a4e85e13e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Is this correct wrt. combined kind of assoc type bounds, i.e. \u0060where Self::Assoc: Trait\u003CAssoc2: Trait\u003E\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/tools/rust-analyzer/crates/hir-ty/src/next_solver/interner.rs"},"region":{"startLine":1325}}}],"partialFingerprints":{"codehealthFindingId/v1":"851872d5a75d757e88ea3bba4f5320590b326b9a87db4aa172a51195d1532403"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: For integer and float variables we have to manually look at all impls \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/next_solver/interner.rs"},"region":{"startLine":1519}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7496f537da734bf77f209c14c73cc1851a2b51684bf4aecb3f2ddc6a071cc3f"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: For integer and float variables we have to manually look at all impls \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/ty/trait_def.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4dffaee8f019a3b6f01ab266997830166a2162f21fa608a050064a986220e38"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: These should ideally not exist as a self type. It would be nice for \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/tools/rust-analyzer/crates/hir-ty/src/next_solver/interner.rs"},"region":{"startLine":1569}}}],"partialFingerprints":{"codehealthFindingId/v1":"5de89f74c291c8864759a3760f0e229a67b107c821e0ed49dae4a7a7c1ff4a3c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: These should ideally not exist as a self type. It would be nice for \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":"compiler/rustc_middle/src/ty/trait_def.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"60702ec97c4de2d8bba02d169a661a78aa2f5680ecdfe124d8451f86eb5121c0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(next-solver): should check if the associated item has a value. \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/tools/rust-analyzer/crates/hir-ty/src/next_solver/interner.rs"},"region":{"startLine":1607}}}],"partialFingerprints":{"codehealthFindingId/v1":"8010b86572ec7c38077d9f2a9bb7d3d189510ad8217c5096ba7749f32ed0a058"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Actually implement this. \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/tools/rust-analyzer/crates/hir-ty/src/next_solver/interner.rs"},"region":{"startLine":1914}}}],"partialFingerprints":{"codehealthFindingId/v1":"27bda692cf3f2e64732ee7bb29fcae6994770b60a017af38cf05f1a0873a8a12"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: add splat support when the experiment is complete \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/tools/rust-analyzer/crates/hir-ty/src/next_solver/interner.rs"},"region":{"startLine":2090}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfb53bceb8135f0594f14a7426a77a7a82e4bc736a89871a1930229bd9673920"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //  - We added all storages (FIXME: it\u0027s too easy to forget to add a new storage 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/tools/rust-analyzer/crates/hir-ty/src/next_solver/interner.rs"},"region":{"startLine":2447}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccd658f7f4a032ada418c47b81a619fa7de56d62366c2b7e0de3beb8a28e0932"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this is actual unstable - see impl in predicate.rs in \u0060rustc_middle\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/tools/rust-analyzer/crates/hir-ty/src/next_solver/predicate.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"90acc2227d5969b76df0056eb4d9b21f30bc93d00bb37e04acd1b7fb1ddfc7a6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO implement Debug by hand \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/tools/rust-analyzer/crates/hir-ty/src/next_solver/predicate.rs"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbce7af8f0eb4056d672b56ad74ab0762bb338ab302f5047aec17fdd1482f0fa"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(next-solver): \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/tools/rust-analyzer/crates/hir-ty/src/next_solver/solver.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"70a11c11d1b45ec6a1802507f23c6913b4ac2a5f25d6991d1ef05b36e4fe7055"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: add if we care about regions \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/tools/rust-analyzer/crates/hir-ty/src/next_solver/solver.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b3a0f6ad2474ef944bed62260ee0eb1ae786f8b408c3325cd74329897bafb5a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Not all evaluation errors should return an error const, rustc returns None on \u0060EvaluateConstErr::{HasGenericsOrInfers, InvalidConstParamTy}\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/tools/rust-analyzer/crates/hir-ty/src/next_solver/solver.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"c507829a09d9e4ef794a5d770b8103c634355113d5cdfb4e34295bfbf87d423c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Properly consider opaques 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/tools/rust-analyzer/crates/hir-ty/src/next_solver/solver.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7680da4d032263630ca346af272a1cbc5c633f793c1f12419e1cefcaed09e5c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Properly consider opaques 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":"compiler/rustc_trait_selection/src/solve/delegate.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"c24e92d8e5818d488c7a1cc8cc09e8f5e5852723e9a0690f81f4257c304f275a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Should this be 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/tools/rust-analyzer/crates/hir-ty/src/next_solver/ty.rs"},"region":{"startLine":753}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c5fc49ef9f72fda1a7d36b4c9fd5c3082faf15922cc0e35f30a06ae667f5595"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We shouldn\u0027t use \u0060param.id\u0060 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/tools/rust-analyzer/crates/hir-ty/src/next_solver/ty.rs"},"region":{"startLine":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b0bfb053bf161da4b63740f3cb9789a9799e8a82df5b20ebb7af211df6fb8fe"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: Get rid of this, it\u0027s not a good abstraction \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/tools/rust-analyzer/crates/hir-ty/src/next_solver/ty.rs"},"region":{"startLine":813}}}],"partialFingerprints":{"codehealthFindingId/v1":"21e3021f9eacea4172073157f81417e1a1ee182ccc1628d3f46cbd457a11f86b"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: Coroutine witness types are lifetime erased, so they \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/next_solver/ty.rs"},"region":{"startLine":1219}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd08968ae0c965684f0cde97385eaf25ffa311ecac99b8010646b1eeae91500c"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: Coroutine witness types are lifetime erased, so they \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/ty/sty.rs"},"region":{"startLine":819}}}],"partialFingerprints":{"codehealthFindingId/v1":"624c5af661b15e026b1bea6c89d42cc6f55df7c4650cc67ef57630bfc0d25f6e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: I\u0027m not pleased with this. Ideally a \u0060Param\u0060 should only know its index - the defining item \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/tools/rust-analyzer/crates/hir-ty/src/next_solver/ty.rs"},"region":{"startLine":1443}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c102aa27a4ed4e3d9eb0dc90228f4359e98f543d275291756f0bde5064770d9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(next-trait-solver): uplift \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/tools/rust-analyzer/crates/hir-ty/src/next_solver/util.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"27744e2d956f83e150eb295ad3c6588cadca500f863b9fa9ef889439e6d7cec7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(sized_hierarchy): this temporarily reverts the \u0060sized_hierarchy\u0060 feature \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/tools/rust-analyzer/crates/hir-ty/src/next_solver/util.rs"},"region":{"startLine":748}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc5cae4ebf8bcb5d03ad33e0a8020a06c8547f5385a584c164dc4a61208e00ff"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This could be a \u0060Sorts\u0060 if the term is a type \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/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/errors.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"8555b9904073b371a552fb498dd186f2e5242b6b5afb275b4f537b30fd9e583e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This could be a \u0060Sorts\u0060 if the term is a type \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":"compiler/rustc_trait_selection/src/solve/fulfill/derive_errors.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"61ac8e893793c4010f3a9bfe0dc3e0cf2d4af1756613b1feb35fe032d1f6046f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We should probably just look into overflows 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/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/errors.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"5672315a8332d51e2e2052f06928487d4fc677b9b49d59b8b852e0663e0a4bfe"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We should probably just look into overflows 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":"compiler/rustc_trait_selection/src/solve/fulfill/derive_errors.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"79c1e3e6b939e0518f02f6dd15b6229441062f7103182e67613d5dcfacc104fc"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: we use a probe here as the \u0060BestObligation\u0060 visitor does not \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/errors.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fe0bbaed47fc9316a6c3207f0540f250b91fd7f173e1327f9d4d91df3007915"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: we use a probe here as the \u0060BestObligation\u0060 visitor does not \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/solve/fulfill/derive_errors.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"f54d92a1d12683e14c4e140eb1e2a3ec8f05a115b938f45fbfcb51cad6f8fc12"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: /// HACK: We walk the nested obligations for a well-formed arg manually, \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/errors.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac68f156b5b01fccaebbca4e3dd516470c72790c065b7f0a32c70c98b4384324"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: /// HACK: We walk the nested obligations for a well-formed arg manually, \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/solve/fulfill/derive_errors.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"659d92bbc3f573801bef093d36124d83e1baf1b52bff714e1b91187a1bb8fee6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: rustc does this, but we don\u0027t process WF obligations yet: \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/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/errors.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb802017b26c95c7f1d12afafc4c4517f6f5377fb3058b7229029dd57a692d70"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Also, what about considering \u003E1 layer up the stack? May be necessary \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/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/errors.rs"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"255556bfb9ca82eeb45bfefafe25bb05be0adb9172f2c0248be456ebc87b4302"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Also, what about considering \u003E1 layer up the stack? May be necessary \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":"compiler/rustc_trait_selection/src/solve/fulfill/derive_errors.rs"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f1f9d589e8566326ae4bbd1c3518df4ee572689a2db660d2c8e8589b73deb0f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Remove this in favor of storing this in the tree \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/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/select.rs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"3948a9f99945b58d1b32c39969aa5373c6e2ab927bcba20f67bcdbeb541c6f80"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Remove this in favor of storing this in the tree \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":"compiler/rustc_trait_selection/src/solve/select.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"410c9b21b46526a63816991da66705fd282ab7a4fbcd18c2e78c37d995ed2a10"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME(@lcnr): this function doesn\u0027t seem right and shouldn\u0027t exist? \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/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/traits.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"e007e8562043e58f688d2bd9ef1ab41882389fe0395cb5cc7cfcf7fe368272be"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME(@lcnr): this function doesn\u0027t seem right and shouldn\u0027t exist? \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":"compiler/rustc_trait_selection/src/traits/mod.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea65147afb75f416e9a9f067cdf66f37ab193e465e63f1f647438a3f41e65f95"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#16847): This code is non-ideal because all these subtype"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/relate/generalize.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fc4469cab4f9fa5998072c9591b054a53731397c0b7384472095397dc9daade"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#16847): This code is non-ideal because all these subtype"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_infer/src/infer/relate/generalize.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"300e595f2cc2397052b3a7515b77d2556a33ec1ebe92026df5bb715427c7359d"}},{"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/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/relate/generalize.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"858cc9a846410b072cfdd49cdc281b0565a528176821c45454956964baa0834b"}},{"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":"library/core/src/primitive_docs.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4c8731c35e53d436f7e3c036af519f019291ebe9e7a2cfafcdd2737c6c77290"}},{"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":"library/core/src/ops/try_trait.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6b2d7ec18d236f4bccecbf212d568e1b19210dca34aa7b229b8350213cbd8fc"}},{"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":"compiler/rustc_infer/src/infer/relate/generalize.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aaa7a5799139a3b2ad1b140fc0d7dc50864cbb77421acc34d2ecb540fa985ce"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(generic_const_exprs): Occurs check failures for unevaluated \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/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/relate/generalize.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"b900a5cc823f50141b78877dd1fb02cde11c5abbe4a936e19e05074cb17c4e06"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Unevaluated constants are also not rigid, so the current \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/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/relate/generalize.rs"},"region":{"startLine":641}}}],"partialFingerprints":{"codehealthFindingId/v1":"db0850b310b5352ac6389fc01e7964ec9478b8d2a8c77f2ce10bd2779bb46783"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: remove this branch once \u0060structurally_relate_consts\u0060 is fully \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/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/relate/generalize.rs"},"region":{"startLine":644}}}],"partialFingerprints":{"codehealthFindingId/v1":"28d121b13ca86b7e8f5d944f5ae711489a028c0d04f14139acdf71a6c8f23eed"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: currently we do nothing to prevent placeholders with the new universe being \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/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/relate/higher_ranked.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d004e96f14aca4a9d984aa5946fc187bfd645e88a64a95e79428dcd6db1335a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: currently we do nothing to prevent placeholders with the new universe being \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":"compiler/rustc_infer/src/infer/relate/higher_ranked.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e6ffb0a984a5f5da5f96845f9ed3b9ba5631eaea6e1b31330bee7b9b96676a8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#41044) -- not correct, need test"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/relate/lattice.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7fa803bb1d5bc9c86b6a1c5700c5de5f6902c63b3aeb3baf34e8e6ce6bd43aa"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#41044) -- not correct, need test"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_infer/src/infer/relate/lattice.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0f31a8a51ce5b471684f10e4426e23a5f7662694eaf7d879a83f7b458b7a56d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(deferred_projection_equality): This isn\u0027t right, I think? \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/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/relate/lattice.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"a644801be189e854257e849e20dcc9adf724fce403f668c2d00db2711e8c956c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This is only necessary for \u0060fn take_and_reset_data\u0060 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":"src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/region_constraints/mod.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"acc0888955ccdf884c41cb8043b882f044a21ded2db9bdf6059aee787d0a82df"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This is only necessary for \u0060fn take_and_reset_data\u0060 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":"compiler/rustc_infer/src/infer/region_constraints/mod.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"563e417990036494becb96ef82dbde70bb07b8023f7405f6f3e2a70d70b19cf3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment repeated across 12 files: The identical FixmeComment appears in 12 files (15 occurrences) \u2014 almost certainly one boilerplate line from a single migration or decision, not 15 independent debts. Fix the systemic cause once rather than file-by-file. Text: \u0022// FIXME(#120456) - is \u0060swap_remove\u0060 correct?\u0022. Source code is not a task system: track the cleanup where tasks live. (Every occurrence still counts toward the score and metrics.)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/opaque_types/table.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"82afda71d41236253503c3207e7ceacdf4547d005f306ae7acff8e7c768eb1f0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: perf problem described in #55921."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/canonical/canonicalizer.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9a41d0603e7e8b29e6be4e52173a06db20cf2f2c1c13d9cd8505d111f68d9ea"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: perf problem described in #55921."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/canonical/canonicalizer.rs"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5d96901c490d21007a248d3fd8494177a4e1c0656b99830bfd1aa1f3e77f207"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: perf problem described in #55921."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_infer/src/infer/canonical/canonicalizer.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"e00e1a1aad0737c95cba8c3a810b8788f4b82d8d7c23765e14ae5474d20c5c9e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: perf problem described in #55921."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_infer/src/infer/canonical/canonicalizer.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0bec51767b59bc70d211f75bc60a0ef3706ac2f19f0726f599885c43a8b2189"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME(-Znext-solver): This or public because it is shared with 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/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/canonical/instantiate.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"78cd1a39f25a50e3e4a8b49f4af5786730e1377c2720790ec82553df5e936c44"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME(-Znext-solver): This or public because it is shared with 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":"compiler/rustc_infer/src/infer/canonical/instantiate.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"94d0ebc53b96fd932a223527fb0183de6d14576379986be8a641f616c7325086"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We might need cache here for perf like 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/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/canonical/instantiate.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"8901246fceb61a72e862fd6eab4de16c3bd431215781bd3c7d6ec0fbcbc3b2bb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME(-Znext-solver): This is public because it\u0027s used by 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/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/canonical/mod.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"a91f2d48980d7eb0782e6d5de721ef22fea6fe662c141887e76e25f4b55bcfdf"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME(-Znext-solver): This is public because it\u0027s used by 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":"compiler/rustc_infer/src/infer/canonical/mod.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4b5b2b61e3d6c61962b3763b5413eae6813b0a6db36516197df47225d380818"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Unsized ADT. \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/tools/rust-analyzer/crates/hir-ty/src/next_solver/consts/valtree.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"637da9ecb1ade622e7f44a1a5f9a4aed8072c228761f5523ee3d1071b6b9652f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This requires \u0060adt_const_params\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/tools/rust-analyzer/crates/hir-ty/src/next_solver/consts/valtree.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdbfd33828345d6d5165aa13e96e54557ab1293876f3f2ab686346c37e9cc27d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Fn items. \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/tools/rust-analyzer/crates/hir-ty/src/next_solver/consts/valtree.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"453512f1ed39a976f5be472b1bf9fb90de382df396052ef512f355f71cb2dce6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Unsized pointers. \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/tools/rust-analyzer/crates/hir-ty/src/next_solver/consts/valtree.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"831332dd2a97dc6d4f11b65f2e8aaba81b2c4b8676682001e31dd0c9c14d680b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#17451): Switch to builtin \u0060f16\u0060 and \u0060f128\u0060 once they are stable."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/mir/eval.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bbf9fa40d215bc360c65638e94c207f3536bc52eedd46593c454fa8a8a6aa69"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This is a workaround, see the comment on \u0060interpret_mir\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/tools/rust-analyzer/crates/hir-ty/src/mir/eval.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fae40552c256375a9e0aff00a361a6f3f79ff23e57f1972e62ccfb97b460007"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This should be folded into ConstEvalError? \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/tools/rust-analyzer/crates/hir-ty/src/mir/eval.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5214ba736741e029319e3ad833a28c211c7f23e5d077caa8d8c94ad71aca92b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: Fold this into InternalError \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/tools/rust-analyzer/crates/hir-ty/src/mir/eval.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"9127e2c208589e01223ff5996e898a6b1314092684955175128e44c2124246c9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: replace parents with parts \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/tools/rust-analyzer/crates/hir-ty/src/mir/eval.rs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"78cb035f3975403995bc9da22bca3c6a096521c597c152cf403de80baff7e09f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This is workaround. Ideally, const generics should have a separate body (issue #7434), but now"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/mir/eval.rs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"be24b0399efeb9c5258a66fa2e832d5ed78073215a862830355280fde617b2d8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: there is some leak 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/tools/rust-analyzer/crates/hir-ty/src/mir/eval.rs"},"region":{"startLine":2869}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2ea7adca2e0463e64b97ff2978ed5bab4943aa862dd392171cba2e6e9d2a117"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Make this smaller, its stored in database queries \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/tools/rust-analyzer/crates/hir-ty/src/mir/lower.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"522341e609cae9d2e42e6a2d5d055fad468296974a1c97f6e860d134df5739ca"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(next-solver): Is \u0060non_body_analysis()\u0060 correct here? Don\u0027t we want to reveal opaque types defined by this body? \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/tools/rust-analyzer/crates/hir-ty/src/mir/lower.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea41d34abcc6ce986baa4f4958939356d9ab5c66e8818fad00ae7072e9a04fbf"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: make these short circuit \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/tools/rust-analyzer/crates/hir-ty/src/mir/lower.rs"},"region":{"startLine":1083}}}],"partialFingerprints":{"codehealthFindingId/v1":"838881d6462b080303f9a3bd8955db73a4755d529fadb9b3dd54ca08e813612c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Handle more than one span. \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/tools/rust-analyzer/crates/hir-ty/src/mir/lower.rs"},"region":{"startLine":1152}}}],"partialFingerprints":{"codehealthFindingId/v1":"56a1e72c5dd8e00952325ef6786f0ecb1b9bf7b01173cc86e507fc38a65ea985"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: rustc\u0027s ty is dependent on the adt type, maybe we need to do that as well \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/tools/rust-analyzer/crates/hir-ty/src/mir/lower.rs"},"region":{"startLine":1556}}}],"partialFingerprints":{"codehealthFindingId/v1":"0edb26d77cd803a04899063c286ed0c09eb03a1e78564bde0c617e2a6bd100d9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: It should never happens, but currently it will happen in some cases, not sure when exactly. \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/tools/rust-analyzer/crates/hir-ty/src/mir/lower.rs"},"region":{"startLine":1836}}}],"partialFingerprints":{"codehealthFindingId/v1":"d48c7690420a78d6767db114b7994c986a6ca854552f474c6ad606e7d27e9cb3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This can happen in fake reads. I believe this is a bug. So we change the fake read\u0027s meaning. \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/tools/rust-analyzer/crates/hir-ty/src/mir/lower.rs"},"region":{"startLine":2112}}}],"partialFingerprints":{"codehealthFindingId/v1":"a10cb71b6e77a5c1755fe16dc7b35132cc1f32d9ca29f5851f261aac6a6438e3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Do we need to fill the memory map too? \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/tools/rust-analyzer/crates/hir-ty/src/mir/monomorphization.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"567b6fe1d145ecf4e063392586ba283e277b6568ced2aebe9ad7077981d05c04"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: MIR lowering should be skipped for bodies with inference errors. Once \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/tools/rust-analyzer/crates/hir-ty/src/mir/lower/pattern_matching.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f29d46a40bb32bfc39943537749a02de85548e47231454a8158e35a80f08af5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#17451): Add \u0060f16\u0060 and \u0060f128\u0060 intrinsics."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/mir/eval/shim.rs"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd2b6c286ba50fcf29f77017abc3195831781f7114c2e8c9c820e963c18bc386"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: these rounds should be different, but only \u0060.round()\u0060 is stable now. \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/tools/rust-analyzer/crates/hir-ty/src/mir/eval/shim.rs"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"4633597a094a4eb9170506e0af9335dbc0d970c76d16bcd49c015ba32435f40b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: these rounds should be different, but only \u0060.round()\u0060 is stable now. \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/tools/rust-analyzer/crates/hir-ty/src/mir/eval/shim.rs"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"d84d05538c5c6cbc14fba9d3e5a36930c239ffda48f1f3f8503c049a3e12b732"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this is wrong for const eval, it should return 2 in some \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/tools/rust-analyzer/crates/hir-ty/src/mir/eval/shim.rs"},"region":{"startLine":814}}}],"partialFingerprints":{"codehealthFindingId/v1":"97e6fc197706634112ca2858671c1270197a109a4d1b23c5f9d7fa0d6f666481"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: signed \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/tools/rust-analyzer/crates/hir-ty/src/mir/eval/shim.rs"},"region":{"startLine":838}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fcdf871adda977c2759f57f23114d777454ee359057b64ce11f4d1f224a34ad"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: signed \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/tools/rust-analyzer/crates/hir-ty/src/mir/eval/shim.rs"},"region":{"startLine":841}}}],"partialFingerprints":{"codehealthFindingId/v1":"f771c8ca2f1ef2205d98d959be869ce67a83a32aff74a41bcbd14ae21f2bed24"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: signed \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/tools/rust-analyzer/crates/hir-ty/src/mir/eval/shim.rs"},"region":{"startLine":898}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2f3a52855ef820e210d38c2b8e798191cfbd60fb794d84e8fdafa5d7099012a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: signed \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/tools/rust-analyzer/crates/hir-ty/src/mir/eval/shim.rs"},"region":{"startLine":910}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ec7649ebe13ed2bb90699bfcf7833c1bbb3826f4dbd94c96b89485916d34890"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: signed \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/tools/rust-analyzer/crates/hir-ty/src/mir/eval/shim.rs"},"region":{"startLine":922}}}],"partialFingerprints":{"codehealthFindingId/v1":"87cd60f8db2ebd2f98d3276b0531728d17c96db6edcc39fe9eb8c89d224a809c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: signed \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/tools/rust-analyzer/crates/hir-ty/src/mir/eval/shim.rs"},"region":{"startLine":936}}}],"partialFingerprints":{"codehealthFindingId/v1":"e918d43f77da0a3b82d4a37ebebfd8ba6fec25641eb41315d6be69bd2d31aa0e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We should actually implement these checks \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/tools/rust-analyzer/crates/hir-ty/src/mir/eval/shim.rs"},"region":{"startLine":1089}}}],"partialFingerprints":{"codehealthFindingId/v1":"e58dfe468dd70a17793d58da7815b99da7b688632a4069cef556fc52095c9b1b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: wrong for manual impls of \u0060FnOnce\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/tools/rust-analyzer/crates/hir-ty/src/mir/eval/shim.rs"},"region":{"startLine":1235}}}],"partialFingerprints":{"codehealthFindingId/v1":"553817313293e02aa9786d71a3ed13f5eca588470f2ecc91b0cddfdc4f6cc9e1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Emit the lint. \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/tools/rust-analyzer/crates/hir-ty/src/method_resolution/confirm.rs"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"34bdba17ab2b4e8dbdcb4d1573c878e426794dafa9166f374abfffb60c04baa7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Emit the lint. \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/tools/rust-analyzer/crates/hir-ty/src/method_resolution/probe.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c475b47c3d44e714cb2f2c45ac2af9044e924576a1e106a29f3f727cae72c76"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Report \u0022type annotations needed\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/tools/rust-analyzer/crates/hir-ty/src/method_resolution/probe.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"c74df3c963e65e3e6e2e8493099b1f9a1f1e997c6772c04a23567c08f3200c32"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(-Znext-solver): We alternatively could check the predicates of \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/tools/rust-analyzer/crates/hir-ty/src/method_resolution/probe.rs"},"region":{"startLine":1750}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c8537129e2cadbdf2bd1b907f23345959baa816aa2463c8cc0c5926624a2316"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Need to leak-check 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/tools/rust-analyzer/crates/hir-ty/src/method_resolution/probe.rs"},"region":{"startLine":1772}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e91ea65aad2189517e65e99a82153010c47e503cde5dd8298aebf6a64ae7108"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: check the return type here 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":"src/tools/rust-analyzer/crates/hir-ty/src/method_resolution/probe.rs"},"region":{"startLine":1891}}}],"partialFingerprints":{"codehealthFindingId/v1":"8727e3296aec36ff251103ea93a296ddcfb2ef8ce3018df129827f6b580080b6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: check the return type here 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":"compiler/rustc_hir_typeck/src/method/probe.rs"},"region":{"startLine":2395}}}],"partialFingerprints":{"codehealthFindingId/v1":"59a4de1474f51fe899457f999fcad4fe897b11d87af176b8a1848d0c196ccc9a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME -- check for types that deref to \u0060Self\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/tools/rust-analyzer/crates/hir-ty/src/method_resolution/probe.rs"},"region":{"startLine":2000}}}],"partialFingerprints":{"codehealthFindingId/v1":"09efe3966c4212c81228d9e10f491bb3ee8a66e2583392c687826ff516d948d5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME -- check for types that deref to \u0060Self\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":"compiler/rustc_hir_typeck/src/method/probe.rs"},"region":{"startLine":2576}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c5adc7316a50c25aa313fd91c792ed9a1280f4421c6fe8bb9815f8ee5aa154e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME report error (ambiguous associated type) \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/tools/rust-analyzer/crates/hir-ty/src/lower/path.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"637855fc1d5d2edb054e8fbd580a962e134f4d7577c56c68fefa28de15dd7526"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME report error (ambiguous associated type) \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/tools/rust-analyzer/crates/hir-ty/src/lower/path.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"137d358f2008a7fe2d45f48f87b8e3541289d1fc3652f8a4d70a4210f2556760"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: \u0060substs_from_path_segment()\u0060 pushes \u0060TyKind::Error\u0060 for every parent \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/tools/rust-analyzer/crates/hir-ty/src/lower/path.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d54cc928dfcb2f30e0e206ee8e5c29d61337ce7ddfc2c047cf6918d191dfeb4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: \u0060substs_from_path_segment()\u0060 pushes \u0060TyKind::Error\u0060 for every parent \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/tools/rust-analyzer/crates/hir-ty/src/lower/path.rs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"31d27dd8aee24e41dee4891a817045b22c824170a5a62c71509bbf59e3f93741"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: \u0060substs_from_path_segment()\u0060 pushes \u0060TyKind::Error\u0060 for every parent \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/tools/rust-analyzer/crates/hir-ty/src/lower/path.rs"},"region":{"startLine":914}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4716f90d10a7e8f0aca5c3a7a95a9d51c5ad6724e7d0f17f7059f54abe61d06"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: report error (associated type not found) \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/tools/rust-analyzer/crates/hir-ty/src/lower/path.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc747ddd2014d7281c4e44a0642ced777d248edd73e2e68cae90daa6652665ad"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Handle other reasons. \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/tools/rust-analyzer/crates/hir-ty/src/lower/path.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"854709383d97297db54b60c0122463007d076c302bcdcb66878fc8539593d95d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: rustc generates E0107 (incorrect number of generic arguments) and not \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/lower/path.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"d09ddee32d819b5767b9ce310ea03a07acb22d5adfe59894f822f1dc8636c40d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This isn\u0027t strictly correct, enum variants may be used not through the enum \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/tools/rust-analyzer/crates/hir-ty/src/lower/path.rs"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5100c507224b5cc60dfb5b96f6583bd8a59b2cf4ca332877123d80975bb187d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Check there are other lifetimes in scope, and error/lint. \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/tools/rust-analyzer/crates/hir-ty/src/lower/path.rs"},"region":{"startLine":1108}}}],"partialFingerprints":{"codehealthFindingId/v1":"c97d9e2aeec933b4fb67131de7f1e9d90224a622085a3c0750d2d19d17b7f427"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Report a diagnostic here, rustc emits \u0060E0404: expected trait, found struct\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/tools/rust-analyzer/crates/hir-ty/src/lower/path.rs"},"region":{"startLine":1241}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cf5575fb834496a51bffd50069a6227e25ae4f9ca1c6d4fc78aed35bed61579"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: With \u0060AnonymousCreateParameter\u0060, we need to create a new lifetime parameter 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/tools/rust-analyzer/crates/hir-ty/src/lower/path.rs"},"region":{"startLine":1371}}}],"partialFingerprints":{"codehealthFindingId/v1":"70ff209d1cb4e4b022d67c071f86a184c756a9ac97fb8791ce2c846fdf864e1a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: rustc does some ABI checks here, but the ABI mapping is in rustc_target and we don\u0027t have access to that crate. \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/tools/rust-analyzer/crates/hir-ty/src/infer/callee.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"63f3b346f983e89b267b5d5b6ea26311de35cfc77cae0a253b91adb94c7e7046"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // Hack: we know that there are traits implementing Fn for \u0026F \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/infer/callee.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e9f20e8027fdfc9c35069ff0bb0725500d5c4999083a80d25905bb3e6bac9fb"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // Hack: we know that there are traits implementing Fn for \u0026F \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/callee.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbb012835be6de4357f85651c8438b7e7c661d90fb1a017d7c5a24d6e72f59ef"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK(async_closures): For async closures, prefer \u0060AsyncFn*\u0060 \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/infer/callee.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"c551fe9834bf6c400e9ba09bee427ec2610eedca0f91e4373b5ca735dd4af82e"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK(async_closures): For async closures, prefer \u0060AsyncFn*\u0060 \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/callee.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"111d7a3166ca52712af2677f9642e82680e865513a7df0036e4612487f126d5e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Actually lower the expression as 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/tools/rust-analyzer/crates/hir-ty/src/infer/callee.rs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"0080a2ed61a30782b46f7822abdbca5166f61ef35edd12c5dc0ad71191a0ccc3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: evaluate and unify with the 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/tools/rust-analyzer/crates/hir-ty/src/infer/callee.rs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"a50bd4f1c086c634fac7e306092f345ca1fb3f737dba1bcc863544c736f7d893"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const_trait_impl): these arms should error because we can\u0027t enforce them \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/infer/callee.rs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffe1b28854862a128418437925f339003cbfd98ff3c1d70561a16ffbfbd3e772"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const_trait_impl): these arms should error because we can\u0027t enforce them \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/callee.rs"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"29708287de16b62023f80cd5ac4e6ac1a05f306fe6ac054ec368ac99700a59a2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We could probably actually just unify this further -- \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/tools/rust-analyzer/crates/hir-ty/src/infer/closure.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eb62e26a56ef801b0b700346c74f712450bc3518467bab17f3bbacbd0afa62e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We could probably actually just unify this further -- \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":"compiler/rustc_hir_typeck/src/closure.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe53ac66147ebf3567175a0e4fdafab7aeb33ad430642a428d5b446ba0664b3a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: lift these out into a struct \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/tools/rust-analyzer/crates/hir-ty/src/infer/closure.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c3a1cc0c6b892fdbe0d30515080bc5d6d33b003871335ecf77e95e0f6537fc3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Report diagnostics. \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/tools/rust-analyzer/crates/hir-ty/src/infer/closure.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"31a5c0f28b58305ec0ce64202b557bf4b8a9cfddf97992fad5d6ec734d07feb7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We may want to elaborate here, though I assume this will be exceedingly rare. \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/tools/rust-analyzer/crates/hir-ty/src/infer/closure.rs"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eb0abfb986b1add54f84a9822a9cd308b0c2388da3030bc9496d249a43c6a65"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We may want to elaborate here, though I assume this will be exceedingly rare. \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":"compiler/rustc_hir_typeck/src/closure.rs"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea666642b72213a6cbd925762321fa714430cb1d0436a9219b3e1451fdbad1e9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We probably should store this signature inference output in a way \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/tools/rust-analyzer/crates/hir-ty/src/infer/closure.rs"},"region":{"startLine":694}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9151f9cc85623f6975ab3443f9b6c614fe7d0734110bb880f525616081f5dc4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We probably should store this signature inference output in a way \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":"compiler/rustc_hir_typeck/src/closure.rs"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c583ee37f0a66ef8986b8fd06c0b33e64eb863ad804ffd6d5534d7e675319e9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#45727): As discussed in [this comment][c1], naively"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/infer/closure.rs"},"region":{"startLine":898}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ee4a77025b7ecebb6657d13f8dd84d07e038b1bd1d35e5137b4fb6323d97468"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#45727): As discussed in [this comment][c1], naively"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/closure.rs"},"region":{"startLine":785}}}],"partialFingerprints":{"codehealthFindingId/v1":"102d13365a58952c72b73057bcedeb385b9651958ab8f37ac7e8d4163e1ec566"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: def id needs to be changed? \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/tools/rust-analyzer/crates/hir-ty/src/infer/closure.rs"},"region":{"startLine":1164}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fc9ddb2e96ba1e5ec593403702047e37c1a8b41f76a846f97d750609fe9c8c7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Target 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":"src/tools/rust-analyzer/crates/hir-ty/src/infer/coerce.rs"},"region":{"startLine":1453}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f154792f394beff23c1e6bb9df0a4d12fc8104703a4961336e8f216d0191272"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We don\u0027t fallback correctly since this is done on \u0060InferenceContext\u0060 and we only have \u0060InferCtxt\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/tools/rust-analyzer/crates/hir-ty/src/infer/coerce.rs"},"region":{"startLine":1576}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba33b2419dc073b72b71a7b6729bb302d57d7272f516ca2936076f1133b7ad36"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: structurally normalize? \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/tools/rust-analyzer/crates/hir-ty/src/infer/coerce.rs"},"region":{"startLine":1649}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d2acc8a54829318fc1d08fcadd71595f7ebadabdc01666c6d5cd5e54afd05ba"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: structurally normalize? \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":"compiler/rustc_hir_typeck/src/coercion.rs"},"region":{"startLine":2257}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f087e01097f478818234e18c995dd2e205f47e25b116b7f6fd83fd6495f61d9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(tschottdorf): this is problematic as the HIR is being scraped, 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/tools/rust-analyzer/crates/hir-ty/src/infer/expr.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"a69bccf837e08bc23aa1b2ff1d46880ec8662b47926cfee1bf8d0b9fd5634377"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(tschottdorf): this is problematic as the HIR is being scraped, 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":"compiler/rustc_hir/src/pat_util.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad9bcd19eb1e29df1f6136847d83fd125f25228da90cf14a9f6e33f915bd86f1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: \u0060sym\u0060 should report for things that are not functions or statics. \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/tools/rust-analyzer/crates/hir-ty/src/infer/expr.rs"},"region":{"startLine":850}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec7397f590d2c57c8605eae0c12ddfae623f18b9c67f816fbe5543e72da248cb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Emit an 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/tools/rust-analyzer/crates/hir-ty/src/infer/expr.rs"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"879963dcafdf872225b0e24a5d50453a4667333f7650545e0a0b754332a3451a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Emit an 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/tools/rust-analyzer/crates/hir-ty/src/infer/expr.rs"},"region":{"startLine":2012}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dea415997910e45a8b33f57b4b9979c62c398f4f9dc505ebf5ad2d6a537147c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Emit an 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/tools/rust-analyzer/crates/hir-ty/src/infer/pat.rs"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"72861cd80a970b648d9b4ef9a6d4888ce7fcc6d33ade556b8c899bd64d020885"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Emit an 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/tools/rust-analyzer/crates/hir-def/src/expr_store/lower.rs"},"region":{"startLine":3273}}}],"partialFingerprints":{"codehealthFindingId/v1":"b721f92368e4827f2548e6db9f2ca670fea0f887c28a9394677c9460705081a0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Emit an 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/tools/rust-analyzer/crates/hir-def/src/expr_store/lower.rs"},"region":{"startLine":3296}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfdabd551e7ec482e0803fa9525e51cb22a52b295fd09bdd3f6af9aac34edaff"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Emit an 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/tools/rust-analyzer/crates/hir-def/src/expr_store/lower/format_args.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"148b9f8ca165bae1f94d92b2a4f9286c87d0a11a9246a66e7309a676ec588504"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Emit an error: missing fields. \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/tools/rust-analyzer/crates/hir-ty/src/infer/expr.rs"},"region":{"startLine":1075}}}],"partialFingerprints":{"codehealthFindingId/v1":"18946f75d0b05d563cc6ca942cb468df0420ffe7f5b93a669f4dfb684f6508be"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Emit an error: missing fields. \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/tools/rust-analyzer/crates/hir-ty/src/infer/expr.rs"},"region":{"startLine":1167}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4bd5f82a8844143c16d4216bf4c66d7afed46560eb1f4ac6fb00e87d0fb1c1f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We are currently creating two branches here in order to maintain \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/tools/rust-analyzer/crates/hir-ty/src/infer/expr.rs"},"region":{"startLine":1079}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b9d68fcfc92e319f53dc6183a6062a96a31f92b87848756c96aa6c3b06ed28d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We are currently creating two branches here in order to maintain \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":"compiler/rustc_hir_typeck/src/expr.rs"},"region":{"startLine":2172}}}],"partialFingerprints":{"codehealthFindingId/v1":"963ad51f15cbd1d20f21669811f59457dae634cc9485307fe0eb42906e9558ec"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(tschottdorf): don\u0027t call contains_explicit_ref_binding, which \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/tools/rust-analyzer/crates/hir-ty/src/infer/expr.rs"},"region":{"startLine":1226}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7df1a2fd6a1d0a226bd269766503a469e55af59de5b99d77fdbea7c5ffc09c2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(tschottdorf): don\u0027t call contains_explicit_ref_binding, which \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":"compiler/rustc_hir_typeck/src/_match.rs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"90f998aabf4d31d9718eddc1b2b7521e61f7141355c251a1a6db61808b14f25b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Do it here like 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/tools/rust-analyzer/crates/hir-ty/src/infer/expr.rs"},"region":{"startLine":1339}}}],"partialFingerprints":{"codehealthFindingId/v1":"15cd6180ceb87caae51b055d3afcc469ae811b381e8ab7f25da590e0df5ad63c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: the element expectation should use \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/tools/rust-analyzer/crates/hir-ty/src/infer/expr.rs"},"region":{"startLine":1368}}}],"partialFingerprints":{"codehealthFindingId/v1":"445b32031b91f25f85831242eed1d698d432b124ab66c917248aeaf6289deeb5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: the element expectation should use \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":"compiler/rustc_hir_typeck/src/expr.rs"},"region":{"startLine":1727}}}],"partialFingerprints":{"codehealthFindingId/v1":"5446dd0b5ae0877ac0edaf18d055d8c3b2fee8df2f81aaf51e34dcca5d2a8b08"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Merge this diagnostic into UnresolvedField? \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/tools/rust-analyzer/crates/hir-ty/src/infer/expr.rs"},"region":{"startLine":1689}}}],"partialFingerprints":{"codehealthFindingId/v1":"99facb4d19a43268fdc197876dce6d69e384e5f7ca8d0f360b4414f3bb148b9c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Using fresh infer vars for the method args isn\u0027t optimal, \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/tools/rust-analyzer/crates/hir-ty/src/infer/expr.rs"},"region":{"startLine":1724}}}],"partialFingerprints":{"codehealthFindingId/v1":"128d81ca78a893336bd40630640ba3cd95f5cd70dbd27cc5fdb8eb37ada4b70e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: rustc does the following, but given this is only relevant when the unstable \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/tools/rust-analyzer/crates/hir-ty/src/infer/fallback.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"825f2f77f5d081832b9ef14bc2cfa02de214720a020468ce26f64267780e79d3"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK(eddyb) Bypass checks due to reborrows being in \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/infer/op.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"493832119e824383764b4a12d016204496f5f256ee275fc1fe35dd0b982306af"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK(eddyb) Bypass checks due to reborrows being in \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/op.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f3f6e732c07e57b3dcc52233e7f136e95fa03ea6dd1815f2641690bba8e504c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Report diagnostic. \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/tools/rust-analyzer/crates/hir-ty/src/infer/op.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"a134cbf396d7d35369d838294d52588c8d35368f938494af2e26328ccd333786"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This should not use a dummy span. \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/tools/rust-analyzer/crates/hir-ty/src/infer/opaques.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"43a3d40638ff9b3904a4a488b9ab563132fdf748326a2b23ab537cbaaf1f3baf"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This should not use a dummy span. \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/tools/rust-analyzer/crates/hir-ty/src/infer/unify.rs"},"region":{"startLine":780}}}],"partialFingerprints":{"codehealthFindingId/v1":"28e4d13fa496ac7965d7198325db3bef7735a4813877174cb4f82d03b58ebd95"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(deref_patterns): If \u0060deref_patterns\u0060 stabilizes, it may make sense to move \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/tools/rust-analyzer/crates/hir-ty/src/infer/pat.rs"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"270fef600cafdb4a4a4272ff6722538a5d8b711c665e6050cf224c64b3ed0c4b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(deref_patterns): If \u0060deref_patterns\u0060 stabilizes, it may make sense to move \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":"compiler/rustc_hir_typeck/src/pat.rs"},"region":{"startLine":732}}}],"partialFingerprints":{"codehealthFindingId/v1":"287e00238fbec962c5a7f77b6ad5c3942cd389c0775374251dddd43ababafc4a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(deref_patterns): If box patterns and deref patterns need to coexist, box \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/tools/rust-analyzer/crates/hir-ty/src/infer/pat.rs"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"30cbe3db6c890f477a2f64ed25956272c948ca5900f0fbf49482edb72ee35009"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(deref_patterns): we\u0027ll get better diagnostics for users trying 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/tools/rust-analyzer/crates/hir-ty/src/infer/pat.rs"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b247dafd0906a2545ce2488c083d2e039b112dcd713e099c44bcc80a80e196a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(deref_patterns): we\u0027ll get better diagnostics for users trying 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":"compiler/rustc_hir_typeck/src/pat.rs"},"region":{"startLine":878}}}],"partialFingerprints":{"codehealthFindingId/v1":"54d25ebce8534c5668f5d6a7ca6a0e62a2a0f47a851ecccbbc76096b37ebb35a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(ref_pat_eat_one_layer_2024_structural): If we already tried \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/tools/rust-analyzer/crates/hir-ty/src/infer/pat.rs"},"region":{"startLine":1421}}}],"partialFingerprints":{"codehealthFindingId/v1":"fed2be2d40bf601bfaaf256518230b9413ae49fbec8dc948c9c482a6f379053f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(ref_pat_eat_one_layer_2024_structural): If we already tried \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":"compiler/rustc_hir_typeck/src/pat.rs"},"region":{"startLine":2863}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f4c6c622e0614a511b61738e6f0bf6cc2b8c07be73fecde3a95e5a9bdc17368"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(ref_pat_eat_one_layer_2024_structural): If this results in 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/tools/rust-analyzer/crates/hir-ty/src/infer/pat.rs"},"region":{"startLine":1455}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e9e932266f30c3774d5aa866d495b28317c93304a450f3e13822b754a93b9e6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(ref_pat_eat_one_layer_2024_structural): If this results in 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":"compiler/rustc_hir_typeck/src/pat.rs"},"region":{"startLine":2895}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e979be9d8a8ffd1089b758046b03256d44edef5aadf80b22d6cf03bb20f5ed8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: report error, invalid Self reference \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/tools/rust-analyzer/crates/hir-ty/src/infer/path.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"f73abcb6d7de369b738d5f665861a461c38f6f81e334225c10a169ccd0493227"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: report error, unresolved first path segment \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/tools/rust-analyzer/crates/hir-ty/src/infer/path.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed653b31c8f7221d5ab0783ff6f6368303abb9c9879e0a8ab16ac4c2fd2b2af2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#18741) -- this is almost but not quite the same as the"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/infer/place_op.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"61d3f3331dfa093ec6c75b6b206818271a4d6f3f0c6684a84ac0429306ec5c7a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#18741) -- this is almost but not quite the same as the"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/place_op.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"e815485095b1e8c5d6018509e3c2314b5f7fb46c47abf0073e1d02e11bf98010"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(trait-system-refactor-initiative#231): we may want to treat"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/infer/place_op.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"eda5d78c16442294af992a76dc9874d63a2a2a45b068907714f5cb077b836ec0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(trait-system-refactor-initiative#231): we may want to treat"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/place_op.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"c085b4c1e1937bc20e5156eb302ec1455139e6e0f07680123116fbb9c7a88c7f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: rustc does not use the type of \u0060index_expr\u0060 with the following explanation. \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/tools/rust-analyzer/crates/hir-ty/src/infer/place_op.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a992182c44dae974cdd45917e75853a66ffe040f8bb88310adfe5b6782925b5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(next-solver): Handle \u0060goals\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/tools/rust-analyzer/crates/hir-ty/src/infer/unify.rs"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a0335cb75b48800f3806d4ac2eb9df78273e908b718893060b679c8106c51ed"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: Rename this to indicate the borrow is actually not immutable. \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/tools/rust-analyzer/crates/hir-ty/src/infer/closure/analysis.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"4686c0a6fe3dd5e55613d3d7173daf27d4c76c1e8b30c84b8cafa140f933cdbd"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: Rename this to indicate the borrow is actually not immutable. \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":"compiler/rustc_middle/src/ty/closure.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"96fe3cac34bc5af69af64021d5fcad413b7f6849fe9b57f6227d0950bf4aa5a5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(async_closures): This could be cleaned up. It\u0027s a bit janky that we\u0027re just \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/tools/rust-analyzer/crates/hir-ty/src/infer/closure/analysis.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"a09e9b985cc73807b7e449087b18e098a8baa187112136063471b557b0defd06"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(async_closures): This could be cleaned up. It\u0027s a bit janky that we\u0027re just \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":"compiler/rustc_hir_typeck/src/upvar.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b5cc00774606dc8952410f55d8a8db4929a8107f175ca2520a08ffc1bf9e0ad"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Insert coroutine stalled predicates, this matters for MIR. \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/tools/rust-analyzer/crates/hir-ty/src/infer/closure/analysis.rs"},"region":{"startLine":939}}}],"partialFingerprints":{"codehealthFindingId/v1":"95ca2699823e6183137ab42bd5e8b5335c98a68945ca62132483ab7aea78880a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //         // FIXME: throwing away the param-env :( \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/tools/rust-analyzer/crates/hir-ty/src/infer/closure/analysis.rs"},"region":{"startLine":944}}}],"partialFingerprints":{"codehealthFindingId/v1":"80e8bf97b74b3643fbab62773e47a91b9ce1592181c8026cbee4cca597ca4c24"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We should use the edition from the closure expr. \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/tools/rust-analyzer/crates/hir-ty/src/infer/closure/analysis.rs"},"region":{"startLine":1569}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1514c940e64467fdfbc15e730111448277830435927ed92fb6642a7fa98cbf7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: \u0060ExprUseVisitor\u0060 has an entirely different opinion on what \u0060FakeRead(ForLet)\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/tools/rust-analyzer/crates/hir-ty/src/infer/closure/analysis/expr_use_visitor.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cf3903a9ec3c9675127f179e49fab58a1af411ac901825a6cea4afcf6ac06b0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: \u0060ExprUseVisitor\u0060 has an entirely different opinion on what \u0060FakeRead(ForLet)\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":"compiler/rustc_middle/src/mir/syntax.rs"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"b06ae803a02c127e9b1b81b03d21fd0f569043edb4d095a7b276a6ad809249b2"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: this could be a fake pattern corresponding to a deref inserted by match \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/infer/closure/analysis/expr_use_visitor.rs"},"region":{"startLine":887}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8b36d405ea97ae9dc39858e48c9fe47e93ff4c1dc3ddff62e4114ceddc48c44"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: this could be a fake pattern corresponding to a deref inserted by match \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/expr_use_visitor.rs"},"region":{"startLine":887}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d6dc80ad661664568fdb7b6da3f57322cd32545288f4678f2e7d3b35c7a5bca"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Does the MIR code skip this read when matching on a ZST? \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/tools/rust-analyzer/crates/hir-ty/src/infer/closure/analysis/expr_use_visitor.rs"},"region":{"startLine":970}}}],"partialFingerprints":{"codehealthFindingId/v1":"2584c4c673145ae197623ea172e025890e80eb23378e917be92c98d7a14ef05c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Does the MIR code skip this read when matching on a ZST? \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":"compiler/rustc_hir_typeck/src/expr_use_visitor.rs"},"region":{"startLine":911}}}],"partialFingerprints":{"codehealthFindingId/v1":"963f866f155011fb2bd6ec28a9592216a8a8418d1deb75618dea4cf274704b9a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: What if the type being matched only has 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":"src/tools/rust-analyzer/crates/hir-ty/src/infer/closure/analysis/expr_use_visitor.rs"},"region":{"startLine":987}}}],"partialFingerprints":{"codehealthFindingId/v1":"690c6323b7e120b68e2d6a5bca1551ee6971230ead0664aa240b7e42521877a9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: What if the type being matched only has 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":"compiler/rustc_hir_typeck/src/expr_use_visitor.rs"},"region":{"startLine":932}}}],"partialFingerprints":{"codehealthFindingId/v1":"99688306fe19bef6fbaab59f1f9f4f7ea01380105afcc446bd7d3efdfab17318"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME(never_patterns): update this comment once the aforementioned MIR builder \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/tools/rust-analyzer/crates/hir-ty/src/infer/closure/analysis/expr_use_visitor.rs"},"region":{"startLine":1739}}}],"partialFingerprints":{"codehealthFindingId/v1":"faa0c918d94aa586e8ad7482597af51a3904f0e7fd2d57e2db15bcdc46edb633"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: To consider, ref and dyn trait lifetimes can be omitted if they are \u0060\u0027_\u0060, path args should \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/tools/rust-analyzer/crates/hir-ide/src/display.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e846a355f0f0b4f9e7b6470893cc357f2cb4f7d76c111a910b5e4931ea51e76"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Also named lifetimes may be rendered in places where their name is not in scope? \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/tools/rust-analyzer/crates/hir-ide/src/display.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"62a7785389009cc0198fa4ea8bb13b58a319bd783cb574984d492e2559bf15da"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We shouldn\u0027t use \u0060param.id\u0060, it should be removed. We should know 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/tools/rust-analyzer/crates/hir-ide/src/display.rs"},"region":{"startLine":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"af391ffb12b10f4025202f5b6d62528b0c79475256f795aa93783248c00b7a12"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#17451): Replace with builtins once they are stabilised."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ide/src/display.rs"},"region":{"startLine":847}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf615c28bc395c1d8988a62547152efe692b8dfc8d19457c453e9360e57ad4ef"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#17451): Replace with builtins once they are stabilised."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ide/src/display.rs"},"region":{"startLine":866}}}],"partialFingerprints":{"codehealthFindingId/v1":"1954ef31b04308ec51f15706f0521320964527fd6d2df7b6612d8e53342e358e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#17451): Replace with builtins once they are stabilised."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ide/src/display.rs"},"region":{"startLine":1120}}}],"partialFingerprints":{"codehealthFindingId/v1":"e239c81a82ebbfc6c5de4e249645c07db5a2cee6f3dcbdf94cbcbdd549ddd6ec"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#17451): Replace with builtins once they are stabilised."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ide/src/display.rs"},"region":{"startLine":1139}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ab0547dd2d3e52f6ade458abc6c9bdc87687be94cbfd9191656d81bbdd1be22"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: ADTs, requires \u0060adt_const_params\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/tools/rust-analyzer/crates/hir-ide/src/display.rs"},"region":{"startLine":1200}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbcfcc9d16243f0a1dd5a3435a79a28f0de9bdb817126f7dee7fab10bfe87bdd"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: no_std Cfg? \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/tools/rust-analyzer/crates/hir-ide/src/display.rs"},"region":{"startLine":1475}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b8c5d1870e15b7e2566aa575bad6fb7a6b041f69b6e7a991e25c0e0743d11c4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: it would maybe be good to distinguish this from the alias type (when debug printing), and to show the substitution \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/tools/rust-analyzer/crates/hir-ide/src/display.rs"},"region":{"startLine":1520}}}],"partialFingerprints":{"codehealthFindingId/v1":"507e46717ada18b7b3d358ecdcef7ef605990913c45fe7977b9def94cb631699"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We should not access \u0060param.id\u0060, it should be removed, and we should know 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/tools/rust-analyzer/crates/hir-ide/src/display.rs"},"region":{"startLine":1662}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fdde7cb07870145b56264456ae81801b3d74d58e3056d474d261ccc4123e11f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This is not correct, really. But I\u0027m not sure how we can from the ty representation \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/tools/rust-analyzer/crates/hir-ide/src/display.rs"},"region":{"startLine":2278}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f5ddedd53ca46387653dc911f4c5f431a0c3973e98d62b43724c285ebd0dbf6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: should use the dependency name instead if available, but that depends on \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/tools/rust-analyzer/crates/hir-ide/src/display.rs"},"region":{"startLine":2707}}}],"partialFingerprints":{"codehealthFindingId/v1":"d031dea44c34a32a772c56808b167f4ba1459f4e2cc0e114111ec2c6ac722b38"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Deduplicate this with hir::Local::sources(). \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/tools/rust-analyzer/crates/hir-ide/src/tests/closure_captures.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"2443ad9bb37de0f478316b3b9d09b1f535ef79907f69a32e904e030cd36d570b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(next-solver): We could learn more from the \u0060\u0026S\u0060 -\u003E \u0060\u0026dyn Foo\u003Ci8, _\u003E\u0060 coercion if we followed the rustc 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":"src/tools/rust-analyzer/crates/hir-ide/src/tests/coercion.rs"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb1d29ae0ac6719dd361a9a63ce2723382132a69f379a3989fa2461d2d60273a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: rustc emits the following error 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/tools/rust-analyzer/crates/hir-ide/src/tests/coercion.rs"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba7bd015c329a0be7b4bfa846eba962bd826bf15c790e3799eeab93c49a4a438"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We should also report \u0060SizedSelf\u0060 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/tools/rust-analyzer/crates/hir-ide/src/tests/dyn_compatibility.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"90abde6ef704c385e43ea07fd57716e4da1003c55cc3f63c73ada89c0cce866c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(next-solver): does this test make sense with fast 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":"src/tools/rust-analyzer/crates/hir-ide/src/tests/incremental.rs"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3c7301e926a04e2d4015062743b8493704e30eaba4923e2dea4c5f1e54d763f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: What does this test check for now? trait_solve_shim is no longer a query \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/tools/rust-analyzer/crates/hir-ide/src/tests/incremental.rs"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"3149e6280c8e78d354232a1307ba9f9c9be3c05740a2b835cc095b41b9d4f512"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#17451): Add \u0060f16\u0060 and \u0060f128\u0060 once they are stabilised."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ide/src/tests/layout.rs"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"89e51a32f18477760f5474a8d2069c4022b06103b8bd97e8f9b668d24f7e163c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this test current now do nothing \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/tools/rust-analyzer/crates/hir-ide/src/tests/macros.rs"},"region":{"startLine":1052}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffe52a53e400366e45929ea8b62fd1f34d5c904fe19fa894cdc50083708e5688"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME, type mismatch should not occur \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/tools/rust-analyzer/crates/hir-ide/src/tests/method_resolution.rs"},"region":{"startLine":2053}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9e92b5bbf634c488149f0abbe9b780bde4e37b39e8faebd6daebc8fa9778d2d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This isn\u0027t nice, but I guess as long as we don\u0027t hang/crash that\u0027s fine? \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/tools/rust-analyzer/crates/hir-ide/src/tests/regression.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a5ae511a4a8d119881bed4517a41a9ec9308262e3393d89c7feb4a311aee5c6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(next-solver): Though \u0060Repeat: IntoIterator\u0060 does not hold here, we \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/tools/rust-analyzer/crates/hir-ide/src/tests/regression.rs"},"region":{"startLine":815}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0148bcb9a523cf57881134e7f9bb0ee6a3cd1f33e3fc5bdb7487355d97f2bdd"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(next-solver): it would be nice to be able to hint \u0060IntoIterator::IntoIter\u003C()\u003E\u0060 instead of just \u0060{unknown}\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/tools/rust-analyzer/crates/hir-ide/src/tests/regression.rs"},"region":{"startLine":1276}}}],"partialFingerprints":{"codehealthFindingId/v1":"d185a56e5a3823377cb56ba450e06061be67618dc858873f2b035269965f58f7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(next-solver): \u0060\u0026\u0027? str\u0060 in 231..262 seems suspicious. \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/tools/rust-analyzer/crates/hir-ide/src/tests/simple.rs"},"region":{"startLine":1985}}}],"partialFingerprints":{"codehealthFindingId/v1":"8011fb23489e099ea0644896dbcf1597e1a558ff01bc3423571eb3feb5050c50"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME make check_types work with other bodies \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/tools/rust-analyzer/crates/hir-ide/src/tests/traits.rs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecb7bc6e423a25742e1c27b7b412547e916b1024c84db59cb7b45a200a91b4cd"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: the last function (\u0060fn i()\u0060) is not valid Rust as of this writing because you cannot \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/tools/rust-analyzer/crates/hir-ide/src/tests/traits.rs"},"region":{"startLine":4230}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a66959569c9025933a328771aee03f125204b6106b2b77db8f6233d1258c2e5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: reconsider how to treat these invalid 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/tools/rust-analyzer/crates/hir-ide/src/tests/traits.rs"},"region":{"startLine":4275}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d4e9d38b484efdecefc0df5f9ce9bded922cecee8712be0c743235649ddbc77"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: All annotation should be resolvable. \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/tools/rust-analyzer/crates/hir-ide/src/tests/traits.rs"},"region":{"startLine":4417}}}],"partialFingerprints":{"codehealthFindingId/v1":"98b7cc0700faf3c31c8cc633c9d1cc3e1a7d407208bfc6250c65e7635039dcbf"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: All annotation should be resolvable. \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/tools/rust-analyzer/crates/hir-ide/src/tests/traits.rs"},"region":{"startLine":4453}}}],"partialFingerprints":{"codehealthFindingId/v1":"854d99af14b98c9bee5ab73d1d231f4e9d367577c872f8c400afcd9d8beb0cb9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Remove the comments once stabilized. \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/tools/rust-analyzer/crates/hir-ide/src/tests/traits.rs"},"region":{"startLine":4419}}}],"partialFingerprints":{"codehealthFindingId/v1":"87aef09a8b937157e5aa6cd308ba6a4f7bdd675ea04f59ea24536692a37edb9e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Remove the comments once stabilized. \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/tools/rust-analyzer/crates/hir-ide/src/tests/traits.rs"},"region":{"startLine":4455}}}],"partialFingerprints":{"codehealthFindingId/v1":"491a9f789ab135cb5892191a933ce274e3b8e04e6ff42f6be0804e150b511be3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(next-solver): Was \u0060\u003CD as Deserializer\u003C\u0027de\u003E\u003E::Error\u0060 but now getting error lifetime. \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/tools/rust-analyzer/crates/hir-ide/src/tests/traits.rs"},"region":{"startLine":4991}}}],"partialFingerprints":{"codehealthFindingId/v1":"681b3916087f9fbeb22c6529079e4d70925d41035ab9a9cf9c579f8958beb405"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: RPITs have variance, but we can\u0027t treat them as their own thing right now \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/tools/rust-analyzer/crates/hir-ide/src/tests/variance.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"2986dd8a6429976aca75274bf1d58892788b76b85255aefc0fb74a8eeeaec99a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: replace this function with panic when that works \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/tools/rust-analyzer/crates/hir-ide/src/tests/mir/eval.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"849d2fe48099d17763d193bfe0e352f2f65c87e49858b62f695052031d68d6b9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: replace this function with panic when that works \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/tools/rust-analyzer/crates/hir-ide/src/tests/mir/eval.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"30748f8d495e03f4fb2812e1c0021f7922bd85b40bb811704c63f1b4379ec5a8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: replace this function with panic when that works \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/tools/rust-analyzer/crates/hir-ide/src/tests/mir/eval.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbc341f29d7e07ef31ecf9c1b35e22ef09343bdee8861212a76e8f3790729256"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: replace this function with panic when that works \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/tools/rust-analyzer/crates/hir-ide/src/tests/mir/eval.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb899c2fab6ba599722caa453a8dc0f316f4c123a9a4257e1c28890363822941"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: replace this function with panic when that works \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/tools/rust-analyzer/crates/hir-ide/src/tests/mir/eval.rs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c845867747bcbfb6898ef10747015bed5e4df4eeb8f380efefa0f99d98c7772"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: replace this function with panic when that works \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/tools/rust-analyzer/crates/hir-ide/src/tests/mir/eval.rs"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"212c74593b5e37cb9b8ec91d650923ea3ded32274c1f52e5730aa86c71902151"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: replace this function with panic when that works \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/tools/rust-analyzer/crates/hir-ide/src/tests/mir/eval.rs"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"872a3f2e489021abfef653733b62d0e134fcff73928ecddfc3443cad0418c2c8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: replace this function with panic when that works \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/tools/rust-analyzer/crates/hir-ide/src/tests/mir/eval.rs"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"d45a17498b895d301b40a82cec4cd5f8b8a8c5addece434fed5d56fc506e7627"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: replace this function with panic when that works \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/tools/rust-analyzer/crates/hir-ide/src/tests/mir/eval.rs"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"28cbb59ad8e4f9c322988426d12560f06822c4c71a2ef37eb8361504cecf3153"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: replace this function with panic when that works \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/tools/rust-analyzer/crates/hir-ide/src/tests/mir/eval.rs"},"region":{"startLine":784}}}],"partialFingerprints":{"codehealthFindingId/v1":"838246c64ee6f6951cd97ac636068d18b2196af8bd9111cd80a1c23a4b95a9d4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: replace this function with panic when that works \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/tools/rust-analyzer/crates/hir-ide/src/tests/mir/eval.rs"},"region":{"startLine":886}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac82b8d2df93ef7890d3c5ee203f76e7d48da24ed03b13c52c2c4c817a9e2d3b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: replace this function with panic when that works \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/tools/rust-analyzer/crates/hir-ide/src/tests/mir/eval.rs"},"region":{"startLine":915}}}],"partialFingerprints":{"codehealthFindingId/v1":"e03bb023d29c9e4ea48fac80d4aa5841ad8b97f4cfb888af31a2861d8c5478b6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this should be 3 \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/tools/rust-analyzer/crates/hir-ide/src/tests/mir/eval.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aeafd44a0c516d3ae174db5d6f4ad8c8ad9f55c72d1efb02ab89fa7c57e13fa"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: These tests currently fail, because rust-analyzer hasn\u0027t yet implemented the changes \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ide/src/tests/layout/closure.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"c031bfe90e696904a3a30b83ce6ac65e6fdef40e9c992ad88e7ef17d77d6e48e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: These tests currently fail, because rust-analyzer hasn\u0027t yet implemented the changes \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ide/src/tests/layout/closure.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2166dadd9d6e22aedd8b1cba55adb14243a64b655cb77d0be98caa7f267889c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#17451): Add \u0060f16\u0060 and \u0060f128\u0060 tests once intrinsics are added."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ide/src/tests/consteval/intrinsics.rs"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"c333858137c1097ff27070b92a4f8e5a6e55f2cf7676d8c9ef4a1dd167f59a55"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this should be an \u0060expect\u0060, but that currently results in \u0060lint_expectation_unfulfilled\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/tools/rust-analyzer/crates/hir-ide/src/tests/consteval/intrinsics.rs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ad6a8b1bfe071d31d5fe5d0051a3243919895c4b1c02e7f3fcf67d544f6a366"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: only look at source_map if we do have missing fields \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/tools/rust-analyzer/crates/hir-ide/src/diagnostics/decl_check.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"d347e7df5989ff885d78842bbd05060bd30acd365de56b38f073fe158018e32e"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Only look at sources if we do have incorrect names. \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/tools/rust-analyzer/crates/hir-ide/src/diagnostics/decl_check.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"90b9ecf8aaf3a642b34dea611302652945eac8368e7f1ee69a8d487a11d2a49d"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Only look at sources if we do have incorrect names. \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/tools/rust-analyzer/crates/hir-ide/src/diagnostics/decl_check.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"cff8faab0ab17743b4093a9fb59fae39918931868c9c4a1faf194b5a127197e4"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: only look at sources if we do have incorrect names \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/tools/rust-analyzer/crates/hir-ide/src/diagnostics/decl_check.rs"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"0106cce1bcbb86cd8799dfdefbcf50284da3b208aeda13984035c2afa8a3634f"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: only look at sources if we do have incorrect names \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/tools/rust-analyzer/crates/hir-ide/src/diagnostics/decl_check.rs"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c2a2967d7ca1cb7a3c4fd1a85565aa2ecc10a9175216736cd10382f6020a953"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Due to shortcomings in the current type system implementation, only emit \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/tools/rust-analyzer/crates/hir-ide/src/diagnostics/expr.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"9edf032baa51f44ac8d3e9f60465a9f706a0ef99b7d1227ae5bdb482dec58bda"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME we should use the type checker for this. \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/tools/rust-analyzer/crates/hir-ide/src/diagnostics/expr.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"77e0ac59fe39eec8d4370a0a76ecf9aff2a876c5aa16161bea6ed5f32a0cb24e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME Report unreachable arms \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/tools/rust-analyzer/crates/hir-ide/src/diagnostics/expr.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9342ae81d50c7ce0225d8c2a7da77f6a9d553ebc7abc3f2ee78c899b1a5730b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: for now, only bool literals are 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":"src/tools/rust-analyzer/crates/hir-ide/src/diagnostics/match_check.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f1361f9f5643025b70bac1f1e6c099f8df88ba5f614a443521cbb5417f43a25"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX(iDawer): Collecting pattern adjustments feels imprecise to me. \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/tools/rust-analyzer/crates/hir-ide/src/diagnostics/match_check.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"31730d886ac52f13f8417112ea007d4c0e71cdc8cdde9b1864881eccf820d1e2"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX(iDawer): field lookup is inefficient \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/tools/rust-analyzer/crates/hir-ide/src/diagnostics/match_check.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"528dd271e8ad84eccf58bcaf885902373fdffeef8f1647b3b24a6b3689edd65d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This needs to be the edition of the span of each call. \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/tools/rust-analyzer/crates/hir-ide/src/diagnostics/unsafe_check.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"0602bf1655fb41c4490a1a51c9c5535b494cefd4420b01240fbcae8839857de0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(deref_patterns): This could report an error comparable to the one 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/tools/rust-analyzer/crates/hir-ide/src/diagnostics/match_check/pat_analysis.rs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"2013084a6b6f6e0a2b3d1aa678ead83400dbc0e2158ff3f5eb78fda8423d3368"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We only report a single error inside of eager expansions \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/tools/rust-analyzer/crates/hir-expand/src/eager.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d310a68b4f5ac33375e01a2bfd67f8ed96fa6d8f59922dc613effaa6f677553"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We discard parse errors 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/tools/rust-analyzer/crates/hir-expand/src/eager.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"20840143dda1c25ef1c90bcce1f54d465828391a466d3886e3cce74a15401ead"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Figure out an API that makes proper use of ctx, this only exists 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/tools/rust-analyzer/crates/hir-expand/src/files.rs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d2769a3d4e5765b35a42dd16145268768db5465353a8820d9aaa1ba15b9bdf7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Figure out an API that makes proper use of ctx, this only exists 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/tools/rust-analyzer/crates/hir-expand/src/files.rs"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e3d4881c40ca967225e1aeb13054af67ec879f03fa3d4f914d2d6747d5a4acd"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This heuristic is brittle and with the right macro may select completely unrelated nodes? \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/tools/rust-analyzer/crates/hir-expand/src/files.rs"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"3875471e05799a0c37bf66d89f6a09639597417df262c55fe0e03c6590ced19d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: should probably instead check that it\u0027s a valid punctuation character \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/tools/rust-analyzer/crates/hir-expand/src/fixup.rs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"58c05ba6594b16daac7561b4f78e70053dfb4b81c490940d65df8798ddd52da6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: https://github.com/rust-lang/rust-analyzer/pull/12937#discussion_r937633695"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-expand/src/fixup.rs"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4eabb4817b210ad495732a7deadb70c0a14a71f09b4730608abfcc7d37e66d3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Move this into the span crate? Not quite possible today as that depends on \u0060MacroCallLoc\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/tools/rust-analyzer/crates/hir-expand/src/hygiene.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1d628a5844a357924183d61f8c3c4984d924c24626db39cc024073bf52e560d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This can be \u0060true\u0060 once we always use \u0060tcx.is_diagnostic_item\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/tools/rust-analyzer/crates/hir-expand/src/inert_attr_macro.rs"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"925144fabeb6406f7fab8bec4b4bb4cb0ac37ee1cc032e8774b82e804c60229a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This is being interned, subtrees can vary quickly differing just slightly causing \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/tools/rust-analyzer/crates/hir-expand/src/lib.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"e674aae12d561d86bc2d5ea1a1b6f0651b758ffe7d08c2b4fa644443c7024160"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This shouldn\u0027t be here, we can derive this from \u0060invoc_attr_index\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/tools/rust-analyzer/crates/hir-expand/src/lib.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5f2bdfeb16bb1d4cc7c397016f3fef57e365a8249e2e3b2e847bd7b5cac8b2a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We should verify that the parsed node is one of the many macro node variants we expect \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/tools/rust-analyzer/crates/hir-expand/src/lib.rs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"1438e9e4f2dff76cf4421ea5ca3e36916adf2e9ecb3a592839c725fb11e2adca"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We should report both errors! \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/tools/rust-analyzer/crates/hir-expand/src/lib.rs"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"feea5a9fd13b5667968f8891975beeed5150a6220675d41d066619dc415d5f4f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(stmt_expr_attributes) \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/tools/rust-analyzer/crates/hir-expand/src/lib.rs"},"region":{"startLine":1147}}}],"partialFingerprints":{"codehealthFindingId/v1":"b04c5eb72896c0b97c76a58205448e84d0d6af3c674fcdd738a1a1d106d37548"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: should be the range of the macro name, not the whole derive \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/tools/rust-analyzer/crates/hir-expand/src/lib.rs"},"region":{"startLine":1240}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb49736062210c460d75eb995c5e5c2166c17f30a29d98b29e1a170a1728083c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: handle \u0060cfg_attr\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/tools/rust-analyzer/crates/hir-expand/src/lib.rs"},"region":{"startLine":1243}}}],"partialFingerprints":{"codehealthFindingId/v1":"e24f3dd55d97969c78b7e93984fd8a7b98abb3b9f10635c91feab653ed6a4e0b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: can be expensive to create, we should check the use sites and maybe replace them 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/tools/rust-analyzer/crates/hir-expand/src/lib.rs"},"region":{"startLine":1281}}}],"partialFingerprints":{"codehealthFindingId/v1":"17d9969c39ef46e586139bc5a1d0240dd6fe9c9b34b33b745896460c5a064811"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Consider adding a reverse map to ExpansionInfo to get rid of the linear search which \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/tools/rust-analyzer/crates/hir-expand/src/lib.rs"},"region":{"startLine":1316}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c004ff87ff10436acfec09c7982de659b3c255aef0c28a0d250a91f58f52163"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This is only public because of its use in \u0060load_cargo\u0060 (which we should consider removing \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/tools/rust-analyzer/crates/hir-expand/src/lib.rs"},"region":{"startLine":1475}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad953222808e0d4b13777b1bbb5d7839cbf107da170e69245609a9fee71a4c8e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: macros in statement position are treated as expression statements, they should \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/tools/rust-analyzer/crates/hir-expand/src/lib.rs"},"region":{"startLine":1520}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb41cea974b5edfe69b2cdbf76403b0f23f6403ceb8b424285cab50ba552dea5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Can we remove this 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":"src/tools/rust-analyzer/crates/hir-expand/src/mod_path.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"6635e814784e2b96d6ae323107886602f10fa149050477cf3166214039a50098"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This is only a guess and it doesn\u0027t work correctly for \u0060macro_rules!\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/tools/rust-analyzer/crates/hir-expand/src/mod_path.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"81a3a68c01c38dba3570798e2d202fa7939d061cea272aae68a96daeb3d83505"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This is only a guess and it doesn\u0027t work correctly for \u0060macro_rules!\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":"compiler/rustc_resolve/src/lib.rs"},"region":{"startLine":2382}}}],"partialFingerprints":{"codehealthFindingId/v1":"7338d68651e8f2f1c67732a70f9711bf745aa9f236581146227d9dfa314f1d13"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This needs to go once we have hygiene \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/tools/rust-analyzer/crates/hir-expand/src/name.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"bec50c09cb98bf7def57581b6bd245ad0000417d01cfcd4262b5050a7121f4db"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This should take a database argument to hide the interning \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/tools/rust-analyzer/crates/hir-expand/src/name.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbde94c979723ee52fa1b0b57a050127dab320584b0384263d0c32fa4ba816ca"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Remove this in favor of \u0060display\u0060, see fixme on \u0060as_str\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/tools/rust-analyzer/crates/hir-expand/src/name.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"7229b5bed1f799d405005a6553d600c473ebc2996859dc01c57c9bef484d07fc"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: \u0027\u0060static\u0060 can also be a label, and there it does need escaping. \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/tools/rust-analyzer/crates/hir-expand/src/name.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"181e9b3478d71980351a1d28304b7d7bcd910e07eecefc9eafe647ff0b9e6dca"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Can we avoid the string allocation 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/tools/rust-analyzer/crates/hir-expand/src/proc_macro.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"603381085e746075b81013cf259b4298e1e38b020e2240f56bdbb634742ef4a7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Is it correct for us to only take the span at the start? This feels somewhat \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/tools/rust-analyzer/crates/hir-expand/src/span_map.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"800299e0d55c2d58971162be9c83167b0985d3a7025efe2e8aee4259563a742a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This whole thing needs a refactor. Each derive requires its special values, and the result is a mess. \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/tools/rust-analyzer/crates/hir-expand/src/builtin/derive_macro.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d5ef4b89a50bb8b72c89c8a6190b51acbb5804c6a553738a7bb7ff337997f19"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: RA purposefully lacks knowledge of absolute file names \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/tools/rust-analyzer/crates/hir-expand/src/builtin/fn_macro.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bc6b863da499bc6b334cff4af5ed2cb301f9e7fbade46aa15924b41686203ca"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Record allow_internal_unstable in the macro def (not been done yet because 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/tools/rust-analyzer/crates/hir-expand/src/builtin/fn_macro.rs"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"91ede404f789e5ad7fb1ff03da49e2e3414388fc9d66998895506e4e7f7edb48"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: hack on top of a hack: \u0060$e:expr\u0060 captures get surrounded in parentheses \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/tools/rust-analyzer/crates/hir-expand/src/builtin/fn_macro.rs"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1f06d5debb1d4fc08e0757796c9f7263a5d1ec40426c94c763596ee6d74af0d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Ignored like env!(\u0022NAME\u0022, \u0022compile_error message\u0022) \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/tools/rust-analyzer/crates/hir-expand/src/builtin/fn_macro.rs"},"region":{"startLine":782}}}],"partialFingerprints":{"codehealthFindingId/v1":"94ef19272bc154a0cda772842885e2c820ef3214276d49bfbd4c2a3f823a8738"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We wrap expression fragments in parentheses which can break this expectation \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/tools/rust-analyzer/crates/hir-expand/src/builtin/fn_macro.rs"},"region":{"startLine":798}}}],"partialFingerprints":{"codehealthFindingId/v1":"a76603f189f040f73e63f076b33b960b01d74e8907eda00be6a7d36a9e2bbabf"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Parse errors \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/tools/rust-analyzer/crates/hir-expand/src/builtin/fn_macro.rs"},"region":{"startLine":842}}}],"partialFingerprints":{"codehealthFindingId/v1":"92139309ccf781654c2a79fe59545782a1aebd6d3350a0903e61512a6699ffec"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: actually read the file here if the user asked for macro expansion \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/tools/rust-analyzer/crates/hir-expand/src/builtin/fn_macro.rs"},"region":{"startLine":866}}}],"partialFingerprints":{"codehealthFindingId/v1":"af7c101e48b22764cf14397b4d67b807eb6190d87f64b0469ac2920c79b9352b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: we\u0027re not able to read excluded files (which is most of them because \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/tools/rust-analyzer/crates/hir-expand/src/builtin/fn_macro.rs"},"region":{"startLine":890}}}],"partialFingerprints":{"codehealthFindingId/v1":"050993beaa7c5167e116d40eec51bb55b80af8d2431717ee18520acbecc30a80"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Not all puncts are handled \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/tools/rust-analyzer/crates/hir-expand/src/builtin/quote.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0f91c23fb0a0bb92bf45eeef5d79cb2e2b3a18ae32ca724a51bc84d8f1486b0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: \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/tools/rust-analyzer/crates/hir-expand/src/builtin/quote.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"46c10cf525f460118a6680cf80ae4f48be8bbd13324140e210f7886d3ff2227a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: \u0060IS_TEST\u0060 and \u0060IS_BENCH\u0060 should be based on semantic information, not textual match. \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/tools/rust-analyzer/crates/hir-def/src/attrs.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eae63a7408dd12693398dfa9d2dce5885d10ffb39c6f47fce9bc04b8fcc57bd"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: /// XXX: AST Nodes and SyntaxNodes have identity equality semantics: nodes 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":"src/tools/rust-analyzer/crates/hir-def/src/dyn_map.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"069fb6130c6d25bd20b0b70d0404a24afaff6fda018c892be116e2ad56122439"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Change \u0060node_\u0060 prefix to something more reasonable. \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/tools/rust-analyzer/crates/hir-def/src/expr_store.rs"},"region":{"startLine":1133}}}],"partialFingerprints":{"codehealthFindingId/v1":"63687f389a3b01088a587695d4188ff1d0cf72fc7cbf746bcda60fb300cb7d45"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We could have multiple applicable names here, but we currently only return the first \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/tools/rust-analyzer/crates/hir-def/src/find_path.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"99c70573b7b6d24a9b66abe2ddf39a0d5db9a4966aba14180246677aa421931a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: we should guide this to look up the path locally, or from the same crate again? \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/tools/rust-analyzer/crates/hir-def/src/find_path.rs"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf1344328878fb4a434feecf39f1e8c124a807d3eabca706b2315d60678dda28"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: cache the \u0060find_local_import_locations\u0060 output? \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/tools/rust-analyzer/crates/hir-def/src/find_path.rs"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"a26ec12cfc2f14f76532f6939d1fb1facbc041b5632a6e6176dd01f2930891fb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#17451): Use builtin types once stabilised."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/hir.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"81976ec206769e5b6786235b5acdabf654ae5ef2de3dd4a504665a804256f093"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This should check all import infos, not just the first \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/tools/rust-analyzer/crates/hir-def/src/import_map.rs"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0c6dac74c0311e9d73112a81c7cdc3e87b759551ae79da4489670ffa73a864f"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: The rendered paths are relative to the defining crate. \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/tools/rust-analyzer/crates/hir-def/src/import_map.rs"},"region":{"startLine":802}}}],"partialFingerprints":{"codehealthFindingId/v1":"f37e3d779eb13dbcdde7928079f6d738e3195c0d7656f2125d640f1bfa4e95f4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Macro shadowing in one module is not properly handled. Non-item place macros will \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/tools/rust-analyzer/crates/hir-def/src/item_scope.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"c30622729d40dfcaa9f966b4989dd2041f168ec4cfacbc238b45f8e80e860d83"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: shadowing \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/tools/rust-analyzer/crates/hir-def/src/item_scope.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"d74f602397b894ae3e15bb8f902288df4f9af92ccab18b51bccc592817e069eb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: shadowing \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/tools/rust-analyzer/crates/hir-def/src/nameres/path_resolution.rs"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"10a666458952203dc24bf5542e0a321d9f5a051333d9add3e7cc5d0bf94758e9"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: /// XXX: this is O(N) rather than O(1), try to not introduce new usages. \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/tools/rust-analyzer/crates/hir-def/src/item_scope.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"994a6f6d9c7b3a0ab216dfc2c093ea61cda49608d10fd95033d55fad70823d3c"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: /// XXX: this is O(N) rather than O(1), try to not introduce new usages. \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/tools/rust-analyzer/crates/hir-def/src/item_scope.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a4d566927426a3b264e712c505e79691037722409acf707b31d1551cdd1be06"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This is only used in collection, we should move the relevant parts of it out of ItemScope \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/tools/rust-analyzer/crates/hir-def/src/item_scope.rs"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b3967b668ceba5fc3c209a8db92debd2ca0d7d12b7dfe84b353eac8b3e5996c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Document and simplify this \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/tools/rust-analyzer/crates/hir-def/src/item_scope.rs"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"da1ed055b75e331608ceee0b8b1510b55d2ffc821b24abb88410d175bc113b09"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Would be nice to encode \u0060None\u0060 into this \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/tools/rust-analyzer/crates/hir-def/src/item_tree.rs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"1feb160d8f84c681169f4ea88416a403723a5b9f7c5e8db90292b7c5946ed883"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Should we remove this? \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/tools/rust-analyzer/crates/hir-def/src/lang_item.rs"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"229f5d26dd1273ff8815127f48b7a00335d671bbbcbf8ea7403105f6231cd63a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(swatinem): the following lang items are used for async lowering 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":"src/tools/rust-analyzer/crates/hir-def/src/lang_item.rs"},"region":{"startLine":931}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae61c523e0eb3d7b9bd3f07e60318b409dee5ffee572971ec51f109be7de8dee"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(swatinem): the following lang items are used for async lowering 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":"compiler/rustc_attr_ir/src/lang_items.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c38377cdece770c82abc8b6f5e562d8f98c136f3ecaa6ac6239caa8a35272ef"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Store this as an erased \u0060salsa::Id\u0060 to save space \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/tools/rust-analyzer/crates/hir-def/src/lib.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"095c1cc2a3623c33d039d858c5b72beae50350ef24c0b9893fcba1e82a863c03"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Store this as an erased \u0060salsa::Id\u0060 to save space \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/tools/rust-analyzer/crates/hir-def/src/lib.rs"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1317cc4b8760c4636803f594174477ce067e1b789740e5b8d13ea4abe500b44"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Store this as an erased \u0060salsa::Id\u0060 to save space \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/tools/rust-analyzer/crates/hir-def/src/lib.rs"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"7142adbd7cd5375e0dd9195252c06044bf900c4ad9243120a5c822d47eca4b18"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Store this as an erased \u0060salsa::Id\u0060 to save space \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/tools/rust-analyzer/crates/hir-def/src/lib.rs"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ae050018d9a1b0fbfe8e9523b41ac19cca2a234410021700c0b36465a4a9167"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: not every function, ... is actually an assoc item. maybe we should make \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/tools/rust-analyzer/crates/hir-def/src/lib.rs"},"region":{"startLine":908}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a9c66b611f7a9a76e0409ed03cdfeaced00d5336f774b7c4861d6ce22ff9f75"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Check callers of this, this method likely can be removed \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/tools/rust-analyzer/crates/hir-def/src/lib.rs"},"region":{"startLine":963}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c14eb811d63ef044240cb3d8080ad2e0f2de6b3dd5c6cc9c37a002464e40744"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: /// HACK: In order to test builtin derive expansion, we gate their fast path with this atomic when cfg(test). \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/nameres.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"664cb4d45c4217801bbde24f78a8a6a0c62604d0ed5b026a92b142942ea76e34"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: There are probably some other things that could be here, but this is less severe and you \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/tools/rust-analyzer/crates/hir-def/src/nameres.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"42af9b89f09884363565d65357779266b8a04ecb42195f01ac009777d0c8a644"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Figure out a better way for the IDE layer to resolve these? \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/tools/rust-analyzer/crates/hir-def/src/nameres.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ecf146a7ac23a41facc638010d812a909f687b3e7b16f0b4947267d241f2d53"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this can use some more human-readable format (ideally, an IR \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/tools/rust-analyzer/crates/hir-def/src/nameres.rs"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0316f6402a95a3026eb2882153f52ea3d9a09bbabe3078812b2618b3abd77d6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: should we provide \u0060self\u0060 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/tools/rust-analyzer/crates/hir-def/src/resolver.rs"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"e17c427fcc89b3f4a9a1c668a0d6ae57f2f94cd2aa45503f6f34af3825193dd8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(trait_alias): Trait alias brings aliased traits in scope! Note that supertraits of \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/tools/rust-analyzer/crates/hir-def/src/resolver.rs"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"edcec46a0f81374df5479213fd47be0aae8c175c5361e4fa631d596bf63f5feb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This adds as many module scopes as there are blocks, but resolving in each \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/tools/rust-analyzer/crates/hir-def/src/resolver.rs"},"region":{"startLine":931}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b1e98b6f58cac99cf7cd6d3c3224b63ab14de5ca49aef5b14b6899437ec380e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This adds as many module scopes as there are blocks, but resolving in each \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/tools/rust-analyzer/crates/hir-def/src/resolver.rs"},"region":{"startLine":1138}}}],"partialFingerprints":{"codehealthFindingId/v1":"634cb31cb7f1200f3924c58d54a846f737e98266c9876171e6b364c5164d54d7"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: hack, account for local (and only local) shadowing. \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/tools/rust-analyzer/crates/hir-def/src/resolver.rs"},"region":{"startLine":1324}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c98e8bda16527ad14e5f8522accd45bd4e1ca4a9781d14754c599c8ac9ac400"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: handle \u0060mod\u0060 inside block expression \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/tools/rust-analyzer/crates/hir-def/src/test_db.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"adb0dee69e8f0a409d27326e6e9bd560ec62e82b28c3984ab8dbc4aa936edc40"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(trait-alias) probably needs special handling 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/tools/rust-analyzer/crates/hir-def/src/nameres/assoc.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf193ff1a6154b79284311047fcfb98b945fac64ccb27d17c0236d287ee7d2d7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Expansion 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/tools/rust-analyzer/crates/hir-def/src/nameres/assoc.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"181903c67be4cdb21256458718324646a2014f3a9ea3ca8a3461b133d8576e93"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Should error on disallowed item kinds. \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/tools/rust-analyzer/crates/hir-def/src/nameres/assoc.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"96f84324b078b8c4593cf27b9a17e5c6036d89529ad2c99628d24a7bd9386b11"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: tool modules can be shadowed by actual modules \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/tools/rust-analyzer/crates/hir-def/src/nameres/attr_resolution.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba50c1722468d89ef742c4855c4624e5ddfdf8af1d436a9418628a7af2f36552"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: There has to be a better way to do this \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/tools/rust-analyzer/crates/hir-def/src/nameres/collector.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"455c6c93b9450279ce5753fd131f3b879a91d568898447027d532f6ad88b1262"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Remove this clone \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/tools/rust-analyzer/crates/hir-def/src/nameres/collector.rs"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"c73c31440481164bc91940d8b0e8519e0e32eea0b112116d9502c45ec9c3b8f8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Report diagnostic on 404. \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/tools/rust-analyzer/crates/hir-def/src/nameres/collector.rs"},"region":{"startLine":777}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dd1cdcdd49193a638c48fc68bf4cc9e20279fcc43daf425cb52147cb846be07"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We maybe could skip this, if we handle the indeterminate imports in \u0060resolve_imports\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/tools/rust-analyzer/crates/hir-def/src/nameres/collector.rs"},"region":{"startLine":819}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2d8f94ba21c3d5ea529dd60a111368b2700baac860e3a7f855d03e1250319de"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Implement this correctly \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/tools/rust-analyzer/crates/hir-def/src/nameres/collector.rs"},"region":{"startLine":1053}}}],"partialFingerprints":{"codehealthFindingId/v1":"444bdc9df6ff83ef39b6dc034ab7e2c27efdb1acdb736bdc8a19626cd9a5ea66"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Implement this correctly \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/tools/rust-analyzer/crates/hir-def/src/nameres/path_resolution.rs"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"f92c9490197a622e98a89c2f814592ceb1fa4dabb2614dfbfe8cb5f6cc9d7c01"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Expansion 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/tools/rust-analyzer/crates/hir-def/src/nameres/collector.rs"},"region":{"startLine":1370}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9b5c2066e44687411ab013483dfe50d9cb37eb7ab7d1cd19115dc3dd38376ff"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This code is almost duplicate below. \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/tools/rust-analyzer/crates/hir-def/src/nameres/collector.rs"},"region":{"startLine":1390}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9a85683e31afa3ce621630b9ff654139b0ef5fbede6ef84264831e6b0e5495d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This is a hack. The proper way to do this is by having a chain of derive helpers scope, \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/tools/rust-analyzer/crates/hir-def/src/nameres/collector.rs"},"region":{"startLine":1738}}}],"partialFingerprints":{"codehealthFindingId/v1":"f166d701c3b82e342e0fac58bbb1d0731a7375c511a8a2c801871e128619d38e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: we shouldn\u0027t need to re-resolve the macro here just to get the unresolved 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/tools/rust-analyzer/crates/hir-def/src/nameres/collector.rs"},"region":{"startLine":1788}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0d20408888831c1df90d328fa0c220acc69d759669b07b896d859aae75793ba"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // macro name, but we assume it isn\u0027t as there\u0027s no such case yet. FIXME if \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/tools/rust-analyzer/crates/hir-def/src/nameres/collector.rs"},"region":{"startLine":2624}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfb9751638d186634a66f6cac7d5ccb70e1a25f375f08296186dcb3469fab913"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Immediately expanding in \u0022Case 1\u0022 is insufficient since \u0022Case 2\u0022 may also define \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/tools/rust-analyzer/crates/hir-def/src/nameres/collector.rs"},"region":{"startLine":2689}}}],"partialFingerprints":{"codehealthFindingId/v1":"54620f86e79fc4dfe515c78d8bfdfea2b463b59f9644054db3582926af020d9c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: if there were errors, this might\u0027ve been in the eager expansion from an \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/tools/rust-analyzer/crates/hir-def/src/nameres/collector.rs"},"region":{"startLine":2724}}}],"partialFingerprints":{"codehealthFindingId/v1":"a736b61813deba510fbe61b9557f1e58ff8ef3e467d688abb9f5c9b94a8bad03"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this test does succeed, but takes quite a while: 90 seconds 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":"src/tools/rust-analyzer/crates/hir-def/src/nameres/collector.rs"},"region":{"startLine":2822}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0b578be43b2f6649e84f03da2d41db0e37046d8c30b5c97adc56e8cd7910859"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Whats the difference between this and unresolved_proc_macro \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/tools/rust-analyzer/crates/hir-def/src/nameres/diagnostics.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f788b44aebb7c25390a8a221c9042f8206850b1fe2a6239fc930419cfb27aa2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Edition, is this rightr? \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/tools/rust-analyzer/crates/hir-def/src/nameres/mod_resolution.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c022af9c6f3e4579b87c37ec8484a4eb6e26a36e794ae8275a4a851a09fbfd4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: If the next segment doesn\u0027t resolve in the module 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":"src/tools/rust-analyzer/crates/hir-def/src/nameres/path_resolution.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d0b34f11b3de860993e3e624c3ef1d65c9b40c7e7163e048c45c0db763b7120"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Inefficient \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/tools/rust-analyzer/crates/hir-def/src/nameres/path_resolution.rs"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"71b16f375e69845925aa3963967db0e05a1e914cecaa7c39415e8216745e8c59"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Need to filter visibility here and below? Not sure. \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/tools/rust-analyzer/crates/hir-def/src/nameres/path_resolution.rs"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbb4beca74cf422a308d2025e988d6870208299376e782ea8ccb0551df621d59"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: should not expand. legacy macro scoping is not 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":"src/tools/rust-analyzer/crates/hir-def/src/nameres/tests/macros.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"39a2125db18a93bced7f5d8c9618f1e67aebd3f21d23e3906e54faa14a98b608"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: should not see \u0060NotFoundBefore\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/tools/rust-analyzer/crates/hir-def/src/nameres/tests/macros.rs"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"51f60253b4530c49640dd65b5abddddb72224c0f769a35c467d6c665bf0b6e51"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // See FIXME in \u0060ModCollector::collect_macro_call()\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/tools/rust-analyzer/crates/hir-def/src/nameres/tests/macros.rs"},"region":{"startLine":1543}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fc987300d8acc0f3e65d32137f737452425b07fa9205a4639ab5c083f3987b3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: actually expand with 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/tools/rust-analyzer/crates/hir-def/src/macro_expansion_tests/builtin_derive_macro.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"50cb9158f11688d458396336a572e02f88e74b8708c980d44262f11a6822f45f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This is the wrong expansion, see FIXME on \u0060builtin_fn_macro::use_panic_2021\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/tools/rust-analyzer/crates/hir-def/src/macro_expansion_tests/builtin_fn_macro.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5a30fd59b74f4066ec83aa1db8948472f52f8d9af74a7225a8e5beee21260b3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: The pretty printer breaks by leaving whitespace here, \u002Bsyntaxctxt is used to avoid that \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/tools/rust-analyzer/crates/hir-def/src/macro_expansion_tests/mbe.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e15e5eddc5ad46c86f3bab8916ca050e5a0b92656122add1cab5fc20cf52f35"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: I\u0027m sure there\u0027s already better way to do this \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/tools/rust-analyzer/crates/hir-def/src/macro_expansion_tests/mod.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7054ba29d425b7fc3d74acc57e258d5f0c4fde72a4cf5ba0bab2aa2b1ada9a0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this actually works OK under 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/tools/rust-analyzer/crates/hir-def/src/macro_expansion_tests/mbe/matching.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"02d9d4be3ac9062517464b74384b5fc3310203966ed2b101b8e1a8e311aa6d80"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Should this error? rustc currently accepts 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/tools/rust-analyzer/crates/hir-def/src/macro_expansion_tests/mbe/metavar_expr.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"85da002d400415c42672ddfd58615d237e84c7980c0a061f2d74c5d70bae76d4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Should this error? rustc currently accepts 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/tools/rust-analyzer/crates/hir-def/src/macro_expansion_tests/mbe/metavar_expr.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"91f86932dea35e3ac22ba80aec0574db0647147695450cc79de22efdc5eb03ef"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Should this error? rustc currently accepts 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/tools/rust-analyzer/crates/hir-def/src/macro_expansion_tests/mbe/metavar_expr.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"455bde14144859b537f60f0815dfb45066b330406ab3122be55b8586cf6a4982"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Should this error? rustc currently accepts 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/tools/rust-analyzer/crates/hir-def/src/macro_expansion_tests/mbe/metavar_expr.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"44d4b004c59829fbdc5556e5355ab5e85ce3eb7bac3815b092f6e56055c15b99"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Should this error? rustc currently accepts 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/tools/rust-analyzer/crates/hir-def/src/macro_expansion_tests/mbe/metavar_expr.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"3583f8c7b736440a581b7c7da86aa5ec0207e4051690fdbf69674e2d8679be0d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Should this error? rustc currently accepts 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/tools/rust-analyzer/crates/hir-def/src/macro_expansion_tests/mbe/metavar_expr.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"1daad5bb8fbeaaa9ff2ebb482be8fb91d684e15116958fc2b7b7c0f7301e15f4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME we should have testing infra for multi level expansion 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":"src/tools/rust-analyzer/crates/hir-def/src/macro_expansion_tests/mbe/regression.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"90de51f659a38283af9b67dcad5e60c05afc0ea92ec769195ba49953cded0a48"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: the second rule of the macro should be removed and an error about \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/tools/rust-analyzer/crates/hir-def/src/macro_expansion_tests/mbe/regression.rs"},"region":{"startLine":877}}}],"partialFingerprints":{"codehealthFindingId/v1":"71fac4c4c09104573a64f7440eab92dccf2622016599446374e14ba892adc192"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Handle \u0060global_asm!()\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/tools/rust-analyzer/crates/hir-def/src/item_tree/lower.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aa11cb321ae1aa95765afe04d03ed3dcdcc3d811fdab8d61a4e5730b867200b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: report errors somewhere \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/tools/rust-analyzer/crates/hir-def/src/item_tree/lower.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aaca85173b00ffe9e5df939bb7b8a854b090dcd067710c2ed65f322ad108629"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Diagnose \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/tools/rust-analyzer/crates/hir-def/src/hir/format_args.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d854cd0f8cdd3a2c95a75d5dc59714e55adfc83f032002a4065721a69438800"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Diagnose \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/tools/rust-analyzer/crates/hir-def/src/hir/format_args.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"8049e619cb1dc6b41c2206a54f78d96a17d615f92a6f63e5718865908ee135dc"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Diagnose \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/tools/rust-analyzer/crates/hir-def/src/hir/format_args.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e74227e1f2634cbf88dc702ed196fe387c5293b6576df7ff0958ba3b3088308"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Diagnose \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/tools/rust-analyzer/crates/hir-def/src/hir/format_args.rs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"bece875811306065340a85b3a4c3b06bafc88b4cbda10c84897e26ce890a8a7a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Diagnose \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/tools/rust-analyzer/crates/hir-def/src/hir/format_args.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0edc3bf4cd00c71bc2dd603fd49ba6069d327349ab372dcbdb489f23ae29370"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This is problematic, we might want to synthesize a dummy \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/tools/rust-analyzer/crates/hir-def/src/hir/format_args.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2f161c438f8fc18b12e7587fa463390b5ad808c82676df8e80761a1f7cf2b0f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This will lead us to show failed trait bounds (e.g. \u0060T: Display\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/tools/rust-analyzer/crates/hir-def/src/hir/format_args.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"a67090b8f653ff5205576dc1e8f688de29f3f6d72822ef6868e969bbd9d10563"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Unbox this once \u0060Idx\u0060 has a niche, \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/tools/rust-analyzer/crates/hir-def/src/hir/type_ref.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"8001e66fec6f6f17f5c299dcfa041f24015f1f55a20fb223b47b813707c6162a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: within_limit should support this, instead of us having to extract the 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/tools/rust-analyzer/crates/hir-def/src/expr_store/expander.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aa7d5ebc25fda1f9f8588ca69c5387cdb30a3225d13a953cb798bf32064c422"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: add diagnostic for missing body \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/tools/rust-analyzer/crates/hir-def/src/expr_store/lower.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"2705edb06494c81a93a9be77dfda44d57ba9a0df7fa3c31d48a6fb3cc165378f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Keyword check? \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/tools/rust-analyzer/crates/hir-def/src/expr_store/lower.rs"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"09d6e52ed6b6e1ae92f3af400ad33028fca8a937f5c7b7cf5acc3d1874b96dd6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Move some of these arms out into separate methods for clarity \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/tools/rust-analyzer/crates/hir-def/src/expr_store/lower.rs"},"region":{"startLine":1423}}}],"partialFingerprints":{"codehealthFindingId/v1":"193b7ade07be80eb959f3d12e20a6caa3054b623ea706d09e5433b0af9eb6c9e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Report an error here otherwise. \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/tools/rust-analyzer/crates/hir-def/src/expr_store/lower.rs"},"region":{"startLine":2264}}}],"partialFingerprints":{"codehealthFindingId/v1":"c09d77150b5868336f79a68920d322832dd64962fa225794cfe7daf7fdf88151"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: Rustc wraps the condition in [\u0060DropTemps\u0060] -- a construct equivalent 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/tools/rust-analyzer/crates/hir-def/src/expr_store/lower.rs"},"region":{"startLine":2389}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb13da1158fb5bf557258c1e46260c8d219fa3cd2380259be65982eeb5d6705e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: desugared exprs don\u0027t have ptr, that\u0027s wrong and should be fixed. \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/tools/rust-analyzer/crates/hir-def/src/expr_store/lower.rs"},"region":{"startLine":3562}}}],"partialFingerprints":{"codehealthFindingId/v1":"abe6a2457c82819a774afa3d7efab0340340fa4407f201ef4623b31d7e714c13"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: desugared pats don\u0027t have ptr, that\u0027s wrong and should be fixed 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":"src/tools/rust-analyzer/crates/hir-def/src/expr_store/lower.rs"},"region":{"startLine":3613}}}],"partialFingerprints":{"codehealthFindingId/v1":"76e6a0afefc536536a35f2a4ba13b25d4006f901e9d7c03e45b17d1d12943b6a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: deduplicate with \u0060HirDisplay\u0060 impl \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/tools/rust-analyzer/crates/hir-def/src/expr_store/pretty.rs"},"region":{"startLine":1260}}}],"partialFingerprints":{"codehealthFindingId/v1":"34d8faabf64e960cec53bc56e8aae03cc5d2dbce3ee7c97370ea489952dd5f30"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Make this a \u0060super let\u0060 when we have this statement. \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/tools/rust-analyzer/crates/hir-def/src/expr_store/lower/format_args.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f46098162c1dfb607eb73501d89f945971f8751c1c566b3d930c25a10e8c8e4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Make this a \u0060super let\u0060 when we have this statement. \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/tools/rust-analyzer/crates/hir-def/src/expr_store/lower/format_args.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"c272446f8d8f325c1976f05fb3feb2dba6973202232a6cccff2bc552407aed67"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Unnecessary clone \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/tools/rust-analyzer/crates/hir-def/src/expr_store/lower/path.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f323a427083c3f75d0286e8de7d5e16f0fdf844012357581dd733325aa9e600"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this bottom up traversal is not too precise. \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/tools/rust-analyzer/crates/hir-def/src/expr_store/lower/path.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c469933f5d34d7b75b475f04b48c13d98a99fef728aa6419c509b875f136758"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Map the text between escapes. \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/tools/rust-analyzer/crates/hir-def/src/attrs/docs.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"10f62f343d144c13929dee4965d7ca601c38dcbaf4c3ac0564a2d6832ba2cda4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: resolve type aliases (which are not yielded by iterate_path_candidates) \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/tools/rust-analyzer/crates/hir/src/attrs.rs"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9ba586074685978cdb04428fbbf76a59becdb222ea457c7a22fd4764abf4d25"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this is not how we should get a mod path 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/tools/rust-analyzer/crates/hir/src/attrs.rs"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e72f5673f56dff48175ef3d10f362c937b9d2ce952f0e2e41e2b205d18528de"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Split this off into the corresponding 4 rustc errors \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/tools/rust-analyzer/crates/hir/src/diagnostics.rs"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca2287415f6df1bbb1b0ad83f26b34a121338441ca3d9315c8570874ec5e799b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: maybe we actually want slightly different ranges for the different macro diagnostics \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/tools/rust-analyzer/crates/hir/src/diagnostics.rs"},"region":{"startLine":761}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d48eee1b24eff83555e14eb6ecc4017a5e438728a8975d5effd8101be1752d3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Once we diagnose the inputs to builtin derives, we should at least extract those diagnostics 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":"src/tools/rust-analyzer/crates/hir/src/diagnostics.rs"},"region":{"startLine":973}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd791b885eb1fd444f0c656437932680ef5401b73e69a26f861b2e3fc30108e7"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: When specialization is enabled in the current crate, and there exists \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir/src/diagnostics.rs"},"region":{"startLine":1101}}}],"partialFingerprints":{"codehealthFindingId/v1":"7625e98f38b32d03b6afa14613f02d67138de80961c9d2366e65cc6b8d3c9ca8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This is accidentally quadratic. \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/tools/rust-analyzer/crates/hir/src/diagnostics.rs"},"region":{"startLine":1163}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ba7d1a8b2e0762e50dda773a1ea5b9f232f09ec7a8a7c9a441aa9711f2c02d8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Missing unsafe and body validation should be defined for any \u0060InferBodyId\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/tools/rust-analyzer/crates/hir/src/diagnostics.rs"},"region":{"startLine":1274}}}],"partialFingerprints":{"codehealthFindingId/v1":"29644aa97589bb80e8d47bbd21edcc443819704dad6fcc516ba960c03747819d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Here and elsewhere in this file, the \u0060expr\u0060 was \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/tools/rust-analyzer/crates/hir/src/diagnostics.rs"},"region":{"startLine":1291}}}],"partialFingerprints":{"codehealthFindingId/v1":"3200c1065579cd9a5e4c9887b9c1db3dde1c18ba8215084ec40cd93fde3b3927"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Printing the const to string is definitely not the correct thing 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/tools/rust-analyzer/crates/hir/src/diagnostics.rs"},"region":{"startLine":1843}}}],"partialFingerprints":{"codehealthFindingId/v1":"73500d5b85878c013502cf8d170ba4a64310199c3994f5eb2e619268bf7f07a7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This will show \u0060unsafe\u0060 for functions that are \u0060#[target_feature]\u0060 but not unsafe \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/tools/rust-analyzer/crates/hir/src/display.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c6efaf845b9f5b216aef85af67e3942b6d05b2fa8cd972a6f68e64a9bcd7846"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Use resolved \u0060param.ty\u0060 once we no longer discard lifetimes \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/tools/rust-analyzer/crates/hir/src/display.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcaa57151f20e2a8a596654c4e53cce472725fe6a412dab62d6081c0a16a90ff"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Render repr if it\u0027s set explicitly? \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/tools/rust-analyzer/crates/hir/src/display.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"938f47514b9e8a31dc9e9dc9534c2234aa85e9c01153ab732d4d0c88b1e6860a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(trait-alias) needs special handling to print the equal sign \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/tools/rust-analyzer/crates/hir/src/display.rs"},"region":{"startLine":909}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c4799407c25a1ca6988d3378472cfdd2c42f2354cb9c9bb7968a1c8d96414bb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This is here since some queries take it as input that are used \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/tools/rust-analyzer/crates/hir/src/lib.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"507432e80af3dd0109444ebf14ba745c0d6dd699dc047a31007150c91d8e1225"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Properly encapsulate mir \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/tools/rust-analyzer/crates/hir/src/lib.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8413c0eab95e9407ed20ea70870d7c3f5ea0edf71058dffb577bf4e90eff99a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: These are needed for import assets, properly encapsulate them. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir/src/lib.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aec608b78e02efae13d5fe7b58c6b322025db31e1c51e5c5ecb0b8d6263a448"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: RawVisibility::Public doesn\u0027t need to construct a resolver \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/tools/rust-analyzer/crates/hir/src/lib.rs"},"region":{"startLine":886}}}],"partialFingerprints":{"codehealthFindingId/v1":"efad207e7dce8cc3901a99b7179a4502af3a7035ab4c4498f30df842ff6072ec"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This does not account for replacing \u0060Self\u0060. Do we really need that? \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/tools/rust-analyzer/crates/hir/src/lib.rs"},"region":{"startLine":1531}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fad8d062b4160bf41762f21afb9aaacdd87b8f0edd0fae1d9a3c8f98e68cc65"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This does not account for replacing \u0060Self\u0060. Do we really need that? \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/tools/rust-analyzer/crates/hir/src/lib.rs"},"region":{"startLine":1552}}}],"partialFingerprints":{"codehealthFindingId/v1":"977aa3a88ebdaa74666fadcd656039a50bf891fd66dfe614482a4d341fde3a3f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This parses! \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/tools/rust-analyzer/crates/hir/src/lib.rs"},"region":{"startLine":3259}}}],"partialFingerprints":{"codehealthFindingId/v1":"8752a61325c56a0ebc0b3cbef56488c93f54728b91f7243b91d9206185d727c1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: this only lists trait bounds from the item defining the type \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/tools/rust-analyzer/crates/hir/src/lib.rs"},"region":{"startLine":3622}}}],"partialFingerprints":{"codehealthFindingId/v1":"21cde839c5611829f40df138b7803fd23d98b9a78e1603d18fb75093e15ed646"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This shouldn\u0027t be \u0060instantiate_identity()\u0060, we shouldn\u0027t leak \u0060TyKind::Param\u0060s. \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/tools/rust-analyzer/crates/hir/src/lib.rs"},"region":{"startLine":3725}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb1c46aea481dac3e7ba22eaa2df55efe36df2281d44ce933378da6e10b22cc2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Figure out if this is correct wrt. match ergonomics. \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/tools/rust-analyzer/crates/hir/src/lib.rs"},"region":{"startLine":4313}}}],"partialFingerprints":{"codehealthFindingId/v1":"a937d98d0b2341d9e0275a22c2fb6f5740fa44f7b57fa40634033836685056ab"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: What do when we unify two different crates? Currently we just randomly keep 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":"src/tools/rust-analyzer/crates/hir/src/lib.rs"},"region":{"startLine":4371}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6038e31d67c18ddf37143783ded2ae94513f062fed07a226c32fd9872c370e9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Find some way with const params, maybe even lifetimes? \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/tools/rust-analyzer/crates/hir/src/lib.rs"},"region":{"startLine":4540}}}],"partialFingerprints":{"codehealthFindingId/v1":"de66beb824f5aea194c9db57df4a605ca6eae0f65b4e53a615ba7d5c0cc82645"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This is the same as \u0060remove_ref()\u0060, remove one of these 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/tools/rust-analyzer/crates/hir/src/lib.rs"},"region":{"startLine":4842}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8308b7b28ea88a5d6d7533237c0a7829cec2e518fc78eb4517a20d497633ff1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Find better API that also handles const generics \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/tools/rust-analyzer/crates/hir/src/lib.rs"},"region":{"startLine":4967}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cedf709c316d758dfc67ca428e0afef905d7ede0910c4237a7063766c26372d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We don\u0027t handle GATs yet. \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/tools/rust-analyzer/crates/hir/src/lib.rs"},"region":{"startLine":5020}}}],"partialFingerprints":{"codehealthFindingId/v1":"24c1ff42cd011a4a3336c740af8c652dfcb25aa6739a84994c03903d135b067a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We should probably remove this. \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/tools/rust-analyzer/crates/hir/src/lib.rs"},"region":{"startLine":5182}}}],"partialFingerprints":{"codehealthFindingId/v1":"7298ccb6aacaae5463a385fe259e87063c82af5fd6f0a8ccccc202e099a1716d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Document this \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/tools/rust-analyzer/crates/hir/src/lib.rs"},"region":{"startLine":5809}}}],"partialFingerprints":{"codehealthFindingId/v1":"739bcdb1678357ee232c324c2afcf66c66e9925335923adce95203b12b1ccbfe"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: handle block expressions as modules (their parent is in a different DefMap) \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/tools/rust-analyzer/crates/hir/src/lib.rs"},"region":{"startLine":6293}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ef85efd787ac26d406448dfabef0856047f0f3054f48cc61982937676b059ea"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We probably don\u0027t want to expose this. \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/tools/rust-analyzer/crates/hir/src/lib.rs"},"region":{"startLine":6601}}}],"partialFingerprints":{"codehealthFindingId/v1":"63af82306f690daf3ddb735d91cd4103d2d6ac78a410d9a5e680bf7bfbf35369"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Rethink 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/tools/rust-analyzer/crates/hir/src/semantics.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f1004df6a50d11906e566c5954ad92c55b2f110c24954fc80acec5097762bbc"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Rethink 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/tools/rust-analyzer/crates/hir/src/semantics.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ed852098480c8a9305f195738d9c572fbad976fd9f0cc8dcbfcb92ccd3729d5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Rethink 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/tools/rust-analyzer/crates/hir/src/semantics.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5de66a75c922f127443e0bbf0e70518b4b146e9d7e5032e820611284426c993"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We filter our builtin derive \u0022fake\u0022 expansions, is this correct? Should we still expose them 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":"src/tools/rust-analyzer/crates/hir/src/semantics.rs"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d8037ef076ee18c15a5f7d5cbc709b5d9e5f3acbc7d2d2133308ae485942a9c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Type the return type \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/tools/rust-analyzer/crates/hir/src/semantics.rs"},"region":{"startLine":863}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9ef5a81ca897b3f6b0b4f8bf56a1404799afde5d7fbbd5d982fb046d5c6fe00"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Type the return type \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/tools/rust-analyzer/crates/hir/src/semantics.rs"},"region":{"startLine":886}}}],"partialFingerprints":{"codehealthFindingId/v1":"b01ec10b28ae32defb99eacee152610d0e9e6ae9fc87271e170cb2a7f4bde113"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Remove this in favor of \u0060check_for_format_args_template_with_file\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/tools/rust-analyzer/crates/hir/src/semantics.rs"},"region":{"startLine":868}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0407770923bc5b6e3f3ed114042c6e6e9067ab17771b1d8d04a4252a9768b74"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: the trivia skipping should not be necessary \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/tools/rust-analyzer/crates/hir/src/semantics.rs"},"region":{"startLine":1014}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7d5c298c998972ef3a68465d9fe7c845cb564ba61d831c964aed2fe0495f6a4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This might work incorrectly when we have a derive, followed by \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/tools/rust-analyzer/crates/hir/src/semantics.rs"},"region":{"startLine":1303}}}],"partialFingerprints":{"codehealthFindingId/v1":"951c6b0fcafe37a5abc6b0e32ae5c2f05e8e9d72980fa639d71be7e45e863020"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: here, the attribute\u0027s text range is used to strip away all \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/tools/rust-analyzer/crates/hir/src/semantics.rs"},"region":{"startLine":1326}}}],"partialFingerprints":{"codehealthFindingId/v1":"6625ebdb79fdecef159039434bf5806df61cfb78d06777cf058781ec0b027a7f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Should cfg_attr be handled differently? \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/tools/rust-analyzer/crates/hir/src/semantics.rs"},"region":{"startLine":1338}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c1dd85d98f0378afd2403f0c913e37a54facc3296093ce9b166850b4afb52d3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We need to call \u0060f\u0060 for all of them as well though! \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/tools/rust-analyzer/crates/hir/src/semantics.rs"},"region":{"startLine":1372}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccd4b0013ebc91e4a3ed48c9903ac4df3b80e0fd11c039c4a7f99b622b004b4b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We need to call \u0060f\u0060 for all of them as well though! \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/tools/rust-analyzer/crates/hir/src/semantics.rs"},"region":{"startLine":1508}}}],"partialFingerprints":{"codehealthFindingId/v1":"092a83a6893a00ee4cb1fc284040ceae320fb4fafd276e839b1132ba098acc2f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Replace with \u0060ancestors_with_macros_file\u0060 when all usages are updated. \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/tools/rust-analyzer/crates/hir/src/semantics.rs"},"region":{"startLine":1614}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9439408bb8fc58d64fd89eb930473e2146c7a82a8949c49134adb3fcdddf3d8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Should we handle unknown mutability better? \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/tools/rust-analyzer/crates/hir/src/semantics.rs"},"region":{"startLine":1745}}}],"partialFingerprints":{"codehealthFindingId/v1":"f47066f5a5f50bb1c54f95eea01811a29cf7fb20fa7dee88a6c516802c322bd6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Handle lifetimes 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/tools/rust-analyzer/crates/hir/src/semantics.rs"},"region":{"startLine":1753}}}],"partialFingerprints":{"codehealthFindingId/v1":"54e6618730385f1c7dbba297d1c6cda667082acfc22e5f2c4353393663f779ca"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: better api for the trait environment \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/tools/rust-analyzer/crates/hir/src/semantics.rs"},"region":{"startLine":1822}}}],"partialFingerprints":{"codehealthFindingId/v1":"065a915d14364240e4b30b6834695ce02919980a2f98b4581aef6d893389a615"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Remove this from https://github.com/rust-lang/rust-analyzer/pull/22449#discussion_r3299763452"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir/src/semantics.rs"},"region":{"startLine":1950}}}],"partialFingerprints":{"codehealthFindingId/v1":"df39c5ed4e8407e43d151265da02b7cebd975c12102e6b62d6ed24441ddfda8e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Replace this with \u0060resolve_macro_call2\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/tools/rust-analyzer/crates/hir/src/semantics.rs"},"region":{"startLine":1959}}}],"partialFingerprints":{"codehealthFindingId/v1":"19896d5c65de0f38d3b3e862f63668ac28ab8c69033647ef32612cd8b83037e3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Do we need to care about inline modules for macro expansions? \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/tools/rust-analyzer/crates/hir/src/semantics.rs"},"region":{"startLine":2135}}}],"partialFingerprints":{"codehealthFindingId/v1":"f35d3c3f7d37be419abd5915062a8c85a6d97bb773d4aabe78125c3234bc7908"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: source call should go through the parse cache \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/tools/rust-analyzer/crates/hir/src/semantics.rs"},"region":{"startLine":2167}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a13f19749baf0cbe71f34636b72af68b1efb2ef9ccd4adcb9ef3c6fa8a7bbda"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME This can\u0027t be the best way to do this \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/tools/rust-analyzer/crates/hir/src/semantics.rs"},"region":{"startLine":2607}}}],"partialFingerprints":{"codehealthFindingId/v1":"adc6efd13a226942fb6449d9d94f5980a6da107ee9f67c75ece0ab799d37d8bc"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This is a weird function, we shouldn\u0027t have this? \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/tools/rust-analyzer/crates/hir/src/semantics.rs"},"region":{"startLine":2736}}}],"partialFingerprints":{"codehealthFindingId/v1":"c490ab952df8c7f980f0aa88d5c9e7337311cb3ae732e22ec3d225b26dfa85d8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Is this correct here? Anyway that should impact mostly diagnostics, which we don\u0027t emit 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/tools/rust-analyzer/crates/hir/src/source_analyzer.rs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ed710291db6a73ddbd7cc825adb124451cc57c1a612fed5331aa01a19952cd6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This is an approximation, perhaps we need to store a set of diverging exprs in inference? \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/tools/rust-analyzer/crates/hir/src/source_analyzer.rs"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"54918335438980bc77e85761e0680b0652f1aadcd19b4c2220a638550bb5a35c"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: subst for \u0060poll()\u0060 coincides with that for \u0060Future\u0060 because \u0060poll()\u0060 itself \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir/src/source_analyzer.rs"},"region":{"startLine":847}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf49b14df184dd15cc71c0ed43664e8fa52e9bbe05323fc3dddd281868e26ffe"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: subst for all methods coincides with that for their trait because the methods \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir/src/source_analyzer.rs"},"region":{"startLine":881}}}],"partialFingerprints":{"codehealthFindingId/v1":"6362304604b546f4119c4812cd405e17bf70658049ea499c5e2903606a039995"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: subst for all methods coincides with that for their trait because the methods \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir/src/source_analyzer.rs"},"region":{"startLine":908}}}],"partialFingerprints":{"codehealthFindingId/v1":"0493c8dd9a3dff914b3d036daaacb7a64ab8e02885f5fe131bc60caff64b3b59"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: subst for \u0060index()\u0060 coincides with that for \u0060Index\u0060 because \u0060index()\u0060 itself \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir/src/source_analyzer.rs"},"region":{"startLine":925}}}],"partialFingerprints":{"codehealthFindingId/v1":"997eccad0d83617d48b34a6320c64d5eb03fcce82b0af5b029be98261c4d0557"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: subst for \u0060branch()\u0060 coincides with that for \u0060Try\u0060 because \u0060branch()\u0060 itself \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir/src/source_analyzer.rs"},"region":{"startLine":940}}}],"partialFingerprints":{"codehealthFindingId/v1":"15a0a671e4a06e42ba7c82122ad7968530b56e6d3fd73a81911a5cba13e4d343"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: collectiong here shouldnt be necessary? \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/tools/rust-analyzer/crates/hir/src/source_analyzer.rs"},"region":{"startLine":1284}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e5b1e36428478d99f3df1339b7b304cab15ac4b42da69d2db5e060a22165771"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We do not show substitutions for parts of path, because this is really complex \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/tools/rust-analyzer/crates/hir/src/source_analyzer.rs"},"region":{"startLine":1352}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4566b54c3056cc96a057280c564aebe5234a7f07371c96a831b9e569af65cbf"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Multiple derives can have the same helper \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/tools/rust-analyzer/crates/hir/src/source_analyzer.rs"},"region":{"startLine":1384}}}],"partialFingerprints":{"codehealthFindingId/v1":"43e1761602a882eae172e99525743feb0c86ff9dfc145a79c77bd65466c1ee7b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME handle attribute expansion \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/tools/rust-analyzer/crates/hir/src/source_analyzer.rs"},"region":{"startLine":1791}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cf9d2e9de1b9982678dbac2dd88bcb4e21ce645b95aa0fd2c9978a6bfa2bd96"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: during completion, cursor might be outside of any particular \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/tools/rust-analyzer/crates/hir/src/source_analyzer.rs"},"region":{"startLine":1809}}}],"partialFingerprints":{"codehealthFindingId/v1":"bea38cf6afcc70a379c3af40555c778021e568dccd22efb591c390e37306b130"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: correctly handle macro expansion \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/tools/rust-analyzer/crates/hir/src/source_analyzer.rs"},"region":{"startLine":1824}}}],"partialFingerprints":{"codehealthFindingId/v1":"7023b22cdecb8c1350550f86404e62976a4aeeff972756245ecb3a3315d0afc9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Is this the right crate? \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/tools/rust-analyzer/crates/hir/src/semantics/child_by_source.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"361f1b5655e2c02b13bf8f1c388afa71b68aa02ee7b5cc0468498067f274bcee"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: detached file \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/tools/rust-analyzer/crates/hir/src/semantics/source_to_def.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"403e829ad52508704f0c8a4550fd23ba69911e7014ae082871afe4154099dfad"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Make this more fine grained! This should be a \u0060adt_has_derives\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/tools/rust-analyzer/crates/hir/src/semantics/source_to_def.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"78e2102646d0cb7827aad2a994a399858aa208c1d54fc9bdd3b667fbac4b8531"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: /// XXX: this might be the same def as, for example an \u0060EnumId\u0060. However, \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/tools/rust-analyzer/crates/hir/src/semantics/source_to_def.rs"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"297045d36ee6e6e3f4b77b7a192950eb19245ec1513f0369ced3cbfc32697d6d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Parsing from \u0060tt\u0060 is only used in a handful of places, reconsider \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/tools/rust-analyzer/crates/cfg/src/cfg_expr.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"87efcc1d6404ba72650f10ca07bcddf49e29d35c958a17d7f9203a17097763f8"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: can\u0027t actually remove the file, just reset the text \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/tools/rust-analyzer/crates/base-db/src/change.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"155074d90f1851422ec28e61984da8fb3740880574cab617f9b0fd0bd8b8d39a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This ought to be a \u0060VfsPath\u0060 or something opaque. \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/tools/rust-analyzer/crates/base-db/src/input.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"744cf82cab16b94c94f974b0782aeba9574f9764253a1be409b2949fa0f3a97c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this *somehow* should be platform agnostic... \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/tools/rust-analyzer/crates/base-db/src/lib.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fd2a2e2a67eb85aef8937ee7896e3b2a65dc65da5738d9928fedb2c0af36b28"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: VFS rewrite should allow us to get rid of this wrapper \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/tools/rust-analyzer/crates/base-db/src/lib.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"8331c00a36c8e9807ece30a0f3cb10bce82fe6de7f8717e6391adda4c81924ed"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: the \u00220\u0022 indicates how many support files should be uploaded along with the binary \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/tools/run-make-support/src/run.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c375ed87b83827050330b12274c4b7c3db8eb6821b5cca350eafcd4f8e17089"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(132599): implement proper env var/shell argument splitting. \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/tools/run-make-support/src/run.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"474d1b60b6092a7b3b79b69389c0dbce612e20dcb1774ef79441854442d32feb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// # FIXME \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/tools/run-make-support/src/scoped_run.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a51c977bdbd1e924d9e2e9455af4da54674f2aa1639e14bc238435857a4a03d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME(Oneirical): This will no longer be required after compiletest receives the ability 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/tools/run-make-support/src/scoped_run.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a46048ac92873ec8a6a39eb0247855747095ef10a6efc6f42f770f14ca8e727"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(Oneirical): These native build functions should take a Path-based generic. \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/tools/run-make-support/src/external_deps/c_build.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fdfebd9df0c001a746fb07615a1f816f9183cd7c04111ca8c3cad032efd94ee"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: On musl hosts, we currently default to static linkage, while \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/tools/run-make-support/src/external_deps/rustc.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"5788d3b37a3bcea73775a23ceaba1837fe06b2532da9078f3839c802ab8c0a79"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#135037): not robust against symlinks, lacks sanity test coverage."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/run-make-support/src/assertion_helpers/mod.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"31e1fbe1746c21d9001c7a777bb3c2b065428f73e4d1848af730458ab3564c62"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: cdsplit in llvm-bolt is currently broken on AArch64, drop this once it\u0027s fixed upstream \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/tools/opt-dist/src/bolt.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"95b37f73abbcbcb3619314c5c23ae038215957377fb021ecca5937b8753096a9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(kobzol): try to re-enable this once BOLT in-place rewriting is merged or after \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/tools/opt-dist/src/bolt.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"51332c5545b39adedb4484691530a5f6d519435cfb7295d05aa9dfb3e1329bb8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Move update_submodule into build_helper, that way we can also ensure the submodule \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/tools/opt-dist/src/main.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a407dc639931ae73a3a1f3b2f03d1f71266b8891a2ba2a5274f7c7bfbd71bd8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Enable bolt for aarch64 once it\u0027s fixed upstream. Broken as of December 2024. \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/tools/opt-dist/src/main.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd447822422a4533e7810600e5bda500c89066dda88244e4ea4f258d94c49381"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(kobzol): try gather profiles together, at once for LLVM and 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/tools/opt-dist/src/main.rs"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"682e98538caf8e7cf6a1c10858206b1d526b50de45bf5329363fb3cfd847656d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(Zalathar): Remove this \u0060skip-filecheck\u0060 migration error in 2027, \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/tools/miropt-test-tools/src/lib.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc27ab4c74927fbe00b18a1addf0123221c51863b3946758015929cf4853975f"}},{"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":"src/tools/miri/tests/ui.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"1696ed1e09c30c05eb6347caccad98b5af7a04ac2096123fbed070da99308c8e"}},{"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":"src/tools/miri/tests/ui.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"8431c87ce01d6bf1873da1da75768d24074fb56e530863d26d9f1864dde4bb42"}},{"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":"src/tools/miri/tests/ui.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd611efb90cb2af8b3563313a944d6440a2b7f325511d6495379cd9d5b386d7e"}},{"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":"src/tools/miri/tests/ui.rs"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"682553b8e5a0b7cc389bfb93ed9d65c74866cf78d2b5c80a567cc7817ae0d661"}},{"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":"src/tools/miri/tests/pass-dep/windows-fs.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccdf8bf3bfdf25d8d4ad3060771652e1a482e7c54f49fa7a46225b4111f4675b"}},{"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":"src/tools/miri/tests/pass-dep/libc/fs-flock.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3088abc46b821f0660ba496843a4121feb4f1a4411b8eea467ae3115105fa1e"}},{"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":"src/tools/miri/tests/pass-dep/libc/fs-flock.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"19c07c24f884fc15a8684157e85a9892640360bcfa09d5abbc3b07f6859265ba"}},{"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":"src/tools/miri/tests/pass-dep/libc/fs.rs"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"510c0936d7cc5fb388c4b901b9e22e7796a8ed484cbe69be7bcffca0f7eb39c5"}},{"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":"src/tools/miri/tests/pass-dep/libc/fs.rs"},"region":{"startLine":1322}}}],"partialFingerprints":{"codehealthFindingId/v1":"f720231b8e13e8db7c9427a198c106828301c21484ee3cb60f24ad8542e32a69"}},{"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":"src/tools/miri/tests/pass-dep/libc/pipe.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d047a97c6203deb17d69594d96cd56dbbec0c4e320b16b49c324e8d0d03a656"}},{"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":"src/tools/miri/tests/pass-dep/libc/socket-tcp-no-blocking.rs"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"5081fe30532ba8d9b37a08166148ffe171c954dda5ca8774557e236945d14283"}},{"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":"src/tools/miri/tests/pass-dep/concurrency/freebsd-futex.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffbf443844c6af223a661967d05bef13bbd487db047b340315f1eca2e3d94cf5"}},{"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":"src/tools/miri/tests/pass-dep/concurrency/linux-futex.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c65dc5d3c1ac353848e552be8af7c7a291a7aa4a554c70c1b4adfff8335d1eb"}},{"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":"src/tools/miri/tests/pass-dep/concurrency/pthread_cond_timedwait_relative_np_apple.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"699891188e948cefb73ce674b008649b107ee691dbaad971bd5921793c0eb2ca"}},{"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":"src/tools/miri/tests/pass/dyn-arbitrary-self.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0ce6425f677cf73df7d8b96c8800e66f17703ce1de14127893edd9e158606f5"}},{"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":"src/tools/miri/tests/pass/float.rs"},"region":{"startLine":1527}}}],"partialFingerprints":{"codehealthFindingId/v1":"731c3ceedc467c00944c20320bf84c2f7717066ca3557eac3a8fa48e9c741456"}},{"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":"src/tools/miri/tests/pass/overflow_checks_off.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"da37d72b104177b449fbfe6f9c4d4ca61900f70ab0b8520416e8d89fd4decc11"}},{"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":"src/tools/miri/tests/pass/path.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ebcce0f0d7c95636c5a53fb868ab56ed2aea7fa7bed6d835553852cc086271d"}},{"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":"src/tools/miri/tests/pass/provenance.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b05d4beb04c52dae7a8219ccf50cc42c09d13514a22e9549c881f62768ebabe"}},{"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":"src/tools/miri/tests/pass/stacked_borrows/stacked-borrows.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"626bd974f95103b7a62b53c87f182c1e776f26ca7b53e493e7d5ce73aad13e40"}},{"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":"src/tools/miri/tests/pass/stacked_borrows/stacked-borrows.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff958095aebb2d07ee1aa3295bce8016577c89c40aa1ae81a97d0e7624c5ae7c"}},{"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":"src/tools/miri/tests/pass/shims/fs.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"02652858f39ad4a32bc709b87cf7f2841f3f67ec0d765474a4110d6a945a2819"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: is that intentional? \u003Chttps://github.com/rust-lang/rust/issues/163923\u003E"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/tests/pass/shims/fs.rs"},"region":{"startLine":825}}}],"partialFingerprints":{"codehealthFindingId/v1":"114b739187dae293ac1132e20535e1551a9a83dec7ebbae495304479d154d3bd"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: is that intentional? \u003Chttps://github.com/rust-lang/rust/issues/163926\u003E"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/tests/pass/shims/fs.rs"},"region":{"startLine":833}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2fca5544d915213f5e8621a68e39969cc0f7055a05e11b9d101051ada15e59e"}},{"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":"src/tools/miri/tests/pass/shims/x86/intrinsics-x86-sse.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f1d7f3dc9a98bd4e1bf4a1941a656c7020f1fe80e08c77a86d362206c39188a"}},{"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":"library/stdarch/crates/core_arch/src/x86/sse.rs"},"region":{"startLine":2445}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff8c8dbbce869825206efebaddabb03c345c69363a115a3ddfbaddf49de63b50"}},{"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":"src/tools/miri/tests/pass/shims/x86/intrinsics-x86-sse.rs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"73c23ef5648ab3643be71bd772ebc6989956a4f11ccbd4ad79aa904854fd1bc7"}},{"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":"library/stdarch/crates/core_arch/src/x86/sse.rs"},"region":{"startLine":2474}}}],"partialFingerprints":{"codehealthFindingId/v1":"94c40102d172acb16a1ffca0f05a97bea03cd3b47ec50b4f3bf7ed7586a97055"}},{"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":"src/tools/miri/tests/pass/shims/x86/intrinsics-x86-sse.rs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fe8f7e816cbd2c6a52b3267614ad043d2eefa3b9ec5ec06e67963ec6978d478"}},{"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":"library/stdarch/crates/core_arch/src/x86/sse.rs"},"region":{"startLine":2503}}}],"partialFingerprints":{"codehealthFindingId/v1":"3adf1698acc693faf7c251e2511ed7f89ea3987e87a26bc9b513943844032804"}},{"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":"src/tools/miri/tests/pass/shims/x86/intrinsics-x86-sse.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"75c269c219c781c87d6f853c3841391f70242e95ec42f0c644e22b450143cf6f"}},{"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":"library/stdarch/crates/core_arch/src/x86/sse.rs"},"region":{"startLine":2532}}}],"partialFingerprints":{"codehealthFindingId/v1":"27f9ebfcd024674ceb386cb162adc9e74c32dd0ea2439ed57820c6c7764b3674"}},{"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":"src/tools/miri/tests/pass/issues/issue-miri-1075.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"d27191ef0caf54ca257ed5a83806f274e2341cf901c3012b43beea0745fcd1f4"}},{"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":"src/tools/miri/tests/pass/intrinsics/portable-simd.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab355f923268d49fbb4be1f8a3d5e123b8b0f9d3de9634e7100a08e7706b991f"}},{"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":"src/tools/miri/tests/pass/intrinsics/portable-simd.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"983b4da442636d82d09dcddab492958144f5eaa8d6f094cb7a496baada973bac"}},{"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":"src/tools/miri/tests/pass/intrinsics/portable-simd.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2ae41a61c88e677d5e21305decec85a19505b654b89824ebbc544ca1a346739"}},{"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":"src/tools/miri/tests/pass/intrinsics/portable-simd.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f9d87181c796a7c234292e1706ae3cd49c4cce972e05ce4e4300a6c19c72158"}},{"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":"src/tools/miri/tests/pass/function_calls/exported_symbol_weak.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"98059353ce82be3fe7dd48fbd45cc5e44494bf20ae1551b865fdb7e05a6ff136"}},{"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":"src/tools/miri/tests/genmc/pass/shims/mutex_deadlock.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d910d7c50867dbbf18ea9a987d7b2413db8b3f6c9688852b3cbdcdf86e431b4"}},{"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":"src/tools/miri/tests/genmc/pass/shims/mutex_deadlock.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"196c4ba5c42772fcd0bfa4dc980978507f66cf5ad70fe15ffc9ce67ff5b6e457"}},{"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":"src/tools/miri/tests/genmc/pass/shims/mutex_simple.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"33ec51702aa1098c1ce94c75338f81050a3c2574650061f5590cc91a63129804"}},{"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":"src/tools/miri/tests/genmc/pass/shims/spinloop_assume.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"28e5646fe2dfa521e12252b9c2fb559881140eced7f08ff67e3985175c6a37d3"}},{"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":"src/tools/miri/tests/genmc/pass/data-structures/ms_queue_dynamic.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"37186aa176d1dcd4ee0b1e12b8263418303cebce5e9f372081d05476a26263f8"}},{"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":"src/tools/miri/tests/genmc/pass/atomics/rmw_ops.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"21bb07162ddec83bb3b67dc2542e65f923d419cf07bc49918bd477f9020c1411"}},{"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":"src/tools/miri/tests/genmc/fail/data_race/atomic_ptr_alloc_race.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d59d996c013e7d9b6d00d6010a6938713760c706685f7a9180beea9a4b43e55"}},{"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":"src/tools/miri/tests/genmc/fail/data_race/atomic_ptr_write_dealloc_race.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6e2c3f68edfcff5839ced11c168f986e28092b75f28db297821a7e5b9954013"}},{"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":"src/tools/miri/tests/genmc/fail/data_race/mpu2_rels_rlx.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"100e7759e4ec98e1ad0eb4cb2520a85f90f6eed9eed43d3ddb3491d69f3923c5"}},{"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":"src/tools/miri/tests/genmc/fail/data_race/weak_orderings.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"58e2edcba972b9d385b79a2e359e3991dda1e835dd4e1605dbeee2708bf63397"}},{"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":"src/tools/miri/tests/fail-dep/concurrency/windows_join_main.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c6025fb2b1d48c26c80f516d02d0279185adf454147b4bd2096f7ebc4dc4bcd"}},{"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":"src/tools/miri/tests/fail/async-shared-mutable.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0e63a61299ce5a33eb2d54d1ec41cd25d6f3ef0c37d054ddc85047f7738be5a"}},{"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":"src/tools/miri/tests/fail/tail_calls/signature-mismatch-arg.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca534be2e6e45ae258f7ec51087c05884395fe5ec6b97da2822a76d015a4775e"}},{"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":"src/tools/miri/test-cargo-miri/run-test.py"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b20839aa2fe37a6078f0c560908bed6c761d40d8d1eeb4f40451401813484a5"}},{"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/tools/miri/src/helpers.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"6895c926a15067be477ec9a66b41134ffd0825e08aee679180c390ed59e7ab15"}},{"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/tools/miri/src/helpers.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d8acb6002b0f1b4fe3befd3104f0e9b6c0e664bb625083a6d20d49a5de302ab"}},{"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/tools/miri/src/helpers.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"b46aa75ac72736161b52869bc30f5b386633ce31dcf3f22bbe0d59650df2f6f7"}},{"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/tools/miri/src/helpers.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa8411d34d4d3f34fc27024a0607a97d04da787fee9ccc2090e8b8a5ce9e936a"}},{"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/tools/miri/src/helpers.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"9676ac663b210faf1b08c6fa90fc733fb5786e8bf1991d8b062c35c64946666c"}},{"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/tools/miri/src/helpers.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd2c0348645ce6ba6ab725780eac794e0e2c836aa3079e28a64021cb978fed3d"}},{"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/tools/miri/src/helpers.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aa8cd7e3b6aebb167e233f3e7c766023c932b106cb4bb1c389a3c4700a4d249"}},{"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/tools/miri/src/helpers.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ca11d9a0ae019c32666f1ea5573010f0f16e93e617051cffefd7d906ae6ddf6"}},{"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/tools/miri/src/helpers.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"a65f0e9ce0b1042d100c774a078efbbed1067ce1418e2127ba6620a2430424b2"}},{"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/tools/miri/src/helpers.rs"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"fda4731badce6563715d455182300f0e02462d064bec9e01f770f10b6f74c10d"}},{"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/tools/miri/src/helpers.rs"},"region":{"startLine":718}}}],"partialFingerprints":{"codehealthFindingId/v1":"70b1616b4602fde16a584d4b7b0f2082f3c487ba6d82e04dc66407893202a094"}},{"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/tools/miri/src/helpers.rs"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"4273a0c597e21b4d9a3aa83963a6ee14037ead68fdb864f248098f566ee931fc"}},{"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/tools/miri/src/lib.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"472467e3cdd15405837eccc7d21913c9c1de0b03c3e2d7b0ba3369aae76ac31d"}},{"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/tools/miri/src/machine.rs"},"region":{"startLine":1269}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfc2b47d246a2f804c568e80b8d9721cec8389577348e7d1c165fb21046f0cd2"}},{"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/tools/miri/src/machine.rs"},"region":{"startLine":1296}}}],"partialFingerprints":{"codehealthFindingId/v1":"a892d80e77b0d89ba64d3813d0868b05f04099e8e800e69a1988452915a80e8d"}},{"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/tools/miri/src/concurrency/genmc/shims.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"84baf3d35f05a0f63614c168dac7d0eecef3b966f143b0d9a07855e7cc1c545c"}},{"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":"compiler/rustc_const_eval/src/interpret/call.rs"},"region":{"startLine":799}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa4a096510197214859b58ddfad051608324b7ea59f757b444390cef990d1fce"}},{"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":"compiler/rustc_const_eval/src/interpret/call.rs"},"region":{"startLine":829}}}],"partialFingerprints":{"codehealthFindingId/v1":"13e8de7b67a8e309d764df35a35da32648c1b54de42002edca5917103228f1ce"}},{"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/tools/miri/src/machine.rs"},"region":{"startLine":1609}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9d837bf854d6f73d673a3476240268b0e863f62fc56cc6a147e6b70f1561aae"}},{"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/tools/miri/src/machine.rs"},"region":{"startLine":2153}}}],"partialFingerprints":{"codehealthFindingId/v1":"9923caa5769d9372c9eaaa53adc42bb7a93e74b5f9a7582baba56c0f60160c7b"}},{"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/tools/clippy/clippy_lints/src/iter_not_returning_iterator.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"29603f7430e6fc7f29680d67d93690386780184607a5505afba35d92e610fae7"}},{"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/tools/clippy/clippy_lints/src/iter_not_returning_iterator.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"212ef1a7f9de567c790013ac2569a49da636d98fd77f2e27c680f3a94a1cc21c"}},{"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":"compiler/rustc_lint/src/deref_into_dyn_supertrait.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"635bae1df9ec4fea584a908f74620ffb0d0b03290bbc45068f7b6007b582ae1a"}},{"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":"compiler/rustc_hir/src/def.rs"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdc8f489d4672e53da8f61fdb7e60003dab3057b04b54092168ab6e796be83ad"}},{"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/tools/miri/src/math.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb20782aabfd54750f932ba173063a5720953329d0bf54df8984a272a9c31a6e"}},{"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/tools/miri/src/shims/backtrace.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"694f4380f83eb3a2c52324211ebf2da5c20d8a4869ff351a87e01dd53041c9f5"}},{"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/tools/miri/src/shims/extern_static.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"75bba70ca1a0739a85f3832788a6d2b29773a3d11b459e7d92b190a8d942b7db"}},{"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/tools/miri/src/shims/files.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d6709df2f3668238b33fad9c9d82f953880ef00077895c4f057b74389b8f787"}},{"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/tools/miri/src/shims/files.rs"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"edff5b57bc464bc58c6edb4f74a34e869a376304aad86e792fe59260cf962a96"}},{"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/tools/miri/src/shims/foreign_items.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1621ead90d10fbaef8471c05025d246d5e72fdd951efd64bd56e8dd37c07cec"}},{"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/tools/miri/src/shims/foreign_items.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"70271a359f0c66ab02b1ba01c7f1a58b526f2d3efa393ba2f587d1b251b782f1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This does not have a direct test (#3179)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/shims/foreign_items.rs"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"9194c919a51579a2d524f27b0c3392945f34940c6558f7303a60ecd569ec7de0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This does not have a direct test (#3179)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/shims/windows/foreign_items.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c9d44e4fc19575b4f7a5a48a9200eb79ecfb51500aa57246c63ba1df1ec2b2a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This does not have a direct test (#3179)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/shims/windows/foreign_items.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e48fe85917d0a1a2ac22a707396139df30487263c2d718743e29a20c3251f92"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This does not have a direct test (#3179)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/shims/windows/foreign_items.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"7efab0a842015dbc9b8d7a94bd727f6f5e239b27ca144ab7c93890578b8e7104"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This does not have a direct test (#3179)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/shims/windows/foreign_items.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"d230e3d2c640e51f21c8c0f7ec7c28a6a89b7fbf42b9c6ef4f2c8afe17e47da8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This does not have a direct test (#3179)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/shims/windows/foreign_items.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f1083c9bc8692f285bd1e9b9c6cc5e4b3134c3ce077fe6e912b185091591ac4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This does not have a direct test (#3179)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/shims/windows/foreign_items.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"b62de1f6055aebc40f5df37f5e31b8293d280d7bf01b1add038d5cafde8129b1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This does not have a direct test (#3179)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/shims/windows/foreign_items.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7fb5f744e4a0860cf517614c3070a91eb5f098551a6cb6b12f19341b51945c1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This does not have a direct test (#3179)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/shims/windows/foreign_items.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"01036bbedb416e7cb7430cbf6e7f0120772cb00a571f65b0fefd952e20485f1c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This does not have a direct test (#3179)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/shims/windows/foreign_items.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9ec6a500360a0c903c715840706ad7edb19fe80ebf19a0ee8cb9a6876d7b5c6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This does not have a direct test (#3179)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/shims/windows/foreign_items.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ad28731fbcc2257a6f51dc8307fce8a558666c7a1d04d55a8e017dce5e63746"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This does not have a direct test (#3179)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/shims/windows/foreign_items.rs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c9450077b0643ae4d4937cc2d0a51b0e2c913ff44673520faa1cf98e0792572"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This does not have a direct test (#3179)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/shims/windows/foreign_items.rs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d3f67f175c7b2717fde42392c8b1a0be43da3f42cbf5da4c57a3023212f9fd9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This does not have a direct test (#3179)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/shims/windows/foreign_items.rs"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"b054b8aec7a3291fe3ee8933b8558259e42c1b3bd5e377dcb61953bd0aeccc6e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This does not have a direct test (#3179)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/shims/windows/foreign_items.rs"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"d31e7962fdcef18c7c91fc0e4df0c5cb64694af435f2132ab90d36a48cdf3f4d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This does not have a direct test (#3179)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/shims/windows/foreign_items.rs"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"bff6150b29bf06e61a6dc325da6e114bf6c845d3ae29577094c858bae183a240"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This does not have a direct test (#3179)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/shims/windows/foreign_items.rs"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"8933dfa1f9c2b7270ce4534103bd074074b1d81405f89b31bbe8d888fa0d471a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This does not have a direct test (#3179)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/shims/windows/foreign_items.rs"},"region":{"startLine":732}}}],"partialFingerprints":{"codehealthFindingId/v1":"01e67d93613338588e6cb56ea9c2f87fc1ff2419c5abedde010bde1132637c2d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This does not have a direct test (#3179)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/shims/windows/foreign_items.rs"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"5768ca5e02313dd405484add11c5e7989e4b9a1ac8297e8301246d8217a0574a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This does not have a direct test (#3179)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/shims/windows/foreign_items.rs"},"region":{"startLine":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3fa7e5d24f3860fcd35e281e320ad0a74703d5f5b611a3764c2299fd14085d2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This does not have a direct test (#3179)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/shims/windows/foreign_items.rs"},"region":{"startLine":759}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2727422bf2ce634073f948927eefcd31842b0c196e6bc37189a73f8a7c30ec6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This does not have a direct test (#3179)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/shims/windows/foreign_items.rs"},"region":{"startLine":793}}}],"partialFingerprints":{"codehealthFindingId/v1":"94d4178ed54178eb29351a86111b75d3033c85232b4f82d537f7a4ceff4cae5d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This does not have a direct test (#3179)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/shims/windows/foreign_items.rs"},"region":{"startLine":803}}}],"partialFingerprints":{"codehealthFindingId/v1":"c715936f1e7a452f97f6574951ab6175996242f8e4ac4e2baf8c65eb7c48465f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This does not have a direct test (#3179)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/shims/windows/foreign_items.rs"},"region":{"startLine":812}}}],"partialFingerprints":{"codehealthFindingId/v1":"c560f1ba2bca85eee8bf84495c90f1bafddf3fd09bf983618e10cb736072e3ea"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This does not have a direct test (#3179)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/shims/windows/foreign_items.rs"},"region":{"startLine":823}}}],"partialFingerprints":{"codehealthFindingId/v1":"5222646c91f2512891dee774f348d4f3db8c7928d857a1143a12c96e4a718c0b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This does not have a direct test (#3179)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/shims/windows/foreign_items.rs"},"region":{"startLine":954}}}],"partialFingerprints":{"codehealthFindingId/v1":"e07b475acdc9c1da4a27bb29eb9941c787e1cbf59d63e66f955efb7a82e80a34"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This does not have a direct test (#3179)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/shims/windows/foreign_items.rs"},"region":{"startLine":1032}}}],"partialFingerprints":{"codehealthFindingId/v1":"62712467de6afd89f9f1f196892eaea1d5f0bd4c16b3e463cb3ade7f1fa55870"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This does not have a direct test (#3179)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/shims/windows/foreign_items.rs"},"region":{"startLine":1045}}}],"partialFingerprints":{"codehealthFindingId/v1":"41f476d0941df3321a7b897786d86862c0c7d5998664b30b87e76d019298407d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This does not have a direct test (#3179)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/shims/windows/foreign_items.rs"},"region":{"startLine":1091}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1c695674ae313e8ff827382b1d6257712acad61fa66bbaed335829e276311ca"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This does not have a direct test (#3179)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/shims/windows/foreign_items.rs"},"region":{"startLine":1128}}}],"partialFingerprints":{"codehealthFindingId/v1":"7190a1db3cbbe4362285854af54b51658b026518aaf4655cadcf40469cfa690a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This does not have a direct test (#3179)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/shims/unix/foreign_items.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"93830362fab71f0bc96c555d4e840f30479d1ca50d1b4c64899b94f9d2929f95"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This does not have a direct test (#3179)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/shims/unix/foreign_items.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"656b4c046d943aae5288765afa24d466135716529fd6a0bcb07d12aeb63fbd14"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This does not have a direct test (#3179)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/shims/unix/foreign_items.rs"},"region":{"startLine":1210}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2ec5b60fcbc2207fe016bf33518180b9f89d5802c169c69b9546f0ba66211b8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This does not have a direct test (#3179)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/shims/unix/foreign_items.rs"},"region":{"startLine":1267}}}],"partialFingerprints":{"codehealthFindingId/v1":"881185d52be920054dac163cd5f5fc8b18e693d4d7adb5a17ba070a2ad8f8149"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This does not have a direct test (#3179)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/shims/unix/solarish/foreign_items.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7dc30ce43929efb8293076237e7507cefd76d565b837132916c48a745e0f61e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This does not have a direct test (#3179)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/shims/unix/solarish/foreign_items.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"99cd9a5061461c52c2630fba85e4a15a2fe23d961c355e9f06448e4e1f07a25c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This does not have a direct test (#3179)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/shims/unix/macos/foreign_items.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"c85e5791b0204c5917ae015045f51fd1da64066cee838b819d394b6c096e4ad3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This does not have a direct test (#3179)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/shims/unix/macos/foreign_items.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"fab30b70d89033ddb86e1c98893935fb39efa4824a832dfb44228923b90c0e59"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This does not have a direct test (#3179)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/shims/unix/macos/foreign_items.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"07bd34ce4f3dfc0f5b67e4ecd61ee5287014308fe5bf809b5614e091f6fb755e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This does not have a direct test (#3179)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/shims/unix/macos/foreign_items.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"60261e6bb00507375c6050afddfd730ad66bf5eb7feb9e8d97e0310f00954067"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This does not have a direct test (#3179)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/shims/unix/macos/foreign_items.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2a29093fa0038c4785704aa78b63b54575aa498aa4bebf67240ca59745f95f3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This does not have a direct test (#3179)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/shims/unix/macos/foreign_items.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb1bd4321ed04ba55257bd6a38dfa1e50946f0597fbdfa25d980eda43294fb32"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This does not have a direct test (#3179)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/shims/unix/macos/foreign_items.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b5dec72dbbaa3d4ac0691919d94edbfc15e3ab93f05231b4d59704aca6c9645"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This does not have a direct test (#3179)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/shims/unix/macos/foreign_items.rs"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"99796510ba4ba605980160eb9822438fe14a14f049a619f647ad222d69e3202f"}},{"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/tools/miri/src/shims/global_ctor.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"783fbf2f10fbbe5210127a4d9a8096636b716e8c4194fa40eb74814360acec69"}},{"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/tools/miri/src/shims/global_ctor.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b9abe4dc56d0fe706f023efaa7c900f08abc25d8e279daffa67c5ef851fc3f8"}},{"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/tools/miri/src/shims/readiness.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9f8b8f7b5b82ec16c0da856b123747dce73f59a6ab4586e523884a68fae1fd9"}},{"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/tools/miri/src/shims/readiness.rs"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a0e005af82a4343b6b309ccd380dac2d329f06e5e96668bd2366fa9825cca87"}},{"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/tools/miri/src/shims/tls.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"792443b17850accb5607867e338687d9958b130db59d4788fdef583586249352"}},{"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/tools/miri/src/shims/tls.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cb59d0c86f5251f3842a6139dd6137f051b48c68add5cd007ae5cdf6d36b819"}},{"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/tools/miri/src/shims/tls.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"08f32c7e0a62bf689a01cd32dc0d222d8ed71e7045fe676063175630645af758"}},{"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/tools/miri/src/shims/windows/foreign_items.rs"},"region":{"startLine":689}}}],"partialFingerprints":{"codehealthFindingId/v1":"53bce0e77f6fc69d4d346828c4dba78a022a161ba81b26cd2a6f228a43c89c43"}},{"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/tools/miri/src/shims/windows/foreign_items.rs"},"region":{"startLine":828}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e6a2bdd355871bdd452ca60b68b2beb0183c07c8b5e52f4670dad0bcccd9ca1"}},{"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/tools/miri/src/shims/windows/foreign_items.rs"},"region":{"startLine":901}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5267fba8c746030d8e9c6c40036d2c5f78df8ef1e223cf9f78ec9ab5eecd2e6"}},{"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/tools/miri/src/shims/windows/foreign_items.rs"},"region":{"startLine":1258}}}],"partialFingerprints":{"codehealthFindingId/v1":"29b2d1654540a6b3f81e76d31a1582e8ebf4d76e5bbcf5c756b4b1a6256b4541"}},{"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/tools/miri/src/shims/windows/fs.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fb9bfaa531535ce259ef3c27797b52ee970fdf2f3dd4d611c19f99badabdd9a"}},{"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/tools/miri/src/shims/windows/fs.rs"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7d268f36f27bcd57b1365bebce0e066ff9f44d413c353e07f70672bd3614ebe"}},{"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/tools/miri/src/shims/windows/fs.rs"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dd03eb02b049ad7e58e7fc7ac1c09837e3cadacbf74a73b401821328453dcd5"}},{"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/tools/miri/src/shims/unix/foreign_items.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ae8c373379d6e9817a300bb8b5bb8af48993fef58464eff766ab3ed7568080e"}},{"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/tools/miri/src/shims/unix/fs.rs"},"region":{"startLine":2473}}}],"partialFingerprints":{"codehealthFindingId/v1":"b804b2e951e31a10fe30a7ffce863f8f1564fbf6c66ea177c476f064d6182dfb"}},{"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/tools/miri/src/shims/unix/sync.rs"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"862a42142c35ecbe51a0d57de6670cf0eed40f06e0500f7764e9d642961ad17d"}},{"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/tools/miri/src/shims/unix/tcp_socket.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7698c0d7f6f6b5847b9f2e5366415f181d4500448c77239662376352a65c576"}},{"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/tools/miri/src/shims/unix/tcp_socket.rs"},"region":{"startLine":787}}}],"partialFingerprints":{"codehealthFindingId/v1":"bda9bd166f3a2c92266a3176d8448ee5ff9295d52503edbaa4829bdf9b46a39c"}},{"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/tools/miri/src/shims/unix/thread.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"74b2e2b3eec6cdf075fb073a21b250afd6744c4c3db55ef66dd7245b003ce483"}},{"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/tools/miri/src/shims/unix/thread.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"61f5ac050814d51a25ca2e2c03e6b7ebb29f3f0c4a018d5e183ce7066c7f01fd"}},{"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/tools/miri/src/shims/unix/virtual_socket.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a1e146d40d04a0da5828ea6992690a2c5496cf97b3b8c5c2694d6268a72a919"}},{"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/tools/miri/src/shims/unix/virtual_socket.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"730fa988222b8cda17cab678610a64b71cb4525783603c335449cd9848216318"}},{"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/tools/miri/src/shims/unix/virtual_socket.rs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc0bf54e42d4ea046ee84122ac3a2bc0e38d6e21ad70239ee553d63cbadd6d9b"}},{"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/tools/miri/src/shims/unix/linux_like/eventfd.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"7df431fa73b21e0aab5ba3934b15d24073138f081ea62520d3782575156fba99"}},{"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/tools/miri/src/shims/unix/linux_like/eventfd.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"297a8cab7a4cd0c12522fa54762b01acb9913f8c3b2c0612eac78744e9e48458"}},{"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/tools/miri/src/shims/unix/virtual_socket.rs"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"8111b9573c60b8145a690f03a956eba1475cf50d04b2069d4c30392953c31d30"}},{"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/tools/miri/src/shims/unix/virtual_socket.rs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"24d7bd705e16069fd255350c4fef3c8d49ae700eae3721b7c666d3966c77eb35"}},{"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/tools/miri/src/shims/unix/macos/sync.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"9691cab3119bf2686e88878b720cc9db8a9841fcded689a066593dd02f891bfb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Do these all have direct tests (#3179)?"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/shims/unix/linux_like/syscall.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9e4f10ec364fc6af46e9f3fee9a15aa43d868e083ca988a6c0fa3fac6f64597"}},{"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/tools/miri/src/shims/unix/freebsd/foreign_items.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"794d2ccf47541fff272a623d8635dc8e3648c45dbb016f90ff99cdddbea3bb7d"}},{"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/tools/miri/src/shims/native_lib/mod.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"85b998f221a3b418e44c1d42fa4d8000f9a3845b277918462c81a0682550c3f5"}},{"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/tools/miri/src/shims/native_lib/mod.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"919ffbfa66cc7ae7adf819066ba24b13094028115440e5a42d83857390a4871a"}},{"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/tools/miri/src/shims/native_lib/mod.rs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"87820a4073cee90693666c156255e865aca572083c917b8a0b513fc71b781361"}},{"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/tools/miri/src/shims/native_lib/trace/child.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7af77807fea3ca73c9f82f109f9a8dcd4e92c3c363e73bc620022fa5590e963"}},{"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/tools/miri/src/shims/native_lib/trace/child.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb4fc2f4611ef5b3aec4b0a5ac4d22693f36eddd01da66c419c0fb543c785b9d"}},{"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/tools/miri/src/shims/native_lib/trace/parent.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"5071d4d05a890bf99e7c9b298da5d7040044a93df102c54fbd67de80e35d7629"}},{"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/tools/miri/src/intrinsics/math.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f7256fe98c989cbe16c390bcc3e643c2d2a5fb6590df9b057ba910706d3d99b"}},{"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/tools/miri/src/intrinsics/math.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"8caaac48e2a43458b2a592305d3bad90826fc0630f41b77ecaf8069e6fb0c62f"}},{"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/tools/miri/src/intrinsics/math.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed31743f1bd785dcdc43f4af2194499815485304f2243a414e0b882a2aaa022a"}},{"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/tools/miri/src/intrinsics/simd.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb304000bf9213b12ec2b254f8014caf13e5db5ea09cbbfe9470a2d86d451d05"}},{"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/tools/miri/src/intrinsics/mod.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"a826155a1b80f086e6f3bae06998995e07bf223ee298638c50cca186e59074da"}},{"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/tools/miri/src/intrinsics/x86/aesni.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"0078333c03f063bc459cb488a48f51db9913f308418a5eb8662889b69bbc2a63"}},{"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/tools/miri/src/data_structures/range_object_map.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"740589adfb0a86281edbf0ede35aceba9d04320b4ad4edbfb0d003d0746860f1"}},{"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/tools/miri/src/data_structures/range_object_map.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"983be36531744c7fafb62d30775d629eb79ee92aeb4798a37039030ff0fd88c0"}},{"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/tools/miri/src/data_structures/range_object_map.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"781312dc5be0e14a8b02a2ee86551348c2f8d0fb148205448985db98fd2ec1b6"}},{"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/tools/miri/src/concurrency/data_race.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ce5c6a9dab390adbd8998ef7a27919b3f36e6abf053ffefacd64aac266654aa"}},{"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/tools/miri/src/concurrency/thread.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"46e598c5b01cf61e5eefdeaf14a452421caf3de9a99d1919424ee6d182c27aea"}},{"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/tools/miri/src/concurrency/weak_memory.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"d83ab393820c6eab7ebd4c50f8934e5d0d6c1f37dc8709a5e82e7737b7ea5836"}},{"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/tools/miri/src/concurrency/weak_memory.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9191a3de2e1c396d17fd8db5744276b00ad08306e4fdb23e3a0cb27f7aefce7"}},{"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/tools/miri/src/concurrency/genmc/config.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b274bb0b525c584dee8e44b1f8e6340a66b1baca65892e4cac5a37c337db40e"}},{"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/tools/miri/src/concurrency/genmc/global_allocations.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cd713538a635245c0d8b7c50296b307143955f4b1f488d9a8976458386a6d08"}},{"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/tools/miri/src/concurrency/genmc/global_allocations.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"16aeb92dda0d542915127ef90670318e16240ed80a1f67ad3e25cb64a1d61891"}},{"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/tools/miri/src/concurrency/genmc/helper.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"2427b3fdca45dd965314a643245c8d663f78e53c8de172999eb0c36324d7d71e"}},{"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/tools/miri/src/concurrency/genmc/helper.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"347bd752d9c439386f47bc5b97eacc4b873f1467d229faa6174c2e576c9bf079"}},{"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/tools/miri/src/concurrency/genmc/helper.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9cb096bbee3ff3648e1538472db83befc768796f2e83bb2d541e30e3c60132c"}},{"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/tools/miri/src/concurrency/genmc/helper.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c7f326cef5abc2c92d1dfd3f8c0109dc2194707588f4f6f70e7dc1d236a1b6a"}},{"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/tools/miri/src/concurrency/genmc/mod.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"aff5cafc0670c6346a551d51afa930e7c59879e55292418739a6c0f25be90628"}},{"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/tools/miri/src/concurrency/genmc/mod.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"1babb2e11412fbc993367d0043b43e0035961b673a7397abe210c467a9ae9622"}},{"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/tools/miri/src/concurrency/genmc/mod.rs"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"a31fd46c337b857db561eeeb8777518550c6e712eb3888a6e9e56e27f346d586"}},{"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/tools/miri/src/concurrency/genmc/run.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"1891523f9609b74102eea9002f779d7e58b5bec24bfc70ff1478156847b1a662"}},{"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/tools/miri/src/concurrency/genmc/thread_id_map.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb30a3ecc6e54f7c8c09dadf0704d8b19ab82cb40bb90059a6e5ee728ae09bdd"}},{"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/tools/miri/src/borrow_tracker/tree_borrows/mod.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"e36c4e79f43eb0336eb741304f68935627e33e743c8673dabddbaf72bb536ea9"}},{"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/tools/miri/src/borrow_tracker/tree_borrows/perms.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"76b615a9a8131df148bf86ea1c00d406b301e61cce423a4bd37867dba14930e2"}},{"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/tools/miri/src/borrow_tracker/tree_borrows/tree.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2b50a24e1c4e42b47eccb3b8931fcaf57cb7b0b1b494d6cb69cd63aeb60a595"}},{"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/tools/miri/src/borrow_tracker/tree_borrows/tree.rs"},"region":{"startLine":1203}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa7f01e20561800e76e6f50af47867344f93cb5c31e5537c2c8d8a5b0c01a922"}},{"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/tools/miri/src/borrow_tracker/stacked_borrows/mod.rs"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"43f5893dd430ee45773522d7586d2b60caad56de2a0c1eae4f92eecbe3a2cf7b"}},{"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/tools/miri/src/borrow_tracker/stacked_borrows/mod.rs"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"228f1db02c600d7824d93a243994a9155a7937db04e667d63176add4e72fd39d"}},{"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/tools/miri/src/borrow_tracker/stacked_borrows/mod.rs"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"4617617f10d0bbe716c4d4364b0374d844f2432f3d9be8c8a2133fb0b674187b"}},{"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/tools/miri/src/alloc/isolated_alloc.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f10ba920b8c422e709d5e4fa956850210ce9fd7cb5fd8559dd98732721d8fea"}},{"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":"src/tools/miri/priroda/src/debugger.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"5488382944d77ab7c552d695da5d36237ed1f9ce771625ec362339162dd283bf"}},{"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":"src/tools/miri/priroda/src/debugger.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bc03f5d9fbe7fe19048bd7a01b03fdc41e75759c5524116768a3c98cb5162ac"}},{"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":"src/tools/miri/priroda/src/debugger.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"70cfac56a74ecbd309c38a7338d915b589cc6efeb5e0b50a3f726a6129f6fd95"}},{"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":"src/tools/miri/priroda/src/debugger.rs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"95af8c0db5f06c8bf65ceb3dfc3eb0bdc1905062facf2714f194c05082b72829"}},{"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":"src/tools/miri/priroda/src/debugger.rs"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"eadd454d2062f714edfd594d4c09efacc6f1ca180230f7f2c0fd7bedb367afc6"}},{"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":"src/tools/miri/priroda/src/debugger.rs"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"3869066fb520c3aff9215673dcbeffd859ccee974a7994399dfc741a90e06199"}},{"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":"src/tools/miri/priroda/src/debugger.rs"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"522620b55a6c1170424fa9c95a20d12027f1bb75cebecdbbd6a7db56153f7114"}},{"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":"src/tools/miri/priroda/src/debugger.rs"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"00880cf72f1c7ed37c7d6afb7d020469f629ab83589c74cfc38ec1cd18f82ac4"}},{"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":"src/tools/miri/priroda/src/debugger.rs"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4f76bc5adfcbcc968293cc3da0073e39c78c32d8f793ef980e8efb77c55abc2"}},{"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":"src/tools/miri/priroda/src/debugger.rs"},"region":{"startLine":677}}}],"partialFingerprints":{"codehealthFindingId/v1":"bafa4f9118f99bb9b262dcc8ba1ab56b618ed5bc1cdfae7f749e3c72c8261f6c"}},{"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":"src/tools/miri/priroda/src/debugger.rs"},"region":{"startLine":685}}}],"partialFingerprints":{"codehealthFindingId/v1":"1374d0c23924b6b93912e90904e0e293ab57494fb7bbd0ee1187ad2507105e4d"}},{"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":"src/tools/miri/priroda/src/debugger.rs"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"c95916dec66503c4b86f2ae943ab5ff0979443ce3ac18f5f66efddae0b1ef909"}},{"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":"src/tools/miri/priroda/src/debugger.rs"},"region":{"startLine":748}}}],"partialFingerprints":{"codehealthFindingId/v1":"62b4461c3e7e6f04d0aae4ccb7e2f1c87f7de0f63c952cc875aed464027f404a"}},{"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":"src/tools/miri/priroda/src/debugger.rs"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7274d63355a850d2f3d7077923d330cae328815edee3cb0456d68d8d8ea244b"}},{"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":"src/tools/miri/priroda/src/debugger.rs"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae516625cdacaf04403f443780485aa8888638df2c9028d0a9687727187df51c"}},{"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":"src/tools/miri/priroda/src/debugger.rs"},"region":{"startLine":781}}}],"partialFingerprints":{"codehealthFindingId/v1":"0af6caaba0f5a44ea8d89dcd6665dd3ecc63f65a4debdb0f1fa79d474143afce"}},{"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":"src/tools/miri/priroda/src/debugger.rs"},"region":{"startLine":790}}}],"partialFingerprints":{"codehealthFindingId/v1":"20344087539c5a36100e5eb8ca10e03221a4e32842db19dd993161ee913b3101"}},{"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":"src/tools/miri/priroda/src/debugger.rs"},"region":{"startLine":900}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ea0bbd444aab442bf8dd77d1b8b001fea20ef60473297c319952cae63f42f6a"}},{"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":"src/tools/miri/priroda/src/debugger.rs"},"region":{"startLine":925}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f90ac4fa30cc0a95834f04d610ab47b46f913ff56b473aaa543ee012df4bd2f"}},{"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":"src/tools/miri/priroda/src/debugger.rs"},"region":{"startLine":1009}}}],"partialFingerprints":{"codehealthFindingId/v1":"5405e4d1586d061230b55e06466a6a4de4a292d7f538570db62ea3bc1c296522"}},{"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":"src/tools/miri/priroda/src/debugger.rs"},"region":{"startLine":1018}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eb365d591cc410b04108dc8e5b5b1d8719557031e7efd275896e4b8a2954d97"}},{"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":"src/tools/miri/priroda/src/main.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"446267983121c75763c39a0f39f997f1873eee108ba5e5985d1b6dd8c07b9a80"}},{"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":"src/tools/miri/priroda/src/main.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fdde699c000093a03d88037761e2903c7805e51c5353e309f66a93d3eba003f"}},{"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":"src/tools/miri/priroda/src/main.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d8bc07662248b711bade6218125d776b37179620bfc1e674d6e5ab7392f7246"}},{"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":"src/tools/miri/priroda/src/main.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5bc946b00512f02288b8a05add683a1fc4dd20ff2987326b32d77161d36a277"}},{"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":"src/tools/miri/priroda/src/frontend/cli.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cd6645afac8bed818c474c13261e1bf2a62d3aba64f983a4d9c9985bd6c2943"}},{"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":"src/tools/miri/priroda/src/frontend/cli.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"a637ef14e91b5d4dbdad7a191b1565262d7383a215c8cb6385d787550f3e9429"}},{"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":"src/tools/miri/priroda/src/frontend/cli.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"27a0c35a667d5a815804a5650bb7e6996950aa773dc9a351a133f1733d2b1c69"}},{"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":"src/tools/miri/priroda/src/frontend/cli.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdf5a7cdf0874165018766f30d721914eb6022896d1b951d4a0285eaa5515c4a"}},{"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":"src/tools/miri/priroda/src/frontend/dap.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e8b45393892c7a1b7ff85ba93598039391eeb9478e387e6300b554b21c74cf3"}},{"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":"src/tools/miri/priroda/src/frontend/dap.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cdbb186b2e5a5ba1c7c8fdc71f6bb1871e211d91cfffa8a7c02ea9d1a898b1c"}},{"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":"src/tools/miri/priroda/src/frontend/dap.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cf9a3dee1fd71f4fc2ef2a63064fb65ed9e1f5d49efcb20c902d1583787fd2e"}},{"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":"src/tools/miri/priroda/src/frontend/dap.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"727135c5e12885a45f86de1f09f9b035abc3d1f94cea4da0e6ad94ae7563dd89"}},{"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":"src/tools/miri/priroda/src/frontend/dap.rs"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"8063de5922ae375212dca82b7f9ace0a3adf9266b8ef38abb0f299267c14c0ca"}},{"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":"src/tools/miri/priroda/src/frontend/dap.rs"},"region":{"startLine":797}}}],"partialFingerprints":{"codehealthFindingId/v1":"b52f98a926f4ea6a9bcb3b672da1618fd4f4ea5adc442f6e285f45e23a40504c"}},{"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":"src/tools/miri/genmc-sys/build.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ca5b0f576fac98aea7a138809acd466990a10a0e2cb0c020b3036ce8fe45dd9"}},{"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":"src/tools/miri/genmc-sys/src/lib.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"762850e2b715c1fa5e07044ebbe6a8afd979c83588c68fefa872eff30ba8fb30"}},{"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":"src/tools/miri/genmc-sys/src/lib.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee0f11017c0c4e2a3958ce908a62cc06b139d14ca6d2ac25031ab85dcee3db0e"}},{"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":"src/tools/miri/genmc-sys/src/lib.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"83786e3e8da0d264af03ab284cb96214c3461fd26d14e86479212ebff2e974aa"}},{"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":"src/tools/miri/cargo-miri/src/main.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c483e041dd4e203b9c10950f327b2706ac61cd7f9fb96955a16808ecff59c6c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#160895): While the new solver is enabled by default on nightly,"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/lint-docs/src/lib.rs"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"8efb7fe869d14cea8947dfd170f2696c461bce43b3457d2a2745a1bdd4ddb636"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#160895): While the new solver is enabled by default on nightly,"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/compiletest/src/runtest.rs"},"region":{"startLine":1077}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab3ff91f6b920290e6ced59df6ef6ec3e6c5feb68863e5f776aadb3cbfa9174e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#160895): While the new solver is enabled by default on nightly,"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/compiletest/src/runtest.rs"},"region":{"startLine":2001}}}],"partialFingerprints":{"codehealthFindingId/v1":"efcdb399ac1bdbf88104a0de895edcb7896465503c5cc24a4364c006285463dd"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#160895): While the new solver is enabled by default on nightly,"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/tests/compile-test.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"d22dd5b61f45a3724d8e92dd06aef01946cab6ed3b938bb12ab5e5b644586930"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#160895): While the new solver is enabled by default on nightly,"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/tests/compile-test.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fb5aaee74c0ef305f000003da94bab4720c883f966889a71ca26f50e0ed1c72"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#160895): While the new solver is enabled by default on nightly,"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/build_steps/test.rs"},"region":{"startLine":3398}}}],"partialFingerprints":{"codehealthFindingId/v1":"560ed58ee2ccfae563f9ffece43d7635365cb43f7daf151716396c27394f4ca0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#160895): While the new solver is enabled by default on nightly,"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/build_steps/test.rs"},"region":{"startLine":3487}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1846272a1a5cb0f5462e274587e61ebc6b131bf4ecbfaf433354a4188d72db3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#63351): Concat trait in alloc/slice reexported in primitive page"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/linkchecker/main.rs"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"196a5ca175f066464caf4760d550ccc2c53e74388cb463216fea8c7c2a290652"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(adotinthevoid): I\u0027m not sure if these are 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/tools/jsondoclint/src/item_kind.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8be29de3ffa76a56f9184451a4fa9a54f8fa4807cc59f66c719cd39d21eed53"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Why don\u0027t these have their own structs? \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/tools/jsondoclint/src/validator.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9f35221731f3899189e5a1eb41c74e6f712c51a60f18fc836995fffa912c69e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: More robust support for checking things in $.index also exist in $.paths \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/tools/jsondoclint/src/validator.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"71904b7c5761171f3fbbbb5e1d7c9253ae2f5eff1c13096cafd11ba903834b6c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Their should be a better way to determine if an item is local, rather than relying on \u0060LOCAL_CRATE_ID\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/tools/jsondoclint/src/validator.rs"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc9fad0d0fc690fce3f0cc8e3dc260cc4273d6041c3cc88d9272130bf2fd0d3b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Make this failible, so jsonpath syntax error has line number. \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/tools/jsondocck/src/cache.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"b510d7309bd07dbcd3f966fe7f7ec4916872e6b0ade7e82180f6748e38422fca"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(lolbinarycat): refactor this parsing into something more compact with better error reporting. \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/tools/jsondocck/src/directive.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b833921d7df6b1bff75fd57315f203e0e74f41a97656f07f8127a1d83101600"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Make this \u003E= 3, and migrate len(values)==1 cases to \u0060is\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/tools/jsondocck/src/directive.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff6d964fee92ec1057a9537b100536ee186f7ac0db252c12eb6b263daaa8309b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Make this \u003E= 3, and migrate len(values)==1 cases to \u0060jq_is\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/tools/jsondocck/src/directive.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"f61f457a8fe4471bd3cb6c9206bdb729c0211e0174bc8aa918f2280ef933aa11"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(adotinthevoid): Show line number \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/tools/jsondocck/src/directive.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc57945b3df47e3012044d36ae91f007f069def82adadef672c7a5174dc648ca"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(adotinthevoid): Show line number \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/tools/jsondocck/src/directive.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ef8aea4de36946e820eabc637135ed7e5f4caa95bca984034d9440c1b4b81da"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: the three next warnings are about \u003Cpre\u003E elements which are not supposed 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/tools/html-checker/main.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef79fb28600768dea323c02bcc78185e2e8e540f370d8e33f29dc36d0faaa9cf"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: \u0060cdb_version\u0060 is *derived* from cdb, but it\u0027s *not* technically a config! \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/tools/compiletest/src/cli.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"c620d44aba91d0b9f5a3ce6e4f465bd1b9aa0a8dfc02487e8ad834cee58406be"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: \u0060gdb_version\u0060 is *derived* from gdb, but it\u0027s *not* technically a config! \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/tools/compiletest/src/cli.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"59b9edcfda063878c1c5fe097f03fd009d45314cdaf3fb9c31eda8a87458dcb0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: \u0060lldb_version\u0060 is *derived* from lldb, but it\u0027s *not* technically a config! \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/tools/compiletest/src/cli.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"68a770870f71a8e9d359492a422e9bbe1229b8c7d34d21c71dbfac69b9570894"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this is very questionable, we really should be obtaining LLVM version info from \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/tools/compiletest/src/cli.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"e32ec0e15658e3b2a4ff9ae2a9bc0e038c358080a1db1779fdadaed53f2e2809"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this run scheme is... confusing. \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/tools/compiletest/src/cli.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bcc87d072d56d8c3e3a1bc388d9c92603e0f805ba44775605ddf099c606f8f2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: this \u0060Config\u0060 struct should be broken up into smaller logically contained sub-config \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/tools/compiletest/src/common.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"c406126c5d367298b673eb9c684df5b3d9644f0898be93ae4597086cd0e543c1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: make sure we *clearly* account for sources of *all* config options. \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/tools/compiletest/src/common.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"41ac1072d611568cfffe4c730b3d675a68f98f88a0d60764c7d7ef8ac03f7dc7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: audit these options to make sure we are not hashing less than necessary for build stamp \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/tools/compiletest/src/common.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"87b24dc7684e65aa0a5ffdd9a412e7c43c655a825f80baec4d16ac0a6cfaf921"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: this is very under-documented in conjunction with the \u0060remote-test-client\u0060 scheme 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":"src/tools/compiletest/src/common.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f27ddc69c54ab9ad08e8a98a29931ed4ecfdbfe6696d913b72ad65a6deca52c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: maybe rename this to reflect that this is a *staged* host cargo. \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/tools/compiletest/src/common.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"5834ee84f05311c0d4d6a5e9ab20950673b5620f0f76fe688cc2e4c39f48cc67"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: this name is confusing, because this is actually \u0060$checkout_root\u0060, **not** 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/tools/compiletest/src/common.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"3466119d8c1b9729da82d541c8cab799fedfdfbac6914b6b10e2fc0a7ef0cced"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: this name is confusing, because it doesn\u0027t specify *which* compiler this 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/tools/compiletest/src/common.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"75ba0623b0e866793d39451b39fb51621e8d27e50efc12e2b82dfb26aa62bc80"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: reconsider this string; this is hashed for test build stamp. \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/tools/compiletest/src/common.rs"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"db28575f64f5111087c8309f3c16f14e22aec8911429114ccd479d9f23b36338"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: stop using stringly-typed test suites! \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/tools/compiletest/src/common.rs"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"620cdfdc2c6a8a51323230d4f8b62c028d372572963f04794da9216a0032f6ff"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: this is wired up through the test execution logic, but **not** accessible from \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/tools/compiletest/src/common.rs"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"326a71a652d6b74c3e9a885ceaaf77f5aa23b6299487a7afea95c3652df0b57f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: make it clearer that this refers to the staged \u0060rustc\u0060-under-test, not stage 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":"src/tools/compiletest/src/common.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b6e98768b1a465c2e65a32030af38d8535b6b50abc6f35bed4214d69165cee5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: make it clearer that this refers to the staged \u0060std\u0060, not stage 0 \u0060std\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/tools/compiletest/src/common.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbf6761cea1feb120218133a27baed3c21e2cde119e6a8f4e334e5e8ed986aac"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: make it clearer that this refers to the staged \u0060std\u0060, not stage 0 \u0060std\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/tools/compiletest/src/common.rs"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"95c58e1a3986f60ced88b1ef324c59be35d94f9917f4fa6da451442fb7ae8139"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME(#139660): the current hand-rolled test executor intentionally mimics the \u0060libtest\u0060"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/compiletest/src/common.rs"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"61e6bdf2be1e3dd3f6af2dcc9b7203f7a8d384ba302bcfc906ca3aac94102cdc"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME(#139660): ditto on test matching behavior."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/compiletest/src/common.rs"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"66bda5bb5e5c8d5219083f509a58a72892c5bde9a08ecbac79934d6733ea896d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME(#139660): ditto on test matching behavior."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/compiletest/src/common.rs"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dc5bc2c8aff66a50efe4a71f9478c877dff6dcc8b438daf0643aa8382077b57"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: make it even more obvious (especially in PR CI where \u0060--pass=check\u0060 is used) when 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/tools/compiletest/src/common.rs"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0c871cd079c0ebbb621b1be84b924c57178be5e0fa94ad83718fb8dbe120202"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: this scheme is a bit confusing, and at times questionable. Re-evaluate this run \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/tools/compiletest/src/common.rs"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8d4db6df2f7a386336c0d9335e32179dce0f5f7a2907a7de1b4b3e445ab1413"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: Currently \u0060--run\u0060 is a tri-state, it can be \u0060--run={auto,always,never}\u0060, and 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":"src/tools/compiletest/src/common.rs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"4352f71190df6106995990707c334a0249957ddceed930e400fb3ba27644b0a3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: the runner scheme is very under-documented. \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/tools/compiletest/src/common.rs"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"239c33f7b42c5822615f55bf72c824089b21cb6b9204d0cc3b4f602d6e959feb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: this flag / config option is somewhat misleading. For instance, in ui tests, it\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":"src/tools/compiletest/src/common.rs"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f2c3d6bc9f59efe87eb214b549780c38aa050f0badda77a2e6ce1f718fa5a8a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: this is an *opt-in* \u0022override\u0022 option. When this isn\u0027t provided, we try to conjure 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/tools/compiletest/src/common.rs"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7c0886212f5fa85ee8f6389b43a2b8a9875b7a2a319a73da24583ff052d7f7a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: \u0060cdb_version\u0060 is *derived* from cdb, but it\u0027s *not* technically a config! \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/tools/compiletest/src/common.rs"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"01ed5748134fa3c622506f1bfaac39693b80696b31773e53be127819cef04596"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: audit cdb version gating. \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/tools/compiletest/src/common.rs"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"04055cd15f82e90178c28f9a739a4a596270ab52ee1eb107b57200efb438a106"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: the fallback path when \u0060gdb\u0060 isn\u0027t provided tries to find *a* \u0060gdb\u0060 or \u0060gdb.exe\u0060 from \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/tools/compiletest/src/common.rs"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fc3e07e4bc784582125091c965c82eb8dc4c2f2a1e634873314cbbf494b8456"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: we are propagating a python from \u0060PYTHONPATH\u0060, not from an explicit config for gdb \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/tools/compiletest/src/common.rs"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"818050c10aa34159947e53f450a008191fbb6962ef3c83ecc3da3cf77b8c2c9d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: this gdb version gating scheme is possibly questionable -- gdb does not use semver, \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/tools/compiletest/src/common.rs"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef4dadf46e065214bf9a64858584eb2ef925b4be919b77d89cbf31278edb2e60"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: \u0060gdb_version\u0060 is *derived* from gdb, but it\u0027s *not* technically a config! \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/tools/compiletest/src/common.rs"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a8a992c1b75fde073b55a1f33494baf44465151970f952cc79613ccb2c8d242"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: \u0060lldb_version\u0060 is *derived* from lldb, but it\u0027s *not* technically a config! \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/tools/compiletest/src/common.rs"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"e93df882ca8cc6f026f2ad58585fcdb898c5d61ed366caf77d7324ce1663901a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: Audit the fallback derivation of \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/tools/compiletest/src/common.rs"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f961baed41da9699b224ef04ae84872d309f823c7854172f937768ad865097c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: take a look at this; this is piggy-backing off of gdb code paths but only for \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/tools/compiletest/src/common.rs"},"region":{"startLine":621}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d7792f84a2ce3ae3316b3b524140d85afcb91da1f500e5048e128bab7799d7d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: take a look at this; this is piggy-backing off of gdb code paths but only for \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/tools/compiletest/src/common.rs"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"961bf737d32efc29c914821a9c6f89dbabf99c80571d6f5d0df6b993b2a8bd01"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: take a look at this; this is piggy-backing off of gdb code paths but only for \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/tools/compiletest/src/common.rs"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"20371f7d1fc06dc1e5403cdc5f5df51139d133f8fff59d9f86ea6d882be6f2c0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: is this *only* \u0060arm-linux-androideabi\u0060, or is it also for other Tier 2/3 android \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/tools/compiletest/src/common.rs"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7ba9ca9946e2b6fa232e9ddf74ceb04752a3b243e8e7c7aac07b16811e211fa"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: is this *only* \u0060arm-linux-androideabi\u0060, or is it also for other Tier 2/3 android \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/tools/compiletest/src/common.rs"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e148fda3c7f9423826d85204e440ed3d7add991c683e7c82e6c5d68ef8923cd"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: take a look at this; this also influences adb in gdb code paths in a strange way. \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/tools/compiletest/src/common.rs"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"227919ff15986daec34fe98562023e9c0e5c1cf502f5c2a8e7508f9572c3a8c6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: this is *way* too coarse; the user can\u0027t select *which* info to verbosely dump. \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/tools/compiletest/src/common.rs"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"53d87440da9fbccd6b5e3e9c482607658aa42bd1077431939e654b00860ea475"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: the \u0060remote_test_client\u0060 scheme is very under-documented. \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/tools/compiletest/src/common.rs"},"region":{"startLine":665}}}],"partialFingerprints":{"codehealthFindingId/v1":"af74e3dfcce5392b25af0482e47257cfbd6b62b8807314fa4b0652fc10d485be"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: currently, [\u0060CompareMode\u0060] is a mishmash of lot of things (different borrow-checker \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/tools/compiletest/src/common.rs"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d67484086237392d4f58b19d46d482845b0e3b69b72a01bed11486f37f21817"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: treat this more carefully; \u0022stable\u0022, \u0022beta\u0022 and \u0022nightly\u0022 are definitely valid, 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/tools/compiletest/src/common.rs"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8f81a208df4081bbaa376c1fd423d5405d3a07991b4cd09a781d93af53bbda1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: \u0060compiletest\u0060 cannot trust \u0060bootstrap\u0060 for this information, because \u0060bootstrap\u0060 can \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/tools/compiletest/src/common.rs"},"region":{"startLine":696}}}],"partialFingerprints":{"codehealthFindingId/v1":"81098f559315ee57fcb0ebcf9b73c8fb8fcff7d45ec7d066f7f0fd8c8d6c1aad"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this really should be better packaged 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":"src/tools/compiletest/src/common.rs"},"region":{"startLine":707}}}],"partialFingerprints":{"codehealthFindingId/v1":"00a1f6a8a4cd053bfcefab67bfac072e69e24481da42bf0fe67342d624040124"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: these need better docs, e.g. for *host*, or for *target*? \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/tools/compiletest/src/common.rs"},"region":{"startLine":708}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e1f67781e299925420b40b5366e365eee8c4739950575f39a9a614f15b1a137"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: this is undocumented. \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/tools/compiletest/src/common.rs"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e8166704538379d514bf7d5aff4bcf8f8f0fe7eb0b3af45d3c0aa78f20612ac"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: how does this interact with [\u0060Self::force_rerun\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/tools/compiletest/src/common.rs"},"region":{"startLine":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"89267b7f96853bf93d0bac243d9944556955ba4f41294bcf505e7275013ec60c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: these are really not \u0022config\u0022s, but rather are information derived from \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/tools/compiletest/src/common.rs"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"483cb0b2e70c2de5dd1f16e7abe1cb96369cd18ff00200ce3af168a417dd4192"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: move them out from \u0060Config\u0060, because they are *not* configs. \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/tools/compiletest/src/common.rs"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"64578c3c0bc45dd17a2b62abf3319a747d6d16f3f33db284c844c19379bd3b7c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: this run scheme is... confusing. \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/tools/compiletest/src/common.rs"},"region":{"startLine":793}}}],"partialFingerprints":{"codehealthFindingId/v1":"432a7d824464b1c23dd7f400b89f5660e55700f14e3dd62972e1a09671b2ad1f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#135928): compiletest is always a **host** tool. Building and running an"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/compiletest/src/common.rs"},"region":{"startLine":898}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d4d19474b4d5596c7b39548226880badea0fac683978dbb8d836a166c361a6e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: in the long term, we should handle \u0022logic bug in compiletest itself\u0022 vs \u0022fatal \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/tools/compiletest/src/diagnostics.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"536f006b7c330f914c4ef84ba9f1aaad9031c933b84c67580c0a558e320f5ba2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(jieyouxu): this check is currently order-dependent, but we should probably \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/tools/compiletest/src/directives.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b167d7c15e3b67b55215fe5b2aa26421d63332b54ce1ad3f11675ddd05c1c67"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(Zalathar): Consider emitting specialized error/help messages for \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/tools/compiletest/src/directives.rs"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"87fe8b2ed2d6b47fee79ac536ffe30090f1460b630ca5b797787a4d37ce2055b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(jieyouxu): I feel like there\u0027s a better way to do this, leaving for later. \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/tools/compiletest/src/directives.rs"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"c42293ce41db85c02322282bb998292ae3876d9b85d6144948ec10fa95e29a02"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(pietroalbini): this test currently does not work on cross-compiled targets \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/tools/compiletest/src/directives.rs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"922d97d3107991adf50417601641f8d2c3a8dbacd86ad129f892649349165674"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(Zalathar): The form without \u0060=\u0060 seems to be unused; should \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/tools/compiletest/src/directives.rs"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"160b11897d692c7823a860d06701d8ac9960bf3c116a11b618dc8fb954df3fb9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(jieyouxu): fix some of these variable names to more accurately reflect what they do. \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/tools/compiletest/src/directives.rs"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"00e65cb89a332829b08b46c3e6f9c91b35a0ac5637b5b47f1a9038fc5f1bddbf"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Support escaped double-quotes in strings. \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/tools/compiletest/src/directives.rs"},"region":{"startLine":790}}}],"partialFingerprints":{"codehealthFindingId/v1":"86587911ed5c6f0e80d8139ea475e9478128e26d18802b67dca2a3dddfecddff"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Do unescaping in a less ad-hoc way, and perhaps support escaped \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/tools/compiletest/src/directives.rs"},"region":{"startLine":805}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff96967b46d5e7e6ce9f7de8eeceff231b16950107f324734eb81eb2955bed72"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME(jieyouxu): 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/tools/compiletest/src/directives.rs"},"region":{"startLine":819}}}],"partialFingerprints":{"codehealthFindingId/v1":"816929352b1d45b9ca398814709358b69241695b9d3ef2382afbc372d3a2949a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#147955): Replace this ad-hoc quoting with an escape/quote system that"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/compiletest/src/directives.rs"},"region":{"startLine":1453}}}],"partialFingerprints":{"codehealthFindingId/v1":"876626880ab4059193fef93da277a9ec533b78ed2ed02bc2a41f7c0f6f3ba4c0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: consider keeping only the canonical versions 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/tools/compiletest/src/errors.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"6be295aa411f6d022d05aa9402a13e14a63d8f8bac12eb3e7b0c6423a4e77c63"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //! FIXME(Zalathar): Much of this code was originally designed to mimic libtest \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/tools/compiletest/src/executor.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3b53927810f294b93d49668bc968716d0a7b9e77e736a0b7c506acd1221daee"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(Zalathar): Ideally we would report test failures with \u0060Result\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/tools/compiletest/src/executor.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8bf34c4f2ef17c88ddcf5a41c85003286606b047de9bbc68e9006f3f94752fc"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME(#139660): Now that libtest has been removed, redesign the whole filtering system to"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/compiletest/src/executor.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"edacb692d803d8858b05fe04c61eb570bac4619b28e76462399fbce31c77d7a1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME(#139660): After the libtest dependency is removed, consider making bootstrap specify the"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/compiletest/src/executor.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"26b4dfbdd3155eb294e994fd39bd6011ef218e09e807bccd40212291182dac4f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this should ideally happen somewhere else.. \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/tools/compiletest/src/lib.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c380c98a8bf9abee2424fc4fe98ca169a0b98d4b26f0a4c693f76f586262047"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME(Zalathar): Now that we no longer rely on libtest, try to overhaul \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/tools/compiletest/src/lib.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"8244633fb496e5bedf0fd08c3f00b2cd869a3db855b8bfb3ae3a1fa8b6422e2e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this walks full tests tree, even if we have something to ignore \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/tools/compiletest/src/lib.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"a11cc6d9b29869eca73834001871e03be088cfd358ffa581d3eb086fa34594e0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(Zalathar): Overhaul compiletest error handling so that we \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/tools/compiletest/src/lib.rs"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"f68e244d050d75004ea904450575dbfe70da95adf3f93475c84251c692c32722"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(Zalathar): Now that we are no longer tied to libtest, we could \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/tools/compiletest/src/lib.rs"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"f21de3146f2027e5d6c57d9b89e61e99c0839523da37bbb1014f5874c1b0b788"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(Zalathar): Perform all \u0060auxiliary\u0060 path resolution in one 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/tools/compiletest/src/lib.rs"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"8321779254071467be7ebc16a574bdca39f6dfd74b596953ea80d90c07111c84"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(Zalathar): This only finds auxiliary files used _directly_ by \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/tools/compiletest/src/lib.rs"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"feae3000303e0f05bbcf531427c681c7d3121c6ec4a55fc465cc888a2fa980f6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#139616): document caller contract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/compiletest/src/raise_fd_limit.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"157741a3a43ab2e0ac232978e6181b95a79d47937a75fc3bec0226e4fe8f89e3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#139616): document caller contract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/compiletest/src/read2.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef00c10723eb8b2e9e7a6193f7120bc40716d9f7681c5b38aecf7f8037a0295e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#139616): document caller contract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/compiletest/src/read2.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f7b6a1987fcd6130f540c26b503eb1aeb03933cc5de42a38c3d2cab4d99bcea"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#139616): document caller contract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/compiletest/src/read2.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aa75684a3b75e7a935611a0cd3774401cd3748c4c1aeda0ec2b4fb13530d00e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#139616): document caller contract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/compiletest/src/read2.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"39c210023313ce79740d78cac1bff3b73e7dd564ac106411460fae1e1624b1f0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#139616): justify why this is sound."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/compiletest/src/raise_fd_limit.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d1edbc1c65b6685fb79e57719dfad33a85e7892cac426e4159a61e0b327de24"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#139616): justify why this is sound."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/compiletest/src/raise_fd_limit.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0ec7e894fbabc1b6e67b434b78d5537225031421e95611920ae0dfd55322f35"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#139616): justify why this is sound."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/compiletest/src/raise_fd_limit.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"3adc1060736ad4178476e8c154f8e378daafe949facfb8c0e407e046cc52fe4d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#139616): justify why this is sound."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/compiletest/src/read2.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"626f9dc2ede5e043721f566b3871dc403ceacd2c3c86c65fee356e838d097678"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#139616): justify why this is sound."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/compiletest/src/read2.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"c32244bb9fdb3c194a5f9822a71fa3d13237e1b17b9bea559ee6285b40130da8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#139616): justify why this is sound."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/compiletest/src/read2.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"39c2993135aed96fe32af3f2cf36882e484cb3339e77f9c8e6affbb022192891"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#139616): justify why this is sound."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/compiletest/src/read2.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e81b34d5187c98275b16be8e7e302418945a4ff586a40fcfc9df14f1e6a9b31"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#139616): justify why this is sound."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/compiletest/src/read2.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"851e740697f87a70424d5d40fcc4e3324974a1caaf13995c92c28ef64150f14c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#139616): justify why this is sound."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/compiletest/src/read2.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3e653513affcc64b400f91c2568f32a2ea47c6c763aa85698706e2990947a94"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#139616): justify why this is sound."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/compiletest/src/read2.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f2836e5586057e6bd849ac45b6a954779ad30ff0888d4ac695ab554688d7141"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#139616): justify why this is sound."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/compiletest/src/read2.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfd2e554c9d9ff9161cf9ade382144e1d96e583bc7954de16e5ee6d810a6ceb1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#139616): justify why this is sound."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/compiletest/src/read2.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aeac5c26724a42699f25a56cbb93ded62c57dc596a1e74ec009bac67fd6588b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This is a complete copy of \u0060cargo/src/cargo/util/read2.rs\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/tools/compiletest/src/read2.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"61b6330fd9406e58ff02b48cf9d199f0f863f1afd90d705ba16326c682ac7f8d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME maybe use \u0060rustc --print file-names\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":"src/tools/compiletest/src/runtest.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfcd5c715f5d541fd88c345d005aead42c715ae4f29f94c1160bfc36186b784b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(jieyouxu): this search path seems questionable. Is this intended for \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/tools/compiletest/src/runtest.rs"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"57a2deb38f78024e94b8873d5901e7a1c6336b79ea17730b316432e5636dde6b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: ideally we would \u0022just\u0022 check the \u0060cmd\u0060 itself, but it does not allow inspecting \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/tools/compiletest/src/runtest.rs"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cf8e7db11410ce80f21781990496fb1eb06603f7163e4cb2a70f99f940a4830"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Ideally, we should check this at the place where we actually parse error annotations. \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/tools/compiletest/src/runtest.rs"},"region":{"startLine":896}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc1b57cc1b1236fa5b2553f3dbc18dc35355dea6c064a603e9281d8f93aeb12f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(Zalathar): We should probably also warn in run-fail/crash \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/tools/compiletest/src/runtest.rs"},"region":{"startLine":976}}}],"partialFingerprints":{"codehealthFindingId/v1":"19a7a5ee85367a49867126d9fd3c21896718b147f189256203637e1ea3e647cc"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(Zalathar): We should have a cleaner distinction between \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/tools/compiletest/src/runtest.rs"},"region":{"startLine":1682}}}],"partialFingerprints":{"codehealthFindingId/v1":"6771a16210520ae8ec1eaadddd09ecf8464bc64e55db89c830c805951749534e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: I feel like this logic is fairly sus. \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/tools/compiletest/src/runtest.rs"},"region":{"startLine":1736}}}],"partialFingerprints":{"codehealthFindingId/v1":"26955a8f1f1400382fd40eb1651620dbff8f210bfc9b7a2e45c144080d60613b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(Zalathar): We could also optimize run-fail/run-crash 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":"src/tools/compiletest/src/runtest.rs"},"region":{"startLine":1788}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f9d8362682636c15bad9d7f72ad793a5a690fe12b33a4748ef8991aa756ac74"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: use this for other modes too, for perf? \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/tools/compiletest/src/runtest.rs"},"region":{"startLine":1865}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a953ad86a364070cee54c70dc458dfd99b88ba50e86b60c89d9eadf066a0eb6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(jieyouxu): we should report a fatal error or warning if user wrote \u0060-Cpanic=\u0060 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/tools/compiletest/src/runtest.rs"},"region":{"startLine":2070}}}],"partialFingerprints":{"codehealthFindingId/v1":"978e960212bd2497eed952d1f4e2c51c7d9621a819a34d170ed92a206d31d565"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This is using the host architecture exe suffix, not target! \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/tools/compiletest/src/runtest.rs"},"region":{"startLine":2096}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b40f857918aca15a984f107ab922fb28e751a8da24c16207c7f567e52fde9b9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#134510): auto-registering revision names as check prefix is a bit sketchy, and"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/compiletest/src/runtest.rs"},"region":{"startLine":2326}}}],"partialFingerprints":{"codehealthFindingId/v1":"209ff68e306bc52df3cef0fbd5f667bdf8f7a6c71a968164a919368caf6b43bf"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: tests are allowed to use a revision name as a check prefix. \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/compiletest/src/runtest.rs"},"region":{"startLine":2332}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ac9ead9a960628ae8778345ad03c149512cd8f5808863a4a2e7b672480a3f5f"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: the filecheck tool normally fails if a prefix is defined but not used. However, \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/compiletest/src/runtest.rs"},"region":{"startLine":2337}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbc95b261a14030d6907852f886890d55714cfb8340e11296109d90c7d098809"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(jieyouxu): don\u0027t pass an empty 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":"src/tools/compiletest/src/runtest.rs"},"region":{"startLine":2348}}}],"partialFingerprints":{"codehealthFindingId/v1":"93f835241560ca67429d0ecc7f06d909c8cefa471bffb480cbb2805f55163a79"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(jieyouxu): don\u0027t pass an empty 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":"src/tools/compiletest/src/runtest/debuginfo.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf45a0858304a429b3dd7cb4add85ba6a71e248721068dd0c775f8584fc351bf"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: it would be much nicer if we could just tell the remote-test-client to not \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/compiletest/src/runtest.rs"},"region":{"startLine":2520}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5b13a2116366a57ea5f2de19a9d05981e2127ea907087b7eee25331ee8bdbcf"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We ignore the first line of SVG files \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/tools/compiletest/src/runtest.rs"},"region":{"startLine":2878}}}],"partialFingerprints":{"codehealthFindingId/v1":"7703a890f9a5901c25190cb4a380cd41d11e37a9870e49d4c50abaae8ad7b5e1"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: instead of checking if each hunk is empty, this only checks if the whole input is empty. we should be smarter about this so we don\u0027t treat added or removed output as normalized. \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/compiletest/src/runtest.rs"},"region":{"startLine":3043}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dce5dc79878560ae4d6e425e35916c8b7e2910bfc48dc2460073bd6ee435d55"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: respect diff_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":"src/tools/compiletest/src/runtest.rs"},"region":{"startLine":3052}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8961a18a52ca2bb18a01800f19cc01e7282e16f9df3b6427b39978901494984"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Why do we need to ignore the edition? \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/tools/compiletest/src/rustdoc_gui_test.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f1ace79138a8b08daaed04bb1c180ac7f3cf8e35e1fceda694b26c1d976fe86"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME(#143827): this setup feels very hacky. It so happens that \u0060tests/rustdoc-gui/\u0060"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/compiletest/src/rustdoc_gui_test.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"3168713f72002dfdab03b5f685f5da6ddb951a8c246c47b26d5668d2b71705ed"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#143827): spelling this out intentionally, because this is questionable."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/compiletest/src/rustdoc_gui_test.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a8cada37a8b35dd279eab8586ba8dacf5259a316c2896f586143b544ab18e66"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: If can reliably detect that MSVC\u0027s link.exe is used, then \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/tools/compiletest/src/runtest/debuginfo.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"16ebdb19415d96cf2ce27666ed4500c9b917f88badc456750e4ed6b570753639"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: we are propagating \u0060PYTHONPATH\u0060 from the environment, not a compiletest flag! \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/tools/compiletest/src/runtest/debuginfo.rs"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"79a95bc253271d877908db276e72ead39ef9558bb5ea12c2ca010714a00098de"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(jieyouxu): there almost certainly is a better way to do this (specifically how 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/tools/compiletest/src/runtest/run_make.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc815a931085a4764163057314bc6ec6611611e175f849b1355c9f6d7cb7c877"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //FIXME: Add bless option. \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/tools/compiletest/src/runtest/rustdoc_json.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"8366c4adbafd25aa73c331786e0ad51b897bf9c3b1b6e8944f7eb2d62d078d03"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(Zalathar): This currently allows either a space or a colon, 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":"src/tools/compiletest/src/directives/cfg.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfcb2db57ddd42538c96ecb1cf763a95097ecb0585b1bf4a4b6af94547c54d95"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(Zalathar): Use proper target vendor information 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":"src/tools/compiletest/src/directives/cfg.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"d53179d19a5643f0160c2450819962fd40caef3d72de48521df38d911fbd061b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(Zalathar): Support all known binary formats, not just ELF? \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/tools/compiletest/src/directives/cfg.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"28e3a6ae86baac210b0975691a7f46febbb7cffcd1115a667404847f6af67340"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(Zalathar): Ideally this should be configured by a command-line \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/tools/compiletest/src/directives/cfg.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"2455ca644a208e4e0789e456646cdc16be974ec3dbb33c234e28a92409d49359"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(Zalathar): Now that most directive-processing has been extracted \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/tools/compiletest/src/directives/handlers.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"2066d814ad6f5f46af08d88fc25917490e514cd9f5840a6fa76ba189262c322b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#147955): Extract and unify this with other handlers that"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/compiletest/src/directives/handlers.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea5840c6e96bab6dde1ef9883fb28008a67dd669e59a408f755749f5f3d75eaa"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#147955): Extract and unify this with other handlers that"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/compiletest/src/directives/handlers.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"881562af18b121d828cbaf4660815bc855a0e4b02f3b268659537daffba676e4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(Zalathar): Someday we should add unified support for declaring \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/tools/compiletest/src/directives/handlers.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"48b745168ad3ecbcae7713a38f82063fe2d68a4627806cb6dec1ac8921405a6a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Just report the error, poison the context and keep going. \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/tools/compiletest/src/directives/line.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b1c751d94beae165e51ccb1bdd3489fb222fb9de087e58375878d9c96825fd6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(jieyouxu): share multi-value directive logic with \u0060needs-target-has-atomic\u0060 above. \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/tools/compiletest/src/directives/needs.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ccefe9c7e8f3abd00e50aab41dd8c1916a79295df8a1e0e70c723f7b84c4036"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#135928): this is actually not quite right because this detection is run on the **host**."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/compiletest/src/directives/needs.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1cda8515381d7940eff61a2a5ca833f0b64b621e98b6833b01c64fd7296378f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#149764): This actually queries the compiler\u0027s _default_ backend,"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/compiletest/src/directives/needs.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"533ddbdbb7fd9d5acb0fbee7b7e8efe0210a72618c171faa1319ae0cdd41b367"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: for some reason the modules are linted in a different order for this test \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/tools/clippy/tests/compile-test.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3fc36e034209ddd471c11b376c77b62f0c59f16c124cae5dbdd651c6b59de49"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(f16_f128): add a clamp test once the function is available \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/tools/clippy/tests/ui-toml/toml_disallowed_methods/conf_disallowed_methods.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e2aa139f34778bf46d99dbb72dca28c9dcb0735e9ca69abe2682486b7d80fd9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: macro calls should be checked. \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/tools/clippy/tests/ui-toml/absolute_paths/absolute_paths.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"e961a51f90a9c0c9a578c0d7579b40447a0bbeac96afc3ad17bf011c0f66916f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: derive macro paths should be checked. \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/tools/clippy/tests/ui-toml/absolute_paths/absolute_paths.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cfd5197da791f578930de636a87608d0e9e8a370b27d9991bb7982bc5409e2b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: find a way to add rustflags to ui-cargo 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":"src/tools/clippy/tests/ui-cargo/module_style/fail_mod_remap/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4b484d5199a12da71f180495ba4cb1b6d83cb3624b7b5989149e698e0620a77"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this should produce a warning, because the attribute says 1.58 and the cargo.toml file \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/tools/clippy/tests/ui-cargo/cargo_rust_version/fail_file_attr/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a53b6f378e384ffca75dfddf0fffe2fdd1f2c4f51a519c17d82dab0abca00231"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: turn into an MSRV aware lint after const traits are stable and \u0060PartialEq\u0060 is const stable \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/tools/clippy/tests/ui/assert_is_empty.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f3152625b0733a7d3a881394138b10bc4c62fba670d9f1077a07d7579c0bc72"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: FP, because the \u0060MutexGuard\u0060 is dropped before crossing the await point. This 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":"src/tools/clippy/tests/ui/await_holding_lock.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae643af020e50e254ac28c18090356e3562b97457ce7227f6318d834cc0de945"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(f16_f128): add tests once const casting is available for these 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/tools/clippy/tests/ui/cast.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"731f8a6d80492264ba6ef8452f74f4e1d1316e7ddf86982f5022594f8164fbaa"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(f16_f128): add tests for these types once const casting is available \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/tools/clippy/tests/ui/cast_lossless_float.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbbc7ce1911429877a0ff980c1397b241fb1c8f0bd877ee69fadc1c3bd255a3c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(f16_f128): add tests when constants are available \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/tools/clippy/tests/ui/cast_nan_to_int.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"90b8b1ec14a9fa87c7d35f57cec009073bd8a94b8023487d2a114ee1420cd624"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(f16_f128): enable f16 and f128 conversions once const eval supports them \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/tests/ui/cast_size.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"c950f9b6a2dc438442db9e0c05a9777cfb491b269254f6cd9eb30abe28195096"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Expand \u0060collection_is_never_read\u0060 beyond collections? \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/tools/clippy/tests/ui/collection_is_never_read.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"f82f1e60ca4fc72f7ad9d5fb0094764f113377fe77ba4af84f7cd7d548a94e4b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Warn here, but this requires more extensive data flow analysis. \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/tools/clippy/tests/ui/collection_is_never_read.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfc4c01aea490df23402e1895cfaa1e935a882bf6911b3d181aa3a4f7d146e3b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Warn here, but this requires more extensive data flow analysis. \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/tools/clippy/tests/ui/collection_is_never_read.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6309120bf7aa4ef605e9a35792783961e0bd9bd0fde410fb5bcf6f650a2d735"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: suggestions on \u0060move\u0060 closures will change the behavior of the iterator (rust-lang/rust-clippy#17646)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/tests/ui/double_ended_iterator_last.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"52b574fde3055a057c3ef4d528cd77c34c36a6a74b05cfb53ca59642968e7a33"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this problem is documented in \u0022Known issues\u0022 section (rust-lang/rust-clippy#17829)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/tests/ui/double_ended_iterator_last.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"84d76060a34353e44edfa1a0695949032482f7844a5b0af6b773c30fccc52c79"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: detect this and suggest \u0060=\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/tools/clippy/tests/ui/equatable_if_let_const_cmp.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c8607143f4c767d21a27fade015661c051870166708da2edda8961bef1cdaac"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // // TODO add inferred type tests for f32 \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/tools/clippy/tests/ui/excessive_precision.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"b73cc44a1131515ad7dc904809e1ae4d7b82ef45c85638b205cd4f7f409baf60"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(f16_f128): const casting is not yet supported for these types. Add when available. \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/tools/clippy/tests/ui/float_cmp.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e04f72d907e353d9600128761d8d19dc9be2c1640a647b2f39d92ead55c4839"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(f16_f128): add tests when exp is available \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/tools/clippy/tests/ui/floating_point_exp.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7481256c721127e48e21414535111abbeac4d2dd46ab9c05632953918f19cf60"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(f16_f128): add tests for these types once math functions are available \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/tools/clippy/tests/ui/floating_point_log.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d314f2b8987472ee290c246dc266125604fb81a877d8b0079730787559ecda6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(f16_f128): add tests for these types when \u0060powf\u0060 is available \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/tools/clippy/tests/ui/floating_point_powf.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f329273172998db6b4477fcf24c998f1fe0b06da6273aaad9072dd47a107b37"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: recognize the already imported \u0060fmt::Write\u0060, and don\u0027t add a note suggesting to import 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/tools/clippy/tests/ui/format_push_string.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e10811628c37c1b3e7880ceaf84dc8891b7adc6535be35c281f408ab67ef04a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: recognize the already imported \u0060fmt::Write\u0060, and don\u0027t suggest importing it again \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/tools/clippy/tests/ui/format_push_string_no_std.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"49c08757bb0adafb98e1a07d9a9d349ea524df9219cfdcc184f4143577eba296"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: suggest importing \u0060std::fmt::Write\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/tools/clippy/tests/ui/format_push_string_unfixable.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"9718ff9edf1e36604415f833cdd4357a550b9f037101871033ee7c906f16a1ec"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: suggest importing \u0060std::fmt::Write\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/tools/clippy/tests/ui/format_push_string_unfixable.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"47572f21f9d6b505cc22362f3ab0b1191fc075c96c9092e38e0b02ac0df8e6a1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: suggest importing the first time, but not again \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/tools/clippy/tests/ui/format_push_string_unfixable.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"11186bc513b49596f83284f52db6cdf2ca10ac7d6056595bc197dc6a29eda2f6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: suggest importing the first time, but not again \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/tools/clippy/tests/ui/format_push_string_unfixable.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cedc8b7660cfab6722423049bb37d48a1de0963b08148e3db01125014861dfe"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: suggest importing the first time, but not again \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/tools/clippy/tests/ui/format_push_string_unfixable.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"03176a58302de337b5da6ce6beb197d329036bf07672381de244da9eaf64be02"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: suggest importing the first time, but not again \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/tools/clippy/tests/ui/format_push_string_unfixable.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"df2eaa81610517433357fc672ae8c1854d354689d358d99f37077aa579abbbfa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: suggest importing, but only for \u0060bar\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/tools/clippy/tests/ui/format_push_string_unfixable.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c29a37b37e25cb35e18b5028cd901296b3eed4841d6aa784b20a96196bac029"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: suggest importing, but only for \u0060bar\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/tools/clippy/tests/ui/format_push_string_unfixable.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"24db889565e4729cd76152c55d6fef41e15002d9aec949d98a489cd7f820a31d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: stuff \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/tools/clippy/tests/ui/let_and_return.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ca8244e1cb28b32c9c125a222a1001d11bff81c14de94e4d26f019f3c3e36fa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Fill \u0060stuff\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/tools/clippy/tests/ui/let_and_return.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a390e2cc01c157c7f8a652698b4c4d1b257d20fb22e209b034fed56f3252b10"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: we could extend the lint to include such cases: \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/tools/clippy/tests/ui/let_if_seq.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"70deaa43b53665e16ff6b159926344a2c392b1127e8f9356460d5bfd38371550"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: bunch of patterns that should be linted \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/tools/clippy/tests/ui/manual_abs_diff.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8e015eb7ed92303d125c428f20e4dfbd1564af6233853acde7b5f5a953cd28f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME suggestion may have redundant closure \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/tools/clippy/tests/ui/manual_filter_map.rs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"722fead060081f415b68a366360def726c722214cb7b557c5e8ccdcede3bf7a3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME suggestion may have redundant closure \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/tools/clippy/tests/ui/manual_find_map.rs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"c81c7b10db58ee02654cd0f78244d2e7175fa134192a00fc763c28413284a8c3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(f16_f128): add tests for these types once constants are available \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/tools/clippy/tests/ui/manual_float_methods.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f67a7b3b695531a1bb14ddefe961661e2f38ee9f4139ccdf0190ffa1a052135"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO:: these are rare, and might not be worth supporting \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/tools/clippy/tests/ui/manual_ignore_case_cmp.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"e53ea49aa95bb7a4829a575d0089fc25b6bddaa892b47a14deeeb232e2955bc8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO also support unused bindings aka _v \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/tools/clippy/tests/ui/manual_let_else_match.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"4602b25800cf2b7cfa8d5ec4688d3006c468d8f7098f111a90426b01560645bc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO patterns not covered yet \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/tools/clippy/tests/ui/manual_ok_or.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bb6bad89d4e5790956bb22dc1c38046b2102a2ea294f7e6d5d5ad92ff396243"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Reduce to \u0027A\u0027..=\u0027Z\u0027 | \u0027[\u0027 | \u0027\\\\\u0027 | \u0027]\u0027 | \u0027^\u0027 | \u0027_\u0027 | \u0027\u0060\u0027 | \u0027a\u0027..=\u0027z\u0027 \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/tools/clippy/tests/ui/manual_range_patterns.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"165ba5e0ed36d8f7e8bc64118f8b944c487c5eb0ce06e32e6f8922d6b4c1e509"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(@Jarcho): Check why this doesn\u0027t trigger after rustfix \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/tools/clippy/tests/ui/manual_rotate.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b300ab8ab9b87739a8ebf1aec1bebedcf200ee00bc687648055bce660f4d5890"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: macro args are fine \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/tools/clippy/tests/ui/manual_str_repeat.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"72e3058352cb26a28678a787a76f912f59dfd8607cc8b046ba776f258cbc9340"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: also match on loop\u002Bmatch or while let \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/tools/clippy/tests/ui/missing_spin_loop.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d42460e6d639130cf08c1973adec1856c1b2da3eba99db7a8d909ce70e64347"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This should also warn because it creates the public path \u0060foo::FooIter\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/tools/clippy/tests/ui/module_name_repetitions.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"318e4ebfb58304ca6287f425ac6d86298e6c9de6ff69b0fc8121e89f74812d6e"}},{"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/tools/clippy/tests/ui/mut_from_ref.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c947070c149168a69563b29614a8462722669bcb09413fe9869ea51ebd93bfc"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: warning because it is not immediately followed by break \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/tools/clippy/tests/ui/mut_range_bound.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f530db7dde3bb540edf6ef36685cb795f53071a525624f8b89e78b003f4b583"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: \u0060bool_comparison\u0060 will propose to use \u0060S == true\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/tools/clippy/tests/ui/nonminimal_bool.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"3522c0e19ff2c2a0d6ccc1d3e96731b2765dd68f4fd0695a756bd8d5cdca7713"}},{"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/tools/clippy/tests/ui/nonnull_unchecked_on_box_ptr.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"695d550f07755636663386b6a1e35521a76d26f5bcb1ff8d852582da6df1ec18"}},{"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/tools/clippy/tests/ui/panicking_macros.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"179d9ac12e69f60d2636e8d8804b8b95150e20e50d93910887adf1c544000083"}},{"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/tools/clippy/tests/ui/panicking_macros.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"39ee8c9cf81d39bf7efac5c8ec25ed41c476cc15f651c11e1322011c8836d715"}},{"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/tools/clippy/tests/ui/panicking_macros.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"513f66961a4bf963844efc2332f12f221952a90932bf42e9589405cf927e1e92"}},{"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/tools/clippy/tests/ui/panicking_macros.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f928a77d6655fa8f1ae9a6c76d2f7f9872c42417e5c4ad7a83e66ec2e35cd95"}},{"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/tools/clippy/tests/ui/panicking_macros.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ec9558553d61edc9e077f76664793fa9e3a9ddde8380fcdf603230556a97933"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: \u0060is_from_proc_macro\u0060 incorrectly stops the lint from firing 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/tools/clippy/tests/ui/ptr_as_ptr.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"e518aa02c71ec86c1481237475ec43345d63f404b133100c19641a329845ce8e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Ideally these suggestions would be fixed via rustfix. Blocked by rust-lang/rust#53934"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/tests/ui/significant_drop_in_scrutinee.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c702b7d185d778dd12a88046b2957f2cf9a090e5b40a828eee645f8b57ee8e75"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: The lifetime is too complex to analyze. In order to avoid false positives, we do not \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/tests/ui/significant_drop_in_scrutinee.rs"},"region":{"startLine":758}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d02adb55f8b09635c251d99ea2742d7f8f9cd971f4aa7832dc53345ead32b8f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Process the error properly. \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/tools/clippy/tests/ui/single_match.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"842d2874a6c59ee75ec0416e07912c89489e1e8786df556ad5a34953030e3e8b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: [0..200; 2]; \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/tools/clippy/tests/ui/single_range_in_vec_init.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"401850ea207414b3cba6a15a6a8e9e61e6f1477f618086cd64755a656200f588"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: [vec!0..200; 2]; \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/tools/clippy/tests/ui/single_range_in_vec_init.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"529fb75611500ea5551b23a2329e08afd849cf73e54e36dc177d1a63b941ea09"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: should lint \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/tools/clippy/tests/ui/transmute.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ded7038fa71def107df127be2a35c47ce91de73abced670543eb31cf37b4719"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: We could try testing vtable casts here too, but maybe \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/tools/clippy/tests/ui/transmutes_expressible_as_ptr_casts.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad7b6d22a9348224769dceb45a2bacdd5caa641800a1eb34c41080a119075cf0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This is not caught \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/tools/clippy/tests/ui/unnecessary_safety_comment.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8510f6cd554940e18891167609ed9d5802e029af7c901d25cc0dd62d59b67b8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(f16_f128): add tests when math functions are available \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/tools/clippy/tests/ui/unused_rounding.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a6b1ac04d816965f72bfd469fc46e55100f8bcaac3908a505abdd640aa23636"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Suggested fix results in infinite recursion. \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/tools/clippy/tests/ui/use_self.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"207cdeae1e7181dd5b27bfb9994269e6de0ef73060941d95f6a0af5e5014486e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: ^Broken by PR #15611"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/tests/ui/use_self.rs"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"86a20ce876b4c96e28637e9e88efeb1a33bf426c30a23305abb4491f9f2949b2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME this is a false negative \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/tools/clippy/tests/ui/useless_conversion_try.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"e505a1d081f8978140f42051a518f9a758af724b53acbd13453dea547b6c8163"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: When the \u0060break\u0060 statement/expr in the \u0060let\u0060/\u0060else\u0060 is 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/tools/clippy/tests/ui/while_let_loop.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6f562e4c6f8702693a6cb55210da903cf69160eb2914c0f0a39c71899b3bd83"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: consider moving the defintion\u002Bimpl inside \u0060issue_14681\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/tools/clippy/tests/ui/zero_repeat_side_effects.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ad93e2b0916d04198d439f06dcfc78223eb55c818ab64a1396217fe9b4d8b45"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const_trait_impl) \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/tools/clippy/tests/ui/missing_const_for_fn/could_be_const.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"110358345a5c6e4e0f18cd324e20016229287ac7c30b583407bbc3c478194fe9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const_trait_impl) \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":"compiler/rustc_trait_selection/src/error_reporting/traits/fulfillment_errors.rs"},"region":{"startLine":4169}}}],"partialFingerprints":{"codehealthFindingId/v1":"769d727ea3aced96de3fdc6409f9c88ebbdbc0733830506cdaa3bbaa9d44c60d"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: Syn uses \u0060Span\u0060 from the proc_macro2 crate, and does not seem to reexport it. \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/tests/ui/auxiliary/proc_macro_attr.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"be36b46c6a611a06bba68407c3432e841671d86a25a5c22ffb0e9ec3322c292a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: switch to something more ergonomic here, once available. \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/tools/clippy/src/driver.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"a517cab44feca22845154f6f7a2e755f0bea814b7c494505af7e7a06ccc6c22c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: switch to something more ergonomic here, once available. \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/tools/clippy/clippy_utils/src/lib.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"40561948058d4b3ced5c1dbc761dbe235119d4c14ada31c6acc273bead431d48"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: #4825; This is required, because Clippy lints that are based on MIR have to be"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/src/driver.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"f51905b89e6b32417ab71c8acdc1f444e691cbafb09bf02fc76d81b72b73d265"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this macro calls unwrap internally but is called in a panicking context!  It\u0027s not \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/src/driver.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"af0a685ff8bfd2aced73a746424ce9c5f994078aa89955cfac5a2f07e9b0734d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(@Jarcho): Handle all arguments here without breaking too many existing callers. \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/tools/clippy/src/main.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"94d46e8ec9b854c1cdf93444dac57348b8bba6d886960b85ed7e6dc5ca6545ee"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //FIXME(mejrs): this should really be checked during validation \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/tools/clippy/clippy_utils/src/attrs.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"20fa1e9c1f47d36c467a0b11c54b778da8fba1e070509453d8342881c6d968ec"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(f16_f128): use \u0060f16\u0060 once builtins are available on all host tools platforms. \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/tools/clippy/clippy_utils/src/consts.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1ce5dc31fde358b5cace6362d3a55f0e4fbcbf8276a7eaffdc7f46a6d468c41"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(f16_f128): use \u0060f128\u0060 once builtins are available on all host tools platforms. \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/tools/clippy/clippy_utils/src/consts.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"0204eeca2f69ef793fefc49cf68024d303421a94f60e89f1810319a21230099a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: are there inter-type equalities? \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/tools/clippy/clippy_utils/src/consts.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4a04875870d7b7b93100067e46239d27f510179da44c0cefc50fade01699854"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(f16_f128): once conversions to/from \u0060f128\u0060 are available on all platforms, \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/tools/clippy/clippy_utils/src/consts.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac7fac5e888429d3dbf91520fc702e0a96c77c9e0d6bceb1910005717efda702"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: are there any useful inter-type orderings? \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/tools/clippy/clippy_utils/src/consts.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f13a9022e0d465f7429a042fa9e5e64e7344b1e3a2c6ec08878c8973e46c7d5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(f16_f128): add f16 and f128 when constants are available \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/tools/clippy/clippy_utils/src/consts.rs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"614815153cb8bc3c462588aeea94ffa077e060cac21805424a52a28161009f21"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(f16_f128): add f16 and f128 when constants are available \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/tools/clippy/clippy_utils/src/consts.rs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"955dae1cff1c168d42d6a20f35e113f3003d96a0d4dfe9a02da3af78f890f1d6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(f16_f128): just use \u0060parse()\u0060 directly when available for \u0060f16\u0060/\u0060f128\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/tools/clippy/clippy_utils/src/consts.rs"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"22910fba80b3119b0e7d29fdfd17861143ace14675f81350ce054f30b4125232"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: revisit when feature \u0060gca_min_const_items\u0060 is stabilized. In the meantime, \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/tools/clippy/clippy_utils/src/consts.rs"},"region":{"startLine":919}}}],"partialFingerprints":{"codehealthFindingId/v1":"500f981ab1291c849ceda12c718b2098347ae0bb6ca4b1edc919b01c3e3148e2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: f32/f64 currently consider \u00600.0\u0060 and \u0060-0.0\u0060 as different. \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/tools/clippy/clippy_utils/src/consts.rs"},"region":{"startLine":1062}}}],"partialFingerprints":{"codehealthFindingId/v1":"d468322e31f140d89b5506dda783ee1fae98f4b3cf4cfde1d5edbe5697fbbf41"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(f16_f128): add these types when binary operations are available on all platforms \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/tools/clippy/clippy_utils/src/consts.rs"},"region":{"startLine":1102}}}],"partialFingerprints":{"codehealthFindingId/v1":"30fb559858c6e8a085b1e075367c45489da4cc226566134a28a2a0614f7d87f7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(@Jarcho): Allow eager evaluation starting with 1.102. \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/tools/clippy/clippy_utils/src/eager_or_lazy.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8938399d3b34fa730d17d989e1ff25eec1d956e4755c830dede352a61f3827d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(@Jarcho): Allow eager evaluation starting with 1.102. \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/tools/clippy/clippy_utils/src/eager_or_lazy.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"198d7935f8e7fda90738847c507facb75b8f35d2e6b0da4f1e8664635083540c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(@Jarcho): Allow eager evaluation starting with 1.102. \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/tools/clippy/clippy_utils/src/eager_or_lazy.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b153095ebfb17a18ed29c54977a3360442267bbd9f933af184b83469e81cc55"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Actually check if either of these are true 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/tools/clippy/clippy_utils/src/eager_or_lazy.rs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"d67ea6f717f02fd6acee9ce7d2ba6556e7f516c5994fb0ca070a14792fee854a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(flip1995): may not 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/tools/clippy/clippy_utils/src/hir_utils.rs"},"region":{"startLine":862}}}],"partialFingerprints":{"codehealthFindingId/v1":"92047802145cd8538f743a7e83f4c1ff208896389bd3246be4151d7b0bc383b8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: this could be extended to check for identical associated item bound constraints \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/tools/clippy/clippy_utils/src/hir_utils.rs"},"region":{"startLine":921}}}],"partialFingerprints":{"codehealthFindingId/v1":"351f2f5956f2cd78e799cf4b2316fb50447fd76b9050b3b5f55bcf02b4a42f65"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(scrabsha): probably hash the fields as well? \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/tools/clippy/clippy_utils/src/hir_utils.rs"},"region":{"startLine":1659}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bc9696a7f5e7405a8806481c71b0d801525a6586c3a7a5920acbdaa97f3b84c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: check if the local has been partially moved. Assume it has for now. \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/tools/clippy/clippy_utils/src/lib.rs"},"region":{"startLine":817}}}],"partialFingerprints":{"codehealthFindingId/v1":"f57fdc5c58801dec2c6b242cf02cacfe8b410b4f2dd0f9f2a8297197283caf43"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: should be implemented using rustc/mir_build/thir machinery \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/tools/clippy/clippy_utils/src/lib.rs"},"region":{"startLine":1505}}}],"partialFingerprints":{"codehealthFindingId/v1":"b66900df8c667e5388c1100b9f48e069b1c973ff3d14eeb1e74a9a9ccac10c76"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: should be the honest check, that pats is exhaustive 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/tools/clippy/clippy_utils/src/lib.rs"},"region":{"startLine":1529}}}],"partialFingerprints":{"codehealthFindingId/v1":"583c44c9e22f66fb6e3abef55fe812a369f704585b30fdde62d9ec0b83b35a92"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO these types need to be recursively resolved as well \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/tools/clippy/clippy_utils/src/lib.rs"},"region":{"startLine":3283}}}],"partialFingerprints":{"codehealthFindingId/v1":"558c98bbaf3c488a721e7737dcacb9b71ab01ead95f0f7ce15eef887127a589e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO make use of \u0060use\u0060 items. Maybe we should have something more sophisticated like \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/tools/clippy/clippy_utils/src/lib.rs"},"region":{"startLine":3320}}}],"partialFingerprints":{"codehealthFindingId/v1":"147b5757e9ffe9f82b87e429297e32e6211fa0c0650f0b51fb125fca0d242591"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: consider deleting FORMAT_MACRO_DIAG_ITEMS and using just this method \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/tools/clippy/clippy_utils/src/macros.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"876841598b7c586397e3f39ad60bdde778a7db2e186c2a8235a20d7cca26194a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: can we check that the feature is enabled? \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/tools/clippy/clippy_utils/src/msrvs.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c62770721579eb4730c224d4173f8a96b9e85e2f1e921e95bac4b8daa4253d8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: rustdoc documents these two using just \u0060pointer\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/tools/clippy/clippy_utils/src/paths.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"665118842f0b3f9c5e2ca903887eccd318fd9347e8d9401bb205298b5832e22e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: when analyzing a function with generic parameters, we may not have enough information 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/tools/clippy/clippy_utils/src/qualify_min_const_fn.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"10df58b66db66cbb8e6bac7ee0f69f5169d9f75af6a37a578c731a5cbc7b0970"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: This is to \u0022unstabilize\u0022 the \u0060transmute\u0060 intrinsic \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_utils/src/qualify_min_const_fn.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"867cecfd62188c76e42570bddac5d8244cab4e010188c27aabc406a0f41f7c73"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const_trait_impl, fee1-dead) revert to const destruct once it works again \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/tools/clippy/clippy_utils/src/qualify_min_const_fn.rs"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"105ec088418b51317afe836e2ba57ea3598f8c91583bd57aac868bb128dd556a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const_trait_impl) constness \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/tools/clippy/clippy_utils/src/qualify_min_const_fn.rs"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"b49f8717b34b9ee88b8e695db4a8161e4c2cb13138b50fc5491c793fb5b90fe6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: add extra indent for the unsafe blocks: \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/tools/clippy/clippy_utils/src/source.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe1906975b1cf2bef7187f024a05ed45c23f0f723c577f7e6eff835c527cec21"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: get the argument span. \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/tools/clippy/clippy_utils/src/source.rs"},"region":{"startLine":714}}}],"partialFingerprints":{"codehealthFindingId/v1":"285a522d506b91c6bbf20dece96360758c4d18422dbbc9b2d44d7ae0c4b03fb6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //FIXME(chenyukang), remove this after type ascription is removed from AST \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/tools/clippy/clippy_utils/src/sugg.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"b70ef0163ecc18188ea87ea71ce4898d79275cbb64ca4f1d71cfec95ae3475ca"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //FIXME(chenyukang), remove this after type ascription is removed from AST \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/tools/clippy/clippy_utils/src/sugg.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eab358e072a620be82bf13f197e136e29f2469b749398a01eb9c67827d74445"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //FIXME: This causes false negatives. We can\u0027t get the \u0060NodeId\u0060 from \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/tools/clippy/clippy_utils/src/usage.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fd14262a57c8a2d850359cb56f56175f0f81ed6248b4e09c963eee979510b85"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // Todo: Handle partially consumed values. \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/tools/clippy/clippy_utils/src/visitors.rs"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a916c83e203c7c7b46dac73954344b38649d4ef8d25914e442af13cb7576792"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: instead of this hard-coded list, we should check if \u0060\u003Cadt\u003E::iter\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/tools/clippy/clippy_utils/src/ty/mod.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"c04b4e6b7473da22f2d78b29a3d5686828a2bf15843e7a41e93c3ac0cddfa21c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO add doc \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/tools/clippy/clippy_utils/src/mir/possible_borrower.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"053db4e47c555a7921064082d7e04e53e4862928ebb32ed1753f8073889789d6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(f16_f128): add \u0060f16\u0060 and \u0060f128\u0060 when these types become stable. \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/tools/clippy/clippy_lints/src/approx_const.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"58fddeb1f2dbe56376a84598da50164ff71f4bcda50a176783cd8f0bdc759e94"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This check currently bails if the local variable has no initializer. \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/tools/clippy/clippy_lints/src/assigning_clones.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"945566cabc1dd172799de33ae429b3b8542bcf3a148a03b842a5fe81e4132c64"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo: check for case signed -\u003E larger unsigned == only x \u003E= 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":"src/tools/clippy/clippy_lints/src/checked_conversions.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"257a81b884afdf645c53f91c6976a4bb9dfec9c41f3cb95af209050fb9388cab"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(scrabsha): what are the semantics of view types 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/tools/clippy/clippy_lints/src/dereference.rs"},"region":{"startLine":906}}}],"partialFingerprints":{"codehealthFindingId/v1":"f74d5d2112b2692609ad85487e1e397917ccbaf0961894dceef59213c955401b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: handle \u0060struct $name {}\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/tools/clippy/clippy_lints/src/empty_with_brackets.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3c8ee76707d2971adcc0f7370ce72117e52a4ff7c75ae3464cc1aaa65bac548"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: suggest using \u0060if let Some(v) = map.get_mut(k) { .. }\u0060 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/tools/clippy/clippy_lints/src/entry.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"a79006af419985e3bd537de17605f2290afcb5ab487c549c77c48071359424f3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: suggest using \u0060if let Some(v) = map.get_mut(k) { .. }\u0060 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/tools/clippy/clippy_lints/src/entry.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"15bff205a7423e85f88970098d7cca557ee401b5154a1bbc7f81b150e65d45b1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(rust/#120456) - is \u0060swap_remove\u0060 correct?"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/escape.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"d09a520fd33d360fd475d4b9409fd5b7bf369dc905f90e54a4eee207a24d2c37"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(rust/#120456) - is \u0060swap_remove\u0060 correct?"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/escape.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2e45ae46181c2ccc70ef719bffa10a35d25959dfb56e4cb6b454c4199462592"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(rust/#120456) - is \u0060swap_remove\u0060 correct?"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/index_refutable_slice.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7f24568e4dee41c4a1583d33dc3d8d1969da04a05e27bc9364dbfd54632aa48"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(rust/#120456) - is \u0060swap_remove\u0060 correct?"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/index_refutable_slice.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6727453f0f57555f58f4efe75e8a18618f8b9b5c4fa650ea7c207fe07cd2c1f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(rust/#120456) - is \u0060swap_remove\u0060 correct?"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/needless_pass_by_ref_mut.rs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b216ae2958c42a7e10175c232e18b83e8c8957b91bd4da059285eace50f90ec"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(rust/#120456) - is \u0060swap_remove\u0060 correct?"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/only_used_in_recursion.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"1825b86551ff21f8e60be3478df145351be7ec81b0e212a34cb7aece870e9f8e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(rust/#120456) - is \u0060swap_remove\u0060 correct?"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/matches/match_same_arms.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"26e1591e8f039894118d7a853bcf12110343d35561ce643bfa21184a98735a4d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(rust/#120456) - is \u0060swap_remove\u0060 correct?"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/ifs/branches_sharing_code.rs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe8bc4622c525cf80b1619f616c6d47dccbb7323eef19b35772c11776f2045fe"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: Given a closure in \u0060T.method(|| f())\u0060, where \u0060fn f() -\u003E U where U: \u0027static\u0060, \u0060T.method(f)\u0060 \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/eta_reduction.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d64a1990f590a54d9de976b9c1bc070d9f4aa3dcd38db6bdc3ec5b3bb2bc3c9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Do we really need this \u0060local_used_in\u0060 check? \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/tools/clippy/clippy_lints/src/eta_reduction.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"51dc2953daf55f17fa887a9d98449029400ac4b880865f782f0c191082807325"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This should be rewritten using \u0060LateLintPass\u0060 so we can use \u0060is_from_proc_macro\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":"src/tools/clippy/clippy_lints/src/excessive_nesting.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3bc99a4359cd388907d4e6d727bea4d8f0528175f8e630e830db48007745ee9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(f16_f128): do a check like the others when parsing is available \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/tools/clippy/clippy_lints/src/float_literal.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a2771cab205a103b1e99f56a5166a28de43f3e941bdd6d0f805b25be4834f12"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: omit the note if the \u0060Write\u0060 trait is imported at point \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/tools/clippy/clippy_lints/src/format_push_string.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"709a4d3217bff75d862646ee439b523050ea32525083310e960f537f572e4468"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: omit the note if the \u0060Write\u0060 trait is imported at point \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/tools/clippy/clippy_lints/src/format_push_string.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8a91c30b0b869ecb5c8a73765f178729dd3be04311cf49e11f163c3671f51e8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We could potentially replace \u0022clippy_utils::return_ty\u0022 with this, \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/tools/clippy/clippy_lints/src/future_not_send.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"226e92f1c743e1a3783de25e3e39182a3afc50cabff2758134f3068e3ec34091"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(@Jarcho): We should have an internal lint to detect when this list is out of date. \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/tools/clippy/clippy_lints/src/incompatible_msrv.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"37d479a367609e3bd2ffb32f17c70b3ce393fa9b95880b78527128c76e465d3a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(@Jarcho): Check that the actual desugaring or std macro is supported by 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/tools/clippy/clippy_lints/src/incompatible_msrv.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4365d48abe81a63bbf5433497297e1e970f0861d3e6e01878b9b0b6dfb5a40f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(@Jarcho): What should we do about version dependant macros from external crates? \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/tools/clippy/clippy_lints/src/incompatible_msrv.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d93f7d8fdf496d519829fc7520e141edd5fb46fe4aa25574245993dc86a3128"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: ideally this would handle type params and projections properly, for now just assume it\u0027s the same type \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/tools/clippy/clippy_lints/src/indexing_slicing.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d24dc3ae979862dd18f5db667966d6b6b95380e047bb62bd9a2cada71a46ea1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: ExprKind::Loop \u002B Match \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/tools/clippy/clippy_lints/src/infinite_iter.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f9aee933909de910ff55ec419d2721e0824a4d2fc4225d7248b48577b447df4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(generic_const_items): I don\u0027t think checking \u0060generics.hwcp\u0060 suffices as 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/tools/clippy/clippy_lints/src/large_const_arrays.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"39ee723bf7e68674f62dbc9b0802616f54c78d480b6c56a76e30efb53deabd4e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Is there a cleaner, robust way to ask this question? \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/tools/clippy/clippy_lints/src/large_unopt_stack_frames.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fb0cbf13b3e750552e3cd5c4c703e5b9a5e0c0267fefcadf20d8820f061a07c"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: we might want to relax this to allow \u0060\u0026self\u0060 and \u0060\u0026mut self\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/tools/clippy/clippy_lints/src/len_without_is_empty.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"3df95e3e83a8d6a3de49f0418a1e94707315474cdcdac9648e86dd0eb837d81e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this should not suggest \u0060mut\u0060 if we can detect that the variable is not \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/let_if_seq.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7dfd0d08b7bffa050e156067816ce34377c478dade8c85edcc31f753dc51694"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: There\u0027s probably some better way to do this, i.e., create \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/tools/clippy/clippy_lints/src/manual_float_methods.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd7bb75e1379307267ca4559a2a9d75c9dd5babb31ff386d9a1e30967b372031"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: Support more complex patterns. \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/tools/clippy/clippy_lints/src/manual_let_else.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"28f22cb3df44d98742dcd9be091f0b174eb623db3e6448c18d762a6e4c208fb6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: this is a bit of a hack, but it does its job. Ideally, we\u0027d check if pat_to_put 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":"src/tools/clippy/clippy_lints/src/manual_let_else.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"aedc5940d2a7556615897e2ebe57689da7f54f538069f3a300645622173b9559"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: only look for *used* bindings. \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/tools/clippy/clippy_lints/src/manual_let_else.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"43878d36a8abad49aa1e788add86135ad695ce018bfa7b026a31de80a32bfc4f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Ideally this would be a suggestion, but the span for that is annoying to get. \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/tools/clippy/clippy_lints/src/manual_non_exhaustive.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"8985db32d542f72e56209f56dca3acf6960cfe863ef42b015d64d60aca5d27f5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Ideally this would be a suggestion, but the span for that is annoying to get. \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/tools/clippy/clippy_lints/src/manual_non_exhaustive.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"aff031c418d807219e1abca83e01733b4767eab63b30afe235bd299b3d0c6f6b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //     // TODO: Ideally, we can rewrite the lambda by stripping one level of reference \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/tools/clippy/clippy_lints/src/manual_retain.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"245647e6bc16f81596213022bffdc6ed7b7d0eb8e7e08bee6e08372a54f2bfcf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Ideally, we can rewrite the lambda by stripping one level of reference \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/tools/clippy/clippy_lints/src/manual_retain.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"b78e823cd13e8ab03d998da4d5497c39c139b5018eefb143f75a33c552f30eda"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(@Jarcho): Capture a span from the config and point to it 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/tools/clippy/clippy_lints/src/min_ident_chars.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"f852c3b54363132fcbc06e88f50a6baf3cf57ab21fab990edede938be3d7200d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: fix this \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/tools/clippy/clippy_lints/src/mixed_read_write_in_expression.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d40ea9ea766e0ceb45b05ed5fd75599ff772996559f4a29787ea65b8f08de1a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: remove filter once https://github.com/rust-lang/rust/issues/160895 is in stable"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/needless_borrows_for_generic_args.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"706f5d18288dc64f03948666043f18adcd37ee4c7e9911a06d36c17c63cc631a"}},{"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/tools/clippy/clippy_lints/src/non_canonical_impls.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"4df1e3242cf957223ee3e533a6fd22149b1d0b83760463da1ad3e5e3d5b20e50"}},{"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/tools/clippy/clippy_lints/src/non_canonical_impls.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"0873500137708bdc02d4595187db79ce1b829c0e76049cb7135b6b0845d4adee"}},{"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/tools/clippy/clippy_lints/src/non_canonical_impls.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"e934f0f9d1159bb0dcfed6869f6c9893965e6ebbaf6f6bbbb62b05d49fd78960"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this should probably be using the trait solver \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/tools/clippy/clippy_lints/src/non_copy_const.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"be7ad29a61ba8626cec289b2450f886e5308e1e8bec9497fa2680ab845b072d6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: check other 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/tools/clippy/clippy_lints/src/non_copy_const.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"0951afd5aa1fddef0523facbb9c3e9b11601bfc2ee7ce35574524b4310ece964"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: we just assume mgca rhs\u0027s are freeze \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/tools/clippy/clippy_lints/src/non_copy_const.rs"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"f58fa4df64354d1e3c02d9a3f1d602b7d0dd2f5140280643a7dd153fc912b1cc"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: we just assume mgca rhs\u0027s are freeze \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/tools/clippy/clippy_lints/src/non_copy_const.rs"},"region":{"startLine":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c981dbdf97172997b5cf67d460aa72d2fcf6b1c7f471a82e75639bf178bf859"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: we just assume mgca rhs\u0027s are freeze \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/tools/clippy/clippy_lints/src/non_copy_const.rs"},"region":{"startLine":828}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ad7fab405dd72b623ad3890046089624ad6858ab55eb4e1c4d7349549209b82"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: find a way to 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/tools/clippy/clippy_lints/src/non_std_lazy_statics.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"e523b478f7665db5b81f779febe4122fba4dd8e024a06ef0b59f2345f41ce7f6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Before moving this lint out of nursery, the lint name needs to be updated. It now 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/tools/clippy/clippy_lints/src/option_if_let_else.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"a25469d74e10f625cd5ced9eb31750d96a48dabfb435da06a1b704f3cb63b52d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: check all the references made in the scrutinee expression. This will require interacting \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/tools/clippy/clippy_lints/src/option_if_let_else.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d2aec3edb9cb732cb491a07b0fd17cf7edfa34d8e3f3bf16db762c3f35195f6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: check all the references made in the scrutinee expression. This will require interacting \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/tools/clippy/clippy_lints/src/matches/manual_utils.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"98c0d3d531b9992975fbb3d6f2a7a9d4c476c51317ee99628db444ef0251f27d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Cover more match cases \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/tools/clippy/clippy_lints/src/option_if_let_else.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"1223bb48efaf2e59317ad0f78ac623cb9e329b94053709196d7ac850cab72f83"}},{"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/tools/clippy/clippy_lints/src/panic_unimplemented.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"5de441bf9fc875a1bbbc2ecb59e449832ceaabbbbb8942e2d02dff979470ba41"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Limit the check only to raw pointers to the argument (or part of the argument) \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/tools/clippy/clippy_lints/src/pass_by_ref_or_value.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"5db0c5e5e164d640ec36ad66df42d6e78a9da9bdecbd60775a8215a7a147e809"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: Note that the current implementation may still return false positives. A proper fix would \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/tools/clippy/clippy_lints/src/ranges.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e980ed3ecd241c344e0b8ae3a7beac70faddc1c9cdbe5441cbebb2e86f067cd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Actually check for mutation of non-temporaries. \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/tools/clippy/clippy_lints/src/redundant_clone.rs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"9389bda6f09128ca3c55663ad6612b1b392c98effc32e76df012c6f8e43697bc"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(@Jarcho): \u0060indent_of\u0060 walks to the root context before getting the indent \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/tools/clippy/clippy_lints/src/redundant_else.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"310e4eb19150f31e476d36b60ef1793152d1819a6aa75bc0c343ab345b04d38a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: check for non primty \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/tools/clippy/clippy_lints/src/redundant_type_annotations.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"81a9582dcf0e9e0b19ff9879b70945c96ecc94e906ee84e2cec8eeaa28be9e93"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: if \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/tools/clippy/clippy_lints/src/same_name_method.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"8205fc559821189f616a2f31d8369297ac22ee3d19cc1cfa5d870f51ca854e55"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO should we \u0060span_note\u0060 on every trait? \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/tools/clippy/clippy_lints/src/same_name_method.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"99bdb92cf3aceea3abfedd0c2d52fbfdb228190660c516f1b2468f73a23f66a1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: add \u0060ReadBuf\u0060 (RFC 2930) in \u0022How to fix\u0022 once it is available in std \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/tools/clippy/clippy_lints/src/uninit_vec.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d2fda02fe973b12aa49ecc43db0434930ee43513a9ff7aa660274689e159682"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: update to a visitor-based implementation. \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/tools/clippy/clippy_lints/src/uninit_vec.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d4b1a304cc776de2929cb6876b0ecd127d111dbf20a905bbf27e7338dc0e97d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Improve this to the same complexity as the Visitor to catch more implicit return cases. \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/tools/clippy/clippy_lints/src/unnecessary_literal_bound.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"41462fe6accecc30cb0e5142bde29a3c2a67916863e1156692c212f705a80061"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: rewrite as a generator returning \u0060SelfImport\u0060s, if those ever get stabilized \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/tools/clippy/clippy_lints/src/unnecessary_self_imports.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ff3815cee11de990d3b71898b1f8436d0a091f29590cba9344090f43e1744d0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: do not propose to replace *XX if XX is not Copy \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/tools/clippy/clippy_lints/src/unnecessary_struct_initialization.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3836586ddf16e7f6d7885f0e81c31b2bfd4176d1ad7de11925eee16692e1986"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: we should instead get the span including the \u0060-\u003E\u0060 and suggest an \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/tools/clippy/clippy_lints/src/unnecessary_wraps.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3d6961209ece1e61a5f26293801d1fe293e5219fdde6107a24c78544a424c5e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(pin_ergonomics): handle pinned patterns \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/tools/clippy/clippy_lints/src/unnested_or_patterns.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"3deae6fcc705e4c6c1d34da1803f3e611ded62a2d8b6013b0d99247d6d446930"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: \u0060ident.span\u0060 points at either the final segment of the import path, \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/unused_trait_names.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"855f19d3660c0fcaebfa57c5dfa88b70e1729244ea424098acbc1dcc6cc85354"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Handle inferred lifetimes \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/tools/clippy/clippy_lints/src/use_self.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee84c2c9723988e364d0ec1a7b2590626c26995f93a0322088012f8ce561b5aa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO - constant_simple does not fold many operations involving floats. \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/tools/clippy/clippy_lints/src/zero_div_zero.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"89bbd213e2b03a041799ccf453a8e1229fe90bb32366621adca908568c6e88a9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(f16_f128): add these types when eq is available on all platforms \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/tools/clippy/clippy_lints/src/zero_div_zero.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf6f563963830889319f1a58042f368a5a27ee505a2a392546c83c918c6db754"}},{"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/tools/clippy/clippy_lints/src/zero_sized_map_values.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"27af2ad6578974b8491405e419a8fac98f1d8424e72b7c2b9152ce861636c1a9"}},{"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/tools/clippy/clippy_lints/src/zero_sized_map_values.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc0444dba76665b5207f58261f2bb62066b4ee0f2c7a73267c8c75de78b486f3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: find a less awkward way to do this \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/tools/clippy/clippy_lints/src/unit_types/let_unit_value.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"7506f79196410450e9c177da2be95d7c0cc88d5b7d2def21dc4f921436b8b0a5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: ideally we would like to warn *if the complicated type can be simplified*, but it\u0027s hard \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/tools/clippy/clippy_lints/src/types/mod.rs"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"03d4b1b2fa381e771c0ac0c682eb21ff7e7d6262b71d81fd362698bce62d4702"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Merge this lint with USELESS_TRANSMUTE once that is out of the nursery. \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/tools/clippy/clippy_lints/src/transmute/mod.rs"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"b23898ce89c7103701be432bcaed1f113eca7c8d9f7d5b1bf5a3f2142df16f9b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Check if the conversion to or from at least one of a union\u0027s fields is valid. \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/tools/clippy/clippy_lints/src/transmute/transmute_undefined_repr.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a00558fc8522285fb23f9dec5e7bef371ac1ad500b6676c735e284a8f80a658"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: check const parameters better as well. Currently this will consider \u0060Array\u003C5\u003E\u0060 the same 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":"src/tools/clippy/clippy_lints/src/transmute/transmute_undefined_repr.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"f09aaba1ce1fe8d65d7677ffc33a8a7c984bb05452c244ffcbc2a2cc0e4bc492"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This will have false negatives as it doesn\u0027t check if the borrows 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":"src/tools/clippy/clippy_lints/src/operators/assign_op_pattern.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"94164f7ffd4d2ae2ef9a2c12f127a6c26c8473136d6c7683827750219f3848f4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(f16_f128): add when equality check is available on all platforms \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/tools/clippy/clippy_lints/src/operators/float_cmp.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"936f2106c895e545c173e4bd988e0bff0b54ddcb74d29bcebde9e471c41b9930"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(f16_f128): add when casting is available on all platforms \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/tools/clippy/clippy_lints/src/operators/modulo_arithmetic.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"148b8ac23a0a9a9c7b210d4683e0107d41aa72d08d125c10b81ff0c8de89bcb4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Find a better way to detect those cases. \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/tools/clippy/clippy_lints/src/misc_early/mod.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"f27f782edd1e1703b9662120be4842ec52a01e7a822566b212d36e14a218dae9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Change this to lint only when the referred iterator is not used later. If it is used later, \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/tools/clippy/clippy_lints/src/methods/double_ended_iterator_last.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2328d64c43f65f1f404981ec3257f3ee8fe20df00feee4f65478b2b70b15d47"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This doesn\u0027t handle if either the start or end are negative literals, or if the start 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":"src/tools/clippy/clippy_lints/src/methods/map_with_unused_argument_over_ranges.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6874059ce6548cea9ea082695a81a37728ca56e210a0f19a0c35691f2e20f3e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: try to fix \u0060can_change_type\u0060 to make it work in this case. \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/tools/clippy/clippy_lints/src/methods/unnecessary_to_owned.rs"},"region":{"startLine":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"173862a08835930152d76d46d39867a516567315ba0186f80042e1d25e0acc69"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: make this \u0060MachineApplicable\u0060 when the function comes from std/alloc/core \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/tools/clippy/clippy_lints/src/methods/unnecessary_unwrap_unchecked.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfe2f7b8c8abc7a8e05e9f4000f599f04f2e1831b29104e83d685f37fe245841"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Allow more complex expressions. \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/tools/clippy/clippy_lints/src/matches/manual_map.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a46a2b6f994108038e64ddaf33eb7ae8212b39bb3cb5c22291cab4a5cf61125"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: handle explicit reference annotations. \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/tools/clippy/clippy_lints/src/matches/manual_utils.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"fef5c544f785d40e7bb2e0aef8f4bccbadfabc55721e3c4374e470591af76580"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Handle negative integers. They\u0027re currently treated as a wild match. \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/tools/clippy/clippy_lints/src/matches/match_same_arms.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"999fc8e2451a63dbad732de599cc3828b23b3b37911515f88d442845985952b2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Handle negative integers. They\u0027re currently treated as a wild match. \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/tools/clippy/clippy_lints/src/matches/match_same_arms.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ea6d3d6eaf26334e1c81cb3ae7f8766368bccc630fcd5b97acaeff8cda0cc9f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: check fields 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/tools/clippy/clippy_lints/src/matches/match_same_arms.rs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a4c8647158625f55ae2e3426be9eb66c9e2ad4bf260775c35cc8b3955cf528f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Lit* with Path, Range with Path, LitBytes with 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":"src/tools/clippy/clippy_lints/src/matches/match_same_arms.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6bec299d45ee0c9a04d278bf6c6c11d6686c602a0627e4a134ad9f3f355b452"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(clippy): don\u0027t you want to use the hir id of the peeled pat? \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/tools/clippy/clippy_lints/src/matches/match_wild_enum.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecf8132f2ed7ca601fe4e8a1a1a23b0116aaf4761236460196bbbc48a9191530"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: ///     _ =\u003E 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/tools/clippy/clippy_lints/src/matches/mod.rs"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"a46b67cb482354fe3ce5ed0267ace777f57eab6a2d624905c8d4809073619b32"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: ///     _ =\u003E 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/tools/clippy/clippy_lints/src/matches/mod.rs"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5125176bd3653dfedaab7171291cd60f5253e89da35deedca374b3ad7f8dec4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: use \u0060slice::as_array\u0060 once stabilized \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/tools/clippy/clippy_lints/src/matches/redundant_pattern_match.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"29bd938f34b4d1c626bbb898ef3293dc4017b286d76309b46c770e67bcb40650"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: The lifetime is still there but it\u0027s for a inner type. For instance, consider \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/tools/clippy/clippy_lints/src/matches/significant_drop_in_scrutinee.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e1c05bda59ccfcddcb007a8e4239f2e74fe8d990afd8b76c16c2dd405d4f1aa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // passed by reference. TODO: If the struct can be partially moved from and the struct isn\u0027t used \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/tools/clippy/clippy_lints/src/loops/while_let_on_iterator.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"e50809c3da5ad2eb21a8e67d8353fee37144a9b14f26d51cbc5d393d6f0d9474"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This can be a false positive if the correct field is reachable through deeper \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/tools/clippy/clippy_lints/src/functions/misnamed_getters.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"303e53609c2944f7b7e2d2b2f25e54d9d9ffb91840ff2967e6031249f295af6a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: needs to be an EARLY LINT. all attribute lints should be \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/tools/clippy/clippy_lints/src/functions/must_use.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffaaefbbcacf6e9a1d0e5c72f83da8d3dd33f09797f8b92a2a0a57eca56016d8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(jdonszelmann): this used to give a machine-applicable fix. However, it was super fragile, \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/tools/clippy/clippy_lints/src/functions/must_use.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f5275315f2fb00a32340b9d68f3b7287f11f80b6c5653e1a887858a80468e52"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(jdonszelmann): this used to give a machine-applicable fix. However, it was super fragile, \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/tools/clippy/clippy_lints/src/functions/must_use.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"5267bc3c957a4273a1483b58a6c569a52d216249f63670b001f4e01dea005221"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Lint expressions of the form \u0060x.exp() - y\u0060 where y \u003E 1 \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/tools/clippy/clippy_lints/src/floating_point_arithmetic/expm1.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"173d6cd561295189cc6d5e580d92df221419179cc1ea72e38b07c94bbdbbdf5e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Lint expressions of the form \u0060(x \u002B y).ln()\u0060 where y \u003E 1 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":"src/tools/clippy/clippy_lints/src/floating_point_arithmetic/ln1p.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"68565301f1a20d4182dcc6ed9594a23a4562454eb8de5734b79762df70744605"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: also check for constant values near PI/180 or 180/PI \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/tools/clippy/clippy_lints/src/floating_point_arithmetic/radians.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dfe4753763978412b0aed18a5160dcfccb968629b229d7d1ae206d90a8d3ca9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: handle \u0060f16\u0060 and \u0060f128\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/tools/clippy/clippy_lints/src/casts/cast_lossless.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"be840dad0883b59ccbc68454689240f667fce52c0bcf6ad553a4e04797969e69"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: handle \u0060f16\u0060 and \u0060f128\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/tools/clippy/clippy_lints/src/casts/cast_precision_loss.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d038fb74c12caa75877a6ac161f30066cc004bc34ba1672b9c2407734491ac4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(f16_f128): add these types when nan checks are available on all platforms \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/tools/clippy/clippy_lints/src/casts/cast_nan_to_int.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca65dd8ad953fc2ad8e59f80c07963a51aea5e652693decdc6b0b960348ff1b3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //FIXME: make this a diagnostic item \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/tools/clippy/clippy_lints/src/casts/cast_possible_truncation.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceb13aa9e727a9aed9b130b1b8333502ab5c9be6d19a6a75241d5d211b9fcc6c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Remove the condition for const contexts when \u0060try_from\u0060 and other commonly used 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/tools/clippy/clippy_lints/src/casts/cast_possible_truncation.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"2842a80915267192fc258937f217a0d659e52be0fdf6d571f69bd9281f0d9db1"}},{"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/tools/clippy/clippy_lints/src/casts/mod.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"642f4021d74df46f8f3d22ceb1b460363f6d6f1b5d0ef938c8f1b2de4700b4bb"}},{"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":"library/core/src/macros/mod.rs"},"region":{"startLine":861}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc6e9e852159035eb01e1bbab943f1af60121a9aea88e7ceb75df3ca49be40b0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: set xx to the version one below the MSRV used by the lint, and yy 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/tools/clippy/clippy_dev/src/new_lint.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"cefa0dbbdccce971f27cee09083aaeeae8131da062eb0350d46d7c1a05c26bc3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Add MSRV level to \u0060clippy_utils/src/msrvs.rs\u0060 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":"src/tools/clippy/clippy_dev/src/new_lint.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"13c9ad83ec098374c9b4fbad539cf76e9e2188cc78fc4860a24d6449d587bfa6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Update msrv config comment in \u0060clippy_config/src/conf.rs\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/tools/clippy/clippy_dev/src/new_lint.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"08a343abde22a2154ad4e54216d3ac9c122414d31d6bca152b07d40e3dea2b05"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Adjust the parameters as necessary \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/tools/clippy/clippy_dev/src/new_lint.rs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"814182bd7cd875c98e42faf12e9a6de65e9a12dc6107bb71a2d3a43770b1da98"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Adjust the parameters as necessary \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/tools/clippy/clippy_dev/src/new_lint.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"cceab1ad4594740c1b45f53c3f6f7b85a1d2b24fad52ab0fb3f14e9cf715cf43"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: emit documentation \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/tools/clippy/clippy_config/src/conf.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0326a94c91dc8bce50cc4337ad683f8c16e9e0eac1e75eef9525dcd010b7b99"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(weihanglo): replace xsv to something else with similar portfolio. \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/tools/cargotest/main.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"389f6b19b366209460395b8ab590314ace2a6526eaa67a158bb19c5b96386599"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: on newer \u0060toml\u0060 (\u003E= \u00600.9.*\u0060), use \u0060toml::from_slice\u0060. For now, we use the most recent \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/tools/bump-stage0/src/main.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdce9f449c32b8c0ec1620d92a8cbd520f6d5076ee03f19c30436749951db909"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(aDotInTheVoid): Consider making this non-public in rustdoc-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/rustdoc-json-types/lib.rs"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"8de112b97d196d471e71af8118b7def9dde134da55f07398b15992d34b18885c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: document this \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/rustdoc-json-types/lib.rs"},"region":{"startLine":1745}}}],"partialFingerprints":{"codehealthFindingId/v1":"73665f7c208c5e22ae1d023708688a669d6190cf0920343813073c88fd8ec0aa"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#82852): We don\u0027t record const params since we don\u0027t visit const exprs at all and"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/core.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"562abf2a69c5492de1b2bf6c205593b65e40d091720b53454bb4257772b33ed6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: I\u0027m pretty that the only reason we \u0022need\u0022 these caches is because we also invoke \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/librustdoc/core.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfb14042df51f36e73a2e60e420f699426bc321e28e6e4cfba572fa1ef7ab09a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Can this be \u0060Some\u0060 for \u0060Auto\u0060 or \u0060Blanket\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/librustdoc/core.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"962f77d7c7fa2a7aa25ca00814918bcfdb63ed07ca7b520928905ad3f140cfa9"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // hack so that \u0060used_trait_imports\u0060 won\u0027t try to call typeck \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/core.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"5047efdf8e001d905fb95f1fbe337aab5572cb6141f2e6bfdbaba28181b17523"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This is ugly, remove when \u0060test_attrs\u0060 has been ported to new attribute 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/librustdoc/doctest.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"83a1f4b43ddf96f07f4468107589deb0b03f54ed33c94578d78f5535953be597"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This is ugly, remove when \u0060test_attrs\u0060 has been ported to new attribute 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/librustdoc/json/conversions.rs"},"region":{"startLine":1221}}}],"partialFingerprints":{"codehealthFindingId/v1":"b168abfabda272bcc8a8890797397d310314264684aae913006c3f0f32a32c13"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: why does this code check if it *shouldn\u0027t* persist doctests \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/librustdoc/doctest.rs"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"963edec29842d513e105434bd3aacca004a8fb6de5682b3670ba03d0e5fc2669"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#12309): An unfortunate side-effect of capturing the test"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/doctest.rs"},"region":{"startLine":1237}}}],"partialFingerprints":{"codehealthFindingId/v1":"f746ed4f113cab98088076c4a3d23e3038ce7e69f8ac9dfe3d694ea8529401a7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(yaahc): once metrics can be enabled by default we will want \u0022failure to emit \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/librustdoc/lib.rs"},"region":{"startLine":1094}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b5ed8f513556fe905fd9995b68c7a7671ff05f5add98b60cafd436d4f6e1d26"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(yaahc): once metrics can be enabled by default we will want \u0022failure to emit \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":"compiler/rustc_driver_impl/src/lib.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb66fc580beed66c24fea50558de7e8199aa704bd3afdd1a2633d72d423f0505"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Should this be replaced with tcx.def_path_str? \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/librustdoc/visit_ast.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"50d827cee843971648c42b96e74dc0cc167344d77621c9224416e80739e8ef0a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this may not be exhaustive, but is sufficient for rustdocs current uses \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/librustdoc/visit_lib.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf4b1f5c690f5a35f4fd489be11e8a65fc63207d3b11eca0f5b831f07c0c1791"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: handle macros with multiple kinds, and attribute/derive macros that aren\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/librustdoc/passes/collect_intra_doc_links.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6de77749ee014261317991cd1631610f5b4d9989e99e4fe4a7d8dc8af617ce1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#83862): this arbitrarily gives precedence to primitives over modules to support"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/passes/collect_intra_doc_links.rs"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"0deda1b231ba083844e845ce01f63a0485145eedad9cdb7c167a322e79d602b8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Only simple types are supported here, see if we can 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":"src/librustdoc/passes/collect_intra_doc_links.rs"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b3ffb25d1390dd40494e20c6cfbc707981ce226cfff2d55613399d262b255fa"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: if the associated item is defined directly on the type alias, \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/librustdoc/passes/collect_intra_doc_links.rs"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0d61e52c9c775a84a9fc293bc4c012ed952f50685d0f6314d74360471e481b9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: make this fully complete by also including ALL inherent impls \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/librustdoc/passes/collect_intra_doc_links.rs"},"region":{"startLine":656}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6779907c7dd32a68a53372df18516d5af85db5c7c0e83963baad1923adbccc0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#74563): This gives precedence to \u0060impl SomeItem\u0060:"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/passes/collect_intra_doc_links.rs"},"region":{"startLine":757}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c197fcf39c7ce929da2401fdff8c894a7cbb6b0ee41b191b531893dfafd77e5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this should also consider blanket impls (\u0060impl\u003CT\u003E X for T\u0060). Unfortunately \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/librustdoc/passes/collect_intra_doc_links.rs"},"region":{"startLine":792}}}],"partialFingerprints":{"codehealthFindingId/v1":"c82e6d122ad86323d0d20cfa93e8c06c6715ff791741836e56b93e2748b87f40"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#74563): warn about ambiguity"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/passes/collect_intra_doc_links.rs"},"region":{"startLine":811}}}],"partialFingerprints":{"codehealthFindingId/v1":"91e2df4ebfeb576a9a729076e190fd39b905a7f8f4c17c7b69324b8dbdfa8c6c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: could there ever be a primitive not in the type namespace? \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/librustdoc/passes/collect_intra_doc_links.rs"},"region":{"startLine":1379}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3afdaa952b5d9b90e5a59dc258869d9eea50f6933572ea3c2754d9a660c8baf"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: it would be nice to check that the feature gate was enabled in the original crate, not just ignore it altogether. \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/librustdoc/passes/collect_intra_doc_links.rs"},"region":{"startLine":1568}}}],"partialFingerprints":{"codehealthFindingId/v1":"f11c1b71ea90e18f2ba9e2c9fa0a3d637a1c140efbb12df12a0d2db520ac63c7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: really it should be \u0060resolution_failure\u0060 that does this, not \u0060resolve_with_disambiguator\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/librustdoc/passes/collect_intra_doc_links.rs"},"region":{"startLine":1631}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a07316b9d57cbb55d5dfe8f77501adbf881e75b4660809ea02dbfbc5b158978"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK(jynelson): the source of \u0060DefKind::descr\u0060 only uses the DefId for \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/passes/collect_intra_doc_links.rs"},"region":{"startLine":1863}}}],"partialFingerprints":{"codehealthFindingId/v1":"f16b1b20e5bd6ba2223c1cd505921fb343b9ba2d327224aeee86f75664c8450c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: if this is an implied shortcut link, it\u0027s bad style to suggest \u0060@\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/librustdoc/passes/collect_intra_doc_links.rs"},"region":{"startLine":1891}}}],"partialFingerprints":{"codehealthFindingId/v1":"e60420cd285cc034d934bb1943c96e42f6cb620db68ec8ab55d4cf1ab0666117"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: if this is an implied shortcut link, it\u0027s bad style to suggest \u0060@\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/librustdoc/passes/collect_intra_doc_links.rs"},"region":{"startLine":1927}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4153ec2d7226724b177f3c9d8bb4c430984afa79df3da1b4cede44ee16659f0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(jynelson): this might conflict with my \u0060Self\u0060 fix in #76467"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/passes/collect_intra_doc_links.rs"},"region":{"startLine":2164}}}],"partialFingerprints":{"codehealthFindingId/v1":"a002ce22d3d79363bc1ef07ed5aafa4cc39ad9992e9c83b0dcdc6c8ad88cd5b8"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: this is all one massive hack that is very hard to get rid of (see comment below) \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/passes/collect_trait_impls.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"aea5386a8dac82db048941910c763655acfd653c41967e57935513f733d11a15"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(notriddle): https://github.com/rust-lang/rust/issues/97129"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/passes/collect_trait_impls.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"26313f673f5d6befca1608606c3338bfb5183145d3cd67ae63387d7c5e305d60"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: once -Znormalize-docs works properly / becomes the default, \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/librustdoc/passes/collect_trait_impls.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"65b87418205e853ebadf9144b9f9010ff6b69d70a797412ddfd577323a00a69b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(unsafe_binders): this should probably recurse through the unsafe binder, \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/librustdoc/passes/collect_trait_impls.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"add6b0f176940ebc3d298a627113ee0be0212b46c67eb5764b13c72458324194"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: pick the first \u0060did\u0060 as the \u0060did\u0060 of the trait object. Someone \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/passes/collect_trait_impls.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"f62d862d35138cf110a43f5b811e25839a92f2c42bbf07128a63eaa4a9135c8a"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: pick the first \u0060did\u0060 as the \u0060did\u0060 of the trait object. Someone \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/clean/mod.rs"},"region":{"startLine":2218}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9e198c395adc5b229b6956dbc4b855b710c4d9a62268c96dff87555927a8248"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: there\u0027s a slight behavior difference from clean_middle_ty 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/librustdoc/passes/collect_trait_impls.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b51cfb149e10b3728846e23517ade6617ebc94f6264c2c15bd42798961df73d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(eddyb) is this \u0060doc(hidden)\u0060 check 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":"src/librustdoc/passes/collect_trait_impls.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"984bf2e7a596cae4f7553021583909b7c480cc0a6a0739849971e603b88bd44c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(camelid) should we skip the \u0060doc(hidden)\u0060 check if --document-hidden-items is passed? \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/librustdoc/passes/collect_trait_impls.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"9863db9a780f41219ee0167f0f1e2f80a35d3ba27930766c5602f7d1e4d55b87"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#125009): Not-local should probably consider same Cargo workspace"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/passes/strip_aliased_non_local.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd3576936caadd71191ac455c3eef60ff836d23e2be2482630e0c4b39732d7c1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This should be handled the same way as for HTML output. \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/librustdoc/passes/stripper.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3b37a529735fb669c38db6997300202f1c71be1844b9842adf0b92669681103"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#67563): Provide more context for these errors by displaying the spans inline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/passes/lint/check_code_block_syntax.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"51a6f2f94d4b44204aa555ba8056bd099640fef5f0fee0577c54f7753c94e629"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME(ChAoSUnItY): Too many 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":"src/librustdoc/passes/lint/redundant_explicit_links.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"05dc7827721b6c8b494ae72d9a59ea9e357ebdce69b32afef8b70c8a554bc5c2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME(ChAoSUnItY): Too many 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":"src/librustdoc/passes/lint/redundant_explicit_links.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ab4e1df028a110330eb880bc8e3c2c8a2c9e22d27208a9b48e24cc4f614f620"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME (GuillaumeGomez): We cannot use \u0060derive(Diagnostic)\u0060 because of this method. \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/librustdoc/passes/lint/redundant_explicit_links.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6d99b8645cdec52e28fa5800c3b97b1a2690cceaa3b06bc3225eb8b3e18cb3d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME (GuillaumeGomez): We cannot use \u0060derive(Diagnostic)\u0060 because of this method. \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/librustdoc/passes/lint/redundant_explicit_links.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b35ca6dd64f9344ea1e80d8a5e83835da8048d8f1988e2e6917fdd5da023d20"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: remove this function once pulldown_cmark can provide spans for link definitions. \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/librustdoc/passes/lint/redundant_explicit_links.rs"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"b95e4064e8ab6fe78aa3b3726d664f7cdc39d12a29f72eceda55763463ff051a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: remove this function once pulldown_cmark can provide spans for link definitions. \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/librustdoc/html/markdown.rs"},"region":{"startLine":1828}}}],"partialFingerprints":{"codehealthFindingId/v1":"be5a7e025e69c35c9f7a30068377fc256c50ccb3cbe3de4967b2c4831465b923"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Pass the \u0060UserWritten\u0060 segment to JSON consumer. \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/librustdoc/json/conversions.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2d5872cedec609f97da2b21d5ecb04b9efdfa957dce8dfef9b1b374851a671e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(generic_const_items): Add support for generic free consts \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/librustdoc/json/conversions.rs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"4da1bdf9f9174cd2faabd9fd04fd4ddd5e7b919bc1d0e1fa8b782922838d5978"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(generic_const_items): Add support for generic associated consts. \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/librustdoc/json/conversions.rs"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2b0e954acbb1727f955ace2dcabbb1fe13cf935080053f0a9304a3b70db7a7b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Fill out the rest of this matrix. \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/librustdoc/json/conversions.rs"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"1331ccfced1496f18afe497c416369351b352ed5dd3f6da768d202a28408b96d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: add dedicated variant to json Type? \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/librustdoc/json/conversions.rs"},"region":{"startLine":665}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b024cfaf2fcb0ffb8d74935b028ff929b67bc813dde6f13d13d941f64a17f41"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(FRTs): implement \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/librustdoc/json/conversions.rs"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"5929ba377d5bc58cbbebd80e9fe3fa0ef4a293618955572f6e73f5f9d122eae4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(unsafe_binder): Implement rustdoc-json. \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/librustdoc/json/conversions.rs"},"region":{"startLine":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"930a3420eb296fd8688a2a3224ae009283ea5a6e1ffcf680ecc082f74bd852f4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(view_types): that\u0027s quite bad but heh \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/librustdoc/json/conversions.rs"},"region":{"startLine":694}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a08a5fd92e3f789b2fe9da0ae6c512bfb796d9c22d1976c23599cd1f7c1595c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: use something like ImplKind in JSON? \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/librustdoc/json/conversions.rs"},"region":{"startLine":816}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9b8402abadab531df8ecb10ae57c1800543da4c38418e86c504c47f130edafe"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We should handle \u0060#[doc(hidden)]\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/librustdoc/json/conversions.rs"},"region":{"startLine":1066}}}],"partialFingerprints":{"codehealthFindingId/v1":"3507e63843790d6b9ba6943d8bedcb50f72a8e796c309e1f463356101a3242dc"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK(hkmatsumoto): For impls of primitive types, we index them \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/json/mod.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"17e10aeb6a2d1bb6226aed81cba58674df21b6cde6349c0a174cca5fd2f90aec"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(adotinthevoid): Currently, the index is duplicated. This is a sanity check \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/librustdoc/json/mod.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"174c4a585da73bbd4eaf50b5ff3a0b61cf5787c3878b5e546ad1ad30a43e8e98"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: relative extern URLs are not resolved 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/librustdoc/json/mod.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"d71155b81c8bfbaa62f2712cc2c3cd3d47477c249e621e94136d720b42a0b826"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Should we also check for private items? \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/librustdoc/html/format.rs"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"590903cfb5df2d7d020cbdd6d02231bdd4cc15a1872adfd9417cfbb0c05aa873"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(inherent_associated_types): Once we support non-ADT self-types (#106719),"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/format.rs"},"region":{"startLine":1287}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b9be8e7b1cbe23f532b9817117462e6e0149cdcd23522f12ef30a02278d9731"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this is still a lossy conversion and there should probably \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/librustdoc/html/format.rs"},"region":{"startLine":1310}}}],"partialFingerprints":{"codehealthFindingId/v1":"add5c8b09079c0234bb84632952410f3d3035f53682d706a2c2d3264aa8c04b9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(inherent_associated_types): We always link to the very first associated \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/librustdoc/html/format.rs"},"region":{"startLine":1316}}}],"partialFingerprints":{"codehealthFindingId/v1":"181e64004f602d93f36981019df5d51efeba8abaaf9dcc252050be8802b96947"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(camelid): This may not work correctly if \u0060item_did\u0060 is a 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/librustdoc/html/format.rs"},"region":{"startLine":1659}}}],"partialFingerprints":{"codehealthFindingId/v1":"61b38dab3ddcaec381ad884c0e12374602144e1a962d498b1b4789b1d6099b8a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(comptime) show something when stable, currently relying on the attribute \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/librustdoc/html/format.rs"},"region":{"startLine":1745}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e74cda76dba25e75380ef4b27f5af9530424e2b2b925e413ceef74af19028c1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Should we instead add a new boolean field to \u0060ClassInfo\u0060 to force 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/librustdoc/html/highlight.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb3637e5533d9c04e14e048206e23d79e926816bcce69fb3ddcd8d40412f2d7e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: later on, it\u0027d be nice to provide two links (if possible) for all items: \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/librustdoc/html/highlight.rs"},"region":{"startLine":1401}}}],"partialFingerprints":{"codehealthFindingId/v1":"588c2fe9a7dcccdf7fce6a3564f28e431ce7f8e009c986592d54376198288392"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: currently, external items only generate a link to their documentation, \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/librustdoc/html/highlight.rs"},"region":{"startLine":1403}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b216958beec1871ea193541cf6b53e74dd0ee3a048cda207b87af87608c022c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: There is a minor inconsistency here. For lines that start with ##, we \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/librustdoc/html/markdown.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"17625bec2a307cae88069bf3b729053e9c9b662d59a5de449c98bad97d1642f4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: separate out the code to make a code block into runnable 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/librustdoc/html/markdown.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9d5342693fd043f93806279f9ca23819378d680b34025900ba2dfeb9b9e4934"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Once we have specialized trait impl (for \u0060Iterator\u0060 impl on \u0060LinkReplacer\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/librustdoc/html/markdown.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7f7044f1cddb835e62a8b0a9c51f774e93aabc4c8cd28ed3d79300cf15dc3d7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Properly support type parameters. Note they resolve just fine. The issue 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":"src/librustdoc/html/span_map.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"a587d99e4669accfe761f559d9e421e4cbc2e8ae2a603d023fa8381d28dbc2d2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Doesn\u0027t handle \u0022path-like\u0022 primitives like arrays or tuples. \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/librustdoc/html/span_map.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dfaa7212c4b3f7aeaeebd07ebdefe2fe16c477f449473648b9db7c454b14f73"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Typeck\u0027ing anon consts leads to ICEs in rustc if the parent body wasn\u0027t typeck\u0027ed \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/librustdoc/html/span_map.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e05a704a02a99f82af51ed795f70b9d762e46061589583631da993cc744d81c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This doesn\u0027t work for paths in *types* since HIR ty lowering 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/librustdoc/html/span_map.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2f0df7a2e789fe55023a951c51a408f7ef7bf6466d653a3efd05742091c0730"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This obviously doesn\u0027t support item signatures / non-bodies. Sadly, 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/librustdoc/html/span_map.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d2aef90614d4d50d2ae34e18a638aa9e501d6e36bdc728265174f223f309ae2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: relative extern URLs are not depth-adjusted for source pages \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/librustdoc/html/render/context.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"482b531a3c600f70d4f29d6bddd4b856e3bff4f681826ec90e2cf7401228b437"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Comparing against the special string \u0022_\u0022 (which denotes overly complex 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/librustdoc/html/render/mod.rs"},"region":{"startLine":1108}}}],"partialFingerprints":{"codehealthFindingId/v1":"367dc4e848524687b8b4c451753ef3615cf7e8f4b37e5e9ecbb2906f3db8cd63"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Once https://github.com/rust-lang/rust/issues/143874 is implemented, we can remove"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/render/mod.rs"},"region":{"startLine":1168}}}],"partialFingerprints":{"codehealthFindingId/v1":"10a75d9cd6c4c6b6a22b639e2a2caebb19d74719341d4a7815fce61decefeb4f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Once https://github.com/rust-lang/rust/issues/143874 is implemented, we can remove"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/render/mod.rs"},"region":{"startLine":2335}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7056c839f3fa2ecbd96d51760d0e2ebb808840a03d46dcf8b5f513adde6d5d9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Change the ID to \u0060auto-trait-implementations-list\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/librustdoc/html/render/mod.rs"},"region":{"startLine":1385}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ad5125c5d9b6b696fec27e7fa8cb066c162c5390dc22f7c69efb40229c57d13"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This code is quite ugly and could be improved. Small issue: DefId \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/librustdoc/html/render/print_item.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"87aaabf55a93ca44dfce74e7a54d45196b1343bc16de2bfb4ea6b5b333a988e0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: we should be using a derived_id for the Anchors 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/librustdoc/html/render/print_item.rs"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1a1fef4e1dc52375604389d26ed0c794956cc5432fb90f88a397b96e53fa97a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME (GuillaumeGomez): When \u003Chttps://github.com/askama-rs/askama/issues/452\u003E is implemented,"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/render/print_item.rs"},"region":{"startLine":1530}}}],"partialFingerprints":{"codehealthFindingId/v1":"31bfba6431f8d2f263984fe8f52b64094fefed63345bc81a083c306219a550ed"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: The code below now prints \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/librustdoc/html/render/print_item.rs"},"region":{"startLine":2023}}}],"partialFingerprints":{"codehealthFindingId/v1":"e55d9da15cdbd5e8bed98fbfe34ef752d0b977393fcfa2604d26619e36fb0cf1"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK(rustdoc): should not be sorting \u0060CrateNum\u0060 or \u0060DefIndex\u0060, this will soon go away, too \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/render/search_index.rs"},"region":{"startLine":1309}}}],"partialFingerprints":{"codehealthFindingId/v1":"d15462448631c07692a94175ecf4de5c1b3d8f79a3b42f2a9839b885cb03511e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: remove this whole recurse thing when the recursion bug is fixed \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/librustdoc/html/render/search_index.rs"},"region":{"startLine":2130}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8fe215b381b1652cebc3094d3904ae722c6082bde651455a6eb754ea4ecbd90"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this is a vague explanation for why this can\u0027t be a \u0060get\u0060, 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":"src/librustdoc/html/render/write_shared.rs"},"region":{"startLine":856}}}],"partialFingerprints":{"codehealthFindingId/v1":"f294cf2d5dbadc03cf6f03966f8cffe893909c8a4f59148e16cc04336158e877"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: avoid this clone (requires implementing Default manually) \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/librustdoc/formats/cache.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"206e660251aa72a829f8f57911f00e303c20839d241fbd534302938957a30d59"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Do these need 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/librustdoc/formats/cache.rs"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcb8ba8d9f941b28da878ee568488ce915b8b164f14accc2ccf79ed35ac897d3"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // Hack: many traits and types in std are re-exported from \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/formats/mod.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"c77203b1684ae5b9b62bb610e395758b5f7252a979a1836ab7ab61605ed864c6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: checking \u0060item.name.is_some()\u0060 is very implicit and leads to lots of special \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/librustdoc/formats/renderer.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9cf55c4cd5e48053338ff820a6c81921af8d68e203ec246e1df18ee94fa33d5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This code cannot yet handle no_std test cases yet \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/librustdoc/doctest/make.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"92f8ed5eb52273d3dc3fd104f4d8b1fce3c5c1d3a6312fdfe983b00aa052066c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(misdreavus): pass \u0060-Z treat-err-as-bug\u0060 to the doctest parser \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/librustdoc/doctest/make.rs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"414c5afea30e5ac489cb9a655ff422878052a6cfc0f1e081df347b8a62d1cae0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This is ugly, remove when \u0060test_attrs\u0060 has been ported to new \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/librustdoc/doctest/rust.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ec9918258d386eeb2848555965eaec4ccdf6d4f6b295ad61598b4aa0bf2cb31"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#111101): Incorporate the explicit predicates of the item here..."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/clean/auto_trait.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d8c6b2d6b6989cf7da6d9b5ecfc7151dbb6175dc879c4cc9126383b616596d6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: ...which hopefully allows us to simplify this: \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/librustdoc/clean/auto_trait.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf5f7263545752f3f9574207daad3ab3ed7b6d67b04468b2f60470d758350cdc"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Don\u0027t \u0060unwrap_or\u0060, I think we should panic if we encounter an infer var that \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/librustdoc/clean/auto_trait.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"81d7f65dd630df6ec44922cc4f64654b7d617d72b97cfd07a62cbfd7bc7d21f2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#120606): \u0060AutoTraitFinder\u0060 can actually leak placeholder regions which feels"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/clean/auto_trait.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9d51fd2fa456a5d706cf55c4d544c315c4d4f4041be872447785539470721b7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(eddyb) ignoring \u0060obligations\u0060 might cause false positives. \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/librustdoc/clean/blanket_impl.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"1946cded035e500d07967b3f792b30a518ee5da11d431142542be013467aa85a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(eddyb) compute both \u0060trait_\u0060 and \u0060for_\u0060 from \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/librustdoc/clean/blanket_impl.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4f01f15cbe95135dd5ca4daffeb4f234690e4846d525ba6667ca8cb8331513c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Once the portability lint RFC is implemented (see tracking issue #41619),"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/clean/cfg.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a4fc894ad9c530d09063cc535c9cb0c05b302088e7565f8a0cbd4a15f9fdc18"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Should be handled. \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/librustdoc/clean/cfg.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4d287abd9d736a2e6e9c0f791c771b85edcb5e5f123ca00dda586bdac116183"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: all uses should use \u0060find_attr\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/librustdoc/clean/inline.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc29777bd1328cacdd6fdd91403ce351e732024daf4011b665e9f60c32d14cb5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(sized-hierarchy): Always skip \u0060MetaSized\u0060 bounds so that only \u0060?Sized\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/librustdoc/clean/inline.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"b47d3a376eb01d4a38a7a1a2b2c22a4f47f0587be6f2601cca8c29903e51a98f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(sized-hierarchy): Always skip \u0060MetaSized\u0060 bounds so that only \u0060?Sized\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/librustdoc/clean/inline.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"812bcb9a4816ab515fd7dbe5e510ad6d3247d5fe4a808a47f7bd53de95f5e674"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(sized-hierarchy): Always skip \u0060MetaSized\u0060 bounds so that only \u0060?Sized\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/librustdoc/clean/mod.rs"},"region":{"startLine":975}}}],"partialFingerprints":{"codehealthFindingId/v1":"1af0429394821e0ad27727483ce9cffe142cca529ab6b088d142b79752cd48c7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(sized-hierarchy): Always skip \u0060MetaSized\u0060 bounds so that only \u0060?Sized\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/librustdoc/clean/mod.rs"},"region":{"startLine":1539}}}],"partialFingerprints":{"codehealthFindingId/v1":"a23f9242248c0483addb1cf3ab74fead9d2241734950f9e98ac7e341d64b4db7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(sized-hierarchy): Always skip \u0060MetaSized\u0060 bounds so that only \u0060?Sized\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/librustdoc/clean/mod.rs"},"region":{"startLine":2421}}}],"partialFingerprints":{"codehealthFindingId/v1":"042e156a606b75a64f716f6d6764d23e109c3bd03bb7e70b06d2566b6a691f29"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME (GuillaumeGomez): Should we also make \u0060inline_stmt_id\u0060 a \u0060Vec\u0060 instead of an \u0060Option\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/librustdoc/clean/mod.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"008d1ce7d4b2d5b87390969330e4e8442a2bb50417b95b639fa6869aa7bc411e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(mgca): proper printing :3 \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/librustdoc/clean/mod.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"aca16b804b668f633096bcbabd8910d80ff96d5557808e0c23cfdf401f4b0f95"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(mgca): proper printing :3 \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/librustdoc/clean/mod.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7906967e4bde6c77b3fa8284a2c472db58a849ffa1c6d9a734694f39b378fe6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: instead of storing the stringified expression, store \u0060self\u0060 directly 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":"src/librustdoc/clean/mod.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"37b8e377d3ae363d5e20698b63424660e4d30fdfec16c78f1b1fc8a022559bf8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(generic_const_exprs): should this do something? \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/librustdoc/clean/mod.rs"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"6063deaf2b3d13d65b4b70e66826963e3365a79dafaa61a6bd7f8e105bff2a0b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const_trait_impl): We can probably use this \u0060HostEffect\u0060 pred to render \u0060~const\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/librustdoc/clean/mod.rs"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"08e6bf815169abe506535ebd184818b0373b8fa215a90ab995917d5596811b07"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const_trait_impl) check constness \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/librustdoc/clean/mod.rs"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"b69c673cebc1bac4332a03fa05ba942d5420ee9891907153493b44a28c9924b5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(generic_const_items): this should instantiate with the alias item\u0027s args \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/librustdoc/clean/mod.rs"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"d519863ad60dbfd0ebc3b0a3383ef8cc86203abadad35b68d141b72129e61870"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Avoid re-HIR-ty-lowering. \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/librustdoc/clean/mod.rs"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5436b2d0138dff86ca08747eb62bbb9ead52485aef44df3707dd1a35613e713"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Avoid re-HIR-ty-lowering. \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/librustdoc/clean/mod.rs"},"region":{"startLine":1746}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3e64b74d75ba12f9e4b17a1f7478faa0c766164b39ec186008192eef734e9d2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Avoid re-HIR-ty-lowering. \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/librustdoc/clean/mod.rs"},"region":{"startLine":1890}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a04d4c0976c1a2d6db5d874402fc89f9ea3fa9515a14b468a325f06cd27083b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Avoid re-HIR-ty-lowering. \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/librustdoc/clean/mod.rs"},"region":{"startLine":1916}}}],"partialFingerprints":{"codehealthFindingId/v1":"550d1ef45cfdb7c35a01ea1a1505f8cb49ee113ef834615600311256de422991"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Avoid re-HIR-ty-lowering. \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/librustdoc/clean/mod.rs"},"region":{"startLine":1929}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e73f3d397aa449b0a2370327671d99e572f80c78591d78a391c05a2aa1d66d6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#156711): Instead of re-HIR-ty-lowering the path, obtain the type dependent"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/clean/mod.rs"},"region":{"startLine":1775}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9dd4301728cd1404f7d1bf011762646a14414e9e4f21c05542065f0bf91a499"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#82852): Instantiate const parameters."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/clean/mod.rs"},"region":{"startLine":1866}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b65d74b1c64ef3cffb15c9683184dc9de7bf7825068e55fac10f4277fed7b75"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(scrabsha): propagate view types to \u0060rustdoc\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/librustdoc/clean/mod.rs"},"region":{"startLine":1955}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9b54ed7cf183073a69bb89598e401c82e719ede19cd2cf19bdffd1313b09db8"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: low-churn fix for #79459 while we wait for a trait normalization fix \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/clean/mod.rs"},"region":{"startLine":1971}}}],"partialFingerprints":{"codehealthFindingId/v1":"a38b319122946b8713f95733837b061b03d00896ac8ef0bc019fffd583584455"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(fmease): Don\u0027t compare lexically but respect de Bruijn indices etc. to handle shadowing correctly. \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/librustdoc/clean/mod.rs"},"region":{"startLine":2043}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3942f9266b5c4fdf1d1e2a9b8770a334306ee496b5a35657bdff14ee8ecdbff"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(fmease): Don\u0027t compare lexically but respect de Bruijn indices etc. to handle shadowing correctly. \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/librustdoc/clean/mod.rs"},"region":{"startLine":2067}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e3121b3235a6de0cfb3cbf33542b2ee52fb4e8afa94523b3d3dc85103595049"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: If we are in an expression context (i.e. fn bodies and const exprs) then the default 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":"src/librustdoc/clean/mod.rs"},"region":{"startLine":2059}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2eadf7af90796556d60da29fbbdb0765cf3ea65e4679903dcbbde28cdb32c7e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(fmease): Since #129543 assoc tys can now also induce trait object"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/clean/mod.rs"},"region":{"startLine":2093}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8bb340b811093565c001c9b7a8dacd2aa9515a0032e4eb02d9d42169d3a0c9a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: should we merge the outer and inner binders 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":"src/librustdoc/clean/mod.rs"},"region":{"startLine":2178}}}],"partialFingerprints":{"codehealthFindingId/v1":"4be361dd3c0f41f8f641e7e184e7c4b00aa586b70c8784558024242032b2ce75"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(non_lifetime_binders): Support higher-ranked const parameters. \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/librustdoc/clean/mod.rs"},"region":{"startLine":3467}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4738061560f9f64d2886e510770f98ae89a39238539265d3eb4da968b6977d5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(sized-hierarchy, #157247): Actually render \u0060MetaSized\u0060 as \u0060MetaSized\u0060 and"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/clean/simplify.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3405bb2bde3fd0b6e3012c0446387997c4e768766d70752333923d10015891c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(fmease): It\u0027d make a lot of sense to just incorporate this logic into \u0060clean_ty_generics\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/librustdoc/clean/simplify.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1976eb34f3cc5a6011190c55703a798a9d928c54818fc72d5e4e8d9086d08a3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: what about non-staged API items that are deprecated? \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/librustdoc/clean/types.rs"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cc85598dbd4af4ac9ae2901730eec4815639b038ac4bc4570d2923cdee7da5b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(checked_type_alias): Once the feature is complete or stable, rewrite this \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/librustdoc/clean/types.rs"},"region":{"startLine":1353}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a3c76091d84d034b72a5aa67828c4dd7e613bc51fe6beeea97bad7205a2eb68"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(checked_type_alias): Once the feature is complete or stable, rewrite this \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/librustdoc/clean/types.rs"},"region":{"startLine":1467}}}],"partialFingerprints":{"codehealthFindingId/v1":"354e7a72ebc306d1dfa7677ac9540f1365a6de6af29343b02c9c64ed55b5dc21"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: compute this field on demand. \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/librustdoc/clean/types.rs"},"region":{"startLine":1658}}}],"partialFingerprints":{"codehealthFindingId/v1":"22bb5d2769197e381e9f2666437e62a88274c0bafc41ecce776463491221485c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: If we ever add an inherent impl for tuples \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/librustdoc/clean/types.rs"},"region":{"startLine":1826}}}],"partialFingerprints":{"codehealthFindingId/v1":"9493282cda50b3b62d9b56f8989e922a5be8ad9ed787af21efc0d99a796bc052"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This will be wrong if we ever add inherent impls \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/librustdoc/clean/types.rs"},"region":{"startLine":1835}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ddb61c3183f6ab47109fec9787b463366b191638f7769bc5dee416186acc48e"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: Primitives are unhygienically duplicated by \u0060include!\u0060. \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/clean/types.rs"},"region":{"startLine":1918}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7533604e18e8b26829dd2cd636cd939dd6c0cb5576733d79012f96a7a442513"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: is there a time when the lo and hi crate would be different? \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/librustdoc/clean/types.rs"},"region":{"startLine":2111}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec5cf17fb64afebcbab3fccc7c1a9f355a5c7cf08c3fa2254a4f38caa6029aee"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This isn\u0027t really right, since \u0060Fn(A, B)\u0060 is \u0060Fn\u003C(A, B)\u003E\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/librustdoc/clean/types.rs"},"region":{"startLine":2250}}}],"partialFingerprints":{"codehealthFindingId/v1":"b05af227c2858230ffbde36ad39860e76b8f0bf4bf917f9b524c291835593a08"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Somehow get rid of this field. \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/librustdoc/clean/types.rs"},"region":{"startLine":2301}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ec258ff338962cb0bd8988dcc4b60cc0bb00030a0bfeba648ce026ffeaec6db"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this is an unfortunate representation. rustdoc\u0027s logic around consts needs to be improved. \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/librustdoc/clean/types.rs"},"region":{"startLine":2369}}}],"partialFingerprints":{"codehealthFindingId/v1":"58e297f229c63a9f63ab257de6abb57c1a7ae3bf3d1f45e5ae64b17275c09597"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME(shua): the debuginfo template type should be \u0027str\u0027 not \u0027u8\u0027 \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/etc/gdb_providers.py"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"09325c7009326292115279cdbd9b9f3b27b6eddf7f24532fe8b1f89394c3b1ee"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: It might be worth looking into the debuginfod fetch content if the local file \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/etc/gdb_trim_paths.py"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"979881b5a3bf789cb038ca35de267c680071c06b7a224f83fab627e91fcd14d8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: should we handle clear/free events? \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/etc/gdb_trim_paths.py"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"d25043bf66b716ea942fabd311356e071ddb8b653f495ec497ef1ad7d7889d8a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # noqa: B018 FIXME: py2 \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/etc/htmldocck.py"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"c541935a5fccf51d27f9069e8a74152ccb77877c3f0f21ba6d37db11669f9cef"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # noqa: B904 FIXME: py2 \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/etc/htmldocck.py"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e16679474f9456b5db580a682f0147a57c739539609a7777b61bd27576ddb3e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # noqa: B904 FIXME: py2 \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/etc/htmldocck.py"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"55515e5f5fc0072858bf7b569902bf49f42d40ab7c6956aa830b6e4d85b6d3fd"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: I don\u0027t know if this works when the DWARF lives in a separate file \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/etc/lldb_lookup.py"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"faf2762083b46f19617b260e862cd4883e957ccba8d74b90af9e9b9892698c86"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: Avoid printing as character literal, \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/etc/lldb_providers.py"},"region":{"startLine":1739}}}],"partialFingerprints":{"codehealthFindingId/v1":"43994264581f37feafabd87397ef5b931206e73ebe494685c6ab7e65e15ba1f5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME the only way we can look up static fields is by name (as of lldb 22), so we need a way \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/etc/debugger_tester/common.py"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a302c462ce7c3d97893431590b58188f53d7119a15d7a667218eccbabb96fa5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME handle 32 bit targets \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/etc/debugger_tester/common.py"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"d597df5ccd9024501a88bf7e92705f8ca9d195b58bb3038c2c460400a5a403a3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME these checks aren\u0027t exactly the most efficient they could be. Luckily, the happy \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/etc/debugger_tester/common.py"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a097f93cd9068e2d9c589e1ab7f31009c24dad28758b89ea5edd8204a8705c9"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: # HACK(eddyb) print a newline to avoid continuing an unfinished line. \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/etc/debugger_tester/lldb/batchmode.py"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"e809008fb5ae2c2e2fefa648079b7a22327371384bf479e7321bfb5086850698"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME Rust doesn\u0027t output template *values* (the \u006010\u0060 in \u0060ArrayVec\u003Cu8, 10\u003E\u0060), only \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/etc/debugger_tester/lldb/from_lldb.py"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"305e26a1c5d32049c1fc63de9b48a9d6e8a9daecc9fe50bdcb99af7138fa7b4d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME (todo) 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/etc/debugger_tester/lldb/from_lldb.py"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ac8e88db51f3f88902ebf9f2e4558d7582552aa95809b59438ef422ab3456ff"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: # HACK it\u0027s obviously not ideal to output empty breakpoints, but it will be somewhat rare for it \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/etc/debugger_tester/lldb/from_lldb.py"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"946c87411fe94c5e65168e7991f77a712833b1aed73b61adac45b6a5f8c58598"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME the purpose of this check is to gracefully handle generic *values* (e.g. the \u00602\u0060 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":"src/etc/debugger_tester/lldb/from_lldb.py"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"d20dd2f6a3b87ccf7d9f19dd16963d15dedfdd851a64877c4f39d33f641b9d44"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME(Walnut356) at the moment I haven\u0027t fiddled with GDB enough to know what 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/etc/debugger_tester/gdb/check_gdb.py"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"691d1147ae5e60e95b7a011b686a0ba0fc72d1ee9b030faadfca441efa475052"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: condition --accel hyper on target arch matching host arch \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/ci/docker/scripts/fuchsia-test-runner.py"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"1edff8304582c02eaaabfa5596ece53a1dcc9884d591c2a26990a57f1406dde7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: shardify this \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/ci/docker/scripts/fuchsia-test-runner.py"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"005e4267605585fc760df498cd3109dbbdf15c051643ef30f5b2d1fff5fd0ee4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#142296): this hack is because there is no reliable way (yet) to determine whether a given"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/build_helper/src/targets.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"25391c64437c7e425ca873052c861ebd11921d95f38a2248522b1e108b7f05d1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: Audit whether this implementation is robust enough to replace bootstrap\u0027s clean \u0060rm_rf\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/build_helper/src/fs/mod.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"d46e1d21c4ec18b250668a86b4fb93ca2c3424fa9275347e0321f7f7637fdda7"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: # HACK: On Windows, we can\u0027t delete rust-analyzer-proc-macro-server while it\u0027s \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/bootstrap.py"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"25d45588cfe6c3b8d141ebfd52a8ba29248411f1c71c713a352465d40c29773e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: A cheap workaround for https://github.com/rust-lang/rust/issues/125578,"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/bootstrap.py"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"64f77c670d43157a23fa54de391d323ba7fbf71a79e4eed93a10e4dea93bf12c"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: # HACK: This works because \u0060self.get_toml()\u0060 returns the first match it finds for a \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/bootstrap.py"},"region":{"startLine":1391}}}],"partialFingerprints":{"codehealthFindingId/v1":"1158d82a95c9e11488c10853329b2943bea1c1557eee154d3d0cf5ae34f50376"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: Since the commit script uses hard links, we can\u0027t actually tell if it was installed by x.py setup or not. \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/cli_main.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4e18562a8ad013ebbcde539b83b67037c7a85f10b0d8612cff82cbefe85534d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: only msvc is currently 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/bootstrap/src/utils/helpers.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"5830854cdf1374ac0b0bbf6bf66b2b9f77546de80e5a1dda74aa2d9ee7860f91"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: consider split debug info on other platforms (e.g., Linux, macOS) \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/bootstrap/src/utils/helpers.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d3ea583ed02f0557c26dd184a7215c455045e7844a17c81ce9bb91746fd69e1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this information should be gotten by checking the linker flavor \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/bootstrap/src/utils/helpers.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eb1386ee8c48ff7f14b5643c53916dfb7a8387ba1a7211af34f47a921c2877f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME(Zalathar): This is partly redundant with the parsing code in \u0060parse_codegen_backends\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/bootstrap/src/core/backend.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"316e31165c6fad96b1679b7d0ea1c3680d55a23778060f5993d12102e11a7e85"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Handle libc\u002B\u002B version check. \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/bootstrap/src/core/sanity.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"19d5579b88d1fa8b29c94c4cb4b43a1e260ecff47fe58842467d97c6b1249417"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#133381): alt rustc builds currently do *not* have rustc debug assertions"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/config/config.rs"},"region":{"startLine":884}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4822d6d66bfc30cd5285ded942703698c473ca98d11dd5f157b9e68e71f5f5a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#129153): instead of all the ad-hoc \u0060download-ci-llvm\u0060 checks that follow,"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/config/config.rs"},"region":{"startLine":1122}}}],"partialFingerprints":{"codehealthFindingId/v1":"62fc9842b9c6ff9277ec2d3d3df830bcfd8c6471e1003f39ad14a44da2cb8a31"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this whole logic should be refactored to not use \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/bootstrap/src/core/config/config.rs"},"region":{"startLine":1771}}}],"partialFingerprints":{"codehealthFindingId/v1":"f93a83b06d804202494f9a401746835d4a0b13bafe0b5d0c24e2399ba2f15a93"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this doesn\u0027t cover \u0060--set\u0060 flags yet. \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/bootstrap/src/core/config/config.rs"},"region":{"startLine":1796}}}],"partialFingerprints":{"codehealthFindingId/v1":"3681849a73fbc3dfaead3876f1ab7c80ebe39aa9bcbaff4c253bb0e316f5c77a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Remove this option at the end of 2026 \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/bootstrap/src/core/config/flags.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"71893309470fb6d5bce4529c8c48b19b92129ac3d7c2f109a30b06cee522d999"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Remove this option at the end of 2026 \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/bootstrap/src/core/config/flags.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"88e40ee16a4b6a1ec8723b1ef5a6668fd67311feece5df2a7fc118e97513a505"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Remove this option at the end of 2026 \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/bootstrap/src/core/config/flags.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"b443ec3611193135c5b2d44211bab9dc2e20bd2f91811b2592568b2e04bf9e64"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Remove this option at the end of 2026 \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/bootstrap/src/core/config/flags.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"57809e6230dbbc4c98fba0bc7d5daccd93bc9def70101649695a873fa87dfe73"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Remove this option at the end of 2026 \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/bootstrap/src/core/config/toml/rust.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"de66410151a9981329465e5a67fd5bf97934322f76e043e4bb45c9b2e64cf534"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Remove this option at the end of 2026 \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/bootstrap/src/core/config/toml/rust.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"382ff3a5c2dfca7ee6e71480b29496c99bf3eb9cccaa2f6bb95466c34c248cc0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Remove this option in Q1 2027 \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/bootstrap/src/core/config/toml/rust.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fd7ac0d7d0a073b723ada94ccd2da744944d3264f169e0ff9f4a960c5aba225"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME(Zalathar): This is partly redundant with the parsing code in [\u0060CodegenBackendKind\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/bootstrap/src/core/config/toml/rust.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"35181cb4856307e5dda14e5a982a51303e1e92678293302147895f01f043d905"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(onur-ozkan): Add coverage to make sure modifications to this 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":"src/bootstrap/src/core/builder/cargo.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"a975233048a53e95a4e4030f16cfb355cc4cb9b226bad281d3330dde66d833ea"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: we should really investigate these... \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/bootstrap/src/core/builder/cargo.rs"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bf4269b4d2335e1c9b823c66a847c835f4914a054ee6cef67143b1e9e80829b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: the guard against msvc shouldn\u0027t need to be 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/bootstrap/src/core/builder/cargo.rs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"e90e67895eb211055e1821872b0f95f1ab60b380efb0abcad6ee633e0c7d98b7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: There is a bug in Clang 18 when building for ARM64: \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/bootstrap/src/core/builder/cargo.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6ff3daf20f1ce873601a8178a8a0a7b7890965830325a762c0a1ebb3d0d7ee0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: the cc-rs crate only recognizes the literal strings \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/bootstrap/src/core/builder/cargo.rs"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"467a3c882bba5487e3dddb375e58c5a7cc6ed34a090369e5d72b4ddc0504a045"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this means the argument above about doing this for rustc but not std makes \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/bootstrap/src/core/builder/cargo.rs"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c87f80a80620a3dea7a88926c942f5ff169a2db18bcc93c6c4986c3b5ade164"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: remove this directory clearing here, and do it explicitly in individua doc \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/bootstrap/src/core/builder/cargo.rs"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"302dead0f899e8eba397d258856b66db4bdbe347978645ad112aec176aa1052c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: the following components don\u0027t build with \u0060-Zrandomize-layout\u0060 yet: \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/bootstrap/src/core/builder/cargo.rs"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"76d9ca24bca50cfd9cb0983f0f83e96ba5348617c91dfae2d17b35c3e38a2b85"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(rust-lang/cargo#5754) we shouldn\u0027t be using special command arguments"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/builder/cargo.rs"},"region":{"startLine":878}}}],"partialFingerprints":{"codehealthFindingId/v1":"7269229e1a55c4b1b051f8f66840da7037ddd3b9a4cae2d05bbaf596d0f49a76"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: It might be better to use the same value for both \u0060RUSTFLAGS\u0060 and \u0060RUSTDOCFLAGS\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/bootstrap/src/core/builder/cargo.rs"},"region":{"startLine":885}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7883ee1cb0e11933311a660b175101dbf0630537412e49d3cad983f42aa9cf5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#152709): -Zunstable-options is to handle JSON targets."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/builder/cargo.rs"},"region":{"startLine":900}}}],"partialFingerprints":{"codehealthFindingId/v1":"975232fa1bcafaf23449bc67d0ac9a5b39606a4551415ebe256a02d6193b1ddc"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#152709): -Zunstable-options is to handle JSON targets."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/build_steps/compile.rs"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b57c76747b831105b32b964d697c44ea938bfb61420e427c775c916244ce3c3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Temporary fix for https://github.com/rust-lang/cargo/issues/3005"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/builder/cargo.rs"},"region":{"startLine":969}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cd1d027adf84b66f8d547d6cab6978ff5e3de2ce82ae91b6fa87fd69caff929"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(edition_2024): Change this to \u0060-Wrust_2024_idioms\u0060 when all \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/bootstrap/src/core/builder/cargo.rs"},"region":{"startLine":1358}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bc8b6154b8a4fdbde5b5cf8c05c925ff3a2f6b177a29679ba016cbbcab602ce"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(Zalathar): This particular check isn\u0027t related to path-to-step \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/builder/cli_paths.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fb0179e7bb92364f354118c342860f2c536569a37ee96dbe752953e768baab8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This also helps bootstrap to not interfere with stage 0 builds. We should probably fix \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/bootstrap/src/core/builder/mod.rs"},"region":{"startLine":872}}}],"partialFingerprints":{"codehealthFindingId/v1":"abee598d12a383d77ce9c5c5a31dd21da713cde922cd386170e5a0e586cddb2b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: This function is unnecessary (and dangerous, see \u003Chttps://github.com/rust-lang/rust/issues/137469\u003E)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/builder/mod.rs"},"region":{"startLine":1255}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5438b5e2a6e3c30b0391ef3cd640354095155072dd1625066e646a926d93564"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: make the \u0060Std\u0060 step return some type-level \u0022proof\u0022 that std was indeed built, \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/bootstrap/src/core/builder/mod.rs"},"region":{"startLine":1303}}}],"partialFingerprints":{"codehealthFindingId/v1":"c77dd38d33bcd9fa9ed76e21a8ecf9ce8fef57bd1a8e6864e61bbc819cfc5a53"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: the libraries should be added elsewhere, not in this 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":"src/bootstrap/src/core/builder/mod.rs"},"region":{"startLine":1409}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc117f0e644bb62a09fc0302278334a38ae1ec277ea6c6a2b5563c1d188b5cc2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(Zalathar): Doing a string-replace on \u003CPathSet as Debug\u003E \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/bootstrap/src/core/builder/cli_paths/tests.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"5219af915ffd4a5186acf714426aa52e93cd8bba1110f8d7764546814d91de19"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(Zalathar): Is there a better way to locate the snapshots dir? \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/bootstrap/src/core/builder/cli_paths/tests.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"6771e334664507b75cd90865fe6766c34c3b4863dab4f5136e88005a20fbe9d5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(Zalathar): Currently this doesn\u0027t actually skip the coverage-run 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":"src/bootstrap/src/core/builder/cli_paths/tests.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"8939d6a37cd01b446e88027810f336e0e08b547db6d810c5c5021ffd9fd7007b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: remove this and either fix cross-compilation check on stage 2 (which has 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/bootstrap/src/core/build_steps/check.rs"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"de2155e680b99b5c62340e2c9ac62c4cb90489749aa09de058e12f9d067b3039"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: remove once https://github.com/rust-lang/rust/issues/112393 is resolved"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/build_steps/check.rs"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ac9b6198970eae41059fc8cb42f9f2f22ad4df052cad6226ff6bbe1f46bb1e0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: check bootstrap doesn\u0027t currently work when multiple targets are checked \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/bootstrap/src/core/build_steps/check.rs"},"region":{"startLine":818}}}],"partialFingerprints":{"codehealthFindingId/v1":"95d4525c6ab08f7c55d0fb3d64748685509e65bfaa552428ac8711e9abd00c1d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: rust-analyzer does not work with --all-targets \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/bootstrap/src/core/build_steps/check.rs"},"region":{"startLine":819}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8f08ee05a5060cdf500346d680dfb8fdbf438edd82a3b9053dedc8a85256483"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: currently, \u0060--fix\u0060 gives an error while checking tests for libtest, \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/bootstrap/src/core/build_steps/clippy.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"f21300efe4db04156d50a0dce1248da497b36cd95babb1a435d23f10e4923cce"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(jieyouxu): this flag is load-bearing for rustc to not ICE on broken pipes, because \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/bootstrap/src/core/build_steps/compile.rs"},"region":{"startLine":1226}}}],"partialFingerprints":{"codehealthFindingId/v1":"159db5d6505860cd35a1b0f890b9a139711c5fb4f224042f2cd5590ff308eb9d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#156525): investigate if this is still needed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/build_steps/compile.rs"},"region":{"startLine":1999}}}],"partialFingerprints":{"codehealthFindingId/v1":"193e5b584cc112346adf03362265ff18ab598089d225225cd3a9cf127c5e01f3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this is wrong when compiler.host != build, but we don\u0027t support that today \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/bootstrap/src/core/build_steps/compile.rs"},"region":{"startLine":2028}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d79087f25b732341b9c37a7716319098e8105a17c2802f9a60bed8e84b56353"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this is incomplete, we do not copy a bunch of other stuff to the downloaded \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/bootstrap/src/core/build_steps/compile.rs"},"region":{"startLine":2272}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d670a036eda8ef11cd886d19ea0096b9f402b878d9367e516ed84de1db11ac9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: It may be faster if we build just a stage 1 compiler and then \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/bootstrap/src/core/build_steps/compile.rs"},"region":{"startLine":2290}}}],"partialFingerprints":{"codehealthFindingId/v1":"87a3f4e7c77bb8c8b613f8065cc6bb2c3ba67b0df37638c25030815b7d9fcee5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this is a horrible hack used to make \u0060x check\u0060 work when other codegen \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/bootstrap/src/core/build_steps/compile.rs"},"region":{"startLine":2400}}}],"partialFingerprints":{"codehealthFindingId/v1":"91c1abaed2fdad363c408a6af3c99a8524343cad6679b0ee932338818ac9a4a1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this set of targets is *maximal*, in reality we might need \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/bootstrap/src/core/build_steps/compile.rs"},"region":{"startLine":2460}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0262759bcdacbc73d20f143f93827bc638d921fbebe04243241b09a7f855c61"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: to make things simpler for now, limit this to the host and target where we know \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/bootstrap/src/core/build_steps/compile.rs"},"region":{"startLine":2930}}}],"partialFingerprints":{"codehealthFindingId/v1":"700c80f481ff9a15b0dab92ec400890ba9a36cc8d1c84ad5a98a838b51c4053e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: explicitly enumerate the steps that should be executed here, and gather their \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/bootstrap/src/core/build_steps/dist.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"c579c46351876ebe436dfed18885ffbd58a8d5a10bb3f65cdd1759ab44b513eb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: if we\u0027re managed by git, we should probably instead ask git if the given 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":"src/bootstrap/src/core/build_steps/dist.rs"},"region":{"startLine":1435}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1bd62c879ca5db64ffbd753c95a8e4053f91b2230367e0399c2e3965ab399c4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME add installer support for cg_clif once it is ready to be distributed on \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/bootstrap/src/core/build_steps/dist.rs"},"region":{"startLine":2093}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ec060657dbb8f56f2d2c5d2ec6b15f80b8b1e0948d93bfa8d7992707a703cb3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Should BuildManifest actually be built for \u0060self.target\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/bootstrap/src/core/build_steps/dist.rs"},"region":{"startLine":3096}}}],"partialFingerprints":{"codehealthFindingId/v1":"b50e0ab74fcda89b92dc668ff1099419c1437ba1572ec577e030eaa0ecf735ef"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: \u0060--generate-link-to-definition\u0060 tries to resolve cfged out 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/bootstrap/src/core/build_steps/doc.rs"},"region":{"startLine":1117}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a4d43f84222bf085c44a91c954a567ef49c7200204416917541f203b47a91c9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: \u0060-Zrustdoc-map\u0060 does not yet correctly work for transitive dependencies, \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/bootstrap/src/core/build_steps/doc.rs"},"region":{"startLine":1130}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b0da8492408fefb849e9a1fa3ddc95a19714b18f4102113df43e30b5747acdf"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Cargo should probably do this itself. \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/bootstrap/src/core/build_steps/doc.rs"},"region":{"startLine":1141}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce7cb586da236a590ee1d6914039a134c7f95a70855d387c4db8830180d96ed1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: create a shared method on builder for auto-bumping, and print some warning 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":"src/bootstrap/src/core/build_steps/doc.rs"},"region":{"startLine":1757}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4d21362b28be8dcd76d4db53bc188fdb3f45f15ad26619da08a027b5325fc3d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(madsmtm): compiler-rt\u0027s CMake setup is kinda weird, it seems like they do \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/bootstrap/src/core/build_steps/llvm.rs"},"region":{"startLine":974}}}],"partialFingerprints":{"codehealthFindingId/v1":"099f0d34a9f6c1bf9ca4a904ad5db5ba7f656ba490d7837e654b736a4f23d689"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(madsmtm): Allow \u0060cmake-rs\u0060 to select flags by itself by passing \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/bootstrap/src/core/build_steps/llvm.rs"},"region":{"startLine":1039}}}],"partialFingerprints":{"codehealthFindingId/v1":"023be23096906648f909ba17890bbb7122b62b1a4b26ad9403c9db1aa5e94db7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(offload): In an ideal world, we would just enable the offload runtime in our previous LLVM \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/bootstrap/src/core/build_steps/llvm.rs"},"region":{"startLine":1306}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1d9f07b42e80fba72b6a6d707741fbbcf3bd5c437215c33459ada4836448d0a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(offload): Once we move from OMP to Offload (Ol) APIs, we should drop the openmp \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/bootstrap/src/core/build_steps/llvm.rs"},"region":{"startLine":1486}}}],"partialFingerprints":{"codehealthFindingId/v1":"55c23e422c70591491cd36fe22e47732050052ae5b32d140575d747305bed79c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(ZuseZ4): Find a nicer way to use Enzyme Debug builds. \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/bootstrap/src/core/build_steps/llvm.rs"},"region":{"startLine":1641}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bf23380e4797b8ba5d7b02c40132c561c35861a754fc63df670f800ab6ef981"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: https://github.com/alexcrichton/cc-rs/issues/545#issuecomment-679242845"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/build_steps/llvm.rs"},"region":{"startLine":2216}}}],"partialFingerprints":{"codehealthFindingId/v1":"abe6b1ee05f7e8c51d39d5d5c5ab17955ecdb061d4f75f2101ea6eb8e6c38ea8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: experiment with LLVM_OMIT_EXPORTS_FROM_CONFIG=OFF and changing library search paths as described in https://github.com/rust-lang/rust/pull/163731#discussion_r4286684608,"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/build_steps/llvm.rs"},"region":{"startLine":2406}}}],"partialFingerprints":{"codehealthFindingId/v1":"87bb1dd9c4e9ff824f1d0dde2fb20efe71796c50df529705ce2d3cdc618b56b5"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: \u0060builder\u0060 runs this step with all paths if no path was passed. \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/build_steps/setup.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"668e4b337d5307adae5ba1fbee92935b68663a3c3c7298275c0a8559723f3827"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: eventually, we should probably reduce the amount of target tuple substring \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/bootstrap/src/core/build_steps/test.rs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ba80a0ecf96117fbde9e2ead9b67907478fefa2a097390bba2283b67c2c0aef"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: RA\u0027s test suite tries to write to the source directory, that can\u0027t work in Rust CI \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/bootstrap/src/core/build_steps/test.rs"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ddd5cfdd85937d4b97d25369707d66c7ab74b9ff86f89a9281bd07961928254"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this test wants to find a \u0060rustc\u0060. We need to provide it with a path to staged \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/bootstrap/src/core/build_steps/test.rs"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d4d8e6d868bbd534f4f33407d8ed7e69d6743768569c11f899ef8cbb298e922"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#156525): \u0060compile::Sysroot::run\u0060 intentionally do not copy \u0060rustc-dev\u0060 artifacts"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/build_steps/test.rs"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"7190214a9a72c423f67fc1f3c276d7a1b8e847c0dcfcc94ebbf191eeeb340aca"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#156525): \u0060compile::Sysroot::run\u0060 intentionally do not copy \u0060rustc-dev\u0060 artifacts"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/build_steps/test.rs"},"region":{"startLine":1343}}}],"partialFingerprints":{"codehealthFindingId/v1":"60649a5b151fe04b4af8f3361a3af67297387d7dc1badd6830c72a7431a871e3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(Zalathar): Integrate this into central skip handling 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":"src/bootstrap/src/core/build_steps/test.rs"},"region":{"startLine":2185}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecc9b67450089d0467327799364d2732fbb17f01a278252916e54ee40ef6576d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(136096): on macOS, we get linker warnings about duplicate \u0060-lm\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":"src/bootstrap/src/core/build_steps/test.rs"},"region":{"startLine":2710}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f6626210bf84162d58269c1104f56a97fb0c101bae10fb2a39f60993791ec3f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME(Zalathar): Try to split this into two separate steps: a user-visible \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/bootstrap/src/core/build_steps/test.rs"},"region":{"startLine":3594}}}],"partialFingerprints":{"codehealthFindingId/v1":"02c00e680e35451eaee5c8ca25f5a61a73e8eecb725bac01a9a0a6e8f0637dda"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this looks very wrong, libtest doesn\u0027t accept \u0060-C\u0060 arguments and the quotes are fishy. \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/bootstrap/src/core/build_steps/test.rs"},"region":{"startLine":4006}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b02f2d0285e1db2d0587f391ce9ef3cdda4a3064a3d4afe9892745effca6931"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME(#136822): dist components are under-tested."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/build_steps/test.rs"},"region":{"startLine":4100}}}],"partialFingerprints":{"codehealthFindingId/v1":"69f0a8c68e2d4df0e2d438d90953066ebe43084282b15fd7f7fa27b272b710c9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME handle vendoring for source tarballs before removing the --skip-test below \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/bootstrap/src/core/build_steps/test.rs"},"region":{"startLine":4639}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5c90736f3ea9ba0b80a060db2582770e3c6f09e59885647bd5088f3a86f2413"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME remove once vendoring is handled \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/bootstrap/src/core/build_steps/test.rs"},"region":{"startLine":4656}}}],"partialFingerprints":{"codehealthFindingId/v1":"42f51353180a3b551f53c18b549ceb642d71ed86e8e44afad6c114bc985d6063"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: remove this, it\u0027s only needed for download-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/bootstrap/src/core/build_steps/tool.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"b34ed3c514e129fcfb0ee4925bf40d424d713a43198cb69394e8356b33ee977e"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK(#82501): on Windows, the tools directory gets added to PATH when running tests, and \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/build_steps/tool.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"8697d8ab784c1594075e18f303b1293baa8a98698dfb970b8a3951976afdacf8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: reduce the number of args and remove this. \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/bootstrap/src/core/build_steps/tool.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"a694376ab42c257b1f824580869c9bef5c0dae2739301ace031178df86820dd0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(Zalathar): Should we stop registering \u0022src/tools/rust-analyzer\u0022 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/bootstrap/src/core/build_steps/tool.rs"},"region":{"startLine":1129}}}],"partialFingerprints":{"codehealthFindingId/v1":"78be00d5f35413a6fcfb83e3c92729c96d90fb521cb8e3e244ac640830e852e1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: make 100% sure that \u0060target_compiler\u0060 was indeed built with \u0060build_compiler\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/bootstrap/src/core/build_steps/tool.rs"},"region":{"startLine":1384}}}],"partialFingerprints":{"codehealthFindingId/v1":"78b3b291f05784165ba7b4d5f5fbb7c78bbc2a574ef63431b8d4db7c4244ce4d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: The \u0060#[link]\u0060 attributes on \u0060extern \u0022C\u0022\u0060 block marks those symbols declared 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":"library/unwind/src/libunwind.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec01be155416e55e64f8571038377f7a0d94070a5aed14007ba97b01ad79560e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: error in this case? \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":"library/test/src/bench.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b5fffe701d142f8f750a0f6994efa0d835982b36a12fe1059295036397878fa"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME #11059 handle NaN, inf and overflow"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/test/src/stats.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3889c2d3654d68fbc46f13794a8b7bd492e25fb64394bed5eb0eb4fedd37f01"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME (introduced by #65251)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/test/src/tests.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d777db7782a3a150da14d002105241461c39ed104342d21dc17422182fde206"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME (#13400): this is only a tiny fraction of the Windows console api"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/test/src/term/win.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"95eaadbf670b0b4d24bc2a9c66d0490ed351f94294beb54dd65ea013a007ae5c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: we still need to verify these intrinsics or find 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":"library/stdarch/crates/stdarch-verify/tests/arm.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba0443024e5358d2d208c690d858b4844f356193df6487fd35f639d54b578f91"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This instruction checking logic needs work to handle multiple instructions and to only \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":"library/stdarch/crates/stdarch-verify/tests/arm.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ffff2ee00c50c0d49a8a0f7900a6f21c47fc8d826b91f3f0220d6849e0b9650"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: verify \u0060target_feature\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":"library/stdarch/crates/stdarch-verify/tests/arm.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"76e4f72412c909899f435f676728d365530ba571e2388d00b6bb7c1ea6268b3f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(arm-maintainers): Some tests require new rustc intrinsics in order to generate \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":"library/stdarch/crates/stdarch-verify/tests/arm.rs"},"region":{"startLine":677}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfff0973ad6ac0a9d0491060dcfe742b81603b1d52f8452190aa3f2f41071748"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(arm-maintainers): With the advent of the \u0060intrinsic-test\u0060 tool, new tests of this kind \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":"library/stdarch/crates/stdarch-verify/tests/arm.rs"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd3345054a0d961bcb5d398e4a64b91daec6f00112b39c1aeddf90b6dfd51430"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this list should be almost empty \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":"library/stdarch/crates/stdarch-verify/tests/x86-intel.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"437bf81655d9711f23c41c5c48c672bd51c330b4b359f45f89dfe02745ec0657"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: these have not been added to Intrinsics Guide yet \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":"library/stdarch/crates/stdarch-verify/tests/x86-intel.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"a650e2ed8d4a4a945c0afa8b729530ffd9ab8381c636a0ef5999e4ff99dd14f1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: should probably just reuse \u0060Invoc\u0060 from the \u0060assert-instr-macro\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":"library/stdarch/crates/stdarch-verify/src/lib.rs"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4adc77bb06e3b7f79e464dcb3183cc8cef8c70a2f48d1c76ac441e2bf9c98cb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: resolve the conflicts (x86_64 and aarch64 have a bunch, probably others) \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":"library/stdarch/crates/stdarch-test/src/lib.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"da5cc872e178d666a5cb7965a0f239f6ec25baf5fb731c514d2cfddfed2d56f4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: original logic but does not match comment \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":"library/stdarch/crates/stdarch-test/src/lib.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d051a5c72c61798cd2717276b67f1aefc2be2db930e7209199bbaf0f8672c57"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Add detection for other archs \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":"library/stdarch/crates/stdarch-test/src/lib.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"35c2d7a65db030229e5d9ed34d88d0cecd8e99ef33e97865e5869eecf93db266"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: In many cases, it\u0027ll be better to use an unpredicated (or zeroing) 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":"library/stdarch/crates/stdarch-gen-arm/src/intrinsic.rs"},"region":{"startLine":1298}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e41d60a0232842d642a39635ec8054fae36c3ef9bcfbcac52ef8c241e7d4adf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: make the unwrapping safe \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":"library/stdarch/crates/intrinsic-test/src/x86/types.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"8729450d346eb7f64ce3ecc62cc72d4e9c5efb801c3fecfa85dde746532ece96"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: https://github.com/rust-lang/stdarch/pull/2133#issuecomment-4524350350"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/simd.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee0162eda5829ece9a9c04489d044e1b125fe9c50ef8b210d61f78043c6767f3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: https://github.com/rust-lang/stdarch/pull/2133#issuecomment-4524350350"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/simd.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"23d07b6f7235e621464c082bb4fd428f060910c9258bba52523830aa83face34"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: https://github.com/rust-lang/stdarch/pull/2133#issuecomment-4524350350"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/loongarch64/simd.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e5a82b9b147f6421620192fc11a12002c92b7f50ac768f2d0d46bc66a4840fa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: test the behavior when the input is \u00600\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":"library/stdarch/crates/core_arch/src/x86_64/bmi.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b70f38ec12bdaeed078f7149a578bf47b6532cf42b5116101ad4d1fe185b8d3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: test the behavior when the input is \u00600\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":"library/stdarch/crates/core_arch/src/x86/bmi1.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eb33b3a3cd9ed0bddc2c33a2b0734bc069d55227ee4d39ace5d2ac7f99c0e0d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO Validate vcmppd \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":"library/stdarch/crates/core_arch/src/x86/avx.rs"},"region":{"startLine":821}}}],"partialFingerprints":{"codehealthFindingId/v1":"3525807ce582eb4c36265b47d77359a421d270eaf51e4cd72736be502a397fb6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO Validate vcmppd \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":"library/stdarch/crates/core_arch/src/x86/avx.rs"},"region":{"startLine":836}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd4034851f375958d0ed112618a69d2e132b718e543d92a3869e366c363ab839"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO Validate vcmpps \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":"library/stdarch/crates/core_arch/src/x86/avx.rs"},"region":{"startLine":851}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e2511c5b1ef46818aa57d032f7384e4a23a59c1902857785c312906c51fd949"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO Validate vcmpps \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":"library/stdarch/crates/core_arch/src/x86/avx.rs"},"region":{"startLine":866}}}],"partialFingerprints":{"codehealthFindingId/v1":"23f62f244e2a2f92fc3baca514f7ac2c4db10172f7cfb3ca4e889de369a03b80"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO Validate vcmpsd \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":"library/stdarch/crates/core_arch/src/x86/avx.rs"},"region":{"startLine":883}}}],"partialFingerprints":{"codehealthFindingId/v1":"191d4b3c1891c0d99cfa8fb4abcae766ce6b48337cb376d478307b6e732edf13"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO Validate vcmpss \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":"library/stdarch/crates/core_arch/src/x86/avx.rs"},"region":{"startLine":900}}}],"partialFingerprints":{"codehealthFindingId/v1":"3caa828fa90bc4b473dfcf205d6a6f8c5ee2c790fb6bec119bed36c6637047f2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //#[cfg_attr(test, assert_instr(movsd))] FIXME \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":"library/stdarch/crates/core_arch/src/x86/avx.rs"},"region":{"startLine":977}}}],"partialFingerprints":{"codehealthFindingId/v1":"9556d0038c0ac152d0376966aeb01ee5f5c1eb07b9dc37e3a0b47060eeddaaec"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME vmovdqa expected \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":"library/stdarch/crates/core_arch/src/x86/avx.rs"},"region":{"startLine":1690}}}],"partialFingerprints":{"codehealthFindingId/v1":"a57a8d39782f44b0ed6742aee10ca0fc1929ada1d402ad47c8fe1a4cbf9fc424"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME vmovdqa expected \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":"library/stdarch/crates/core_arch/src/x86/avx.rs"},"region":{"startLine":1707}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e1a53d3e7a820e64c2359b37f0eb2fa350a34831e235a6f5e3780d27cac8f33"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME vmovdqu expected \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":"library/stdarch/crates/core_arch/src/x86/avx.rs"},"region":{"startLine":1720}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f8ae8ba781927b931764e4ed218f27542e3da29835e3713e3b451918428d08e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME vmovdqu expected \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":"library/stdarch/crates/core_arch/src/x86/avx.rs"},"region":{"startLine":1739}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5d79e65bbdab2dff5378cdfbbea190c9c81dc502bb34a7bf2bbe499b5572cfc"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //#[cfg_attr(test, assert_instr(movss))] FIXME \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":"library/stdarch/crates/core_arch/src/x86/avx.rs"},"region":{"startLine":3286}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc0c1a4acebb3723249f05bb970e2acfd0bc1d721cfa5a7d6df04b1256076a8a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: extend the documentation. \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":"library/stdarch/crates/core_arch/src/x86/mod.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b9f03730dcadd6de4c6c6ebe454489c0b312f00b775d020e0e2d3e053977242"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO; figure why this is a different instruction on msvc? \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":"library/stdarch/crates/core_arch/src/x86/sse.rs"},"region":{"startLine":1097}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cbc1c9ca15abc867178ea8eefbe99c103eccc8b6ac1b9fbf425108170514e89"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Rust doesn\u0027t emit alignment attributes for MSVC x86-32. Ref https://github.com/rust-lang/rust/pull/139261"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/sse.rs"},"region":{"startLine":1190}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9c807b8d4721d5bb9564b1c111119ecb1456158e39a3413b9d3983a543a3935"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME movdqu expected \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":"library/stdarch/crates/core_arch/src/x86/sse2.rs"},"region":{"startLine":1377}}}],"partialFingerprints":{"codehealthFindingId/v1":"948d2d168ecff023d62649be734a0035890e1b6ec90a58b14c989520ae37bced"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME movd on msvc, movd on i686 \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":"library/stdarch/crates/core_arch/src/x86/sse2.rs"},"region":{"startLine":1459}}}],"partialFingerprints":{"codehealthFindingId/v1":"df45d0563dca7302f08c874d4fc4cd082517b81f898b411f9f8a1dbabec49217"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME movupd expected \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":"library/stdarch/crates/core_arch/src/x86/sse2.rs"},"region":{"startLine":2771}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad77a853d90049516875b3e9a52ad290d801ec365d864b353c0351cf28ccc1f5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // #[cfg_attr(test, assert_instr(movapd))] // FIXME LLVM uses different codegen \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":"library/stdarch/crates/core_arch/src/x86/sse2.rs"},"region":{"startLine":2895}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebc4815c0c5b8a802317bff166c483c0d9d2a3cffc9035e688df03387c4f9baa"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // #[cfg_attr(test, assert_instr(movapd))] // FIXME same as _mm_load1_pd \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":"library/stdarch/crates/core_arch/src/x86/sse2.rs"},"region":{"startLine":2909}}}],"partialFingerprints":{"codehealthFindingId/v1":"031f2cc8f6822f2720d17e634d24dfc670bb8197e03bd2ec7a1e23b1fea3d966"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// #       #[allow(unused_unsafe)] // FIXME remove after stdarch bump 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":"library/stdarch/crates/core_arch/src/x86/sse41.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"b688b653fc7ef2cd2ef20868ceb53cf3e7c67450bb4ace72efb88858902e4106"}},{"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":"library/stdarch/crates/core_arch/src/wasm32/simd128.rs"},"region":{"startLine":5561}}}],"partialFingerprints":{"codehealthFindingId/v1":"7abe27f00adf5b6a612789c6dfde7881da09049328aa4dabdd6b0f5e86d565e3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME remove when more tests are added \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":"library/stdarch/crates/core_arch/src/s390x/macros.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd099911e5bd1c20e0b78d36dc57e4df8e92e4826212263cf3411c3d9defec85"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME remove when more tests are added \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":"library/stdarch/crates/core_arch/src/s390x/macros.rs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"33755ddced7577bb6fe032d5c7f7586c89941020a5239df09ee3dc2b9b9fd61e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(llvm): https://github.com/llvm/llvm-project/issues/153655"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/s390x/vector.rs"},"region":{"startLine":2472}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8b5ab852d6d0199c5bb56465af8f52a71d69036706094d224967264be973ad8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(llvm) https://github.com/llvm/llvm-project/pull/153557"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/s390x/vector.rs"},"region":{"startLine":4858}}}],"partialFingerprints":{"codehealthFindingId/v1":"adb54195120d4a58b8083e6c8bf5c52a0c111c90e9bb6e680bf575f2c0922b5a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: the C version uses a shuffle mask with poison; we can\u0027t do that \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":"library/stdarch/crates/core_arch/src/s390x/vector.rs"},"region":{"startLine":5413}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a2e1038caca5b3c19286b5be9d568c11085a08dc138088f74a39ce6bc7832fc"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Currently the P extension is still unratified, so there is no 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":"library/stdarch/crates/core_arch/src/riscv_shared/p.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d6dc32137e381a22eb1f2e9444d881d6ca6a08be977cb679398a48f4aecebd1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo: pkbb16, pktt16 \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":"library/stdarch/crates/core_arch/src/riscv_shared/p.rs"},"region":{"startLine":1127}}}],"partialFingerprints":{"codehealthFindingId/v1":"199f6173ca9d2b80ece238c020771a39e2e09588b695152bc32d65cb77e96a1a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: vsx encoding \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":"library/stdarch/crates/core_arch/src/powerpc/altivec.rs"},"region":{"startLine":933}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9956a6026a50df8d4b5538385f3616b0f1d387c64b665459adb8ab08da3f549"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: vsx encoding \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":"library/stdarch/crates/core_arch/src/powerpc/altivec.rs"},"region":{"startLine":1072}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8787c856cb56078ed4a55683a707c991b2d5b4fe220567d224ce110c76729be"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: vsx encoding \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":"library/stdarch/crates/core_arch/src/powerpc/altivec.rs"},"region":{"startLine":1215}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8a9c664fd70d1808c12f3d862c0c28848c494ee98e145987e1ab8ad557726cc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: vsx encoding \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":"library/stdarch/crates/core_arch/src/powerpc/altivec.rs"},"region":{"startLine":1312}}}],"partialFingerprints":{"codehealthFindingId/v1":"93d0da880e251b81cf95368335bdc5f29899d0e9dcd49d7b0c2102eb6edd401e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: collapse the two once generic_const_exprs are usable. \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":"library/stdarch/crates/core_arch/src/powerpc/altivec.rs"},"region":{"startLine":3083}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bbe44ace85deb3256227c9ca2f0476e60fc51805ae75c9ddcbf1286db18d04f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(ppcf128) improve the docs. \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":"library/stdarch/crates/core_arch/src/powerpc/mod.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"9107e83a5f0acd05a9d0e2de6cb5717bbb2f4e70a68cedbd2e077c9b7098fad3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(denzp): assign \u0060malloc\u0060 and \u0060nothrow\u0060 attributes. \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":"library/stdarch/crates/core_arch/src/nvptx/mod.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c740da79c2075a7720d730c7e95876ba6f04ee9436a6fd20b0dc498957d6df5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(denzp): assign \u0060nothrow\u0060 attribute. \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":"library/stdarch/crates/core_arch/src/nvptx/mod.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"a694bb8ec54493d6db47a4bd2d408407690ae5595a0d65b8cc436f9ba2756d41"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: 16-bit floats \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":"library/stdarch/crates/core_arch/src/mips/msa.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc961fce0bd90f2c3c0afcc8ed7702ed3dcbb56db2636651fe36c3fdc21eff72"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: 16-bit floats \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":"library/stdarch/crates/core_arch/src/mips/msa.rs"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"cab2b7861c083876e4891a3362206e43832edbb91c585e078551cb1465d4f9f8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: 16-bit floats \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":"library/stdarch/crates/core_arch/src/mips/msa.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a6633b4ccbe7b8611da68b98744b5c3786572a8a6511e793a2b7a73d842cbc5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: 16-bit floats \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":"library/stdarch/crates/core_arch/src/mips/msa.rs"},"region":{"startLine":12995}}}],"partialFingerprints":{"codehealthFindingId/v1":"ece7a05d881e38287363ed391804df52b0252862c4e5ec2ee6dd28b562c88068"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: 16-bit floats \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":"library/stdarch/crates/core_arch/src/mips/msa.rs"},"region":{"startLine":13055}}}],"partialFingerprints":{"codehealthFindingId/v1":"efe4c69168bf456ad88533ff33ddb6ecf8f9161b83d743be2e68044d41aff3a0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: 16-bit floats \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":"library/stdarch/crates/core_arch/src/mips/msa.rs"},"region":{"startLine":13076}}}],"partialFingerprints":{"codehealthFindingId/v1":"4342f0555106a00731e7e822653b32b63160a8a249ddbb3248059ffcda49f5d1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: https://reviews.llvm.org/D59884"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/mips/msa.rs"},"region":{"startLine":11370}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1efa78c91fc206b898f43d9cea6d975ff1067fedbf8bcaeb97deeb476ecd7ab"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: https://reviews.llvm.org/D59884"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/mips/msa.rs"},"region":{"startLine":11580}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a54aa66505725a7b729ae42106eff9ee5349af85205f3ee11912c95f10e8ced"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: https://reviews.llvm.org/D59884"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/mips/msa.rs"},"region":{"startLine":11839}}}],"partialFingerprints":{"codehealthFindingId/v1":"b032395d362e72c1fe99d26eea2fe266dfd4cc0bc43aaf0e54ebfaa676226def"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: https://reviews.llvm.org/D59884"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/mips/msa.rs"},"region":{"startLine":14839}}}],"partialFingerprints":{"codehealthFindingId/v1":"93498d21b5a67c08988f83fece365860dafbe124ec86bd67f5574afca6098c33"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: https://reviews.llvm.org/D59884"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/mips/msa.rs"},"region":{"startLine":15320}}}],"partialFingerprints":{"codehealthFindingId/v1":"785443707daa54264f530f359a142f9e54dac2e3e2545580a28a71f1dc711894"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: https://reviews.llvm.org/D59884"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/mips/msa.rs"},"region":{"startLine":15573}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3e8dfda34802f41344b690208f699021eb36063a5343db4d6852f6071c64cfd"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: simd_test (which uses is_arm_feature_detected) does not support the v8 \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":"library/stdarch/crates/core_arch/src/arm_shared/neon/mod.rs"},"region":{"startLine":5330}}}],"partialFingerprints":{"codehealthFindingId/v1":"6105256fdf69e5adb131fddd3b8b429d8edc44c0efcebefce6e67943ea837998"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: As of 2026 MSVC  \u0060dumpbin\u0060 doesn\u0027t support MTE. \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":"library/stdarch/crates/core_arch/src/aarch64/mte.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"7817d0f42d2313ffe133a7223593ea128275ebd2d4226ec7e90b46b1eeaaf63c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Replace this with the standard ACLE __pld/__pldx/__pli/__plix intrinsics \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":"library/stdarch/crates/core_arch/src/aarch64/prefetch.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"224f1cdf2f5c224e1e996c42b25b0a00bcbe77a7856041d6cab00de5d4233745"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: replace neon with asimd \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":"library/stdarch/crates/core_arch/src/aarch64/neon/mod.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"386f73566b65c7f1443538831a2b2b37d559c9ee1028550978b1c957c96ba602"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: check this! \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":"library/stdarch/crates/core_arch/src/aarch64/neon/mod.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"765435eb86c2bef3ffe64e8541d1930783d3ff5cea8d326952ec8a2c24f474e9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(powerpc_target_feature): this code assumes the ISA hwcaps imply vsx/altivec, 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":"library/std_detect/src/detect/os/linux/powerpc.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"c92919182dc00567bfe1b578b552ec8ed12276c2e425a7a989a120c4767411a1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#152648): There previously was a timing assertion here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/tests/sync/oneshot.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4fdff4e0e381b6f4f24310111afe03d399a9a515f8621f306e7e2c6677a314c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#152145): Under load, there\u0027s no guarantee that thread \u0060t\u0060 has"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/tests/sync/oneshot.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"47090364d7adf2eb264f6972a0abee9cde0e8659c89ea8673891ddf72e0c66c7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#152878): An upper-bound assertion on the elapsed time was removed,"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/tests/sync/oneshot.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc70296b67ddd8a1437cf8b4fc0c3b89c7400913a3fc3520c2e68c1f78a192b5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#152878): An upper-bound assertion on the elapsed time was removed,"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/tests/sync/oneshot.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e24cd06bba2fa6f304e72f7389c181364a650d2357652bee861ea930da8b3ae"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: On macOS we use a provenance-incorrect implementation and 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":"library/std/tests/sync/rwlock.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"99eebbc35816cf91025e5db539f9ce07cb3b0a95f073f30a054687d8e76d0fa6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: On macOS we use a provenance-incorrect implementation and Miri catches that issue. \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":"library/std/tests/sync/rwlock.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe45adbe713917f321f688cc89d3f718cab79e559c1c0a11ccf3384acb0ee8da"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: On macOS we use a provenance-incorrect implementation and Miri catches that issue. \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":"library/std/tests/sync/rwlock.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9734bbd31a84cd1bed4b4577966f92386b154a6b4d0f72ec75629be3494bd29"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: improve formatting: https://github.com/rust-lang/rust/issues/65280"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/backtrace.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"242c0b31159cde8154b03db48528a08328bb5389ae93c04f8cbe92a939ae52b9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Also, include column numbers into the debug format as Display already has them. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/backtrace.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"17dd126f61b0696b2fd32a95e6ba36336ea28f3eb05871924c6c3730fea96188"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: before stabilization, ensure that we have a race-free implementation 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":"library/std/src/fs.rs"},"region":{"startLine":2805}}}],"partialFingerprints":{"codehealthFindingId/v1":"33c681b21247c317d3ef79d84b86d7cd61800d133b50a7f8923f5490a0ce5f51"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: #94122 this extern crate definition only exist here to stop"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/lib.rs"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"af007d004594a2aba1fcd60cba06c44571904c087661a940bc7a15bea2bf40a4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(normalize_lexically): mention normalize_lexically once stable \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":"library/std/src/path.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd0b3123dddb4e8e61fc7aa5d21140d24e6a60dee3bddab78f012c3ee40e0a7e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(fuzzypixelz): returning an error instead of panicking 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":"library/std/src/thread/lifecycle.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"34167cfab513689586e0edcb126eb60e7b221b028d61218d1139ae0cc27568c0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(https://github.com/rust-lang/miri/issues/5594): Miri ignores the requested stack size."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/thread/tests.rs"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecb6a26e38a12d7af1c1997971d32440f3561083e290966e283a27c830998233"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(117276): remove this, move feature implementations into individual \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":"library/std/src/sys/mod.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3a7a312d1f54c84214929122b1df874a815a5c1f9b7b9f21ab50684c0c38826"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Right now there is no concept of \u0022thread exit\u0022 on \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":"library/std/src/sys/thread_local/mod.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"df42547fef472dd3594400cbbf17088a5ec3aa0ca309b2b85afc87d9e62a8bb3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#110897): maybe abort on recursive initialization."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/thread_local/no_threads.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"988493f051b0c9f1713def628dba461e017f2044765fd55c9991b3e621d5c857"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this is clearly a hack, and should be cleaned up. \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":"library/std/src/sys/thread_local/key/racy.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"12a60a1a7c18af0efbc87ae99956a1746ab13c50fa1ac5511fc8fb78327212bf"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: investigate using a fixed-size array instead, as the maximum number \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":"library/std/src/sys/thread_local/key/windows.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"505f83d6bf6b1487caee1d5ef00548b40ac2cb54fe04b40cf012e5bfb5ceb5c6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(joboet): implement support for native TLS 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":"library/std/src/sys/thread_local/key/xous.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"7140b8105d943a79ac1d97dbe541204b0184c9d9d49fac16ce362493d4937239"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(pin-ergonomics): remove the next line. \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":"library/std/src/sys/thread/unix.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"41d5452e352633905d4654d43b12a27c13486ba5f67d370e123b7c8bd863e690"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(pin-ergonomics): remove the next line. \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":"library/std/src/sys/process/unix/unix.rs"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"570d16e6ce3f47d142497f124415b68807348349276de0161307bc4be2d81d9d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(pin-ergonomics): remove the next line. \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":"library/std/src/sys/pal/unix/sync/condvar.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"28c2a25cc13461d906953f4c7aeb0f2f0b2e2cfc0c1a8c68333a6bf4509800f7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(pin-ergonomics): remove the next line. \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":"library/std/src/sys/pal/unix/sync/mutex.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"858b7b26cd889aa6014874650901b94c952ee02b6284194fda6d1df158907f8d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(pin-ergonomics): remove the next line. \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":"library/std/src/sys/pal/unix/stack_overflow/handler_signal.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f981dbdaf1e787be58e99385a094023ef1ecd5d08d58b5c01e0b4092ea73964"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(pin-ergonomics): remove the next line. \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":"library/std/src/sys/pal/unix/stack_overflow/handler_signal.rs"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"de0e37698345be062c4f5ffc5d4dcb7d62f77cd243457a05db9696cdbdcd43e4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: implement on l4re \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":"library/std/src/sys/thread/unix.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"141d44f26fbcd1e2a33f00a92494ba12041a10309d675ee1eee3ecf1a40400c1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: move to 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":"library/std/src/sys/thread/unix.rs"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"124518076d69d78c196d44005dddeabf99dbf0e4a1a22cb434401835488f8601"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: \u0060UnsafeList\u0060 is not movable. \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":"library/std/src/sys/sync/mutex/sgx.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ad5e01e8c0601e6c1d65bcb49718d1e698cb81ce1cc029f89da6233541a2ef9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: \u0060UnsafeList\u0060 is not movable. \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":"library/std/src/sys/sync/condvar/sgx.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"72264919e535f3edc9186b7b5eb8aae845813ffcc08d6b54d3cdc36c58fceab9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Rust normally maps Unix EBADF to \u0060Uncategorized\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":"library/std/src/sys/stdio/sgx.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0203b7d1b5d0de56406d413d3cb7bbf4f79fabc493f593ab961f45e1e35ced6"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: VEXos holds an internal ringbuffer for serial writes that is flushed to USB1 \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/stdio/vexos.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac4b61918f8f656e7d992254e2e08f9335e6af426a60f148892b177d9027f8fe"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: move this to 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":"library/std/src/sys/random/arc4random.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"1171627fcc7f2128c0e074ee26a6d05a34df7666ea5ff28bb245e87ea2aad4f3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(in 2040 or so): once the minimum kernel version is 5.6, remove 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":"library/std/src/sys/random/linux.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6b28798f2328a77b50c9432bcaebcb34a39d01611627f1ef4ee2e0d5462e6de"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(horizon): add arc4random_buf to shim-3ds \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":"library/std/src/sys/random/mod.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a9076bb568da98c919a169e90c7119b314f1116b8880cf4b0be28291ef28c44"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: finally remove std support for wasm32-unknown-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":"library/std/src/sys/random/mod.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c01c0001030a23e3994bab3874f9e2309c70f12ab97b1585498e96653aa04ac"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: add random data generation to xous \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":"library/std/src/sys/random/mod.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5fd06727f88888e556eaea9149fbdbcf20dcc5b238f9992c0a5de876f95e923"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(joboet): No, we don\u0027t guarantee that? E.g. \u0060\u0026Stdout\u0060 is both \u0060Read\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":"library/std/src/sys/process/windows/child_pipe.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"90bdb543519fd27bd3f6ae8405fccff7e9bbcba455bccb0334926baf32aa35a4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This is tough because we don\u0027t support the exec syscalls \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":"library/std/src/sys/process/unix/fuchsia.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"1460de6886a0e402dc9308587493cd3c19531d584a63711829d215022c098afe"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: See if we want to do something with that err_msg \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":"library/std/src/sys/process/unix/fuchsia.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd4394d41ee2b1456afbc715453251db813bc3912d44b3cbf950e0b1bd15481f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: support extracting return code as an i64 \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":"library/std/src/sys/process/unix/fuchsia.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"01c6af8fcadcc22fd9bf229103178060b0d385ca8058d6621262738f02e63374"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: The actually-Unix implementation in unix.rs uses WSTOPSIG, WCOREDUMP et al. \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":"library/std/src/sys/process/unix/fuchsia.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"43039d90c45d384da7b516a635dc458f494a8b02bca412b2cbe555a744b4385a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // fixme: affected by the same bug as ExitStatus::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":"library/std/src/sys/process/unix/fuchsia.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"2109571ec9401e9435af63488b022b7d1e7527ba27b501a24280035251380bf4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //FIXME: Redox kernel does not support setgroups yet \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":"library/std/src/sys/process/unix/unix.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0866b353a269f78d55cde9aa92759464ec2bd0801f95e035b94b97b9e750a44"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //FIXME: Redox kernel does not support setgroups yet \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":"library/std/src/sys/process/unix/unix.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"04ece4d5b2da08049e6303c891cd9ee9f5db89c35f646840081e6c88161dab62"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME impl From\u003CExitCode\u003E for ExitStatus and then test that here too; \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":"library/std/src/sys/process/unix/common/tests.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e2bfe16f749dcb100c2498046ad95e8e6522006aaec84d6450f959de0d812bb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(madsmtm): \u0060rustc\u0060 doesn\u0027t support zippered binaries yet, see rust-lang/rust#131216."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/platform_version/darwin/public_extern.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c5525aa6486c9592f4557022413b3f190ff4bce2c1ceb969989c10506ed6af3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(strict provenance) \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":"library/std/src/sys/personality/dwarf/eh.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"5160ed82372904e34077c08f41ba38cbeecf48cff95509cfef1a64b807a14965"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Should we move this to the \u0022libc\u0022 crate?  It seems like other \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":"library/std/src/sys/pal/zkvm/abi.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7a99a8635b25f075889c0e0bb98a8001f3ae0b5e3db3c444a6af482b8f40efa"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Use a null-terminated wide string type to assert validity, similar to CStr. \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":"library/std/src/sys/pal/windows/api.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fbfddeaf47fcc2a0a04968e77d34baeae20819538c0dbcc7304f615579e37c7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: use \u0060transmute\u0060 once it stops complaining about generics. \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":"library/std/src/sys/pal/unix/weak/dlsym.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ca0fc28ca498ada81aaa0165b4eaf4b1daab7441f667d7c2594d073e023eec8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: use \u0060transmute\u0060 once it stops complaining about generics. \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":"library/std/src/sys/pal/unix/weak/dlsym.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"17318e2be05d43fbbcbb738aa334dc1c182181db586b9cb70722aee962b4d951"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: detect if the stack has changed, and only uninstall if it hasn\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":"library/std/src/sys/pal/unix/stack_overflow/handler_signal.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c138213c359f7bc0ec247003205d892cc6d5df42bdd6d9bbcc69fabf2eb8869"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Consider using unsafe trait for matching protocol with guid \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":"library/std/src/sys/pal/uefi/helpers.rs"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"593ab4cb2689f96f8c358534a389f2997dc72ad3052038bf8a37a1c44840ce2d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Move into r-efi once extended_varargs_abi_support is stabilized \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":"library/std/src/sys/pal/uefi/helpers.rs"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"77be5dbb02f0d8f7c1432b89533d301d3019a9a06be91741244f321951693bdc"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Move into r-efi once extended_varargs_abi_support is stabilized \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":"library/std/src/sys/pal/uefi/helpers.rs"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"4457e8d349e26e408e89ff3f8ee76e1bc1af52f8cf5141cdea21440161019526"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this entire module systematically confuses pointers and 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":"library/std/src/sys/pal/sgx/mod.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc64b76bcc2f53652899700d439c49fdaae08032641058d23e510e876aeeebb9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Perhaps use Intel TSX to avoid locking? \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":"library/std/src/sys/pal/sgx/waitqueue/spin_mutex.rs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0f1d3c90a9524839866f7e04e5a2c408dfe68b9f2251425ef0f4c314df01a42"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this item should only exist if this is linked into an executable \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":"library/std/src/sys/pal/sgx/abi/mod.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"f05ef9f808a7554c8ae644f645c6a712d463e75a0515015ac1f640ed96ed66cc"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: how to support TLS in library mode? \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":"library/std/src/sys/pal/sgx/abi/mod.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5a520e942cecde8219511bdf3ac1cad6d6d29cf53c00fa39457bbe021a2f6a8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: should be implied by [T]: UserSafe? \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":"library/std/src/sys/pal/sgx/abi/usercalls/alloc.rs"},"region":{"startLine":689}}}],"partialFingerprints":{"codehealthFindingId/v1":"f18b82a47c3b15705d7e1cc44d9e73877f0060cc82e435c8a1e88711c9da587b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: should be implied by [T]: UserSafe? \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":"library/std/src/sys/pal/sgx/abi/usercalls/alloc.rs"},"region":{"startLine":697}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b0b5976600722b25466424084f981f7d0f31a3e8a4f1dc1dbd236e60d202b3a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: can this be done \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":"library/std/src/sys/pal/sgx/abi/usercalls/mod.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ff05513f255cf9521f4c29ba5e0fe49be3a1bd59325df003d6667f6be495eaa"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: can this be done \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":"library/std/src/sys/pal/sgx/abi/usercalls/mod.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f2d009601ef49f2f63f150141c5040c5300e202aa8cdb11cace100afa36fd38"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: not sure how to make sure all variants of Error are covered \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":"library/std/src/sys/pal/sgx/abi/usercalls/mod.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"e96d1eed6041f1002b174f811d7ca95e1145a2000fcf7a0699a5348ceebb4ac6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: not sure how to make sure all variants of Error are covered \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":"library/std/src/sys/io/error/sgx.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d2317f9268fb6462bd58df0b920ace5f1cd1ac0e93ae5c0f475bcd1a106c819"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Needs safety information. See entry.S for \u0060set_tls_ptr\u0060 definition. \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":"library/std/src/sys/pal/sgx/abi/tls/mod.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bc695217231d5f5a734a3b7bd2c841107c70e96fe8062f611942906ac49aba1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Needs safety information. See entry.S for \u0060set_tls_ptr\u0060 definition. \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":"library/std/src/sys/pal/sgx/abi/tls/mod.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad315be7da8e348ae80a2739e825c83ea2b257758fd9c597ca871f0966263549"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This is a terrible, terrible hack. Fixing this requires Fortanix 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":"library/std/src/sys/net/connection/sgx.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9eedb294d7e5cea1cf102b6c59b7f115e6dcbfc0bcc138780cb7c4ebb5eb314"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: ignoring timeout \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":"library/std/src/sys/net/connection/sgx.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f1985d6b13b14585569e4444693254bd83bcd4d74427d72a37099893562b9b1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(implement this) \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":"library/std/src/sys/net/connection/uefi/mod.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"65be705316689bb7942283aafde5106ec2d65f962c7e49ac4a7a876a306d322c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(implement this) \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":"library/std/src/sys/net/connection/uefi/mod.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e550d702536438474a37a6d64ef4b6572cd8bcb42edb8dab8bf7bc8f7c8de05"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Replace this with platform-specific path conversion functions. \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":"library/std/src/sys/fs/mod.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f642753a0e33488f0e28a04971c6d6d568c04e81bc89d7b1ef4b0f8b5c83234"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: use with_native_path on all platforms \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":"library/std/src/sys/fs/mod.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9788df0346b18b86fc1eeda327ebaa189cf46cecb088c0ce7aa7c07f82f115a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: use with_native_path on all platforms \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":"library/std/src/sys/fs/mod.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"180db6f73327d34db22368973fb2b5066919cbf3297e8b7f7ad7dbff96298225"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: use with_native_path on all platforms \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":"library/std/src/sys/fs/mod.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"a50d97cf82133ec61e51cefc523033edc2c2895060785a571f901fd2345e4bf9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: use with_native_path on all platforms \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":"library/std/src/sys/fs/mod.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c42146343110ad9e2129f942b7f765466d0f7a8cd8555c642879669ec5ba379"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: use with_native_path on all platforms \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":"library/std/src/sys/fs/mod.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ada884cf3fac3404ccfc9ea32cacecedd5ab25563c39e8eab4d0737afc792df"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This should be available on Linux with all \u0060target_env\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":"library/std/src/sys/fs/unix.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3c9db1e99a4bb4453bf4207b69228ca676efd69eb7a0d5a7b40401f03efc7e6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME what about transient conditions like \u0060ENOMEM\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":"library/std/src/sys/fs/unix.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ebd256a3087746166d45a4905ce76ab87370dbfdfc8d5fef7770caafa09ee7f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: The use of PATH_MAX is generally not encouraged, but 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":"library/std/src/sys/fs/unix.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"b61716b17999c14c41c9b8add1eba40e039aa71399e564d81995c5c13374708d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#24570): implement this for other Unix platforms"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/fs/unix.rs"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d911fa67f19129c8055946679316f1a5bed60aeff2b345d20278210f686acd4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: use race-free handle-based approach 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":"library/std/src/sys/fs/windows.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc6e1838bf57bf38b3e068fc4d9aee2c2b0671e6b8dee574c063b88470f9b1a3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // unchanged. FIXME: find docs that say this. \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":"library/std/src/sys/fs/windows.rs"},"region":{"startLine":908}}}],"partialFingerprints":{"codehealthFindingId/v1":"762431e9f6ac054b27f4101f771a19c828b591512459016be18a727f995c17af"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#24570): add more info here (e.g., mode)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/fs/windows.rs"},"region":{"startLine":1067}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbc2098a53126f96c7ad36d998fd2a32b70eda1ff96b78734abbd06aec6a2bb5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We can probably get rid of the extra copy here if we \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":"library/std/src/sys/env/zkvm.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"a55d5b52e1f31635c3611778c13ab8b661d075fdbb4d3a94b3c9c1faeb757d52"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This needs tests to ensure that the arguments are properly \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":"library/std/src/sys/args/windows.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d3d8cd1365510aa7a69c49b6ea579869a8f9aac17968111fc9948f8197e2a5c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We can also possibly add an optimization here to detect \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":"library/std/src/sys/alloc/wasm.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"572b995ede66cebf4898f38f992d4f6420e8649028c245d9498ca6bb8d7eadf3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(nonpoison_once): if possible, switch to nonpoison version once it is available \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":"library/std/src/sync/lazy_lock.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"758253a8cd3bf60785e46191fe3dcefc789dbb8270e4983fa8db6642657dbb0b"}},{"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":"library/std/src/sync/mod.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"c45c5e1bdf0eb3b3becdc81d69cabd957c9cefd71d19d39804961b889b718c05"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(sync_poison_mod): remove all \u0060#[doc(inline)]\u0060 once the modules are stabilized. \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":"library/std/src/sync/mod.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"68418c8e6aeed6faa595fb9f0962ef6a3e36a580fba62676eeeb0027a4ad61ad"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: ///         // FIXME: this impl is concise, but is also slow for long lists or many threads. \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":"library/std/src/sync/once_lock.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb1a8ea777771c9e6f1f7bb5b414c863a9c3afb7debf5cb8b056e1e168bf86aa"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(nonpoison_once): switch to nonpoison version once it is available \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":"library/std/src/sync/once_lock.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"5094d77861f7fe94dfebf862631c87c4621545e29513b78856075ddcd60e95eb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME maybe make it a public part of the 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":"library/std/src/sync/reentrant_lock.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d8a61c61b692f881579c9c98f6d2ebc48c38f8f9d89eca1bf50076b973a8674"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: On certain platforms compilation errors (due to empty \u0060libc\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":"library/std/src/os/mod.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9819d8fa819803411ded836a83563267e0cd1912a77d134e21c4a5e74307796"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This currently has an intentional no-op implementation. \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":"library/std/src/os/windows/process.rs"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"494e1aaead20928cafadfb2b79a90c3db3170ea05110a0ed82112f16590f1ff4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(strict_provenance_magic): we defined RawSocket to be a u64 ;-; \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":"library/std/src/os/windows/io/socket.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae7f06e96b08c168f0f5925b84ec489ce21a932d684be9184aa03fefd5220c82"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: bind fd_fdstat_get - need to define a custom return type \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":"library/std/src/os/wasi/fs.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f571b51674466d099f3957b0384fe6c151ab252c016191e71dcbe8f7389f50a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: bind fd_readdir - can\u0027t return \u0060ReadDir\u0060 since we only have entry name \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":"library/std/src/os/wasi/fs.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"7673600818e07ca4b9d11f13b90ee8702b6e84543b2cd30ec0dc6b2acfe8a358"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: bind fd_filestat_set_times maybe? - on crates.io for unix \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":"library/std/src/os/wasi/fs.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f391e2bf7d3bf0e5f06b602e09e18408ea233fb391e9f137ba6b934aa73b3b3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: bind path_filestat_set_times maybe? - on crates.io for unix \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":"library/std/src/os/wasi/fs.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"54f85a48376dc2413d69c17c52f2963bac287a1616ca1a0793b8d0376dcea5d8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: bind poll_oneoff maybe? - probably should wait for I/O to settle \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":"library/std/src/os/wasi/fs.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6b2368bc5a613df2e9440dccb05e467495b48f69776fab6e85358bc83891f80"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: bind random_get maybe? - on crates.io for unix \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":"library/std/src/os/wasi/fs.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"99c473c922ba3585ebbc781ed75d9bcd151f03cbcce4b7b1139d4585e0f98282"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#43348): Make libc adapt #[doc(cfg(...))] so we don\u0027t need these fake definitions here?"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/os/unix/net/addr.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba4c1dc645665205215d5e0d4a9a127173d3e930da52e1309d4230e186910581"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#43348): Make libc adapt #[doc(cfg(...))] so we don\u0027t need these fake definitions here?"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/os/unix/net/ancillary.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"308cdc109e9a92251ab84b02927957c687aa00ba28e91eca7043ea5d5af8dfc0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This is currently disabled on *BSD. \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":"library/std/src/os/unix/net/ancillary.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bd3183d0dbf6ff597d69cd45eb816d6be183ac14bd30ecb61db94a3cda20621"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: say something about \u0060metadata\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":"library/std/src/os/fortanix_sgx/io.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5da2d8eb1790aac62ae3c6da0183cddc307eea835461036142f2a4e9c978fb8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: re-enabled openbsd/netbsd tests once their socket timeout 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":"library/std/src/net/udp/tests.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"919a63b64f91d2a6f484738c63abf9378397c7fce66808dc4013caa3ba594ecb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: https://github.com/fortanix/rust-sgx/issues/31"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/net/tcp/tests.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"08aff18e9fa9d06fc558e10552bb24f737500f088a727453bfa9aab9fd1fda39"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: https://github.com/fortanix/rust-sgx/issues/31"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/net/tcp/tests.rs"},"region":{"startLine":748}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc2554b146ed280599b904c6080d4b9f6818d390c01d13592f055c6e0b5e6b63"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: https://github.com/fortanix/rust-sgx/issues/31"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/net/tcp/tests.rs"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7fd7412aad79e5e2e2662948cd406cd5b4ea82ca107b90cb9183e603aa212c7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: https://github.com/fortanix/rust-sgx/issues/31"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/net/tcp/tests.rs"},"region":{"startLine":797}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffa33e1874578e589f449ccdbb5cf0400637ef0c90a1793e56a299b4224505d0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: https://github.com/fortanix/rust-sgx/issues/31"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/net/tcp/tests.rs"},"region":{"startLine":940}}}],"partialFingerprints":{"codehealthFindingId/v1":"34ec2e3cb913d45a60b7f78c6d113fd9ff59a4b82e3211b01ce1060cdf4c3202"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: https://github.com/fortanix/rust-sgx/issues/31"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/net/tcp/tests.rs"},"region":{"startLine":974}}}],"partialFingerprints":{"codehealthFindingId/v1":"cded76860144bcfbd3a15fa4bcde90ea26731bddd2920011b0b76d94ff78e5bd"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: https://github.com/fortanix/rust-sgx/issues/110"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/net/tcp/tests.rs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e1667d442c461b169f580cde587b63bf8ddc3f5c8048b359d813ae44dbae506"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: https://github.com/fortanix/rust-sgx/issues/110"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/net/tcp/tests.rs"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"13f9914b4370ca5aa2f1aa5d70b5089564f53d4a0c5b9373aafe355f783beafd"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: https://github.com/fortanix/rust-sgx/issues/110"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/net/tcp/tests.rs"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"d51d3216b69b5edb4a9eed136e15fcca219d8784ee9c47509f0a7409c08d7644"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: re-enabled openbsd tests once their socket timeout 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":"library/std/src/net/tcp/tests.rs"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"604d9568237573dae6b40cbf77517374d6ec377cbc6aafd685ab24df9fae2645"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this should be LineWriter or BufWriter depending on the state of \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":"library/std/src/io/stdio.rs"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c5f98092e5e8101a94b17cf99992c5777d0de6bf90b32e75af3749879148e04"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: \u0060/\u0060 does not work as path separator 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":"library/std/src/fs/tests.rs"},"region":{"startLine":3421}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc6d80b2028ce36714ce61c3f8d723fcfb9a5b240e55bb38eac8b18e81bd97c3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME (#19470): cannot provide PartialOrd\u003COsStr\u003E for str until we"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/ffi/os_str.rs"},"region":{"startLine":1615}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d83c99bdbfc2330f54c60cf3444ea0106c18158ee145ab6e55cca5d98623c64"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#82080) The deprecation here is only theoretical, and does not actually produce a warning."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/collections/mod.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b67776d3ef999d8d43611cde86ebef0de161e2b12394942b8b1ef1bc637b623"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#26925) Remove in favor of \u0060#[derive(Clone)]\u0060"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/collections/hash/map.rs"},"region":{"startLine":1579}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f0e08fd293994452b7ea7abbe41738844d1f2de00f138bb2aab7ad024690364"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#26925) Remove in favor of \u0060#[derive(Clone)]\u0060"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/collections/hash/map.rs"},"region":{"startLine":1707}}}],"partialFingerprints":{"codehealthFindingId/v1":"8daf61dcf87360001fce8e8fc184410835c126f1c68c32c979ba82d6fe92281c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#26925) Remove in favor of \u0060#[derive(Clone)]\u0060"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/collections/hash/map.rs"},"region":{"startLine":1754}}}],"partialFingerprints":{"codehealthFindingId/v1":"3251fc63e8da8b786b4807a7a958591470a97fbc3c501dbb8bbc6d3daf9787f9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#26925) Remove in favor of \u0060#[derive(Clone)]\u0060"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/str/iter.rs"},"region":{"startLine":1444}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2e9b898cfde4b2beafda79e7f4ddd699e81bc3616fa82b3b536e669848bba60"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#26925) Remove in favor of \u0060#[derive(Clone)]\u0060"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/slice/iter.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"8416cb15ef3a20095c46788fbc867849c14fb9b6fd43ccaefcdb29be7013b93e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#26925) Remove in favor of \u0060#[derive(Clone)]\u0060"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/slice/iter.rs"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b2ae8135b6ca788b0f18a707aa1c974f961d21c4681e4f6e37652f46e6b62fe"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#26925) Remove in favor of \u0060#[derive(Clone)]\u0060"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/slice/iter.rs"},"region":{"startLine":959}}}],"partialFingerprints":{"codehealthFindingId/v1":"7022ba4e38db0aaa617c1580b48f8719500130e88dc45b35074a2211e7d36496"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#26925) Remove in favor of \u0060#[derive(Clone)]\u0060"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/slice/iter.rs"},"region":{"startLine":1341}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b1354b4e367a105755fe755942ca3b878263941b66d6cfb2fc34a2121d80eb0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#26925) Remove in favor of \u0060#[derive(Clone)]\u0060"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/slice/iter.rs"},"region":{"startLine":1490}}}],"partialFingerprints":{"codehealthFindingId/v1":"22ee70cab0bf0de61ba61d6123bf942b00699aa29bbbca8e5fad5b2872e6a1c4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#26925) Remove in favor of \u0060#[derive(Clone)]\u0060"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/slice/iter.rs"},"region":{"startLine":1881}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f480e4b5e6298b466038dcbfe6c63cd2590e30ce0efa177a5e01cd03f5330f9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#26925) Remove in favor of \u0060#[derive(Clone)]\u0060"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/slice/iter.rs"},"region":{"startLine":2190}}}],"partialFingerprints":{"codehealthFindingId/v1":"d571cbaf371f7a3d2a8eabdab556186eab652bf5f33b6224c3f592d420a39f59"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#26925) Remove in favor of \u0060#[derive(Clone)]\u0060"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/slice/iter.rs"},"region":{"startLine":2321}}}],"partialFingerprints":{"codehealthFindingId/v1":"989fb9fe1add56bd6a07d9d4caa4ce97b378c1c3d869194d4151053518d31b95"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#26925) Remove in favor of \u0060#[derive(Clone)]\u0060"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/slice/iter.rs"},"region":{"startLine":2691}}}],"partialFingerprints":{"codehealthFindingId/v1":"016a57701024a5e124bd7116455085d6701fc450f61bafbb60c6c900fdc2deef"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#26925) Remove in favor of \u0060#[derive(Clone)]\u0060"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/alloc/src/collections/linked_list.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"b896a20a676189b947642956c453bd0f6111986670d2731f377fbe2764b9d438"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#26925) Remove in favor of \u0060#[derive(Clone)]\u0060"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/alloc/src/collections/vec_deque/iter.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"5134e683061717c9a8c5234c6d174f08ca637233a6bdc2b10301068f38200594"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#26925) Remove in favor of \u0060#[derive(Clone)]\u0060"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/alloc/src/collections/binary_heap/mod.rs"},"region":{"startLine":1644}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2875a6e5d72ebb0442beb4565f2adc9dea2c1bfc18a2556cfbe9626167a6714"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(SergioBenitez): check that the byte range starts and ends at 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":"library/proc_macro/src/lib.rs"},"region":{"startLine":1590}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ee4990d86ae8b3eeaca45800df31c4925adfecc5c83034c5d8dc20664968b78"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(SergioBenitez): there is no way for the user to know what \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":"library/proc_macro/src/lib.rs"},"region":{"startLine":1593}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f4c10607bd2427e4f086629d1cdcd74e12785cf57e57f285acf829a497e72d8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: \u0060f128\u0060 doesn\u0027t implement \u0060FromStr\u0060 for the moment so we cannot obtain it from \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":"library/proc_macro/src/lib.rs"},"region":{"startLine":1796}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8140229ebcf29df2a8016f19e0bac9f54dc8f4d20c325c2668f469baed6e6de"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(eddyb) describe the \u0060F\u0060 type (e.g. via \u0060type_name::\u003CF\u003E\u0060) once panic \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":"library/proc_macro/src/bridge/selfless_reify.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"d012e4556ec2e05aa7914619b252d03e2b55730b5f79061454866f2659d07416"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(eddyb) \u0060pub\u0060 only for \u0060ExecutionStrategy\u0060 below. \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":"library/proc_macro/src/bridge/server.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"192f5d3c67182d6640e4dc84a042d0133a24d6b688281d111f0dcb280d4e556c"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK(eddyb) don\u0027t use \u0060panic::catch_unwind\u0060 in a panic. \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/proc_macro/src/bridge/server.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"efef8ba05b920b0625675c974f726cbd3619d9c148d831afb119fbc3ec9b59fc"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: some f16 operations cause rustc to hang on wasm simd \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":"library/portable-simd/crates/core_simd/tests/f16_ops.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"999ace4f0ded5e0cfe59c4d68c3e9103a592fad3e975a409b8497cec17579c8d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO modify simd_bitmask to zero-extend output, making this unnecessary \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":"library/portable-simd/crates/core_simd/src/masks.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"45ccc6453c862fdea5e70e81073d7f865477ef3b56c208ba98dfaa20be357ec8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Consider implementing this in cg_llvm 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":"library/portable-simd/crates/core_simd/src/ops.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b84ba64ae43b7a1d2528321604d833cc1b77415c3d13d9afb65082eff45b6de"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: only useful for int Div::div, but we hope that this \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":"library/portable-simd/crates/core_simd/src/ops.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"24a6a0a2f98772bfffd7cd73baf431fab291144c09f7b725b85404ed2112d26c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO modify simd_bitmask_select to truncate input, making this unnecessary \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":"library/portable-simd/crates/core_simd/src/select.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb4003d616ed66ba82613db3a61e1d697c97776df28bdb646aacf2e107182379"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: simplify once a plain \u0060concat\u0060 is available. \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":"library/portable-simd/crates/core_simd/src/swizzle_dyn.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d8aac20e788f5f63555603bc37edfc1e8d5a83dff66c075205fcfc1a6e57b22"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We currently use a pointer load instead of \u0060transmute_copy\u0060 because \u0060repr(simd)\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":"library/portable-simd/crates/core_simd/src/vector.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"7acb23b4fa987bf6285ad3603cd6cc725a7c72dcb749362c5aa9dfe770329e66"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We currently use a pointer store instead of \u0060transmute_copy\u0060 because \u0060repr(simd)\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":"library/portable-simd/crates/core_simd/src/vector.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2009c8ab879e57f9c2ac76d4ef030fce97c38fdfa460e54a39a4eef97b5eb48"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: add an intrinsic that doesn\u0027t use a passthru vector, and remove the T: Default bound \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":"library/portable-simd/crates/core_simd/src/vector.rs"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"49a98e11f915846262089b59a4dcae5402b9226176e016a9a98b9d092b29c23d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO use SIMD equality \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":"library/portable-simd/crates/core_simd/src/vector.rs"},"region":{"startLine":942}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef99fd6ac5ba636593e139604305c7634e92b48841e93565a8b6bf40f4cdf0c3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO use SIMD equality \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":"library/portable-simd/crates/core_simd/src/vector.rs"},"region":{"startLine":956}}}],"partialFingerprints":{"codehealthFindingId/v1":"239351e65f0f649ae96e0acb979898cef546eea90815db61e31baccaa79d0de2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(strict_provenance_magic): I am magic and should be a compiler intrinsic. \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":"library/portable-simd/crates/core_simd/src/simd/ptr/const_ptr.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa70da81e84afdc087d2de17c9bf4bbca194b8bfea28f6ff5fbdc470288bd6e3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(strict_provenance_magic): I am magic and should be a compiler intrinsic. \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":"library/portable-simd/crates/core_simd/src/simd/ptr/const_ptr.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ccffd1fe36289fa8516790ae5aca140693e3e0e51cbb098ae175a7947863b86"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(strict_provenance_magic): I am magic and should be a compiler intrinsic. \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":"library/portable-simd/crates/core_simd/src/simd/ptr/mut_ptr.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"a135e3dd6746bcc007c795e35ae436055a932d294415075aa1bb5a68591a1211"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(strict_provenance_magic): I am magic and should be a compiler intrinsic. \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":"library/portable-simd/crates/core_simd/src/simd/ptr/mut_ptr.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a43ed7bd34cec9ce8635968ad5aeb92bdbdfff41b672e9dbd8f17ceacd9d3c6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: ASCII diagrams \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":"library/portable-simd/crates/core_simd/examples/dot_product.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff5d32c08cc16cc099b8c233df6b88bdfbc74f2aeb9e6928d5f621683d5c6e1d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO handle remainder when a.len() % 4 != 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":"library/portable-simd/crates/core_simd/examples/dot_product.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"3029a4fb214ffa1faa8f90f56dc39d4b3c60b43d91a8a40d3fde68d5081ec701"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO handle remainder when a.len() % 4 != 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":"library/portable-simd/crates/core_simd/examples/dot_product.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"2798119501a2b91b2526d56afb95d837157bdf741f853bea0cd84888e26fb756"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO handle remainder when a.len() % 4 != 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":"library/portable-simd/crates/core_simd/examples/dot_product.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"72ebfd3de53bf3c57c07067be9c60708d03bb88033ad245a73e1750cf7cb1652"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#110395)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/coretests/tests/option.rs"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"20b4e5c73c3583e1b065bdc7f6ffd5504fe95ab659bd29ba74ea19ef9b244c2c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#110395)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/coretests/tests/time.rs"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bcaf8dd7fc39445931eac5b6c04b1aa15e520b96f135f862b7db61d883a3d47"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#110395)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/coretests/tests/time.rs"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"e641e1603ebccc9603e19bc1d57bf1f4c2dfca17910f4f2c6d4a3a58170bd949"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#110395)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/coretests/tests/hash/mod.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb535278d8f03b54a4a25518ba087527b6d661da501ec855a3fc0f4062b9762f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#110395)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/coretests/tests/hash/mod.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d9a85af1fd89dd2e939ac5b3f94de879a705d0309a1311a70de80e03fcca7da"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#110395)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/alloctests/tests/const_fns.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"4503e2857348b1d8605a0abadabfba624d4c8e84a20a23e99aad133ac2a8dc0b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(Manishearth) these tests focus on single-character searching  (CharSearcher) \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":"library/coretests/tests/pattern.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0dffd7d0018f51bf82e4405f65a518754ca7586a9b039ab27c50280f3c46867"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: can this line be shared with the same in \u0060value_ptr()\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":"library/coretests/tests/ptr.rs"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"00db7b8afc6eb60360c742286992d2f417989e9e9abd507f27595f9c26a904ce"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //FIXME: currently can\u0027t unwrap const 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":"library/coretests/tests/result.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"e15b9cd6f99f8321eccaee8d03251075f20b29936bad61e69cb602ca12b62073"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(f128): Tests are disabled while we don\u0027t have parsing / printing \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":"library/coretests/tests/num/float_ieee754_flt2dec_dec2flt.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"97f89028f510d3b8ef2e9b8545f7656274b254c449bfe5e74d3fd4a5ab5bb727"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // Hack to coerce left and right to the same type \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/coretests/tests/num/floats.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"106e5738942ce029104c3289f33000827040f23dbf597abb9ee1cf2fdcb4f0ff"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // Hack to coerce left and right to the same type \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_gcc/tests/run/core-float.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"149bfe25fb20583e03bcfb27e09a3e2b7714f53a88062137209cee36c16a2d1c"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // Hack to get the width from a value \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/coretests/tests/num/floats.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"625890745306edd9068bddb79e4d976e395b6c1df064bb15c08f6394850c25b8"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // Hack to get the width from a value \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_gcc/tests/run/core-float.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bbe29a80a3991d58845870711ba83589b99db89a3071b04778e6a84f1780e90"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(f128): merge into \u0060num\u0060 once the required \u0060fmodl\u0060/\u0060fmodf128\u0060 function is available on \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":"library/coretests/tests/num/floats.rs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"65b20d82537d44c6eea0c8a93e14e53f20177c40a9c4fb6cb53f7f19733c07eb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: there is a bug in the MinGW gamma implementation that causes this 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":"library/coretests/tests/num/floats.rs"},"region":{"startLine":1882}}}],"partialFingerprints":{"codehealthFindingId/v1":"e094ceb09fd38f4458dea055d13a1bcbeb6a57320611d413fa59a5c820d92b6b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#140515): mingw has an incorrect fma https://sourceforge.net/p/mingw-w64/bugs/848/"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/coretests/tests/num/floats.rs"},"region":{"startLine":2010}}}],"partialFingerprints":{"codehealthFindingId/v1":"60bec9322179fa6587477bbf9f3c291ba74c42e533f1c1aa5f93c7995dec1fdd"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(f16_f128): add math tests when available \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":"library/coretests/tests/num/floats.rs"},"region":{"startLine":2199}}}],"partialFingerprints":{"codehealthFindingId/v1":"871feb5cab09c94235714b36de3f9bb85a3dd8700b9a6c027a791d518d50d8c5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(f16): these should gain the check_exact_one tests like \u0060f32\u0060 and \u0060f64\u0060 have, \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":"library/coretests/tests/num/flt2dec/mod.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8b741fc88913cf3ddbbba50879498c563ae24d1e7dd26c0b308e43abf8d6739"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: These tests are all excellent candidates for AFL fuzz testing \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":"library/coretests/tests/net/parser.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c24eaeda5686e6c0df438fc9b1e3c03b6074045cf49dd2beee5442eb71cf0b08"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(fee1-dead): assert_eq \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":"library/coretests/tests/hash/mod.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"ace5e02b62a26acadcbf1be363b55e6b19d1bd2ca342e42fcf89ecf640728aed"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this is incorrect for some byte values: \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":"library/coretests/benches/ascii.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddbeb084b7d3aafab990febea76d977b3484e14287ed698fd125943e1e83720e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: like above, this is incorrect for some byte values. \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":"library/coretests/benches/ascii.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"ede5b5c17288cf00d1265b7429b4c4186da658a2499a63f0bd17ca685fdfa3fa"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// # #[cfg(not(miri))] // FIXME: Figure out how to make miri work before stabilizing this macro \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":"library/core/src/arch.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb8ba96dc21b7305440ee7e99bdd1d74a889cbfc9791bd8cb509c8a04597b9f9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const-hack): \u0060Copy\u0060 should imply \u0060const Destruct\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":"library/core/src/cell.rs"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"edf71cd96a2036876be58b6ae3f82037be909114a7dce281a9014cae04b3a33f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(aburka): these structs are used solely by #[derive] 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":"library/core/src/clone.rs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb666738a1a4c08ca83d9d2e363efedbc81b1184d2153af127c0444dc2fcadd6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#126799): when \u0060Box::clone\u0060 allows use of \u0060CloneToUninit\u0060, rewrite these examples with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/clone.rs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d86341fdd55a312337d5761e518385c7152035732cec5c99fdddd2e923a4513"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME (#152504): this method is used solely by \u0060#[derive(Eq)]\u0060 to assert that"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/cmp.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"411b4bc09738088d8b78415a227132c1e76f290e13e758e7139c73a971fbdae8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this struct is used solely by #[derive] 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":"library/core/src/cmp.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf0acb9592798a1bedd974a81cba63c6f77b46c9169c689e2daed417eccd5d17"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const-hack): just use \u0060PartialOrd\u0060 against \u0060Equal\u0060 once that\u0027s 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":"library/core/src/cmp.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"98bd39cc9fc3ea673f2f6f4f15e30cb61deae10ca55ae609dfcb849687c55851"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(sized_hierarchy): remove this \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":"library/core/src/cmp.rs"},"region":{"startLine":1456}}}],"partialFingerprints":{"codehealthFindingId/v1":"6942042e87a55026e839d541f77f791e698ce13f6e3afa96320cdbcc9ec7f44a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: splat interacts poorly with the double linking of \u0060core\u0060 in 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":"library/core/src/cmp.rs"},"region":{"startLine":2022}}}],"partialFingerprints":{"codehealthFindingId/v1":"58a345003a8b48592751b1e4c3c0db45e898ee6e7c249c6acf19ea725197a82c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: splat interacts poorly with the double linking of \u0060core\u0060 in 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":"library/core/src/cmp.rs"},"region":{"startLine":2105}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8429058f9a4fc1c5b5a961d71738c8955891c6aab834a3fa468b09ceea5c0ab"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(https://github.com/rust-lang/unsafe-code-guidelines/issues/245):"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/hint.rs"},"region":{"startLine":836}}}],"partialFingerprints":{"codehealthFindingId/v1":"6368dc83a7fa8d1d5920d3aafc89376a4229a51bf848de44e341085b7a6e449e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Once rustdoc can handle URL conflicts on case insensitive file systems, we can replace \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":"library/core/src/keyword_docs.rs"},"region":{"startLine":1474}}}],"partialFingerprints":{"codehealthFindingId/v1":"669b9948316ba50a11f884095003cf6dd27d3a12de20a16b7fcc3ebc28aa9dd1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Fill me in with more detail when the interface settles \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":"library/core/src/lib.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bee2451adba4290e74c9a376f0682503c5033624c6a3596ca5308f716f2cccc"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: stdach is a submodule so clippy lints should be fixed (and ideally enforced) 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":"library/core/src/lib.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ec3257a69b68a74eeb3944467623478d53a09055240c529a59b01f2d503f557"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(estebank): once support to add notes in \u0060rustc_on_unimplemented\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":"library/core/src/marker.rs"},"region":{"startLine":658}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2966fbea1a83f3fd751a52f0542fdf1bfbda244307510c8b882c24636ed47c5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Eventually this trait should become \u0060#[rustc_deny_explicit_impl]\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":"library/core/src/marker.rs"},"region":{"startLine":902}}}],"partialFingerprints":{"codehealthFindingId/v1":"03b5add85ebe8da9ea20422e1e24acfc6a532e5e2dba10b1e273bad4434d43a7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(unsafe_pinned): This is *not* a stable guarantee we want to make, at least not yet. \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":"library/core/src/marker.rs"},"region":{"startLine":1020}}}],"partialFingerprints":{"codehealthFindingId/v1":"177a2a72046b94f1d88f785f52bcea740c2f91bfb33c661eb74415578c93681c"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK(khyperia): if this is missing, the gca macro\u0027s \u0060implied_by = \u0022gca_adts\u0022\u0060 emits an error \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/marker.rs"},"region":{"startLine":1077}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee532bd8ac736f06f5172d6e08499e681f1c69661987b236c4109a67292a92fd"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: abuse implied_by, this should be enabled if gca_min_const_items or gca_adts is enabled, \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/marker.rs"},"region":{"startLine":1088}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1d25015df7ce49f7f40f34e184bd20ed10deb0704d6158e4b081ba6c438b1a3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(adt_const_params): handle \u0060ty::FnDef\u0060/\u0060ty::Closure\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":"library/core/src/marker.rs"},"region":{"startLine":1125}}}],"partialFingerprints":{"codehealthFindingId/v1":"e81d8895a4848d86258819ef0fde1731e39f938bebae5e6245c08f21e7a898d4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const-hack): use \u0060map\u0060 once that is possible \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":"library/core/src/option.rs"},"region":{"startLine":781}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b71bd749b16d2606ce33f3dec1b942da5e9db97e7517543c2a9b776a1f46108"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const-hack): use \u0060map\u0060 once that is possible \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":"library/core/src/option.rs"},"region":{"startLine":801}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e3264277eace96db6c41e5a63963cb7a13a4526ced2e66ee5edaf4e67036561"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //FIXME(const_hack): this \u0060T: [const] Destruct\u0060 is unnecessary, but even precise live drops can\u0027t tell \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":"library/core/src/option.rs"},"region":{"startLine":1648}}}],"partialFingerprints":{"codehealthFindingId/v1":"93d265bb7c9b69e787e007dc8efda7af2345106c8989d12e1b991a6ecc440b9b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const-hack): It would be nice if this weird trick were made obsolete \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":"library/core/src/option.rs"},"region":{"startLine":1822}}}],"partialFingerprints":{"codehealthFindingId/v1":"139ba71df73b77911dca00d0f968f6069e5c3ab11a4c6f92b42659347b0b6abd"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const-hack) replace \u0060mem::replace\u0060 by \u0060mem::take\u0060 when the latter is const ready \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":"library/core/src/option.rs"},"region":{"startLine":1903}}}],"partialFingerprints":{"codehealthFindingId/v1":"23009ab40348aa0e25e307e88b57ee8b4a783961f24d49397dc19e1230a1bfa3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const-hack): this implementation, which sidesteps using \u0060Option::map\u0060 since it\u0027s not 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":"library/core/src/option.rs"},"region":{"startLine":2139}}}],"partialFingerprints":{"codehealthFindingId/v1":"274610946d7ca6276ce4d724ccda91eb6090ea982ee329c31c8f4db7a01ad425"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const_hack): the T: [const] Destruct should be inferred from the Self: [const] Destruct in clone_from. \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":"library/core/src/option.rs"},"region":{"startLine":2273}}}],"partialFingerprints":{"codehealthFindingId/v1":"9354c3285bafc0325aecd2947fa5475a1c31434a5d24f7e0e70f57271e5df4cb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const-hack): could be written with \u0060and_then\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":"library/core/src/option.rs"},"region":{"startLine":2942}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ac1b3193645b44389fc9b18eb1f5571ba8d468876a6c58698f5ae4b04903c30"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const-hack): could be written with \u0060and_then\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":"library/core/src/result.rs"},"region":{"startLine":1852}}}],"partialFingerprints":{"codehealthFindingId/v1":"53f42ff24f2af896947353509ff89f9274d1c135fd70678a81d453006a9bb07c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // All uses of this macro are FIXME(const-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":"library/core/src/panic.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"9087a33856b8e6c58449ede36614c126a635fefb3775695ab9189f8e347a43c9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo!() without args expands to this, to generate slightly less 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":"library/core/src/panicking.rs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ac369f88ee4b9f51b1419830a55959e7a59cc4ce8a682d170ba859115c0536b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: ///     todo!() // \u0060!\u0060 coerces to \u0060u32\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":"library/core/src/primitive_docs.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"878fe1988b144bd7710313b889ceaa67e0b97b27cbfd81e2dde18c6affc62b8b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: ///     todo!() as std::iter::Empty\u003C_\u003E \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":"library/core/src/primitive_docs.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"8838c339ee52e0e5bc4d92844efe06df2de05132122b05c0c75796426c0664f2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Is there a better place to put this? \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":"library/core/src/primitive_docs.rs"},"region":{"startLine":1281}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c8858a98c7c4bb43d6ab30a0bbe4a5c8acd86755a22c872c08603a83406159e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(one_sided_range): These types should move into this 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":"library/core/src/range.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4d8147af629cab46ef76a18bb24d4eafa3eb4c32c1d2d65bca8f9a890180ec1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(range_into_bounds): Ditto. Also consider re-exporting \u0060RangeBounds\u0060 and related. \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":"library/core/src/range.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"291770fd6054125cd061a7a823d91d8446dfa03d1aeb8b075a26f85405bc18b6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const-hack): to avoid E: const Destruct bound \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":"library/core/src/result.rs"},"region":{"startLine":1647}}}],"partialFingerprints":{"codehealthFindingId/v1":"09a7394ca7c4a800faea790f84d4788ee9e3754a3275c60fa6a35a7f735f1fab"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const-hack): this implementation, which sidesteps using \u0060Result::map\u0060 since it\u0027s not 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":"library/core/src/result.rs"},"region":{"startLine":1713}}}],"partialFingerprints":{"codehealthFindingId/v1":"88085eee9e6367372ce1bcc47629be0bd08ce7010597042f85c15298f8c46b89"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const-hack): this implementation, which sidesteps using \u0060Result::map\u0060 since it\u0027s not 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":"library/core/src/result.rs"},"region":{"startLine":1765}}}],"partialFingerprints":{"codehealthFindingId/v1":"18890b278ae4e0c093cd7342e7d234c224d20d405e85af3f92ec94c82946262b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const-hack): use \u0060and_then\u0060 once that is possible. \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":"library/core/src/time.rs"},"region":{"startLine":877}}}],"partialFingerprints":{"codehealthFindingId/v1":"09ecb75b0649d326e03be9653052240f7d60e4ac456985231e7060dc4c88d0ce"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this field makes Context extra-weird about unwind safety \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":"library/core/src/task/wake.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"04acfabfcdb8d06dc451e98ae789ac4b1141e20e7fd7a389c8343e8520aa6109"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const-hack): This should use \u0060?\u0060 again, once it\u0027s \u0060const\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":"library/core/src/str/converts.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"b445230a934ddba203303fa6f12a6c024bf750976eeb2c4e618f8ce8f5d389a1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const-hack): This should use \u0060?\u0060 again, once it\u0027s \u0060const\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":"library/core/src/str/converts.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"0973132e00a7a9d8b147a954b417b8631b708944752ff515d3da6b308c5fb44b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const-hack): This should use \u0060?\u0060 again, once it\u0027s \u0060const\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":"library/core/src/num/nonzero.rs"},"region":{"startLine":1621}}}],"partialFingerprints":{"codehealthFindingId/v1":"73dd1ffc0bec7372f08b6e8e2e4c3fea5fdf326646e22b63c7285fa733c01001"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const-hack): This should become \u0060map\u0060 again, once it\u0027s \u0060const\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":"library/core/src/str/error.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae461214c9c8fba064a23d726c25b680a36be30cc8099baac97aae0a13408e72"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // Todo: Change / Remove due to ambiguity in meaning. \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":"library/core/src/str/pattern.rs"},"region":{"startLine":917}}}],"partialFingerprints":{"codehealthFindingId/v1":"662592fd742abca8fdd6c4f72dd818ff268f4fb71a84f9bdc218d891a8289428"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const-hack): This implementation can be reverted 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":"library/core/src/slice/ascii.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"1489c06d40fc4f3c5648bf85ae39f90b7cc9d307e4c10bcecbde29dfd4930ab2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const-hack): The while-loops that follow should be replaced by \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":"library/core/src/slice/ascii.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"781a1332c52f5adb8890f4063fc2216863251d485661362c1028b4a2303ef9bb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const-hack): We would like to simply iterate using \u0060for\u0060 loops but this isn\u0027t currently allowed in constant expressions. \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":"library/core/src/slice/ascii.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"2707e36b642082e893dd1afa95831f9e71cbb7897f14098348a1dda85786cac3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const-hack): We would like to simply iterate using \u0060for\u0060 loops but this isn\u0027t currently allowed in constant expressions. \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":"library/core/src/slice/ascii.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"85b340868c32e78f7e826b294d069455dff1924d21d7a6296c622ef1f2b9e33f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Uncomment the \u0060AsMut\u003C[T]\u003E\u0060 impl when this gets stabilized. \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":"library/core/src/slice/iter.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd3f38b039d2cea7e21b6cee1ab212902d16743be7c047cd52eac13c480072aa"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const-hack): Replace with \u0060text.iter().pos(|c| *c == x)\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":"library/core/src/slice/memchr.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b1cbd43d585db588f3dc15d0dedff46472e8803c79d4a2ae5d68f00dd56916c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const-hack): Use \u0060?\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":"library/core/src/slice/memchr.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"e02dd120e269780d9ed7efee87b38663f5781ec1f9dfdd819172d19c94c5aaf0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const-hack, fee1-dead): use range slicing \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":"library/core/src/slice/memchr.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa460a22ff3794ae6bd4f62669c63623b2f0be3874ea8b04619bc7539e309953"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const-hack): Without const traits, we need this instead of \u0060get\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":"library/core/src/slice/mod.rs"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a3cf563ba634b1422ce1d5f299be31e14634bdf55af7ebc4631ea067b3f9db3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const-hack): Without const traits, we need this instead of \u0060get\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":"library/core/src/slice/mod.rs"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d3ee539786d5410912538307610d21f7ff8fd57a311fa01959fd64882923d18"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const_trait_impl) replace with let (a, b) = (\u0026mut a[..n], \u0026mut b[..n]); \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":"library/core/src/slice/mod.rs"},"region":{"startLine":1010}}}],"partialFingerprints":{"codehealthFindingId/v1":"62fca36339d24efff758b19c8b7d17588485f4db39e244387fdec7dee544e9c8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const-hack): the const function \u0060from_raw_parts\u0060 is used to make this \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":"library/core/src/slice/mod.rs"},"region":{"startLine":2050}}}],"partialFingerprints":{"codehealthFindingId/v1":"18d52ecdc443f3a5452a72f078e45ec30e5dafb3691bff00e784adefd7b83930"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const-hack): Use \u0060?\u0060 when available in const instead of \u0060let-else\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":"library/core/src/slice/mod.rs"},"region":{"startLine":5029}}}],"partialFingerprints":{"codehealthFindingId/v1":"f144f60b7b4febbd626372af4137b6ceac2dea642a695197bebb56f5bbc6d633"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const-hack): Use \u0060?\u0060 when available in const instead of \u0060let-else\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":"library/core/src/slice/mod.rs"},"region":{"startLine":5079}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbd7a044127f7b304b73330e76b948525cb73204d4ca03acb6ffe2f9fb9acfc2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const-hack): Use \u0060mem::take\u0060 and \u0060?\u0060 when available in 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":"library/core/src/slice/mod.rs"},"region":{"startLine":5054}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecac255f27460c858adcdbd0171bae96eed0eb9645d701a6e87252421c8e358f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const-hack): Use \u0060mem::take\u0060 and \u0060?\u0060 when available in 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":"library/core/src/slice/mod.rs"},"region":{"startLine":5104}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0058d17215a0d2dad63984f688ed6524473953594e8c3ec99231ce9c58ff315"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const-hack): Use cmp::min when available in 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":"library/core/src/slice/rotate.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4ea6586a3e2d7ecb6d33df867c8f62677213e01c448f8f2cea4150442ba5d1e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const-hack): Use cmp::min when available in 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":"library/core/src/slice/rotate.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdeb18cab4ba112076aa83a788bab2680616c88138300c51f660c68a25e40e8b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const-hack): Use \u0060for start in 1..gcd\u0060 when available in 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":"library/core/src/slice/rotate.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"19ae91cdc30ab3fee6814f42f36b9a24be8e3adf281b58d78b629740f53e86d2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // We use \u0060MaybeUninit\u0060 to avoid re-tag issues. FIXME: use \u0060MaybeDangling\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":"library/core/src/slice/sort/stable/quicksort.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce453bebbaaac73753841e12a129bb99d012f0758914b14458dcde3dc5112321"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME(const_trait_impl) use original ipnsort approach with choose_unstable_small_sort, \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":"library/core/src/slice/sort/shared/smallsort.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a586c1f0c58c7c1aeb3bc60bbc1ef05d17fe2b079baceaeffc121f2875f5379"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: say something more useful than \u0022almost the same\u0022? \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":"library/core/src/ptr/mod.rs"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"35a7974021cbe6b7db63312445fbaa18943bd03b5fb776c153b77ad57bcb3683"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#75598): Direct use of these intrinsics improves codegen significantly at opt-level \u003C="},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/ptr/mod.rs"},"region":{"startLine":2283}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe5bfe2c5b98cee438b78280200aa2ea13339f46a71d438c87dfd3131ff5355b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Remove the assume after \u003Chttps://github.com/llvm/llvm-project/issues/62502\u003E"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/ptr/mod.rs"},"region":{"startLine":2376}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7ca137a6798dbb9880683706811a3379c1dd9accd98d166e0da061cc3b2f5f5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const-hack) replace with min \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":"library/core/src/ptr/mod.rs"},"region":{"startLine":2401}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dd166027beb8ac939e345793a42276c3d205ff04f4af6ec1019123a97dc4913"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(unsafe_pinned) this logic is copied from UnsafeCell, is it still sound? \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":"library/core/src/pin/unsafe_pinned.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"b826b2d6479bdc587b9da87c84077fa9df5653568ca33a95b6679d5cbcee15b0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME(deref_patterns): The precise semantics are undecided; the rough idea is that \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":"library/core/src/ops/deref.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"3869b7f47d4a255d438530d805f35650a25f86b19a1d2c862b1c44693b1dad1a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: ought to be implied \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":"library/core/src/ops/try_trait.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"e16bff85f5bff6504ea67059a7756057f78d2d39ac8ea20de7d0041f5040908d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: force would be nice, but fails -- see #148915"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/ops/try_trait.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed825943a4666a82d64ccc5d13dcbdad71addb227475cb48816580afae6592c4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(offload): run those checks on arbitrary expressions \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":"library/core/src/offload/mod.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"e73c70f8119bea781cbc74ced82c4df5897574f533502253683303a65eaa77e0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(f16b) - This should be a \u0060#[rustc_intrinsic]\u0060 using LLVM\u0027s \u0060fpext\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":"library/core/src/num/bfloat.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c04de55a5b7bed7ad3548141295270a69f3752a8a647bc479c19b13ee4be22d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: replace with mathematical constants from cmath. \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":"library/core/src/num/f128.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"38abbba59e1dc4e07279583f5e7ed3a264b4c61cb23e0e0cf3ad6a182d3e5b11"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: replace with mathematical constants from cmath. \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":"library/core/src/num/f16.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"788b7cd8cdcd758a92fca499494f76c6b9d3be71b10e58f94168300e2f031c2e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: replace with mathematical constants from cmath. \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":"library/core/src/num/f32.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4ad5e55c85d3aa5d06916ec5c93f3e133a53f667bf8306555894f196977acc7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: replace with mathematical constants from cmath. \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":"library/core/src/num/f64.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c98715f4cf869253c2023d3d441c359e9bc737879ff93f1b5055c83f73aca4f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: alter the Rust \u003C-\u003E Rust calling convention to prevent this problem. \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":"library/core/src/num/f32.rs"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"65fa2dae2cf833112b22edfd08b52c9ae4848f5b1e56eb13161fce514f3d99a0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: alter the Rust \u003C-\u003E Rust calling convention to prevent this problem. \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":"library/core/src/num/f64.rs"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dc480e55433072ab41b86eafff51c961343a2a2f5d6d04451229caa5e6e17c1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// # // FIXME(#140515): mingw has an incorrect fma"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/num/f32.rs"},"region":{"startLine":1923}}}],"partialFingerprints":{"codehealthFindingId/v1":"d878deee641f621e803502ee6a744fd69a4a368c2cb076f725938cc0347ca398"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// # // FIXME(#140515): mingw has an incorrect fma"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/num/f64.rs"},"region":{"startLine":1905}}}],"partialFingerprints":{"codehealthFindingId/v1":"99ed69c591c68e48abe601d79b1355565149c6effab17a360009301d27de3faf"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// # // FIXME(#114479): on \u0060i586\u0060, x87 excess precision gives neither allowed result"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/num/f64.rs"},"region":{"startLine":1666}}}],"partialFingerprints":{"codehealthFindingId/v1":"f390952524fbb5e12a29931cd41553c1b5a7a49e0d96d941f28e77f67d06ae6e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// # // FIXME(#152635): Float rounding on \u0060i586\u0060 does not adhere to IEEE 754"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/num/float_macros.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"a254b9dc2dfd78e58c88d6bd05932d8fa5aead90ed84f71580d1f3669f8ef21f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// # // FIXME(#152635): Float rounding on \u0060i586\u0060 does not adhere to IEEE 754"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/num/float_macros.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"c139595ac5c523e7267c18c52c3002a343afd3e72178d46d3a8dc792d83b024f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(f16): A fallback is used when the backend\u002Btarget does not support f16 well, in order \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":"library/core/src/num/float_parse.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"f78c3e1f1d577050ccc580076df45e71ac64f66c9b3b68f6cb1f93d5a23683fc"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(f16): A fallback is used when the backend\u002Btarget does not support f16 well, in order \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":"library/core/src/fmt/float.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0f0dfbac952a2840f1598154d6610cfddb8380ff25d07df20ed6d7b4af7053c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const-hack): Used because the \u0060?\u0060 operator is not allowed in a const context. \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":"library/core/src/num/mod.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"a49d2274b619dc2ea7e7ae70547ce08edd6019cf9d1029060834765c71282644"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#122566): These HTML links work around a rustdoc-json test failure."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/num/mod.rs"},"region":{"startLine":1684}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3a85462ae379b6ec2c9fe8e1f1a9401f5db345fd824b9b007ed40932b3f1f64"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const_hack): the T: ~const Destruct should be inferred from the Self: ~const Destruct. \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":"library/core/src/num/nonzero.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c9a4c618c61f1423a4ce38326e1e66edb7097b3be9455b7294bb846420c10a5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: see library/std/tests/slice-from-array-issue-113238.rs \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":"library/core/src/num/nonzero.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef2b6a0ef01c374e0b25e52380a4995722cb39026ce191ccaa0d8e35fe775c66"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: can\u0027t detect that ZeroablePrimitive is a sealed trait \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":"library/core/src/num/nonzero.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb36c18d27acad15780f9182984d5e11c7b2f611accead2a48a0bef641d802a0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const-hack): This should use \u0060Option::ok_or\u0060 again, once it\u0027s \u0060const\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":"library/core/src/num/nonzero.rs"},"region":{"startLine":1626}}}],"partialFingerprints":{"codehealthFindingId/v1":"a645c3e660840e74de29d4a05dc929e3531b2dd7f4e4ffb283164cb29dbba814"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME the correct implementation is not clear. Waiting for a real world use case at https://github.com/rust-lang/libs-team/issues/230"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/num/saturating.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"798672fb4ed0f515944769b2c5265daa9eb2eb3a02a796d067a392d22a521910"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //         // FIXME what is the correct implementation here? see discussion https://github.com/rust-lang/rust/pull/87921#discussion_r695870065"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/num/saturating.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"368666bb8401d1b11aedc0ec528db054fce6a1915d303e905fc98d05d8efa7ce"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // // FIXME (#23545): uncomment the remaining impls"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/num/saturating.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"d25317a80d91432daffca95ff5ed3ad78f14eddac388c483d80f240b1d321ddc"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(30524): impl Op\u003CT\u003E for Saturating\u003CT\u003E, impl OpAssign\u003CT\u003E for Saturating\u003CT\u003E \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":"library/core/src/num/saturating.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"feb09b3edf7c3dd6a4fb4a79a51f86b8901b9a2ef261a2980b2c3b221ad92f80"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(wrapping_funnel_shifts): link to \u0060wrapping_funnel_shl\u0060 when stable. \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":"library/core/src/num/uint_macros.rs"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f5301af467dd51b55bf8a55d0937157e6bf17701c46003303ed5c00f0159b71"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(wrapping_funnel_shifts): link to \u0060wrapping_funnel_shr\u0060 when stable. \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":"library/core/src/num/uint_macros.rs"},"region":{"startLine":668}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aba134a384f4289016b270978d50291a45b7db1fa6b36bddf5e0b67789e6def"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME (#23545): uncomment the remaining impls"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/num/wrapping.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"d425dcee24a60942de6ab56b3a28cfc456e3afc77d7c0fd5373aaa5101d4cc1e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(30524): impl Op\u003CT\u003E for Wrapping\u003CT\u003E, impl OpAssign\u003CT\u003E for Wrapping\u003CT\u003E \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":"library/core/src/num/wrapping.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"78057eaeba970736e54b7ef6d9c861133a7f12e53ed88c857accfa0786941907"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#162879): these tables have u64 and u32 versions, future versions may be generated by macro."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/num/imp/flt2dec/strategy/dragon.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd4765cadb57ee3df80a82e46d5b702fb7e981681bcd415f05774a2487062d5f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(tgross35): it may be better for this to return an option \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":"library/core/src/num/imp/dec2flt/decimal_seq.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"42e6c95bc2f65d368c1b7a5753dd6fd1eb83b2ffec971c2da35a25c815342292"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(tgross35): incrementing the digit counter even if we don\u0027t push anything \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":"library/core/src/num/imp/dec2flt/decimal_seq.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"555101e4e81f8166ac343e6b4811772dbb69b6de93808f7aaafaddb211ce93b6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(tgross35): this could be \u0060.rev().position()\u0060 if perf is okay \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":"library/core/src/num/imp/dec2flt/decimal_seq.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"32094abfe88f08d5dd19fe3a376b7a9132685eef02f96cb94c8daa5d83b6ecdd"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const-hack) Remove me once \u0060Ord::max\u0060 is usable in 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":"library/core/src/mem/alignment.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba372d2f0650b1e124da7f9b3c156639796ef1aa927c858cd22812afd95864e0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// # // FIXME(https://github.com/rust-lang/miri/issues/3670):"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/mem/manually_drop.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d375c743e0e1410bd6cfd2fec91c41683a0087ad35488c39548090ad4a13c9b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// # // FIXME(https://github.com/rust-lang/miri/issues/3670):"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/mem/maybe_uninit.rs"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"741aff838bbf2da67f26f614ee95dc0d8f64caf2463268159fc9ba3c26f72cec"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// # // FIXME(https://github.com/rust-lang/miri/issues/3670):"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/alloc/src/boxed.rs"},"region":{"startLine":2055}}}],"partialFingerprints":{"codehealthFindingId/v1":"852c42de1a7f6049cbdc650bace26337da1eb25217cb08d2c9cf4e8bcae0613c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// # // FIXME(https://github.com/rust-lang/miri/issues/3670):"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/alloc/src/boxed.rs"},"region":{"startLine":2067}}}],"partialFingerprints":{"codehealthFindingId/v1":"236f0179a3ab82d9d6869eee56823a2d0050b819fc6a4a135d67c8ec1a7de372"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// # // FIXME(https://github.com/rust-lang/miri/issues/3670):"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/alloc/src/string.rs"},"region":{"startLine":2270}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a616a44d16a3f9d1d57cdbb9135509d8df69f5a9efadb0a8fc822e43b3dad5c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// # // FIXME(https://github.com/rust-lang/miri/issues/3670):"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/alloc/src/vec/into_iter.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"8458278a6653b0e22ad78868684e5fe5c9c3f44c848114f540cbc6aa0f674b72"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// # // FIXME(https://github.com/rust-lang/miri/issues/3670):"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/alloc/src/vec/mod.rs"},"region":{"startLine":3316}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdfbe6af957c0aa65baf7aaa120b5fe1e6e01e86474d0bb3b6998b6a40341e73"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: remove \u0060no_run\u0060 once the semantics are actually 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":"library/core/src/mem/maybe_dangling.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"736d63cd09132dc6aad46beb8d87dea8af135cc83e4ffc447e19cd279711cfd7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: replace this with \u0060self.0\u0060 when const checker can figure out that \u0060self\u0060 isn\u0027t actually dropped \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":"library/core/src/mem/maybe_dangling.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"6394835c353a1725dfd956fb8e48bf1b69ab790efecefa1d7dfce12fdc483b20"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(jswrenn): This const op is not actually usable. 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":"library/core/src/mem/transmutability.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d72c6a7207114d28c1d88b67b77f1f9987d784574142caedf0796496e030193"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(jswrenn): This const op is not actually usable. 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":"library/core/src/mem/transmutability.rs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d8866c1107aab108ebbdfe72f7bbad6b7154cf7f275ff8e2f389807d057e3a7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(reflection): get rid of the static lifetime bound on TypeId and remove this 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":"library/core/src/mem/type_info.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"6407a1100fce33a0b47176dbe7ed8db7baad3e4c25f63e53f9aec5fa82bd0736"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME(#146922): add all the common types"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/mem/type_info.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"423d38252057a0fc8f93bb68338526e91f856a11cc69c1dffee62c55dccd1131"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME(#146922): Add super traits and generics"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/mem/type_info.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"512b388d123423a0b78f09075f0f297844f9a0de59c9ad1d855a020d67cfb217"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(splat): should these fields be private, or merged into an Option\u003Cu8/u16\u003E? \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":"library/core/src/mem/type_info.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"86ccbb75ff507ea5c2d22504dec19a04d08eda6d8cc21e0d9f2ec8a39668dc05"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(reflection): make the errors nicer. This is a wider problem, \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":"library/core/src/mem/type_info.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ce322d30435eb0126c217591f9e392b39951ff97e2ee7f7ef96be0d996fc6e8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(type_info): Add enum variant pattern types and use them to represent individual variants \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":"library/core/src/mem/type_info.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc0732cfd6c940f8c1e454d65ddbc140c7b76ac01b3e85bec1b5c024e6be6023"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: ///         todo!(\u0022MyStruct is not yet quxable\u0022); \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":"library/core/src/macros/mod.rs"},"region":{"startLine":868}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0d7a590a7b0436cc43b73800ffaf381fdde97b48fe71f358907273ef57bc0f0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: should we worry about the count overflowing? The only way to have more than \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":"library/core/src/iter/traits/iterator.rs"},"region":{"startLine":2349}}}],"partialFingerprints":{"codehealthFindingId/v1":"1976f5b60b2e4f62bd7f7a7e762554725d1c8fd1eb538142ca0faf730f3ecab5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this should be a #[marker] and have another blanket impl for T: TrustedFused \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":"library/core/src/iter/traits/marker.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eb275b55c959839fa905fe9698485141389b826fdf1de2475589c88588cf6b2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#31844): convert to an associated const once specialization supports that"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/iter/adapters/flatten.rs"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"78fc9d0abb63090e7be5ea704772498d7fb227304eb81d02d916c8e250004f92"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: should we shrink the size of \u0060buffer\u0060 using niche optimization? \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":"library/core/src/iter/adapters/map_windows.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"dae224ff6d56a6605cef5c8b0c059181f0ec489c9c0fe563043c01bd7b2723b3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#11084): we might be able to get rid of GenericShunt in favor of"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/iter/adapters/mod.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee83f6cf4c5e5c86bdf47fbff2ae6663e99985089df24295041622f649458577"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Clarify interaction with SourceIter/InPlaceIterable. Calling \u0060SourceIter::as_inner\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":"library/core/src/iter/adapters/zip.rs"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"0507bff9157f6cdb25a956781978426d96329052ea2ab89bfe0cbb5757cca419"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#74481): Hard-links required to link from \u0060core\u0060 to \u0060std\u0060"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/io/cursor.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c4722578549109a46c25f05cf779f4c1fbe33c271ff766bb7ddf895ef277c3d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#74481): Hard-links required to link from \u0060core\u0060 to \u0060std\u0060"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/io/error.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"021b499c7a856af229d563e4f68d50a3d5b2be9e4e105655ae2756f699697fd7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#74481): Hard-links required to link from \u0060core\u0060 to \u0060std\u0060"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/io/error.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"27edd1c30e9c55b701025e871a21a9e5ae330d914534557b4374491f147fcecc"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#74481): Hard-links required to link from \u0060core\u0060 to \u0060std\u0060"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/io/error.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd64c054f2fcfb072027e4ec3dfec6ea08057dc99090027f42a2d80b71c6371e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#74481): Hard-links required to link from \u0060core\u0060 to \u0060std\u0060"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/io/error.rs"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"b75e8f9afc7b21aad3e9851a516a922e9a72c4498d045d5112e2922ce34d983f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#74481): Hard-links required to link from \u0060core\u0060 to \u0060std\u0060"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/io/mod.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"05284830b9a5aac354017d90e71cfa2c89eed2b2c10075a39f6d412825a6efef"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#74481): Hard-links required to link from \u0060core\u0060 to \u0060alloc\u0060"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/io/cursor.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"23fabc1d6347a6e8ab01741a55ab6bc8965281f3e27deaf09c22974093f3888a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#74481): Hard-links required to link from \u0060core\u0060 to \u0060alloc\u0060 for incoherent method"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/io/error.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a54a13e40d556bf1781de3d118cfe3cfb049025580dfa22622b077de891bb61"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#74481): Hard-links required to link from \u0060core\u0060 to \u0060std\u0060 for incoherent method"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/io/error.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"1080360a9d5aecae14262dce724bfba11a74b0a43087d4d43ec83701d49f231b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const-hack): Use \u0060\u0026self.0[n..]\u0060 once 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":"library/core/src/io/io_slice/repr_generic.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"09829bd6d2f99fe0d6e155b1fe2743af89d90073f5bfb8ee5116c0ee9b7efc79"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const-hack): Use \u0060mem::take\u0060 once 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":"library/core/src/io/io_slice/repr_generic.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"985d93eb28362239df06104e36f87bf14d7175b520559e0cf87adee1955e9c39"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: externally implementable items may allow for weak linkage, allowing \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":"library/core/src/io/error/os_functions.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cd33c3d6c799a4fd1c82389bbd0a93ccef1e7e69429aed915f9fcd66fce0fe8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: replace this with externally implementable items once they are more stable \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":"library/core/src/io/error/os_functions_atomic.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"1289245cb9fec445995e5e672a0eb3f6c9450571aea841aa34cc062639e5ef70"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(danielhenrymantilla): a private macro should need no stability guarantee. \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":"library/core/src/future/join.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"970b165e0c6c503c0d081e18d175c7066a1d7dee347b33a0981acddd8bc28f1a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Decide what public API we want for these two 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":"library/core/src/fmt/mod.rs"},"region":{"startLine":2443}}}],"partialFingerprints":{"codehealthFindingId/v1":"628b3c11c4e9c4709f5ae548763cb6af300fa7b7dd4299feb95f6393b3e45979"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Once const generics are better, use \u0060NumberBufferTrait::BUF_SIZE\u0060 as generic 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":"library/core/src/fmt/num.rs"},"region":{"startLine":794}}}],"partialFingerprints":{"codehealthFindingId/v1":"304a6a1acfcd55d084ce3e005d66dbf544306d2e6c38c008622129ae62e23186"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Once const generics are better, use \u0060NumberBufferTrait::BUF_SIZE\u0060 as generic 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":"library/core/src/fmt/num.rs"},"region":{"startLine":830}}}],"partialFingerprints":{"codehealthFindingId/v1":"22e733a2e8b5a16e41c0803e32e28bbc1bd9c9b3098d4006e4fcd570038eec0f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: because this is doc(inline)d, we *have* to use intra-doc links because the actual 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":"library/core/src/ffi/c_str.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"51ef05e1f25c3f81fcba98d93377fcc62c7f043f6e20b905822ce48d29c51991"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this should not be represented with a DST slice but rather 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":"library/core/src/ffi/c_str.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fd90a48f9e67efec52943249075c3a276c7ed5fd0e93616a838959a08bacb75"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const-hack) replace with range index \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":"library/core/src/ffi/c_str.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f50906c34a5bde45891304c2585a8cc9feb4ea412fab7fd41ca37f888e5aede"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const-hack) replace with range index \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":"library/core/src/ffi/c_str.rs"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"54c386e67cb02c937e51669a53053ad432cff681d1224803c4b9efd6e4884dff"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const_trait_impl) replace with \u0060NonNull::from\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":"library/core/src/ffi/c_str.rs"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"6163c6da96dcf8477a3141ba09b699cf9abaf2914747a3a95d142913017fb2bc"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const-hack): use get_unchecked \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":"library/core/src/ffi/c_str.rs"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5c81691eeb61fd19111efa5a5e698efc91cf764133b116daa1c7151f2aedc22"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME (#45742): replace the above impls for \u0026/\u0026mut with the following more general one:"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/convert/mod.rs"},"region":{"startLine":737}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5dceef48b59343354c02746a389571acd9345d735629b2b242e554b814ad340"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME (#45742): replace the above impl for \u0026mut with the following more general one:"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/convert/mod.rs"},"region":{"startLine":758}}}],"partialFingerprints":{"codehealthFindingId/v1":"d580df93a9585af40e011e221caca12291b7e7fa80540ca61dfce4153d5a67e9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(f16,f128): The \u0060f16\u0060/\u0060f128\u0060 impls \u0060#[stable]\u0060 attributes should be changed to reference \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":"library/core/src/convert/num.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba0e1ac25d1032f7831905d5dd77623f9f9177825c778a02368f0531fcbd1010"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(f16): adding the additional \u0060From\u003C{float}\u003E\u0060 impl to \u0060f32\u0060 would break inference in cases \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":"library/core/src/convert/num.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"2830d59330bf9a470b646b007f5b1397b5349efe25f03be3683553d6a8a84cb6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const-hack): once Result::ok is const fn, use it 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":"library/core/src/char/convert.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"62f14d6f8b9186de4147994938188a7d5f634f61f1164c45c2eae965e47fd434"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const-hack): this should use map_err 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":"library/core/src/char/convert.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"edb8f32d2fbd4744ecb424b3a460211426452974ce41c33a106a1f227d861f61"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const-hack): this should use map_err 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":"library/core/src/char/convert.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9ace6e37a02aeb80e8f251d22532c27e87f12ca730cd470b6e7101d149b422b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const-hack): this should use map_err 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":"library/core/src/char/convert.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9847c150409f119f2a01bc12c21843a56ec9ed585cb6dd8b7e2592493d887de"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const-hack): once then_some is const fn, use it 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":"library/core/src/char/methods.rs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"00afe78449d0c19ad73cc02bedba0e51e2d6cd4d3545a7029b04f524184bd0fe"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(gen_blocks): This probably could be deduplicated. \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":"library/core/src/async_iter/async_iter.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"3862eccc434564d2c0b86f3318f3767d8c3fd8b315598ca80161333c3f2b1afe"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const-hack) \u0060arg.to_u8().to_ascii_lowercase()\u0060 -\u003E \u0060arg.to_lowercase()\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":"library/core/src/ascii/ascii_char.rs"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e52b3ea52018ce7999a289a2f5ae9ef31ae878eeb2caebd615110ae52dccab5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const-hack): This is a slice::IterMut\u003C\u0027l\u003E, replace when possible. \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":"library/core/src/array/drain.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ca2385d9c832c2c8d6f1b3cd46e72e0c75b7110c1f7b830027c99857768acd4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const-hack): ideally this would be an unsafe fn \u0060next()\u0060, and to use it you would instead \u0060|_| unsafe { drain.next() }\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":"library/core/src/array/drain.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c6c6ffab8e18b2e6a559ab0b0b9dfde5b710784d1f4d597bb9d54654603de63"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: If normal \u0060transmute\u0060 ever gets smart enough to allow this \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":"library/core/src/array/iter.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"c229331c8bebdc3e5875abd48e204a5ade2d7ae1e06550eb7345d96d44120fdb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const_trait_impl): We would like to simply use iterators for this (as in the original implementation), but this is not allowed in constant expressions. \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":"library/core/src/array/mod.rs"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"83cf1335c7965e2cf17233eb9a76be088f1175e46cc3a536a562478feac20bef"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const_trait_impl): We would like to simply use iterators for this (as in the original implementation), but this is not allowed in constant expressions. \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":"library/core/src/array/mod.rs"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b2adaf8c4a4889cf018fc213229a0396c885c1f279a3c51f8b036f3b64eeb04"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const-hack): the following could be way shorter with \u0060?\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":"library/core/src/alloc/layout.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"91be90b23eaafd154af5c1d598ec4dfc78caf630f3db80eb1b44266278ca2a33"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This needs to be updated to interact with compiler-builtins \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":"library/compiler-builtins/libm-test/tests/check_coverage.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b73f09a4b5ad72023b4b717ff8ca07374ce98a9fae4d68fdb3f0ba5a57f5fe0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO integer inputs \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":"library/compiler-builtins/libm-test/tests/compare_built_musl.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"013ed9dd512eb8f24b60befeb00211adcd8716c8d6765d57c5ba0abd0892ba30"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: test needed, see \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":"library/compiler-builtins/libm-test/tests/multiprecision.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"1df08bc0075eba0839338bdae152a6fec67bdcf2c0e139e3013b5d7b3ab50dc1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: test needed, see \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":"library/compiler-builtins/libm-test/tests/z_extensive/run.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"663c9817454d045ff041e7432888d245ffd5ddcd8269ad2f2578db91064c3728"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: the domain should provide some sort of \u0022reasonable range\u0022 so we don\u0027t actually test \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":"library/compiler-builtins/libm-test/src/domain.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"162894e067a7d83c4396cd4cc22f1ee09db70eae7064a78f7eff1bdcbf9fc9a5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: incorrect values \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":"library/compiler-builtins/libm-test/src/f8_impl.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"86680c86f33d9ea53af4389f3310307ebfb903dc6dc3a4e38055db4b06346fab"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(float_bits_const): remove when stable \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":"library/compiler-builtins/libm-test/src/lib.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2c127a341efb641ebc72f45a647ffd53975d380c18df08f0a69a966bce06cf1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(float_bits_const): remove when stable \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":"library/compiler-builtins/libm/src/lib.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"0950f616ea8a28a7fea709b546ad6973bfec2fc9bc8119935b8755f2db256976"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(float_bits_const): remove when stable \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":"library/compiler-builtins/compiler-builtins/src/lib.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"a165c59c5e0c46d29cb63ee827d8df918d2ad42ba1bbef5dd49e4b501420f94e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: respect rounding mode \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":"library/compiler-builtins/libm-test/src/mpfloat.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"7067e266e4efe93866ad5eadef4629f91ebaee315932d6639635b07423605b68"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: respect rounding mode \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":"library/compiler-builtins/libm-test/src/mpfloat.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d629d8bbb2ad8ebb15bb3edd3793bba14c5963e956307db03a7c76a79e3b088"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: respect rounding mode \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":"library/compiler-builtins/libm-test/src/mpfloat.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"d22821640eb8b9ff54bb223289fd5d8b00c11e1291c0788c72cac7a36e0f2397"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: respect rounding mode \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":"library/compiler-builtins/libm-test/src/mpfloat.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"f383d227a77590e3bbaebf71f22b64797ff0d27b30a21cdd6c97293ec5e73f6d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(correctness): we need a better powi implementation (though this is no worse \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":"library/compiler-builtins/libm-test/src/precision.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"53c14a22d4f44ceb5ab3a6fc433b0892fd8c3a495337cac8ee539448046c62dc"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: these need to be correctly rounded but are not, likely due to LLVM bugs \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":"library/compiler-builtins/libm-test/src/precision.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"153688b64e46635dabf079e540266b6c74e0028fb87a9435b6de754bec8620d5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(correctness): lgammaf has high relative inaccuracy near its zeroes \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":"library/compiler-builtins/libm-test/src/precision.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"94ada1be83bdfe7e1b123836f624949fa428b8f40a1e83857ecb60c60369c953"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(correctness): lgamma has high relative inaccuracy near its zeroes \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":"library/compiler-builtins/libm-test/src/precision.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"14b26610999f42205030c3f03aa3f8e0075c42803b10678a054ab3836878012d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(correctness): exp functions have the wrong result on i586 \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":"library/compiler-builtins/libm-test/benches/random.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcea5be802e5d7011985362c598257ca642d568f21da6988b860f2f1fbb041ea"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(msrv): defined since 1.78. \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":"library/compiler-builtins/libm/configure.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"723c9309ff2d1724ff06c7f60bcd8a1f82ccec4ef150c62d3aa3228776b2d532"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(msrv): \u0060cfg(target_abi)\u0060 is usable since 1.78. \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":"library/compiler-builtins/libm/configure.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6450b36f815f728fff1a27257cbf9df36bb8c5876d1cc39562cb6bc17f7ca51"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(arm_target_feature): the exact target features are not yet stable. \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":"library/compiler-builtins/libm/configure.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"90d034d28b4328e2d74fc83bf19bd018e05c7a961c6049d1de94c1411856b6bb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo: index \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":"library/compiler-builtins/libm/src/math/cbrt.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"8560c586386e2b971b389bb97b3fd4d324ea642de3ceba8754c00aa5c6eb8da3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(expm1): use this directly from \u0060expm1\u0060 once ported from CORE-MATH. \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":"library/compiler-builtins/libm/src/math/exp2m1.rs"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"2edc815ca5b05112948bb7609abe65b0832b798f728117ba5765cb065341d425"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: bitwise tests including NaN are skipped because of failure for 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":"library/compiler-builtins/libm/src/math/fdim.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"51412f21dcfbd9cc001b2f296c620b8cbab0b7e14e780f5fd69e4ba6702cb3a3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: we raise underflow but this should only be inexact (based on C 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":"library/compiler-builtins/libm/src/math/fma.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e4b3124b1141baffa0efb9a899ca8d69e4ea81a60f4d85d7095d472db7c7ee7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: In C, this was implemented using switch jumps with fallthrough. \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":"library/compiler-builtins/libm/src/math/lgamma_r.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"99897cce26af76d815797ea9fbcdf1e7536173791643c855b3a819b70f06b6d2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: In C, this was implemented using switch jumps with fallthrough. \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":"library/compiler-builtins/libm/src/math/lgammaf_r.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"197b1f76206e8393c1af4f7a167805f8ac4939e8a1fec52c21b89a80a2299a7a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: instead of abs(j) use unsigned j \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":"library/compiler-builtins/libm/src/math/pow.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7b626362b57557efb14d772a50a6c55af97eb4b20bc394ad4b2a7168ce2e692"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: check should be  (uint32_t)j \u003E 0xc3160000 \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":"library/compiler-builtins/libm/src/math/powf.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"57448aad16d2ce802a38bc164859192c78e8efb2ae68ff0690a0f08205aeb550"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Support FLT_EVAL_METHOD? \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":"library/compiler-builtins/libm/src/math/rem_pio2.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"7796bce036c8e55e3d8acc95509e710e1e246541a7d87da96c7853c7d6608d53"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(correctness): inaccurate results on i586 \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":"library/compiler-builtins/libm/src/math/rem_pio2.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"542232a0c67c5ac4d5336c4823d64e75cd5dcd52dbe3d72c47906fbfad66e4ea"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(clippy): the suggested fix is bad but the code as-written could be better \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":"library/compiler-builtins/libm/src/math/rem_pio2_large.rs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd9dd45c978a9a84db0c83caa0be162aaedb11609319f2220c2607489aeeca4f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: this matches musl behavior, but it is incorrect \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":"library/compiler-builtins/libm/src/math/remquo.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"abdd7e352c0070218efc01da9aae8cbe895569432f0c2484a5cb300eb118ddaf"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: LLVM often removes this. We should determine whether we can remove the operation, \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":"library/compiler-builtins/libm/src/math/support/float_traits.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"51adb5cb717c0a9f5ec07a4140612a09c8d15563dfed3ad5929495288b53810b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Replace with \u0060next_up\u0060 from \u0060core\u0060 once \u0060libm\u0060 MSRV reaches 1.86. \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":"library/compiler-builtins/libm/src/math/support/float_traits.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec45e348a8b1094f06869b18e0756deffcb5e0fdc6c27ae99785d7be365adb80"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Replace with \u0060next_down\u0060 from \u0060core\u0060 once \u0060libm\u0060 MSRV reaches 1.86. \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":"library/compiler-builtins/libm/src/math/support/float_traits.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f3f6f354fb098db49c8ed0e57bb2cd5e5199003e9a23c3e3f72da27f54d7642"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(f128): Remove once the nightly toolchain has the __unordtf2 builtin \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":"library/compiler-builtins/libm/src/math/support/float_traits.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"f375632e53531fb5564c15cd75da68ff2ca8d18a83aadfed43bec728d893ba1e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(msrv): \u0060abs\u0060 is available in \u0060core\u0060 starting with 1.85. \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":"library/compiler-builtins/libm/src/math/support/float_traits.rs"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"6582dc2274ed3b7e88453bce089792f68a5e24dda453376dcd820e88c5d640dd"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(msrv): \u0060copysign\u0060 is available in \u0060core\u0060 starting with 1.85. \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":"library/compiler-builtins/libm/src/math/support/float_traits.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1f1cc22a1f0102a160a652ee97e4ca435bb08b97bac0bdf6dee6e6fc263e05e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(rust-lang/rust#115567): x87 use in \u0060is_snan\u0060 quiets the sNaN"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/compiler-builtins/libm/src/math/support/float_traits.rs"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"d96c9695b4c7eaa49edd78ff1f67a86c1be14024e2700b56fe06457b76bbbb48"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(rust-lang/rust#115567): x87 use in \u0060is_snan\u0060 quiets the sNaN"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/compiler-builtins/libm/src/math/support/float_traits.rs"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"6564d0c91a01d430d362a88fb55d5b55b108004ba61814db01b86087afd54f4e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: it is technically possible for exp to overflow if parsing a string with \u003E500M digits \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":"library/compiler-builtins/libm/src/math/support/hex_float.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"df040aafdb604b11844e4e97e377be076d9027e64d3a4e6106f795435ad18923"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: A value between the least normal and largest subnormal \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":"library/compiler-builtins/libm/src/math/support/hex_float.rs"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"54f7b4bbfecc481f88813d95052243a1d1ea6d3e3618bf9956beef94fdabe7f8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this test is causing failures that are likely UB on various platforms \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":"library/compiler-builtins/libm/src/math/support/hex_float.rs"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"49136bb357fa0ba6545bb2b2cc2621030201c458ea0018ca1958cbb61efca8c6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(rust-lang/rust#115567): calls quiet the sNaN"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/compiler-builtins/libm/src/math/support/hex_float.rs"},"region":{"startLine":1177}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e1ea2d8e6e5fb5fe31b178bf9e2def08a1f37eb99bfe928c08952010b0df5f8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(msrv) \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":"library/compiler-builtins/libm/src/math/support/macros.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b4b7e08986fc9b75a9e665be25320e136c26efbd4a7edb25fb16422a5433dd8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: these use paths that are a pretty fragile (\u0060super\u0060). We should figure out \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":"library/compiler-builtins/libm/src/math/support/macros.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"a027529afd7e089e313fa2032ad16b6c371ff54199ca177d5b0798352d507eb9"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // hack to get width from a value \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/compiler-builtins/libm/src/math/support/macros.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3ff79cab468e5208825bbc6a2f2282becc9348b6129c6174bd34b1f528282ef"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(msrv): \u0060div_ceil\u0060 is stable in 1.73. \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":"library/compiler-builtins/libm/src/math/support/mod.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"95ebae5546a644a12751f5a65d78230e342016a3201aa6de2d9a93a90fe95072"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(msrv): unbounded shifts are stable in 1.87 \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":"library/compiler-builtins/libm/src/math/support/mod.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"69fa40048174b69354a8093bef7834936ecb8ab3e38be1002e920be7002cfd10"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(f16): the fenv math does not work for \u0060f16\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":"library/compiler-builtins/libm/src/math/generic/sqrt.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"1637e45d6a5b297179685a53dc9b7ab3f85f143b057cb83a87ac88148fefcfd1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(msrv): Remove unsafe block around __cpuid once https://github.com/rust-lang/stdarch/pull/1935 is available in MSRV."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/compiler-builtins/libm/src/math/arch/x86/detect.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc5844a7b8643a0a0e2e62f7ca719cf78b53a9816298097efa2295021ea830bd"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: the \u0060select_implementation\u0060 macro should handle arch implementations that want \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":"library/compiler-builtins/libm/src/math/arch/x86/fma.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fde26dafc21109a4277c5e697f727d5a3e5e776c47a816cbdbd563569486537"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: this needs to be updated to work with compiler-builtins sources \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":"library/compiler-builtins/etc/update-api-list.py"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"58e6bc875c43554bf9aef76438dc1a7ed14673ea1ad53c55ba2b1d2dd00a41fd"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: we never build assembly versions since we have no good way 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":"library/compiler-builtins/crates/musl-math-sys/build.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4629780dbf308dde65f2a02a72c0d180c0d4dd6853bf893500656a88c2ecfdc"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: these need to be unsafe \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":"library/compiler-builtins/crates/musl-math-sys/src/lib.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ed84f54d3044b4f77a349d750a4e08f76b815326a47df15c200372cc27b9d03"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(llvm20): Older GCCs on A64 fail to build 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":"library/compiler-builtins/compiler-builtins/build.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c784916f0dbe8109e390e00f43ba0e323702d0b09c6e67de6540d42895ffc03"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(arm): The \u0060*4\u0060 and \u0060*8\u0060 variants should be defined as aliases. \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":"library/compiler-builtins/compiler-builtins/src/arm.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee5f1eafe8158f45f667534921955e2ddb86f5b5e002ee4a0aed81f86b98917a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(addr): if we can make this end-of-address-space safe without losing \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":"library/compiler-builtins/compiler-builtins/src/arm.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"4da0b17e95780d371f41e17b0088c90fecc01297dacbbbc14c9af4389710d485"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(addr): if we can make this end-of-address-space safe without losing \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":"library/compiler-builtins/compiler-builtins/src/arm.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"badd4b7ed94c320b57f572c91aa785c1f0f5d4ba2dcaa315095f73044a3f8bb6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Add missing attributes. \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":"library/compiler-builtins/compiler-builtins/src/macros.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"da45b8b8276349f53c8a2015141b3f80dbce8b31a64609acd2f8bc0f56386365"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK(https://github.com/rust-lang/rust/issues/62785): x86_64-unknown-uefi needs special LLVM \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/compiler-builtins/compiler-builtins/src/x86_64.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4cbbfd9644475c85cd98defe25123d46dafacdda856892d9c5c38f8152eb519"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(volatile): the third parameter is a volatile 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":"library/compiler-builtins/compiler-builtins/src/sync/arm_linux.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"f84bbdfdbb794572dc2ccffb031a2950ccf98136803d9fe465e3a0021e152f62"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: assert some of the preconditions in debug mode \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":"library/compiler-builtins/compiler-builtins/src/sync/arm_linux.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"811a7fb3bf787d2bdbe869ab05b7e768361a9aa5d74730b4bb9908aaee939fa2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(safety): preconditions review 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":"library/compiler-builtins/compiler-builtins/src/sync/arm_linux.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"e63d793dafceb98e0cee0760b4c9dcdfd5471ea0d569f83860933b238f3b66d2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(safety): preconditions review 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":"library/compiler-builtins/compiler-builtins/src/sync/arm_linux.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"1752737dc57843fb80ab92f27e218f8a408b995b9cbe38b54fc58c937f01ffa4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(e2024): this eventually needs to be removed. \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":"library/compiler-builtins/compiler-builtins/src/mem/mod.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"7952c8771d39fc9dac43a8391621a2f981eeb9f9aaff7d82f178bf8d04e1c4f1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(bench): remove when the benchmark rustc version is updated \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":"library/compiler-builtins/compiler-builtins/src/mem/mod.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5496935d7ccbca30d9ac70acb53f9e1e451b18205c93bc67cdc1ef51b410b83"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: when \u0060unsafe_block_in_unsafe_fn\u0060 is stabilized, remove this \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":"library/compiler-builtins/compiler-builtins/src/int/specialized_div_rem/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"face6a7e153abf14108c9371ff4963f0b65ee33c05b972992e013eef8de81099"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(tgross35): f128 seems to require one more half iteration than expected \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":"library/compiler-builtins/compiler-builtins/src/float/div.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba60f4f6ce412299ca203abf6c9cd9e3c9e435780e7f77a9e197be0e326086de"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME Is x_UQ0 still \u003E= 0.5? \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":"library/compiler-builtins/compiler-builtins/src/float/div.rs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"20b2915f44ff36d94cc2bd88341816b821aed34ed0696c3b4752b9677f019055"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(tgross35): calculate this programmatically \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":"library/compiler-builtins/compiler-builtins/src/float/div.rs"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a0ab89c486374e6ab6fafafcc9f5a63378e7ca7f0841f57353462bd5851c15e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(f16_f128): some PPC f128 \u003C-\u003E int conversion functions have the wrong names \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":"library/compiler-builtins/builtins-test-intrinsics/src/main.rs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"2af008e6aa0de2f2f890a83019376015a4c1fd79e4b72f12c842107aca4450a4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#802): This should be re-enabled once a workaround is found."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/compiler-builtins/builtins-test-intrinsics/src/main.rs"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"8be888b07e2b251d6cb24f2991a265dab7d353ca92552e313279b1d1fce6cc69"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We get different results from the builtin functions. See \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":"library/compiler-builtins/builtins-test/build.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bfa58429edbee9ef814abfba0a4a04571a62fa6ea1ee083ecdc6680bd853fc1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: 32-bit x86 has a bug in \u0060f128 -\u003E f16\u0060 system libraries \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":"library/compiler-builtins/builtins-test/build.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5397c663a6f86cd1792db6c536354de351ec7d6eee1281e9a42516d9a301c5e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(x86,ppc): the platform version has rounding bugs on i686 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":"library/compiler-builtins/builtins-test/tests/conv.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec75f26b2ef61f9e1b5a26fd389fd3c7187297908fc2f9bb8793bab162bbc751"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO how do we resolve this indeterminacy? \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":"library/compiler-builtins/builtins-test/tests/float_pow.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"48bc7d29464d6bfdcfd328f153f554a98ed686c49f002011ac3849679d8b1067"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(apfloat): We skip tests if system symbols aren\u0027t available rather \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":"library/compiler-builtins/builtins-test/tests/float_pow.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e51b58343d691f30e2f5567ca1db1d5f422d67d329d85e22b11e676b06ec3ab"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(i586): failure for powidf2 \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":"library/compiler-builtins/builtins-test/tests/float_pow.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4f9fc2423fc575a0902331ad09ad843022bd746aef28ce8b454209ff7987fdf"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(f16_f128): system symbols have incorrect results \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":"library/compiler-builtins/builtins-test/src/bench.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"c90920257c328ed35961eb8e9dcb6e01ae11269c95b1b1053f420bbb2b7c4437"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(f16_f128): system symbols have incorrect results \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":"library/compiler-builtins/builtins-test/src/bench.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa8665af557ff14ca07e246b723e54159fdfa9775a27ae0247ad386c969fae4f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(llvm): system symbols have incorrect results 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":"library/compiler-builtins/builtins-test/src/bench.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"6365385c7556dc8d0e4983fdc7aa6dfcc0eed515f7c351340b1dfb52a75a5356"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Our CmpResult used to be \u0060i32\u0060, but GCC/LLVM expect \u0060isize\u0060. on 64-bit platforms, \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":"library/compiler-builtins/builtins-test/benches/float_cmp.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"75d9ddbed42e960816d268863b765a048abf7e6733f7489334b4d1bca4c909a2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: rustfmt and tidy disagree about the correct formatting of this \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":"library/alloctests/tests/io/buffered.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"51ca03fc072e1cf8d6d739c96524de3387caccc19707a6aae133ad3e3b6ed70c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(inference): const bounds removed due to inference regressions found by crater; \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":"library/alloc/src/borrow.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"a83c847da11c376c3a70d8b1fb388564f1789db394ab47a5bfebf29ed78aab44"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(inference): const bounds removed due to inference regressions found by crater; \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":"library/alloc/src/borrow.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"848852fe1c9b2c6b3971d6829d80b0f73100392c35d8abadd76827071a48edde"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(inference): const bounds removed due to inference regressions found by crater; \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":"library/alloc/src/borrow.rs"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"5434a4c2e2f140cfca0387aadf9eceaec4e629d528363d2dbf59a76e823c2d52"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: the function can be simplified again when #48994 is closed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/alloc/src/string.rs"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"c45426092ee5d5db1c7d23fb18a462b2e90aad3b70ce1d5f9f2f7b21c1ceb1a3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const-hack): use unreachable! once that works in 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":"library/alloc/src/vec/in_place_collect.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff5fef431ffa93c0dde0cedd1bffd93b8d7e397944bd5b03fc77a896dc7097cf"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(fee1-dead): temporary measure before rustfmt is bumped \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":"library/alloc/src/vec/mod.rs"},"region":{"startLine":880}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bc1ac5125cf7f395f9e4e8fa90ef68996b4269b3064b88faae5c2b395d1fd25"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(fee1-dead): temporary measure before rustfmt is bumped \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":"library/alloc/src/raw_vec/mod.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5c89f1bcdfb10a2fc44b86d83113494c352fbf689717ba191dcabc20a91b4c1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(fee1-dead): temporary measure before rustfmt is bumped \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":"library/alloc/src/raw_vec/mod.rs"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"7540994b7a5272a1773796fbde43a833f3f2829747576d5aa992ac68fe6a76d8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// #   // FIXME(https://github.com/rust-lang/miri/issues/3670):"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/alloc/src/vec/mod.rs"},"region":{"startLine":2126}}}],"partialFingerprints":{"codehealthFindingId/v1":"13b2f592d3480e95762e5ea7433447d681ec7adab3865a3d068b8158d6a4644f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const-hack, 146097): compare \u0060Layout\u0060s \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":"library/alloc/src/vec/mod.rs"},"region":{"startLine":3574}}}],"partialFingerprints":{"codehealthFindingId/v1":"3341603703fa970e1e7d65deb7f1c25427624039e00491e1d6a884f6dd6292d6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(Centril): Reconsider this? \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":"library/alloc/src/vec/partial_eq.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"65ffcc952e4f1f4156495050e6370e77f4dee46d3e5445ebf1b9fa025c14fe99"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Is the upper bound a better guess? Or something else? \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":"library/alloc/src/vec/splice.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa81c8a03f5bfd484f69bad2c63dafbd6e476767e0782dc9697720d9410d7c45"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Is the upper bound a better guess? Or something else? \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":"library/alloc/src/collections/vec_deque/splice.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"61f9beab098fe2089280eb46c7fdc0de704e8aab3e737f917f96aec417abc7c9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: When stabilizing this parameter, the \u0060AllocatorNightly\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":"library/alloc/src/rcs/arc.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"e95e2b030e7df7b9b770ebd900f6fabfbba40ed47565c5fa843951893b22a516"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: When stabilizing this parameter, the \u0060AllocatorNightly\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":"library/alloc/src/rcs/rc.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"640c925498d9b4fc5e8afaf14bb663a7f52f660e578088037085e0b4d05d2331"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // Hack to allow specializing on \u0060Eq\u0060 even though \u0060Eq\u0060 has a method. \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/alloc/src/rcs/rc.rs"},"region":{"startLine":2782}}}],"partialFingerprints":{"codehealthFindingId/v1":"99c473bce7f2b64826c4ae97609565a1e7b8e60fbbee047d8b85051f255ba9cf"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Consider moving these impls to \u0060RawVec\u0060, once #162850 is resolved."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/alloc/src/raw_vec/mod.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbacd440a040d9a61e5a2f4c6cb263977a53f59f83f9cc829cb9f0ea7df99361"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const-hack): switch to \u0060debug_assert_eq\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":"library/alloc/src/raw_vec/mod.rs"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"3575406b7f1865a16cac1579b93dec49ff37d7d355f055166f44052fdfe788c2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#74481): Hard-links required to link from \u0060alloc\u0060 to \u0060std\u0060"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/alloc/src/io/copy.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"07aa73e346c7cd65a453b1d7e1b9c8333ffbeff1c6ea3b395b6fa849f049e874"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#74481): Hard-links required to link from \u0060alloc\u0060 to \u0060std\u0060"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/alloc/src/io/buffered/bufreader.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"53a578b36cead888bd5c10833d97ce6222af4290af2878ec63f01df61f33148a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#74481): Hard-links required to link from \u0060alloc\u0060 to \u0060std\u0060"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/alloc/src/io/buffered/bufwriter.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7d1ac52c40278cce3e310657a37f2b8e41f117ac3bbc10b09ecbc3f0baf45ee"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#74481): Hard-links required to link from \u0060alloc\u0060 to \u0060std\u0060 for incoherent method"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/alloc/src/io/error.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dcc55aff3666e581ae69d52f5f75a094d983204b8a5b8a17589a9965ee72624"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#74481): Hard-links required to link from \u0060alloc\u0060 to \u0060std\u0060 for incoherent method"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/alloc/src/io/error.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4d9e7aca780489f9928718299ec138eefe0da666e3b65055546a6ea089c807a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#74481): Hard-links required to link from \u0060alloc\u0060 to \u0060std\u0060 for incoherent method"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/alloc/src/io/error.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a00bc8a392225086961ada74ba8e4864ea62df3b1f1a9f05ef7c2da15cad1f8"}},{"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":"library/alloc/src/io/error.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb189f9f36937b01da9b85cb733e7e6c0c6a1f00592ab054fd9671866d41265b"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // Hack: this relies on \u0060impl Read for BufReader\u0060 always calling fill_buf \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/alloc/src/io/copy/generic.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b8e4922dc4e5f50b33785318b228b400cd90c20cc29d98d127602b73fb086c6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Consider applying \u0060#[inline]\u0060 / \u0060#[inline(never)]\u0060 optimizations already applied \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":"library/alloc/src/io/buffered/bufwriter.rs"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"e397d824ab92bb523f2cce9eae027c357ac90f87fa0f4b25ae894bc52b5548ac"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: For some reason, \u0060#[cfg(doc)]\u0060 wasn\u0027t sufficient, resulting 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":"library/alloc/src/collections/vec_deque/mod.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"7948b8be7fcad1880cb8024be673676bd99f37e3a77ba80c1646121571bfb2cf"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const-hack): This should just be \u0060VecDeque::new_in(Global)\u0060 once that hits stable. \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":"library/alloc/src/collections/vec_deque/mod.rs"},"region":{"startLine":852}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5fa77d1789b9f80d49c873ddc5368d0b6b7b0c981ac9760b5c707692d61f34e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: should \u0060from_arbitrary_number\u0060 be unsafe? its docs imply so... \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":"library/alloc/src/collections/vec_deque/mod.rs"},"region":{"startLine":3695}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b359cfdbedbe547c971549451ffbebe4550d9572b7f71d69da2730eec8070f1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This implementation is \u0022wrong\u0022, but changing it would be a breaking 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":"library/alloc/src/collections/btree/map.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"a87778089ece075948a9a3515ab65ff4b5532c61bc770c0ab3df31c780a11384"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Once \u0060MaybeDangling\u0060 is implemented, we can optimize \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":"library/alloc/src/collections/btree/map.rs"},"region":{"startLine":1333}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d690b0f75c826719e5715eb0eadc19358f8622803779593303741ed70aba082"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Once \u0060MaybeDangling\u0060 is implemented, we can optimize \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":"library/alloc/src/collections/btree/map.rs"},"region":{"startLine":1369}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3278b6bc902bdd316eb7ca75020f2ee9230613f538b97baa50eb8bc6e017303"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: instead of doing a linear search 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":"library/alloc/src/collections/btree/map.rs"},"region":{"startLine":1390}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ef03bc6417c0f8bd4492c515182a896478c1b40d83b7652636f27532fcc97c8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: If we get here, that means all of other\u0027s keys are greater than \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":"library/alloc/src/collections/btree/map.rs"},"region":{"startLine":1399}}}],"partialFingerprints":{"codehealthFindingId/v1":"57e03f12b8839386bf6dda2f3dee6599db4722690940d8c14edf405c46907aa8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(@gereeter) consider adding yet another type parameter to \u0060NodeRef\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":"library/alloc/src/collections/btree/node.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"f991cb39e502ec1a6121ec81f328f5a4af2853334785be846ad196f6ecd0b43e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: 2 * hole.pos() \u002B 1 or 2 * hole.pos() \u002B 2 could overflow \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":"library/alloc/src/collections/binary_heap/mod.rs"},"region":{"startLine":850}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fa05480ac80e195d254a64eb2e192c7183a247cfec049a387f3164171310aeb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: 2 * hole.pos() \u002B 1 or 2 * hole.pos() \u002B 2 could overflow \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":"library/alloc/src/collections/binary_heap/mod.rs"},"region":{"startLine":910}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f656b689ae996c8103270949a6ae1bbda1ea41e153ff4db7c7de2f9dc0bb7ea"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: make a more efficient implementation (without the need to store capacity) \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":"library/alloc/src/boxed/iter.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"89aa951fc762e0ee0953f70ccd89a1bc7647704dc635429c171965f6282b79de"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: just call \u0060WithHeader::alloc_layout\u0060 with size reset to 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":"library/alloc/src/boxed/thin.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"500b7bb3af11027710a0eae474db2b66c5738b991d5b6b2f294f0b9f61d34c34"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(154045): Recommended as per https://github.com/rust-lang/rust/issues/154045, this is so sad :(("},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_type_ir/src/binder.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"30f0a7d1a46b5360ac90779904067a2e5844c7b51cad2b0feef485f71b05e366"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#155345): In case the bound value was already normalized, this"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_type_ir/src/binder.rs"},"region":{"startLine":680}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3c963d91ff50ac873d4b526e10e766946025ef64a3a9d91aaa40e09a419ba9a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME(inherent_associated_types): This ideally ought be a list of candidate DefIds that 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":"compiler/rustc_type_ir/src/const_kind.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"16d55c36fbc8a3825458c73bb9715e0c915107ca1fb3d46d3ccf98d7dd28d837"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(@lcnr): This treats aliases as rigid. This is only correct if 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":"compiler/rustc_type_ir/src/fast_reject.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9ccf138975821f274429f4cb1344ca0dd4edd44d9ee907ca36bd98cd501aa6d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment repeated across 58 files: The identical FixmeComment appears in 58 files (89 occurrences) \u2014 almost certainly one boilerplate line from a single migration or decision, not 89 independent debts. Fix the systemic cause once rather than file-by-file. Text: \u0022// FIXME(scrabsha)\u0022. Source code is not a task system: track the cleanup where tasks live. (Every occurrence still counts toward the score and metrics.)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_type_ir/src/fast_reject.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"28f18c1cbfe14097ff8c1e7b76e4381f9218c4791fcbe4998bc109751370623e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(pattern_types): take pattern into account \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":"compiler/rustc_type_ir/src/fast_reject.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"47fdd7bf951bfb663836941cea323552a8f873b9b9131a42cb123b606ea87683"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: This will be removed because it\u0027s generally not correct to define \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":"compiler/rustc_type_ir/src/infer_ctxt.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"b67659e16c769ef24263a50e85be21ec578d8e61ae7c446e054b500e9437e896"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME(-Zassumptions-on-binders): Any usage of this method is likely wrong \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":"compiler/rustc_type_ir/src/infer_ctxt.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"35d1ee303aaaf4a2cf1dc33a824bc322dcc4967c316d0e60d4a32e5a4ba6330a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: perhaps use \u0060all_fields\u0060 and expose \u0060FieldDef\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":"compiler/rustc_type_ir/src/inherent.rs"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ba914fd5d330d50badfb7a216892370f86851400b60c9a75396f898dc244fa6"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK(eddyb) ignore lifetimes found shallowly in \u0060args\u0060. \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_type_ir/src/outlives.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddf8b7ee959806590b90323c13431586b3da1f40323547db1b9d677a44cfdf9a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Bound vars matter 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":"compiler/rustc_type_ir/src/outlives.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1a2ad44e33089d8a0dcb91fc85ec9214fdb07f7a83200351fad09ae4a476e45"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: asking for _cx here is useful down the line. \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":"compiler/rustc_type_ir/src/param_env.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"58f6393104655b608371d016745019cad1c1a92f6d0261f951efda7823d1b35d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(-Zassumptions-on-binders): probably bad for perf, doing a lot of reallocating \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":"compiler/rustc_type_ir/src/region_constraint.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba35e7cb9c7cd6222b546a7a4e2cbc2108703be56f92b856fc63bd6e0a145daa"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(-Zassumptions-on-binders): probably bad for perf! \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":"compiler/rustc_type_ir/src/region_constraint.rs"},"region":{"startLine":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb22bc230ccd34208e8e6c4d7b0a2f6e6d03e4ccf939e249817920f21c167d39"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(-Zassumptions-on-binders): we don\u0027t lower universes of region variables when exiting \u0060u\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":"compiler/rustc_type_ir/src/region_constraint.rs"},"region":{"startLine":805}}}],"partialFingerprints":{"codehealthFindingId/v1":"844ceb0ddf787958ed0d96956376179a6a64c93a1845b8e9a99a6bf1882f14b0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(-Zassumptions-on-binders): if \u0060region_2\u0060 is in a smaller universe there\u0027ll be both \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":"compiler/rustc_type_ir/src/region_constraint.rs"},"region":{"startLine":844}}}],"partialFingerprints":{"codehealthFindingId/v1":"56c8d776aedf24d8413dd64bc27cdc9585d415639e9c649b02c79b19cf4b5d83"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(-Zassumptions-on-binders): \u0027static may have been an input region canonicalized to something else is that important? \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":"compiler/rustc_type_ir/src/region_constraint.rs"},"region":{"startLine":1177}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1cb66ac140ccd1730e68cee560ad6a71b04f8df9fd4974d4d9b4218a0c2c352"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(-Zassumptions-on-binders): do we need to adding the reflexive edge 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":"compiler/rustc_type_ir/src/region_constraint.rs"},"region":{"startLine":1178}}}],"partialFingerprints":{"codehealthFindingId/v1":"b200b543b0e9cb57cdd60a43d2df561b6047782fff7d9324dbe9f263e9c62b74"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#155345): Both sides should be rigid in the future."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_type_ir/src/region_constraint.rs"},"region":{"startLine":1282}}}],"partialFingerprints":{"codehealthFindingId/v1":"03d8d23a508b990201bf8b06e5adc801f7c0a21f0121d67546fa471a12ae4ddd"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(-Zassumptions-on-binders): bivariance is important for opaque type args so \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":"compiler/rustc_type_ir/src/region_constraint.rs"},"region":{"startLine":1340}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a62fc9fbfaf469ab3e4ce370602cb178f88aace7240f277cb8b1ed5dc4dea4c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We can probably try to reuse \u0060a_args\u0060 here if it 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":"compiler/rustc_type_ir/src/relate.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"450b2620fb9cdb0c2f82f61d8de811e2792e6d2d8b4f7dac8c0bf7d8c068f7c9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(mgca): remove this \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":"compiler/rustc_type_ir/src/relate.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"91028f6c6b2a919609d23373b3d3cd7ac7c258558ec91439b6a065c3daa57ce2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Put this back \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":"compiler/rustc_type_ir/src/relate.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"227f002987dc8eebabbfcc1d6c7f6dccc1c56b9bcbfe721d2fdd981f89906614"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Put this back \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":"compiler/rustc_type_ir/src/relate.rs"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd0aa2106845be96e6ad3589503b6077444944caf954e68706929f1e0fa626a0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this behavior is wrong; relations with binders needs fixing. \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":"compiler/rustc_type_ir/src/relate.rs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d69f8a4146fc5ce48674fed9c662468b04b880ae0bd6b293fb587111764e76f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: This is not totally structural, which probably should be fixed. \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":"compiler/rustc_type_ir/src/relate.rs"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb1e38f28b22cfa2acc13126ce04ecd2429c0fb00e8a7683e178169392436d4a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Replace by an impl on Alias\u003CProjectionAliasTermKind\u003E \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":"compiler/rustc_type_ir/src/term_kind.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"4154a349061891eb89bff1a576c0f8ada4de5a5f4336a295f2c1892fc224ba4d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Replace by an impl on Alias\u003CInherentAliasTermKind\u003E \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":"compiler/rustc_type_ir/src/term_kind.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"16d2988e2bf8b069486696799ddb30da0c9cffce333d3fa923012ef4c4356cea"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Replace by an impl on Alias\u003CFreeAliasTermKind\u003E \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":"compiler/rustc_type_ir/src/term_kind.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"015af72591a4a32ff0fbdae433e4146a3b3642b52785be088d73c6ef4cd688e3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME(#155345): Alias handling is currently still in flux for the new trait"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_type_ir/src/ty_kind.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebe7452d46a42a3adcce458825afa278177db1966eaedb72b85dc1e534ca3fbe"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(unsafe_binder): print this like \u0060unsafe\u003C\u0027a\u003E T\u003C\u0027a\u003E\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":"compiler/rustc_type_ir/src/ty_kind.rs"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fa7c947003267b000378584a3ae878e654132cc62cda1d27364033596cfa328"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Migrate these to the impl on ProjectionAliasTy (by making callers use \u0060try_to_projection\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":"compiler/rustc_type_ir/src/ty_kind.rs"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c1e8c5f3aae066c751fcfda08b7afa7a325fc550e6bfc30fef787fe63045a6c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this is a distinct type because we need to define \u0060Encode\u0060/\u0060Decode\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":"compiler/rustc_type_ir/src/ty_kind.rs"},"region":{"startLine":1321}}}],"partialFingerprints":{"codehealthFindingId/v1":"61ac5fc2c1669b2851eac93ccc1f296fb6bf33e0cfd9151c10794a42a47464c6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: make this a debug_assert and let callers resolve vars. Then the input only needs 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":"compiler/rustc_type_ir/src/universe.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"2064e48c4ef87855795f126a8aafc44f448bea9f75055415930426bb6058df16"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME(#155345): This is very WIP. The plan is to replace the \u0060skip_norm_wip\u0060"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_type_ir/src/unnormalized.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5f60fba839b6156003ac71fd4f0eb2fb29d900d4d3ffe322b5f1fc3a42a0e0c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: This is going to be eventually removed once we migrate the relevant \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":"compiler/rustc_type_ir/src/unnormalized.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"be5b1ebcd3e3c4b6987705219efe426aac9f25d4342ce17867eff7213dd85711"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: This is going to be eventually removed. \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":"compiler/rustc_type_ir/src/unnormalized.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9cf81e457a77aa3eae6c885c2376067dd5bf8120f1c4d71d7660840c8f201d1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Optimize for checking for infer 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":"compiler/rustc_type_ir/src/visit.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"921c509bf1e508975331f8ea95e225123ef5142ce1fc3c6731828b87e0891565"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(eddyb) this should be unnecessary, as the shallowly resolved \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":"compiler/rustc_type_ir/src/ty_kind/closure.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"8425b56237c6be0f2ff46d57d8375d58e47eceaf93f3dcfb4c3fde0ac6bf1d75"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Could be optimized to not walk into components with no escaping bound vars. \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":"compiler/rustc_type_ir/src/ty_kind/closure.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f43b26823a70ee88227aa8d1db0622f012d6b838b3b6235d166ba656173a5f0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(async_closures): Get rid of this in favor of \u0060BoundVarReplacerDelegate\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":"compiler/rustc_type_ir/src/ty_kind/closure.rs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e50f685cb8b0b7567ad89b981b1c2f4181e1d43e8fa3a1bd53c758ba67fd06d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME this should be made private and instead accessed via 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":"compiler/rustc_type_ir/src/sty/mod.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f5b1b96b05aec21f2f9899e0705a472abee4de1a763e8a0b9879e1879b0dc32"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: We use a different type than the existing canonical queries. This is because \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":"compiler/rustc_type_ir/src/solve/mod.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"17a7659356d23da4a8b1de7af0e091a0ac78acb1b3d1179247de279a3564ccf3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME(-Znext-solver=coinductive): This will also matter in the future 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":"compiler/rustc_type_ir/src/solve/mod.rs"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"dca530cc025d1024b24fb82b0e2869648d2eaa0ff6c964899d1e7e70811cfe8c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Merge this with the forced ambiguity candidates, so those don\u0027t use \u0060Misc\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":"compiler/rustc_type_ir/src/solve/mod.rs"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"3940678ce3bf3741e3261dae35d4f945b94e2a9bcf30715f1a3728e4d679724c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(-Znext-solver=no): The new solver does not need this index, remove! \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":"compiler/rustc_type_ir/src/solve/mod.rs"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba943e8aa837ec0ceec3967e72d55da08d112362ec22df3751f48625c0f5041b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(-Znext-solver=no): The new solver does not need this index, remove! \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":"compiler/rustc_type_ir/src/solve/mod.rs"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b536c2b50d1e59ce4883b54d08801af81321183579bef6dcae490728aabfaea"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We should assert that region constraints match when both results \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":"compiler/rustc_type_ir/src/search_graph/mod.rs"},"region":{"startLine":1402}}}],"partialFingerprints":{"codehealthFindingId/v1":"478bf00f0abdf3aff777d01373c250373a60b507e007959007fd051f80e74731"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(async_closures): This shouldn\u0027t be needed, and we should be populating \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":"compiler/rustc_ty_utils/src/abi.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"8710ce310382dd98e1a0f0b1b27275866ffea1d451f39a6082bd0a15993b349a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME return false for tls shim \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":"compiler/rustc_ty_utils/src/abi.rs"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"4780ad205ab418d5ef0e1fe9f80b4cce7fe16c173b8a0a8ebc3922a547b65f7f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME (mikeyhew) change this to use \u0026own if it is ever added to the language \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":"compiler/rustc_ty_utils/src/abi.rs"},"region":{"startLine":703}}}],"partialFingerprints":{"codehealthFindingId/v1":"3678f95e0f471b2b32b78381ff3157f5cd63febcd9a5dae2a2795ca6553262fd"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This may be detrimental to diagnostics, as we resolve the early-bound vars \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":"compiler/rustc_ty_utils/src/assoc.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"99496779d34a4729d6bd4f1048c8b19eb9d560831f0ef3b482af0b73ab4d0474"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(generic_const_exprs): Verify/explain why this is sound \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":"compiler/rustc_ty_utils/src/consts.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"447d6b7099f081fcd5f125dd883a942df63856126a228878a5330a3c657625eb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(generic_const_exprs): We may want to support these. \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":"compiler/rustc_ty_utils/src/consts.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"904c2dfa99180933b7e5be735b1a5ade9d94eedb67b02d96ebc717ba7ebdde3b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(explicit_tail_calls): maybe get \u0060become\u0060 a new 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":"compiler/rustc_ty_utils/src/consts.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"37af1f3a84d2d52bdae24506ec864666268fd807e775eaa46b3d99f120b2c039"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(generic_const_exprs): We currently only do this for anonymous constants, \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":"compiler/rustc_ty_utils/src/consts.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"23d32369bd34b1251868957ce57ff8fd89237aca9fb90ffe71eae923ece6aa84"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This could use a real folder, I guess. \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":"compiler/rustc_ty_utils/src/implied_bounds.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"a725b22918f9b535cd6386076a3d6b7e17af31801e5e506460f8721d996f1628"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: sync drop of coroutine with async drop (generate both versions?) \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":"compiler/rustc_ty_utils/src/instance.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e2b65a9851fbcc446499d9d950dbc8b1bd6db13b7971ba91cf72a4e95d38448"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: We may have overlapping \u0060dyn Trait\u0060 built-in impls and \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ty_utils/src/instance.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"074c49d9759196a33384563aea973cd23c72505c361791b65d3b1a102cf47ef4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This doesn\u0027t check for malformed libcore that defines, e.g., \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":"compiler/rustc_ty_utils/src/instance.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"a318a05201b404a4e55f8dfb30a3e0c2d9a06a3eee4208bbacdead6e0e999818"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We might want to have two different versions of \u0060layout_of\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":"compiler/rustc_ty_utils/src/layout.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"82ab647cd0d0ed3e5df95499a38c5888fcd07267560cbad999f74b4a0ed4a230"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: /// HACK: in order to not mistakenly assume that \u0060[PhantomData\u003CT\u003E; N]\u0060 requires drop glue \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ty_utils/src/needs_drop.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a7c756d46dc9dd59a33dc0c12ccd9840ae35b5b4f175bd902bea44ecc9accd9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Calling this bool \u0060exhaustive\u0060 is confusing and possibly a footgun, \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":"compiler/rustc_ty_utils/src/needs_drop.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d8d42bddb247fbc6d8eebc9b8b181fb43fa6c7910977da83dc1731fa1b2163e"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: Because we erase regions contained in the coroutine witness, we \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ty_utils/src/needs_drop.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9e6b3a0a2e84433452847eb544031a41cfa5f7d8011c0b6d54c72e04aff6b42"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: See FIXME on \u0060exhaustive\u0060 field above. \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":"compiler/rustc_ty_utils/src/needs_drop.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"fda481b1565d9f173c20ebe6dbe3f4e882b5ae8ac8666a984c27666cc7299efe"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(async_drop): boxed dyn pointees are deliberately skipped 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":"compiler/rustc_ty_utils/src/needs_drop.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fad23395a402357181cc1e65b8e28642d395a11f5cf24310df3fd68696d0a44"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: implement higher kinded lifetime bounds on nested opaque types. They are not \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ty_utils/src/opaque_types.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8408b75c2cd86d683625eada0f330337015a4e0415a47be40e07a40ea072c5b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(type_alias_impl_trait): can we require mentioning nested type aliases explicitly? \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":"compiler/rustc_ty_utils/src/opaque_types.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"94c863f64e7f3a0be1f8fd049db955e785ed739970b31d16ffc6b2946e90c2b8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: ambiguity is just ignored. \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":"compiler/rustc_ty_utils/src/ty.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"0628817a8a8042b4aac1499b45033b20e3b6608a9e3e809cd3a015a0bc81af94"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#124403): Once \u0060repr_c_enums_larger_than_int\u0060 is a hard error, we could assert"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ty_utils/src/layout/invariant.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"c30c541e6fad760a352e86b17d4475c525b68cec7f684b2fbc904a5079fb6765"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(RalfJung): I don\u0027t think it would be correct to do any checks for \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":"compiler/rustc_ty_utils/src/layout/invariant.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"4864f3b4b940980ab6211e75010fb369d5c2dcf4823ac5f141818656f3ead9b4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: I guess we could also check something here? Like, look at all fields? \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":"compiler/rustc_ty_utils/src/layout/invariant.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ec5fa2de140fa6b01ecbf685422b5ca59c96e3ea0d6f06c6c9f92b21eb0dcb1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: I guess we could also check something here? Like, look at all fields? \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":"compiler/rustc_ty_utils/src/layout/invariant.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"d60d52ba5ea615921f92cf70a633ca4f7d6c04545fd2b2bf0c2c1e6021545bb2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: ScalarPair for enums is enormously complicated and it is very hard \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":"compiler/rustc_ty_utils/src/layout/invariant.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"84fea8db815c4d73a0566cc6999c351fc4d362e188f39b9d1c81135d918871d7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(jswrenn) we\u0027d likely benefit from specializing try_fold 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":"compiler/rustc_transmute/src/layout/dfa.rs"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"051eb6708ce27c2d53fdd46b0287664729e448b998c2efbfd700629e3709208a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: The assumptions are only used in the old solver when \u0060-Zhigher-ranked-assumptions\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":"compiler/rustc_traits/src/coroutine_witnesses.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ca9c3a5a25023224ce65fbbccc0bf840005e85febfe53d5a3c3ab93a2af21ec"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(higher_ranked_auto): We probably should deeply resolve these 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":"compiler/rustc_traits/src/coroutine_witnesses.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c668914405e31260762c2e885c488b95a9f24350d666444ab7e8122b1fe739c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: there is really no reason for \u0060Generic{Type,Const}Suggestion\u0060 to be separate \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":"compiler/rustc_trait_selection/src/diagnostics.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"98e32c64044b9546d12078cb946ea96e638346504a84990dda635efeb2816384"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this really should be handled at some earlier stage. Our \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":"compiler/rustc_trait_selection/src/diagnostics.rs"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"7da3ff6f7bcb797a2832afde90727650cab9d1bfb413ea6269d3e0dd943fafbd"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#100717): replace with a \u0060Option\u003CSpan\u003E\u0060 when subdiagnostic supports that"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/diagnostics.rs"},"region":{"startLine":804}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f05c29625282010a0010c6fedddb3771e15b10ab5a5f5d0519022093e3e4a03"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This is a bit too conservative, since it ignores parens already written in AST. \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":"compiler/rustc_trait_selection/src/diagnostics.rs"},"region":{"startLine":2057}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e0f7bbe935a44747440c505cf66b1fc81a6351243413087fad4880c217ce171"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: RPITs are not allowed to be nested in \u0060impl Fn() -\u003E ...\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":"compiler/rustc_trait_selection/src/diagnostics.rs"},"region":{"startLine":2071}}}],"partialFingerprints":{"codehealthFindingId/v1":"958f39631f476b8ca924df4a4c07001f81a7e1fdd28c5e3857c322f505e4703e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#132279): It feels wrong to use \u0060non_body_analysis\u0060 here given that we\u0027re"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/opaque_types.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"055b0265285b18c35b076e885bbe60bbdd395e4d04e4889f270eea49030bd85b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(-Znext-trait-solver): Normalize these. \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":"compiler/rustc_trait_selection/src/regions.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b6279e3108c98ec880699f2e4e680145708e0cbce9ff17b3ac8b045e0212363"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This needs to be modified so that we normalize the known type \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":"compiler/rustc_trait_selection/src/regions.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"3851be67d61dc457e6f5c05520ab43da9173bac0c24a496740b821df1682b7e2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME(#155345): this can probably be moved back to \u0060rustc_infer\u0060 now that normalization is"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/regions.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"6686c38c6588ff2ba307198bf0850225d2ec8b9e203fcc267b4c14b161433baf"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(twk): this is obviously not nice to duplicate like that \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":"compiler/rustc_trait_selection/src/traits/auto_trait.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a05dc70f61d6e64221073748509893e1da9615cb8c0d1e8daf254cf918499cd"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(-Zassumptions-on-binders): Handle solver_data \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":"compiler/rustc_trait_selection/src/traits/auto_trait.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fedb2a31689a4e02d1873ad7e2cab7a29c70d2fa64c2d7732a08ba80a4f80b4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(-Zassumptions-on-binders): Handle solver_data \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":"compiler/rustc_trait_selection/src/traits/coherence.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8ed673a375c89d3b554aaab1121dd497fb7baa30ce944de70675a78f5671c3d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(-Zassumptions-on-binders): Handle solver_data \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":"compiler/rustc_infer/src/infer/mod.rs"},"region":{"startLine":1106}}}],"partialFingerprints":{"codehealthFindingId/v1":"b58cfa8b72ad34c740a55e3399ba959c192a154519fc0b0a6f0d65fcc812e1b2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(-Zassumptions-on-binders): Handle solver_data \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":"compiler/rustc_infer/src/infer/region_constraints/mod.rs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"761f260de8750637b417a1d36b10977f2c7d07b9d7ad2644b91364e49ec4cb5a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(-Zassumptions-on-binders): Handle solver_data \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":"compiler/rustc_infer/src/infer/outlives/mod.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"70097ca33073e3fc2a4bf8cc15a49ae254feb37cb6543a59c1e411f881a6fd79"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(generic_const_exprs): you can absolutely add this as a where clauses \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":"compiler/rustc_trait_selection/src/traits/auto_trait.rs"},"region":{"startLine":922}}}],"partialFingerprints":{"codehealthFindingId/v1":"52fc4562abe471aa6c7f1f90f088ac05be6c8b10482dee82d8f4cf061e1de878"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(with_negative_coherence): the infcx has constraints from equating \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":"compiler/rustc_trait_selection/src/traits/coherence.rs"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"25cecb9a3467fb5e79ecd2f00cb00eab23117648f529f6662f06d52e6d9bacdb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#132279): \u0060TypingMode::non_body_analysis\u0060 is a bit questionable here as it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/traits/coherence.rs"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"37d494b7c510eeae8ca92eec2b5b79fdf4d933bdb523efbbbddc115d21e6e338"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We could use the assumed_wf_types from both impls, I think, \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":"compiler/rustc_trait_selection/src/traits/coherence.rs"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"f94cba430c084336652add89ca58a429dc150165091232d00625931f417d43ab"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#132279): Forking with \u0060TypingMode::non_body_analysis\u0060 is a bit questionable"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/traits/coherence.rs"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"c65ab7e5b65d275335d30c1f3d769bf507e405122cb91d5f9e244fb87ddcff27"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(generic_const_exprs): we have a fully concrete \u0060ConstKind::Expr\u0060, 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":"compiler/rustc_trait_selection/src/traits/const_evaluatable.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"81f24dc365490ac85067a51e714c75cb29cb07723d1ae3fe44670444ca667c8f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(generic_const_exprs): This doesn\u0027t recurse into \u0060\u003CT as Trait\u003CU\u003E\u003E::ASSOC\u0060\u0027s args. \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":"compiler/rustc_trait_selection/src/traits/const_evaluatable.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"10f611b6cea29025023562e700ecb035beb76b751d314002ca56f8e965073f6f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(generic_const_exprs): this can mention \u0060Self\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":"compiler/rustc_trait_selection/src/traits/dyn_compatibility.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"70dfacf6b114c98949d514b72473e2a2f59b4b599e8e5446470d1a8f53326a0b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(mikeyhew) get rid of this \u0060if\u0060 statement once \u0060receiver_is_dispatchable\u0060 allows \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":"compiler/rustc_trait_selection/src/traits/dyn_compatibility.rs"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccd0c2c5b4d194163dd3ba465c4aa8390c580f52727c16e770942560283affb1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(mikeyhew) when unsized receivers are implemented as part of unsized rvalues, add this \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":"compiler/rustc_trait_selection/src/traits/dyn_compatibility.rs"},"region":{"startLine":689}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6ffa1fb5aa96deefe4c992b68a7b4e4b198fa2552783acd5c76fbf2a43654cb"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: This relies on param-env normalization jank. We don\u0027t normalize the left-hand side \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/traits/dyn_compatibility.rs"},"region":{"startLine":778}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2fb78341af378a89db489e3c00273ab5d4841916a38ba3813c50eb4cc735c68"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(unsafe_binders): Unsafe binders could implement \u0060[const] Drop\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":"compiler/rustc_trait_selection/src/traits/effects.rs"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d96f2e3b4f060641e8f36cb4c8ffad898c8ca5c41c87dd011a29d3f1b95119d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(unsafe_binders): Unsafe binders could implement \u0060[const] Drop\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":"compiler/rustc_next_trait_solver/src/solve/assembly/structural_traits.rs"},"region":{"startLine":856}}}],"partialFingerprints":{"codehealthFindingId/v1":"db9077ee9c8b9d9dadd6410ca7245aa1e15c378edcf2d2e1b92f54f7cc5dd0f8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(comptime) \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":"compiler/rustc_trait_selection/src/traits/effects.rs"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c846fa12009952cc91d23aa88cef65dc49df7b00cc92fb752e3b098ed74c3b1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(comptime): just bailing for now to avoid an ICE in a test. \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":"compiler/rustc_trait_selection/src/traits/effects.rs"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d28dc222e47942cde5a91aa83fa4e2f97ca40c69f8cb3f79ef951cda7d4473d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(@lcnr): rustc currently does not check wf for 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":"compiler/rustc_trait_selection/src/traits/engine.rs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"05833ee01f81dfc1972ad94f43af47d63630554c7eacf6f6ef5bcd12e393fe1d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: if we kept the original cache key, we could mark projection \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":"compiler/rustc_trait_selection/src/traits/fulfill.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"646da480d4818288badfe9f6390ac67387fcb9f1bf6175929ae58f61c5614e1d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const_trait_impl): We may need to do this using the higher-ranked \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":"compiler/rustc_trait_selection/src/traits/fulfill.rs"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"04017f93a395c26873a0afdff031cc2fd7c0dcdce1b1ec48cde3a2131c72dc97"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(generic_const_exprs): we should construct an alias like \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":"compiler/rustc_trait_selection/src/traits/fulfill.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"988e55855e13bcee4f07155b700cbadfd330f2d808d11e71fd775afeb690549b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: we probably should only try to unify abstract constants \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":"compiler/rustc_trait_selection/src/traits/fulfill.rs"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"a824b51b59e4aee7bc000ae90b1a997ef3149aa0b3b4840ba5d3c5fd30632c0c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: consider caching errors too. \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":"compiler/rustc_trait_selection/src/traits/fulfill.rs"},"region":{"startLine":880}}}],"partialFingerprints":{"codehealthFindingId/v1":"460ec04b673533aee6963b29a3314543091ec2a0e087ef8d22571d2c8f41fb2f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: consider caching errors too. \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":"compiler/rustc_trait_selection/src/traits/fulfill.rs"},"region":{"startLine":936}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a495f39d3d0bd1053098dcfe662f9c488ab690c5811c0c72922fb813b4db829"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#160491): Remove this once the new implied bounds impl is through FCP."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/traits/implied_outlives_bounds.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f9871cf9db2a222796844b70d524dde5bec32da1e821b0af5bd84074d62a8c9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#160491): Remove this once the new implied bounds impl is through FCP."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/type_check/free_region_relations.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e8b4e2c172d6d8505f6233dfcae4c62bbc9c3c259614da831f85c7e0302415b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#160491): Remove this once the new implied bounds impl is through FCP."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/type_check/free_region_relations.rs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7a40df03d233b23cb8f48429730d9e73c99f5e15a57432d2c5db1bcd6cd1f20"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(generic_const_parameter_types): Make sure that \u0060\u003C\u0027a, \u0027b, const N: \u0026\u0027a \u0026\u0027b u32\u003E\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":"compiler/rustc_trait_selection/src/traits/implied_outlives_bounds.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"e731ab5d93d850f7f03cbbf2af68175381e8aff95a1014bf82e1fda2acc22217"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(impl_trait_in_assoc_type): We currently do this incorrectly 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":"compiler/rustc_trait_selection/src/traits/implied_outlives_bounds.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"470d1237b3901776de7519e46918d859a15fe41a8746472606ef6cfdb62d7f2e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This doesn\u0027t seem right. All call sites already normalize \u0060ty\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":"compiler/rustc_trait_selection/src/traits/implied_outlives_bounds.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a528c4622122e45318c0d526ac02cb04cdeee6707922295e50c6f09ea3fa510"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(non_lifetime_binders): Placeholders don\u0027t 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":"compiler/rustc_trait_selection/src/traits/implied_outlives_bounds.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea53b4153966e7d66fd3da4bd4cd968718def582def39b429dd3dca17acc5f43"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(unsized_const_params): Make \u0060const N: [u8]\u0060 work then forbid 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":"compiler/rustc_trait_selection/src/traits/misc.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0c4b0cee0de9c72fed4cf7f6f589557523f5511feb8f6bebac24b03b8f62f2b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(compiler-errors): This gives us better spans for bad \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":"compiler/rustc_trait_selection/src/traits/misc.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"fae227d9debf4be4536046bb2a4db1b8a2040aef1ef39dd14a7e665d75f3b71d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME. We should really... do something with these region \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":"compiler/rustc_trait_selection/src/traits/mod.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d4186eee7991a5431adbdbd1b0e9b9d059eb58a97ed0c0b06f3a5de4a0862c0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: \u0060elaborated_env\u0060 is not really rigid. We do this to be \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":"compiler/rustc_trait_selection/src/traits/mod.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2b0ff00cc7ced2f927871434fd46f25e6b9572bdb2d53a84f08e91ba5eaa386"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(type_alias_impl_trait): opaque types in param env might be \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":"compiler/rustc_trait_selection/src/traits/mod.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dc25d3f0d3ba023c044c4c5b382d78df961f368673395ca660bcc95a4690776"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: It\u0027s very weird that we ignore region obligations but apparently \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":"compiler/rustc_trait_selection/src/traits/mod.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"b607d6397cfaf7416efb56ac7c2ee1de5e4f31ba700b2030fc4413a8bf87974d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(-Zhigher-ranked-assumptions): We\u0027re ignoring region errors for now. \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":"compiler/rustc_trait_selection/src/traits/mod.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7a3730c897ad8b34a7ecb6d6fe40996fe25fef9117cd22121de5b302f859e07"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We should avoid interning clauses both here and at 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":"compiler/rustc_trait_selection/src/traits/mod.rs"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"450f835e27290f9fa75bc2be2ddad0e48aef517b8cca0b3c46273351ed301000"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this is gonna need to be removed ... \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":"compiler/rustc_trait_selection/src/traits/mod.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"54923ec1c7dace85f73ae822be1596fd1a806ede18e43366164f112acad6064f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(return_type_notation): track binders in this normalizer, 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":"compiler/rustc_trait_selection/src/traits/mod.rs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"d40a1f334fd8dd4448e346c41abf234e0e0bfdc9ff03860c164be0a58fd8af66"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: we are trying to normalize the param-env inside *itself*. The problem is that \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/traits/mod.rs"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"36d946dd6ca02fee8755c78d7c844b90c35cbec48ecd82dc59ab54e1ff3009a2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(BoxyUwU): Private this once we \u0060generic_const_exprs\u0060 isn\u0027t doing its own normalization routine \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":"compiler/rustc_trait_selection/src/traits/mod.rs"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bdcbaf252fc2d3d6906e283c1bd5191b7cf367d7d1a4d45ee5a5faf85fd52a7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(BoxyUwU): Private this once we \u0060generic_const_exprs\u0060 isn\u0027t doing its own normalization routine \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":"compiler/rustc_trait_selection/src/traits/mod.rs"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fa672a664ec3732db766f8a3c2978d9002e0e4fe2c00c957b5c6d11ec8c2dc7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(generic_const_exprs): Consider accepting a \u0060ty::AliasConst\u0060 when we are not rolling our own \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":"compiler/rustc_trait_selection/src/traits/mod.rs"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcbd5f058f86b2b3b2f20469436563daf1b4c28a943f8776ae5052af875284aa"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(generic_const_exprs): Consider accepting a \u0060ty::AliasConst\u0060 when we are not rolling our own \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":"compiler/rustc_trait_selection/src/traits/mod.rs"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"62e35b7f5d4af0f171000e730eb9657934a59091ebfc71324746266e81e2de21"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: \u0060const_eval_resolve_for_typeck\u0060 should probably just modify the env itself \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":"compiler/rustc_trait_selection/src/traits/mod.rs"},"region":{"startLine":671}}}],"partialFingerprints":{"codehealthFindingId/v1":"98e6b7051538e3a1e892cb403bcd92bf42c2611252b3e1170002864283306b08"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: \u0060const_eval_resolve_for_typeck\u0060 should probably just modify the env itself \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":"compiler/rustc_next_trait_solver/src/solve/eval_ctxt/mod.rs"},"region":{"startLine":1582}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3602883f79297216e0a21d85202785fb1549d558b38902edb0ff66fff29b70a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This assumes that \u0060args\u0060 are normalized which is not necessarily true \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":"compiler/rustc_trait_selection/src/traits/mod.rs"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc616ce970f0369ee14f727aa875e5347a32ad52449271bd00fbabfe41c922e2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This assumes that \u0060args\u0060 are normalized which is not necessarily true \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":"compiler/rustc_next_trait_solver/src/solve/eval_ctxt/mod.rs"},"region":{"startLine":1620}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9a3af24b29ad59ae32241cb0e4a67cf8b2807bc9fcd793b5d73f6a85b0210b6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: \u0060def_span\u0060 will point at the definition of this const; ideally, we\u0027d point at \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":"compiler/rustc_trait_selection/src/traits/mod.rs"},"region":{"startLine":782}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1f7498af9ecbccbda50a775dba5623f11074690d69d8489985ddb2e1041eeca"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: \u0060def_span\u0060 will point at the definition of this const; ideally, we\u0027d point at \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":"compiler/rustc_next_trait_solver/src/solve/eval_ctxt/mod.rs"},"region":{"startLine":1643}}}],"partialFingerprints":{"codehealthFindingId/v1":"6262812fccf8acdaab49f7d18daa8086b4c97292c3209d6589d19086d636c6e8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME(-Znext-solver=no): For performance reasons, we currently reuse an existing \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":"compiler/rustc_trait_selection/src/traits/normalize.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b5680f31ba74ff604f6c921d19e1c2695ec51c55b41fc5032c6ed13e0828c53"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#132279): We likely want to reveal opaques during post borrowck analysis"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/traits/normalize.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ce74fb08374f530bc0a8cfaacef96d80516d70c1b0dc07e169172f36023980f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#132279): We likely want to reveal opaques during post borrowck analysis"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/traits/normalize.rs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cbb33df833f884864cdf71342f2e8e1944d80c86414017ab1c642ca3c2f0b67"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(mgca): While this supports constants, it is only used for types by default right now \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":"compiler/rustc_trait_selection/src/traits/normalize.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f0d97ce99c59f827ccfdcb49813473ce3f1754e8d10cfb7202337045b4d3172"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(mgca): While this supports constants, it is only used for types by default right now \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":"compiler/rustc_trait_selection/src/traits/normalize.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"84fbe989ff7243d4585cee65c46d7918252cd6bf9cb064f77113b871beeb17fc"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(mgca): While this supports constants, it is only used for types by default right now \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":"compiler/rustc_trait_selection/src/traits/normalize.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9f3967a5eed1e3091180e1d1da51ed07c5ac669104c9d28b0d63e4dd82cd24f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(mgca): While this supports constants, it is only used for types by default right now \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":"compiler/rustc_trait_selection/src/traits/project.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"78ae1f37bdb259ba588301ff642f553b5cc1025a16d07c5a1d820ef58b230ca1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(mgca): While this supports constants, it is only used for types by default right now \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":"compiler/rustc_trait_selection/src/traits/project.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"f66f464f40d7f7a7e9873273691cfcdafdc45e31f6bfc1c4bb764685007f2b1d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(mgca): While this supports constants, it is only used for types by default right now \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":"compiler/rustc_trait_selection/src/traits/project.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"df373ddfadfb2222c37159b977860001eb66300e9ed1e6450e06d1d508bbe1da"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(mgca): While this supports constants, it is only used for types by default right now \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":"compiler/rustc_trait_selection/src/traits/project.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d33fd6b78544bfa902b0dc7916a9f70d5796d90d3fa126309e015a4dfb80df7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(mgca): While this supports constants, it is only used for types by default right now \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":"compiler/rustc_trait_selection/src/traits/project.rs"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"b92d7eeebc01d1a480e259df494ec4e992794c9595bfe472e0c37f1e940cbd30"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(mgca): While this supports constants, it is only used for types by default right now \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":"compiler/rustc_trait_selection/src/traits/project.rs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b30de50493bd978a1c4982ec4516f2d4acfef3a2870c7eb960fa23d7c486b38"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(mgca): While this supports constants, it is only used for types by default right now \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":"compiler/rustc_trait_selection/src/traits/project.rs"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"45e5b3f458f0346abc08d7cb43ef753b5bd850ffdf5d23607e674e715d24e126"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(mgca): While this supports constants, it is only used for types by default right now \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":"compiler/rustc_trait_selection/src/traits/project.rs"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b6a19da2f6bc6523bb4eb770080aafd9a347a55b7287024db06bf64c22929e7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(mgca): While this supports constants, it is only used for types by default right now \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":"compiler/rustc_trait_selection/src/traits/project.rs"},"region":{"startLine":1306}}}],"partialFingerprints":{"codehealthFindingId/v1":"301be3b57cc94f5234085f765b0dd05cf4a37fa5941b3d9e6066f8704ec42cfb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(mgca): While this supports constants, it is only used for types by default right now \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":"compiler/rustc_trait_selection/src/traits/project.rs"},"region":{"startLine":1340}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e542763821adeefe691daa0acc6ff712533ea1f2338f4d59934988b6d2043c3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(mgca): While this supports constants, it is only used for types by default right now \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":"compiler/rustc_trait_selection/src/traits/project.rs"},"region":{"startLine":1989}}}],"partialFingerprints":{"codehealthFindingId/v1":"2501e048d66eb313ba5f051e9cd3413f36e75d817ed615c5b9722214be2d9f1b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(mgca): While this supports constants, it is only used for types by default right now \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":"compiler/rustc_trait_selection/src/traits/project.rs"},"region":{"startLine":2057}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb5641b6f417c1def8edef274e4b195162b461a06fab0a1bdc00c4a8b3408c89"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(mgca): While this supports constants, it is only used for types by default right now \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":"compiler/rustc_trait_selection/src/traits/project.rs"},"region":{"startLine":2165}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc391048e03d91d4942c95ce9cc78f0fcbbc4407394ab6e4fb479648aa2ced3d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(checked_type_alias): Check how much this actually matters for perf 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":"compiler/rustc_trait_selection/src/traits/normalize.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0ddf25693815a1bc408444f64e5726e95b1c624b53795e05da56bcd1d4c618c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#109628): panic in this case once the issue is fixed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/traits/outlives_bounds.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"06c23a94cd06210a51e83ca8c9c8c7a2fc8d72fec7e08bc8fd0a87e73d0ea8f1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#109628): panic in this case once the issue is fixed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/type_check/free_region_relations.rs"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"6be909cec4ef7935cc52028975107849d8d6eeb3725e294377ca7db18a2f3b6a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#109628): panic in this case once the issue is fixed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/type_check/free_region_relations.rs"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee5ddbc2946f12af877e3d6b42265610ad599a9218ea6639bbb04f675abf793d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(higher_ranked_auto): Should we register assumptions 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":"compiler/rustc_trait_selection/src/traits/outlives_bounds.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f2f44d13673d33cbc6e721357e5657cb2acaf41878126f660bd473778c4ec17"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#20304) For now, I am caching here, which is good, but it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/traits/project.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4d32a20d6da16620f907722c790e2b2ea6674e64fb7eada43cfe4bbd051ae6a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(inherent_associated_types): Since we can\u0027t pass along the self type to 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":"compiler/rustc_trait_selection/src/traits/project.rs"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0be5c90f5e7eb0ee350da5fa8748db73c3b668d7bd507e4032dd9cab845ec12"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(lazy_normalization): Lazy normalization should save us from \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":"compiler/rustc_trait_selection/src/traits/project.rs"},"region":{"startLine":766}}}],"partialFingerprints":{"codehealthFindingId/v1":"47b5ba21cf41c641eb8220dce80136f44a1b1adc7c2f428fbe186e1b389519fd"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: Pick the first trait def candidate for a fully \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/traits/project.rs"},"region":{"startLine":842}}}],"partialFingerprints":{"codehealthFindingId/v1":"97a70bd3fd94d3eb0fac84d5bcf457671df43ea90141a675837bf9f274784c4e"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: Pick the first trait def candidate for a fully \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/traits/project.rs"},"region":{"startLine":960}}}],"partialFingerprints":{"codehealthFindingId/v1":"08d1f0fc75414982ccfbe8d36896b14aadb719ef6a316ccf7fb84b774a2c6cfb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(async_closures): Validity constraints here could be cleaned up. \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":"compiler/rustc_trait_selection/src/traits/project.rs"},"region":{"startLine":1090}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0d36461e1da50907253856bb7333db8433bceac9e4da0bd7726a1db5e01396e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(scrabsha): i guess view types behave like foreign types 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":"compiler/rustc_trait_selection/src/traits/project.rs"},"region":{"startLine":1194}}}],"partialFingerprints":{"codehealthFindingId/v1":"7af5daedb257c10d56a8009ee8fe303056f70e2f9c9bd40c65e96e570cec9373"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(compiler-errors): are Bound and Placeholder types ever known sized? \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":"compiler/rustc_trait_selection/src/traits/project.rs"},"region":{"startLine":1225}}}],"partialFingerprints":{"codehealthFindingId/v1":"880d22c38e853e46aa166aa7bd44a5d0c87c94882d8a1b9059adba0ea893324b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(ptr_metadata): This impl overlaps with the other impls and 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":"compiler/rustc_trait_selection/src/traits/project.rs"},"region":{"startLine":1625}}}],"partialFingerprints":{"codehealthFindingId/v1":"8393dda29c0e36015295dbdf53e2dab0a2bf964c2ae50612ff6527bfb35b4bbc"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(ptr_metadata): This impl overlaps with the other impls and 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":"compiler/rustc_next_trait_solver/src/solve/normalizes_to.rs"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"248a0a09f58f21211bac2bd794c4a4e48d7fbebcdeae1fcfee4a7c9897a32829"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME(@lcnr): We may even consider experimenting with eagerly replacing bound vars during \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":"compiler/rustc_trait_selection/src/traits/util.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"e018bda717203ea44060d7f355b484c5c6bc573dbe05ef9e12ac421989d02d91"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This should take a \u0060PolyExistentialTraitRef\u0060, since we don\u0027t care \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":"compiler/rustc_trait_selection/src/traits/vtable.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"2596d1c678578d131bc5664e039f0ca017859ad48ec5ccae9cdb68306bec8f81"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Is this normalize 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":"compiler/rustc_trait_selection/src/traits/vtable.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"beb619609de96b81142d780f4ff8e6e44d648a0efe3732cb1945ab624268a771"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(inherent_associated_types): Merge this function with \u0060fn compute_alias\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":"compiler/rustc_trait_selection/src/traits/wf.rs"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4a62192a6ced0ee646b15610f2d594d66551a380f245d2981db820cfbb9ba37"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(inherent_associated_types): Should this happen inside of a snapshot? \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":"compiler/rustc_trait_selection/src/traits/wf.rs"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ca98ac59423b48c87ebf3037e791d94baf81a0fbb040f36ed6dd5c9bb63e640"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(inherent_associated_types): This is incompatible with the new solver and lazy norm! \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":"compiler/rustc_trait_selection/src/traits/wf.rs"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9a566a2e10632731006b5ef5ec28704baabf532ce38757aabc3b5e524a653b6"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: Check the return type of function definitions for \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/traits/wf.rs"},"region":{"startLine":887}}}],"partialFingerprints":{"codehealthFindingId/v1":"94fa314885620e53b5915d707a4477a674e1b85893daf95193d515284c1e0755"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(unsafe_binders): For now, we have no way to express \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":"compiler/rustc_trait_selection/src/traits/wf.rs"},"region":{"startLine":978}}}],"partialFingerprints":{"codehealthFindingId/v1":"13e3c233d724ae800883c34d538d864882110f4ccfba8c530c8a7478974b6ff6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#27579) RFC also considers adding trait"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/traits/wf.rs"},"region":{"startLine":1008}}}],"partialFingerprints":{"codehealthFindingId/v1":"348ff0bbc1f2522326484a72e76bdb14c118e430379c2adcf2856eb347c93673"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(scrabsha): what should we require from fields? \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":"compiler/rustc_trait_selection/src/traits/wf.rs"},"region":{"startLine":1127}}}],"partialFingerprints":{"codehealthFindingId/v1":"008ce662aff866fc8d09e50b7a6bfa9a76faa6b3e9ec01d847005629764032da"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This should be unreachable but isn\u0027t because we normalize in item \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":"compiler/rustc_trait_selection/src/traits/wf.rs"},"region":{"startLine":1166}}}],"partialFingerprints":{"codehealthFindingId/v1":"03400f638aa0c28ec86fa91840e6c60143773bca7cdd4fcf6128a55b4d6aaf57"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(generic_const_exprs): this doesn\u0027t verify that given \u0060Expr(N \u002B 1)\u0060 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":"compiler/rustc_trait_selection/src/traits/wf.rs"},"region":{"startLine":1198}}}],"partialFingerprints":{"codehealthFindingId/v1":"818235b643e444492ad93e0d40cdab759357ce6e0707a4c7ee1065732d511a50"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(mgca): no need to feature-gate once valtree lifetimes are not erased \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":"compiler/rustc_trait_selection/src/traits/wf.rs"},"region":{"startLine":1225}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1dd153459daa50fc5186094fcee5b5ac48849547e18d97bbf0230e19030fce2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Enforce that values are structurally-matchable. \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":"compiler/rustc_trait_selection/src/traits/wf.rs"},"region":{"startLine":1293}}}],"partialFingerprints":{"codehealthFindingId/v1":"43e58148846b08b8ce99637aabb32637ef054fac70938bc23d7a7c3f438c2fe4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: use \u0060EarlyBinder\u0060 in \u0060self.children\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":"compiler/rustc_trait_selection/src/traits/specialize/specialization_graph.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"57810a783fdbc1e4289deaf7d92d4fad035d0680eff3edde72a7fac096134a00"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Function definitions could actually implement \u0060FnPtr\u0060 by \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":"compiler/rustc_trait_selection/src/traits/select/candidate_assembly.rs"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4dfbcff40e2b29aecfd3f7a767c06f192a63f2b71e889c5f2891ab015975c76"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(unsafe_binder): Should we conditionally \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":"compiler/rustc_trait_selection/src/traits/select/candidate_assembly.rs"},"region":{"startLine":1183}}}],"partialFingerprints":{"codehealthFindingId/v1":"1377ed63445a4ac03cd0d795abbecf540598bec03f4d95c50c4c37fc450542b9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(unsafe_binder): Should we conditionally \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":"compiler/rustc_trait_selection/src/traits/select/mod.rs"},"region":{"startLine":2106}}}],"partialFingerprints":{"codehealthFindingId/v1":"31dc832ae76f820cf2af3bd499b3e2d1d86960acc80fe867f89aa5c8e694506b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(try_as_dyn): check what kind of projections we can allow \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":"compiler/rustc_trait_selection/src/traits/select/candidate_assembly.rs"},"region":{"startLine":1511}}}],"partialFingerprints":{"codehealthFindingId/v1":"afb3c434fa51fc35f8267a7b02771cc154fef50ba520120759dbe75953a74ca0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(try_as_dyn): check what kind of projections we can allow \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":"compiler/rustc_next_trait_solver/src/solve/trait_goals.rs"},"region":{"startLine":938}}}],"partialFingerprints":{"codehealthFindingId/v1":"545978ae7ea48567000bac724d54d725b9d6923648b487f234f86b687cc67435"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(field_projections): We should not use \u0060evaluate_obligation\u0060 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":"compiler/rustc_trait_selection/src/traits/select/candidate_assembly.rs"},"region":{"startLine":1534}}}],"partialFingerprints":{"codehealthFindingId/v1":"c63c15d7bc4f64c5ff34b9a6683875f868f1666039f0d904528b44f19f0416c8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(coroutine_clone): We could uplift this into \u0060collect_predicates_for_types\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":"compiler/rustc_trait_selection/src/traits/select/confirmation.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2c146977fc11865421738f41fe3a2c5414bfb31c0ba18bbc785520f7ed0279d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(nikomatsakis) -- this cache is not taking into \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":"compiler/rustc_trait_selection/src/traits/select/mod.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f727e18da8bda6983bcd10e95a95e36195cf333c01c97e568078dfc8e69a493"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(generic_const_exprs): See comment in \u0060fulfill.rs\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":"compiler/rustc_trait_selection/src/traits/select/mod.rs"},"region":{"startLine":905}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef84b71f7ab69fbe919353bf8e4a9978a914e0022d4dd8cee4f22662ccfe37d7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(gca_min_const_items): Consider consts as well? \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":"compiler/rustc_trait_selection/src/traits/select/mod.rs"},"region":{"startLine":1151}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f64665d620b67074ee34609fcf52aacc6817dcf4750e1cb20bb5ffd2cdc326e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(generic_const_exprs): GCE needs well-formedness predicates to be \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":"compiler/rustc_trait_selection/src/traits/select/mod.rs"},"region":{"startLine":1192}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bc63d86e497a00efe37e10d29a840f68ba96981afa7b26486032c34be9be111"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: This is still theoretically unsound. Goals can indirectly rely \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/traits/select/mod.rs"},"region":{"startLine":1391}}}],"partialFingerprints":{"codehealthFindingId/v1":"375e012221457c7d7478bd4d54d506e075a82bc6a7cd3e9b46cd51a93a36b84d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#132279): This is still incorrect as we treat opaque types"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/traits/select/mod.rs"},"region":{"startLine":1410}}}],"partialFingerprints":{"codehealthFindingId/v1":"31bd8590271e3445d5fb347256d55b4805fe03713ee88ae65288d8d507a56552"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: On subsequent recursions, we only care about bounds that don\u0027t \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/traits/select/mod.rs"},"region":{"startLine":1546}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a359854079cea352d0336ec7371a1ea692838be71f08a29128b3da1db081bc5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(generic_associated_types): Addresses aggressive inference in #92917."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/traits/select/mod.rs"},"region":{"startLine":1679}}}],"partialFingerprints":{"codehealthFindingId/v1":"14688e0e53f223b7ab3e155a3315882350acc8e3942dd10c3d134a6d2aec8d91"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(generic_associated_types): Addresses aggressive inference in #92917."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_next_trait_solver/src/solve/normalizes_to.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"433ca7611205d130512b29c46b3ef6f5e30db9ace81a73d5867318044f0ed37c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(@lcnr): remove this module and move this function somewhere else. \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":"compiler/rustc_trait_selection/src/traits/query/dropck_outlives.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"09f4521164274510983feb6fa25ad128a388e602c91f117c065c40a0eff12f74"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(@lcnr): Why do we erase regions in the env here? Seems odd \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":"compiler/rustc_trait_selection/src/traits/query/dropck_outlives.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"56b31ed0c0bc327fb86a545896f8d2efae2c2cd83753b418af8573547e6aedf2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: we can try to recursively \u0060dtorck_constraint_on_ty\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":"compiler/rustc_trait_selection/src/traits/query/dropck_outlives.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"993e61c5d6f2622edfd8863ab790761efab1f9a2032c93259e133af09dec3428"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: In this region-dependent context, \u0060type_op\u0060 should only fail due 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":"compiler/rustc_trait_selection/src/traits/query/type_op/custom.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"12f9b47b955002cb7ca18932eb6b992898b2b331a7abe9bf1fafd7b87dc77890"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK(type_alias_impl_trait): When moving an opaque type to hidden type mapping from the \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/traits/query/type_op/mod.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"b662c2ede3c144d00bd314c50d26c8ba1e2ae76a67f1e3304d72b4728142fdda"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(-Zassumptions-on-binders): actually handle fast 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":"compiler/rustc_trait_selection/src/solve/delegate.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"0da0a3aa0f94b693bf5a946d12792eec025d101e7c8d4f067470681b30aca1a2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Check for defaultness here may cause diagnostics problems. \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":"compiler/rustc_trait_selection/src/solve/delegate.rs"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9f2a6af18d308cdcc31de39291189dfd0af6a75c2a384edce075fac650ad249"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This actually should destructure the \u0060Result\u0060 we get from transmutability 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":"compiler/rustc_trait_selection/src/solve/delegate.rs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ab167bec43ec41af9a5ab124c941eabcce381f920f30bcdbb2f4e816ed811e8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: share this with overflow error in fulfillment instead of duplicating. \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":"compiler/rustc_trait_selection/src/solve/delegate.rs"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"79296a99afdc27ab980e0ea3e5a62d77457e4fbf98961ee7182fef83bed57d1e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(-Znext-solver): This does not handle inference variables hidden \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":"compiler/rustc_trait_selection/src/solve/fulfill.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"28a36c6fc8e6310b1ee6c40b13bbfa22139cd3b67d7403bcb28e8d901d0ae12a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We should ICE here. See the following links for details \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":"compiler/rustc_trait_selection/src/solve/fulfill/derive_errors.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ca29493a967de2ac1d7ba6c5befd12aae8d17a3b7b761791bdf8faa9cc9d625"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this doesn\u0027t account for trivial derefs, but works as a first \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":"compiler/rustc_trait_selection/src/error_reporting/traits/fulfillment_errors.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfefc9ddf7968345f925f2c76df55fec5d45bc9a2193df7c7d461dfaaefa56af"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: we\u0027ll need a better message which takes into account \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":"compiler/rustc_trait_selection/src/error_reporting/traits/fulfillment_errors.rs"},"region":{"startLine":782}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b8c70044a3637ad033b6f637c41d7daf177fbcaa8b966fab87515989ab6cc2a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const_trait_impl): We should recompute the clause with \u0060[const]\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":"compiler/rustc_trait_selection/src/error_reporting/traits/fulfillment_errors.rs"},"region":{"startLine":986}}}],"partialFingerprints":{"codehealthFindingId/v1":"328b8f76a000e76805da50aac6ec7a14c2c1fbf2d55299750c1b6ff7f8c605b5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(adt_const_params): We should check there\u0027s not already an \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":"compiler/rustc_trait_selection/src/error_reporting/traits/fulfillment_errors.rs"},"region":{"startLine":1586}}}],"partialFingerprints":{"codehealthFindingId/v1":"25e2f48672a1c1c84c2cb35814a3dca447476980ba4a5ac7fcc084c74b7d3e63"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We could be smarter about this, i.e. if cond\u0027s param-env is 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":"compiler/rustc_trait_selection/src/error_reporting/traits/fulfillment_errors.rs"},"region":{"startLine":1706}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbedb79998e4556794bca9c32b4467861e544a0bf293e5c76e78184f157ccac6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(compiler-errors): This could be generalized, both 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":"compiler/rustc_trait_selection/src/error_reporting/traits/fulfillment_errors.rs"},"region":{"startLine":2341}}}],"partialFingerprints":{"codehealthFindingId/v1":"e20c2094ac3c6b47d5bb2bb7c0a3452ddda7d40ab4d957ed97d9d4e944d40839"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK(estebank): we remove the pre-existing \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/error_reporting/traits/fulfillment_errors.rs"},"region":{"startLine":2459}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceb645496377100f5a7f9d50b29d15feef3a5fe19941fef03ee7c68ad40e3c63"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this could use a better heuristic, like just checking \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":"compiler/rustc_trait_selection/src/error_reporting/traits/fulfillment_errors.rs"},"region":{"startLine":2674}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fe5c3c73c9157b384b322868a2a99691c2730d1d25b34d8178ade59150dec7f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: why don\u0027t we also instantiate const and region params with infer vars \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":"compiler/rustc_trait_selection/src/error_reporting/traits/fulfillment_errors.rs"},"region":{"startLine":3181}}}],"partialFingerprints":{"codehealthFindingId/v1":"b41c6e435486a7fb261d5cdc4db656acdd4b139f1ab401f12ba2299e4f96f65f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#155345): This should automatically"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/error_reporting/traits/fulfillment_errors.rs"},"region":{"startLine":3190}}}],"partialFingerprints":{"codehealthFindingId/v1":"5054c7c6a91d6921d3791601b628c5605f55195e6523c63ae700a866838f7c0a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const_generics): we should suggest to the user how they can resolve this \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":"compiler/rustc_trait_selection/src/error_reporting/traits/fulfillment_errors.rs"},"region":{"startLine":4202}}}],"partialFingerprints":{"codehealthFindingId/v1":"aff8d43dae9583c182878d5fb419a232fb9844b77d9f2681f7b7ab068be786f9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(-Zlower-impl-trait-in-trait-to-assoc-ty): HIR is not present for RPITITs, \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":"compiler/rustc_trait_selection/src/error_reporting/traits/on_unimplemented.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"00c6b9eaae3812506f20e84521d69ae81d7e0d12c534d63b5146f3324ba67594"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: we should suggest \u0060fn foo(t: impl Trait\u003CA: Bound\u003E)\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":"compiler/rustc_trait_selection/src/error_reporting/traits/suggestions.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"f13530259c1e757ca52410ebbbfb3124fc8746fb2f51c39af6eccfa7cf32663d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Add check for trait bound that is already present, particularly \u0060?Sized\u0060 so we \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":"compiler/rustc_trait_selection/src/error_reporting/traits/suggestions.rs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4bebb2eabcc169a49bcf33ece3efc374ed3b1a84c1e289b1256b02ba6f58806"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(compiler-errors): It would be nice to do the same \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":"compiler/rustc_trait_selection/src/error_reporting/traits/suggestions.rs"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2e7da7a1a618c03fa430e27af254646d3f943c4d1c70a4edad80196d6d26c1e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this case overlaps with code in TyCtxt::note_and_explain_type_err. \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":"compiler/rustc_trait_selection/src/error_reporting/traits/suggestions.rs"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0ce71b58a8682742cc831d052fc73a99f557f32aab1f78f9fd2647b6a758543"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this case overlaps with code in TyCtxt::note_and_explain_type_err. \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":"compiler/rustc_middle/src/ty/diagnostics.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff05fd2783cefe2661f7f40c95f099b18de5c2d67c438e0af931af62e2e6747f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(dianne): this misses the case where users need both to deref and remove \u0060\u0026\u0060s. \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":"compiler/rustc_trait_selection/src/error_reporting/traits/suggestions.rs"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b69fa6d396e0cc32b41ccfc319ad230497d66fe9df2871615481e917f448fb8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME expr and stmt have the same span if expr comes from expansion \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":"compiler/rustc_trait_selection/src/error_reporting/traits/suggestions.rs"},"region":{"startLine":1353}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e3a11a531edf4b4de2588236d1af18e58632541bbff9fb4031821cc6233d604"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(compiler-errors): This is kind of a mess, but required for obligations \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":"compiler/rustc_trait_selection/src/error_reporting/traits/suggestions.rs"},"region":{"startLine":1730}}}],"partialFingerprints":{"codehealthFindingId/v1":"4644cb583e28b2aa29b0dd750b78e5fc675bbef3bbab4d2ae49e1f400f2ece2a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: use \u0060obligation.predicate.kind()...trait_ref.self_ty()\u0060 to see if we have \u0060()\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":"compiler/rustc_trait_selection/src/error_reporting/traits/suggestions.rs"},"region":{"startLine":2347}}}],"partialFingerprints":{"codehealthFindingId/v1":"72ec459a4ce4ee7b1e9972a343dbffd61cc3294f04a4fea4c755ae47164f37c4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: account for associated \u0060async fn\u0060s. \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":"compiler/rustc_trait_selection/src/error_reporting/traits/suggestions.rs"},"region":{"startLine":2455}}}],"partialFingerprints":{"codehealthFindingId/v1":"73728a579cb0833cd798c17ab116117d31407a94248d58b65fd53fc3b2c56a5e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(xizheyin): if the type is not ADT, we should not suggest 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":"compiler/rustc_trait_selection/src/error_reporting/traits/suggestions.rs"},"region":{"startLine":4012}}}],"partialFingerprints":{"codehealthFindingId/v1":"24ecc2a2bfcd5842693367062f1497ec47e7acff251400e3d75bca33847b6913"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(compiler-errors): We could probably point to something \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":"compiler/rustc_trait_selection/src/error_reporting/traits/suggestions.rs"},"region":{"startLine":4153}}}],"partialFingerprints":{"codehealthFindingId/v1":"72f5248d2707784a94fcadcafc9873155e0783f5b3a2c7ac1bfc967870adc902"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: we may suggest array::repeat 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":"compiler/rustc_trait_selection/src/error_reporting/traits/suggestions.rs"},"region":{"startLine":4187}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c4ba4a567adfaa9008d532c05362cd8ffdf0ae35bdca6c62bc08d5defbd605d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: we should do something else so that it works even on crate foreign \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":"compiler/rustc_trait_selection/src/error_reporting/traits/suggestions.rs"},"region":{"startLine":4664}}}],"partialFingerprints":{"codehealthFindingId/v1":"598dc4ed973239e5c93cadd939dcc96d3fb3afb0d6b1b4d38c696421def0584f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const_trait_impl) derive_const as suggestion? \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":"compiler/rustc_trait_selection/src/error_reporting/traits/suggestions.rs"},"region":{"startLine":5210}}}],"partialFingerprints":{"codehealthFindingId/v1":"7620c0c3bd6a16bafe6c08cf23b89943f37a7cb1dd9082da4d860a714a93a92f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: visit the ty to see if there\u0027s any closure involved, and if there 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":"compiler/rustc_trait_selection/src/error_reporting/traits/suggestions.rs"},"region":{"startLine":5400}}}],"partialFingerprints":{"codehealthFindingId/v1":"20b36d2f6e17da919dff0760fff222b6f4ddbd3de076af7acd881d373b4e1752"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(splat): this might need to change if the Fn* traits start using/supporting splat \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":"compiler/rustc_trait_selection/src/error_reporting/traits/suggestions.rs"},"region":{"startLine":5540}}}],"partialFingerprints":{"codehealthFindingId/v1":"db82e17f5901f6fcd5f7a30daa5341f1d1f53b9576413af5b0f4a64dc6dbcedc"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: actually check the expected vs found types, but right now \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":"compiler/rustc_trait_selection/src/error_reporting/traits/suggestions.rs"},"region":{"startLine":5658}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f38632d1b5b110622a5e2210934c6531647c20056d90557755dcdc8abb830ed"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this happens with macro calls. Need to figure out why the stmt \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":"compiler/rustc_trait_selection/src/error_reporting/traits/suggestions.rs"},"region":{"startLine":5662}}}],"partialFingerprints":{"codehealthFindingId/v1":"b67e9f6c872ef49943dd7d3b6627f5d1c68a0c671b3a71f1f83157ac6204058a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this happens with macro calls. Need to figure out why the stmt \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":"compiler/rustc_hir_typeck/src/fn_ctxt/suggestions.rs"},"region":{"startLine":3905}}}],"partialFingerprints":{"codehealthFindingId/v1":"7835144f8a06f0e7bcfd1b174d347e2774db21bd42c6b48b1d4fd49fe2c856ee"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this doesn\u0027t quite work for \u0060Iterator::collect\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":"compiler/rustc_trait_selection/src/error_reporting/traits/suggestions.rs"},"region":{"startLine":5836}}}],"partialFingerprints":{"codehealthFindingId/v1":"99618abc20b18222f4e84933094df1ef3183cd09e94f855e999ee618f0443ae9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This could handle more exotic cases like mutability mismatches too! \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":"compiler/rustc_trait_selection/src/error_reporting/traits/suggestions.rs"},"region":{"startLine":6851}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f80696145702bc51506a1f6e09117266a97776ff1d33d3bec64c7e778be0585"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: add note explaining explicit negative trait bounds. \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":"compiler/rustc_trait_selection/src/error_reporting/traits/suggestions.rs"},"region":{"startLine":7079}}}],"partialFingerprints":{"codehealthFindingId/v1":"182a06a2cfe4622e4e42144a785e29a2db7e8e1802dc6635f1aa4166ee73ae24"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#22750) handle traits and stuff"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/error_reporting/infer/mod.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c7aec91a789a4ebdd63d1667a907d7faaa29d5ecb92a5fd9f78873f14b15668"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#73154): For now, we do leak check when coercing function"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/error_reporting/infer/mod.rs"},"region":{"startLine":1950}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a24011fd07193b554a5b26975dea883150cf5d2ca03afc2f22a22fda0de1271"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#73154): For now, we do leak check when coercing function"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/demand.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"9efd0faef5fdcb424433db710e5d956b011b4b6ceb32f02b8b7adc5f86842aaf"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(compiler-errors): This could at least do some first-order \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":"compiler/rustc_trait_selection/src/error_reporting/infer/mod.rs"},"region":{"startLine":2572}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddb6ed4eaedc378babd7a6858b3c75f65763446c26226135a9769010300468bd"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Ideally we should look into the generic constant \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":"compiler/rustc_trait_selection/src/error_reporting/infer/need_type_info.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a71d6dcd524e71f82b62c7dd93da7b00cdab5904ad869076a3228c132810b14"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We should be able to add some additional info 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":"compiler/rustc_trait_selection/src/error_reporting/infer/need_type_info.rs"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"e714efda0b980cab34b89dd43ead1365a8bdab5a0bf39b536eb998c2ad036e66"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(type_alias_impl_trait): These opaque 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":"compiler/rustc_trait_selection/src/error_reporting/infer/need_type_info.rs"},"region":{"startLine":1107}}}],"partialFingerprints":{"codehealthFindingId/v1":"3143abca48d0fac47064a539dc832f0fbd7da122baab3031b2e84291d0bf7296"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#98711): Ideally we would also deal with type relative"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/error_reporting/infer/need_type_info.rs"},"region":{"startLine":1136}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b615764f8578b9bdb95cce1a16051b92d1a3902744e5bdf00c8ca634eb89ab3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(TaKO8Ki): Ideally we should support other kinds, \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":"compiler/rustc_trait_selection/src/error_reporting/infer/need_type_info.rs"},"region":{"startLine":1147}}}],"partialFingerprints":{"codehealthFindingId/v1":"216a28d5b157c1fa614edb08f0503c42d739b9d469e7eb29c5baef181bea2184"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We deal with that one separately for now, \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":"compiler/rustc_trait_selection/src/error_reporting/infer/need_type_info.rs"},"region":{"startLine":1203}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3128504b4b5a35b9dafd7edf3253cb523d0ae2839507740eacd73b72823ea9f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Ideally we should support this. For that \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":"compiler/rustc_trait_selection/src/error_reporting/infer/need_type_info.rs"},"region":{"startLine":1290}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcf1e78bac1225d97e5e55e3b31f8d722b9b152ae7f865ed489ceab76fd48e08"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(fn_delegation): In delegation item argument spans are equal to last 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":"compiler/rustc_trait_selection/src/error_reporting/infer/need_type_info.rs"},"region":{"startLine":1519}}}],"partialFingerprints":{"codehealthFindingId/v1":"60b7ceff041665b938fd391025cc8baafa4f770676aa97ddc15b9579160621ee"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(inherent_associated_types): Extend this to support \u0060ty::Inherent\u0060, too. \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":"compiler/rustc_trait_selection/src/error_reporting/infer/note_and_explain.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"733f558f3e4198620ef3952e91d9230fea96c0f17bc33a2409de2f065d8f546a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(inherent_associated_types): Extend this to support \u0060ty::Inherent\u0060, too. \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":"compiler/rustc_trait_selection/src/error_reporting/infer/note_and_explain.rs"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fceda7d3e042729e7295eeac01bf5d46c2a6acc1a85a475859645c636e5a39e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(inherent_associated_types): Extend this to support \u0060ty::Inherent\u0060, too. \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":"compiler/rustc_infer/src/infer/opaque_types/mod.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"80a01322021d3eb0735968a4d4598a524227a3644f1c64a50b3d730cfb2346b6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: extract this logic for use in other diagnostics. \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":"compiler/rustc_trait_selection/src/error_reporting/infer/note_and_explain.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9e9bbd808bf066383b9a8495696a92d57d8fed81643c92cd61ac31f6e376da8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(type_alias_impl_trait): make this a structured suggestion \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":"compiler/rustc_trait_selection/src/error_reporting/infer/note_and_explain.rs"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"d23fabeaadea89d4b6c59d2dd85b0ac29953c5da5181eb0d7c29be763ae614f8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: consider suggesting the use of associated \u0060const\u0060s. \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":"compiler/rustc_trait_selection/src/error_reporting/infer/note_and_explain.rs"},"region":{"startLine":881}}}],"partialFingerprints":{"codehealthFindingId/v1":"e80cb6387f389106b3592e7f01ea94a3e8af9a829bd846d3c2555823f14b8e54"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: account for \u0060#![feature(specialization)]\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":"compiler/rustc_trait_selection/src/error_reporting/infer/note_and_explain.rs"},"region":{"startLine":949}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f7266c0d8286b6d1c3bbb9122b80a3accc9e1be8aec0f2c8e2be164450f17b2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: account for returning some type in a trait fn impl that has \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":"compiler/rustc_trait_selection/src/error_reporting/infer/note_and_explain.rs"},"region":{"startLine":952}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a111d36df56ff8c0677ef4c5cb0e0770637459c233e1e252a6d24b857629dc5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: we would want to call \u0060deeply_resolve_ignoring_regions\u0060 on \u0060ty\u0060 before suggesting. \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":"compiler/rustc_trait_selection/src/error_reporting/infer/note_and_explain.rs"},"region":{"startLine":995}}}],"partialFingerprints":{"codehealthFindingId/v1":"912ca82cc79767194117dc765d1e021e6b399dade26d7fb5aaf48c764f4b30af"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(compiler-errors): Right now this is only being used for region \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":"compiler/rustc_trait_selection/src/error_reporting/infer/region.rs"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"b03af523ed458438f25dcc7f1358214ca6e48c1c8a95f1734287dca5dba65365"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // Hack to get around the borrow checker because trace.cause has an \u0060Rc\u0060. \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/error_reporting/infer/region.rs"},"region":{"startLine":663}}}],"partialFingerprints":{"codehealthFindingId/v1":"7df42f7e212d23e44d0795771ea1e3e653710e0009ffe00d2f69d127a319601d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#125431): \u0060ReVar\u0060 shouldn\u0027t reach here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/error_reporting/infer/region.rs"},"region":{"startLine":1119}}}],"partialFingerprints":{"codehealthFindingId/v1":"822d00cadd29e3857db9693d6a586a90bdcb22fdaf5cc96a66cb950dd09e7476"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME #56861: DRYer prelude filtering"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/error_reporting/infer/suggest.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a24660861e22e02eb4374d84ebaff3f0de9431d0a80aae9e586da06134de2b5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME #56861: DRYer prelude filtering"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/fn_ctxt/suggestions.rs"},"region":{"startLine":2742}}}],"partialFingerprints":{"codehealthFindingId/v1":"a319d8f639de9a15276093b0914b0aae14cbd46957223685b01d5297b00a9a82"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Seems like we can\u0027t have a suggestion and a note with different spans in a single subdiagnostic \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":"compiler/rustc_trait_selection/src/error_reporting/infer/suggest.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"72593ac985640333686f653d3613b98579b979efd9bbe28900d0803e2f3b59a0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Remove once \u0060rustc_hir_typeck\u0060 is migrated to diagnostic structs \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":"compiler/rustc_trait_selection/src/error_reporting/infer/suggest.rs"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"b709b3ecae9d2984127a54c87499dde97ef4bbdf8c2afa86a992abb226174bce"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Suspicious \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":"compiler/rustc_trait_selection/src/error_reporting/infer/suggest.rs"},"region":{"startLine":878}}}],"partialFingerprints":{"codehealthFindingId/v1":"f04e762cd057452ee69830a624019a0ea1e97868fd688c4d51d960bedd49ffd3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: we should point at the lifetime \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":"compiler/rustc_trait_selection/src/error_reporting/infer/nice_region_error/mismatched_static_lifetime.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"542dbce44ed5b8e947f13c2cc2cb05d6d9f364f9db51825d8b31a2fe5e7fd465"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: account for the need of parens in \u0060\u0026(dyn Trait \u002B \u0027_)\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":"compiler/rustc_trait_selection/src/error_reporting/infer/nice_region_error/static_impl_trait.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"0395280975f1fadf0f1ca1b2da049a5c40c5410a8b413eba2cf72c5ea35c698b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(precise_captures): Suggest adding to \u0060use\u003C...\u003E\u0060 list 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":"compiler/rustc_trait_selection/src/error_reporting/infer/nice_region_error/static_impl_trait.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"a45c22f64090d22f8c061a870824b5daf51438484590b12497392829ac73ece7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: we should check \u0060self_ty\u0060, but for now, use \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":"compiler/rustc_trait_selection/src/error_reporting/infer/nice_region_error/static_impl_trait.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf12882d29ea38ff35530f8bff2dafbb31761a345993f3efce3971751a764d5a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(compiler-errors): Don\u0027t like that this needs \u0060Ty\u0060s, 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":"compiler/rustc_trait_selection/src/error_reporting/infer/nice_region_error/trait_impl_difference.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"db993441fa0f0f01ac0602785ec8b57696e3074eef0953c688800ae379f9bfb5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: use def_kind \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":"compiler/rustc_trait_selection/src/error_reporting/infer/nice_region_error/util.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"6118f057d488de21d2574a7fa89de4b84de8024adc9f926d8f2682df1f8489b1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#42703) - Need to handle certain cases here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/error_reporting/infer/nice_region_error/util.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"edf956de189920ad6a716c1e55dbe1095b0cbe0ab15441c221f242eaa95e163e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#42700) - Need to format self properly to"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/error_reporting/infer/nice_region_error/util.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea7cb5d7227bb75b64110997f04ededd8cc15575f39f0604ffc89e2af8486bd7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We should fix or remove this test 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":"compiler/rustc_thread_pool/tests/stack_overflow_crash.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea9345b812576fb3c09451ebf57b926035236919547a6dec20c051af5cf8b01c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We should fix or remove this ignored test. \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":"compiler/rustc_thread_pool/src/thread_pool/tests.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"d450ff93bce46f6bffd68f05f11b6d57ff59bd26d1357280a2b8f5d0387433fa"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We should fix or remove this ignored test. \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":"compiler/rustc_thread_pool/src/thread_pool/tests.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"fda5bcdc85f811282c7d5a6daeb1d21c12b3f2409dda81cb655e3ddf773b7e67"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We should fix or remove this ignored test. \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":"compiler/rustc_thread_pool/src/thread_pool/tests.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"113dc381668a08581d29d6cbbf386fdac3476cc7483b7f927649daea28f00690"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We should fix or remove this ignored test. \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":"compiler/rustc_thread_pool/src/thread_pool/tests.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a50103a4ed9f1791e3d8380940d79f78c2d0bb602bc4ccc8c6104b8f068ec53"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We should fix or remove this ignored test. \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":"compiler/rustc_thread_pool/src/thread_pool/tests.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"36d1b525614fe71f08e42b710ab49374ea8f7d686b6dcfa852413d851b46e405"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We should fix or remove this ignored test. \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":"compiler/rustc_thread_pool/src/thread_pool/tests.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5558158214c73875fe957d69f07637b960312a80bd7381d602c5fdc88aaf92e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We should fix or remove this ignored test. \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":"compiler/rustc_thread_pool/src/spawn/tests.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b5ef4f2738908ae4338dd44d7618588c5eba2cf975d2fd9cafbe79d8fbfb57d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We should fix or remove this ignored test. \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":"compiler/rustc_thread_pool/src/spawn/tests.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"c410693d15b1b2efa3522ab015dc238802e07aecf5dd8c51c9f79b5f41d9b1d8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We should fix or remove this ignored test. \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":"compiler/rustc_thread_pool/src/spawn/tests.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dbc79908756af000cf1bec996072944a3f4c8214e3ac0a9586cf0cdebe54f28"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We should fix or remove this ignored test. \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":"compiler/rustc_thread_pool/src/spawn/tests.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"10b62d089c0bd19dec34018dd6d1939cbdba882568ba64e40cdb9087f6df8bcd"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We should fix or remove this ignored test. \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":"compiler/rustc_thread_pool/src/spawn/tests.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"93b7444bebf8189f9ea7215375d3c9e4689ddd75dd14ec438f5913d5f70faa9e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We should fix or remove this ignored test. \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":"compiler/rustc_thread_pool/src/spawn/tests.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a19b42a550057de3f6194e3ef51d13afb4d35fa5fd2497808eac7e539c272f7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We should fix or remove this ignored test. \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":"compiler/rustc_thread_pool/src/scope/tests.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"627190213fe8013db90dace026c53262b3927bd5cc07a04c8d2766d8ab55cdf1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We should fix or remove this ignored test. \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":"compiler/rustc_thread_pool/src/scope/tests.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd9d380347a9e375faa023f9fa7a033c31f09b20f40f875b59a13e0269d63705"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We should fix or remove this ignored test. \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":"compiler/rustc_thread_pool/src/scope/tests.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9045a45560226a57cdd7b502dc4d054ef95a23758d2056509faacb1e018bade"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We should fix or remove this ignored test. \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":"compiler/rustc_thread_pool/src/scope/tests.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aecc0a66c2fe15c6d2ceec3815da5daf78fc448e7c7e660e14067735a447196"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We should fix or remove this ignored test. \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":"compiler/rustc_thread_pool/src/scope/tests.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a80badba1941b1c5c49bdaa005088f288b1a02d1e8eae48c15726c85ad72325"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We should fix or remove this ignored test. \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":"compiler/rustc_thread_pool/src/scope/tests.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d5f5056706a15eb5996129a07bc41a17198cbed98675c507cee179a0e5654b6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We should fix or remove this ignored test. \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":"compiler/rustc_thread_pool/src/scope/tests.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"f77d154f9124493eb46abfe770c3fa9cc2890ad321dd95e044448bfb1ba1fd3d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We should fix or remove this ignored test. \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":"compiler/rustc_thread_pool/src/scope/tests.rs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2f6a37feb79a83515be756e2de4a7abe5546eccd5a6b608d5c44cce9ab48fdc"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We should fix or remove this ignored test. \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":"compiler/rustc_thread_pool/src/scope/tests.rs"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"094cae9cfd69df358e29da22ae5f86bd94f845da7f648e20e0714ef34d97123f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We should fix or remove this ignored test. \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":"compiler/rustc_thread_pool/src/scope/tests.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a0e7630a249ac359831f554a9e18c70d6d27fb1216f942bfd236b507c6a2219"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We should fix or remove this ignored test. \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":"compiler/rustc_thread_pool/src/scope/tests.rs"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7a8531b7548a6b62980184489289a0faceb76cfb23faf97b1e79e2d1c9bf71f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We should fix or remove this ignored test. \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":"compiler/rustc_thread_pool/src/join/tests.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"b046585217c1b906e2f54434147b8c914219c979e2aa906bebd278bdac2622bb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We should fix or remove this ignored test. \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":"compiler/rustc_thread_pool/src/broadcast/tests.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"345667ec2316be520019683c14685e6385d2a07b718b8fa69974bba752227175"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We should fix or remove this ignored test. \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":"compiler/rustc_thread_pool/src/broadcast/tests.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a1f1099a2e05a6cc23e191a317c534166ffbe9ca135c856c2b7defd961e0314"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This is a quick hack to make the rustc binary able to locate \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":"compiler/rustc_target/src/lib.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecd2844602c0078f5be550caf26627b4a1b73d46a838498cb5c4a8b44a058030"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME before stabilization: Should we expose this as a \u0060hard-float\u0060 target feature instead of \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":"compiler/rustc_target/src/target_features.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab8b4a7cafabe377a658505995b596d1ad8b0b5acb2755a4548c437c18c8757b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#150253): msa requires either fp64 or no hard float support at all: LLVM requires fp64"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_target/src/target_features.rs"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d7cb0e390b42327fda2c2936b7dda2b005e2688aadfd42ade7a0047b8edcba7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#150253): msa requires revision 5 or greater (mips32r5/mips64r5 in LLVM)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_target/src/target_features.rs"},"region":{"startLine":665}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd622c8fbe2edddd83bed289a575ee69b25710f1a8fbe042a4e28d4d14804026"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: It\u0027s unclear what this feature means when \u0060v8plus\u0060 is disabled on 32-bit SPARC. See \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":"compiler/rustc_target/src/target_features.rs"},"region":{"startLine":1021}}}],"partialFingerprints":{"codehealthFindingId/v1":"68bd29390fc24c9fd65c3daeae6d8f6a048f9faa8cd23e8b66ec3ca37d5a56bc"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: might need changes for AVX10. \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":"compiler/rustc_target/src/target_features.rs"},"region":{"startLine":1173}}}],"partialFingerprints":{"codehealthFindingId/v1":"22a23f022af93d8597764978d2894387b9ca0e9b8232122eab91a29a006db1a7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: for some tier3 targets, we are overly cautious and always give warnings \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":"compiler/rustc_target/src/target_features.rs"},"region":{"startLine":1280}}}],"partialFingerprints":{"codehealthFindingId/v1":"a88a21ad1c001a3b7c4742951eed7f4abd8c61625b9aa3d6f5462b8452e592cb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME (https://github.com/rust-lang/rust/issues/133459): do we want to change the JSON"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_target/src/spec/consistency.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"a807f8448ac293b1a3d2334bde94af03f7cc698168ad53544cc27ef808aeba9c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: we do not currently set a target_abi for softfloat targets 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":"compiler/rustc_target/src/spec/consistency.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"116569e5c7480615be6f49df1c206029a00b7b87614e57dfe06d58e696bdc363"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: we do not currently set a target_abi for softfloat targets here, but we \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":"compiler/rustc_target/src/spec/consistency.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"537912701eedd5fc2fd738cd440b971d39d8c428873a652fda2728cba4eafc14"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Ensure that target_abi = \u0022x32\u0022 correlates with actually using that ABI. \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":"compiler/rustc_target/src/spec/consistency.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"a40ae3fa2cd067c25eae7778a5b23c8a0db5993beba063b7feb0f9ed42409038"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Ensure that target_abi = \u0022ilp32\u0022 correlates with actually using that ABI. \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":"compiler/rustc_target/src/spec/consistency.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"7267dcb157ef2a1396c6c08aa404247f25e6e0e639ec97102143dc1180e3b6fe"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Check that \u0060target_abi\u0060 matches the actually configured ABI \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":"compiler/rustc_target/src/spec/consistency.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"8093f968fdde56a5f1f993494794e538b50ff47b734d25b38f802d69e18de321"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Check that \u0060target_abi\u0060 matches the actually configured ABI (v2 vs v2hf). \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":"compiler/rustc_target/src/spec/consistency.rs"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffa6404b8d1ca61c8e80e939429d712d13a5924f439e807836b6313e2a28b520"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This doesn\u0027t properly validate anything and just ignores the data if it\u0027s invalid. \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":"compiler/rustc_target/src/spec/json.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d682aadcf1008cd22f9e6618e920cc338891999103651dbe56fcbddcaa46dd8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: better factor the Target definition so we enforce this on a type 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":"compiler/rustc_target/src/spec/json.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed8d4eaddd5b2023493f39f9a92339dc65927a4dbd4c7da5f772bdbcb610d4da"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This (probably?) implies that atomics should be a target modifier, at which point \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":"compiler/rustc_target/src/spec/mod.rs"},"region":{"startLine":2142}}}],"partialFingerprints":{"codehealthFindingId/v1":"577734da6338c2e31ce0a1a509163254ab6cc13e8f671ed059e33be72a978a84"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#112480) MSVC on x86-32 is unsound and fails to properly align many types with"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_target/src/spec/mod.rs"},"region":{"startLine":3106}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e98c911706a4a807116ee7a92daba74b1df4d38c6c0b39783740b86199929b4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: The leak sanitizer currently fails the tests, see #88132."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_target/src/spec/targets/aarch64_apple_darwin.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa2eeb54a9f1b08af488ef7e5762e2c94fc24746b122e9e1071e51388cc73016"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: The leak sanitizer currently fails the tests, see #88132."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_target/src/spec/targets/arm64e_apple_darwin.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"d51113496635e3d86842441e839a4c98a5b48f9334a865cdd54e9a34034bf76a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment repeated across 10 files: The identical FixmeComment appears in 10 files (10 occurrences) \u2014 almost certainly one boilerplate line from a single migration or decision, not 10 independent debts. Fix the systemic cause once rather than file-by-file. Text: \u0022// FIXME(compiler-team#422): musl targets should be dynamically linked by default.\u0022. Source code is not a task system: track the cleanup where tasks live. (Every occurrence still counts toward the score and metrics.)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_target/src/spec/targets/aarch64_unknown_linux_musl.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8846e5b5e0e1a33ff5d1afa32f38da5e67f5efb26de9e556daad0787e51a818"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#146996): Remove this override once #146996 has been fixed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_target/src/spec/targets/arm_unknown_linux_gnueabihf.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac8a796861aa406fd571889ac809a161e16921abe496f99a75c4c42754efb60e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: HVX length defaults are per-CPU \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":"compiler/rustc_target/src/spec/targets/hexagon_unknown_linux_musl.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dc9b3ef90e760b8aefca7f1010aabb1b94eca9aba9323e4c840e4d2fd3ad15c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: create tests for the atomics. \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":"compiler/rustc_target/src/spec/targets/nvptx64_nvidia_cuda.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"069f3188139c798f1c7245e152a668e7d9ed7494ae07750031828a19815ce0c1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(jordanrh): use PanicStrategy::Unwind when SEH 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":"compiler/rustc_target/src/spec/targets/thumbv7a_pc_windows_msvc.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4cb4020c23f7f777821169b9581d9e898434a2f9cfa436f34ae45bc7af0970c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(jordanrh): use PanicStrategy::Unwind when SEH 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":"compiler/rustc_target/src/spec/targets/thumbv7a_uwp_windows_msvc.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"765d31924622d632cec00dd1a113c7f624fac055109ee632133bce05344eab63"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Figure out cases in which WASM needs to link with a native toolchain. \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":"compiler/rustc_target/src/spec/targets/wasm32_wasip1.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"deb59a2483febdffaf21f300922d7dec35fdf983df60de3ef9abd791cf0dbb91"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Figure out cases in which WASM needs to link with a native toolchain. \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":"compiler/rustc_target/src/spec/targets/wasm32_wasip1_threads.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"55eced7e44d4f755e5e83944b3de93f5061c00f87a5d2603499a6f19357ae1c0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Figure out cases in which WASM needs to link with a native toolchain. \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":"compiler/rustc_target/src/spec/targets/wasm32_wasip2.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"4580b16b2de554873d1579c649f87887b9dc12bbe731b9b4e3b12bc69ad9aa09"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Figure out cases in which WASM needs to link with a native toolchain. \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":"compiler/rustc_target/src/spec/base/linux_wasm.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb4bea85a3f00ad565d4f8dafa60b4d3d47e7d65b0d449a4463c38a28e4ac0a2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Figure out cases in which WASM needs to link with a native toolchain. \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":"compiler/rustc_target/src/spec/base/wasm.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"7787d2eba5c15a8b8d7f9725e17cedcc9a034e9d9320a4a5cbaa5e396568ef41"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Sadly, turning these off here disables them in such a way that they \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":"compiler/rustc_target/src/spec/targets/x86_64h_apple_darwin.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"043333b3756dc73ae2b4eea571b10b17cefd4b2d0b782ef0a24ad63b918cc268"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#13846) this should be enabled for cygwin"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_target/src/spec/base/cygwin.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a2e545f249f1734da9f5b942b9d8d9874e125de0ab53cf43fe04aab27cc637e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This should be replaced by a more complete and generic \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":"compiler/rustc_target/src/spec/base/illumos.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"c47b1ac997aa47d4c8726ef3e735c8d886fc912f8f50fa434b59764a4f22f7ca"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This should be replaced by a more complete and generic \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":"compiler/rustc_codegen_ssa/src/back/linker.rs"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"48a5d05d87a546c2b54c511b1fe3895ff182be9e814f0eb2d261beb02154977a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Currently, rust is invoking cc to link, which ends up \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":"compiler/rustc_target/src/spec/base/illumos.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"e99ce676a374aa6ca23bca21c23140c34d63cb05cf1c5036711b6e17cd540801"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME we probably shouldn\u0027t pass this but instead pass an explicit list \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":"compiler/rustc_target/src/spec/base/linux_wasm.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a8c5edb0221e611d969344a6fbfdc3b221033beaf45b43ef052a388b0d86ee4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME 43575: should be MayOmit... \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":"compiler/rustc_target/src/spec/base/openbsd.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8177e6a4693edc0e0ed363487443b44779cd8def06495c9b15e1455df345f0d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: leaking this is kind of weird: we\u0027re feeding these into something that expects an \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":"compiler/rustc_target/src/spec/base/qnx_sdp.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b20d1093ee2d62b359962552772a6ba3cf1b3018ac98ceae5031c595292fe96"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#13846) this should be enabled for windows"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_target/src/spec/base/windows_gnu.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff6c066b4c2f3561b30316f61debc1b63079a0d7ba678256629c4c4c787c7b5b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(davidtwco): Support Split DWARF on Windows GNU - may require LLVM changes 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":"compiler/rustc_target/src/spec/base/windows_gnu.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"d99018fbf34ae3313e65688bd7cfcccacc9292b7604be04b6ec93c6167e40c83"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(davidtwco): Support Split DWARF on Windows GNU - may require LLVM changes 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":"compiler/rustc_target/src/spec/base/windows_gnullvm.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"cde51109db48b3e00c632d4fc1f79569aa525693d8bcde9042118e0625998011"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This should be updated for the exception machinery changes from #67502"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_target/src/spec/base/windows_uwp_gnu.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ea4adefcc4ffec3801ec9c42f983f4ebaf84cbfd235f7f31d10190b56ddd599"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(madsmtm): Warn about using these in the future. \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":"compiler/rustc_target/src/spec/base/apple/mod.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddb53e0e4f2f6287b60f9d239cc97a46bddbcb1d439a1e94471900533e7c11a8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: C ABI is not yet 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":"compiler/rustc_target/src/callconv/amdgpu.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea7e145d216e0caf4f02931488bcc9031d0bb6ffa0f5082ae8b62c8a2ff9d5af"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Update offset? \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":"compiler/rustc_target/src/callconv/mips.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"82c87cc38a55c7b9ab922de048eabebb0172dffe3bfd9e60151da8884a29f722"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(complex_numbers): c-variadic arguments are passed in GPRs, so need 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":"compiler/rustc_target/src/callconv/mips64.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"a22bfab0e760fab30d575eba4f0ec529ec4dba142709528065902d4ae9b71072"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // Hack to disable non_upper_case_globals only for the bitflags! and not for the rest \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_target/src/callconv/mod.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"66be7da2b1dcc151f5c7c81b81408bb569f27ed29e06f0422483a393a0d32c14"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Technically we should look at the amount of available \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":"compiler/rustc_target/src/callconv/mod.rs"},"region":{"startLine":857}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce72fe17912b2e615aa102f597e7f0a3021387488601ad7c3900a8cb15c7c104"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: extend to multi-variant enums (per-variant padding analysis 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":"compiler/rustc_target/src/callconv/mod.rs"},"region":{"startLine":932}}}],"partialFingerprints":{"codehealthFindingId/v1":"e77474f07427b7757c424df9737a49fa3a625393de72cdc94424ec222f0b27e6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME only allow structs and wide pointers 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":"compiler/rustc_target/src/callconv/nvptx64.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"14b1c0186e2e4a79ec892ecc195de07928c43574fc3c40b0bc70c03220bdfd10"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: use \u0060PassMode::Cast\u0060 here. In LLVM 23 doing so would hit \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":"compiler/rustc_target/src/callconv/powerpc64.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"12c82000b1892ab22f36524a9f92804a1fdf8df8e2e51cec6ddb220b76860173"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Update avail_gprs? \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":"compiler/rustc_target/src/callconv/riscv.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"525267bfa0d2099e00baec4b0a2025f8cd91e39c0f26b4126c5246b65ab4c889"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // Maybe, this is a FIXME \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":"compiler/rustc_target/src/callconv/x86.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ea96be56918b8d932aa8ef741a9f84e57e4905d0ce983857a0b72e9463fc7fb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Update int_regs? \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":"compiler/rustc_target/src/callconv/x86_64.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"536ecfca73e0924dcbe61c80d68f93547d5469e347cb825f3b6ccf7b69729529"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: MSVC 2015\u002B will pass the first 3 vector arguments in [XYZ]MM0-2"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_target/src/callconv/x86_win32.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"99b9eb7c2b860c830a888b4635cee6a58039f9fe0cfc86a006e18999ced7d37e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(eddyb) there should be a size cap 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":"compiler/rustc_target/src/callconv/x86_win64.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"8445f494a94d047cd6d679264d1f115db059ea39c59411e9992a1f2982722e76"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Reserve $t0, $t1 if in mips16 mode. \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":"compiler/rustc_target/src/asm/mips.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5f43ff98f68244399eb22618bb333acdc5f9922bcc72e0fa170bfaea3328b57"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: use direct symbol comparison for register names \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":"compiler/rustc_target/src/asm/mod.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"cff85aa49ee433359a8a7422340cdb0ccc64795777f966d72b0d3e92a7f05364"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Once LLVM adds support for the \u0060q\u0060 extension, \u0060d\u0060 will no longer \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":"compiler/rustc_target/src/asm/mod.rs"},"region":{"startLine":1084}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8b0a40ede106ef4f230563ed26bad55d4ad989f41e6b0221c7e3075de884206"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(f16): Add \u0060f16\u0060 if/when it becomes the standard ABI. \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":"compiler/rustc_target/src/asm/powerpc.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"37264abbef911e43d3d9ae54d22da4c2f15a9974ac75cf108fbf286b156b8fde"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: vsx also supports integers?: https://github.com/rust-lang/rust/pull/131551#discussion_r1862535963"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_target/src/asm/powerpc.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e69467b17c08d5accf0cbb66917e604126dc315e19cfeaff98bcebccc020912"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(f128): Add \u0060q: F128;\u0060 once LLVM support the \u0060Q\u0060 extension. \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":"compiler/rustc_target/src/asm/riscv.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"43fcf6e8e64062b94a47e736d633735e1097e439b8de002feda680fec1420347"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: i64 is ok for g*/o* registers on SPARC-V8\u002B (\u0022h\u0022 constraint in GCC), \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":"compiler/rustc_target/src/asm/sparc.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7f46ae44f40ab7000ad5ac6c36ae5f233644cab0a30925674d3865d527d582b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Section 2.1.5 \u0022Function Registers with Unassigned Roles\u0022 of the V8\u002B Technical \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":"compiler/rustc_target/src/asm/sparc.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f494b01c8f5c3818deed7e630a0b86894c024f25e29e2187643f41deffc897e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This is the what GCC/LLVM currently use to limit access to upper-half registers, 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":"compiler/rustc_target/src/asm/sparc.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"e12c5f37f2c8503ad8213602f82a01223ee09ccbe238d8e54efc96320c9129e5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: %g1 is volatile in ABI, but used internally by LLVM. \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":"compiler/rustc_target/src/asm/sparc.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"c751cfad83c86311e76f92de2a8ab4f91e2af7260b6d35ac95983e81de8effc7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // \u003E FIXME: G1 reserved for now for large imm generation by frame 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":"compiler/rustc_target/src/asm/sparc.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"71d7f51c15ed1c266fc2c329237d9bf44e4cfc4088872ffcd80ac03a66cc1145"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: 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":"compiler/rustc_symbol_mangling/src/export.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"90bed65c70831d11f9781be58ae266bae4a77c69345af78c59e655694d3b9e8d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(async_closures): This shouldn\u0027t be needed when we fix \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":"compiler/rustc_symbol_mangling/src/legacy.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e4df0b3fb21e70e8aca95d8762a2c2ec63c99b1a85ac2efcd154f528e71df42"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(async_closures): This shouldn\u0027t be needed when we fix \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":"compiler/rustc_symbol_mangling/src/v0.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b09cb8a53a6cc67a2cc104a567d3d78265b1fed801a740b40a038ec0c7f3450"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK(eddyb) this relies on using the \u0060fmt\u0060 interface to get \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_symbol_mangling/src/legacy.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"418c651ec55d23fffde4974474c4cc1df26e6bc0e6e8532761cb5f3562ca1214"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK(eddyb) print the path similarly to how \u0060FmtPrinter\u0060 prints it. \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_symbol_mangling/src/legacy.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5b402c420ad239ceed549522b5d7118b6854c3ac02ee369b5dc1be4b90b5465"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK(eddyb) print the path similarly to how \u0060FmtPrinter\u0060 prints it. \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_symbol_mangling/src/legacy.rs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"842ad673e3c8718c6e88d62038c5034de54833647939c8f414bd14455dac4ec4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(eddyb) this should ideally not be 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":"compiler/rustc_symbol_mangling/src/v0.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"04080f7b5a761b0c5899f0b9d2f54830d67d8c5a1dc12fc6155186ebcfb0a55d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME mangle again once no_std on a target with std support doesn\u0027t need it or build-std \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":"compiler/rustc_symbol_mangling/src/v0.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"f627fcc77f599c89e19f748c727b410134317b3d43c7551062fa4be6246b50da"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(flip1995): See comment in \u0060mangle_typeid_for_fnabi\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":"compiler/rustc_symbol_mangling/src/v0.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"849793a21a9e14a94a7cde1dc98ffca5f66d0d81aa7b9b6b032b26a91f018080"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(non-lifetime-binders): 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":"compiler/rustc_symbol_mangling/src/v0.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"24d32b5da4f6f880785f4a675c3b181c1722314ab68c03f45d49dbf6dcfec359"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(splat): \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":"compiler/rustc_symbol_mangling/src/v0.rs"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a64a368d50c0aeb5373b6ff304877e29719a7ea61315e742d5771c4783488c5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(unsafe_binder): \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":"compiler/rustc_symbol_mangling/src/v0.rs"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"17c253785cd44806c86fd47a9fcdba40ca0c2278fe36e65cfb1be6cac9a044f6"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK(jaic1): hide the \u0060str\u0060 type behind a reference \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_symbol_mangling/src/v0.rs"},"region":{"startLine":835}}}],"partialFingerprints":{"codehealthFindingId/v1":"cca570f0e67632aed3161c4a32bb51a8cd6b3770e9afa8514b8d38eb25f50c10"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(eddyb) use a specialized hex-encoding 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":"compiler/rustc_symbol_mangling/src/v0.rs"},"region":{"startLine":847}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b958c105e76382236e14f14a4995f1748df7dc47a0cd5c75364f977ebe128cb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(valtrees): Remove the special case for \u0060str\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":"compiler/rustc_symbol_mangling/src/v0.rs"},"region":{"startLine":855}}}],"partialFingerprints":{"codehealthFindingId/v1":"e676b1c8a3948c92349f9a92e120e2952b8d187a3ab9869c42a4cb8305cbed23"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK(eddyb) this mimics \u0060print_path_with_simple\u0060, \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_symbol_mangling/src/v0.rs"},"region":{"startLine":921}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a5c51a4eae6fa40e6e9effaec8dabb872b96c78b30fb18b8dd2c8100b234f05"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(eddyb) we should probably roll our own punycode implementation. \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":"compiler/rustc_symbol_mangling/src/v0.rs"},"region":{"startLine":1099}}}],"partialFingerprints":{"codehealthFindingId/v1":"f20a03ad4a8d572d0d90846ba155138765eb3edfd3b971bc6dc15e6bf18e70ec"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(eddyb) avoid rechecking UTF-8 validity."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_symbol_mangling/src/v0.rs"},"region":{"startLine":1110}}}],"partialFingerprints":{"codehealthFindingId/v1":"71fdcd64ce45da2ad1fc357ab50e3c229e95e661ce495d937376e63568811a84"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(typed_def_id): Replace this with \u0060as_mod_def_id\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":"compiler/rustc_span/src/def_id.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6790d23b2aeb50992950d0de249e0557f9c912b70f713a3e31b7a87ddf65587"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: this solution does not take into account syntax contexts and expansion ids \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":"compiler/rustc_span/src/hygiene.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"983756a0fff47acc944fb3416440200dfc1acb85706939acae8bed2e5cd8ba5a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: completely remove this clone \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":"compiler/rustc_span/src/hygiene.rs"},"region":{"startLine":1491}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c61db77c6b9baf4b98c5592f703834c26a2e20722244af60dadaf2dd4ebc731"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: /// Hack in \u0060src/librustc_ast/parse.rs\u0060. \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_span/src/lib.rs"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"e079539ac68901a17089aa4a2f60db899fce50400ae0005d4c288a753d1a7699"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(jseyfried) \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":"compiler/rustc_span/src/lib.rs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"180ed18a1a495720e76eea4635e819c31a5d80ecfe0ded2ababc29a657319269"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: If this span comes from a \u0060derive\u0060 macro but it points at code the user wrote, \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":"compiler/rustc_span/src/lib.rs"},"region":{"startLine":797}}}],"partialFingerprints":{"codehealthFindingId/v1":"44d061358e2cbf4fce5f106d7d2844dbc24efb84ebc11f6cdcdcc979a8962045"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This does limit the usefulness of the error when the macro 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":"compiler/rustc_span/src/lib.rs"},"region":{"startLine":1265}}}],"partialFingerprints":{"codehealthFindingId/v1":"2887e9c63793e120f8fa88fced480a78902f884986cee5c92061a364b0b9573f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: we\u0027ll want better handling of this in the future for the sake of tools \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":"compiler/rustc_span/src/lib.rs"},"region":{"startLine":2565}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fa6f3e7150889ed9bd6d8b9280fe3987b3256e25f0003b272e3e04cec9ea144"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: \u0060unicode_width\u0060 sometimes disagrees with terminals on how wide a \u0060char\u0060 is. For now, \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":"compiler/rustc_span/src/lib.rs"},"region":{"startLine":2582}}}],"partialFingerprints":{"codehealthFindingId/v1":"070fe1b8dd5dd6d4e3f7522fa80b27eb4bdaafcbea8d9fb048a46974954c68ff"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: now that we handle DUMMY_SP up above, we should consider \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":"compiler/rustc_span/src/source_map.rs"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"552334a3b3ce4d6703fe5207ce62c696a1ac0056d45651996649913921586664"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: extend the AST items to have a head span, or replace callers with pointing at \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":"compiler/rustc_span/src/source_map.rs"},"region":{"startLine":938}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc5e653afce26888a4248aec2abec1cb5512b53129c3d8898c9078eaf406b108"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#82232, #143834): temporary name to mitigate \u0060#[align]\u0060 nameres ambiguity"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_span/src/symbol.rs"},"region":{"startLine":1807}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c123340dd4e8cf63602e3ed9a787d2c22de1707d6cdffc203b8f151fb6322a3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#159429): temporary rename to avoid \u0060#[unroll]\u0060 nameres ambiguity"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_span/src/symbol.rs"},"region":{"startLine":1924}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f08843fe3d5188732bfc07d8380207d7d536de9fbd4c5ae91629f29bd519b7a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(panstromek): we could do better if we take into account whether this 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":"compiler/rustc_span/src/symbol.rs"},"region":{"startLine":2908}}}],"partialFingerprints":{"codehealthFindingId/v1":"200f9401c82b19d842aecd9d5c90dc03563156c09ef3060f2fce5fb6f5535b1e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#160895): Using -Znext-solver as default on nightly"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_session/src/config.rs"},"region":{"startLine":1076}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ae791e2d0ad05843b79fba23a2dd8f78e30a92beb5d4f449b68cf5cb588621f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This is sketchy that we\u0027re not appending \u0060.rcgu\u0060 when the ext is empty. \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":"compiler/rustc_session/src/config.rs"},"region":{"startLine":1370}}}],"partialFingerprints":{"codehealthFindingId/v1":"560e1707ce59a7918effcde2fee84042c23daa4493915ae1e7ab8223864e09e2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(Urgau): This is a hack that ideally shouldn\u0027t exist, but rustdoc \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":"compiler/rustc_session/src/config.rs"},"region":{"startLine":1513}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c04e7613df34999ed12ad79166e3121a26865467d3feb3cd6dbf0c56e71c4da"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this is only mutation of UnstableOptions here, move into \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":"compiler/rustc_session/src/config.rs"},"region":{"startLine":2970}}}],"partialFingerprints":{"codehealthFindingId/v1":"aea57cd6932f5ef06fdc4e7ec484783aa90d095b97e95cc8c0cb38d07670d32f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#100717)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_session/src/diagnostics.rs"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"47503b7192bcfaf54ba5bef950969cc0c07ab7beda18cfaac688e8114e35e948"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(ZuseZ4): print an error saying which value is not recognized \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":"compiler/rustc_session/src/options.rs"},"region":{"startLine":1587}}}],"partialFingerprints":{"codehealthFindingId/v1":"177d3d8d7716908fac37f29cb438d1ca24d856c63969959b805cb9d8ce2c6a4a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(ZuseZ4): print an error saying which value is not recognized \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":"compiler/rustc_session/src/options.rs"},"region":{"startLine":1633}}}],"partialFingerprints":{"codehealthFindingId/v1":"1318c036839e1264acb4da62f577f9f014db5388e0ec6d98e6552626bddadb4e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(kobzol): remove in 2027 \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":"compiler/rustc_session/src/options.rs"},"region":{"startLine":2558}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fea187126dab43d10800316b356e84badd22a9b49bc9faeb42f17bff8cc000a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME remove this after a couple releases \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":"compiler/rustc_session/src/options.rs"},"region":{"startLine":3066}}}],"partialFingerprints":{"codehealthFindingId/v1":"88cb827c3ecc369b45dae4fcd7210eb1206c95d0ecd6096ae568be78e2d07457"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(jchlanda) We don\u0027t yet support function pointer type discrimination. \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":"compiler/rustc_session/src/session.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"65e2a83d002664915fe67b54f2382cb8a4997a353763fe4454ba73086cd9c37e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(jchlanda) This is not an exhaustive list of all \u0060ptrauth\u0060-related attributes, but only \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":"compiler/rustc_session/src/session.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"83cc60f12c0bccbca5879ea908b7fee3ba67497c0c66996bc45d2b98cb443a8b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(madsmtm): Track changes to this. \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":"compiler/rustc_session/src/session.rs"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dbcff66c8afffc3f3a85721e91879cf7002ed9990a3a17c0ccfeed2e57a4ca3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // JUSTIFICATION: necessary use of crate_types directly (see FIXME below) \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":"compiler/rustc_session/src/session.rs"},"region":{"startLine":783}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f2855ca67a61a39e40112ae0ef28b75f2af0b65da63e6ff4a85de79a1ceb8b2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: When crate_type is not available, \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":"compiler/rustc_session/src/session.rs"},"region":{"startLine":790}}}],"partialFingerprints":{"codehealthFindingId/v1":"379427269ddfebad6cdaae55d2efb69a363d7eccadbbb065fab0b2c1a3d38ebf"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This is not general enough to make the warning lint completely override \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":"compiler/rustc_session/src/session.rs"},"region":{"startLine":1356}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e14f662e020cfdc4305dfa42ef7a62be715ef8f9b81cfb46a669f81cf74650a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME use host 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":"compiler/rustc_session/src/session.rs"},"region":{"startLine":1444}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9da67cdee4d9c581c9357346793bc4c699eebb545a1f4c5db62b25e1594e586"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(jchlanda) Pauthtest does not support static linking. It must be dynamically linked, \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":"compiler/rustc_session/src/session.rs"},"region":{"startLine":1649}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff362d6f6a06823e86d9f1a1ee2f5897185df228592701035a5ca43d51304d2b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(jchlanda) Pauthtest does not support static linking. It must be dynamically linked, \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":"compiler/rustc_metadata/src/native_libs.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"53b68d748db357b308a77eea2a42281b3b891eb5fafb92105b9a98113b9067d2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: In principle, the inherited base LLVM target code model could be large, \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":"compiler/rustc_session/src/session.rs"},"region":{"startLine":1847}}}],"partialFingerprints":{"codehealthFindingId/v1":"a35dcda1512c9a7184e26f0b1f53c194743873289ec8354352ab0bae21a383f4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME remove this. This is only here because CacheEncoder, which does not need to be \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":"compiler/rustc_serialize/src/serialize.rs"},"region":{"startLine":838}}}],"partialFingerprints":{"codehealthFindingId/v1":"60893fd8c09a244c4cd4a794cedccdd1c8eb313299f91c661c1e048e09b7d54d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Add support for filtering SAFESTACK, SHADOWCALLSTACK, MEMTAG, and REALTIME. \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":"compiler/rustc_sanitizers/src/ignorelist/mod.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9abfb13c32cb5fc46d39f8a85dc93649425f46a4af6391c149ea3b6cabde603"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: could stand to merge this and the prior match arm \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":"compiler/rustc_sanitizers/src/cfi/typeid/itanium_cxx_abi/encode.rs"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"6867e85ddf55f2a18b2c2d23642281dc62a31044e3a33e5e5c7bbd799530a8af"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This can definitely not be so spaghettified. \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":"compiler/rustc_sanitizers/src/cfi/typeid/itanium_cxx_abi/encode.rs"},"region":{"startLine":696}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd1d9767e4f1b7f644223d55d021bb3c1d25a81cac9d0600b569af4f212539a0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(unsafe_binders): Implement this. \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":"compiler/rustc_sanitizers/src/cfi/typeid/itanium_cxx_abi/encode.rs"},"region":{"startLine":722}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5f739a14dd197330c5370558ec2263bd583d490d383df3a3295ab3fab5981fd"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME(rcvalle): This allows a drop call on any trait object to call the drop function of any \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":"compiler/rustc_sanitizers/src/cfi/typeid/itanium_cxx_abi/transform.rs"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"04c9396950fe94a065502c4cf79b21cc34aa1f8c05adfb4ed362385443412eaa"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: account for async-drop-glue: similarly to DropGlues (see transform_drop_glue), \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":"compiler/rustc_sanitizers/src/cfi/typeid/itanium_cxx_abi/transform.rs"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"416e5e21827aaffd016545b07c06ed5653f25e007648e93c0b754cd0e061c09c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: account for async-drop-glue (see the FutureDropPollShims and AsyncDropGlueShims \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":"compiler/rustc_sanitizers/src/cfi/typeid/itanium_cxx_abi/transform.rs"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9cc2540868c57b9b8726497181fe5d54c80b7317ae0067e156ced0e465eef93"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(parallel_import_resolution): We lock the entire map to make sure \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":"compiler/rustc_resolve/src/build_reduced_graph.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"2134f97a1b4ef432cbca35b71d258500d4fbcba8b05f33feb25be61c59f9b2de"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Account for \u0060#[no_implicit_prelude]\u0060 attributes. \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":"compiler/rustc_resolve/src/build_reduced_graph.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"6824e48e6c60daeef2b9563a0ba683a3830afd38b701a4d45d2b5c15e45d3629"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this error is technically unnecessary now when extern prelude is split into \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":"compiler/rustc_resolve/src/build_reduced_graph.rs"},"region":{"startLine":1067}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ba9d4a06aa646d679b8ed3e1035c26cd26144e3b251dc5b813e3d50a3175400"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This branch is used for reporting the \u0060private_macro_use\u0060 lint \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":"compiler/rustc_resolve/src/build_reduced_graph.rs"},"region":{"startLine":1204}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e67f74385e9bbb3b53c17e0613343bc01db1093907edf69b56db80602412578"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(jdonszelmann) make one of these in the resolver? \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":"compiler/rustc_resolve/src/def_collector.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ec21e264f0c006fec65d5d3b5e3e00e4207e9200841665956f362398888b10d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(jdonszelmann) don\u0027t care about tools here maybe? Just parse what we can. \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":"compiler/rustc_resolve/src/def_collector.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1b2a6930cb201dd94e6fefa8c4711562733db479a848c399cd0e6cd06aeecb8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(jdonszelmann): emit lints here properly \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":"compiler/rustc_resolve/src/def_collector.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"156d9d90ea3fec58f78d244cf7f2afd89cfdbb1c25804834489875a73a313b6b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(impl_trait_in_bindings): We don\u0027t really have a good way of \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":"compiler/rustc_resolve/src/def_collector.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c56e1d4939c12f277c92e0cd378eabf81c4e2b4b455ccf7286ff29bbf0aa1d9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// For now, this doesn\u0027t resolve macros (FIXME) and cannot resolve Impl, as we \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":"compiler/rustc_resolve/src/effective_visibilities.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf33f6f049d46405482a25b04a75186e6361c6cd6d827481173f3b08c48e3901"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We could compute this lazily in \u0060unreachable_pub\u0060 directly, but this is less invasive. \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":"compiler/rustc_resolve/src/effective_visibilities.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"054cfc418df9d935cef70f2482d7a6aa1372570baccaf9e80bff389ef05b4ee6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: defs should be checked with \u0060EffectiveVisibilities::is_reachable\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":"compiler/rustc_resolve/src/effective_visibilities.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e77e62c62462307ad8e1ddb12e2307f4aed10246e36744f3b81eb2611988f3d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // 1. FIXME: Ribs (type parameters), there\u0027s no necessary infrastructure yet \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":"compiler/rustc_resolve/src/ident.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"40e0947e1c8c784b3f400078a90c0c4608a039c932cdfae9514c86979cfc1f3d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // 1. FIXME: Ribs (local variables), there\u0027s no necessary infrastructure yet \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":"compiler/rustc_resolve/src/ident.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff7d845fa9b6891b0dcfb650f88f1b8b81f3e5daeb2085adc98420b9ac126d41"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(jseyfried) improve \u0060Self\u0060 hygiene \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":"compiler/rustc_resolve/src/ident.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6dd5c616cb9bea85548d40d359cb4e7ea7576509677fcbe208e2ca0812008a8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Use \u0060scope\u0060 instead of \u0060res\u0060 to detect built-in attrs and derive helpers, \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":"compiler/rustc_resolve/src/ident.rs"},"region":{"startLine":855}}}],"partialFingerprints":{"codehealthFindingId/v1":"8262499d94953259d1ab52c8da6e499e6fbc84c90c83b84612231f67d39a8270"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this error is too conservative and technically unnecessary now when 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":"compiler/rustc_resolve/src/ident.rs"},"region":{"startLine":896}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d0f0a9e326eaeab5c6c92118dd0f577bbca54be6c2556e21610e4093e17dd23"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Remove with lang team approval. \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":"compiler/rustc_resolve/src/ident.rs"},"region":{"startLine":907}}}],"partialFingerprints":{"codehealthFindingId/v1":"e06f2f2d426bfca49110d3484b4b64a74128eb4c350422226efc171f1d87848c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Remove with lang team approval. \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":"compiler/rustc_resolve/src/ident.rs"},"region":{"startLine":914}}}],"partialFingerprints":{"codehealthFindingId/v1":"4215588d85908ee733d697bf46b7ec35bd8927df9f5e08cf89cbe7bc13786bbf"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Remove with lang team approval. \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":"compiler/rustc_resolve/src/ident.rs"},"region":{"startLine":930}}}],"partialFingerprints":{"codehealthFindingId/v1":"a476ec169e519509164d5d7e4ebba00b98b5b935575c5b655368d3149ca47b9b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: reword, as the reason we expected a module is because of \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":"compiler/rustc_resolve/src/ident.rs"},"region":{"startLine":2179}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6acfb4d33e7c2a2ec37de7f0facf4bdfc25acb994cb2f3fa12e7d204d96e650"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: this function considers \u0060single_imports\u0060, but not \u0060unexpanded_invocations\u0060, so \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":"compiler/rustc_resolve/src/imports.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"f855c09e7eb51a65be570824af73de6f303cc2bf2e877b40e7355c3575161d53"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: relationship between this function and similar \u0060DeclData::determined\u0060 is unclear. \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":"compiler/rustc_resolve/src/imports.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9326399a661afca0c6188dbbc1053109af3bdcaf316721ed7d5a6550226e401"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this special case shouldn\u0027t be necessary, but removing it triggers an ICE \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":"compiler/rustc_resolve/src/imports.rs"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"e73a32e05d81f882b3d5995972cb61d338c23d4cd26b72bb2f21b27e6576e385"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: there should be a better way of doing this than \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":"compiler/rustc_resolve/src/imports.rs"},"region":{"startLine":989}}}],"partialFingerprints":{"codehealthFindingId/v1":"f23fe1db1a6540bb86843e0a40773c3020eda6ff253235bde8fa4b672f9b7e13"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Do not check visibility-ambiguous imports for now. To check them \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/imports.rs"},"region":{"startLine":1023}}}],"partialFingerprints":{"codehealthFindingId/v1":"025749830994f8f0548ef76f7e34afec4270a3b5dc735fa9a37e733808cf96db"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK(eddyb) \u0060lint_if_path_starts_with_module\u0060 needs at least \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/imports.rs"},"region":{"startLine":1332}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9fdc701cb2464d65b1da3b4edbd86c0ef8ca9b00f246cf4f3601212f0eb1afe"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK(eddyb) \u0060lint_if_path_starts_with_module\u0060 needs at least \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/imports.rs"},"region":{"startLine":1632}}}],"partialFingerprints":{"codehealthFindingId/v1":"36396d61f852f1740d1e8912e94a0d346d468612c547aeae02f501a7c88708a4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This assert may fire if public glob is later shadowed by a private \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":"compiler/rustc_resolve/src/imports.rs"},"region":{"startLine":1464}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f7eaf1816013f619fef3dcf75cb0ebafd2a12a627e134e2578dd4695f68a84b"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK(eddyb) this shows up for \u0060self\u0060 \u0026 \u0060super\u0060, which \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/imports.rs"},"region":{"startLine":1570}}}],"partialFingerprints":{"codehealthFindingId/v1":"c22ef878d0b8d660c8c74d118d2e474fac9ce05d10d6d9a708d003fe9d7ab101"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // Hack for the \u0060rust_embed\u0060 regression observed in the crater run of #145108. \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/imports.rs"},"region":{"startLine":1884}}}],"partialFingerprints":{"codehealthFindingId/v1":"302c53c8df1d5ed9e15f3a2a310804e9a7731b28c5c27335becd97ae49abce61"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: There is no dedicated error code for this case yet. \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":"compiler/rustc_resolve/src/late.rs"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb5b48557ecafc74723cf415c68377c04efc71e51939eb2dc1bab8d43446cc6d"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: we use find_ancestor_inside to properly suggest elided spans in paths \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/late.rs"},"region":{"startLine":2423}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cebf7a61d138e7c0df19ad7aa2b9dd0fbed394d9bd1f174b00b18f28083f4e2"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: we use find_ancestor_inside to properly suggest elided spans in paths \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ast_lowering/src/path.rs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fa4470d7317f6a87720a0b37c21f84ab52a2cfff047da1bf7578dcda43c3551"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(non_lifetime_binders): Stop special-casing \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":"compiler/rustc_resolve/src/late.rs"},"region":{"startLine":3416}}}],"partialFingerprints":{"codehealthFindingId/v1":"0595aa4d564bcbb39fe0a6d3eedcccbad043aded2c899c879c324a4e0cfb49dd"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK(min_const_generics, generic_const_exprs): We \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/late.rs"},"region":{"startLine":3522}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e5cd2d594afe40995b71e93b730681ac04d1f56dacecc987982d176dd6ccd85"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME(fn_delegation): remove it when resolution through \u0060ProbeContext\u0060 will be ready \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":"compiler/rustc_resolve/src/late.rs"},"region":{"startLine":4031}}}],"partialFingerprints":{"codehealthFindingId/v1":"555575a3a50337a7e0f707ecdb841cd420db0ac20c88500185cf0869ae22f035"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(fn_delegation): use correct identifier hygiene \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":"compiler/rustc_resolve/src/late.rs"},"region":{"startLine":4041}}}],"partialFingerprints":{"codehealthFindingId/v1":"aee8d8b1a4c35c41f77c5031c5c330a18bd96d95496464bf80fafcd12758ae5b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(fn_delegation): use correct identifier hygiene \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":"compiler/rustc_ast_lowering/src/delegation/resolution.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"96d86f8c991bca9de2d264c37fe1340bfa21ba7a3486880a3f1f9e95eb321609"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: because we don\u0027t want to track the \u0060TyCtxtFeed\u0060 through the resolver to here \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/late.rs"},"region":{"startLine":4101}}}],"partialFingerprints":{"codehealthFindingId/v1":"8958f3532e0ea7afdf2d0970b5e330cc9270e13ac78c322549e6562ae066e5d6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(guard_patterns): For \u0060if let\u0060 guards, we\u0027ll also need to get 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":"compiler/rustc_resolve/src/late.rs"},"region":{"startLine":4641}}}],"partialFingerprints":{"codehealthFindingId/v1":"6889ed88910314ffb8909ee0b8b8d274d102e54689249f6bbfdb87ed87519982"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(mgca): legacy const generics doesn\u0027t support mgca but maybe \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":"compiler/rustc_resolve/src/late.rs"},"region":{"startLine":5643}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0a64d3fec624bf7b032979bc973a8fee9c56030d16eb11fc697cffd193340c9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This caching may be incorrect in case of multiple \u0060macro_rules\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":"compiler/rustc_resolve/src/late.rs"},"region":{"startLine":5765}}}],"partialFingerprints":{"codehealthFindingId/v1":"6854c41f3a49ca3d8e4f599e1c97810cbc34ddda5f5c9544e5fa2f9189d4d31a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: hygiene is not considered. \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":"compiler/rustc_resolve/src/late.rs"},"region":{"startLine":5852}}}],"partialFingerprints":{"codehealthFindingId/v1":"17ec3c66e13cdbed033e9f416e7f4d319373af9120c4e864922f78e7a23a4563"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(generic_const_parameter_types): This should give custom output specifying it\u0027s only \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":"compiler/rustc_resolve/src/lib.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"109955c1ab90319a2cd15494766212cad215f2c145dbe19b56c1b26fd22c9547"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this output isn\u0027t actually present in the test suite. \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":"compiler/rustc_resolve/src/lib.rs"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"c84f93a7d3cccc75e696f5ce6eea773e6f01e9566658ac34682609dc15a59f99"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: this function considers \u0060unexpanded_invocations\u0060, but not \u0060single_imports\u0060, so \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":"compiler/rustc_resolve/src/lib.rs"},"region":{"startLine":1297}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9ececafd810a7d8709d790e0699a36a5a823c6cf97bf8a9756c9bfb3a61d5c4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: relationship between this function and similar \u0060NameResolution::determined_decl\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":"compiler/rustc_resolve/src/lib.rs"},"region":{"startLine":1299}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fa54295b2eeb3b884eaf6c2e3c376200aac055f823cb8d17fd4286e9578994e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: \u0060derives\u0060 are missing in these parent scopes and need to be taken from elsewhere. \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":"compiler/rustc_resolve/src/lib.rs"},"region":{"startLine":1498}}}],"partialFingerprints":{"codehealthFindingId/v1":"4111880d113cbfbe77ed8777e8502ca99e1dd5befb6974913b9cc765f3b054d9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: remove \u0060def_span\u0060 body, pass in the right spans here and call \u0060tcx.at().create_def()\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":"compiler/rustc_resolve/src/lib.rs"},"region":{"startLine":1740}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f2eb308d1ea310a429f9bd9d8489319474b5fb4617ee9e08473c45981d121e9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: reject \u0060--extern self\u0060 and similar in option parsing 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":"compiler/rustc_resolve/src/lib.rs"},"region":{"startLine":2760}}}],"partialFingerprints":{"codehealthFindingId/v1":"803ab887e44a04ff73ee2ebda62f18641ec6524f30df597b9d2a5c18fad7b5e5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME this should instead be using tool attribute imports or something similar \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":"compiler/rustc_resolve/src/macros.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"3233a0cd573125c2f8d1d4a0c6ad08927e0094268d6135eb3099dd2c0e4fd489"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#124794): unfortunately this doesn\u0027t work with \u0060#[derive(Clone)] #[derive(Copy)]\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/macros.rs"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"d773adefb000d0b67c4199ebf4d04479dfb43ac2bf891d184a5c9f1d868068d2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(makai410): this also doesn\u0027t work with \u0060#[derive(PartialOrd)] #[derive(Ord)]\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":"compiler/rustc_resolve/src/macros.rs"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"03b325dffd6a0eaee61df75fe5ede73fbd29e7b35921d70ec69dd8917c5c5e51"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Instead of waiting try generating all trait methods, and pruning \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":"compiler/rustc_resolve/src/macros.rs"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7a4cd9a3900f6b9c18389ea838cfa3abdec68e75eb525050c8bd3746f07e851"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Adjust hygiene for idents from globs, like for glob imports. \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":"compiler/rustc_resolve/src/macros.rs"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd317932a7efb7889777ec86a8627f0d8ef1ec9b78ed9d8ee8a9e68b3a0df1f9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Path resolution will ICE if segment IDs present. \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":"compiler/rustc_resolve/src/macros.rs"},"region":{"startLine":943}}}],"partialFingerprints":{"codehealthFindingId/v1":"084c178cdbfe7f27fa025e278e95758f32b2d45a6fc7a9ed95126be4b1828629"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK(Urgau): This shouldn\u0027t be necessary \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/macros.rs"},"region":{"startLine":1296}}}],"partialFingerprints":{"codehealthFindingId/v1":"a13a8851cd6c9b1242021f74ef46637ef0c8613127550a64ba22d241fc2f89ee"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(vincenzopalazzo): make the check smarter, \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":"compiler/rustc_resolve/src/late/diagnostics.rs"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"80972b405354726ce18f66b4ce56ca5ffcb6d51b81267e01615c78052a3e5f68"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(new_range): Also account for new range 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":"compiler/rustc_resolve/src/late/diagnostics.rs"},"region":{"startLine":2065}}}],"partialFingerprints":{"codehealthFindingId/v1":"84b5e076188aae03fb00b34886194e759c2d1b5ce93fad6bfac1bb18b5c06c47"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const_generics): Add \u0060DefKind::TyParam\u0060 and \u0060SelfTyParam\u0060 once we support generic \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":"compiler/rustc_resolve/src/late/diagnostics.rs"},"region":{"startLine":2207}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dc4e9ad446e401ca8f7dfe744920967d4bff8744ee517a2b9169adb6b4fdf0b"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK(estebank): find a better way to figure out that this was a \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/late/diagnostics.rs"},"region":{"startLine":2413}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca93b23ba0ca15b093338510562662c4109b31d873c093f4c4652b5cc9342582"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This doesn\u0027t include impls like \u0060impl Default for String\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":"compiler/rustc_resolve/src/late/diagnostics.rs"},"region":{"startLine":3183}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a41948f4a5753f2ee2b713972a5199c815be9ccbd9fdf10dff62891961be896"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this is not totally accurate, but mostly works \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":"compiler/rustc_resolve/src/late/diagnostics.rs"},"region":{"startLine":3432}}}],"partialFingerprints":{"codehealthFindingId/v1":"31a715b0ca58fb0283a58f9b3425199ea4997cc34fd0d143d8ce73a22959bf3f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: what follows are general suggestions, but we\u0027d want to perform some \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":"compiler/rustc_resolve/src/late/diagnostics.rs"},"region":{"startLine":4728}}}],"partialFingerprints":{"codehealthFindingId/v1":"c67e130208cada1b41349166171341e7e662a76b77b851c5e36484f0275669bd"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //FIXME: make this a proper lint. \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":"compiler/rustc_resolve/src/late/diagnostics.rs"},"region":{"startLine":5120}}}],"partialFingerprints":{"codehealthFindingId/v1":"efa157b5088dbbaedc243a38f146ca003af7f8bbd4314aa9b936ed09d22e6a6a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This still doesn\u0027t count, e.g., elided lifetimes and APITs. \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":"compiler/rustc_resolve/src/late/lang_items.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd9eaf894a5ce937c861bd6bd09ce4225fa0347deec49465f1808864cfe0daa4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(Manishearth) ideally the emitting 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":"compiler/rustc_resolve/src/diagnostics/impls.rs"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cad470cc316ddfd08ba222ddbee352936494c4e65c005c98fde882a94f31354"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: may also be stabilized for Rust 2015 (Issues #45477, #44660)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/diagnostics/impls.rs"},"region":{"startLine":1751}}}],"partialFingerprints":{"codehealthFindingId/v1":"9557c0cd6e7eeff6f58362c841c9f808f95cb81234e44aa9df1c5c17e28a4ba1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this only works if the crate that owns the macro that has the helper_attr \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":"compiler/rustc_resolve/src/diagnostics/impls.rs"},"region":{"startLine":2240}}}],"partialFingerprints":{"codehealthFindingId/v1":"d30b1255f94e239a0c0e9992cd7d78cc86e60f7124f22515bdb5c3e25c17e7e8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: add case where non parent using undeclared module (hard?) \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":"compiler/rustc_resolve/src/diagnostics/impls.rs"},"region":{"startLine":3503}}}],"partialFingerprints":{"codehealthFindingId/v1":"8959768868ea310e18c27bc4d4521d2750d7d9f3b9b62c38f7fd1e8bb1025544"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Make this properly translatable. \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":"compiler/rustc_resolve/src/diagnostics/mod.rs"},"region":{"startLine":1548}}}],"partialFingerprints":{"codehealthFindingId/v1":"f45f1fa3ae5c1bdd3c3406bf9600b06fc854c93cd631920ec61c94fcd7650169"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Get rid of this lock. We have ownership of the QueryWaiter although 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":"compiler/rustc_query_impl/src/execution.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"0623e46a4c6f3ed39d5dd2e42fdb67f6a3576aa6a7b935fccf56b102a36c7ea5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: \u0060def_span\u0060 for an fn-like coroutine will point to the fn\u0027s body \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":"compiler/rustc_query_impl/src/handle_cycle_error.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"27317139a7ca9a1ad2926100390a2e2cf022346cadfb2ce306e61a4e09750a5e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We could report a structured suggestion if we had \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":"compiler/rustc_query_impl/src/handle_cycle_error.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"74f7babe73fa4d6da6ce3d1d532a03418a123eb5fe9ce3a2babf6a95a15e3e57"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(compiler-errors): This suggestion might be erroneous if Box is shadowed \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":"compiler/rustc_query_impl/src/handle_cycle_error.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"b46adb50e7376a0fd4e7fe8938ab684ce21a552d78cc06c932b5bd3d5fcfb88e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(eddyb) make this O(1) by using a pre-cached query name \u0060EventId\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":"compiler/rustc_query_impl/src/self_profile.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"c56619867ece4e30305af07dab5cd913616645a7173df49818f2802493b1d87a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: A good reason to make is_mir_available or mir_keys change 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":"compiler/rustc_public_bridge/src/context/impls.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"45a0170f03f9224fa180089d3ca40dda24c011b182b84b3d22b4c79e361db2a7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(rustc_scalable_vector): Scalable vectors are \u0060Sized\u0060 while 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":"compiler/rustc_public/src/abi.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7a3e586e8c6a9e4d42ac01171123b56eca9eadfab75c8017d2e3779da8d71e3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(rustc_scalable_vector): Scalable vectors are \u0060Sized\u0060 while 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":"compiler/rustc_abi/src/lib.rs"},"region":{"startLine":1880}}}],"partialFingerprints":{"codehealthFindingId/v1":"3141be52c73270398ceb4b2e4da6c808ae36d2143bb2c6e5d7cbef0479e5062f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Consider replacing with an opaque or interned type. \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":"compiler/rustc_public/src/lib.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"37dddd7ceec3258dae9774fb53e145c5c05d79e4972f136c2752c513a7200e8f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(splat): When \u0060#[rustc_splat]\u0060 is complete (or stable), add splatted to the public FnSig \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":"compiler/rustc_public/src/unstable/convert/internal.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb5442cff2ff89f58f0a8f69e7e776897744e997fdb987874f6a2408c2881beb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Figure out how to do labels in SMIR \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":"compiler/rustc_public/src/unstable/convert/stable/mir.rs"},"region":{"startLine":798}}}],"partialFingerprints":{"codehealthFindingId/v1":"1078537b0fbd0d5bd32957137966651a67d11d4b4babf1caec3550a9a6aee55a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Should we record the whole vtable? \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":"compiler/rustc_public/src/unstable/convert/stable/mir.rs"},"region":{"startLine":864}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4d46e5b535d7e9fa7b4cb6d1017059cd941c6e93e7bf724997e71d3c221ea45"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(unsafe_binders): \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":"compiler/rustc_public/src/unstable/convert/stable/ty.rs"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ad848bf2fa07177e86c6a93de71460e36fa5926e577dd0f79140e7e0a829135"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(unsafe_binders): \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":"compiler/rustc_middle/src/ty/util.rs"},"region":{"startLine":1312}}}],"partialFingerprints":{"codehealthFindingId/v1":"987c6eaf20ea51fd3671fb3b12258b577e56098c7506c03ecf6a9661c3a9e7eb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: These should be a valtree \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":"compiler/rustc_public/src/ty/tys.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"7de4a06554e569dfd2f4cb2b2a3d8621db700db169ca115d6c2a1a578e463a51"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: There\u0027s no type corresponding to a shallow borrow, so use \u0060\u0026\u0060 as an approximation. \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":"compiler/rustc_public/src/mir/body.rs"},"region":{"startLine":993}}}],"partialFingerprints":{"codehealthFindingId/v1":"790ab7af2103be33c6fde002c5d701fa0254e43a19d6dbb412002485e4cbb4dd"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: There\u0027s no type corresponding to a shallow borrow, so use \u0060\u0026\u0060 as an approximation. \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":"compiler/rustc_public/src/mir/body.rs"},"region":{"startLine":1011}}}],"partialFingerprints":{"codehealthFindingId/v1":"876497200a4048527dccc525139d4a7536c1e985c350a3918586c6fba8c4c936"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(smir-rename): rename this to PointerExposeProvenance \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":"compiler/rustc_public/src/mir/body.rs"},"region":{"startLine":1076}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0ebcbfca0a369c777b62446d6d9eebf2afd326a6f43fdc06ed850f03975139e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Add rest of the statements \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":"compiler/rustc_public/src/mir/pretty.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b01c66be16a71aa078484296ffa49d60e635e34bec103199e64a25a5d6ad6bb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Add pretty_aggregate function that returns a pretty string \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":"compiler/rustc_public/src/mir/pretty.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a8464b253ba6c85336aa3dba805d981dca8b74c28edcf5149651f43436f64af"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Change this once we have CtorKind in StableMIR. \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":"compiler/rustc_public/src/mir/pretty.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a76866da419e7590599f6d1aab5753f5b6b5be43c27dd5457dd9d7787b4d576"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this should probably use \u0060args\u0060 from \u0060FnDef\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":"compiler/rustc_privacy/src/lib.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"60493b7885d2a4111e45075bc25f99b89ccf298b4db2f695ffbff409a62949df"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: If self.level == Level::Reachable and self.ev == (priv, priv, priv, pub), \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":"compiler/rustc_privacy/src/lib.rs"},"region":{"startLine":849}}}],"partialFingerprints":{"codehealthFindingId/v1":"50499ea531ec2648cf10e5581e02171467a4691f641d3b861263e71c19e73659"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: check types of const infers 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":"compiler/rustc_privacy/src/lib.rs"},"region":{"startLine":1218}}}],"partialFingerprints":{"codehealthFindingId/v1":"295b6e53a5104c0b50bea87cac0a7d4914d8c5ee4ee8ea3e24f15a3d1e4c1114"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Check type-relative associated types in signatures. \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":"compiler/rustc_privacy/src/lib.rs"},"region":{"startLine":1277}}}],"partialFingerprints":{"codehealthFindingId/v1":"685b830c95c4b1cbb03cbe58ef9a55f7412c1c16f75720bca3b813d9f946277c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: too much breakage from reporting hard errors here, better wait for a fix \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":"compiler/rustc_privacy/src/lib.rs"},"region":{"startLine":1591}}}],"partialFingerprints":{"codehealthFindingId/v1":"15ee8eca11727d07adb55f9d88943543b120b96bbb22e3c0a722832fb7ecc7b4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Remove this when full normalization 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":"compiler/rustc_privacy/src/lib.rs"},"region":{"startLine":1693}}}],"partialFingerprints":{"codehealthFindingId/v1":"f19d6ad6d6c7123eb3433e5981b22511c734b81b3052969f36d8feb56957d20d"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK(jynelson): trying to infer the type of \u0060impl Trait\u0060 breaks \u0060async-std\u0060 (and \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_privacy/src/lib.rs"},"region":{"startLine":1793}}}],"partialFingerprints":{"codehealthFindingId/v1":"86a55b3c16ffc7b9ba94afbc8ce505f418c0769cec809ea185b1c9ecfaee77a6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This is some serious pessimization intended to workaround deficiencies \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":"compiler/rustc_privacy/src/lib.rs"},"region":{"startLine":1829}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb89146da5f25b82c0c00f784e6250bde2cc4a6ccf4394898fad21b7cc28a59b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: remove this once proper support for defs reachability from macros 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":"compiler/rustc_privacy/src/lib.rs"},"region":{"startLine":1840}}}],"partialFingerprints":{"codehealthFindingId/v1":"15155524bb4031eb3163115c70722ca9cf4a605ca0b89a2793517591d441d4c8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME Once valtrees are available we can directly use the bytes \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":"compiler/rustc_pattern_analysis/src/constructor.rs"},"region":{"startLine":866}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ebde25fc89783fffd6c33bc04c37d669227aa71a6f9a425396190703d8583b1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#132279): This will be unnecessary once we have a TypingMode which supports revealing"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_pattern_analysis/src/rustc.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"d833bfcf8c9f83dda2f0beb324b405d387b07b9a04cc5c156935cd5b67b67114"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: handle empty\u002Bhidden \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":"compiler/rustc_pattern_analysis/src/rustc.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"f40f2a5cf197cfd881e8bec3a799c75d7dfe4967a5fe06157df5cb8ad23b66f8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(Nadrieril): which of these are actually 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":"compiler/rustc_pattern_analysis/src/rustc.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"728adc0861554dbb4fb9068d85d9f0140cfc7d6a4a5da7dde50670f6938e3bd9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME(Nadrieril): use the same order of patterns for both. \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":"compiler/rustc_pattern_analysis/src/usefulness.rs"},"region":{"startLine":1389}}}],"partialFingerprints":{"codehealthFindingId/v1":"1236a8e0ceeb111468afee337cef69aaa2313f95aff77d946ae7acb489a9525d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: using the \u0060Debug\u0060 impl here isn\u0027t ideal. \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":"compiler/rustc_passes/src/abi_test.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"a135f0f381e95418106ccd68b264b9aa576917ec688928d198ecd0cd79ffd4c2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: using the \u0060Debug\u0060 impl here isn\u0027t ideal. \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":"compiler/rustc_passes/src/layout_test.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9e3dc46a01c545d63d91c4af4a4ab123289adda6be4d082800ef52039cfab9e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(jdonszelmann): should become rustc_attr_validation \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":"compiler/rustc_passes/src/check_attr.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0df02e0eeb3661a5425493811f22c84285583975b3863689f66122807715a6d9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: should we? \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":"compiler/rustc_passes/src/check_attr.rs"},"region":{"startLine":882}}}],"partialFingerprints":{"codehealthFindingId/v1":"727ab563d6ad342f9c22630077bbb9c6843fb8985eee1b43753de59896e11ceb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: currently unchecked \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":"compiler/rustc_passes/src/check_attr.rs"},"region":{"startLine":886}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbb31205f230721282b1f1e0939dd269d2e5418bb8159765a9ff45c35bd56f5a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: currently unchecked \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":"compiler/rustc_passes/src/check_attr.rs"},"region":{"startLine":896}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ac7677d382ac4734d49054e92efe03c156611c354008bfd6ff578e7ea00586d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Would be nice if we had a span 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":"compiler/rustc_passes/src/check_attr.rs"},"region":{"startLine":1153}}}],"partialFingerprints":{"codehealthFindingId/v1":"817be5697a58cf48a81c99566bafe1e96c5f74b7bddfc03fca8b5516e705c8bc"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Would be nice if we had a span 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":"compiler/rustc_passes/src/check_attr.rs"},"region":{"startLine":1156}}}],"partialFingerprints":{"codehealthFindingId/v1":"720f5470417c0ac3cee9faa39adfdd067baceb63c0dc6902cd6013937e664423"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Would be nice if we had a span 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":"compiler/rustc_passes/src/check_attr.rs"},"region":{"startLine":1159}}}],"partialFingerprints":{"codehealthFindingId/v1":"117fb6ae45a324e1d59a76a4a9d9f7ab3811d351a318d5eba68de328a0d59756"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(eii) Once eii is no longer so experimental, suggest doing \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":"compiler/rustc_passes/src/check_attr.rs"},"region":{"startLine":1264}}}],"partialFingerprints":{"codehealthFindingId/v1":"0861ae8e3fd956a4a358674dfbba858d67b461406a57424bc2efe61ea0911241"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: support \u0060#[export(unsafe_stable_abi = \u0022hash\u0022)]\u0060 syntax \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":"compiler/rustc_passes/src/check_export.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"9786bad62e12500ae910147688855f45d9175b9e70e42e5c5e49cab6037dab3d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(cjgillot) this SyntaxContext manipulation does not make any sense. \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":"compiler/rustc_passes/src/dead.rs"},"region":{"startLine":1341}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab5a3a6f89aacb2fe2d86d34f7c77ecb6f747295c00a8f17c40756e244b52439"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: \u0060dead_codes\u0060 should probably be morally equivalent 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":"compiler/rustc_passes/src/dead.rs"},"region":{"startLine":1524}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd9e227c6e2a89f3c4f4745317be4d90c5eafc80b89cc80798647a3fc1a6a19c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(jdonszelmann): move back to rustc_attr \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":"compiler/rustc_passes/src/diagnostics.rs"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff7721e632df548cb393c9d91512d1837d6ec2d52c1ce807b03ba99acceabdc8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: shouldn\u0027t call \u0060item_name\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":"compiler/rustc_passes/src/eii.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"69e705e8e41ba0396245ed096bc1db8b7f9e998c9601ebb4daf6f1fe29f87820"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(eddyb) benchmark if this would be faster as a \u0060VecDeque\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":"compiler/rustc_passes/src/reachable.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe9f6f3244c2be99a860acda325339b65a77342bb761807bcf4a0e8df1f5efc8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(nbdd0121): \u0060#[used]\u0060 are marked as reachable here so it\u0027s picked up by \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":"compiler/rustc_passes/src/reachable.rs"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"f409977eb7fddd12264fb1adfd1527e321684b227db82e13b6c2da27cd81f3d6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: One possible strategy for pruning the reachable set is to avoid marking impl \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":"compiler/rustc_passes/src/reachable.rs"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"18b86e6e5c9b57a21b6ee6e23fc25a6cd299753b8e6c26087b1e0e72dbec0e63"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: check that this item can have body stability \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":"compiler/rustc_passes/src/stability.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6e7a9ccaf2ee01d3e8aa582c3bdca152eafdbc07e93b066f58b270dc358df3f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const_trait_impl): how is this supposed to interact with \u0060#[rustc_const_stable_indirect]\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":"compiler/rustc_passes/src/stability.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee3020cad65eb1216cc87d440e96de151924bdc17c3d69b0a6606d1d58686f72"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(jdonszelmann): make it impossible to miss the or_else in the typesystem \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":"compiler/rustc_passes/src/stability.rs"},"region":{"startLine":748}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fc8693541b8e610bb634788c2753391d026e24a2af8704c7906d2284e092c75"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const_trait_impl): Improve the span 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":"compiler/rustc_passes/src/stability.rs"},"region":{"startLine":854}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1b39414f363b3d86c1996358abec6b1bf27e04a371b95f79c91254aee7b7801"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: only remove \u0060libc\u0060 when \u0060stdbuild\u0060 is enabled. \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":"compiler/rustc_passes/src/stability.rs"},"region":{"startLine":1191}}}],"partialFingerprints":{"codehealthFindingId/v1":"3db494beb87236e9f0d66690874c6fc08e0f0c4e4b1bcb6bb54f637b9e480005"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: remove special casing for \u0060test\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":"compiler/rustc_passes/src/stability.rs"},"region":{"startLine":1192}}}],"partialFingerprints":{"codehealthFindingId/v1":"c90c45fd1831a86a4a4604ccda98133df5c96e3e46c2494ebfaea4699173fd35"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(eddyb) perhaps use \u0060ItemLocalId\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":"compiler/rustc_passes/src/upvars.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"49e13c4bbf2a301f2df85be95a88e68780e6921e01f270c36b413e91ff675453"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: in other suggestions we\u0027ve reversed the inner spans of doc comments. We \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":"compiler/rustc_parse/src/diagnostics.rs"},"region":{"startLine":4389}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dc708b9967f21f4c21e7a6b60a4343e341244aaa04616a22ddb244033d52537"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(frontmatter): Consider stripping frontmatter in a future edition. We can\u0027t strip them \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/lib.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"63918f8e9973c2dc6f99d72044ba8cc149c6a895fd5befc769b6bd7f362b3755"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: require passing an NT to prevent misuse of this method \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":"compiler/rustc_parse/src/parser/attr_wrapper.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d0127a6f33d8b29845909c673d3ff0cfaf43d9f629cce4870a138b6d159af06"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME expressions with attributes can be supported 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":"compiler/rustc_parse/src/parser/cfg_select.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5ad168256272d657b80752e840ba6baadae1606524666fbbe55c2de52e6af38"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Could we recover with this? \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":"compiler/rustc_parse/src/parser/diagnostics.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"63f60d42140976326489826af5c0977d82afc89d433b999d7f9467292e5e6eac"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: translation requires list formatting (for \u0060expect\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":"compiler/rustc_parse/src/parser/diagnostics.rs"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a6a20362dac6c25f399ea47729d69163c4ccf48d6a9c41582c197ac9bd45041"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: actually check that the two expressions in the binop 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":"compiler/rustc_parse/src/parser/diagnostics.rs"},"region":{"startLine":1397}}}],"partialFingerprints":{"codehealthFindingId/v1":"fedb69019e1f97663d29a14972f765f0d2b677272f0f4aa6ab2c1632bd3be32d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: actually check that the two expressions in the binop 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":"compiler/rustc_parse/src/parser/diagnostics.rs"},"region":{"startLine":1425}}}],"partialFingerprints":{"codehealthFindingId/v1":"09181575c705f3a2541a6c68e35eda72104f1e97568e24a9d4815c53c8cd155f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: for some reason using \u0060unexpected\u0060 or \u0060expected_one_of_not_found\u0060 has \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":"compiler/rustc_parse/src/parser/diagnostics.rs"},"region":{"startLine":2344}}}],"partialFingerprints":{"codehealthFindingId/v1":"d56d848ccf714a3e92ec4fd14c69df200e1fa136f1566c1a08e32a99d736c5a0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: With current \u0060TokenCursor\u0060 it\u0027s hard to break tokens into more than 2 \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":"compiler/rustc_parse/src/parser/expr.rs"},"region":{"startLine":839}}}],"partialFingerprints":{"codehealthFindingId/v1":"74a81a12987bc34a2625fec73217070310f5d19e19258b2ad615d428185c4aaf"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(nnethercote) Sometimes with expressions we get a trailing comma, possibly \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":"compiler/rustc_parse/src/parser/expr.rs"},"region":{"startLine":1256}}}],"partialFingerprints":{"codehealthFindingId/v1":"e06ecf7a70931ee5115f6b8e67e82b41e83d6019042cf4d240bfdbdf9f8e551c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: (async) gen closures aren\u0027t yet parsed. \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":"compiler/rustc_parse/src/parser/expr.rs"},"region":{"startLine":1399}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5e0e03902a30ef3e34dff0c1ef8deba8cfaae8b3062428a90a0344dd2d19854"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(gen_blocks): Parse \u0060gen async\u0060 and suggest swap \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":"compiler/rustc_parse/src/parser/expr.rs"},"region":{"startLine":1400}}}],"partialFingerprints":{"codehealthFindingId/v1":"57d04f83aa4178ac1d538c33dd66b2eeaa369371258ecfcaaeb6be2ab9f686f9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(forced_keywords): Allow k#gen blocks prior to Rust 2024, too! \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":"compiler/rustc_parse/src/parser/expr.rs"},"region":{"startLine":1401}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7f7847b9e6923be1678c2083fadcf108a5b5d189cc937073b0a416daebcdb13"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Odd not to include the closing paren (contrary to the leading one etc.) 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":"compiler/rustc_parse/src/parser/expr.rs"},"region":{"startLine":1860}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9ba06ccd2fb972a9f8693f87f570eeafef727efe53ce7b3f3109ecdfa531cc0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Odd not to include the closing paren (contrary to the leading one etc.) 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":"compiler/rustc_parse/src/parser/expr.rs"},"region":{"startLine":1875}}}],"partialFingerprints":{"codehealthFindingId/v1":"f40a1d41ae8c9dfbed0455969676d1bd271e56dfc3b2612262e05bb1d46d6cdf"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Odd not to include the closing paren (contrary to the leading one etc.) 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":"compiler/rustc_parse/src/parser/expr.rs"},"region":{"startLine":1892}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf80fafd7682b92ba5dad7f0ab0731426e2563fbfb027f4cf43924e05a9172f9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Odd not to include the closing paren (contrary to the leading one etc.) 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":"compiler/rustc_parse/src/parser/ty.rs"},"region":{"startLine":858}}}],"partialFingerprints":{"codehealthFindingId/v1":"42b397a5cbf80def342b2dc3383fd5e07c7f86dcbc44fa68b097622b5c289cf8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(nnethercote) The \u0060expr\u0060 case should only match if \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":"compiler/rustc_parse/src/parser/expr.rs"},"region":{"startLine":2079}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea619f2402e44d52512a89c05dd9af332e07b5de18c3a3adbc779cda08bebf89"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(gen_blocks): This perhaps should be a different gate. \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":"compiler/rustc_parse/src/parser/expr.rs"},"region":{"startLine":2213}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dc7edf34c707b5e58bea7293ac900eb38dccb09011e8d51d470cace0922b3ec"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(compiler-errors): We could also recover \u0060; PAT =\u003E\u0060 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":"compiler/rustc_parse/src/parser/expr.rs"},"region":{"startLine":3222}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f967a32dc49df5e5314c363c6b9a6b24ad4d5526b5c94053c5199639becd450"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(guard_patterns): convert this to a normal guard 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":"compiler/rustc_parse/src/parser/expr.rs"},"region":{"startLine":3322}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bb8662ff553e54885ac9686b3dd494253464547e098531d35c941a748d0d2b6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: pass an additional condition through from the 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":"compiler/rustc_parse/src/parser/expr.rs"},"region":{"startLine":4006}}}],"partialFingerprints":{"codehealthFindingId/v1":"26e8f31cdd91d1c7b6bb67fc3949b2b2d2d020531cb3e5eab7c47d64e1d93275"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME(estebank, xizheyin): Use more variants. \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":"compiler/rustc_parse/src/parser/function.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e147bea0940bef4c52d2fbd62d3c5cafb28fa01f7d4f73f97c9dbdff1120caf"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(gen_blocks): emit a similar error for \u0060gen fn()\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":"compiler/rustc_parse/src/parser/function.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"19767b0a37fce69b125897bd54e6ffb2606337a91bf9fb39683ccf7de8887533"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(gen_blocks): This span is wrong, didn\u0027t want to think about 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":"compiler/rustc_parse/src/parser/function.rs"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"90a9da3f22229a6c0222d86f772a38584bff8a327f00774c4938247ba7292bd0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(gen_blocks): add keyword recovery logic for genness \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":"compiler/rustc_parse/src/parser/function.rs"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"bce2a0cf9b26897c769bb329e1b4213cada22b82c0b34c3685a487ab1c39bd2d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME - try to continue parsing other generics? \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":"compiler/rustc_parse/src/parser/generics.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"71713ada73d1a8bed0ec0b0a963da9d5971ba701a163f44aecb0b504e8233684"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME - maybe we should overwrite \u0027self\u0027 outside of \u0060collect_tokens\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":"compiler/rustc_parse/src/parser/generics.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca9a42104b38ab5745c47e81bb84ea43df2d917de49f7fe226de2c7209cd2fc4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: merge with \u0060DocCommentDoesNotDocumentAnything\u0060 (E0585) \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":"compiler/rustc_parse/src/parser/item.rs"},"region":{"startLine":1062}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cd80ca621305d8999a616cb29055e8e4b49ac8cc1130ec094ee772030708407"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: duplicate the attributes that are at the root of the initial use-item. \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":"compiler/rustc_parse/src/parser/item.rs"},"region":{"startLine":1470}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b60ee74a5b0dcfb036a47fb3630485b144b2f512a353bc5450b83f3004ea3ac"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This recovery should be tested better. \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":"compiler/rustc_parse/src/parser/item.rs"},"region":{"startLine":1572}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6230304b48d3c173d3b25684a723bcf3c8f0b69136d1f1c37e289d75ddeccb1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#100717): needs variant for each \u0060ItemKind\u0060 (instead of using \u0060ItemKind::descr()\u0060)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/item.rs"},"region":{"startLine":1635}}}],"partialFingerprints":{"codehealthFindingId/v1":"1097be22f977fc54fdfc1ce48c70f093fa9ee31f6b725f020744dba7eee593e2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This could maybe benefit from \u0060.may_recover()\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":"compiler/rustc_parse/src/parser/item.rs"},"region":{"startLine":1750}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca495fcc2e2209394f159dfce3393a5aecf25f9a9d4e8a79304770505fdb3afb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This could maybe benefit from \u0060.may_recover()\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":"compiler/rustc_parse/src/parser/item.rs"},"region":{"startLine":1790}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b56754d1450c6a0dcb81a04f2f0d21d23879c882b9bdd7977f6bf0d8205293b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(generic_const_items): Provide a structured suggestion to merge the first \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":"compiler/rustc_parse/src/parser/item.rs"},"region":{"startLine":1828}}}],"partialFingerprints":{"codehealthFindingId/v1":"45d2af70db068f932d17335f728e4115688713c789f1c8460b8d84f771fb66e6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This will make us not emit the help even for declarative \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":"compiler/rustc_parse/src/parser/item.rs"},"region":{"startLine":2902}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdec0eafe351039ef4eb7a5d0b0be8123039889300913920bf4b40101bacb0e3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#146122): Parse \u0060const async ...\u0060, \u0060const gen ...\u0060 \u0026 \u0060const async gen ...\u0060"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/mod.rs"},"region":{"startLine":729}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d30668ffe646249881a387be92f85eac4f4641f01675b740a796645059397e0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(gen_blocks): Do we want to unconditionally parse \u0060gen\u0060 and then \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":"compiler/rustc_parse/src/parser/mod.rs"},"region":{"startLine":1234}}}],"partialFingerprints":{"codehealthFindingId/v1":"904eb80eb20262e9cdff0d1194ad700524768cc74faff3ae0d5062e2d57b0f1d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#100717): migrate users of this to proper localization"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/pat.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bc5841ced1a6501b752cf5d73d1160a3d44238b0635907a98379f3043145b03"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: some suggestions don\u0027t actually need the snippet; see PR #123877\u0027s unresolved conversations."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/pat.rs"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"3424125dc75482f58a45058d0adffae21d963b5592c8e0b859bc7709dbd2cc33"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(guard_patterns): suggest this regardless of a match arm. \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":"compiler/rustc_parse/src/parser/pat.rs"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"d421a552addb367b68115f9ec3225f111115c79c08254623ce887bdcbc0d15f4"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: a neater way would be preferable. \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/pat.rs"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"aad9c69c858198293fbf404e831c16de44c946773a2944dc8e4cd4dcfb1a7c8b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this doesn\u0027t work with recursive subpats (\u0060\u0026mut \u0026mut \u003Cerr\u003E\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":"compiler/rustc_parse/src/parser/pat.rs"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"0daf8d31da55e55249bf975cc566954d4a32e1dff723c3e8f43e0ced476fa00a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(Centril): Consider semantic errors instead in \u0060ast_validation\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":"compiler/rustc_parse/src/parser/pat.rs"},"region":{"startLine":1380}}}],"partialFingerprints":{"codehealthFindingId/v1":"6faf5cd5af8075807a9d7c7581dee2a176ac15fc62b1f11dfe320aa296091ba5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: remove this entirely eventually \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":"compiler/rustc_parse/src/parser/pat.rs"},"region":{"startLine":1620}}}],"partialFingerprints":{"codehealthFindingId/v1":"b34b449e41ebc03eb4c3a5e40e2df2fe47e2bc37ada4bcab51ba2e504d56dddb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: remove the recovery for parsing box patterrns entirely \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":"compiler/rustc_parse/src/parser/pat.rs"},"region":{"startLine":1906}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e6c04cf920251fcfcb8f2f7a94a73e400ba6aba78f430ce5f0c361a7c997413"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(return_type_notation): Could also recover \u0060...\u0060 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":"compiler/rustc_parse/src/parser/path.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c6f7965f7bfd2ad1d6871df8ec4f872f8cd916287f8ef8195ae78cfbd769ca8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(compiler-errors): this could be improved by suggesting lifting \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":"compiler/rustc_parse/src/parser/path.rs"},"region":{"startLine":800}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5b2ab1b5ffeff324a713aa0dada867373d7b895f1440f5d2e219d2f737e15d2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: unwanted clone of attrs \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":"compiler/rustc_parse/src/parser/stmt.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fb9028d5af5d93851c1cc226ba17c0b83d594f84084b03effb084a14784f915"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME - maybe capture semicolon in recovery? \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":"compiler/rustc_parse/src/parser/stmt.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"422c66b9fcf45ebd591006a8690b37ee6f818901b11776ed2ff83f03b256dc10"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(compiler-errors): this should probably parse an arbitrary expr and not \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/stmt.rs"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"a83023120792fb6eab9fdc7343c2be3ee1a8cd6ecdbc9bb108f77a39093b1a8d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(hkmatsumoto): Might be better to trigger \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":"compiler/rustc_parse/src/parser/stmt.rs"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"58dda7c029d9dadcd77eb32846229befd5e9bc4d0270a3b89856ec96091c571c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(Centril): Can we unconditionally \u0060allow_plus\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":"compiler/rustc_parse/src/parser/ty.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaded20398906be1e7db8989b31be239905dcdde66fc4c52bf466ea5f58170a9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(c_variadic): Should we just allow \u0060...\u0060 syntactically \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":"compiler/rustc_parse/src/parser/ty.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"170066cc63107d3343b7f66e79b3f9e90fd4d4ae40be174474ea4932ae2da43b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(mgca): recovery is broken for \u0060const {\u0060 args \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":"compiler/rustc_parse/src/parser/ty.rs"},"region":{"startLine":729}}}],"partialFingerprints":{"codehealthFindingId/v1":"73b10be949d1743cceba58fc695b9badee23866ba41d0fc169c43bbdefe2a167"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const_trait_impl): remove \u0060~const\u0060 parser support once bootstrap has the new syntax \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":"compiler/rustc_parse/src/parser/ty.rs"},"region":{"startLine":1380}}}],"partialFingerprints":{"codehealthFindingId/v1":"af9191677b67fd32a21226875ad059542aaacad585d09fd45307e4283a3fff72"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Don\u0027t return an error diag, emit the diag here *and* return a new expr of the 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":"compiler/rustc_parse/src/parser/expr/diagnostics.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"d94f620aed1c9b728a2201cb0242bc0550789e3c14ff710f1706c678dc00401f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This is way to assertive for a diagnostic with so many false positives! \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":"compiler/rustc_parse/src/parser/expr/diagnostics.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a2feddb25260c71924d0992410188b3154440a9d8e84e1a9663c6527fd76d88"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: In most cases there certainly isn\u0027t a \u0022missing \u0060;\u0060\u0022. E.g., if we\u0027re nested \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":"compiler/rustc_parse/src/parser/expr/diagnostics.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b36412c82f7c20c5dce2726c34abae0791b9577bbc38e657dc67de0b7f26c1a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: the lexer could be used to turn the ASCII version of unicode \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":"compiler/rustc_parse/src/lexer/mod.rs"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4d754ac5785ef819c2d25905144088f5ff9cdddc603093fb25b2acb1ac6c8f8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: An \u0022unclosed \u0060char\u0060\u0022 error will be emitted already in some cases, \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":"compiler/rustc_parse/src/lexer/mod.rs"},"region":{"startLine":1130}}}],"partialFingerprints":{"codehealthFindingId/v1":"652c8a64c4c6be64471fe310bcea583f855332495a357b1a00323a6bb1afac75"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: the lexer could be used to turn the ASCII version of unicode homoglyphs, instead of \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":"compiler/rustc_parse/src/lexer/unicode_chars.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"121e28c5280fda7ead63ffb0d200fc1b08de839aaabd1ff17dd8d82427aa808c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Literals are already lexed by this point, so we can\u0027t recover gracefully just by \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":"compiler/rustc_parse/src/lexer/unicode_chars.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d3faf8da6db4d307a1c6f0ca5ec6695db9814f0d9a794c75830db5a17bb3d6c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(unsafe_binders): Non-local? \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":"compiler/rustc_next_trait_solver/src/coherence.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"e36864d64b4148007a41963d5e20cd5f38b31e5630873e9c8c929e957379ba40"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Uplift the leak check into this crate. \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":"compiler/rustc_next_trait_solver/src/delegate.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4dcdbd50cd9fbba7c65559e1496c128d56cb22ea2b1124b2ec5099b69e271e0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: Only used in \u0060evaluate_const\u0060 on \u0060EvalCtxt\u0060 to delegate evaluation of GCE consts 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":"compiler/rustc_next_trait_solver/src/delegate.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"09a485967b45e2a96aa14faab7d57558967dec6eaf1f93eaa4a785dcc28720f7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This only is here because \u0060wf::obligations\u0060 is in \u0060rustc_trait_selection\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":"compiler/rustc_next_trait_solver/src/delegate.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b0f805c157e93b3e80b04ec1cff895d4324e4b12d56ff45df4f14afa95a437e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(-Zassumptions-on-binders): \u0060replace_bound_vars\u0060 does not have enough \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":"compiler/rustc_next_trait_solver/src/placeholder.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"dad2530988cd68295c6beaee6a2b6c23c3093ed720f2fea2fa44ed0749ca1496"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // (FIXME: technically we only need to check this if the type is a fn ptr...) \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":"compiler/rustc_next_trait_solver/src/solve/effect_goals.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"9810f2f00c6ebfed4f1ed91f0612855bf2851adda8055420c03f9eb67cbbc3ed"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // (FIXME: technically we only need to check this if the type is a fn ptr...) \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":"compiler/rustc_next_trait_solver/src/solve/normalizes_to.rs"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5116d9bab97a851c295790888353936aca59cc9b07cd7d20e0fd0d2eb0efa2b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // (FIXME: technically we only need to check this if the type is a fn ptr...) \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":"compiler/rustc_next_trait_solver/src/solve/normalizes_to.rs"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b60bfded3bad7e8415d0c71f605882f27c665b2b598f3fb7335e14af77bd476"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // (FIXME: technically we only need to check this if the type is a fn ptr...) \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":"compiler/rustc_next_trait_solver/src/solve/trait_goals.rs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"09a9b00e5eceaad42c6026ad1056f8a310e3bdf41f1da68a69fa2194ee935cf6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // (FIXME: technically we only need to check this if the type is a fn ptr...) \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":"compiler/rustc_next_trait_solver/src/solve/trait_goals.rs"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f3824f0a515dc2f10d819d8a41cb24eefccf8fc64d21429399ad9e7f6d17224"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(trait-system-refactor-initiative#117): we don\u0027t detect whether a response"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_next_trait_solver/src/solve/mod.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"c26b940e8adaac1210ab3f00586ee41028901e1064ee53bae63babcb8ac26f11"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(bryangarza): Add separate \u0060IfAny\u0060 case, instead of treating as \u0060IfAll\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":"compiler/rustc_next_trait_solver/src/solve/mod.rs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"65e3b7cdc040cb1b98f8a11f485c3b106d6860a10b5d6c2db483e2be1c7d1b30"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We don\u0027t need these, since these are the type\u0027s own WF obligations. \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":"compiler/rustc_next_trait_solver/src/solve/normalizes_to.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9a01f1304ed8a75007206386515adef94db9754e4e8141872c8d6470320bb0f"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // Hack for trait-system-refactor-initiative#245. \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_next_trait_solver/src/solve/normalizes_to.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"321a49447b4bad3c1723c31dc817ec37109a5f62ab1d0fbba76826f53612ba72"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(-Zhigher-ranked-assumptions): this impl differs from trait goals and we should unify \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":"compiler/rustc_next_trait_solver/src/solve/normalizes_to.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b24c324893e6b2f6f73bbf16dddf1b2d849cca28a001c0ecffbbe08186f1ca9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(unsafe_binder): Figure out how to handle pointee for unsafe binders. \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":"compiler/rustc_next_trait_solver/src/solve/normalizes_to.rs"},"region":{"startLine":809}}}],"partialFingerprints":{"codehealthFindingId/v1":"36fa5cb859a55d38a2e0177f99c3618f2c5841f48e8f79a0c386689402b1c817"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(unsafe_binders): instantiate this with placeholders?? i guess?? \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":"compiler/rustc_next_trait_solver/src/solve/normalizes_to.rs"},"region":{"startLine":1022}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef1c3f997c0aa68b6697f4874921f3254ac0c506fbdef6f215edfcfedc315460"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(-Znext-solver=coinductive): Long term, we probably do want 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":"compiler/rustc_next_trait_solver/src/solve/search_graph.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f995398ef9cc40666bee1f84b9f4ebb259b8d84b4bc7ab7b3fc2f3f10cbee61"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: add better support for builtin impls of traits that check for the bounds \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":"compiler/rustc_next_trait_solver/src/solve/trait_goals.rs"},"region":{"startLine":991}}}],"partialFingerprints":{"codehealthFindingId/v1":"f050dc2e39c98717d74821d459a35dc7d75892bc14cbd8b4bf01ee4d7bcb3080"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME(#57893): For backwards compatibility with the old trait solver implementation,"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_next_trait_solver/src/solve/trait_goals.rs"},"region":{"startLine":1601}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0aba1c1f1d9eb8cf171925847f88dd3294bbb5e18f5965b4916277f8acc0062"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(-Znext-solver=coinductive): I think this should be split \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":"compiler/rustc_next_trait_solver/src/solve/project_goals/inherent.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb36c0f3c6b91b17fdc10d2a61c96db66caf3e18f4f10168a37e844d07101acc"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Actually use a proper binder here instead of relying on \u0060ReErased\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":"compiler/rustc_next_trait_solver/src/solve/project_goals/opaque_types.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"023f98834310f2b929e420ec3f4fc21c8fb5dbee8017d95f63825a1e905df35d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(try_as_dyn): probably want to treat opaques opaquely and rigid \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":"compiler/rustc_next_trait_solver/src/solve/project_goals/opaque_types.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"28b55d6d255faa81f0c42db3e3cbc14ec13c24c511365a2ad55e8c963b456810"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Add an assertion that opaque type storage is empty. \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":"compiler/rustc_next_trait_solver/src/solve/project_goals/opaque_types.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"4deb8f4e560ae6aa2a2153443ea9073b8e205a3b957b111d053b42d8872e0382"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: verify that we can get away with not rerunning immediately 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":"compiler/rustc_next_trait_solver/src/solve/project_goals/opaque_types.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"a41463f5ae859a327ef579badf9855753f5f2a88ec7858aa79e6265d006063fe"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME(perf) cold might not be worth it here, given that we shuffled some things around since 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":"compiler/rustc_next_trait_solver/src/solve/eval_ctxt/fast_path.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2c9c8a88d3ae73493e73a3b8fdc76f14b487f173106d759e118d4c8d4eb792b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Consider renaming \u0060PredicateKind::NormalizesTo\u0060 to match with this \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":"compiler/rustc_next_trait_solver/src/solve/eval_ctxt/mod.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"792537cda11f0df1a4fee826632cb1922497d9f5acae676d57ce76f5634771dd"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This is only exposed because we need to use it in \u0060analyse.rs\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":"compiler/rustc_next_trait_solver/src/solve/eval_ctxt/mod.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"45faf50997d651e4dc7c04b6551cd16a24b338801b6ca81561600f836275c9bb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(-Znext-solver=coinductive): Nothing interesting going on here right now \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":"compiler/rustc_next_trait_solver/src/solve/eval_ctxt/mod.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7b8d415b8a5c7ba952f8e5d3401865d3b3a84ad6b253bcb157f745a25793de1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Once we remove support for the old impl we can remove this. \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":"compiler/rustc_next_trait_solver/src/solve/eval_ctxt/mod.rs"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"125a2e85c373bec74cccfd0621ffad8cbc7a8e8b2e385ffa63e5b227831ea2ee"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Could we make \u0060build_with_canonical\u0060 into \u0060enter_with_canonical\u0060 and call this at the end? \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":"compiler/rustc_next_trait_solver/src/solve/eval_ctxt/mod.rs"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"d19ec3b78b27c98dd6a2b2138a8f842f0e50a94bc18057f695711b4bb267b106"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We can have param env candidates via TAIT or RTN. \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":"compiler/rustc_next_trait_solver/src/solve/eval_ctxt/mod.rs"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"0041d95cf88cbb372380bf51605f2b8a0f00c4b47f96fa3c859a2a0c2acb17dc"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#155443): this doesn\u0027t make a difference now, but with eager normalization"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_next_trait_solver/src/solve/eval_ctxt/mod.rs"},"region":{"startLine":846}}}],"partialFingerprints":{"codehealthFindingId/v1":"069154abe60eb33fa9dce5d8effd26a50b2780351b1709f89831c9b0dd8bf3ec"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We previously had an assert here that checked that recomputing \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":"compiler/rustc_next_trait_solver/src/solve/eval_ctxt/mod.rs"},"region":{"startLine":941}}}],"partialFingerprints":{"codehealthFindingId/v1":"da76ff8e36bfbdcbe333f95bfa1cf2643206825dd74180233ed3709cbddd7988"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We could recompute a *new* set of stalled variables by walking \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":"compiler/rustc_next_trait_solver/src/solve/eval_ctxt/mod.rs"},"region":{"startLine":954}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d0a102815c969c7890326cc460c886709e119838e439c16e10a0d5cc927be74"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(-Znext-solver=coinductive): subtyping goals should \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":"compiler/rustc_next_trait_solver/src/solve/eval_ctxt/mod.rs"},"region":{"startLine":1382}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6a3cb482449a570bc9783b68a7541de736026a95c79887760af2fa7f1a0f38d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(-Znext-solver=coinductive): should these WF goals also be unproductive? \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":"compiler/rustc_next_trait_solver/src/solve/eval_ctxt/mod.rs"},"region":{"startLine":1385}}}],"partialFingerprints":{"codehealthFindingId/v1":"c05c56aed07bc6ef923c7b1cc1bddb23052c32615ef0579d94d7de0c1a11d4af"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME(inherent_associated_types): fix this? \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":"compiler/rustc_next_trait_solver/src/solve/eval_ctxt/mod.rs"},"region":{"startLine":1422}}}],"partialFingerprints":{"codehealthFindingId/v1":"08f7025673d3c994149ee1c8350b80e51f154e8addff88aee9f6bdf3803f0d96"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: get rid of this once GCE is removed \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":"compiler/rustc_next_trait_solver/src/solve/eval_ctxt/mod.rs"},"region":{"startLine":1560}}}],"partialFingerprints":{"codehealthFindingId/v1":"c76cc887387024af326d5ac4944f18fcbd2699980060a455e084fd4ce0cafeb9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(-Zassumptions-on-binders): we need to normalize here/somewhere \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":"compiler/rustc_next_trait_solver/src/solve/eval_ctxt/solver_region_constraints.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"25c2f5252eb88c89563cf7c2583c811067c7aab9a9902d5d3451ecadf14eecf2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#155443): This function should only ever return an error"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_next_trait_solver/src/solve/assembly/mod.rs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"c34a3cf3c1ff1a612419c61477bd8fe5405006c5e7353cceefd2caa14262f6e2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(@lcnr): While I believe an error here to be possible, we \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":"compiler/rustc_next_trait_solver/src/solve/assembly/mod.rs"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fab402617a93f0f88e61f6aac876c28a160ea3c6296535435b60861ac5d62b6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This may recurse infinitely, but I can\u0027t seem to trigger it without \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":"compiler/rustc_next_trait_solver/src/solve/assembly/mod.rs"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"4785b7eab01355e5b4bf3f0fe42db24ed6bff9416dbb3ca8af10dae941f6e244"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We only need to do *any* of this if we\u0027re considering a trait goal, \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":"compiler/rustc_next_trait_solver/src/solve/assembly/mod.rs"},"region":{"startLine":1025}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf957c6128de571cfc236ee53868b1a732bc4287afb5737a440f1a8f76b47c5f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(trait-system-refactor-initiative#229): This isn\u0027t"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_next_trait_solver/src/solve/assembly/mod.rs"},"region":{"startLine":1248}}}],"partialFingerprints":{"codehealthFindingId/v1":"424161acbd86e84a2490784ab79d262871b2f0330b06af17c658f2b3b76f38e0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This should be fixed, but it also requires changing the 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":"compiler/rustc_next_trait_solver/src/solve/assembly/mod.rs"},"region":{"startLine":1413}}}],"partialFingerprints":{"codehealthFindingId/v1":"6506c2f106b75b0ba9c477602951fb923e65e68cdd783cb761598494106f34b6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(mgca): we should also check the recursion limit 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":"compiler/rustc_next_trait_solver/src/solve/assembly/mod.rs"},"region":{"startLine":1518}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fbe039f4b17f2343f9efff1464a512e9fe536556ac11aaf1517b0abcffd459c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(-Znext-solver=coinductive): Adding supertraits here can be removed once we \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":"compiler/rustc_next_trait_solver/src/solve/assembly/structural_traits.rs"},"region":{"startLine":925}}}],"partialFingerprints":{"codehealthFindingId/v1":"7566c343d5b1190ed04a550314b1409428dcdfdf76f93e6bb5c1a7053a2b03b8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(mgca): Also add associated consts 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":"compiler/rustc_next_trait_solver/src/solve/assembly/structural_traits.rs"},"region":{"startLine":935}}}],"partialFingerprints":{"codehealthFindingId/v1":"395846a74de780890a4e4d08d966e8db3a6717a986425849de53fbae8f6cee8b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We *probably* should replace this with a dummy placeholder, \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":"compiler/rustc_next_trait_solver/src/solve/assembly/structural_traits.rs"},"region":{"startLine":954}}}],"partialFingerprints":{"codehealthFindingId/v1":"73e5836b5a6655e34eb8f93028bb85b0fccdad2f2b083054d40d3925f2a019b0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This *may* have issues with duplicated projections. \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":"compiler/rustc_next_trait_solver/src/solve/assembly/structural_traits.rs"},"region":{"startLine":1045}}}],"partialFingerprints":{"codehealthFindingId/v1":"90144877d37486488033a39755b40422d5b21008f770f121bca99ca853df8817"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: We currently return region constraints referring 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":"compiler/rustc_next_trait_solver/src/canonical/canonicalizer.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd98a9d1d1caa87888d19e4c88f35980c8e226d551a61dd7197da1a063e4c69d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We should investigate the perf implications of not uniquifying \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":"compiler/rustc_next_trait_solver/src/canonical/canonicalizer.rs"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cb69509830bcf070e8829824c427b63a54c01d2ddfca5743249d684cfa9c610"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: See comment above -- we could fold the region separately or something. \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":"compiler/rustc_next_trait_solver/src/canonical/canonicalizer.rs"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"48646a4d15fa500904003b944ce64e10bd993004060119d59be3ab6008dd4f33"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We should revisit and consider removing this after *assumptions on \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":"compiler/rustc_next_trait_solver/src/canonical/mod.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dadf88fa191ec8feea60a732cc0f84548dbef339b0db896420dd94eacf854e0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Longterm canonical queries should deal with all placeholders \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":"compiler/rustc_next_trait_solver/src/canonical/mod.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2546d5b6168756c3e0f5773f4c8bc6ef7ccbce559f08d86e571cd50161a1c06"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(-Zassumptions-on-binders): Remove this temporary workaround once \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":"compiler/rustc_next_trait_solver/src/canonical/mod.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"024fdf7c3921b8836b4b7afde91f9a90b836fb34d5112b1788d843c8602e646a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Share the arms below with \u0060super_combine_tys\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":"compiler/rustc_next_trait_solver/src/canonical/mod.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1380c3eaa3a8608f00fe28c34b34cc688f3a40f2d301a3607801902b17da3a0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: needs to be pub to be accessed by downstream \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":"compiler/rustc_next_trait_solver/src/canonical/mod.rs"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5dba1dbef5f47724fd19a5abef6629b21503ad811f4fc90b3e9be0b2f22232e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: maybe we should store the \u0022no response\u0022 version in cx, like \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":"compiler/rustc_next_trait_solver/src/canonical/mod.rs"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddc45c1aab70e8ab52b0367eea9f8948098722f9a46ca83627f1153d6251caeb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: don\u0027t rely on global state, instead bubble up errors. Note: this is very hard to do. \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":"compiler/rustc_monomorphize/src/collector.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"1251cd138d1ffe3eebe704c7d0732237ca810bf4a7d0e2527f74d91d600f2c50"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: I assume that there are few type errors at post-analysis stage, but not \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_monomorphize/src/collector.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb24f5f130841a01848e87ecd48bdd9f5d211567dcbfc1c8ce96ee28232696bb"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: \u0060drop_glue\u0060 creates tight monomorphization loops. Give \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_monomorphize/src/collector.rs"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"af5c3d91eef625d6ac6836fd36cf6c5dd62aa069bc4841e3069209e773f334c2"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK(explicit_tail_calls): collect tail calls to \u0060#[track_caller]\u0060 functions as indirect, \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_monomorphize/src/collector.rs"},"region":{"startLine":842}}}],"partialFingerprints":{"codehealthFindingId/v1":"2160d8165310d62b4b0cde8eb86615c577bdbafe2a603d132dc35dca61da8119"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#92165): In order to truly resolve this, we need to make sure"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_monomorphize/src/partitioning.rs"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c921bfaec40d725f6e034559083de9f6f5507d46510bc541f3dcfa68ddcdec0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: eventually we don\u0027t want to always force this symbol to have \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":"compiler/rustc_monomorphize/src/partitioning.rs"},"region":{"startLine":864}}}],"partialFingerprints":{"codehealthFindingId/v1":"9927410cf4832cd474566a5b07f05ff7baeca6fa3e5a7d7e59a5688c146709d3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#161753, rustc_scalable_vector/stdarch_aarch64_sve): this is unsound! Above we"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_monomorphize/src/mono_checks/abi_check.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddf5023c1cf43233eda2fdc1783758d03ff732465755fba51af723121831b031"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME maybe replace with inline asm? \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":"compiler/rustc_monomorphize/src/mono_checks/abi_check.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"119ce67cf4023c4df8d97dfd7f14b27e10968ad195b7d4f268da30e9ef159a5f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Find out where to report the lint on. Maybe simply crate-level lint root \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":"compiler/rustc_monomorphize/src/mono_checks/move_check.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"86fe30d1d4b7c042816d6f72802083b418231a35c97a8723cbb25848053a6027"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#57965): Make this work across function boundaries"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/check_call_recursion.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8579117881d98eecaadb12ba90f10d73af47c661b35e568a29b160605110909"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(explicit_tail_calls): highlight tail calls as \u0022recursive call site\u0022 \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":"compiler/rustc_mir_transform/src/check_call_recursion.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"02a536612122f4915b3a65c6c76fc33d5d6c8e5baa46d3077edf7dd23740eadb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(https://github.com/rust-lang/rust/issues/77425):"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/check_const_item_mutation.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c4a3ade8961b45ae2b4a7b90b250bc9ba49faa50ea137ac79793da2795041e8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(f16,f128): in order to avoid crashes building \u0060core\u0060, inline on targets that \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":"compiler/rustc_mir_transform/src/cross_crate_inline.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"5069916b14ecc986055f2ac4b3dc3c5be405284a6db78d84a7ed56b9f7dd657d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(explicit_tail_calls): determine if we need to do something 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":"compiler/rustc_mir_transform/src/dataflow_const_prop.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"740aadb0f38c04ae4935964c761746d093d59d8de43b6fca6a3bf85ad4996105"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Unfortunately, \u0060add_deref_metadata\u0060 is not documented. So who \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":"compiler/rustc_mir_transform/src/deref_separator.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"02a3b200416e7abdb7f61c3921e9393cc424739c8b355be2a946106e476062c4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Don\u0027t delete storage statements, but \u0022merge\u0022 the storage ranges 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":"compiler/rustc_mir_transform/src/dest_prop.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b6c7b04331d1a6d31a6bd7db6bf1e4af82c8b52cc94ee4fff6e94ae3cc8eaec"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#112651): This can be removed afterwards. Also update the module description."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/dest_prop.rs"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b3de3cdb581ce928771131de0c63a5aeb3d43dbe82a42c25e4f45a8979ef38c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: I think we should just control the flags externally, \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":"compiler/rustc_mir_transform/src/elaborate_drop.rs"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"42ef08aec165ebb354cd601fc168cb3e84ea159f3ee2c1f55d7e2a26c151fce2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#34708): handle partially-dropped array/slice elements."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/elaborate_drop.rs"},"region":{"startLine":1474}}}],"partialFingerprints":{"codehealthFindingId/v1":"a94e0e9ae333d96f1554c53e91b2079d5cb34e41e1755620816318b254e410ce"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: use existing printing routines to print the function signature \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":"compiler/rustc_mir_transform/src/function_item_references.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2b1708f75119a508adb5471d8da2a780c097ae905ba30b49a9325ed17fa2c78"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(reborrow): Is it correct to make these retagging assignments? \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":"compiler/rustc_mir_transform/src/gvn.rs"},"region":{"startLine":1087}}}],"partialFingerprints":{"codehealthFindingId/v1":"4005d0542ef102afd9accc7b904fe7ddbbaa83eed8cd41dd60d366a1adbf0d78"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(reborrow): CoerceShared should perform effectively a copy followed by 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":"compiler/rustc_mir_transform/src/gvn.rs"},"region":{"startLine":1091}}}],"partialFingerprints":{"codehealthFindingId/v1":"2da9c8639173f4145545ef75114e4d852bc0c30941174ea903ada9b2cfdd05e9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Is it correct to make these retagging assignments? \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":"compiler/rustc_mir_transform/src/gvn.rs"},"region":{"startLine":1287}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea7bf829c09784ae7027f9b2851dbf1be86eaa7b4c70b63e65ee489f75afb5bf"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Is it correct to make these retagging assignments? \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":"compiler/rustc_mir_transform/src/gvn.rs"},"region":{"startLine":2114}}}],"partialFingerprints":{"codehealthFindingId/v1":"94b53313aee67507a777c8e6b3845fdf741419d74f58debaa2c282517bd715e2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: remove this hack once https://github.com/rust-lang/rust/issues/128775 is fixed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/gvn.rs"},"region":{"startLine":1940}}}],"partialFingerprints":{"codehealthFindingId/v1":"e93ff0cd41c3584c4235a2016751292d45a8f6ba11f723f2e0f8ddedfbffdf85"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: remove this hack once https://github.com/rust-lang/rust/issues/128775 is fixed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/gvn.rs"},"region":{"startLine":2025}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5d29f68ea8ac6847a0725dbf7a2f616c59d7ffc447e002a37599c03e54f752a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: remove this hack once that issue is fixed. \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":"compiler/rustc_mir_transform/src/gvn.rs"},"region":{"startLine":1953}}}],"partialFingerprints":{"codehealthFindingId/v1":"57adae525d56b45abefd87a0562047191ae4917921c41f003083c2e3968b0466"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: find a way to treat this more uniformly (probably by fixing codegen) \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":"compiler/rustc_mir_transform/src/gvn.rs"},"region":{"startLine":1962}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cea618607b863100134ca43ad57bb5e02600615ffcf45874fae99b7a81c7f66"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#112651) \u0060rvalue\u0060 may have a subtype to \u0060local\u0060. We can only mark"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/gvn.rs"},"region":{"startLine":2128}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdcd643db96a4ee4a9b969a46d7e66f22e840b27687ccef19ac72c1ee7eda9ae"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This should be cleaned up to not rely on inspecting the global opt 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":"compiler/rustc_mir_transform/src/inline.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c599aaae5b21d86ec38fcadd4ab8f14d98fd7d213b3c7f900f599d664d05149"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Give a bonus to functions with only a single caller \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":"compiler/rustc_mir_transform/src/inline.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"44c6917c177655a13e63324928745f46f01c09f9f34e69ec809b23f2a513b956"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(explicit_tail_calls): figure out how exactly functions containing tail \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":"compiler/rustc_mir_transform/src/inline.rs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a161a042abb3d225323830b62266f0a4d8ebfac7b4c607bace5674feb06a379"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(explicit_tail_calls): figure out if we can inline tail calls \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":"compiler/rustc_mir_transform/src/inline.rs"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfe600484c30adb9e9b060b1164880b1afc02642e48484cac07f4356b2fa54d4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#127030): \u0060ConstParamHasTy\u0060 has bad interactions with"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/inline.rs"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"2adc6bfb9cc64609644201340b73b025e73d8ddfab95780b1cf90f7b304398b1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Once Stacked Borrows is fully removed, we can use \u0060Yes\u0060 here 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":"compiler/rustc_mir_transform/src/instsimplify.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6736ab3b779d46af11373bdceb02b688c6c4e88359508b450dc90df2791dc3a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(welseywiser) const prop doesn\u0027t work on coroutines because of query cycles \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":"compiler/rustc_mir_transform/src/known_panics_lint.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"356a7495f6c601e0acc21402ed1be0653bbce29968959f9a760f5c11806fdd64"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME we need to revisit this for #67176"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/known_panics_lint.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e8bcc81a2620e16c76de7cf461fc9488d10b89ab8bd0cd6bd815ec31f9fb8db"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME we need to revisit this for #67176"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/known_panics_lint.rs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3dcf09e85549d0ef8840cb4c984f06402ed12babf941d573226116d5137b756"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME \u0060Value\u0060 should properly support pairs in \u0060Immediate\u0060... but 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":"compiler/rustc_mir_transform/src/known_panics_lint.rs"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdc929dc759fb64556bf789ed13681d4e055b7f39a5c58a6aa9015092e209888"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: we overzealously erase the entire local, because that\u0027s easier 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":"compiler/rustc_mir_transform/src/known_panics_lint.rs"},"region":{"startLine":707}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f21560b3b439e2981c08620a3acb99044bcefd97a7c44391cfa532cce84a286"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(reflection): probably need to look at this for comptime 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":"compiler/rustc_mir_transform/src/lib.rs"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"464adf86bb23796d1d7f859c57ff111754ac16ba66e8794ca1c512799042c1d6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(JakobDegen): Can we make these lists of passes consts? \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":"compiler/rustc_mir_transform/src/lib.rs"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"78ce02c07dd41ab4390f57cabaa533b8f21a4c2e88f26c46db1e876fbb8c7232"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(@dingxiangfei2009): it turns out that \u0060self.body.source_scopes\u0060 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":"compiler/rustc_mir_transform/src/lint_tail_expr_drop_order.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cfe445fb5e3940d267137df607212150fe6090460865f28c33f3ef78f8cd796"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(typing_env): This should be able to reveal the opaques local to 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":"compiler/rustc_mir_transform/src/lint_tail_expr_drop_order.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb219f66e054ffefed8e74403dc28e44eaf9ab9721cc39429dbfca42751ceed6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: stop cloning the body. \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":"compiler/rustc_mir_transform/src/liveness.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"018c28be160bbede1767b2a93b07d99f8ad2203dbd19037ee6a1670777a44fb3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#155345): Liveness uses \u0060TypingMode::PostAnalysis\u0060"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/liveness.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"18aa89026aa8538af2459453aff28f723fe27dc0773b2315ee67649a75c4e381"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: what should happen 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":"compiler/rustc_mir_transform/src/liveness.rs"},"region":{"startLine":1359}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b8e2e3d4a1a0d8e2cc166929e8f6dff5aee60a7be916df3d884391cbf21426a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: extend to any case. \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":"compiler/rustc_mir_transform/src/match_branches.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba4366eafe2a50be3f169f600fa3d85731a1eb05232ef7b4cf9c4fb3f852d8c6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#112651): This can be removed afterwards."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/move_elimination.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"6acac7193fc542e444f6dace7608ad7f0f373680b682ab0221f10cbbe049fd51"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#112651): This can be removed afterwards."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/ssa.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5938e187746d93cde057b796021c61c0809e8e9b47ec6f8119e6a0427043425"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const-hack) Simplify the implementation once more \u0060str\u0060 methods get const-stable. \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":"compiler/rustc_mir_transform/src/pass_manager.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"c03f1eccd6376a49710be54f81f8216ea00d143a1e64e36997b3b9d32854e864"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: It would be nice to have a less-awkward way to apply permutations, \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":"compiler/rustc_mir_transform/src/prettify.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"0773cd0a2b607e44d01d75e8be973ce7e9e12ddbc424cc8074b634b727f2128c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(eddyb) maybe cache this? \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":"compiler/rustc_mir_transform/src/promote_consts.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"24879930c3b8921719ed23c4d6a7c69fb0dbc0aba7fbc04f011bec31c30bb590"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(eddyb) does this matter at all for promotion? \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":"compiler/rustc_mir_transform/src/promote_consts.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"536d077800f0609a7214095d3c87b71cc299babdfb0cce6f41facf6f299e35dd"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(RalfJung) it makes little sense to not promote this in \u0060fn\u0060/\u0060const fn\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":"compiler/rustc_mir_transform/src/promote_consts.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"7929140a0677cd4bd4f673f04fd9e96b498694571863467b05e5a304ffbe6d6e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(RalfJung): could we allow them? Should we? No point in it until we 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":"compiler/rustc_mir_transform/src/promote_consts.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"fad1ef0329f1442b005b1030a4b640abd160c8173f27553b67bb693b4c803ec4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: consider changing this to only promote \u0026mut [] for default borrows, \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":"compiler/rustc_mir_transform/src/promote_consts.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"783a04143bb72f09878e16cf73389ab980ddc17cedf1aba0d8b4a288cb261187"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(mgca): do we want uses of type_const to be normalized during promotion? \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":"compiler/rustc_mir_transform/src/promote_consts.rs"},"region":{"startLine":701}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9cec205936463dfdeb07013e1ed5323e57d18f5e954f538985068a2c7c8c15d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Should this really run on opt-level 0? Or is the LLVM code so terrible we want this even 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":"compiler/rustc_mir_transform/src/remove_noop_landing_pads.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"accc5582eef3ecabf6e70248109f2277dcde43cae773e393d56ff03163fc64d3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#91576): Drop shims for coroutines aren\u0027t subject to the MIR passes at the end"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/shim.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"60808fe48f7c827cea3700422fc547e78bb7bbc8933b757bb8fd7eb2d9190dd4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(compiler-errors): is this 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":"compiler/rustc_mir_transform/src/shim.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"414ffceb4acf75c4be64e5241dacca8acee36eadbbe27c5be60818450de5f98a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Avoid having to adjust the signature both here and 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":"compiler/rustc_mir_transform/src/shim.rs"},"region":{"startLine":842}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a7a103c3805051161e88c30253bf13caa74cb957242a8e5b85f69bd5d2664f7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: use \u0060expose_provenance\u0060 once we figure out whether function pointers have meaningful \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":"compiler/rustc_mir_transform/src/shim.rs"},"region":{"startLine":1132}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d28d547b1eba6701c4f8568f86b0884c7b40e3cfc2b1f3f76293aa13e13d7e3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Should probably be moved into some kind of pass manager \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":"compiler/rustc_mir_transform/src/simplify.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"70cfcadbd77605778d9206fbf476678ad9b5f8f3fe94e87c3baf8750b671a53d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This should use the intersection of all valid ranges. \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":"compiler/rustc_mir_transform/src/ssa_range_prop.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"a038af5c6e7796c3111129571f2e6469157fba8ed4b56dde5b8505e2bec5a176"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: For multiple targets, the range can be the union of their values. \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":"compiler/rustc_mir_transform/src/ssa_range_prop.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7d48995ffeee4f101ed56a79958aa4c6186698c77aa1fadcb7fcb8b9de0ccff"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: The range for the otherwise target be extend to more 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":"compiler/rustc_mir_transform/src/ssa_range_prop.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"a170b1215c449d394f31280fb48367e503d6f85afd5403fde0950c2c861dd40a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(JakobDegen): These bodies never instantiated in codegend anyway, so it\u0027s not \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/validate.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6e6a718658f014039854c1494404146278461813bb102d4ed7bb872bd1116f5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(explicit_tail_calls): refactor this \u0026 add tail-call specific checks \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":"compiler/rustc_mir_transform/src/validate.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8264ed2c257c899c778f3aaa7ac5da10ee668b0d6f4f70fd0e91cacaecc5857"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // the return edge from the call. FIXME(tmiasko): Since this is a strictly 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":"compiler/rustc_mir_transform/src/validate.rs"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e1177d40e7b95d6beb93a7aaf72eacfa21c6eaaadaec0861459b67e94a5a8a6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: check \u0060Thin\u0060 instead of \u0060Sized\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":"compiler/rustc_mir_transform/src/validate.rs"},"region":{"startLine":1131}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dd00f38e03c2c771c96580f5a1cb243d77b96bd4f8fe0b148b3556458b87451"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Check metadata more generally \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":"compiler/rustc_mir_transform/src/validate.rs"},"region":{"startLine":1142}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9c5369a245356c348ca0ff3d3aef5128002b938c31608969209dc7aaf2a306f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Add Checks for these \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":"compiler/rustc_mir_transform/src/validate.rs"},"region":{"startLine":1273}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3fc7eda5de9dece94965f710ff3ce324923b5c65a35640a88975af4b4ccb080"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: check signature compatibility. \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":"compiler/rustc_mir_transform/src/validate.rs"},"region":{"startLine":1276}}}],"partialFingerprints":{"codehealthFindingId/v1":"16fbef87f24c6e01b5926b0142b2705bf0aafaca5770a8129702407b4e332a57"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: check safety and signature compatibility. \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":"compiler/rustc_mir_transform/src/validate.rs"},"region":{"startLine":1289}}}],"partialFingerprints":{"codehealthFindingId/v1":"50b9d99b4a47c8891fc02ebe0477a182ced80fa2d1510b3b3ee4516cb0818d07"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: check safety, captures, and signature compatibility. \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":"compiler/rustc_mir_transform/src/validate.rs"},"region":{"startLine":1302}}}],"partialFingerprints":{"codehealthFindingId/v1":"675514b5bc9267a29e96a65d2192e85e138516aa0af80ea7a24db57bd0e47745"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: check same pointee? \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":"compiler/rustc_mir_transform/src/validate.rs"},"region":{"startLine":1315}}}],"partialFingerprints":{"codehealthFindingId/v1":"06e14f62977644d11a108fb078d4dbb86375b5177c573e42b00798e5ee870baa"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Check pointee 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":"compiler/rustc_mir_transform/src/validate.rs"},"region":{"startLine":1331}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e815d57a9c634c2fa250850f5403395bc11b39eeb461b508eae143aa0470251"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(explicit_tail_calls): implement tail-call specific checks here (such \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":"compiler/rustc_mir_transform/src/validate.rs"},"region":{"startLine":1637}}}],"partialFingerprints":{"codehealthFindingId/v1":"f334c58e16d1f07468de3aa8140fb846a572f3baeb114704d61efa0b98e48ec9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: A not fully instantiated drop shim can cause ICEs if one attempts 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":"compiler/rustc_mir_transform/src/inline/cycle.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aabc39745e069b802b081643774e45ee5520a4aa5d8b6a8b164405796835238"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(-Znext-solver=no): Remove this hack when trait solver overflow can return an 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":"compiler/rustc_mir_transform/src/inline/cycle.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbd8dcc28397881bf1d2c0c709d3a31f812bb8ee554ceff6b54fcc62d63b9890"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(async_drop): Drops, produced by insert_clean_drop \u002B elaborate_coroutine_drops, 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":"compiler/rustc_mir_transform/src/coroutine/drop.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7f05713bab04a53df648be2cd75c25795c41e3edf916715512edafd67e780e8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: When move insert_clean_drop \u002B elaborate_coroutine_drops before async drops expand, \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":"compiler/rustc_mir_transform/src/coroutine/drop.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c67e98a5d921f2dc751ecae23438f37201fa2bb06ad6f54775affd378158bf7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(tmandry): Consider using sparse bitsets here once we have good \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":"compiler/rustc_mir_transform/src/coroutine/layout.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e17640c34e72701125fc79c0445c39803d4b5b6d4cb5aeb66dfc729963ad360"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#132279): @lcnr believes that we may want to support coroutines"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/coroutine/layout.rs"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b3a1f760f3a1a4b9a799b10876fa718bfed73746849fea46a7a52d775416b62"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(sized_hierarchy): This should be replaced with a requirement that types 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":"compiler/rustc_mir_transform/src/coroutine/layout.rs"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef0e4e445985be95255f761a25c25bcd91299ef35f8b08d0ef790cd6dafc3c47"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: support adding the attribute to TAITs \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":"compiler/rustc_mir_transform/src/coroutine/layout.rs"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec201a5f46f92c05de35c29768debc469bae5b4f34cb4fab7180e76c3a76bc06"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(must_not_suspend): This is wrong. We should handle printing unevaluated consts. \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":"compiler/rustc_mir_transform/src/coroutine/layout.rs"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"8365959e71009869b71c900a8828283f5b1568340160c44d15ffdb9cc901bc05"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Does \u0060asm!\u0060 have any aliasing requirements? \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":"compiler/rustc_mir_transform/src/coroutine/mod.rs"},"region":{"startLine":1367}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd8a714cd1626bd7350d33569ff10d718d925eb4fc9f666d7a2636e4dac85bf2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Does \u0060\u0026raw const foo\u0060 allow mutation? See #90413."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_dataflow/src/impls/initialized.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0e9ef93898e91661f575b0950ac91f7a94cfc21a24cd1ec95168d4038d57c50"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We are not sure how we should represent this debugging information for some statements, \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":"compiler/rustc_mir_dataflow/src/impls/liveness.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"26ef083548899ee5b5174c3b087a6ed4453b1e550770cf875c85c0f8a983388d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: These should really be printed as part of each outgoing edge rather than the node \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":"compiler/rustc_mir_dataflow/src/framework/graphviz.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e3c5038e326fd88141c203a3a116f141f575cfbb8977eecdd398a15ded75333"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: The full state vector can be quite long. It would be nice to split on commas \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":"compiler/rustc_mir_dataflow/src/framework/graphviz.rs"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"b203c8d9cf1dc9b66a5817208cf87543a0e3b2a53b080f3bb4c2de3bc326c2b9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: For backward dataflow analyses, the initial state should be applied to every basic \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":"compiler/rustc_mir_dataflow/src/framework/mod.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"e173de74bd74793c501f587f073535fc358ea0ac83cbda0f5ce5ffc644ead0e7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(explicit_tail_calls): this currently fails for cases where opaques are used. \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":"compiler/rustc_mir_build/src/check_tail_calls.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdb84563ba4742118ce446e6c723729436e977c97dd2ece5c8a649265d03896b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(explicit_tail_calls): highlight the \u0060...\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":"compiler/rustc_mir_build/src/check_tail_calls.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2a3a844877ab082e7cb309fec55953238c8bf39ebfada87966e45e7861484b0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(explicit_tail_calls): highlight the function or something... \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":"compiler/rustc_mir_build/src/check_tail_calls.rs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"c58c26b760b5a7875f07e5982448e5e3c73e17d7801a9450e81d6dc1a27863dc"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: ideally we would want to trim the def paths, but this is not \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_build/src/check_unsafety.rs"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8b72df0731e413021922a016c66a9273a0fa441a4474cc4a7fbcd4539dc6423"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: the line below from PR #135310 is a workaround for the ICE in issue"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_build/src/thir/pattern/check_match.rs"},"region":{"startLine":1105}}}],"partialFingerprints":{"codehealthFindingId/v1":"b807e65dc068372b4b2cebcd26748f1d1bc6a037610c22c24ebcc3bbaf1f325e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: migration of this diagnostic will require list 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":"compiler/rustc_mir_build/src/thir/pattern/check_match.rs"},"region":{"startLine":1276}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1e178b2e4f5725c49b5ce6447514a142f48c3351cf968c2e09829f66a6870b0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(ref_pat_eat_one_layer_2024_structural): To track the default binding mode, we duplicate \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":"compiler/rustc_mir_build/src/thir/pattern/migration.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa2450ddd239647eee3b69cd8230ce1b334b45ea152113390f1d7fb4bd154045"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(dianne): for peace of mind, don\u0027t risk emitting a 0-part suggestion (that 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":"compiler/rustc_mir_build/src/thir/pattern/migration.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8d7f29f1511fae5853f6bab6768f6ff998437a48a88a890aedbe1ad38efc513"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(unsafe_binders): Take into account the ascribed type, too. \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":"compiler/rustc_mir_build/src/thir/cx/expr.rs"},"region":{"startLine":1226}}}],"partialFingerprints":{"codehealthFindingId/v1":"431d335bfdf7127feb288c5edfce9551632781528fb4a0612909a85b1ce25d5f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(unsafe_binders): Take into account the ascribed type, too. \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":"compiler/rustc_mir_build/src/thir/cx/expr.rs"},"region":{"startLine":1235}}}],"partialFingerprints":{"codehealthFindingId/v1":"f78fcb3b09bbeaaf2bfc7d8d691f5d4a886b1e7c4f9cdb7bc53fa44dc6b452f7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(splat): de-tuple args in codegen for performance \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":"compiler/rustc_mir_build/src/thir/cx/expr.rs"},"region":{"startLine":1375}}}],"partialFingerprints":{"codehealthFindingId/v1":"20dc16eb7be35d679d09cf0313f45e713812b2a1d89a4d0e47be472286b1a9d5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(splat): do we need to populate and apply user_provided_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":"compiler/rustc_mir_build/src/thir/cx/expr.rs"},"region":{"startLine":1430}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0e1802b8136824c37665f37c4e4167f76e3d5e4716ad7892292dacbb43a0071"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME(Zalathar): Now that we have [\u0060CoverageKind::Point\u0060], we should be able \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":"compiler/rustc_mir_build/src/builder/coverageinfo.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"38aa4d770d245908e4354743b36bb1d72c20c741a2da3961be1a38a0016da169"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(@lcnr): Why does this use an \u0060infcx\u0060, there should be \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":"compiler/rustc_mir_build/src/builder/mod.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0f97f50d5acdab8f1b9a88da22134914db9aaf6283c13c452f556b6f5c1a52b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// here, when building for FIXME. \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":"compiler/rustc_mir_build/src/builder/mod.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"94e803bca7e57f3fb9f10a14944bba66aba826c71cb02a93f2c74473f36c2f81"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK(eddyb) Avoid having RustCall on closures, \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_build/src/builder/mod.rs"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ed073f841c294f9114cb0d457ff74464726abc57bb3c3305cdeec1ed8a84e87"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#132279): This should be able to reveal opaque"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_build/src/builder/mod.rs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"16be5984316e4843aa22688afb9c12c751ab5dbe3e283cdfe93f111c7473c582"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#132279): This should be able to reveal opaque"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_build/src/builder/mod.rs"},"region":{"startLine":641}}}],"partialFingerprints":{"codehealthFindingId/v1":"210e3acc838dc360ebbe23a3ee0401dac9de78c3c1cece8a1119d4dbe73ccb36"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(splat): splat can untuple any argument, set spread_arg 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":"compiler/rustc_mir_build/src/builder/mod.rs"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed582062bcc73c4258d9851c885a823f4b1db2bf109d215fe6907afbee31beef"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK(khyperia): The trait solver does not support Projection aliases to impl item \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_build/src/builder/mod.rs"},"region":{"startLine":837}}}],"partialFingerprints":{"codehealthFindingId/v1":"c83b0bc9982293f09649fe2e5ca9e1940705c27cde832dd3045e3339ecca0acf"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(f16_f128): When available, compare to the library parser as with \u0060f32\u0060 and \u0060f64\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":"compiler/rustc_mir_build/src/builder/mod.rs"},"region":{"startLine":1227}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd5ae7b5459bc4cffdae861d470bb2c94c7d2cd6eeb4bf22916dbd23d2bb3a3e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(f16_f128): When available, compare to the library parser as with \u0060f32\u0060 and \u0060f64\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":"compiler/rustc_mir_build/src/builder/mod.rs"},"region":{"startLine":1281}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b392b74d63436446f4a0c6adce07c5c2e60e318647ee58ce871b4b87619e987"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(oli-obk): Replace the magic const generic argument of \u0060simd_shuffle\u0060 with 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":"compiler/rustc_mir_build/src/builder/scope.rs"},"region":{"startLine":856}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b8619e0dab25301206efeb361406d7ee17d3d3362269c695d25d45c45803397"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(explicit_tail_calls) code duplication with \u0060build_scope_drops\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":"compiler/rustc_mir_build/src/builder/scope.rs"},"region":{"startLine":1125}}}],"partialFingerprints":{"codehealthFindingId/v1":"465e959f2663979415e62f42cf0f20105d8801c4d2190890e328d2b761873aa4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME(#29623). In some cases, we have some tricky choices to make. for"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_build/src/builder/matches/buckets.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"a71ece898fba990a971dce38e3a536ab3f5117b572d9ef8b5c96b5a36b142153"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#29623) we could use PatKind::Range to rule"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_build/src/builder/matches/buckets.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbc90d1ec3dcc7050886428fb2473bb565de2f7d561eaf9dd1a39837c183fde8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(@dianne): this needs updating/removing if we always merge or-patterns \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":"compiler/rustc_mir_build/src/builder/matches/match_pair.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aaa0083e4fca86632114b8829bd2979900912f83064304696fd0df36363aca0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(oli-obk): can we use this to simplify slice/array pattern hacks? \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":"compiler/rustc_mir_build/src/builder/matches/match_pair.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"c25d2dae176e19b76b6c1cf76c6c589b310594e5982fa94967b5679c12722ea1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(Zalathar): This still covers several different \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":"compiler/rustc_mir_build/src/builder/matches/match_pair.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c262f1aefec87aff12d38c71d2f65c0b455c83af4b085c70ef6a03054b31a4c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(deref_patterns): dedup temporaries to avoid multiple \u0060deref()\u0060 calls? \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":"compiler/rustc_mir_build/src/builder/matches/match_pair.rs"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"936bc3f4cbae29f34c6e830bafab8dd728ef2326829b800a22137049d2ad1154"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(guard_patterns) \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":"compiler/rustc_mir_build/src/builder/matches/match_pair.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"6908b4de5a5ce6d6437c62e9174b5356480f144b229b95126a6913bec0a36509"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: pass a proper \u0060opt_match_place\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":"compiler/rustc_mir_build/src/builder/matches/mod.rs"},"region":{"startLine":737}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae5fdebd9a93c53db0db4e52e09bbdd51d838a46fc967b5bd87dbf0b2246bacd"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// - FIXME: We sometimes don\u0027t unset this when clearing \u0060subcandidates\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":"compiler/rustc_mir_build/src/builder/matches/mod.rs"},"region":{"startLine":1047}}}],"partialFingerprints":{"codehealthFindingId/v1":"45efa56bd19a0be59e6e68e35d720db4ec16c304c8a201832c76a731a1f91e4b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(@dianne): prevent ill-formed patterns from getting 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":"compiler/rustc_mir_build/src/builder/matches/mod.rs"},"region":{"startLine":1480}}}],"partialFingerprints":{"codehealthFindingId/v1":"b174fdd32be7c70e5c6355db279765b9fd56735bcf5adfd7ebd9101e963d74df"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(@dianne): prevent ill-formed patterns from getting 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":"compiler/rustc_mir_build/src/builder/matches/mod.rs"},"region":{"startLine":1512}}}],"partialFingerprints":{"codehealthFindingId/v1":"4071b24da8fc1cf8ecc026197daea8ea554761f1ebf05a59540f1c913835bbcf"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(or_patterns; matthewjasper) Don\u0027t give up if we have a guard. \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":"compiler/rustc_mir_build/src/builder/matches/mod.rs"},"region":{"startLine":1999}}}],"partialFingerprints":{"codehealthFindingId/v1":"163bedaafcede2b6577ae22ca268266844eccf3f8304a5e96f7cf1ac5a982451"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(or_patterns; matthewjasper) Try to be more aggressive 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":"compiler/rustc_mir_build/src/builder/matches/mod.rs"},"region":{"startLine":2003}}}],"partialFingerprints":{"codehealthFindingId/v1":"641d93e77476883cdeeb049ed51486b0abe0a849eabf92257d28acf4fdf981cc"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(khuey) at what point is it safe to bail on the iterator? \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":"compiler/rustc_mir_build/src/builder/matches/mod.rs"},"region":{"startLine":2871}}}],"partialFingerprints":{"codehealthFindingId/v1":"da56560b74003164bd27a368a42425cb1882170aa09d3ae3389cbf704d85b6d6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(never_patterns): Also assert validity of the data at \u0060place\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":"compiler/rustc_mir_build/src/builder/matches/test.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2e46f1f273e2bf2212baa15b9b20733a59cfd15d08596ab0243e9b393bda3cb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#54571): This constant comes from user input (a"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_build/src/builder/matches/test.rs"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d748e1eadf97c76f48f48e12f683452dc5d56a72c0109f34dc2c616454b2690"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // though. FIXME: Do we really *need* to count this as a use? \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":"compiler/rustc_mir_build/src/builder/expr/as_place.rs"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"293b6756d52cba77c09924c67c9f3255b2b7f04bdfd0d55f4b4c76f59d18c424"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#27840) these probably want their own"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_build/src/builder/expr/category.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"5807fe53486fd77af04a931c2d0e72399669006c366aed7500e3ada6b16e9cba"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Does this need extra logic to handle let-chains? \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":"compiler/rustc_mir_build/src/builder/expr/into.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"f054db430045d79defe96926006793d866ddf208df1ab80cbc558352067e6bdb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#28160) there is an interesting semantics"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_build/src/builder/expr/stmt.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"f78510de238325a37fc83b4c6a9daa98e4b1019edd82d13bb79431a24b7bbaab"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME get rid of this with valtrees \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":"compiler/rustc_middle/src/queries.rs"},"region":{"startLine":1411}}}],"partialFingerprints":{"codehealthFindingId/v1":"44e71cfd4e4b0470babf54fdc78223844d895d74467eb423535c6e5255d00242"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This is currently only used for collecting lang items, but should be used instead of \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":"compiler/rustc_middle/src/queries.rs"},"region":{"startLine":2421}}}],"partialFingerprints":{"codehealthFindingId/v1":"485285e63203a57a88be4e5478dc6f5c4d4daeb606ba98c90e4c3fb2fccdbd4c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#27438): Right now, the unit tests of \u0060rustc_middle\u0060 don\u0027t refer to any actual functions"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/tests.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6212c503f7a29e0fc38a8994b7dcdf501f32ba785229dd55f725d8652152cc8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME improve docs for \u0060StaticRef\u0060 by distinguishing it from \u0060NamedConst\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":"compiler/rustc_middle/src/thir.rs"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbef1422af5ce6c4daa2156634fd3b7a74a0af882bc7452f5390da217431998d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: consider combining this method with \u0060AdtDef::destructor\u0060 and removing \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":"compiler/rustc_middle/src/ty/adt.rs"},"region":{"startLine":757}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd79e742dca947e71c563f66c7ef1bb4d99a4e4b16b85cf6d158d68192f88aed"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME rust-lang/rust#64319, rust-lang/rust#64872:"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/ty/context.rs"},"region":{"startLine":1525}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dd80b402b30d5415ab29b3ef9060ea1040f8b6fb0d478cdf0851e431e3f1eee"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#42706) -- in some cases, we could do better here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/ty/context.rs"},"region":{"startLine":1563}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c43707787e6bafc4d0bda50c72a14cae8cd3157292e78808ea11af626736aec"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: \u0060restricted_std\u0060 is used to tell a standard library built \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":"compiler/rustc_middle/src/ty/context.rs"},"region":{"startLine":1716}}}],"partialFingerprints":{"codehealthFindingId/v1":"c03fd97e9092a14dded311e48033dae56ee000b98763e7e7f66945a227097531"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // hack this in the linter to ignore it? \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/ty/context.rs"},"region":{"startLine":1721}}}],"partialFingerprints":{"codehealthFindingId/v1":"d102239d28a79a9a191f0581cb1e9e99507c00e2ecdee4be0234a96c13cb54b7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: unclear why exactly the macro doesn\u0027t 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":"compiler/rustc_middle/src/ty/context.rs"},"region":{"startLine":1821}}}],"partialFingerprints":{"codehealthFindingId/v1":"42774988d416358b2716b4420a9a26adc89703a1b6a5b0c795876f300f32d5ee"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME consider asking the input slice to be sorted to avoid \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":"compiler/rustc_middle/src/ty/context.rs"},"region":{"startLine":2549}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dfa0b90327ba86a97fe448723b91b919a092e6a88408e320853dcce56864091"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME consider asking the input slice to be sorted to avoid \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":"compiler/rustc_middle/src/ty/context.rs"},"region":{"startLine":2556}}}],"partialFingerprints":{"codehealthFindingId/v1":"32295e19795ac71eef1ee1207f3516988f75e04d47950920385db278a97c1b1f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: make this string translatable \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":"compiler/rustc_middle/src/ty/context.rs"},"region":{"startLine":2779}}}],"partialFingerprints":{"codehealthFindingId/v1":"7baf86254a890b61f391ccdfc27d8067f70083f0d714742ff94f83adf424de43"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(RPITIT): if we ever synthesize new lifetimes for RPITITs and not just \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":"compiler/rustc_middle/src/ty/context.rs"},"region":{"startLine":2834}}}],"partialFingerprints":{"codehealthFindingId/v1":"839f7a98820f5c71db11ef530d6491959a44072d2a9041017ac0c1877a487a4c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: remove the suggestions that are from derive, as the span is not 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":"compiler/rustc_middle/src/ty/diagnostics.rs"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"70661e7cab949844cc59a192b68ed7e694c4c474aad5f5a64be353095a6ccfd3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: It would be nice to make this not use string manipulation, \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":"compiler/rustc_middle/src/ty/diagnostics.rs"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9eaf51ef5e7475938cfbfd8db5735edc5b290e3b20a1834344e65c1f545fa5e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: It would be nice to make this not use string manipulation, \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":"compiler/rustc_middle/src/ty/diagnostics.rs"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"0290c9fd7d860ab434be49be11eebf9879eb82508a36b4004e4b05a70422cd27"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This shouldn\u0027t return numerical/float. \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":"compiler/rustc_middle/src/ty/generic_args.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3d8140024bb1f8b1dbad6d06f60f9a5bda0c729672c080709027d923c94a0c2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: we cannot easily provide this anymore in the future if we store 1 element inline. \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":"compiler/rustc_middle/src/ty/generic_args.rs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"adadd1d14aec2d66d49bf78a81569362f1bf54707288ce28f5ba3199afa9d514"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(erikdesjardins): handle non-default addrspace ptr 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":"compiler/rustc_middle/src/ty/layout.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"d80badb58350e7440cf08a3fe43e8b73b523e17743d4b0dc8e353e686558eae0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(erikdesjardins): handle non-default addrspace ptr 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":"compiler/rustc_middle/src/ty/layout.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"db1ad22dd3941ac7159814468cc9ca9ac88b02295bf10a8809b940a712eef87c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(erikdesjardins): handle non-default addrspace ptr 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":"compiler/rustc_middle/src/ty/layout.rs"},"region":{"startLine":1183}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfb854e86740aaf0d33a35bb754b1f81061f3e5e761fadfa36554434708dd550"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(erikdesjardins): handle non-default addrspace ptr 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":"compiler/rustc_codegen_ssa/src/mir/operand.rs"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"269c2d9b8836d28f7a56ec47bcfc4d5a0681d3e638ce2875b575d0872f383b34"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(erikdesjardins): handle non-default addrspace ptr 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":"compiler/rustc_codegen_ssa/src/debuginfo/mod.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e5ae02b049cc4f961082672d04e576876cad8fc5861c34adfb570f1304b4941"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(erikdesjardins): handle non-default addrspace ptr 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":"compiler/rustc_codegen_llvm/src/asm.rs"},"region":{"startLine":1155}}}],"partialFingerprints":{"codehealthFindingId/v1":"1956df58066e0e83228dad7eafc9a2f9afdb3a2bae0f275b2db17c1082f52d1a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(erikdesjardins): handle non-default addrspace ptr 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":"compiler/rustc_codegen_llvm/src/asm.rs"},"region":{"startLine":1195}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c826cc940e0aa0bc3adfd3b62ebe2c4a2446861645a5e252f79d979d1ddce00"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(erikdesjardins): handle non-default addrspace ptr 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":"compiler/rustc_codegen_cranelift/src/common.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"cce378e904851508ad356372e6d8bd6cd28e7183a99407b8c3ea4e06a2112e19"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#155345): This should only handle rigid aliases if we\u0027re using"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/ty/layout.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"baddca0ec3d02f084216957bbd964acff7915bb24f6545a8d21c6ab8509902aa"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(eddyb) perhaps make this mandatory to get contexts to track it better? \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":"compiler/rustc_middle/src/ty/layout.rs"},"region":{"startLine":742}}}],"partialFingerprints":{"codehealthFindingId/v1":"a25555f3c6b8ff386b414bbce77f59240019b103fc59d7c2546985401d48c810"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(eddyb) avoid passing information like this, and instead add more \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":"compiler/rustc_middle/src/ty/layout.rs"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"440d8e4719924fb4aa0006a3838805e080ae051c7760b8188c4ae6b5b96edb3a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: properly type (e.g. usize and fn pointers) the fields. \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":"compiler/rustc_middle/src/ty/layout.rs"},"region":{"startLine":932}}}],"partialFingerprints":{"codehealthFindingId/v1":"59e0f8b428d66a2a0209f7d020a6e1185d7b2058bc252a408db5149e276a05fb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(eddyb) maybe use something like this for an unified \u0060fn_abi_of\u0060, not \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/ty/layout.rs"},"region":{"startLine":1404}}}],"partialFingerprints":{"codehealthFindingId/v1":"059819951e7d81bdd2acc9b187daffda64089392fcd2a82f3913004cd96a5c77"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(eddyb) get a better \u0060span\u0060 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":"compiler/rustc_middle/src/ty/layout.rs"},"region":{"startLine":1471}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb6947c8044623c11bf1657efc7673a9e99c58748ccc631df91f11db03a2b9da"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(eddyb) get a better \u0060span\u0060 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":"compiler/rustc_middle/src/ty/layout.rs"},"region":{"startLine":1500}}}],"partialFingerprints":{"codehealthFindingId/v1":"113be75c0b8a34cba85f52ce97e06a56c5657a59f2ae0b687372d65c46871aa2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(eddyb) get a better \u0060span\u0060 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":"compiler/rustc_middle/src/ty/layout.rs"},"region":{"startLine":1539}}}],"partialFingerprints":{"codehealthFindingId/v1":"58f68b1ef54a3f1eed22ec98ae66e9dea846eb0e012067988c49b21ca60843d1"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK(eddyb) at least for definitions of/calls to \u0060Instance\u0060s, \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/ty/layout.rs"},"region":{"startLine":1509}}}],"partialFingerprints":{"codehealthFindingId/v1":"faee6dd736abd58efec16724052dd9df33839d80fb3a091267d6f9287097b67c"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK(eddyb) at least for definitions of/calls to \u0060Instance\u0060s, \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/ty/layout.rs"},"region":{"startLine":1546}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8c1bfbc891216c25bc9c0470d94def7245d634ae0aa46701155f05fde5717dd"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#159654): This should get deleted soon"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/ty/mod.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b9d2ac5abe3d54e3c150d509c887a01d3c50a9e1c5905408790db942dd97b20"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: this should not be needed in the long term. \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":"compiler/rustc_middle/src/ty/mod.rs"},"region":{"startLine":1181}}}],"partialFingerprints":{"codehealthFindingId/v1":"31ff4b9f36845aecc392707abc38b4f2a9dc5edb959f61057cbc57e3b856e5ff"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#132279): We\u0027re in a body, we should use a typing"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/ty/mod.rs"},"region":{"startLine":1189}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3094535d25ab95b18459d1c592810f6c9556d2e240cf429a8668a85fc52202e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: we might want to return \u0060Unnormalized\u0060 since we force the value to be non-rigid. \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":"compiler/rustc_middle/src/ty/mod.rs"},"region":{"startLine":1213}}}],"partialFingerprints":{"codehealthFindingId/v1":"b11e63db794f3ca360a94e78b9732ae87e6c74dcc1ef4f0cafc779cd037421d5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#132279): We should assert that the value does not contain any placeholders"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/ty/mod.rs"},"region":{"startLine":1271}}}],"partialFingerprints":{"codehealthFindingId/v1":"eae391d7b3bd406f50477468647b1a7bb76d58d0d1adfba4d65e6f6cdc155ce3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: consider combining this definition with regular \u0060Destructor\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":"compiler/rustc_middle/src/ty/mod.rs"},"region":{"startLine":1309}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2c0728aef2b480af9ecd8639913ae47aa2dc8f45ed6bf3a5e03897db619ff5c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const_trait_impl): ATPITs could be conditionally 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":"compiler/rustc_middle/src/ty/mod.rs"},"region":{"startLine":2306}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9919590840ec755b00239d3c193eb8bff3cd61ba6b8caeca3d0f6160574746f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(@lcnr): This method should not be necessary, we now normalize \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":"compiler/rustc_middle/src/ty/normalize_erasing_regions.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"adc18b654c09d71525f76722110e0e1bc5771b9cbbed48b72858baa7570ad8d4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(Sa4dUs): implement a solid logic to determine the payload size \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":"compiler/rustc_middle/src/ty/offload_meta.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"92a48bbb62990bea66cfad7c8dc72242737064899e5ebc112103f57ba3c3e428"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This should not treat aliases this way. \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":"compiler/rustc_middle/src/ty/offload_meta.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bedada41be7804cbd8781e85b7a5980180cd469d6fc714747fb2902331677d2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Is it really perf sensitive to use reuse_or_mk_predicate 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":"compiler/rustc_middle/src/ty/predicate.rs"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0700050acb1d3ba787b94c6b18ab3d18b425dedcad18f084e4224ad34c6d12d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(generic_const_exprs): is it possible to relate two consts which are not identical \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":"compiler/rustc_middle/src/ty/relate.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"36c441742c392e978a3bb2a359a15eb54f3740d8f36cfdfa1bd137dba494b4e9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(generic_const_exprs): relating the \u0060ty()\u0060s is a little weird since it is supposed 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":"compiler/rustc_middle/src/ty/relate.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e3683c5948adde16f2a0e01e0a4be00348086d7cb80c9c0e9b8f5467b9956ea"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(clause): This is wonky \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":"compiler/rustc_middle/src/ty/structural_impls.rs"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"548ab8eb414766372280e6ba40194dfbdb163cc74d208e3db41d317df54820d2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME requires optimized MIR \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":"compiler/rustc_middle/src/ty/sty.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"a071bf7c2bbc49ad20213c6a294d2947f6742f6f7cd62a002ea0f24acdfd518a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(repr_simd): https://github.com/rust-lang/rust/pull/78863#discussion_r522784112"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/ty/sty.rs"},"region":{"startLine":1317}}}],"partialFingerprints":{"codehealthFindingId/v1":"757cb71ce4e0463c721f21a9626e431c12f784c4903f8f33d4cd71475d321ca7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This requires the optimized MIR in the case of coroutines. \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":"compiler/rustc_middle/src/ty/sty.rs"},"region":{"startLine":1659}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2ab1692051197aca0daced227b18a9d7c5b6fb2a969a90fe016a07c389488f6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This requires the optimized MIR in the case of coroutines. \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":"compiler/rustc_middle/src/ty/sty.rs"},"region":{"startLine":1677}}}],"partialFingerprints":{"codehealthFindingId/v1":"b06c9e5f02129dbe6913e9aa541f90bb04af8458d0ae08118ae7e9479e97d7a3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(scrabsha): i expect views to behave like foreign types 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":"compiler/rustc_middle/src/ty/sty.rs"},"region":{"startLine":1784}}}],"partialFingerprints":{"codehealthFindingId/v1":"15d49adfc18ad18216c846393fc17fc54614a1be56b198803849152bfd619692"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(-Znext-solver=no): Need to support aliases not marked 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":"compiler/rustc_middle/src/ty/trait_def.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"daf37f3fd40c89ea27fbbfc06c0937b932ec20ceab431526c042917bcf34e586"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: These things don\u0027t *really* have \u0027static lifetime. \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":"compiler/rustc_middle/src/ty/util.rs"},"region":{"startLine":748}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa683d563aebbd20af9f374f70222bf2465ea7323e58daab52e4fb66b419e943"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(zetanumbers): Note that this method is used to check eligible 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":"compiler/rustc_middle/src/ty/util.rs"},"region":{"startLine":1378}}}],"partialFingerprints":{"codehealthFindingId/v1":"37a12423779486b52bc7e5441ff5c361bdc1d61f6c5d2fd7c2742e356f275043"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(ecstaticmorse): Maybe we should \u0060bug\u0060 here? This should probably only be \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":"compiler/rustc_middle/src/ty/util.rs"},"region":{"startLine":1495}}}],"partialFingerprints":{"codehealthFindingId/v1":"43e090265cac662703e53ded036aa15c97d1edaf22f056dbdc58a37ef66cee5e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(zetanumbers): consider replacing this with only \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":"compiler/rustc_middle/src/ty/util.rs"},"region":{"startLine":1531}}}],"partialFingerprints":{"codehealthFindingId/v1":"9da3d2dd48c3f7eb4dcc1ff62a0dea014c3dd376f03b78ad1cec5bf4aa897fad"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(zetanumbers): Temporary workaround for async drop of dynamic 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":"compiler/rustc_middle/src/ty/util.rs"},"region":{"startLine":1567}}}],"partialFingerprints":{"codehealthFindingId/v1":"29eca0732269c10e141992fd20570f8f2e49b0a56f563e4d4746ca9302725267"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(eddyb) try to move this into the parent\u0027s printing \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":"compiler/rustc_middle/src/ty/print/mod.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"e81200ae9f686313ef5c17d63fa06bc8613368419756c178d1501ef1c4352df1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(eddyb) find something better to key this on, \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":"compiler/rustc_middle/src/ty/print/pretty.rs"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"6981a900f0655d45b5597596e8a6d17df41b6a1df941804af16dd37f321dc402"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK(eddyb) this bypasses \u0060print_path_with_simple\u0060\u0027s prefix printing to avoid \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/ty/print/pretty.rs"},"region":{"startLine":656}}}],"partialFingerprints":{"codehealthFindingId/v1":"76692bae6cab168a509af250ba285b0bbaf7e92503293dee31981db5afa170c2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(eddyb) print this with \u0060print_def_path\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":"compiler/rustc_middle/src/ty/print/pretty.rs"},"region":{"startLine":890}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a92939ea3be4e2c263a4334f4312037d3a7cd03e081cd89ba08882901da348e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(return_type_notation): We only support lifetime params for now. \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":"compiler/rustc_middle/src/ty/print/pretty.rs"},"region":{"startLine":1352}}}],"partialFingerprints":{"codehealthFindingId/v1":"d79bd4d1785b3b9e47f87c8724384308bb0d98cb255101fa89bf3791831b9b7f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(splat): support splatted arguments 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":"compiler/rustc_middle/src/ty/print/pretty.rs"},"region":{"startLine":1413}}}],"partialFingerprints":{"codehealthFindingId/v1":"43044df7f58303ad42f3ca645d1bc1cd2187105ec8adecd01ce6e4a36ea67275"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK(eddyb) this duplicates \u0060FmtPrinter\u0060\u0027s \u0060print_path_with_generic_args\u0060, \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/ty/print/pretty.rs"},"region":{"startLine":1422}}}],"partialFingerprints":{"codehealthFindingId/v1":"41529afb000e53a310063375d14d1d0d1bac25052468b2739723f04106df12b2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(eddyb) avoid printing twice (needed to ensure \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":"compiler/rustc_middle/src/ty/print/pretty.rs"},"region":{"startLine":1489}}}],"partialFingerprints":{"codehealthFindingId/v1":"c32de2259e7c340274cdcc1a104bf55b536ca5a4bcc1be4a11b4b4a63393b6fa"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(splat): if splatting becomes part of the type, we can remove this 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":"compiler/rustc_middle/src/ty/print/pretty.rs"},"region":{"startLine":1528}}}],"partialFingerprints":{"codehealthFindingId/v1":"61c41aa84121fb387167e4bf0cca26f901bab5dc639bf51df79e4662aad0478d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(generic_const_exprs): \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":"compiler/rustc_middle/src/ty/print/pretty.rs"},"region":{"startLine":1616}}}],"partialFingerprints":{"codehealthFindingId/v1":"cea686b19ebe49300d0d1edd103afa13c4ae9bd2cf256f0e1a4efd1664735217"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: for statics, vtables, and functions, we could in principle print more detail. \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":"compiler/rustc_middle/src/ty/print/pretty.rs"},"region":{"startLine":1772}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ce26eac12f26fb64dd8df9834f2bdef464c95aa27b47aa576edc3ebb1da1883"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We should probably have a helper method to share code with the \u0022Byte strings\u0022 \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":"compiler/rustc_middle/src/ty/print/pretty.rs"},"region":{"startLine":1785}}}],"partialFingerprints":{"codehealthFindingId/v1":"1885af3ae3fcc75135ad76469e1088d82246484894c39b887b89d073e6a837ae"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(legacy mangling): if this appears, should we enable \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":"compiler/rustc_middle/src/ty/print/pretty.rs"},"region":{"startLine":2001}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0a79cbca3ef6970f78b0c98a37c527a64d7271e4051fb67c58d9254334643c4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(addiesh): fix wrt late-bound stuff \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":"compiler/rustc_middle/src/ty/print/pretty.rs"},"region":{"startLine":2024}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4cc69898c72c59483854059b2d1978ee60fcae577af2b8c3252f0dc9d0e533a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(oli-obk): also pretty print arrays and other aggregate constants by reading \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":"compiler/rustc_middle/src/ty/print/pretty.rs"},"region":{"startLine":2028}}}],"partialFingerprints":{"codehealthFindingId/v1":"245b7c0693d1054463eb0266cb5a732f9fcc62788a39cca4bd582f4a49d6f439"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(oli-obk): also pretty print arrays and other aggregate constants by reading \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":"compiler/rustc_middle/src/mir/pretty.rs"},"region":{"startLine":2056}}}],"partialFingerprints":{"codehealthFindingId/v1":"6caab355e3c1e4309d97cce9cb6373ba1d0f56ad7220ffad98eadc63b5b547b7"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK(eddyb) boxed to avoid moving around a large struct by-value. \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/ty/print/pretty.rs"},"region":{"startLine":2103}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a43579053707c8e5d3db6200546f719821d90262a5ad98a3c945b210cf63324"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK(eddyb) copy of \u0060print_path_with_simple\u0060 to avoid \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/ty/print/pretty.rs"},"region":{"startLine":2296}}}],"partialFingerprints":{"codehealthFindingId/v1":"22ddd3753d0cbf0eff183e0b51431dd22f0ca9d4dee35015eb634f8321c28df0"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK(eddyb) limited to \u0060FmtPrinter\u0060 because of \u0060region_highlight_mode\u0060. \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/ty/print/pretty.rs"},"region":{"startLine":2672}}}],"partialFingerprints":{"codehealthFindingId/v1":"d423e7ad2ceb3f0b8e5ee94944fe9a2f681fbfdde447dee32e444fb500210e08"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK(eddyb) limited to \u0060FmtPrinter\u0060 because of \u0060binder_depth\u0060, \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/ty/print/pretty.rs"},"region":{"startLine":2811}}}],"partialFingerprints":{"codehealthFindingId/v1":"454aa044ea71855f52e22e20d5286f6347187bbd08e79cc75495efae3d12a5cd"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#155345): This should only encounter rigid aliases with the new solver."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/ty/inhabitedness/mod.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeed0671618ecc7ce02196ef93810a2681cd1e3e6a931f9efa839ab4462ee62d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We could perhaps add a \u0060skip: usize\u0060 to \u0060debug_assert_args_compatible\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":"compiler/rustc_middle/src/ty/context/impl_interner.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"263aeedf06931425f54d959d2dc554689dce50414109d5b1be70440ded746fb4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(mgca): Try not interning here. We already intern \u0060ty::Const\u0060 which \u0060ValTreeKind\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":"compiler/rustc_middle/src/ty/consts/valtree.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6eee46ab5ef1463a98dae7a492193f876f39ebbbb0a351b17dd3b8a8c25225b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(mgca): For method violations we just say \u0022method ...\u0022 but for assoc const ones we \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":"compiler/rustc_middle/src/traits/mod.rs"},"region":{"startLine":797}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce5c4d5423f7f47c371429a09a6dcab110cc8b1621ecff9b9f078c319cd12279"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Having to clone \u0060region_constraints\u0060 for folding feels bad 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":"compiler/rustc_middle/src/traits/solve.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ac845da982e6ab200d657d6eca62ab36a44f0b22d0a1b50e57939742efc3e41"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: \u0060ensure_ok\u0060\u0027s effects are subtle. Is this comment fully accurate? \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":"compiler/rustc_middle/src/query/calls.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d5d179844a27af022b820896cee3505b893b1a8de475aec5caaacd6a8d7824b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: This whole trait could potentially be replaced by \u0060T: Copy\u0060 and 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":"compiler/rustc_middle/src/query/erase.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"47ffd16bd6a1e5ed96bbe37af8eee7ca0c4d59dd98adf17a2ca10b4be974768a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(jchlands) Decide if to support Complex types in future. Clang has \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":"compiler/rustc_middle/src/ptrauth/discriminator.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2aacc9d8393941c3d9234699f23a7b90e365616a37a1033a9408540972ae788"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME(BoxyUwU): We should remove this \u0060Ty\u0060 and look up the type for params via \u0060ParamEnv\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":"compiler/rustc_middle/src/mir/consts.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"92ea92e4673a2cedc7a4f823c619dcd86c8265cd6539e66c3e39500e1495c203"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(generic_const_exprs): We shouldn\u0027t encounter placeholders 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":"compiler/rustc_middle/src/mir/consts.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdd321855525a6b84b05d9f0d18cd3d5eab0f75b3b52e20d49c555fdd0f25c8a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We might want to have a \u0060try_eval\u0060-like function on \u0060Unevaluated\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":"compiler/rustc_middle/src/mir/consts.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"1519979ea9800d8b241f3df5a584ab2af53c94c781b60e12bbda791a0689374e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(valtrees): Correctly print mir constants. \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":"compiler/rustc_middle/src/mir/consts.rs"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"064e8b699e156c8c609a847870f8e160d6200b5163c019cba6802950f5201c49"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#132279): what is this, why are we using an empty environment here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/mir/mod.rs"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"628cb47d038d5fee6f54b52bc333a529018e3c2df47462c877a01b1842863bbd"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME support this for \u0060enum\u0060s by either using DWARF\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":"compiler/rustc_middle/src/mir/mod.rs"},"region":{"startLine":1235}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae519dfd94153038e49fdb207bf26b2b8e8c5e1a9b8fb3b64571501f23e7597a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(oli-obk): we should be able to just walk the \u0060inlined_parent_scope\u0060, but 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":"compiler/rustc_middle/src/mir/mod.rs"},"region":{"startLine":1468}}}],"partialFingerprints":{"codehealthFindingId/v1":"9570c9b9e94cacffbffb7767a217bc5f0774f72392cc40f9a75503bfa838e2a6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: we don\u0027t actually want to print all of these, since some are printed nicely directly as values inline in MIR. \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":"compiler/rustc_middle/src/mir/pretty.rs"},"region":{"startLine":1601}}}],"partialFingerprints":{"codehealthFindingId/v1":"85afdf16c84499f238f8627456931225bd9ce6823807083b0b9f6ec6549d89fa"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Find a way to print \u0060frag.offset\u0060 that does not look terrible... \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":"compiler/rustc_middle/src/mir/pretty.rs"},"region":{"startLine":1869}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b19e50b1bb4f7684b6ccd8535bba9515b69b2ddd0d3c1f3eb86c1d33bb7cd05"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(-Zassumptions-on-binders): this is a temporary hack until we 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":"compiler/rustc_middle/src/mir/query.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"68f95a72e621866e5d66c4fac9edb64a633d893100f72595fd40629e7a767e76"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(-Zassumptions-on-binders): this is a temporary hack until we 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":"compiler/rustc_infer/src/infer/mod.rs"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"90357ca27058c2f23cf14368a2456405eb23d7a125411cc654897c6bf33a5c8e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(unsafe_binders): Rename \u0060handle_opaque_cast_and_subtype\u0060 to be more general. \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":"compiler/rustc_middle/src/mir/statement.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c4669bc39d4dc4d7d64ab6f95f8f3752c9a926f45ec7072ee91d2a99d948c43"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(unsafe_binders): Figure this out. \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":"compiler/rustc_middle/src/mir/statement.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b19912d72146eac6276b58c1480acf0eb8b064f235ed9a403e7833879b38ef8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME change this to a const fn by also making List::empty a const fn. \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":"compiler/rustc_middle/src/mir/statement.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa0fe022ca044b02320df91c3cafa168d6d5e4a47171908f7bdd5aa72b1e2aa8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: handle SIMD correctly \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":"compiler/rustc_middle/src/mir/statement.rs"},"region":{"startLine":913}}}],"partialFingerprints":{"codehealthFindingId/v1":"21948fb5bb2fbeddbae9c4de1a4da97276366689eb25eab474a1691ec3dbd179"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(explicit_tail_calls): should we have the span for \u0060become\u0060? is this span accurate? do we need 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":"compiler/rustc_middle/src/mir/syntax.rs"},"region":{"startLine":836}}}],"partialFingerprints":{"codehealthFindingId/v1":"d472924614e05b87fb105de0523c2d0170990338b5e89e0f112cb64b324400d2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME(reborrow): currently this variant is not considered an indirect place for whatever \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":"compiler/rustc_middle/src/mir/syntax.rs"},"region":{"startLine":1275}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf83d1ffcbb295df4cc43a57c351c0dda2def716d5a242fb77aa0fa03b97b8e5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME(reborrow): if the Reborrow traits experiment is rejected, this variant can be removed: \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":"compiler/rustc_middle/src/mir/syntax.rs"},"region":{"startLine":1278}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d9ecc5fd742141a55c3260e73e73aa41c4a6bffb55f5b909dae1a3982aa7a32"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// **FIXME**: Document exactly which \u0060CastKind\u0060s allow which types of casts. \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":"compiler/rustc_middle/src/mir/syntax.rs"},"region":{"startLine":1411}}}],"partialFingerprints":{"codehealthFindingId/v1":"c97e84f80795c44a5a54b880ce186b9756dec027db7eaac7cde428aabc172ed4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Maybe we need also TerminatorEdges::Trio for async drop \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":"compiler/rustc_middle/src/mir/terminator.rs"},"region":{"startLine":759}}}],"partialFingerprints":{"codehealthFindingId/v1":"05a6fea639e852eb53dce6681de3010011421b7f19e8582a62fc7279b8ddd5fb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(eddyb) use a better \u0060TyContext\u0060 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":"compiler/rustc_middle/src/mir/visit.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3484070e78bb1a667ffd31b1623a2ddb005f4972c7eba89666803e095507b31"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: do we need to distinguish shallow and deep fake borrows? In fact, do we need 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":"compiler/rustc_middle/src/mir/visit.rs"},"region":{"startLine":1316}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb8a3fab59fb8bf5d4330901ace75b97ce320d3cd4d6599d3625fe3d6ddb87ee"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME still use translatable diagnostics \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":"compiler/rustc_middle/src/mir/interpret/error.rs"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d7b6036a6951a6b378734d0081667060dadcac6279ddc1b4132324dae0f9f70"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: maybe have a separate version for resolving mir::UnevaluatedConst? \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":"compiler/rustc_middle/src/mir/interpret/queries.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"0487bd3bf83608933bf9a6b2d3825ef034db76ae7091fe6d26b17294ea42d31b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: make \u0022SymbolName\u003C\u0027tcx\u003E\u0022 \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":"compiler/rustc_middle/src/middle/codegen_fn_attrs.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7f550712d9035ab73a333bd023e6977f1961170272bd7932bb45a5e891f705b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: move this file to rustc_metadata::dependency_format, 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":"compiler/rustc_middle/src/middle/dependency_format.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"582ded402eef06f82204404121b167936d7eae88f5efcb47a9979299ae6e2a37"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: figure out why unordered visibilities occur 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":"compiler/rustc_middle/src/middle/privacy.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"aada80380fa71dc86e5d9e4164b9e3026867b238601b9407d2db9cf973634e5c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: figure out why unordered visibilities occur 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":"compiler/rustc_middle/src/middle/privacy.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"07b61d1aa7f65455ac704f22c1147ce58f23aad3c8aead3f5be17bf3b5cbe92c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: figure out why unordered visibilities occur 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":"compiler/rustc_middle/src/middle/privacy.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef7f5df7d30357d140b33b1fa8e02e414c35bb2523772edc2bf3ce1eb6afedef"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Share code with \u0060fn update\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":"compiler/rustc_middle/src/middle/privacy.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8d2a73b7fe66c3617569c8e8102be42e132c426ee5b2b0608aa65b8cf0b83ab"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(pnkfelix): this currently derives \u0060PartialOrd\u0060 and \u0060Ord\u0060 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":"compiler/rustc_middle/src/middle/region.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"f970dc06d75a6022e7d504c2bec3769930fad504c457c5b641f73536dd5d7498"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: /// HACK: This is used to recover the NodeId of an elided lifetime. \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/middle/resolve.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a7058bd0a7ff6e95d3b303befa5adbbb33caf157f43b2a329b23b1bb8e7f433"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This table contains ADTs reachable from macro 2.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":"compiler/rustc_middle/src/middle/resolve.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"9af103202995c2bcfc9817ef310bd14140553fd39eeb1fb32eb86023df8f7897"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(fn_delegation): replace with \u0060Result\u003CDefId, ErrorGuaranteed\u003E\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":"compiler/rustc_middle/src/middle/resolve.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b2eb146059c4dc3225da2961733f8c5d3d671165bd39ebcd60065c89445f582"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME(higher_ranked_auto): This could still just be true if there are only assumptions? \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":"compiler/rustc_middle/src/infer/canonical.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"955c932e69967755460596cf3db5ea9b746402febafbe93a09bcf803d4364a51"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Figure out how to remove \u0060visibilities_for_hashing\u0060 by hashing visibilities on \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":"compiler/rustc_middle/src/hir/map.rs"},"region":{"startLine":1286}}}],"partialFingerprints":{"codehealthFindingId/v1":"87ba9e4b2c82776f23ed96f1441e2e511ee319b3fa60b557e6e2fa943c8bf0f0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: This could perhaps return a \u0060WithDepNode\u0060 to ensure that 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":"compiler/rustc_middle/src/dep_graph/graph.rs"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d1295dd81562cd923e6b2f3fa96b358a5e096e6d0b61f84690e5a8b2f41d091"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: If the code is changed enough for this node to be marked before requiring 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":"compiler/rustc_middle/src/dep_graph/graph.rs"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffa757d7fa5b7716deedb0863260597a4e3428ad28e3c7a18ed0328ef7e0188c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(rylev): we hardcode the dep graph file name so we \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":"compiler/rustc_middle/src/dep_graph/serialized.rs"},"region":{"startLine":826}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ae76cc00ee6513593df5a096327727d0c75d1c8f403b6519340694f0d6c3b94"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: find a way of making the provided name always suitable for structured suggestions, 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":"compiler/rustc_metadata/src/creader.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4efe57c2fcfa02d2eb279e689ef6f0ceb052c5f7bf9d41d791738988b284820"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: This uses conditional despite actually being unconditional to ensure that \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_metadata/src/creader.rs"},"region":{"startLine":1149}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a9bd64ea9b6cc7bb39b70edf1b34182aed14f2e0338f0a09af3af10c8ec4f58"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(eddyb) maybe include the crate name in this? \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":"compiler/rustc_metadata/src/fs.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f5870b8f1596d42d7a771c8610dc69eb8a6ab4aa965a2df9cbafc2a6275cf87"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(bjorn3) this depends on the unstable slice memory layout \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":"compiler/rustc_metadata/src/host_dylib.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfdee63301d1d5ddf27f433bd33ae74299737584107bf4973699611152dc8acf"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This will need to be done either within the current compiler session 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":"compiler/rustc_metadata/src/locator.rs"},"region":{"startLine":852}}}],"partialFingerprints":{"codehealthFindingId/v1":"0917338a946d5f90f6bb42e28086f4d482f54f1782498e73c63db35f7d49afae"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This whole logic is questionable, whether modifiers 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":"compiler/rustc_metadata/src/native_libs.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ed77b0de144bf18902962077b0fc52ade4166a012f58624e9271fd88a60f752"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: Used only from queries and can use query cache, \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":"compiler/rustc_metadata/src/rmeta/decoder.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9db799974d7a23ca284ecaa54b86eb2e929270b90698df954769ff2a13951b4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: make type of the value \u0060LazyArray\u003C(DefIndex, Option\u003CSimplifiedType\u003E)\u003E\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":"compiler/rustc_metadata/src/rmeta/decoder.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"c50cd629e405ede7ab09ed5e374f8d712a7fef4549e5e1bf14d42059b8808785"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: make type of the value \u0060LazyArray\u003CDefIndex\u003E\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":"compiler/rustc_metadata/src/rmeta/decoder.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"68af0a4f55c6b1f5781a8e563a34e3e2728a7e8c8f4c16b4a36f3877965b4136"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This unwrap should never panic because we check that it won\u0027t when creating \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":"compiler/rustc_metadata/src/rmeta/decoder.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"d144b3ba36f69ab3b8e58b3f6f2b4750ab66f5d4cd2a2e1c0a7f3058de568956"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#43047) FIXME(#74731) We may eventually want to avoid relying on external"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_metadata/src/rmeta/encoder.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"81e157f7d4e7a0cdbee89e73de110de72ad246b600e5a4f9c22f663737c9a23e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(mgca): should we remove Const and AssocConst 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":"compiler/rustc_metadata/src/rmeta/encoder.rs"},"region":{"startLine":1421}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a2cc8216cd1be4f088ff8c8bea1ac582b6ed9c57b15593908094227ec80a9c1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(mgca): This probably isn\u0027t true, they probably are accessed, but, test case? \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":"compiler/rustc_metadata/src/rmeta/encoder.rs"},"region":{"startLine":1505}}}],"partialFingerprints":{"codehealthFindingId/v1":"86e4eb76ce6c29778ad46589ead180ea686396b84b7e753701e98f29d0530fda"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME only encode signature for ctor_def_id \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":"compiler/rustc_metadata/src/rmeta/encoder.rs"},"region":{"startLine":1826}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3d67a1d68f1bb7e8cbaaffe1784d55e4b4c01da631c7be09c236e535a6ada80"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(generic_const_exprs): this feels wrong to have in \u0060encode_mir\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":"compiler/rustc_metadata/src/rmeta/encoder.rs"},"region":{"startLine":1981}}}],"partialFingerprints":{"codehealthFindingId/v1":"37f8aa5779eded35aabcc19c50cd6ea433d283784e0560b0310aead659591a01"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME (#2166): This is not nearly enough to support correct versioning"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_metadata/src/rmeta/encoder.rs"},"region":{"startLine":2257}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdcd921552f356323eaee7b5f3fd7f566a01a8ea8832c72f8003a90662a85fbc"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Claiming that those kinds of QPaths are simple is probably not true if the Ty \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":"compiler/rustc_metadata/src/rmeta/encoder.rs"},"region":{"startLine":2929}}}],"partialFingerprints":{"codehealthFindingId/v1":"58e151f8253b2e342e154b4e0215464ba7d9b4ce055d2ac65fa1b5efdbd82c8f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This passes through \u0060-/*spacer*/0\u0060 verbatim. \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":"compiler/rustc_metadata/src/rmeta/encoder.rs"},"region":{"startLine":2945}}}],"partialFingerprints":{"codehealthFindingId/v1":"093b8d86f72b835400c4e871bba90df8ee0ad567e6a7310f0b1062acbdbcc8bd"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Omit the curly braces if the enclosing expression is an array literal \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":"compiler/rustc_metadata/src/rmeta/encoder.rs"},"region":{"startLine":2957}}}],"partialFingerprints":{"codehealthFindingId/v1":"95ade0416a84e642ef9aec28f42ecb1fbb67745fe516bd1d2ac1f59e8cd2eefb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(eddyb) perhaps compute this on the fly if cheap enough? \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":"compiler/rustc_metadata/src/rmeta/mod.rs"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"883ce26a580ea708c72def10dbf1d90afd39a3961af6b8c28aa942432eaceb05"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK(compiler-errors): This macro rule can only take a fake path, \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_metadata/src/rmeta/parameterized.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"47a697f9c663db6b4f912d46aa8e00237504c3f5de8bb8e973949c67da5d82bf"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: \u0060deduced_param_attrs\u0060 has some sketchy encoding settings, \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":"compiler/rustc_metadata/src/rmeta/decoder/cstore_impl.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"0042dc0198ab38e40256c9f4c0642cce0576fa6362690433b7380f78bed6c5b5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: to be replaced with externally_implementable_items below \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":"compiler/rustc_metadata/src/rmeta/decoder/cstore_impl.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"28dca0af07551dda9b30f257d5f99354c38e352ae31c1153cd037ca7c73f6f56"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: to be replaced with externally_implementable_items below \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":"compiler/rustc_metadata/src/rmeta/decoder/cstore_impl.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"22be8baf54dacf5e0fb22a00fa728dec5438432887539961647937471e2f7550"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: to be replaced with externally_implementable_items below \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":"compiler/rustc_metadata/src/rmeta/decoder/cstore_impl.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"673aa3f64c6da0c2abf892caae56f6bd78a2626983c410a43781dafc51f34d89"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: The Unord* APIs lack an efficient way of merging \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":"compiler/rustc_metadata/src/rmeta/decoder/cstore_impl.rs"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"9323062bc404948e30233f1890e6cebeb1254b23ea550c73686596b58ceed490"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#100717): support \u0060Option\u003CSpan\u003E\u0060 on \u0060primary_span\u0060 like in the"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_macros/src/diagnostics/subdiagnostic.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"1956979ead5547540f8d57855eef4888b3b34d65caefbda60977b826e8d168ef"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: \u0060--quote-paths\u0060 was added to llvm-config in LLVM 22, so this test (and all its ensuing \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":"compiler/rustc_llvm/build.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"05967f510aaf6bc29c378e5d5d535cca161ad0c10d5dcaf6e45a1da9faa86882"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // hack around this by replacing the host triple with the target and pray \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_llvm/build.rs"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c0b3ad082532613681a567f7343112cb2e14a0cef3c63b2c6c771b68f21dabe"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: /// hack across many more targets. \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_lint_defs/src/builtin.rs"},"region":{"startLine":3713}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1e681f448a99a0d3f3434242ccbe2361355cdbfc5d4e968aeb0f0fa53dfc76e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME(fmease): Write explainer. \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":"compiler/rustc_lint_defs/src/builtin.rs"},"region":{"startLine":4999}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfa1af8e493883a711d79b5a869ddb6462c06142bd08e793deacbb5b278b210c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(supertrait_item_shadowing): It is not decided if this should \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":"compiler/rustc_lint_defs/src/builtin.rs"},"region":{"startLine":5204}}}],"partialFingerprints":{"codehealthFindingId/v1":"99777f254075a1e441e852eeeb9561656792df1a6683652085cb763f11ab9b91"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(supertrait_item_shadowing): It is not decided if this should \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":"compiler/rustc_lint_defs/src/builtin.rs"},"region":{"startLine":5243}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3066187811355b17170d8c4f8d9cb36a6abf7991ea3a2e6166dfe932cbf48eb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(estebank): this needs to be changed to go through the translation machinery. \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":"compiler/rustc_lint_defs/src/lib.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a5886876044d9a717b19bd3b2b5258c2b636f1d1e2102f66ee8d9371f2b9e83"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const-hack): This is used so that \u0060declare_lint\u0060 can declare an MSRV statically. \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":"compiler/rustc_lint_defs/src/lib.rs"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f60551d42baf37c0d31c624892407a177c7ea7facc96f49cf69c3bec100d361"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(generic_const_exprs): \u0060ConstEvaluatable\u0060 can be written \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":"compiler/rustc_lint/src/builtin.rs"},"region":{"startLine":1430}}}],"partialFingerprints":{"codehealthFindingId/v1":"15c4b5994a103028584613d67580256ea34078e082a57cc184318268a89271dd"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME we can also infer bounds on associated 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":"compiler/rustc_lint/src/builtin.rs"},"region":{"startLine":2031}}}],"partialFingerprints":{"codehealthFindingId/v1":"6517c41ac5ea6c112a06272980ddb08719e3f987cbf4fea038a06d82e8ea3a16"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: rustc and rustdoc are considered tools for lints, but not for attributes. \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":"compiler/rustc_lint/src/context.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"c573e7fae4b4c29c602fa5ffa1eba3caff63e61ee68c8e85f23815c834a805f1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: should this handle tools that never register a lint, like rustfmt? \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":"compiler/rustc_lint/src/context.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"c576c785e00fd01b5eeb6fb35e69a1c462fad4394813ed2e1b2cff3811572bff"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: These methods should not take an Into\u003CMultiSpan\u003E -- instead, callers should need 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":"compiler/rustc_lint/src/context.rs"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"5384bfa628299f14a4e04fd683ac4fdc6ad2da5e81faa281469c73ab21e36b7f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: It would be great if this could be optimized. \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":"compiler/rustc_lint/src/context.rs"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"42d9f51f51f9926ed61f48cc9ae7dd22a3ca2e09a2989ce84e492915c61d6102"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(mgca): figure out how to handle ConstArgKind::Path (or don\u0027t but add warning in docs 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":"compiler/rustc_lint/src/context.rs"},"region":{"startLine":896}}}],"partialFingerprints":{"codehealthFindingId/v1":"87dc66a7e88eee16c185444c507cf567fa9b3c8534ff6f3b7a7e1301d5e019b7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: false negatives (i.e. the lint is not emitted when it should be) \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":"compiler/rustc_lint/src/dangling.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"37514d4a215ac5a08a35e51f88298c1eacb86fdd6360ba54c5b823bbb7266103"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: these should probably recurse and typecheck along the way. \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":"compiler/rustc_lint/src/dangling.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"d753200222c1b19b1ae523a7f32379df00664c9cc1799793bef1dd0425af144b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this has false negatives, but I do not want to deal with \u0027static/const promotion just yet. \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":"compiler/rustc_lint/src/dangling.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"e33e1d9f9f580ced87babfcdc6b3e3614691fa623d288ff228fde1baf445e7ca"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: evaluate bodies with statements and evaluate bindings to see if they would be \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":"compiler/rustc_lint/src/default_could_be_derived.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac90ab7ef420dad4e6170a83b8380faee07427a586848ee44c7526f3a0181781"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //     field\u0027s default value (FIXME: not done). \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":"compiler/rustc_lint/src/default_could_be_derived.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"160376152d725dfd6619c72613ebce0a03173a92986d6e42ddd937fdf8316302"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(davidtwco): make translatable \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":"compiler/rustc_lint/src/diagnostics.rs"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1cc97774b0f36d61de15975cfe6024d0b4cde2a3f70df9110bc04406aefcff6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(davidtwco): translatable expected/found \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":"compiler/rustc_lint/src/diagnostics.rs"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3683b8e1bf0c85e189a4f30556440c3b9d8cb51dd659735ea3444dd1e22666c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: put #[primary_span] on \u0060ptr_span\u0060 once it does not cause conflicts \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":"compiler/rustc_lint/src/diagnostics.rs"},"region":{"startLine":1546}}}],"partialFingerprints":{"codehealthFindingId/v1":"f13931b4a8094b5bb6fda3f91afa9bf830391e9c3e277e4117ab56e65f05dcd2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#53934): make machine-applicable again"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_lint/src/diagnostics.rs"},"region":{"startLine":2381}}}],"partialFingerprints":{"codehealthFindingId/v1":"b87755dca805d835c586b095945e5634ed338d852fde8109e297a07b3d57ad24"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#53934): make machine-applicable again"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_lint/src/diagnostics.rs"},"region":{"startLine":2403}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f65dec0d320e7472ab692601ae757c21649ce6ba87f2c16b7ac5353c69f2d28"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#53934): make machine-applicable again"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_lint/src/diagnostics.rs"},"region":{"startLine":2425}}}],"partialFingerprints":{"codehealthFindingId/v1":"cef01066310231b9d264282dddf617224a3c2b7c7bc7ac541b55c61e4b68ec66"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#53934): make machine-applicable again"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_lint/src/diagnostics.rs"},"region":{"startLine":2449}}}],"partialFingerprints":{"codehealthFindingId/v1":"879bf2d4aa4abb93b957d68b15dfd4b195197c5903e46b1a940e321b8ba7e22d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#127436): Adjust once resolved"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_lint/src/diagnostics.rs"},"region":{"startLine":2455}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bc9269157686e18c1a1387625cf1c0b7247bb301aba957b932e7ca5dd515496"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(davidtwco): this isn\u0027t properly translatable because of 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":"compiler/rustc_lint/src/diagnostics.rs"},"region":{"startLine":2650}}}],"partialFingerprints":{"codehealthFindingId/v1":"eec35b7ad4ed9cd141dd44433cf3430b1396e5d11c13751ee584683e63a5efc9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(davidtwco): this isn\u0027t properly translatable because of 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":"compiler/rustc_lint/src/diagnostics.rs"},"region":{"startLine":2666}}}],"partialFingerprints":{"codehealthFindingId/v1":"90aea09bad926abe42ec3e02c67beb556dcce0f55a493eaaf37c23d18776ff99"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(davidtwco): this isn\u0027t properly translatable because of the pre/post \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":"compiler/rustc_lint/src/diagnostics.rs"},"region":{"startLine":2682}}}],"partialFingerprints":{"codehealthFindingId/v1":"faf4ddde9d0e0ed9986b92a735f6f3a4a61304d5a028708652dcb50cd04a5aa4"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // hack to get a label on the whole span, must match the emitted span \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_lint/src/diagnostics.rs"},"region":{"startLine":2877}}}],"partialFingerprints":{"codehealthFindingId/v1":"d755a67631d1b0923a0886ce826847211d1791c9e2d93177d3654de8f66ab520"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Technically, we could just store a \u0026\u0027tcx str here without issue; however, 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":"compiler/rustc_lint/src/foreign_modules.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"e38e2c28c169de20fa054d080e624d2b5b3971d5d57f9726a136d907e3f7d0ae"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME if symbol_name is not set, this is likely a #[rustc_std_internal_symbol] or EII which \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":"compiler/rustc_lint/src/foreign_modules.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4cb37149eaa56c3a0690fd210bf8a006576caf3a6f5229f6867ec519b83a6bb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Instead of searching through the attributes again to get span \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":"compiler/rustc_lint/src/foreign_modules.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bc6b6ace71d39b0247d5cd0c965f50fb18a12598db6b2cc7ff987cbb2793304"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(splat): Is splatting ever repr(C)? \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":"compiler/rustc_lint/src/foreign_modules.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"00b1e1627551baae1da5add12d8b21edadc2fc24632f4bac65b0c467521ef499"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#101728): change this when type ascription syntax is stabilized again"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_lint/src/if_let_rescope.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa82a18e17631f7e1843e80852dd5dc1b8dc48bcb99b45facf93fc6f2ebfb9a6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This may have false positives if we move the part \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":"compiler/rustc_lint/src/if_let_rescope.rs"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ba062d8c154c10f6c623676a84e3adbe2435f29f8eab3891196cafab631d10e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#102522) Just iterate on attrs once that iteration order matches HIR\u0027s."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_lint/src/levels.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"9776d38209c1069961474e079b8b16a16bdce11453ef3d76b75aa78319f0be6f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: just allow everything? \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":"compiler/rustc_lint/src/levels.rs"},"region":{"startLine":694}}}],"partialFingerprints":{"codehealthFindingId/v1":"93ec1401be5cb6e322ae42017d780f5083fa71b6a16b376a94f634c80457128a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: consider performing these checks in attribute parsing 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":"compiler/rustc_lint/src/levels.rs"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"e58065005a77bc1fd5a083708ebdb3aca2be3fad74f48e9f0b0b14c17efed32e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#52665, #47816) not always applicable and not all"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_lint/src/lib.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"741db8faac3dca16f6bef2f8600887c25bb25d8fecb2593c77e849439fdf5a4d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME macro crates are not up for this yet, 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":"compiler/rustc_lint/src/lib.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"99e55e3a12185da54671729c3c4823199535eb9db7520a64062d811ee9518575"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Ideally, we\u0027d also remove the lifetime declaration. \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":"compiler/rustc_lint/src/lifetime_syntax.rs"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"1db1c7023d0fefbea1691df6854585aab9ad86c43e0a66d2b915b683fbd67fd2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(Urgau): Figure out how to handle modules nested in bodies. \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":"compiler/rustc_lint/src/non_local_def.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"79f34a2981a926c9a6ed1aee806ec2f67a47922fcac8634794f38b636b4aae30"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: we should add a more efficient version \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":"compiler/rustc_lint/src/nonstandard_style.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb274c7fefea3df1e30e66bc1ccab29d50feadc5be7ad7981cc51801784c22dd"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this doesn\u0027t respect \u0060#[allow(..)]\u0060 on the item itself. \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":"compiler/rustc_lint/src/nonstandard_style.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed1adf2637386357a2ab9427d1e14153b92083ea5c4c2b485e238e32559b729c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: we should add a standard library impl of \u0060c.to_lowercase().eq([c])\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":"compiler/rustc_lint/src/nonstandard_style.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"36445aab364ed6744d46e04dc14861acf01077b11e6cafd4817a0318a352d897"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: we should add a more efficient version \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":"compiler/rustc_lint/src/nonstandard_style.rs"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa8a3f4a0e9e414b7fd462fb82ea525e412d300bdf89a895020ed2cb5290c28a"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: \u0060impl Trait\u003CAssoc = impl Trait2\u003E\u0060 from an RPIT is \u0022ok\u0022... \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_lint/src/opaque_hidden_inferred_bound.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"e514643deb9cfb199b8e261a98bfbbe173e44806d697b019b31dfbfad3b433f9"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: \u0060async fn() -\u003E Self\u0060 in traits is \u0022ok\u0022... \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_lint/src/opaque_hidden_inferred_bound.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"e47c2cf7146ac2f9ef30f5ab905a5bc6e194b38e1eafd1fed3ea546e97bbe5fd"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: eliminate the duplication with \u0060Visitor\u0060. But this 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":"compiler/rustc_lint/src/passes.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d069b8412d367343d248f2fc2beede63398474f1a12157bbe54b15192de4918"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This should eventually be \u0060Warn\u0060, see the \u0022Explanation\u0022 above. \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":"compiler/rustc_lint/src/raw_borrows_via_references.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"46d01dfd96d7a6e5d3849207806d76c73489f9ebf62a640937c6fbb306536d00"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: How to handle unsafe binders? \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":"compiler/rustc_lint/src/reference_casting.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"8967854f04a40c8c916f42cd51e3da72939d71bb7fb97863012830f7b76ccf91"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This builds suggestion spans by handcrafting from source text. \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":"compiler/rustc_lint/src/static_mut_refs.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"78ae3f394039dc4a7c2065e05e0c4e6bb952aadd7460b1f6a63e213770ff753f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Consider arg expr\u0027s precedence to avoid parentheses. \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":"compiler/rustc_lint/src/transmute.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"13f16e8c58973eb77b59fdf41245e242cffe1a7a4630a44928f102a97217b6ce"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const_traits): Remove this when \u0060From::from\u0060 is constified. \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":"compiler/rustc_lint/src/transmute.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e479f178e5a02c0a4f9aa41c3a4a273fd3bb6d99c6a7c876a1f3046ca9a79b1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// \u003C!-- FIXME(checked_type_aliases): Write an explainer. --\u003E \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":"compiler/rustc_lint/src/unmarked_unchecked_type_aliases.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"15e341e9407d3c052281115851f48b35984d4691329197ddee1d094c84b6068e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(checked_type_aliases): The generated URL obviously points to nothing which is fine \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":"compiler/rustc_lint/src/unmarked_unchecked_type_aliases.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"1768c34668771dd123815f83baf3dee87dec355b6e2da7ff1b7f429d4d4c206c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(checked_type_aliases): Employ a lot more sophisticated checks to figure out if 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":"compiler/rustc_lint/src/unmarked_unchecked_type_aliases.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbe3d3f69f5ec5eb2a7bf69cc2ed4da666a9145f514a33f32e32aee965696356"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: https://github.com/rust-lang/rust/issues/119426"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_lint/src/unused.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"5de5fe64976da44f21ab51f1a7a470799330e03ef3cc4c36936bafbdd2a58b4e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(pin_ergonomics): Remove this gate once pinned patterns are stable. \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":"compiler/rustc_lint/src/unused.rs"},"region":{"startLine":785}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae1edb6519a77e9be1ba4d37f915fd51e00081f8f8a1d65111a3e2adae9277c4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(pin_ergonomics): Remove this gate once pinned patterns are stable. \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":"compiler/rustc_lint/src/unused.rs"},"region":{"startLine":943}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f6734708210dd9873f953eda77c9f72b5e76904ee23f2629667d37cd9baaf74"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const_generics): handle paths when #67075 is fixed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_lint/src/unused.rs"},"region":{"startLine":1206}}}],"partialFingerprints":{"codehealthFindingId/v1":"1de7cfd1df64824e642faebc3fd20d2e0d895ce19c9a3722abb15d5b73c518ae"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// (FIXME?) \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":"compiler/rustc_lint/src/types/improper_ctypes.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"097ea55ee3069b79d1688d1beccc29d66bfe2e030a9198cb9389a443b8f07b8a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(ctypes): this logic is broken, but it still fits the current 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":"compiler/rustc_lint/src/types/improper_ctypes.rs"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9adb3f8b3c4c5ee8da9c61ea3b9fa115907de62af670a1eab847489b2d90fc5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#60405): confirm that this makes sense for unions once #60405 / RFC2645 stabilises"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_lint/src/types/improper_ctypes.rs"},"region":{"startLine":694}}}],"partialFingerprints":{"codehealthFindingId/v1":"b83e11d24cf2aeed0cf9a03f4aa80c02fb1d0b26cd6a751e6cf6c9a414807640"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(ctypes): VVV-this-VVV shouldn\u0027t make a difference between ::None and ::NoneThroughFnPtr \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":"compiler/rustc_lint/src/types/improper_ctypes.rs"},"region":{"startLine":900}}}],"partialFingerprints":{"codehealthFindingId/v1":"f627b20bee1dafa99c2d5dbab5abab29adc1fd84500d5eb8c4d71cebd8e3218a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(ctypes): make a check_for_fnptr \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":"compiler/rustc_lint/src/types/improper_ctypes.rs"},"region":{"startLine":1108}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a5292caf7998ea1b41d368fe73f2ed4a8f86026e1d8a2521add18f7b795de39"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(ctypes): this following call is awkward. \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":"compiler/rustc_lint/src/types/improper_ctypes.rs"},"region":{"startLine":1149}}}],"partialFingerprints":{"codehealthFindingId/v1":"3189ef20208c94940e473cceb3a699559dee169950cb0a652d7442b55e724465"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(@Jules-Bertholet): This test doesn\u0027t work due to what I believe \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":"compiler/rustc_lint/src/nonstandard_style/tests.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"40b38842c2599a808b1738989d813d11720e723de12822a219ac48fcece35722"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this should be renamed to \u0060invalid\u0060 as it also signals 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":"compiler/rustc_lexer/src/lib.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a570eb412d3a4dba7cdbd769db8b6cfeb43da9706cdea9ed1ccf363e777f4ec"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#160895): We don\u0027t test this when the next-solver is enabled by default."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_interface/src/tests.rs"},"region":{"startLine":864}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c6ba08a85251c488c0fff4c1397d4e1326fca5bfba3a0d98f891a6e059f02c8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: we could accept \u0060RUST_MIN_STACK=64MB\u0060, perhaps? \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":"compiler/rustc_interface/src/util.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"21d8817b106f6a016b1cb8cc440064680395267e1d057532261fbb7bd876a28b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: use a generic filter for \u0060pending_obligations_potentially_referencing_sub_root\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":"compiler/rustc_infer/src/traits/engine.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ff85dc782f49756750d63a53cdd30586133890eb189cecf0f01d3728d1f8bba"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: we shouldn\u0027t ignore the cause but instead change the affected visitors \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":"compiler/rustc_infer/src/traits/mod.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"96374957ef57c76e3d85ea28ccce04e81e455dec785b28aa748a31dd1e2e1881"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: we probably also want some sort of cross-infcx cache here 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":"compiler/rustc_infer/src/traits/project.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"10b4d658e554ddd2d0ce74feb2c52749e9aaed7d48ee9745c213ddcaa1a210ce"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: To be removed in favor of the [\u0060InferCtxt::eq_raw\u0060] method 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":"compiler/rustc_infer/src/infer/at.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"817d23a6201ab12bdb117c579a81bd4a1017df0ca3f3cca91bfd00fd384632d4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: To be removed in favor of the [\u0060InferCtxt::eq_trace_raw\u0060] method 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":"compiler/rustc_infer/src/infer/at.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f56744f58c7aa84e1af563c106c4607bdfd137f2102410e2907d1ac8ce97315"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: To be removed in favor of the [\u0060InferCtxt::relate_raw\u0060] method 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":"compiler/rustc_infer/src/infer/at.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"c39e1fd00ccd9debfe9b9222ea3f3fe968610333caec2009cc79adc70c4f0276"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: To be removed in favor of the [\u0060InferCtxt::lub_raw\u0060] method 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":"compiler/rustc_infer/src/infer/at.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"574cf82be6f0837df7300161f8922fee148fc35c7cdd7066d8c7e0c4cbdf224e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: To be removed in favor of the [\u0060InferCtxt::goals_to_obligations\u0060] method 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":"compiler/rustc_infer/src/infer/at.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"15a2871a86eb1ef49f94e2c9b73c91d605973e4c886c4a24d1d1625e941a1d49"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: unfortunately we lose the relating span here unless we take another \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":"compiler/rustc_infer/src/infer/context.rs"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"7602216761a92fc554fad760799fe9cf4d2627b7206d3ce8d57d3abc11ecc302"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(-Zassumptions-on-binders): This and \u0060universe\u0060 should probably be \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":"compiler/rustc_infer/src/infer/mod.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"1378c5b5709bebbb5081d4b843b0f16798d4311b2a6471cc6bcb9c52174c14d9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME(@lcnr): This should also store a \u0060DefId\u0060, similar 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":"compiler/rustc_infer/src/infer/mod.rs"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"a62af125e1916af7fe788a0c74eff5f63bc1fe7de485f7f1bd43ee390504c21f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We should store origins separately from the unification table \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":"compiler/rustc_infer/src/infer/mod.rs"},"region":{"startLine":771}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cc33a7ee7d9159e759523fe08105493f7c553f49120a9bad406999677478fba"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#132279): This function is quite weird in post-analysis"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_infer/src/infer/mod.rs"},"region":{"startLine":1193}}}],"partialFingerprints":{"codehealthFindingId/v1":"dae05eb6dc787d35d1b3499e1b08b0f3b808a69288f8b3f575a8d5ffa106feea"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#132279): This erases the \u0060defining_opaque_types\u0060 as it isn\u0027t possible"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_infer/src/infer/mod.rs"},"region":{"startLine":1675}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f0829a120e5f6c0ad4ec86c44041c925fe9a7f3c08bd4876c01c404c1c933b7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(generic_const_exprs): Occurs check failures for alias consts \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":"compiler/rustc_infer/src/infer/relate/generalize.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"e851d0be61b0a0ab334cb6db47c5d03dfa9686a4266226dc3eb8b2ebbc678b1c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This does not handle subtyping correctly, we could \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":"compiler/rustc_infer/src/infer/relate/generalize.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"08f92442f3244b7018e8ec92c24ea5f0f8ae5b1755c765254615a5ddf5ab200f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Alias consts are also not rigid, so the current \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":"compiler/rustc_infer/src/infer/relate/generalize.rs"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f574ed2a7107c8f9cf8149d47ebe4138e0e8061042cdec22882ccd3879cef61"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: replace the \u0060else\u0060 branch 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":"compiler/rustc_infer/src/infer/relate/generalize.rs"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b86889369749db62df90b5ff87f8bea5e5d79f3bf25baab6f5eab9b4f1f8b01"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // Hack: Fall back to old behavior if GCE is enabled (it used to just be the Yes \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_infer/src/infer/relate/generalize.rs"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"834cdac92a699b669feab7a56b58847600084ca88d82c15a260e95c3025f68a0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(-Zassumptions-on-binders): Handle solver_data here and elsewhere in this fn \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":"compiler/rustc_infer/src/infer/region_constraints/leak_check.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9e311393253a8b2122c8b0d0cd2428e9c42292e6083bb4d4091a39c0c608b71"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(-Zassumptions-on-binders): we probably need to handle this in some manner \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":"compiler/rustc_infer/src/infer/region_constraints/leak_check.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"9733e02f2787a2716f0b76ee1aa80d0d10b2fd3bdeed5b6f16374e27515e2cae"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(-Zassumptions-on-binders): We should merge \u0060solver_data\u0060 and \u0060legacy_data\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":"compiler/rustc_infer/src/infer/region_constraints/mod.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"badf93f53e337a999c6d94affc79fdb933a6a867edfd2874d4fb9b50fbc7d1fc"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: we expect this alias to be rigid in the next solver. \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":"compiler/rustc_infer/src/infer/region_constraints/mod.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"ded8a008fb65b4975265aee3a0b35bdcd429177b495c5509818409f1bba4c96d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(-Zassumptions-on-binders): This is pretty bad for perf, we don\u0027t make incremental \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":"compiler/rustc_infer/src/infer/region_constraints/mod.rs"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ce38b9ec0d1870dab153e08eed1fcc4325c2ab6b96724d3e2b8c0598379d647"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We could only emit constraints if \u0060unify_var_{var, value}\u0060 fails 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":"compiler/rustc_infer/src/infer/region_constraints/mod.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeb674e4e6a5ccbaaab3dca6fa455a6ccdf3a5d36e99fb7f8b25559fafef91ed"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: Your first reaction may be that this is a bit strange. \u0060RegionBoundPairs\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":"compiler/rustc_infer/src/infer/outlives/env.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"c91a1be64ad866735a2fcf84893d780fe50e0a07d36216d927c82f0de9d069fa"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#109628): We shouldn\u0027t have existential variables in implied bounds."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_infer/src/infer/outlives/env.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd7a598d21331d41feec74b5ec8978a609ad7aea2d205264ddd1ae3352e7ae9b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(-Zassumptions-in-binders): Handle solver_data \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":"compiler/rustc_infer/src/infer/outlives/mod.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"a74be33c9cf15500c9ac1e0911387fae76105ff75f2be6a00b6f12ef6b9868f3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(-Zassumptions-on-binders): actually implement OR as an  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":"compiler/rustc_infer/src/infer/outlives/obligations.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad74029f2403ca9595e5e7db45321bc048ced9c0b2aad5726a7d8ff4a635d5cd"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(@lcnr): This is weird. We are ignoring the ambient variance \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":"compiler/rustc_infer/src/infer/outlives/test_type_match.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ec6f638d31df146c04a49f3266086175a81c93d5e57df34911a153b20cef082"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(non_lifetime_binders): 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":"compiler/rustc_infer/src/infer/outlives/test_type_match.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d06c9dba799a627e9e67319ed3a799f2c9647a4f2a302149b9841ccc0e0ebe8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#155345): We probably want to assert the alias is rigid here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_infer/src/infer/outlives/verify.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"c828a7dbc09d213fced0a0d0a130aad69d692c75cddbfc5d358c6ffbf20b176d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(RPITIT): Don\u0027t replace RPITITs with inference vars. \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":"compiler/rustc_infer/src/infer/opaque_types/mod.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c28bbe5924bff1b6b92de0b7130b96769980ff6519c751d5ecb084d6e6dc6e2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We should merge this loop with the above one eventually. \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":"compiler/rustc_infer/src/infer/lexical_region_resolve/indexed_edges.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dd946f80d166cd9a86414fa731f62882183bc835a0604fb62cb70d4263b7022"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#118965): We don\u0027t canonicalize the static lifetimes that appear in the"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_infer/src/infer/canonical/canonicalizer.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bf359e42e04a341ecb397937af685bda0a03aa1d65106e9fc0d66bd65fdcfc5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(higher_ranked_auto): Optimize this to instantiate all assumptions \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":"compiler/rustc_infer/src/infer/canonical/query_response.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b269af6faef8a2fe9a18c07928759a3a8c315cae19049eaaca77c3e1ddff5ee"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // cfg(bootstrap) FIXME: remove on bump \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":"compiler/rustc_index_macros/src/lib.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"315915004bd8387c0fda67cd0f8e94d9647b9bef1df1aab4af03e3779fc23404"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(Zalathar): If we were to forcibly _set_ all excess bits 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":"compiler/rustc_index/src/bit_set.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7331aaa21e575001f29a6163d4b12b9981b2bb4ce8fa66881996583cda6735b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(eddyb) build a better abstraction for permutations, if possible. \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":"compiler/rustc_index/src/slice.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"1da23961f856718b1f5add14e9547f5c6d16394b901e5722558f62116e0db4cd"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(eddyb) build a better abstraction for permutations, if possible. \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":"compiler/rustc_abi/src/lib.rs"},"region":{"startLine":1720}}}],"partialFingerprints":{"codehealthFindingId/v1":"a194919cfa98c9cb83078b7d1001a90b0573dd2d0b85fbfaded6afa0d2e5c11f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(eddyb) build a better abstraction for permutations, if possible. \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":"compiler/rustc_abi/src/layout/coroutine.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"c47245596bf7388cf77bc8a7c8aef3766619ac1ea68414bc2c754ae5b79e0df4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Struct/Enum/Unions Fields (there is currently no way to attach these) \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":"compiler/rustc_incremental/src/persist/clean.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c65f4ba52c2e5cf8a4f7a425bf00d772526a1eed4534705de5e175ec0d05a81"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(michaelwoerister): do commented out 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":"compiler/rustc_incremental/src/persist/clean.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f74017ec7a77a3d7c26ead88a3d96a059fc19c331a2a0d6a8912374692c6fa0"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // Hack: canonicalize the path *after creating the directory* \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_incremental/src/persist/fs.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf9a71941bb41b2869d335a7fa4f1c14134cb257417cd42d97931419defd641f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(Zalathar): This step is intended to be cheap, but still does \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":"compiler/rustc_incremental/src/persist/save.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"417b0b748c9309a23d47378638608a99c15bd5164b2ac3f0b671ad8c2ba01c23"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: If this is the first arm and the pattern is irrefutable, \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":"compiler/rustc_hir_typeck/src/_match.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"7013ad56ba2043aeba21c724109a8916b08a0db0f65459ad89d671e4bb11decc"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Could also check that the RPIT is not defined \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":"compiler/rustc_hir_typeck/src/_match.rs"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"8324f80c516c51896a3d5a7fc6980295ecd43cef1201f8954f597656fc1f40f3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(-Znext-solver=no): Remove this branch once \u0060replace_opaque_types_with_infer\u0060 is gone. \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":"compiler/rustc_hir_typeck/src/_match.rs"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"fae5e400d2164d134ad3a44309805a085c2be11826d8bcd4324a3b6a3a5ed212"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: we should assert the sig is \u0026T here... there\u0027s no reason for this to be fallible. \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":"compiler/rustc_hir_typeck/src/autoderef.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"08452e0a8acbc00d59e9e084f957633c6389e964fb86c1dae345a3b143de0b4f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This needs to happen in a \u0060probe\u0060 as the \u0060sup\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":"compiler/rustc_hir_typeck/src/callee.rs"},"region":{"startLine":747}}}],"partialFingerprints":{"codehealthFindingId/v1":"e17d3b982f490e0c60487036720e404a462ed297a95d7ec45cae0110ef873b54"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(fn_delegation): maybe useless adjustments can be optimized away 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":"compiler/rustc_hir_typeck/src/callee.rs"},"region":{"startLine":797}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6421b60db9e3a739520964c81164dc2d53b66f91441a34f86a4b3c1e6e5680f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const_trait_impl): We should be enforcing these effects unconditionally. \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":"compiler/rustc_hir_typeck/src/callee.rs"},"region":{"startLine":1159}}}],"partialFingerprints":{"codehealthFindingId/v1":"15e2ec3387cad7a95c4de75c15fa0177eef1dc0f0c5976287bf3e579c1797a9f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const_trait_impl): Should this be \u0060is_const_fn_raw\u0060? It depends on if we move \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":"compiler/rustc_hir_typeck/src/callee.rs"},"region":{"startLine":1180}}}],"partialFingerprints":{"codehealthFindingId/v1":"c97091dd9347cc8aecb9fc106d14c608eaa3221ce6295a619c61a333175c2f30"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const_trait_impl): This should eventually be caught 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":"compiler/rustc_hir_typeck/src/callee.rs"},"region":{"startLine":1203}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccc90f286d049ed5e2f4631522bb9622ce449af2458232468ef6b87b1f6e9a8c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(splat): if we ever support splatting here, decrement the splatted index, because \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":"compiler/rustc_hir_typeck/src/callee.rs"},"region":{"startLine":1215}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebf5209509cc75800d3adccd801fe87deb007a0e47633d01ce073431ce37cd98"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#95489): there should eventually be a lint for these casts"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/cast.rs"},"region":{"startLine":1026}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cb200536e5a8347c0a21a52f5dc295461fea88848f4984be203ed64610566db"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK(oli-obk, compiler-errors): We should be comparing this against \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/check.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0790dcaf04127b463e51a6f8a8d17cb8ca1aee0f6555bf1ce8a1cb392196992"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: make the lang item generic checks check for the right generic *kind* \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":"compiler/rustc_hir_typeck/src/check.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae5853a5c23734604f1bca6da4f021335d8b1127918b9479a3aa4ca98d17fe2d"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK(-Ztrait-solver=next): In the *old* trait solver, we must eagerly \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/closure.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f2f649eb611d3c87d4029c90abaf93f61693fb8fc858c8a120719e397b7c69c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(iter_macro): Someday we\u0027ll probably want iterator closures instead of \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":"compiler/rustc_hir_typeck/src/closure.rs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c169dc6af661bfec3c56a4aa24e06789b1918be28da88af7cb89a13c3ecbbca"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(non_lifetime_binders): provide better diagnostics. Should non-lifetime binders \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":"compiler/rustc_hir_typeck/src/closure.rs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfb5f18dde2d46f02fd1f9dbe87f601e6cbb082152600cfb06f79d2093d697a3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(non_lifetime_binders): provide better diagnostics. Should non-lifetime binders \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":"compiler/rustc_hir_typeck/src/closure.rs"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"a262554dc5096f5f1fd6fb2f81d2dd58656ef92153333f86fa6dd581342f5194"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(non_lifetime_binders): provide better diagnostics. Should non-lifetime binders \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":"compiler/rustc_hir_typeck/src/closure.rs"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"970f8e9a382bcac0bbb789d09071d4df940473ccfdf4604f6846b68e69b12e1d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: We may want to change type relations to always leak-check \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":"compiler/rustc_hir_typeck/src/coercion.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"63ec8e2e14065a5b65a885ddfa369f765812749877477a11f5ca715a8dd00193"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(BoxyUwU): we should always emit reborrow coercions \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":"compiler/rustc_hir_typeck/src/coercion.rs"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"b09c965e37e82bdcfec9bf5e06a543372bd1510bb7e563c2b2767dfdf1f0acb3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: CoerceShared check goes here, error for now \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":"compiler/rustc_hir_typeck/src/coercion.rs"},"region":{"startLine":1005}}}],"partialFingerprints":{"codehealthFindingId/v1":"484b767b4444cbba24d5d751d2948a1b6939b941002d86f48704e68996515483"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: Ideally we\u0027d compute the final type without unnecessarily constraining \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":"compiler/rustc_hir_typeck/src/coercion.rs"},"region":{"startLine":1614}}}],"partialFingerprints":{"codehealthFindingId/v1":"da70d7b9599b5f74b891682b2778764a6425f573edf5c57395ad9aa71fcbd06b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(splat): when the arg is splatted, adjust its index, to handle the type mismatch properly \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":"compiler/rustc_hir_typeck/src/demand.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0722972f464d3d735729abeb73685cdb2e987744bb8bee607b97476d6735610"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(splat): when the arg is splatted, adjust its index, to handle the type mismatch properly \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":"compiler/rustc_hir_typeck/src/fn_ctxt/checks.rs"},"region":{"startLine":1800}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf777a5cbb9ac4d1186c34d42389f774152b2184dd050d8d59f79c9a9a7fbd66"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK(compiler-errors): We don\u0027t actually consider the implications \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/demand.rs"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"8586652a61e6a018c6419d97645d32af68ccee4c5bcdd3e5cdee6994ec1dd516"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME (#46459 and #46460): ideally"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/demand.rs"},"region":{"startLine":1143}}}],"partialFingerprints":{"codehealthFindingId/v1":"009576a59776a1db263c0fd89a701a169531eb44fafdc59e31857b711e6f3cdb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME? Other potential candidate methods: \u0060as_ref\u0060 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":"compiler/rustc_hir_typeck/src/demand.rs"},"region":{"startLine":1148}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a8cccc2fc07a001b473c7372b9817a9ef08a65ed8d9f77b32228a39d0b2981c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(splat): add \u0022non-splatted\u0022 to all 4 instances of this error message \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":"compiler/rustc_hir_typeck/src/diagnostics.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"befdd3349f53f51a9bfb99d8904529fe8c80f7f397e8c9409f9ffca61a01950b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: #114050"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/diagnostics.rs"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa5fdc87d94e50087e8b6e6f33d3fe723b5a3b4cf3d7c68a9a1f9a604e27d556"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#155345): Missing normalization call"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/expectation.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e8bd748203c99c8ebdfa0bdc47d8e7e6b732a184b07014f532b31c01c3ebd0b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#155345): Missing normalization call"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_const_eval/src/const_eval/valtrees.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"1abe777fb01abe4044bd609b4e19fb32943534d0c7d1e4befb42c8201b8ddae3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: we should move the field error reporting code somewhere else. \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":"compiler/rustc_hir_typeck/src/expr.rs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b7214dc1f54f206189e2cfbf2b880f0111f1530971baa23118e60d45e4030e1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME it\u0027s a try block, not a question mark \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":"compiler/rustc_hir_typeck/src/expr.rs"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bb73c3cc264af1f6316c08d644bfed21014f47adcb16638a17356788b6a0019"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(explicit_tail_calls): add a diagnostic note that \u0060become\u0060 doesn\u0027t allow coercions \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":"compiler/rustc_hir_typeck/src/expr.rs"},"region":{"startLine":958}}}],"partialFingerprints":{"codehealthFindingId/v1":"d833b4c957f17e1d294aa1e7f7eb0aa8412e6552483c0982f014d67f5f3ac045"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(unsafe_binders): coerce here 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":"compiler/rustc_hir_typeck/src/expr.rs"},"region":{"startLine":1672}}}],"partialFingerprints":{"codehealthFindingId/v1":"3db7883ac47da5e15e307c6204effc2b165f29f31f82f01c5b772b8557738070"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: remove this workaround for an unsoundness (#165323) once it\u0027s no longer needed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/expr.rs"},"region":{"startLine":1797}}}],"partialFingerprints":{"codehealthFindingId/v1":"6714b1164b0485a2d5bcc703b537a07d395a4ca1dc4ef0cc833ff903208c062b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Maybe need to normalize 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":"compiler/rustc_hir_typeck/src/expr_use_visitor.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e12c310eb8ac9bac9a5ee44ad622d3b5bb85acfd324969e63eecfe55008df78"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: It\u0027s suspicious that this is public; clippy should probably use \u0060walk_expr\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":"compiler/rustc_hir_typeck/src/expr_use_visitor.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"77008ae2d0bb0e4c55a89c27d562e0f2874ab213e2277d3bdbb987c7dd8507bd"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We shouldn\u0027t be relying on the infcx being tainted. \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":"compiler/rustc_hir_typeck/src/expr_use_visitor.rs"},"region":{"startLine":1133}}}],"partialFingerprints":{"codehealthFindingId/v1":"b802e21e08ed8d8abc3425caea471b7ee9196a7b789bc78482db2a22f40b989b"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK(dianne): giving the callback a fake deref pattern makes sure it behaves the \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/expr_use_visitor.rs"},"region":{"startLine":1644}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc6821544c7bd78a9135dcc9f0be6cca487157c22ab128316c89597dcf88a1d4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(compiler-errors): This could use \u0060\u003C$ty as Pointee\u003E::Metadata == ()\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":"compiler/rustc_hir_typeck/src/inline_asm.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"b18c67173a67c82502974752be097803708e50473b3ef6c23154dda0748ac6e9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: \u0060try_structurally_resolve_const\u0060 doesn\u0027t eval consts \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":"compiler/rustc_hir_typeck/src/inline_asm.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6526d558a6c8633423af525074269f9a2bd6a2ba0ab8ffb22b38919d6db93f9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#140855): This should also be forwards compatible with moving"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/lib.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ea96a1c2e15b35beff2b2fe4a5d30de0be996b9f950853944f4404ffb293046"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: support method calls too. \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":"compiler/rustc_hir_typeck/src/lib.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff250220cf481d425931d7598b043f89d1e94930c3b00f4adef7afea7aa418d1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: point at \u0060repr\u0060 when present in the type. \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":"compiler/rustc_hir_typeck/src/lib.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"34d301eb359a4a6316b7c5aab1a30879fc65da05d44d3fd41c59da544d42c011"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME(const_trait_impls): once the traits and their impls are const stable \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":"compiler/rustc_hir_typeck/src/op.rs"},"region":{"startLine":1323}}}],"partialFingerprints":{"codehealthFindingId/v1":"e523cb1013a4cac01ee51ea29d0d487421d56cc7d708fcbc949bd362f2db2273"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME(@lcnr): I believe this should be possible in theory and would like \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":"compiler/rustc_hir_typeck/src/opaque_types.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b6eee8148654920db07aeb024f4f9d1ce7226a21ffd70cb81a29134d665a1b3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(pin_ergonomics): Once \u0060pin_ergonomics\u0060 is stabilized, remove this \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":"compiler/rustc_hir_typeck/src/pat.rs"},"region":{"startLine":1432}}}],"partialFingerprints":{"codehealthFindingId/v1":"40231bf05e6856dfe39b394b0ad47ee1aa141a780614cb80e86cdec91d517679"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: heuristic-based suggestion to check current types for where to add \u0060_\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":"compiler/rustc_hir_typeck/src/pat.rs"},"region":{"startLine":2015}}}],"partialFingerprints":{"codehealthFindingId/v1":"f33b5a0712a2029d682ac2a65bed955c1f9f1cf219b34dc449835ad205653103"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(ref_pat_eat_one_layer_2024): The migration diagnostic doesn\u0027t know how to track 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":"compiler/rustc_hir_typeck/src/pat.rs"},"region":{"startLine":3346}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2a7e02498742c2bdf104b645a61edc127a828f64ef589f5663656c08a2ff9c3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#132279): Using \u0060non_body_analysis\u0060 here feels wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/upvar.rs"},"region":{"startLine":1452}}}],"partialFingerprints":{"codehealthFindingId/v1":"baae888860afd239abe0b0c5ff217e30c4ebac4e66d42f425f1b36e4b0d9fc8f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#132279): Using \u0060non_body_analysis\u0060 here feels wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/upvar.rs"},"region":{"startLine":1739}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2ddc018777fa433fb67d9a50276a8be873c012bb7720599cf9b64c343c85d7c"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: We specifically don\u0027t want the (opaque) error from tainting our \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/writeback.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"c19bc015015dd18058882fea630fa689d1384a736b7bba1e61a6e427bca55d68"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // Hacky hack: During type-checking, we treat *all* operators \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/writeback.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"84519ace9d8909d756e8ac3732c14a3464d83932a5063af7232aac42e8beff6d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(oli-obk): collect multiple spans for better diagnostics down the road. \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":"compiler/rustc_hir_typeck/src/writeback.rs"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8f2d44cd7b24b01c093300117d838fa3899134816fdee7b69070b2e0c1c0a1c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(oli-obk): collect multiple spans for better diagnostics down the road. \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":"compiler/rustc_borrowck/src/region_infer/opaque_types/mod.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"34735fc5b57868f3a33f7d17d8347b558dddbf4fed8fc064eef335953883e6df"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: throwing away the param-env :( \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":"compiler/rustc_hir_typeck/src/writeback.rs"},"region":{"startLine":860}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd86845fce76d2eb29fb464f525fca8141e45bf822a3a52efa3d4e067de58996"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#132279, generic_const_exprs): Using \u0060try_normalize_erasing_regions\u0060 here"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/writeback.rs"},"region":{"startLine":1052}}}],"partialFingerprints":{"codehealthFindingId/v1":"58745ec352ffa38792b96227fa527a17d782626c18836c140fb17b29e978a21f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: could replace with the following, but we already calculated \u0060method_clauses\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":"compiler/rustc_hir_typeck/src/method/confirm.rs"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8adc4b708dd17f2f17a718f00cc2e65eeea8180c620844006e254497f277a96"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: /// Hack for applying method probing routine for arbitrary types \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/method/probe.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"a12eb8c0e8c3e1cdfa07ec7296eae97ad6155a60cc58e83c98b0c99ddba0d003"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME(fn_delegation): now this hack is used, however in perfect world \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":"compiler/rustc_hir_typeck/src/method/probe.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"99231408ada18f821453ef407a355085e35828de7050ad05671af1b782fe5436"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This should be a \u0060span_suggestion\u0060 instead of \u0060help\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":"compiler/rustc_hir_typeck/src/method/probe.rs"},"region":{"startLine":1890}}}],"partialFingerprints":{"codehealthFindingId/v1":"93e9b05c428c18de7b320a32143f3e62be70784841fe779e54ff36b4b569048f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Weirdly, we normalize the ret ty in this candidate, but no other candidates. \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":"compiler/rustc_hir_typeck/src/method/probe.rs"},"region":{"startLine":2052}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ab78ab0a6c5078ad43196d57277e8fc7132b217322b16f5e543feca1e005c51"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: opaque types will match anything for which their bounds hold. \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/method/probe.rs"},"region":{"startLine":2110}}}],"partialFingerprints":{"codehealthFindingId/v1":"e983c9c38c46f805d9d05f00e169703c6f4cf896dd59e556eb23b2fa66c1a2d8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(mu001999) E0599 maybe not suitable here because it is for 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":"compiler/rustc_hir_typeck/src/method/suggest.rs"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf219d0338718e74970bfb88189fa2d3e6ee795552bb8a9c72a5c796aa47a0d8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: reuse the logic for \u0022change args\u0022 suggestion to account for 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":"compiler/rustc_hir_typeck/src/method/suggest.rs"},"region":{"startLine":1637}}}],"partialFingerprints":{"codehealthFindingId/v1":"56799fbfdadbda56028fa3c9084c776c100af3c5d7741ad02c681e5b248a4d6c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: \u0060probe_for_name_many\u0060 searches for methods in inherent implementations, \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":"compiler/rustc_hir_typeck/src/method/suggest.rs"},"region":{"startLine":2269}}}],"partialFingerprints":{"codehealthFindingId/v1":"e868c904e1bfe9b51155b387a7299cd497f6f5552bf42283f89203598ff1dd8e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Maybe FileName::Anon should also be handled, \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":"compiler/rustc_hir_typeck/src/method/suggest.rs"},"region":{"startLine":3064}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1905303d9a0a80269f8a18330e662228c8d1560372ac5d624dcfac30886829b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This really should be taking scoping, etc into account. \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":"compiler/rustc_hir_typeck/src/method/suggest.rs"},"region":{"startLine":3155}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bd487ba2e729ecd8e256302e1b18b4ce7edab9736283e875d1aa1102d828cb0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(compiler-errors): Support suggestions for other matching enum variants \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":"compiler/rustc_hir_typeck/src/method/suggest.rs"},"region":{"startLine":3369}}}],"partialFingerprints":{"codehealthFindingId/v1":"e71f5d7c12a1327d0d1bd20f294e2753d72d2020d2a0e71b7b3ba9aebd2b6837"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: probe for all types that *could* be arbitrary self-types, not \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/method/suggest.rs"},"region":{"startLine":4169}}}],"partialFingerprints":{"codehealthFindingId/v1":"e711f6cee0763cef9a7c4adb85034b07ec780bd695faf327528750b10f1386d1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Even though negative bounds are not implemented, we could maybe handle \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":"compiler/rustc_hir_typeck/src/method/suggest.rs"},"region":{"startLine":4705}}}],"partialFingerprints":{"codehealthFindingId/v1":"9887be840d1deaf3a7763ce8b3c9f436e88b67b497cca5aba6b1f6295d57f3b1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: it might only need to be imported into scope, not 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":"compiler/rustc_hir_typeck/src/method/suggest.rs"},"region":{"startLine":4773}}}],"partialFingerprints":{"codehealthFindingId/v1":"dda85d55cf72f8be700175956d7b12b661792486f88ccf51a94c459384fcec32"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: it might only need to be imported into scope, not 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":"compiler/rustc_hir_typeck/src/method/suggest.rs"},"region":{"startLine":4782}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f93c4557c2781d1f8d98766c5166895b78c78d69db12e78075356cbed6c37f7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: currently not working for suggesting \u0060map_or_else\u0060, see #102408"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/method/suggest.rs"},"region":{"startLine":4872}}}],"partialFingerprints":{"codehealthFindingId/v1":"76ff2d111d9d296728715a233b712bf22df1301ce39fa63ccba4778eba589411"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const_trait_impl): enforce constness using enforce_context_effects() and add \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":"compiler/rustc_hir_typeck/src/fn_ctxt/_impl.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8229babb53d6c9e2748472fa40c2337e83bb8c94579ff4adcecd60ed35027ca"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(splat): do we need to look up both these HirIds? \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":"compiler/rustc_hir_typeck/src/fn_ctxt/_impl.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"63538aac26d66a5f6785e81f8d6adf163c55380844aad8a3e28f1545d15fe9d6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(splat): is this actually populated and used correctly? \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":"compiler/rustc_hir_typeck/src/fn_ctxt/_impl.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0defb8439b7c3cae99d51217bba78b07c079eccd2c06f38795bf73f9178dbac"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: is_identity being on \u0060UserType\u0060 and not \u0060Canonical\u003CUserType\u003E\u0060 is awkward \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":"compiler/rustc_hir_typeck/src/fn_ctxt/_impl.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"acf117c0ed31bf4626f26a48f9a537a25917711f9f92c8ed12183834008707bf"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const_trait_impl): We *could* enforce \u0060\u0026T: [const] Deref\u0060 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":"compiler/rustc_hir_typeck/src/fn_ctxt/_impl.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"c46bf3e8e56aed7395380ed13214076224b8f45039aa16430fcc96c20589fe58"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const_trait_impl): We *could* enforce \u0060Pin\u003C\u0026T\u003E: [const] Deref\u0060 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":"compiler/rustc_hir_typeck/src/fn_ctxt/_impl.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d2f3bcad3917482de0d5c7128ac8a257c72e66dae9c54623d8710f17da8f920"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const_trait_impl): We should probably enforce these. \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":"compiler/rustc_hir_typeck/src/fn_ctxt/_impl.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"c31850ad117d2a96cd8490e021d0fc560922035658f00c494f44ec2f3a76fa87"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(reborrow): figure out if we have effects to enforce 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":"compiler/rustc_hir_typeck/src/fn_ctxt/_impl.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e4132da175b5a6874f03d942dfa548fefac596d38f3a9ed0823e976286b7565"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: currently we never try to compose autoderefs \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":"compiler/rustc_hir_typeck/src/fn_ctxt/_impl.rs"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5ea77a503e7300c123582d06c4653ef2a91e1a42353efb8ef8585a269d0d9eb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(mgca): should this also count stuff with infer consts \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":"compiler/rustc_hir_typeck/src/fn_ctxt/_impl.rs"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"e53de1bc81aa0578ab0f16f16266396350ae27382ac15bc62883651425ea5555"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(arielb1): use this instead of field.ty everywhere \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":"compiler/rustc_hir_typeck/src/fn_ctxt/_impl.rs"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"4be1273bcf2c83b7b50c4b4b7d5ca1f6506ee6e769e09a31bc8a1c2459d11611"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(async_closures): Implement this. \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":"compiler/rustc_hir_typeck/src/fn_ctxt/_impl.rs"},"region":{"startLine":923}}}],"partialFingerprints":{"codehealthFindingId/v1":"37550be65933626a103ac6fe2453cce80f3709f3eca246059d2b05d6955bf22b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Infer \u0060?ct = {const error}\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":"compiler/rustc_hir_typeck/src/fn_ctxt/_impl.rs"},"region":{"startLine":1653}}}],"partialFingerprints":{"codehealthFindingId/v1":"a549ccc70bc76d4002298f42bdb10e264f5cabbb5efd49141a5c3cf5dc20d451"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: This is not correct, since \u0060predicate_self_type_to_point_at\u0060 might \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/fn_ctxt/adjust_fulfillment_errors.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"a40714d8540d0fb0868519d597e4701418031a8af62411c56e27f7882c9d1ca6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: It would possibly be better to do this more continuously, at each 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":"compiler/rustc_hir_typeck/src/fn_ctxt/adjust_fulfillment_errors.rs"},"region":{"startLine":746}}}],"partialFingerprints":{"codehealthFindingId/v1":"80e80d0848dd2d56d7666f8acca37e4a69bd3a0da973565b9e3a78d882ad1802"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: It may be better to take the first if there are multiple, \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":"compiler/rustc_hir_typeck/src/fn_ctxt/adjust_fulfillment_errors.rs"},"region":{"startLine":910}}}],"partialFingerprints":{"codehealthFindingId/v1":"cad1db57cb9ed6560a87fa1999a79a913a59d8b13bc92e571e5ee9221a7e976b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Deal with type aliases? \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":"compiler/rustc_hir_typeck/src/fn_ctxt/adjust_fulfillment_errors.rs"},"region":{"startLine":944}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb98a0e032f7446d42124739f474bab72c8bb13c81690294c41c8d0f6ce9a8f4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Deal with type aliases? \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":"compiler/rustc_hir_typeck/src/fn_ctxt/adjust_fulfillment_errors.rs"},"region":{"startLine":952}}}],"partialFingerprints":{"codehealthFindingId/v1":"c84d6df2789313cc679849951feaf218833920d454a714a4b3d63e74e5011d90"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Deal with type aliases? \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":"compiler/rustc_hir_typeck/src/fn_ctxt/adjust_fulfillment_errors.rs"},"region":{"startLine":1053}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae8b727a173dd22b597535bf352615ccfcce8f912ffb832334875521b738539e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Deal with type aliases? \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":"compiler/rustc_hir_typeck/src/fn_ctxt/adjust_fulfillment_errors.rs"},"region":{"startLine":1070}}}],"partialFingerprints":{"codehealthFindingId/v1":"412180b90cab1d2c9cd6fb465f428ab797a299bf147e606bcb39c341e18c009c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Deal with type aliases? \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":"compiler/rustc_hir_typeck/src/fn_ctxt/adjust_fulfillment_errors.rs"},"region":{"startLine":1076}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad3d9422b5059ce57e7c1f83c9cc7db8141ed8e1dc1f6700d5bbf42d0530cca2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This case overlaps with another one worth 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":"compiler/rustc_hir_typeck/src/fn_ctxt/adjust_fulfillment_errors.rs"},"region":{"startLine":1037}}}],"partialFingerprints":{"codehealthFindingId/v1":"63d098a7729cb7b0eb65fdcdc40b93851d55867e4e883f5cbfbe80d92d5123b8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(splat): do we need to splat arguments before this type inference? \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":"compiler/rustc_hir_typeck/src/fn_ctxt/checks.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"914467fa9ef36553a04abfe1f52ae322170387898888216f618a6816713e833d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#149379): This operation results in expected input"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/fn_ctxt/checks.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"c37598e18f470e34d9831bc72ae548b91f5aa28b2364d4ce8abacc5a0f1c8947"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: unreachable warning current isn\u0027t emitted \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":"compiler/rustc_hir_typeck/src/fn_ctxt/checks.rs"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"b78b057c848a42b69d5075f8076c2121edb41084788cb3e941dbb76eff251cb7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(splat): should this be a sub/super type relationship? \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":"compiler/rustc_hir_typeck/src/fn_ctxt/checks.rs"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"31d6c50cc03149fe616d587ee194e45e221dcef5720a020c7f5201c7eb09eb38"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(splat): add a test for this error and the one below, if they are reachable \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":"compiler/rustc_hir_typeck/src/fn_ctxt/checks.rs"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdd07edd821710af606d4ae86bd84efff3c9dfee1d31214650545e2aa4a70225"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(splat): add a new error code before stabilization (and below as well) \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":"compiler/rustc_hir_typeck/src/fn_ctxt/checks.rs"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd65992846cc405487fe291e2ca1f29ca05baf5d5cd3f8e018bd2c99de0bfa64"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(splat): update the error code E0057 docs when splat is stabilized \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":"compiler/rustc_hir_typeck/src/fn_ctxt/checks.rs"},"region":{"startLine":701}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0c1feb20293e54e4f9035aada80a052e717b0f9b253e9e16af735e1347ec7fa"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(splat): add a new error code before 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":"compiler/rustc_hir_typeck/src/fn_ctxt/checks.rs"},"region":{"startLine":770}}}],"partialFingerprints":{"codehealthFindingId/v1":"efc4ccb9bbe08e568512e18500d2e15191f55dcdcf6cd04f0a2617f79b9bb78e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(splat): suggest alternative argument counts, if there are any \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":"compiler/rustc_hir_typeck/src/fn_ctxt/checks.rs"},"region":{"startLine":785}}}],"partialFingerprints":{"codehealthFindingId/v1":"3531b4a11a657933c85ca81124b84dcc0ed55bc2fe4bac438b5ee1f1989a177d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const_trait_impl): does not enforce constness yet \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":"compiler/rustc_hir_typeck/src/fn_ctxt/checks.rs"},"region":{"startLine":814}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6df70ffe9af0eb83cf2beb2ef0ae761ec889063f999dfdaf4f864df51bcd929"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(splat): when the feature design is settled, improve the errors 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":"compiler/rustc_hir_typeck/src/fn_ctxt/checks.rs"},"region":{"startLine":858}}}],"partialFingerprints":{"codehealthFindingId/v1":"4decee8149a78ac2590f4be35b1d097c2c17153c5f434c044d0897d75fb15dcc"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(tschottdorf): \u0060contains_explicit_ref_binding()\u0060 must be removed \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":"compiler/rustc_hir_typeck/src/fn_ctxt/checks.rs"},"region":{"startLine":1172}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea51a5770dd73dbd2a79822190dfbea39747518c3ac89d423712d785a8a446cc"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: on some cases (\u0060ui/liveness/liveness-issue-2163.rs\u0060) the \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/fn_ctxt/checks.rs"},"region":{"startLine":1404}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfdaffb654d2ebe4bb2608df0195f3eb20e73199ebe5617d15625b2a280c5276"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(FnPtr, splat): Handle FnPtr types and splatting 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":"compiler/rustc_hir_typeck/src/fn_ctxt/checks.rs"},"region":{"startLine":1681}}}],"partialFingerprints":{"codehealthFindingId/v1":"646f3721b59ea3119db3f7ac39015d9906f446a3adbe6549231e1dc704a75fb6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(FnPtr, splat): Handle FnPtr types and splatting 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":"compiler/rustc_hir_typeck/src/fn_ctxt/checks.rs"},"region":{"startLine":2071}}}],"partialFingerprints":{"codehealthFindingId/v1":"c19bc74e45ffa7cc0b0d7ea59da7e39fb6110193e4830c742ceda425723211df"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(compiler-errors): This could be problematic if something has two \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":"compiler/rustc_hir_typeck/src/fn_ctxt/checks.rs"},"region":{"startLine":1716}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcb149caaa59d4c16e4148321c7cff37d135e6ef66ae2f827495d3029c5206c0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(splat): fix the generic mismatch earlier, so it doesn\u0027t reach 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":"compiler/rustc_hir_typeck/src/fn_ctxt/checks.rs"},"region":{"startLine":1777}}}],"partialFingerprints":{"codehealthFindingId/v1":"176965382ea81ff8012f5d8ba267b6bd6efe0b2cdfb9dd0f85aec6577e8351cd"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(splat): fix the generic mismatch earlier, so it doesn\u0027t reach 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":"compiler/rustc_hir_typeck/src/fn_ctxt/checks.rs"},"region":{"startLine":2076}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e04be23803691452995036d43844b8bcec286675c3cc343b9d31a07470f5e56"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: not suggestable, use something else \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":"compiler/rustc_hir_typeck/src/fn_ctxt/checks.rs"},"region":{"startLine":2716}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3972592b1374034b52043061823bf218444ea82d22224e2f8265c661c92b50a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(estebank): This is hacky, and there\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":"compiler/rustc_hir_typeck/src/fn_ctxt/checks.rs"},"region":{"startLine":3034}}}],"partialFingerprints":{"codehealthFindingId/v1":"954a631f1d0ff3406b0279be487acb095c8f3955333c1ce4f53fac3a7aab4448"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(FnPtr, splat): What suggestions are needed for FnPtrs? \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":"compiler/rustc_hir_typeck/src/fn_ctxt/checks.rs"},"region":{"startLine":3680}}}],"partialFingerprints":{"codehealthFindingId/v1":"6476e0821217b1a18335f605575b543eca9f6a927c5c9d42aa24c54fe80f20c6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME ideally this shouldn\u0027t use unwrap \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":"compiler/rustc_hir_typeck/src/fn_ctxt/mod.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"aff94646138151e337e11ac53545dab944c36799b61b8e6f915d5f09b63de4d0"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK(eddyb) should get the original \u0060Span\u0060. \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/fn_ctxt/mod.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"98baef8d9d54b0eb60c79984619d4561ec9baa69e29e2ba9971af681a9f5849e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(mgca): \u0060item_def_id\u0060 can be an AssocConst; rename this variant. \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":"compiler/rustc_hir_typeck/src/fn_ctxt/mod.rs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fa233f363a028d7b15a3f16ccedabf765f9eca05fdbfbb5c89fb02fcb98e5de"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#104767): Should we handle bound regions here?"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/fn_ctxt/mod.rs"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d0c49b9c27249a16143615ebfec9a1f829d0d39741992374ad6564c0d812100"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: normalization and escaping regions \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":"compiler/rustc_hir_typeck/src/fn_ctxt/mod.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"019ce72221d7a214272b5d89a4887535bf7a58291092827224cc13219683969f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This could/should be extended to suggest \u0060as_mut\u0060 and \u0060as_deref_mut\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":"compiler/rustc_hir_typeck/src/fn_ctxt/suggestions.rs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"82347fa2f9552dc5e62febf1a5b80f7b87876cfe92947bf94a4e14c017817dca"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: if \u0060found\u0060 could be \u0060impl Iterator\u0060 we should suggest that. \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":"compiler/rustc_hir_typeck/src/fn_ctxt/suggestions.rs"},"region":{"startLine":1011}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a889abea2a15914b3c3e340f16b233e248d88b6aa77527e7d7f89e4eea07a70"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: account for RPITIT. \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":"compiler/rustc_hir_typeck/src/fn_ctxt/suggestions.rs"},"region":{"startLine":1084}}}],"partialFingerprints":{"codehealthFindingId/v1":"5be4b58daa83867b2e5bf32da1860b23f2de1027c8fabed69eb5ebbfb1d5bee9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Maybe these calls to \u0060lower_ty\u0060 can be removed (and the ones below) \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":"compiler/rustc_hir_typeck/src/fn_ctxt/suggestions.rs"},"region":{"startLine":1248}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaa86f23f7d169b4aa0571af4273496eb3481b91fe59939a88eb0faef21fc631"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(compiler-errors): This check is *so* rudimentary \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":"compiler/rustc_hir_typeck/src/fn_ctxt/suggestions.rs"},"region":{"startLine":2005}}}],"partialFingerprints":{"codehealthFindingId/v1":"9410a33e0ce3ba1f2b8b41025c963caa1f9dc8847cdb1c2142e772dd84db3813"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(compiler-errors): We can actually do this if the checked_ty 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":"compiler/rustc_hir_typeck/src/fn_ctxt/suggestions.rs"},"region":{"startLine":3315}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8474a1f35b07fa55fceb27a4277b025d1072a7917860cf218a261fee82688fe"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(mgca): proper printing for struct exprs \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":"compiler/rustc_hir_pretty/src/lib.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7a3d8102ef6864e61c2b15e4b46394196315767ad710692cc670eb5e1179469"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#70334): this will generate legacy {{closure}}, {{impl}}, etc"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_id/src/definitions.rs"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"63ca31b495cd56243c01ee9793c918735350b941be5b64a883d6ff82b1ea2bdd"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Use \u0060tcx.hir_par_body_owners()\u0060 when we implement creating \u0060DefId\u0060s \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":"compiler/rustc_hir_analysis/src/check_unused.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ad0f5b291580447c924af7d23ce22ede0e3db3d4c6f5b662723b8f2ef91e75d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Account for trailing plus \u0060dyn Trait\u002B\u0060, the need of parens 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":"compiler/rustc_hir_analysis/src/collect.rs"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2e2f16edc9b4e1b0e81ac6005bce34192878bfc8fba0de1a8d832ab77718b0d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#103640): Should we handle the case where \u0060ty\u0060 is a projection?"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/collect.rs"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0596a17ce8a65b767b73dace5f6845b8b77670cfb6f0e16e8ea97d7cd792af0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(compiler-errors): We may benefit from resolving regions 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":"compiler/rustc_hir_analysis/src/collect.rs"},"region":{"startLine":1562}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbd083214b6fbe553add2f3a8b831d6826ebccad0b59aad2bad380a5a63fdd04"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Don\u0027t lower in the context of parent. Blocked on the removal of GCE. See comment 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":"compiler/rustc_hir_analysis/src/collect.rs"},"region":{"startLine":1802}}}],"partialFingerprints":{"codehealthFindingId/v1":"8217dff79d2c4f3bdbe8d78d3d1531ac04d77939dc83ef49bd8a396563a7a6ae"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(hkBst): the big-O bound above would be accurate for the number \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":"compiler/rustc_hir_analysis/src/constrained_generic_params.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"70518e5932d0d7ac5475c326e501639c7192b70806f71887e1ae40f00f98b2a5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME(fn_delegation): This often leads to type inference \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":"compiler/rustc_hir_analysis/src/delegation.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b3416ea7e08a46894f5ff06a9d4ba9f69e4a1c8e6b14f8b7dffcbc7eced3e33"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This doesn\u0027t need to be a manual impl! \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":"compiler/rustc_hir_analysis/src/diagnostics.rs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fbd9d90819918bdd4ceae4d36ba1594a5939e57af263d24cf4cc01252b3f1a2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(generic_const_items): Passing empty instead of identity args is fishy 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":"compiler/rustc_hir_analysis/src/lib.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5fa5d1cbde0a0e5787eca2842b9524cbc1fa22e98975ca7416f81aa701d561c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const_generics): having special methods for rustdoc in \u0060rustc_hir_analysis\u0060 is cursed \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":"compiler/rustc_hir_analysis/src/lib.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c0d533869a7f7c03d2e2daf6c064b493740cbeb5902a26d5bbada9cbece4560"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(unsafe_binders): This is covariant, right? \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":"compiler/rustc_hir_analysis/src/variance/constraints.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"55300a8067ee6351126b92e50c17cfc123a90f8f898074dbbe749a48af4d0d3c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(inherent_associated_types): Use the explicit clauses from the parent impl. \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":"compiler/rustc_hir_analysis/src/outlives/implicit_infer.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc047020018d02fc5c3c9ae2c0085562aa1a81605019b72353d76eb7535cccf2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME -- consider correcting impedance mismatch in some way, \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":"compiler/rustc_hir_analysis/src/outlives/mod.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"71b666951a7fbfd936f8d1b5237d59553145becce8cc83b70f772c0d91a101c4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(min_specialization), FIXME(const_generics): \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":"compiler/rustc_hir_analysis/src/impl_wf_check/min_specialization.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"044c8ebf327fe7a44d76800856c733079ab90ec8ca12e5d76da1400af2e6ae5a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: point at the type params that don\u0027t have appropriate lifetimes: \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":"compiler/rustc_hir_analysis/src/hir_ty_lowering/bounds.rs"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"caf2fce7efadd6da05a452cc0416fb75a1b537344ca6b4bdbff2ac8af2934297"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: point at the type params that don\u0027t have appropriate lifetimes: \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":"compiler/rustc_hir_analysis/src/hir_ty_lowering/dyn_trait.rs"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"36e38689bfbb78ed9ac79a04b7f678b1ea1d391f5638a7c8235705155706895d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME(const_generics): This is a temporary and semi-artificial restriction until 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":"compiler/rustc_hir_analysis/src/hir_ty_lowering/bounds.rs"},"region":{"startLine":833}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa701dcfdb6f71e9e1d0255512b037cd0c011ccd47a76cdf1e6b39351e2de29f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(mgca): We actually leak \u0060trait_object_dummy_self\u0060 if the type of any assoc \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":"compiler/rustc_hir_analysis/src/hir_ty_lowering/dyn_trait.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"6106cb95abe0af867c5b7364bcc533078f81e34535d662d1d02022e25a21bf39"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(sized-hierarchy): https://github.com/rust-lang/rust/pull/142712#issuecomment-3013231794"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/hir_ty_lowering/dyn_trait.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f799a5241feedb679bb78bd635dd8fb02f4bd1351bddc08982462059612523e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#150936): Since the elaborated projection bounds also include the user-written ones"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/hir_ty_lowering/dyn_trait.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"0001008161e6153d38b48a529cf5cdc3d271d06014e06b8a1eeb49b5e946bd67"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(mgca): Ideally we would generalize the name of this lint to sth. like \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":"compiler/rustc_hir_analysis/src/hir_ty_lowering/dyn_trait.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"59e06a9013d33b034edd39cb8acda5cd45c598434f389e2a7f44c0410ea8a475"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This is actually wrong with multiple principals in regards to symbol mangling \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":"compiler/rustc_hir_analysis/src/hir_ty_lowering/dyn_trait.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d60e6416afb352230fe1f6d776cb7b4e0bb8aee0f7bbe9a285ed94668af95a5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Only emit this suggestion if the trait is dyn-compatible. \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":"compiler/rustc_hir_analysis/src/hir_ty_lowering/dyn_trait.rs"},"region":{"startLine":841}}}],"partialFingerprints":{"codehealthFindingId/v1":"43407585feaa8186fd7a8367d18e5eef0443233923804f44bc45dc14f4652d9b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: If \u0060type_alias_impl_trait\u0060 is enabled, also look for \u0060Trait0\u003CTy = Trait1\u003E\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":"compiler/rustc_hir_analysis/src/hir_ty_lowering/dyn_trait.rs"},"region":{"startLine":877}}}],"partialFingerprints":{"codehealthFindingId/v1":"496ff257d410095a3b765e64ff8af2ab5e49b77129cf863e437f49868a30bdca"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: However, for trait aliases, this incorrectly returns the enclosing 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":"compiler/rustc_hir_analysis/src/hir_ty_lowering/errors.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d82cc16095760b72ed6cc179ef35c7e4a1da3f4a14444a76048c463df9d9382"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: ...which obviously won\u0027t have any generics. \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":"compiler/rustc_hir_analysis/src/hir_ty_lowering/errors.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"37c524c6c26e3497fe80c7b40876620ba8ddc53feb57ee34d556b0b95704e371"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Suggest adding supertrait bounds if we have a \u0060Self\u0060 type param. \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":"compiler/rustc_hir_analysis/src/hir_ty_lowering/errors.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"69e3cb080ce20c8e3163e743546af5a2c288204df0d2e2fb66c31a790a608a6f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(trait_alias): Suggest adding \u0060Self: Trait\u0060 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":"compiler/rustc_hir_analysis/src/hir_ty_lowering/errors.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d0dadca3d4078d13cbd2788d43b4d1fc85026d54678546ef650ab40ca174c99"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(mgca): This has quite a few false positives and negatives. \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":"compiler/rustc_hir_analysis/src/hir_ty_lowering/errors.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d6c94c62348b7083752e1c78c76c03e3eb2cc237845d17f7951f6d4a600a192"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#97583): Print associated item bindings properly (i.e., not as equality"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/hir_ty_lowering/errors.rs"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b23c84cae5c207b0ec5bf3de64e686502a1d923feb88f4e08fa891e0646976a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Turn this into a structured, translatable \u0026 more actionable suggestion. \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":"compiler/rustc_hir_analysis/src/hir_ty_lowering/errors.rs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d23a4c6f5fb07b0c7a5aa4828acd42f681a3bd51c003833f2e700bf13429c48"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(mgca): code duplication with other places we lower \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":"compiler/rustc_hir_analysis/src/hir_ty_lowering/errors.rs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"05e2604bf1fda85d4174cbe20d26a73fe87188184543b9d2e8e246287f7ba33b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#97583): This isn\u0027t syntactically well-formed!"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/hir_ty_lowering/errors.rs"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"f43ccdc8101cca57da8b3a335be11384473bbdb9291d8b721ddbc6f9d41f868a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Provide a suggestion. \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":"compiler/rustc_hir_analysis/src/hir_ty_lowering/errors.rs"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"da92963611c42c03e62d08432ba99f42f25d0683007df6e27c98db292dccecc2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: document why/how this is different from \u0060tcx.local_parent(def_id)\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":"compiler/rustc_hir_analysis/src/hir_ty_lowering/errors.rs"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8ca574e6500f359f073aa64e536e4cd562af162c05d0722872e9a44226f2db1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: also look at \u0060tcx.generics_of(self.item_def_id()).params\u0060 any that \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":"compiler/rustc_hir_analysis/src/hir_ty_lowering/errors.rs"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f5c1e7d3bd56e07f284aa17a4e8c406106107cf64a18eadfefd7a91b50e7392"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(fmease): Heavily adapted from \u0060rustc_hir_typeck::method::suggest\u0060. Deduplicate. \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":"compiler/rustc_hir_analysis/src/hir_ty_lowering/errors.rs"},"region":{"startLine":862}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b4f6a8a3cd8fda0b89c3f814c9ec067254ae01a69be370e229a64f978c26e6c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(inherent_associated_types): Find similarly named associated types and suggest them. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/hir_ty_lowering/errors.rs"},"region":{"startLine":905}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2551ca3414bc2fdad21101e181887c534488a0169ed83b0791559e0b5b8678d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(fmease): This was copied in parts from an old version of \u0060rustc_hir_typeck::method::suggest\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":"compiler/rustc_hir_analysis/src/hir_ty_lowering/errors.rs"},"region":{"startLine":915}}}],"partialFingerprints":{"codehealthFindingId/v1":"e60e96ec16759e0b760ee6ba1d58b16230689676454a13afb57a3f0bf3923c87"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(fmease): Copied from \u0060rustc_hir_typeck::method::probe\u0060. Deduplicate. \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":"compiler/rustc_hir_analysis/src/hir_ty_lowering/errors.rs"},"region":{"startLine":938}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b5d6cbfc589d19c840766dcbad94002d4e79bcabe219ece1f2f6aaf559c7021"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(fmease): \u0060rustc_hir_typeck::method::suggest\u0060 uses a \u0060skip_list\u0060 to filter out some bounds. \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":"compiler/rustc_hir_analysis/src/hir_ty_lowering/errors.rs"},"region":{"startLine":1036}}}],"partialFingerprints":{"codehealthFindingId/v1":"f940613fc302de8e9b9ccfd8e62a567cc617825f3c1ebf6da33dd0f1454886eb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This logic needs some more care w.r.t handling of conflicts \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":"compiler/rustc_hir_analysis/src/hir_ty_lowering/errors.rs"},"region":{"startLine":1097}}}],"partialFingerprints":{"codehealthFindingId/v1":"9997422fb7591ac98c992b60a74ed38769a22cb13e2f44885c52dc0e4347770a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This does not account for trait aliases. I think we should just make \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":"compiler/rustc_hir_analysis/src/hir_ty_lowering/errors.rs"},"region":{"startLine":1157}}}],"partialFingerprints":{"codehealthFindingId/v1":"87b1ea6bdebfb1082630e014933b18640e3b4a96c2b380fed5d6654be4c17881"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This note doesn\u0027t make sense, get rid of this outright. \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":"compiler/rustc_hir_analysis/src/hir_ty_lowering/errors.rs"},"region":{"startLine":1300}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed88a2ef9132c028a9a799ec08ef4c206eb02575ab5ea1584554a0cb48c3b847"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This should \u0060print_sugared\u0060, but also needs to integrate projection bounds... \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":"compiler/rustc_hir_analysis/src/hir_ty_lowering/errors.rs"},"region":{"startLine":1536}}}],"partialFingerprints":{"codehealthFindingId/v1":"a618cd77f771fac93e81cfcc1211c914449176b39b8a9194ff735db791439013"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(estebank): we could also verify that the arguments being \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":"compiler/rustc_hir_analysis/src/hir_ty_lowering/errors.rs"},"region":{"startLine":1838}}}],"partialFingerprints":{"codehealthFindingId/v1":"06fa61ec22eb63a92200d3d10b1754e0e689632088d8dc37d09b8b7f6531d4a4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(estebank): we could also verify that the arguments being \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":"compiler/rustc_hir_analysis/src/hir_ty_lowering/errors.rs"},"region":{"startLine":1994}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b61530566eec3daf7ddfab07fd189006f84b7888b6b43d13946dd90c596a4de"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(mgca): this branch is dead once new const path lowering \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":"compiler/rustc_hir_analysis/src/hir_ty_lowering/generics.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4ae094ac7d2630f5dbabfd7d2ffe85dc794da0cb72e8eb75fa1093c777e765b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(mgca): Support paths like \u0060Option::\u003CT\u003E::None\u0060 or \u0060Option::\u003CT\u003E::Some\u0060 which \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":"compiler/rustc_hir_analysis/src/hir_ty_lowering/mod.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"062a9181addb8a060fda3ab02edd2085a2b4b1f0eb7555e036bff114fc021f9c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME(mgca): this is pub only for instantiate_value_path and would be nice to avoid altogether \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":"compiler/rustc_hir_analysis/src/hir_ty_lowering/mod.rs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"f192700a5267ee9a24df50860aa7d4b48ace571fb7ab45720c6f1d6064c18cc5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(-Znext-solver): We can likely remove this hack once 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":"compiler/rustc_hir_analysis/src/hir_ty_lowering/mod.rs"},"region":{"startLine":1064}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd89053ee83539aceff6e8b8e916e80bb95cd0aaa39386d20cafba84347752cd"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(mgca): implement support for this once ready to support all adt ctor expressions, \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":"compiler/rustc_hir_analysis/src/hir_ty_lowering/mod.rs"},"region":{"startLine":1506}}}],"partialFingerprints":{"codehealthFindingId/v1":"40a8d9d7ecaeb3a0f38224c368b93f132c8f9e53620991d7c21f4e44138d1402"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(mgca): do we want constructor resolutions to take priority over \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":"compiler/rustc_hir_analysis/src/hir_ty_lowering/mod.rs"},"region":{"startLine":1537}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6dc7b9802395e1def9171cb875521a6d916c8fb83a9f42a76ecf6cd714cf431"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(inherent_associated_types, #106719): Support self types other than ADTs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/hir_ty_lowering/mod.rs"},"region":{"startLine":1574}}}],"partialFingerprints":{"codehealthFindingId/v1":"7098798d41ea090d51a80ed5354ae714b3caa7398f176a7cb37b3a897571d60a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#142006): Don\u0027t eagerly error here, there might be applicable trait candidates."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/hir_ty_lowering/mod.rs"},"region":{"startLine":1753}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d54bb8940c6e4fc5aa9ecd3d19cde1edbae4926d83aba5f6f3059ed8177a6da"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#142006): Don\u0027t eagerly validate here, there might be trait candidates that are"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/hir_ty_lowering/mod.rs"},"region":{"startLine":1774}}}],"partialFingerprints":{"codehealthFindingId/v1":"2921013cca467055b1dbe5a5662c63904a93080959c4b03a760e3d4c716ad9f9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(fmease): Currently creating throwaway \u0060parent_args\u0060 to please \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":"compiler/rustc_hir_analysis/src/hir_ty_lowering/mod.rs"},"region":{"startLine":1778}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3fdad36986f0a67b5ec5fa8b6ccfaa7a7dac87421fe7d8784f9ac4bdcac713f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Don\u0027t bother dealing with non-lifetime binders 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":"compiler/rustc_hir_analysis/src/hir_ty_lowering/mod.rs"},"region":{"startLine":1897}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5eff9d71d6779912166e025c58dec204e16905daf9135a67aa9bae5024b35aa"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(eddyb, varkor) handle type paths here too, not just value 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":"compiler/rustc_hir_analysis/src/hir_ty_lowering/mod.rs"},"region":{"startLine":2040}}}],"partialFingerprints":{"codehealthFindingId/v1":"b364066ff0b8a6dde05a2308619b59f1ec66ce43aa89b0c89b3cd51b5186ae18"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Stating that the last segment (here: \u0060Variant\u0060) is allowed to have \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":"compiler/rustc_hir_analysis/src/hir_ty_lowering/mod.rs"},"region":{"startLine":2121}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f9606e152eddb4dfc878b23313819e0a9beb618f6113d2a5ad7d66fbaa56aab"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: lint here recommending \u0060Enum::\u003C...\u003E::Variant\u0060 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":"compiler/rustc_hir_analysis/src/hir_ty_lowering/mod.rs"},"region":{"startLine":2158}}}],"partialFingerprints":{"codehealthFindingId/v1":"77f46de81a5e47a964eab47cfe83b28655e572c27a41c7d85b56964c2b0579c2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(generic_const_parameter_types): Ideally we remove these errors below 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":"compiler/rustc_hir_analysis/src/hir_ty_lowering/mod.rs"},"region":{"startLine":2435}}}],"partialFingerprints":{"codehealthFindingId/v1":"538c2382ff3a2d2e22e5731a1c680a1f243d0f9a802538e55263f8e1fe29ac6b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(mgca): try to deduplicate this function 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":"compiler/rustc_hir_analysis/src/hir_ty_lowering/mod.rs"},"region":{"startLine":2732}}}],"partialFingerprints":{"codehealthFindingId/v1":"31aa6b56062a3679c87ef8a1770f5fd5fb79cba310392eb658d9e5b7b936c40c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(mgca): we aren\u0027t really handling privacy, stability, \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":"compiler/rustc_hir_analysis/src/hir_ty_lowering/mod.rs"},"region":{"startLine":2820}}}],"partialFingerprints":{"codehealthFindingId/v1":"21250749d664005682e7bb7c35174a483897e0b8cc749bbec5c85f7a87d36d3e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const_generics): create real consts to allow fn items as const paths. \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":"compiler/rustc_hir_analysis/src/hir_ty_lowering/mod.rs"},"region":{"startLine":3014}}}],"partialFingerprints":{"codehealthFindingId/v1":"627c8b5b64747ce3106eeb1adb53d7ade44c9add2ff464700d3d5394b1cf7b15"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(generic_const_parameter_types): We should use the proper generic args \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":"compiler/rustc_hir_analysis/src/hir_ty_lowering/mod.rs"},"region":{"startLine":3079}}}],"partialFingerprints":{"codehealthFindingId/v1":"c356af8a3226c206f73950616c74831b47a2cd29b8bdc59ead7dbc94a6c4ac99"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Check that \u0060something\u0060 is a valid function in \u0060i32\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":"compiler/rustc_hir_analysis/src/hir_ty_lowering/mod.rs"},"region":{"startLine":3391}}}],"partialFingerprints":{"codehealthFindingId/v1":"50476d5774c87701ebe605fad6cac3cd1a673b7ad6f6c9e4802e3652eb02b7f5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(FRTs): support type aliases \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":"compiler/rustc_hir_analysis/src/hir_ty_lowering/mod.rs"},"region":{"startLine":3617}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb9f614fd3adcb1587f2a6510c2f9ccb801ac4924b3859783c99a13fc19c98bb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(FRTs): support these 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":"compiler/rustc_hir_analysis/src/hir_ty_lowering/mod.rs"},"region":{"startLine":3663}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e9c7bc2b31cce4a7b2ff114c860b06ab3815ffd6f82da576d843ae1a80b41ae"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(mgca): should we be calling self.check_params_use_if_mcg here too? \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":"compiler/rustc_hir_analysis/src/hir_ty_lowering/mod.rs"},"region":{"startLine":3710}}}],"partialFingerprints":{"codehealthFindingId/v1":"819a5a53cdab5d01d01efcfa2e6880d92871698333caaf7ca685e883ee1575ef"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: tcx.type_of(param.def_id) for consts \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":"compiler/rustc_hir_analysis/src/diagnostics/wrong_number_of_generic_args.rs"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"70c7d40dda5363fd380b5100fdc687ee8ff0a4c999a0f9e143f33f53e94bb9a0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This doesn\u0027t account for generic associated items \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":"compiler/rustc_hir_analysis/src/diagnostics/wrong_number_of_generic_args.rs"},"region":{"startLine":1082}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a7de139344f9fca16d31c72d7ea819e7135a79f4b17fb02f357a749d90a18dc"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: Avoid ICE when types with the same name with \u0060derive\u0060s are in the same scope: \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/diagnostics/wrong_number_of_generic_args.rs"},"region":{"startLine":1119}}}],"partialFingerprints":{"codehealthFindingId/v1":"944d457c4756676757fbe2f0aab0d5f3c26a0ea73a66da4a08b285f21159c4d5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(staged_api): We might want to look at the normal stability attributes too 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":"compiler/rustc_hir_analysis/src/collect/clauses_of.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"93c469a53884a452de8dc062c2ae1ce227139695d12776e7ddc362bf357cec0e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(return_type_notation): This check should be more robust \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":"compiler/rustc_hir_analysis/src/collect/clauses_of.rs"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d96e59bad9d742fb7eaba1e2f1d7e286d5d577a0dde022ad52fc71e4b307202"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // will ICE because of #106994. FIXME(generic_const_exprs): remove this when a more general solution"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/collect/clauses_of.rs"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0831c8102b0294e9ee19d797b376f65e8f9382b3e9b5739ad67268b78835f0b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Shouldn\u0027t this be unreachable? \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":"compiler/rustc_hir_analysis/src/collect/clauses_of.rs"},"region":{"startLine":897}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6eef0ab4979b25fa85f9e8274b631d8ed75cf66cf9bc37559f1c5be3140ed3b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#43408) always enable this once \u0060lazy_normalization\u0060 is"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/collect/generics_of.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a6dbb8ce5cf7e84541c49a67dfe653c2241db92fe6e502d9aab486333f9c148"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // hack for defaulted parameters should be removed eventually anyway. \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/collect/generics_of.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"26a825dc019b21867f17acb075c21dcae78f87ae35187f6a74da4a364dc40139"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(generic_const_exprs): This only handles \u0060const N: usize = /*defid*/\u0060 but not type \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":"compiler/rustc_hir_analysis/src/collect/generics_of.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf04c74f09c6058fc889a9f74a253a61cf12f5bb482d5725890a3db81148bd8c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Use the HIR parent here similar to \u0060Node::Field\u0060. Blocked on the removal of GCE, \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":"compiler/rustc_hir_analysis/src/collect/generics_of.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"00d124cfd95980f0f510da3a6a2f20c06ce0b07d5542042c30df873f3636d72c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const_trait_impl): We *could* uplift 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":"compiler/rustc_hir_analysis/src/collect/item_bounds.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf4ecce05ba000050fd5a218920069d2e31641b3c86a2beefa0b869898fb3da0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Figure out if there\u0027s a feasible way to obtain the map of type-dependent \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":"compiler/rustc_hir_analysis/src/collect/resolve_bound_vars.rs"},"region":{"startLine":937}}}],"partialFingerprints":{"codehealthFindingId/v1":"d304fa4a4cfa31bacc63607d9021066ac1964cc036322b18e8e9bd32f073f173"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Ideally we would consider the *item bounds* of assoc types when deducing \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":"compiler/rustc_hir_analysis/src/collect/resolve_bound_vars.rs"},"region":{"startLine":1868}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a9d8455cae0e39f5f185baf56f72d492aac9774d78a7b05183a5c3b8255d8ca"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Moreover, ideally GAT args in bindings could induce \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":"compiler/rustc_hir_analysis/src/collect/resolve_bound_vars.rs"},"region":{"startLine":1878}}}],"partialFingerprints":{"codehealthFindingId/v1":"286b92a91c214396c33d4f81e37865dd625d6792b18f3c1dbbcc36dd02ae04d7"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: For now however, if the user passes any lifetime arguments to the trait or \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/collect/resolve_bound_vars.rs"},"region":{"startLine":1887}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8ef9db83b4fbdeb0ec6eb2a2a29c8b2e6ba03851549ec4b62b304d120245768"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(mgca, #151649): Type-level free/assoc consts, const\u0026fn ctors should also qualify."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/collect/resolve_bound_vars.rs"},"region":{"startLine":2010}}}],"partialFingerprints":{"codehealthFindingId/v1":"4801ae2526ca952ef24a0a7839c8b772294dceb2b8da3e408738d194a076dae4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(return_type_notation, #151662): Assoc fns should also qualify."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/collect/resolve_bound_vars.rs"},"region":{"startLine":2011}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4fdd2a8b53cb8aff08895b919d2ff5782e547fb9bcd422233f7f7e0b6fa3dfd"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Remove this special case again \u0026 simply set the \u0060Generics.parent\u0060 for generic \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":"compiler/rustc_hir_analysis/src/collect/type_of.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f41c980ee4c47f737b7e92a851423ecf0da40ab715a37e8dec24d2d3d540ada"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK(#69396): A macro can expand to several missing-type items that all \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/collect/type_of.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"7be203b7d35951202dba3ffc9f2cfa60377b510408a4d3f2f6edf211fbb0d7b3"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK(#69396): Stashing and stealing diagnostics does not interact \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/collect/type_of.rs"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"1be07b411aef4b5a557b666dd5b45a0f35695899b5e26a2be389b5206aa12c9f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(checked_type_aliases, type_alias_impl_trait): \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":"compiler/rustc_hir_analysis/src/collect/type_of.rs"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdd9855ae561a412c42dc6226c2cdc9c4f699c84418c8a9e3fa2d607e10625dd"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We could do normalization here, but is it really worth 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":"compiler/rustc_hir_analysis/src/coherence/builtin.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"321fdf9599cab2ad4af29795491fb4a14b7d0d0a83d8e2d98bfbf0ca30be45f5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This error could be more descriptive, especially if the error_predicate \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":"compiler/rustc_hir_analysis/src/coherence/builtin.rs"},"region":{"startLine":925}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b224d53270ae7dd15f25f3f155f2de74165559aace116c769d449415bebb66e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(pattern_types): Figure out the exact coherence rules we want 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":"compiler/rustc_hir_analysis/src/coherence/inherent_impls.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d88161949415fbf1b7f32c7fdf0235be0b8630e2e64bc435c620130f41828c2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(inherent_associated_types): The example code above currently leads to a cycle \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":"compiler/rustc_hir_analysis/src/coherence/orphan.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbc7b4a61e9b5cd40cf31683817d843b58e17253c492fd106ecf001cf47353b9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(fmease): This is very likely reachable. \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":"compiler/rustc_hir_analysis/src/coherence/orphan.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"33e340cadcc10a4bef31c68e7a2314b52e80e6d81041bbf2a7b08e9a54374c9d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(reborrow): remove this temporary WF-side memcpy-ability guard once \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":"compiler/rustc_hir_analysis/src/coherence/builtin/coerce_shared.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"67e6dd3707531ca869ecd5a4edabd855336a2076db5c6955157fb684b8f2c9ec"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(field_projections): This function should take \u0060Unnormalized\u003CTy\u003C\u0027tcx\u003E\u003E\u0060 for \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":"compiler/rustc_hir_analysis/src/coherence/builtin/coerce_shared.rs"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"2935e5629eeabefda2b6a22b3fd3bff66412b7f200d38d4d81c9ec5e575992ae"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This should be checked earlier, e.g. in \u0060rustc_ast_lowering\u0060, as this \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":"compiler/rustc_hir_analysis/src/check/check.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"651a25b38398518990bfafc24678a22be77ad2699af1b05ab61a1661b845dd7b"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK (not that bad of a hack don\u0027t worry): Some codegen tests don\u0027t even define proper \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/check/check.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e29ba54a41c4aaa4ec0ba38b5d63a241b69db72e3d6c1ed9073f4e79bb9f643"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK(jynelson): trying to infer the type of \u0060impl trait\u0060 breaks documenting \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/check/check.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"8369e46eb8118d90f00897fe78198055464bd731542f39ed7f23fcbe0d952e8a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#132279): Once \u0060PostBorrowck\u0060 is supported in the old solver, this branch should be removed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/check/check.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"302f271b7ba97e83175a1260781c6135927b35799d33f46264c4fd3a4ea19aba"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Consider wrapping the hidden type in an existential \u0060Binder\u0060 and instantiating 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":"compiler/rustc_hir_analysis/src/check/check.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"999140e1e2eadc85fe38f3c6c08ab95c059c46811a14f4119bfeec2e3981ade8"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: We eagerly instantiate some bounds to report better errors for them... \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/check/check.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a8194b5071defc19f9980d0ec787d100175c64493a507a7ff90cdff9975555b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We should just register the item bounds here, rather than equating. \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":"compiler/rustc_hir_analysis/src/check/check.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"071ef74b72c0979b8dc30cfc716847f0ac2da073b34990a9df19c4c327b1cb76"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const_trait_impl): When we do that, please make sure to also register \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":"compiler/rustc_hir_analysis/src/check/check.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"fed160f1e809ca31dd0d42c76fef7fd7d22eaa9925f625c9e6431aed9e97b380"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(impl_trait_in_assoc_type): This computes the implied bounds \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":"compiler/rustc_hir_analysis/src/check/check.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e4d4e14e7753fe5087773ee016df53e09df1251405f417780e690ff2413f4b8"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: this should also fall through to the hidden type check below, but the original \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/check/check.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"446fbcceb3e3db654f8f4e92b3eb6cd9bb8404b0d1915fe6ac76f792d1cdbe9d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(precise_capturing): Structured suggestion for this would be 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":"compiler/rustc_hir_analysis/src/check/check.rs"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"328d08c91ffba699f34cad8f04a1e65a6be3037a5f2541812e9836c6e08ee3ec"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(precise_capturing): Structured suggestion for this would be 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":"compiler/rustc_hir_analysis/src/check/check.rs"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"1572b2dc1029174f7e673ffaa866ef21ed7afe6d183c5de241460acf41e332bc"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(precise_capturing): Structured suggestion for this would be 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":"compiler/rustc_hir_analysis/src/check/check.rs"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"b598cd7c3d02fa9157ae53613dd8be327360975ddcf4b9f3d1b38f2aea282528"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: We sometimes incidentally check that const arguments have the correct \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/check/check.rs"},"region":{"startLine":1006}}}],"partialFingerprints":{"codehealthFindingId/v1":"49aa338d99eb949462554c6a563322b98b102f8b76712cce769d03d95c31826c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: once we start storing spans for type arguments, turn this \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":"compiler/rustc_hir_analysis/src/check/check.rs"},"region":{"startLine":1071}}}],"partialFingerprints":{"codehealthFindingId/v1":"2921aa1f4cafe1631a7eb59514ae240fcd8d0d36b3a2b1f5a573a1bdfb7ab512"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(repr_simd): This check is nice, but perhaps unnecessary due to the fact \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":"compiler/rustc_hir_analysis/src/check/check.rs"},"region":{"startLine":1517}}}],"partialFingerprints":{"codehealthFindingId/v1":"3577617c7616b75ce720cf864d8fe8580640343a6a1c0369fc1cf34d5eff0c38"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This assumes that elaborated \u0060Sized\u0060 bounds come first (which does hold at 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":"compiler/rustc_hir_analysis/src/check/check.rs"},"region":{"startLine":2136}}}],"partialFingerprints":{"codehealthFindingId/v1":"6544fe20b37f76fe1ec4fdac7e58ec9b93f628c1805dc2335faaed6314c0d095"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(eii): even if we don\u0027t support generic functions, we should support explicit outlive bounds 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":"compiler/rustc_hir_analysis/src/check/compare_eii.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"74e36a9740001b6e239d9b4a5ffad5c4fc47d39da98bdbcabd45ab8227782a27"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We manually instantiate the declaration here as we need \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":"compiler/rustc_hir_analysis/src/check/compare_eii.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbc749197e94c960fea7b83f59931212a2b64feb66ebf9f4f361094503c073b4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Copied over from compare impl items, same issue: \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":"compiler/rustc_hir_analysis/src/check/compare_eii.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec960462132341c4fa9e815c7198f8783628166d33596c505cf6df1d47c9d95f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Copied over from compare impl items, same issue: \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":"compiler/rustc_hir_analysis/src/check/compare_eii.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"682a07eeaff20275722f06b48e11dacc21a3941050c02547a72f9294ac620039"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(@lcnr): remove that after removing \u0060cause.body_def_id\u0060 from \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":"compiler/rustc_hir_analysis/src/check/compare_impl_item.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1837ea8da2e196d9d67ef1ab0ef02f02a2a6beca590ed7e5aef7239a00aa0a8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We manually instantiate the trait method here as we need \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":"compiler/rustc_hir_analysis/src/check/compare_impl_item.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"1697705b4b9c77fe7615eddfcc6e987b6c6c9f1b3f6891189698a7a0bf5413ab"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We\u0027d want to keep more accurate spans than \u0022the method signature\u0022 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":"compiler/rustc_hir_analysis/src/check/compare_impl_item.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"21b0974b13d409e3141293cc9b1d14ffa097a9d3ce3d4c9a9e0d2af35d797ff0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This has the same issue as #108544, but since this isn\u0027t breaking"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/check/compare_impl_item.rs"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"14b27141b9981f57d66276404ba2400b0a8f1f400685fe6fb171dd74fa106bfd"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //FIXME(RPITIT): Deny nested RPITIT in args too \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":"compiler/rustc_hir_analysis/src/check/compare_impl_item.rs"},"region":{"startLine":840}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc086b4460ef90692f55859d4ce8ea65bd8bb087f8b7555f7ceb72ef60e21f63"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: we could potentially look at the impl\u0027s bounds to not point at bounds that \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":"compiler/rustc_hir_analysis/src/check/compare_impl_item.rs"},"region":{"startLine":1235}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6b8c3418783c8dbadfc6563f6300cf7015953c1b85ec178f5bcdc93270d525a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: no tests trigger this. If you find example code that does \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":"compiler/rustc_hir_analysis/src/check/compare_impl_item.rs"},"region":{"startLine":1662}}}],"partialFingerprints":{"codehealthFindingId/v1":"e51bc8245588a268b524a2f2077dad847d9e1e556040944c7705ede796f9764b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Keep spans for function parentheses around to make this more robust. \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":"compiler/rustc_hir_analysis/src/check/compare_impl_item.rs"},"region":{"startLine":1878}}}],"partialFingerprints":{"codehealthFindingId/v1":"22f59a86924b56a117b8f651cb5c4a44ad71bebcb37ff491ac6d918c9daeb4e0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(chrisvittal) Clean up this function, list of FIXME items: \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":"compiler/rustc_hir_analysis/src/check/compare_impl_item.rs"},"region":{"startLine":1965}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5c9ba67fd8f40cb3a41fd02c5e24f568230bb07eda7e71f6248e4a05dfb3fa8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this is obviously suboptimal since the name can already be used \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":"compiler/rustc_hir_analysis/src/check/compare_impl_item.rs"},"region":{"startLine":2004}}}],"partialFingerprints":{"codehealthFindingId/v1":"906cd5fd2d14cb49181fd9449f70f4e2c33af10ac7602488d892d9bc360334a5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(generic_const_items): If possible extract the common parts of \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":"compiler/rustc_hir_analysis/src/check/compare_impl_item.rs"},"region":{"startLine":2328}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8cc2c5d30147d75ca0d01f3068bc3591c3abb967449e9e0380eeff96da8a220"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We should suggest making the fn \u0060async\u0060, but extracting \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":"compiler/rustc_hir_analysis/src/check/compare_impl_item.rs"},"region":{"startLine":2928}}}],"partialFingerprints":{"codehealthFindingId/v1":"a895ce2799b85cc82bf5e84a38225b0623f94ed46340cb084a8d19f534904fe9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this is not entirely correct, as the lifetimes from borrowed params will \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":"compiler/rustc_hir_analysis/src/check/mod.rs"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"8da7d92d9c2bf4aa84332e966b15faac43d256274f975dd7d55024017f93af14"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Consider moving this method to a more fitting 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":"compiler/rustc_hir_analysis/src/check/mod.rs"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"854b9bdb71a4755ce790b5af7ddf8983170ccbd320fd0eca556a64cc329bc631"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(-Znext-solver): This should be removed when we compute implied outlives \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":"compiler/rustc_hir_analysis/src/check/wfcheck.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"d14e5364375d3646cfdeb4787bf33399e9727db74540bdfcd8c453c2f17bf471"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Once we fix bevy, this would be the place to insert a warning \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":"compiler/rustc_hir_analysis/src/check/wfcheck.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"251f10710c556bf737b63e2d5a23de334c9e1798705b986f3ae6f4a88b610663"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#27579): what amount of WF checking do we need for neg impls?"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/check/wfcheck.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"defe0c4ae22bb2004435029e6a97ca3b374b51bb361dfc8e02b69b5b52a0559a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(jackh726): we can also warn in the more general case \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":"compiler/rustc_hir_analysis/src/check/wfcheck.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"afadfd18ffe651160504e04a1f5a7c3b428dac84ea9c815a3cc77d510520a676"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(compiler-errors): Perhaps there is a case where we need to normalize this \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":"compiler/rustc_hir_analysis/src/check/wfcheck.rs"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"497417356e88df06f4ddf88bc7d276610df96f1fca6376d195ee37b571a398d2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(gca_min_const_items): We *might* want to move this check to \u0060type_of\u0060, so we can \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":"compiler/rustc_hir_analysis/src/check/wfcheck.rs"},"region":{"startLine":1320}}}],"partialFingerprints":{"codehealthFindingId/v1":"50d9057a8519e0ff34a65c500b85d81b063b3c31800bdc188cf4c637594abf28"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(generic_const_exprs): This is incorrect when dealing with unused const params. \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":"compiler/rustc_hir_analysis/src/check/wfcheck.rs"},"region":{"startLine":1469}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad45b937cd2c1a80f6e587a18a18765f33c5710b0a5b57afceb7247fb324cdb5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: change this to \u0022function-like macro\u0022 and fix all 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":"compiler/rustc_hir/src/def.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"439e4af588c08e10de38ebb8c48b4ceb4899a257a307816dbeedd4bd23adc9ea"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: use Default instead when that trait is const stable. \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":"compiler/rustc_hir/src/hir.rs"},"region":{"startLine":3894}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4496f8018302e09943d7e66ca03a24fa1a79b20c9515d5688a485ee4450492a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(mcga) \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":"compiler/rustc_hir/src/intravisit.rs"},"region":{"startLine":1148}}}],"partialFingerprints":{"codehealthFindingId/v1":"e756bf6c510d2a977473a86b2675471051c033e855d77e56700a9ead7a1db2a1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: Subsumed by trait \u0060StructuralPartialEq\u0060, cannot move to removed until a library \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":"compiler/rustc_feature/src/unstable.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"41bd81e3d78c21ab56a0f71d7bde288af4ea3432c46d2869ad7996fb0eff1d59"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME setup implicit context in TLS before calling self. \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":"compiler/rustc_expand/src/base.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed184b62901e2eae8a85c8e90cd07297b3933be0ac1625aba158ac95ac78258e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME setup implicit context in TLS before calling self. \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":"compiler/rustc_expand/src/base.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aeede68a007f83556f86be2f19477c86c2fadc3ad3b93e165c642f321cf2abb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(nnethercote): you might expect \u0060ast::TyKind::Dummy\u0060 to be used here, but some \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":"compiler/rustc_expand/src/base.rs"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"28ce19c18ca9cd471268e380e79e51433eb1fbfd93883b51456c48c9be2d2898"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: The text above describes how this should work. Currently 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":"compiler/rustc_expand/src/base.rs"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"551a085d906f8ce794325ae962ee520f0333a67789de59d6829bdcccbb208968"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(jdonszelmann): avoid the into_iter/collect? \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":"compiler/rustc_expand/src/base.rs"},"region":{"startLine":914}}}],"partialFingerprints":{"codehealthFindingId/v1":"d60d63e3ea4320fc35adbd6f15819abae3537fb5f95b764af9f423d8cfb7fb07"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: currently this field is only used in \u0060is_none\u0060/\u0060is_some\u0060 conditions. However, 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":"compiler/rustc_expand/src/base.rs"},"region":{"startLine":1024}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae7724bd8cb81148b098ff6b0a65398b3783c3b8ddab30a25fdcc342be041755"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // Fixme: does this result in errors? \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":"compiler/rustc_expand/src/base.rs"},"region":{"startLine":1317}}}],"partialFingerprints":{"codehealthFindingId/v1":"61ad99732c8c2cac516284a42b642a4e6652f271c84bcd8de0bddfffcc94d1ef"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME -- We are using \u0060span\u0060 as the span of the \u0060|...|\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":"compiler/rustc_expand/src/build.rs"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc47ea560b05ed81ca5d412e227aca7e00c2b9c86de5dfa87da41c87289b5ebb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(SarthakSingh31): This points to the start of the declaration block 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":"compiler/rustc_expand/src/build.rs"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0632fdd3125342b1db1e349d2e67df44ac0fd6438f2df913c7c4f79916542ff"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(generic_const_items): Pass the generics as a parameter. \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":"compiler/rustc_expand/src/build.rs"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad9009b7be46fa28c529d64d9231f17b1abb81a7b911e0aaaf29dfe68271b46e"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: For unnamed fields placeholders should have the same visibility as the actual \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_expand/src/expand.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"4115dffb05be7ce406d3549909b1575544c50380fe0544de968d640e2743ad58"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Consider using the derive resolutions (\u0060_exts\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":"compiler/rustc_expand/src/expand.rs"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"b376418d17550bd258b856c088e62baee0a5c9c673ecbcc8d8e12a78d1e95e9b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Collect tokens and use them instead of generating \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":"compiler/rustc_expand/src/expand.rs"},"region":{"startLine":772}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a1c37485c60fca121e3278bc4ce3ba1452de97b2ee8f322b35f72a37ef536dc"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: pprust breaks strings with newlines when the type \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_expand/src/expand.rs"},"region":{"startLine":1888}}}],"partialFingerprints":{"codehealthFindingId/v1":"807ac944311ba7ea6f6778cfe2e65b5a8ee8ebdc3e892afb3d0d8e1566f85446"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: invocations in semicolon-less expressions positions are expanded as expressions, \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":"compiler/rustc_expand/src/expand.rs"},"region":{"startLine":2553}}}],"partialFingerprints":{"codehealthFindingId/v1":"d596202fd207ad4ed099d37e65fc737179d7c1e4934fbecc0b02e7d5d64b601c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Feature gating is performed inconsistently between \u0060Expr\u0060 and \u0060OptExpr\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":"compiler/rustc_expand/src/expand.rs"},"region":{"startLine":2594}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9e0558d3914b5ad83f190fc1b4b7807ce03170cf1c45c3d122d8c52fcba5709"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME should this limit be configurable? \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":"compiler/rustc_expand/src/expand.rs"},"region":{"startLine":2645}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7330c98d1e4024454791cc404cfc7cdfb1889d75cd43a629234a6422b06a116"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: #67062 has details about why this is sub-optimal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_expand/src/mbe.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"0418aef85f5f9f9adb52c597c690f2f6e8e9175030cee36d889aafda3116a97e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This is a subset of \u0060parse_external_mod\u0060 without actual parsing, \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":"compiler/rustc_expand/src/module.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"164c02041f134993d11a8cc2181b211efcf90a3fdf001831671b540f141fca97"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(154781) use a parsed attribute 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":"compiler/rustc_expand/src/module.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"07409209b2764680056398ab5b8d15b43f5f937056a75ae0a6e3c6567bab0f78"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We will need to preserve the original semicolon token 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":"compiler/rustc_expand/src/placeholders.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"a11a90267fec9fc53aa9108b4980cea5fd45558cffc7e8d5b5a97c88a1ba8967"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: The span of the \u0060-\u0060 token is lost 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":"compiler/rustc_expand/src/proc_macro_server.rs"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6a9ac84cafdd67fe619ef2553bb5f1d787fe936050968d6d6f168fd971c0f1c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: \u0060SyntaxContext\u0060 for spans from proc macro crates is lost during encoding, \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":"compiler/rustc_expand/src/proc_macro_server.rs"},"region":{"startLine":865}}}],"partialFingerprints":{"codehealthFindingId/v1":"330774a91508ece32bbe3b3c506b5a95c550be9dc59340fdec0ad2c83efd33a1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Factor out a per-arm \u0060Tracker\u0060 so that the \u0060Option\u0060 is unnecessary. \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":"compiler/rustc_expand/src/mbe/diagnostics.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"39950a8518f1e2afc58d99c5adecf5d7151be4d58452962edcabbdc5b699b6e3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Can this be factored out of the EOF case? \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":"compiler/rustc_expand/src/mbe/diagnostics.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5acfecd543cccbe6adb369a1f1b17720a32e153f8b62f7c4ab82242df238089"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(davidtwco): avoid depending on the error message text \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":"compiler/rustc_expand/src/mbe/diagnostics.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"7206a9c48f2e1ba8775b01906373be56ae148c4c44ffe77604c278215ee530a5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Error messages here could be improved with links to original rules. \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":"compiler/rustc_expand/src/mbe/macro_parser.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d7cd959a35f56b7ad9c5f530b977e24c8cdfb175b1acee22c1f6c947765155b"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // hacky, but speeds up the \u0060html5ever\u0060 benchmark significantly. (Issue \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_expand/src/mbe/macro_rules.rs"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"0378229acb32fc39b1d4ede6b2d7238a7627a3167e84e2525cfb47f6f4d19bdf"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Should I first scan suffix_first to see if \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":"compiler/rustc_expand/src/mbe/macro_rules.rs"},"region":{"startLine":1535}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6cc7f6f74d133029b44b8dc3ffd0eb501f07c0cfe8a4a1af67dae7e3021f66e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Canceling this error means we emit a worse message when encountering \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":"compiler/rustc_expand/src/mbe/metavar_expr.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ddab0215610bbf3b59dffe2467532330055ec29189b7822f3994f1cd19c4fdd"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#85708) - once we properly decode a foreign"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_expand/src/mbe/quoted.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e2d159aea6bfade3d3252396d7231db199b1ca0a2b915aa3455ed0a9c230cdb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Handle \u0060Invisible\u0060-delimited groups in a more systematic way \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":"compiler/rustc_expand/src/mbe/quoted.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecd1fd2fbc95160184829674a3ff101a6856a794f3cc128c93d827433ed2eb1a"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // Hack to force-insert a space after \u0060]\u0060 in certain case. \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_expand/src/mbe/transcribe.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"adb1dd03ffcde3052691d91fb423b95da0458231b296fd9eb57693356b1f95fa"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this really ought to be caught at macro definition time... 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":"compiler/rustc_expand/src/mbe/transcribe.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"19ac39ab6e514d590ab2f2fea4bba4561321cb26ef33e42e4900ed4489abbc82"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this really ought to be caught at macro definition \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":"compiler/rustc_expand/src/mbe/transcribe.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"67eb8957c165a76eb2022abbd7a509d34b108bd8767a5a16d297151fd0ebbfa7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Properly collect tokens for empty statements. \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":"compiler/rustc_expand/src/mbe/transcribe.rs"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"1798bffe99ebad51981c5c37db15dc4c7a0b8bd0a335f7ef77222da26cadcc0d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(macro_guard_matcher): \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":"compiler/rustc_expand/src/mbe/transcribe.rs"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9eeced5a67c2f590e889a50a64483c24d192f77c23fd9df8f3a32c1f51a685d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: Try to put the metavariable span into \u0060SpanData\u0060 instead of a side table (#118517)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_expand/src/mbe/transcribe.rs"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"a89196f5368fcd8399c40e1115960863592e08e6bdffc50deee6dc40f3700620"}},{"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":"compiler/rustc_errors/src/annotate_snippet_emitter_writer.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"f67643dcae57cd9ad7947795dde03e1ec61b9f5762a46d50c4ba94e30ebbe314"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(eddyb) use \u0060retain\u0060 on \u0060macro_backtrace\u0060 to remove all 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":"compiler/rustc_errors/src/emitter.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa76919bcc82ac21b332c8d5c0848a9b1fe35fbcfa4f2e8fb2d7cd4f8774f103"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: spec the JSON output properly. \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":"compiler/rustc_errors/src/json.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"776095a56f4eaa81f4661a9f14dfda389ca693618bdf617accc70e3f4c9a1ca8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(Centril, #69537): Consider reintroducing panic on overwriting a stashed diagnostic"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_errors/src/lib.rs"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0404e238c9548e044ec0c5e6fddf01d5a21823fc728c994694aec5c07b3eb01"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME(nnethercote) Do not use this! Currently only exists to support \u0060proc_macro::Help\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":"compiler/rustc_errors/src/lib.rs"},"region":{"startLine":1554}}}],"partialFingerprints":{"codehealthFindingId/v1":"004fa9b80778efd66f97d70ec7c6d9d536c498b816fa00a386d069f2191b325e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(eddyb) this doesn\u0027t belong here AFAICT, should be moved to callsite. \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":"compiler/rustc_errors/src/lib.rs"},"region":{"startLine":1635}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd0d694ad1ed5d33e3f5285320c1e241116f4c5336fa5f2de5044d0d40b54044"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME can panic 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":"compiler/rustc_errors/src/lock.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dcfd6b8f486bf9a4821f52396899c4cfabf461e3c3358f1c1f2c465e3771ba4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME can panic 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":"compiler/rustc_errors/src/lock.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f1e3fd6abab5eed36293f2d66dc464766deaaa069abe5ea9bf7ce093c2c1acb"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // hack: I don\u0027t know any way to write bytes to the captured stdout \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_errors/src/markdown/tests/term.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"5837a2a82ad679f6788f01a3eab744e17d4a3f71bd73e954cec4cd9aeaa76ce0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(madsmtm): for the rustc-private tools this is loaded from the sysroot that was \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":"compiler/rustc_driver_impl/src/allocator.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f8ebc4a4a11f29d1d2ffc7d2b47dda86342758cff36aea43849f4ee5bab8206"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: this check is extremely dumb, but we don\u0027t really need it to be smarter since this should only happen in the test suite anyway. \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_driver_impl/src/lib.rs"},"region":{"startLine":1469}}}],"partialFingerprints":{"codehealthFindingId/v1":"c38896462551ccaab8cd014bd6a6fd75e4b004ba74a95c160d10b7a6fe2508ea"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: These two functions will become unnecessary after \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":"compiler/rustc_data_structures/src/fx.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca8027eb283e4f8f77371e7abb9d69bc9320adee3e83cb3610e542c28f847a8b"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK(eddyb) we need to pad the PID, strange as it may seem, as its \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_data_structures/src/profiling.rs"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"97c3cb541cd304ca9f6e4ab98b451d38546c591bf16527725e200cb381eb3118"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // Hack up our own formatting for the duration to make it easier for scripts \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_data_structures/src/profiling.rs"},"region":{"startLine":946}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc66bb572621ed5063fd92382579db7504f623c056505072dcc69c78869bd36b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME(Zalathar): Unstably sorting paths is pre-existing behavior, but potentially wrong. \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":"compiler/rustc_data_structures/src/stable_hash.rs"},"region":{"startLine":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"00c136e3d5168ef05cd79264133c613a8cc9fd1bb768ce08ac12057dc206409d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#41710): what is the best way to model linear queries?"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_data_structures/src/steal.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e083b1ff40e1330a529926113fcb0ff86d0488603d930604c32d157cf23474d"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK(eddyb) manual impl avoids \u0060Default\u0060 bound on \u0060T\u0060. \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_data_structures/src/transitive_relation.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"726f76756db4ab9d4ad8fab690f334e20a21b7bbfb6e204af77573bbcce5ff34"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: actually make parallel and \u0060T: DynSend\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":"compiler/rustc_data_structures/src/sync/parallel.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae596aed0730c88043499552b4d29b5e67ea0a446cb1ce172749a5790c7d40cc"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Implements subset of HashMap 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":"compiler/rustc_data_structures/src/sso/map.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9c72cf348aa11d938ae9a46ceae702c4c8a4712a54367f734562419edcb4452"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: In HashMap most methods accepting key reference \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":"compiler/rustc_data_structures/src/sso/map.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4129ded5375c42fc43508b6153ae751c4f4909260f68a2b6d50d7b47bf9bb44"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Implements subset of HashSet 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":"compiler/rustc_data_structures/src/sso/set.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"95dc6f888fbae269269d92252a8c85c5f184917c2c51e57943370a765a1dd80d"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK(eddyb) manual impl avoids \u0060Default\u0060 bounds on \u0060K\u0060 and \u0060V\u0060. \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_data_structures/src/snapshot_map/mod.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"a691c28759b22035e04406234aebc1265383459220eb44cded43433aff80fbd2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //! FIXME: Move this to a more general place. The utility of this extends 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":"compiler/rustc_const_eval/src/util/compare_types.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"add615cf567ce573598c44a31a36fdbc98c25f0ee6166c591affc9c6b9a51849"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: most regions have been erased by the time this code runs. \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":"compiler/rustc_const_eval/src/util/type_name.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"aca7b478b07e8d8b19c61716bd5b1456cbee278327de3972f4ad99074a08558c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: we should just panic here. But currently such repr(transparent) \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":"compiler/rustc_const_eval/src/interpret/call.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8c8c5ebb10bb1f56df4e409ab218fee33b06610c18706a339426bf92113a6e5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This is *not* currently guaranteed by our ABI compatibility docs, but it is 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":"compiler/rustc_const_eval/src/interpret/call.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"579ec3ca2c235c5570013d7b07a20edac1dd8d5bb3cf9c4fe1c17a1bd748ece4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Depending on the PassMode, this should reset some padding to uninitialized. (This \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":"compiler/rustc_const_eval/src/interpret/call.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfc673bbd5a1cff54dd92e70dc1277d65a27506a17b31c2697729a6b9358c4a7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(splat): un-tuple splatted arguments that were tupled in typecheck \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":"compiler/rustc_const_eval/src/interpret/call.rs"},"region":{"startLine":870}}}],"partialFingerprints":{"codehealthFindingId/v1":"bef2b619a27d32c226c6d8dd8183b6ddd2beadc0e98946f9b72af5283879b119"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(fee1-dead) these could be variants of the UB info enum instead of this \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":"compiler/rustc_const_eval/src/interpret/call.rs"},"region":{"startLine":959}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc2d657a7e446a213ecbd5bce2958498ba3f8fd98ff39052853782ae74c665ef"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(explicit_tail_calls,#144855): does this match what codegen does?"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_const_eval/src/interpret/call.rs"},"region":{"startLine":1046}}}],"partialFingerprints":{"codehealthFindingId/v1":"72b94fd85e8b1968cf4a24242953dc0143b62219302651779a7db7d957097ea8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(explicit_tail_calls): \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":"compiler/rustc_const_eval/src/interpret/call.rs"},"region":{"startLine":1056}}}],"partialFingerprints":{"codehealthFindingId/v1":"38e24c79565270d12d5b01bd7bc959459f9c25f227585be4ffc3639a966ef58d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(explicit_tail_calls,#144855): revisit this once codegen supports indirect"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_const_eval/src/interpret/call.rs"},"region":{"startLine":1073}}}],"partialFingerprints":{"codehealthFindingId/v1":"73ab23bf95950f767e27778f3e3284845d396e3519db44a48492f1c142f909fd"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: ideally we wouldn\u0027t have to do this. \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":"compiler/rustc_const_eval/src/interpret/cast.rs"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddbfdcafb8d418228e3672a70549effe58c6258488c908cd3dda1484bc61987d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#149283): This is really hacky and is only used to hide type"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_const_eval/src/interpret/eval_context.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8173544d460615da398bdfe60db4841ece18a8eef15f00902db4b093b5c0ac6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(eddyb) this could be a bit more specific than \u0060AlreadyReported\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":"compiler/rustc_const_eval/src/interpret/eval_context.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"689760dd914c1ee95bb3bde3bb8c51c5f4aeec379d9c8c3480fc23e8997d03d8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: It would be nice to have the following redundant sanity check. \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":"compiler/rustc_const_eval/src/interpret/eval_context.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebce2332b3ca51f74ff9cb921d7a18c2ece7bd6cfa0a78635a6b7cc12756de16"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Accepting two copies of the same repr(C) type as compatible is currently not \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_const_eval/src/interpret/intrinsics.rs"},"region":{"startLine":791}}}],"partialFingerprints":{"codehealthFindingId/v1":"10cdd0d35882610f2c22d28c6bf30fab23efbb43a71f1dc78bfb95019d6dd910"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this should not be public, but interning currently needs access to 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":"compiler/rustc_const_eval/src/interpret/memory.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"f19b55367711b1dc67c80076a106775db7d45c5575402814d77c7ffc0488d3bd"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this should not be public, but interning currently needs access to 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":"compiler/rustc_const_eval/src/interpret/memory.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"a64237cb8eab404d2f6eb5e8d70c73a6169870dd579fd2dae5e40b75d7031c84"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(RalfJung): Should we have a cache 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":"compiler/rustc_const_eval/src/interpret/memory.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc5f8ed893ead5b51cb1738a8384045f80d7155909e5bbbaba4bafae9d4a3c7b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Until we have a clear design for the effects of align(N) functions \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":"compiler/rustc_const_eval/src/interpret/memory.rs"},"region":{"startLine":925}}}],"partialFingerprints":{"codehealthFindingId/v1":"879c88ba3c9a57df7b258e27448c894ff46d2bb120443da8f8e8beaa05adea04"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(translation) there might be pieces that are translatable. \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":"compiler/rustc_const_eval/src/interpret/memory.rs"},"region":{"startLine":1143}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a063d5e9e0fc0a61c0db210753bd0a3fae2988053c9e551789697d7e63b6f12"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: we look up both allocations twice here, once before for the \u0060check_ptr_access\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":"compiler/rustc_const_eval/src/interpret/memory.rs"},"region":{"startLine":1494}}}],"partialFingerprints":{"codehealthFindingId/v1":"767afe6f3efe618214356e6f62063365e2138babfd666aa2d571e280f3fb6978"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(oli-obk): at least print tuples and slices nicely \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":"compiler/rustc_const_eval/src/interpret/operand.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9e2e5db700b4ae89554baea5bdda24e252f95ff509b15513fc7852537e3d16a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: do some more logic on \u0060move\u0060 to invalidate the old location \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":"compiler/rustc_const_eval/src/interpret/operand.rs"},"region":{"startLine":847}}}],"partialFingerprints":{"codehealthFindingId/v1":"851bb9bbe7e71ce6fe04dbb5012a4e752fc0dd3c525397d84f29fc98ce6e227a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Working around https://github.com/rust-lang/rust/issues/54385"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_const_eval/src/interpret/place.rs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"8038d3d8c1c9f847563abb583697faf9e048dc068e363bd6ee5c90293a02373b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Working around https://github.com/rust-lang/rust/issues/54385"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_const_eval/src/interpret/projection.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"73d3f26d0583d030b072688403af305b76f9f5c87b8d3e801e44984a67344066"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: there are cases where we could still avoid allocating an mplace. \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":"compiler/rustc_const_eval/src/interpret/place.rs"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"97bd47d314b0e79419b65df7297c62d5b8ae9d76aa9e14ad92d314aa17afdbea"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: only used by miri, should be removed once translatable. \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":"compiler/rustc_const_eval/src/interpret/stack.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fe6623be8c7ebb0a30d3f1a6e46b7de73d165f15506d66f7dd69d3dca9e2a11"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: do we have to worry about in-place argument passing? \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":"compiler/rustc_const_eval/src/interpret/stack.rs"},"region":{"startLine":672}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e3931874de93bb81d4053168eaa3859227dc47e2976456f483ce1132b5a81e7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#73156): Handle source code coverage in const eval"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_const_eval/src/interpret/step.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"121650f6446e53cde8683ea3b05620b8f4016d74ccb628fc5283ecde8ced4eef"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: ensure some kind of non-aliasing between LHS and RHS? \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":"compiler/rustc_const_eval/src/interpret/step.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"bade3545eec71da5dc2c87b2e797fe42edec171319a4982aa67d48143871a637"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: we are skipping auto traits for now, but might revisit this in the future. \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":"compiler/rustc_const_eval/src/interpret/traits.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"bec9ca03ddcefc40e32601b99a55f50d07aa72083bc7c804dd59e5f065ba53a2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME this should be more descriptive i.e. CapturePlace instead of CapturedVar \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":"compiler/rustc_const_eval/src/interpret/validity.rs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"efbafecc71945f2df79c5110565508171a152fb60bfd58ea3b705aad6e6aa081"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: should we skip \u0060UnsafeCell\u0060 behind shared references? Currently that 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":"compiler/rustc_const_eval/src/interpret/validity.rs"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb2691abf51bce2f9ff5c5f4f98e8dee249b6be1e113ffc6969da709e59b48d8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Check if the signature matches \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":"compiler/rustc_const_eval/src/interpret/validity.rs"},"region":{"startLine":951}}}],"partialFingerprints":{"codehealthFindingId/v1":"38faa0afb9207f4d8224efb07b2fc5dd2a395a378d4f728acb936b1537399491"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(wesleywiser) This logic could be extended further to arbitrary structs 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":"compiler/rustc_const_eval/src/interpret/validity.rs"},"region":{"startLine":1411}}}],"partialFingerprints":{"codehealthFindingId/v1":"b41d6820229aa252ab22ac6f82cb806c0ee6b48672bb17c3e5626817abdfeab4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(pattern_types): check that the value is covered by one of the variants. \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":"compiler/rustc_const_eval/src/interpret/validity.rs"},"region":{"startLine":1508}}}],"partialFingerprints":{"codehealthFindingId/v1":"c747478d8d90d2f655ad929567f445159bdc798f1446eec3093af333edbb3a81"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(pattern_types): handle everything based on the pattern, not on the layout. \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":"compiler/rustc_const_eval/src/interpret/validity.rs"},"region":{"startLine":1516}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea6a71b59da7b0d9ed503d7e58d693bd2c76455c11238aac8321fa11a9b52c69"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: find a way to also check ScalarPair when one side can be uninit 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":"compiler/rustc_const_eval/src/interpret/validity.rs"},"region":{"startLine":1531}}}],"partialFingerprints":{"codehealthFindingId/v1":"e46096072bbd28fa0f2b2af039aad3f62146d1884c2a5c58576f710970d58a0e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: find a way to also check ScalarPair when one side can be uninit 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":"compiler/rustc_const_eval/src/interpret/validity.rs"},"region":{"startLine":1588}}}],"partialFingerprints":{"codehealthFindingId/v1":"582ae9bb6de349c7651c90df3ac3c082ef119ca9c6d536201a91061b17193db4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: remove the BackendRepr::Memory case when SIMD vectors are always passed as BackendRepr::SimdVector. \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":"compiler/rustc_const_eval/src/interpret/intrinsics/simd.rs"},"region":{"startLine":826}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdeee4239a814c146c4a917ac90529a089ce83f39854d6172922a616ad828e71"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Once #131787 is fixed, turn this delayed bug into an assertion."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_const_eval/src/const_eval/eval_queries.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"06e8dc8da42f78ca20b4a5c053c60b9f7add1e35b7a9975c8cae74a612b06a28"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: ensure validation always reports this and stop making interning care about 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":"compiler/rustc_const_eval/src/const_eval/eval_queries.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"67728c6d6d71eb3f203e93e0e5527e07dbc71988ed13e4abad21be66a9496c50"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: is it a problem to discard the error 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":"compiler/rustc_const_eval/src/const_eval/eval_queries.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"73a6356a5a6e1aa07eb5077b0222b97043eca946c23401afa457f3afc600fb13"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(fee1-dead): extract this one out and rename this query to \u0060fn_constness\u0060 so we don\u0027t need \u0060is_const_fn\u0060 anymore. \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":"compiler/rustc_const_eval/src/const_eval/fn_queries.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c1a74e2a4201d65b3c1d50af4bd4fa86553f6be8592d9b4fb5436ddfa30ae85"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We could be more decisive for (non-zero-sized) mutable statics, \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":"compiler/rustc_const_eval/src/const_eval/machine.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bdde522cec1b5a49b1215fb52e0335fc93bd376e861d55883d34afef3b91985"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We could revisit comparing pointers into the same \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":"compiler/rustc_const_eval/src/const_eval/machine.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"c01bee50f91e3ccb1e8b5d9cad4d1c2df060e516f429761a068d38882ceafb83"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: handle lifetime bounds \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":"compiler/rustc_const_eval/src/const_eval/machine.rs"},"region":{"startLine":744}}}],"partialFingerprints":{"codehealthFindingId/v1":"0207c50c74db72f079caa798d0aa8b37cb6a05b0f5bd2a445ac6f6a1b88d8e19"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(reflection): need a way to obtain non-exhaustiveness of a variant\u0027s fields. \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":"compiler/rustc_const_eval/src/const_eval/machine.rs"},"region":{"startLine":950}}}],"partialFingerprints":{"codehealthFindingId/v1":"a11b28b142afa40f60021aa66598010d7a4d75a597a74501209ff873dd2d9b27"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: use a proper span 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":"compiler/rustc_const_eval/src/const_eval/mod.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b1691af7849b5fc59a862ffab37fbfc8ab3491e36af59ee9219b9bb91bab1e4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(type_info): also provide the late bound vars to reflection \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":"compiler/rustc_const_eval/src/const_eval/type_info.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f2ca91ed4e2466c27c572f2ff0338c4ebba7cf56560681040730a7ffe959cc1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(splat): make these two fields into a single Option\u003Cu8/u16\u003E, or choose a stable encoding \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":"compiler/rustc_const_eval/src/const_eval/type_info.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0fd9cc5a611e27930850675501416e7ccafc5e052f59d8b0ba3e1c2eeb7e62c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(oli-obk): we could look behind opaque 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":"compiler/rustc_const_eval/src/const_eval/valtrees.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0ebc55f18f2b5aa1e73fc3240dadf941e0a908a615efd9d4b439a75ebeb0dd2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(oli-obk): we can probably encode closures just like structs \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":"compiler/rustc_const_eval/src/const_eval/valtrees.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"47cf638640d929a6696e5973e1b7e3ad0f0db814009c27418535b900832409dd"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME Need to provide a span to \u0060eval_to_valtree\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":"compiler/rustc_const_eval/src/const_eval/valtrees.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"e82b1635665a25a34cde0e1acbcdbda3f08bb5a2a2a2c41a84fa81e3af3a1a7b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(valtrees): Merge \u0060valtree_to_const_value\u0060 and \u0060valtree_into_mplace\u0060 into one 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":"compiler/rustc_const_eval/src/const_eval/valtrees.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"00078471be7226a2a881f6b3994f7a0a335686653d11b91b76c9f6a1eb92a4ae"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Does this need an example? \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":"compiler/rustc_const_eval/src/const_eval/valtrees.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"10518a9611b7692678cf91637f4ce611a99a5e5a8888f8b451494a03bd7d2351"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(type_info): No semver considerations for now \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":"compiler/rustc_const_eval/src/const_eval/type_info/adt.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c067228e5f51bdc090a2cbf9b24138b6f13577101706595352f0eccee249855"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(explicit_tail_calls): uhhhh I think we can return without return now, does it change anything \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":"compiler/rustc_const_eval/src/check_consts/check.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1dc8227bdb78bfdbc9ffb4debb168e184663587359a176e6d19340d4b876aac"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(reborrow): figure out if this is relevant at all. \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":"compiler/rustc_const_eval/src/check_consts/check.rs"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"015a4a01d4eaec11a409d2d0282c4d9d0dc733c02662c018a94362edd0b1cbcc"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const_trait_impl): Do we need any of this on the non-const codepath? \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":"compiler/rustc_const_eval/src/check_consts/ops.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"51d3c0541849b5ee5b665e0531edccbc4a74fc4aebda8adc25d537e4eafe6733"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const_trait_impl) revisit this \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":"compiler/rustc_const_eval/src/check_consts/ops.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"26c65d4a829ae8c46a167e8236c4b057c63a9862a95da2541273ce51463f1106"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const_trait_impl): we could perhaps do this for \u0060Iterator\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":"compiler/rustc_const_eval/src/check_consts/ops.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"134254613b1300c3dd796c9f85e7ac5e2973211dcc3534c0cbee7d55d716e960"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(coroutines): eventually we want to gate const coroutine coroutines behind 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":"compiler/rustc_const_eval/src/check_consts/ops.rs"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"40c69ec37a51d1639440f744e451cf6fec7e136d4d3039c22a34e5e7a8fa63fb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const_trait_impl): revert to span_bug? \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":"compiler/rustc_const_eval/src/check_consts/ops.rs"},"region":{"startLine":698}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0275bff5c003299177c7b8e7be609aa80e05c18b37803f0df0c006757902faa"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const_trait_impl): This API should be really reworked. It\u0027s dangerously general for \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":"compiler/rustc_const_eval/src/check_consts/qualifs.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbc78c60df684551dc180984d8a521b4674e3c2f389633119542dd1a0453d100"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Use \u0060mir::visit::Visitor\u0060 for the \u0060in_*\u0060 functions if/when it supports early return. \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":"compiler/rustc_const_eval/src/check_consts/qualifs.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"9950eeeff985a8fef7582f55b48c5877d46278530233dfc8505ee26f6eb5c5ab"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(mgca): Investigate whether using \u0060None\u0060 for \u0060ConstKind::Value\u0060 is overly \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":"compiler/rustc_const_eval/src/check_consts/qualifs.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"dafbbd9f38fd31b84d622377ecb355effbf1f7d0125674ce736727f928f23857"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Reconsider if accounting for borrows in drops is necessary for const drop. \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":"compiler/rustc_const_eval/src/check_consts/resolver.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"94f5d2eda277ee0e176ebd48ca3812f2b36a32c7a1f11bf40ec3e3a8e1f8849b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: if we ever support 512bit integers, this will be wrong! For such large 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":"compiler/rustc_codegen_ssa/src/base.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a4108d53ac0e40fc4ec19e91443378d59ab3859271957af7f01ea7f8d71b34a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We should be smart and show a better diagnostic 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":"compiler/rustc_codegen_ssa/src/base.rs"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"e53a6e4bb6595169d504eb54009db96e032f525dbf92b5737cbd052d347f47da"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME move to -Zlink-only half such that each_linked_rlib_file_for_lto can be moved there too \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":"compiler/rustc_codegen_ssa/src/base.rs"},"region":{"startLine":1185}}}],"partialFingerprints":{"codehealthFindingId/v1":"09dc24913352ac926a1d57b088a87dda07fdf6b830439c3968bf0e33d5061d20"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME Remove check for foreign functions once #[link_name] on non-foreign \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":"compiler/rustc_codegen_ssa/src/codegen_attrs.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ac36be5f9b593f046bbaa092ed4e52faebf9f6777e12d1f7fe559cad0bd98d9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME remove this comment once #[no_mangle] on foreign items is a hard 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":"compiler/rustc_codegen_ssa/src/codegen_attrs.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"0009ebeb4f2b657901555ec656862219e70e105e1f6b268b0665c79684237a0c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(mw): Anything that is produced via DepGraph::with_task() must implement \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":"compiler/rustc_codegen_ssa/src/common.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd4d4de3e43e8a3da6d03f981fe7819f083383895da5d0bba5cf2ca91b7faa12"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(arbitrary_self_types): This is likely broken for receivers which \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":"compiler/rustc_codegen_ssa/src/meth.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cfa88b99625d05d405dcdbd89774f97aa2e8340aee316d23b3361f1a35ad44e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME emit an error for unknown features in the target spec like \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":"compiler/rustc_codegen_ssa/src/target_features.rs"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a007e9e9865cad93afeb13e8397ee86ac50b8da82780567f5d61c6331ce56c2"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: rustdoc would like to pretend that we have all the target features, so we \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/target_features.rs"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"566f45aa7aed01e5312622694f09bc5e57fe12fec5e0f2da2c3f303af77fc096"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(eddyb) find a common convention for all of the debuginfo-related \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":"compiler/rustc_codegen_ssa/src/traits/backend.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a1e48cb35531fc6ab5a63951df031d81050ad936f9bfc6381da35ef35a7f05a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(eddyb) find a common convention for all of the debuginfo-related \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":"compiler/rustc_codegen_ssa/src/traits/debuginfo.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"2124bbb2f420e59e21bce22298def19852549a1e88543f05ef44dc626512925c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(eddyb) find a common convention for all of the debuginfo-related \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":"compiler/rustc_codegen_ssa/src/traits/debuginfo.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"21d7ee9c7a2278db5a2ee01809452539841e7df562bd93aab882cefc4f771d16"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(eddyb) find a common convention for all of the debuginfo-related \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":"compiler/rustc_codegen_ssa/src/traits/debuginfo.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"67974262507927396ac8ca12debb0d2294e20c923a3a6a25c77d3eee48389372"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(eddyb) find a common convention for all of the debuginfo-related \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":"compiler/rustc_codegen_llvm/src/debuginfo/mod.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cbb6de3fb0abaa31d93a2b83f0a531e707de1be9bd943c82e876125e6919c70"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(eddyb) find a common convention for all of the debuginfo-related \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":"compiler/rustc_codegen_llvm/src/debuginfo/mod.rs"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"70b3ab9fb91981b6efb2e4b7855c3cad4da6a8019c835802b77ba9b1d09442c8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(eddyb) find a common convention for all of the debuginfo-related \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":"compiler/rustc_codegen_gcc/src/debuginfo.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"45f0a7161b4877abde8c031951fc12500ba68bb4228ab00b6291b80a1f954143"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(eddyb) replace uses of this with \u0060append_sibling_block\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":"compiler/rustc_codegen_ssa/src/traits/builder.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7ab451f1446fa012a5bd8dc8c8084a6bead9cfd06debf186b1c83f59c55e4ad"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This implementation was designed around LLVM\u0027s ability to optimize, but \u0060cg_llvm\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":"compiler/rustc_codegen_ssa/src/traits/builder.rs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"a604ccfa481e9e09429ae31e321c160c738302381f7dea1ba2087254de135f13"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK(nox): This is inefficient but there is no nontemporal memcpy. \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/traits/builder.rs"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"060c200b0ac78549d791298121f0929be8e4df438b0e7b2374d3f8a3b70c0294"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(rustc_scalable_vector/stdarch_aarch64_sve): Scalable vectors aren\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":"compiler/rustc_codegen_ssa/src/traits/builder.rs"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"2514440bf193802d203d7b9aa510224ec499f4c008ac481a5ca65662d4ee7168"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: Maybe do something smarter for Ref types too? \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":"compiler/rustc_codegen_ssa/src/traits/builder.rs"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"409619937e8bf0cc40fe44e5a052b5361cb1fa702fd3d922a8f4c34f328a611c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(eddyb) perhaps move some of this logic into \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":"compiler/rustc_codegen_ssa/src/mir/block.rs"},"region":{"startLine":677}}}],"partialFingerprints":{"codehealthFindingId/v1":"59671139260c8655b9f6215815cd896ff682b8e538f7b61c9306cc1c29249ebd"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(eddyb) perhaps move some of this logic into \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":"compiler/rustc_codegen_cranelift/src/abi/mod.rs"},"region":{"startLine":778}}}],"partialFingerprints":{"codehealthFindingId/v1":"19599e1a22b9ed730761069423f42c97bffc66ca8e6a89fff2b25349442203c8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME either add unwind support to codegen_llvm_intrinsic_call or replace usage of \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":"compiler/rustc_codegen_ssa/src/mir/block.rs"},"region":{"startLine":1152}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f5fd5150bb8cfe5a1df06ef0ae323c2bc6bacdb51a0d8003006e0012309f756"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(eddyb) avoid computing this if possible, when \u0060instance\u0060 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":"compiler/rustc_codegen_ssa/src/mir/block.rs"},"region":{"startLine":1201}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea80c7a41fba4c72969e5e109ffa2bc59695c083c19d5fed038ebd45175611ef"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(splat): un-tuple splatted arguments in codegen, for performance \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":"compiler/rustc_codegen_ssa/src/mir/block.rs"},"region":{"startLine":1247}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c27cf525e3c43d66e06e116e848ed3d4113550002d695a60c8b3d3535c21027"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(splat): un-tuple splatted arguments in codegen, for performance \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":"compiler/rustc_codegen_cranelift/src/abi/mod.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a001832ff9dc9e0a47d280ed75c17b4cf665f10cf239b105edbad58effde2a0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(eddyb) rename this to \u0060eh_pad_for\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":"compiler/rustc_codegen_ssa/src/mir/block.rs"},"region":{"startLine":2194}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9e6bf34462f768597389b013a7fd97419a8d938ded96b5e250053652ad277ef"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(eddyb) rename this to \u0060eh_pad_for_uncached\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":"compiler/rustc_codegen_ssa/src/mir/block.rs"},"region":{"startLine":2205}}}],"partialFingerprints":{"codehealthFindingId/v1":"d91ede429f20e6e2d43d442fe8c4b4a5f8f085800034dca2372f66032e4f0037"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(eddyb) rename \u0060llbb\u0060 and other \u0060ll\u0060-prefixed things to use 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":"compiler/rustc_codegen_ssa/src/mir/block.rs"},"region":{"startLine":2412}}}],"partialFingerprints":{"codehealthFindingId/v1":"f77b0c75e06759a22e300a08a18548f310408e0a7d05a9a07c319f73f2af2677"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(oli-obk): replace the magic const generic argument of \u0060simd_shuffle\u0060 with 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":"compiler/rustc_codegen_ssa/src/mir/constant.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc1568796665221d5fe8c2537cdbb8bd5e8589d9d0943b0d03014bd2bd032597"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(eddyb) use smallvec 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":"compiler/rustc_codegen_ssa/src/mir/debuginfo.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"c68feadacf9957dce2b7ca00055ab5ea020f4039572f5ae08d4d086c814de1cd"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#68817) use \u0060llvm.dbg.value\u0060 instead,"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/mir/debuginfo.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"f51c5fc416d8d671f6a517e0e399c6140b816ebf173d78e4740d34ef0e1b8d27"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(eddyb) is this really 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":"compiler/rustc_codegen_ssa/src/mir/debuginfo.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"0014bfc6694c1733ffd5e84a6f1de669753dd258bbea296873d63e48439c2d4c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(eddyb) shouldn\u0027t \u0060ArgumentVariable\u0060 indices \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":"compiler/rustc_codegen_ssa/src/mir/debuginfo.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"5194a97b28889353af1465c9ba58cb3ec6c89269c7ad4a905072773614375ff2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(eddyb) take \u0060whole_local_var.source_info.scope\u0060 into \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":"compiler/rustc_codegen_ssa/src/mir/debuginfo.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2448d5ff6c133104f77ee4a88f7f63d0d0dd0b3c7355e698bf9976adc752113"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(eddyb) is this \u0060\u002B 1\u0060 needed at all? \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":"compiler/rustc_codegen_ssa/src/mir/debuginfo.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd84a7a3080adc53d80ae94d0b5d400534663ba095079ae51052e9a1b76ee210"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(eddyb) these are scalar components, \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":"compiler/rustc_codegen_ssa/src/mir/debuginfo.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ec1a400b9a747c6afbaa2af80f6ab4a7fbd579045e4fd042bae11d87114bce4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(eddyb) add debuginfo for unsized places too. \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":"compiler/rustc_codegen_ssa/src/mir/debuginfo.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cbe4fcd47eb18b29b98d847656636a3a0ef04292bb57d55059c5559d76d5ed1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(eddyb) shouldn\u0027t \u0060ArgumentVariable\u0060 indices be \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":"compiler/rustc_codegen_ssa/src/mir/debuginfo.rs"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"240fd2f15b6fe94835ede9fd3adf6574bab4ad8c12d5065f4d4521374c48cebd"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(eddyb) take into account that arguments always have debuginfo, \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":"compiler/rustc_codegen_ssa/src/mir/debuginfo.rs"},"region":{"startLine":749}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c10509aa3096335027d8371afd29b0c4ab0cd7d592a6b72ee379f968782bca0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: there\u2019s multiple of this functions, investigate using some of the already existing \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":"compiler/rustc_codegen_ssa/src/mir/intrinsic.rs"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0bff2f63f63ef4364b38c6f9cd8cc71aae28f951e693d7fc4bb6f2f59c08973"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#115215): After #115025 get\u0027s merged this might not be necessary"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/mir/locals.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"d623ed73852d18c0ff3da7849d702b1a5a9bf910daffabfbb1a3543991c01056"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#112651): This can be changed to an ICE afterwards."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/mir/locals.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bcbaa1d0954328224496f8ce2db59ebecf85553ef733256531d45a24f797775"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(eddyb) rename \u0060llbbs\u0060 and other \u0060ll\u0060-prefixed things to use 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":"compiler/rustc_codegen_ssa/src/mir/mod.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"f26ae59ad1f6253f9f48e39e37e248da462e68d9895c0e8f5799648e10b8dfbb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(eddyb) rename this to \u0060eh_pads\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":"compiler/rustc_codegen_ssa/src/mir/mod.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"c987b297ea6f003607edc6c7fc9573590d6f1cf5d5ff214f31033dbb1792b8a7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: Since the removal of unsized locals in \u003Chttps://github.com/rust-lang/rust/pull/142911\u003E,"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/mir/mod.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"f82cc335203fc37823afbe5b376c7da01235e23e56b17cc058ba0d3e50ac3ba0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We might want to integrate the nop_landing_pads analysis into mono reachability. \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":"compiler/rustc_codegen_ssa/src/mir/mod.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cd36954a034c1880e279db0e4e49457b161538e77f7dee4b19b05f349462efb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: These empty unreachable blocks are *mostly* a waste. They are occasionally \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":"compiler/rustc_codegen_ssa/src/mir/mod.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ed39d10a7622597f835bc7d32e648d647c28760eeb51e1aada2f0246a7ab5a5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Move this function to mir::transform when post-mono MIR passes land. \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":"compiler/rustc_codegen_ssa/src/mir/mod.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"1868a5103bac3634181be2e060d1d87e860e0d05f4b8b7563dcef24ee2265015"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(splat): re-tuple splatted arguments that were un-tupled in the ABI \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":"compiler/rustc_codegen_ssa/src/mir/mod.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"df6bf78c3edfdd966f22cfdf74058ff1b7ecd8ffddf2792ebf4bfa3a77d56734"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: support unsized params in \u0022rust-call\u0022 ABI \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":"compiler/rustc_codegen_ssa/src/mir/mod.rs"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6d3e09b25edbab232b0564f28a98957cbb9845497f6f210f4f8bdcf0d789410"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(eddyb): We should figure out how to use llvm.dbg.value 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":"compiler/rustc_codegen_ssa/src/mir/mod.rs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"e081d9e8bc75dc334bae494c62c311202e7308e04c63a0ea4d5ea33c62c7c8d9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: lifetimes \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":"compiler/rustc_codegen_ssa/src/mir/mod.rs"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c6fbd36a2ebcce8d01b064fda69be633d038b7ae3de7b00801e785b67255cd8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: there is currently no way of defining a weak symbol in inline assembly \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":"compiler/rustc_codegen_ssa/src/mir/naked_asm.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"55743f5a581041e0572372b21f541a63c43055c1d2c02d2b71334d765b306a60"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: actually this causes a SIGILL in LLVM \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":"compiler/rustc_codegen_ssa/src/mir/naked_asm.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2a958a0f6ac39e69178e9019d100891ac215bf7ee7ef926e6c4251eadf9820f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: start a section. \u0060.csect\u0060 is not currently implemented in LLVM \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":"compiler/rustc_codegen_ssa/src/mir/naked_asm.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e633267052846b0cc4c0baa7c105b2cda0bb62818dbc8ba5f89114024dd05a1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME apparently \u0060.globl {asm_name}, hidden\u0060 is valid \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":"compiler/rustc_codegen_ssa/src/mir/naked_asm.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"207b92c4a3a9ab6d2420ec21878f5efd29165a7a34942c5374d345956b03dba9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: end the section? \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":"compiler/rustc_codegen_ssa/src/mir/naked_asm.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb9ddc505aa79c0b3f5d77685e32e579629779407c0c80f85548645913c50578"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: If we ever get range assume operand bundles in LLVM (so we \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":"compiler/rustc_codegen_ssa/src/mir/operand.rs"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"81210c3a44b4a042bf9a6835970d1fb3298fbfb4ffac9a6c1ae7c68891359c64"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(eddyb) pass something else for the name so no work is done \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":"compiler/rustc_codegen_ssa/src/mir/place.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"33d4678aeeb0585946d99c32228d4fd78137fffbf6e1e9c3d6b792f801333d27"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(eddyb) pass something else for the name so no work is done \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":"compiler/rustc_codegen_ssa/src/mir/place.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c3eb6d0a185514ec4de6aeea9c0847b810c66681b4221c476d719fe5aeb6c18"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(rustc_scalable_vector/stdarch_aarch64_sve): Scalable vectors aren\u0027t actually sized, \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":"compiler/rustc_codegen_ssa/src/mir/place.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f34aa8d924f0d2afd45e90229508b291d5b88b472e6b8e92b67e313b39b7652"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME why is this peeling at all? The LLVM type should be the same for 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":"compiler/rustc_codegen_ssa/src/mir/place.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"caaef26ce061bdfcd79462f8d397b88f91ff32c4eab11f3b07c508588c4fce51"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Nothing should be looking at the *array* inside a \u0060repr(simd)\u0060 type, \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":"compiler/rustc_codegen_ssa/src/mir/retag.rs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"916f3ad35e200f2a919dad0af46afe855d09f7da3bca788ff3180b316c63f650"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: consider not copying constants through stack. (Fixable by codegen\u0027ing \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":"compiler/rustc_codegen_ssa/src/mir/rvalue.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4c84f71c03933e9cf79bb63c2a23d75c4e3625bcf793a2e9d248839edb89f20"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this exposes the provenance, which shouldn\u0027t be necessary. \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":"compiler/rustc_codegen_ssa/src/mir/rvalue.rs"},"region":{"startLine":1125}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8e1480b1e93a6650e78b5c2e9bca6fb1c3e62af339d62684ec3ebde16944687"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this exposes the provenance, which shouldn\u0027t be necessary. \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":"compiler/rustc_codegen_ssa/src/mir/rvalue.rs"},"region":{"startLine":1133}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd94fb0efd1c29512ca421e6d72a6eaa5fcab3681993f7ac0931c11a1b81c004"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(eddyb) find a place for this (or a way to replace 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":"compiler/rustc_codegen_ssa/src/debuginfo/mod.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"02b2ab1753e0d8d7e229a649bfe555e4e86918cd4e03ea532722d8c773530786"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(wg-debugging): implement CPP like printing for patterns. \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":"compiler/rustc_codegen_ssa/src/debuginfo/type_names.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"e71f5ba170dbd229edf13384f02174c3142301bf9760abfec784c1336f6018ca"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(splat): should debuginfo be de-tupled in the callee (and caller)? \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":"compiler/rustc_codegen_ssa/src/debuginfo/type_names.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d1dab205efe12adb8a392707ff7be6789d7f454688c4ec55482b536926e76dd"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(async_closures): This is probably not going to be correct w.r.t. \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":"compiler/rustc_codegen_ssa/src/debuginfo/type_names.rs"},"region":{"startLine":791}}}],"partialFingerprints":{"codehealthFindingId/v1":"cee81eae04a023d4b2fe33d9a6d73c094e657d652e1a8ec187779d2c96fab806"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(madsmtm): Remove once \u0060object\u0060 supports 32-bit ARM relocations: \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":"compiler/rustc_codegen_ssa/src/back/apple.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6ee1a55fe6b21d18312b3dbfecdf74e5e4c5f7448da2f0e5d5e40805c8360b2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(madsmtm): Make this a lint, to allow deny warnings to 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":"compiler/rustc_codegen_ssa/src/back/apple.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"020906b6228bb213acf2ecb6ad98899d5153862ac58a1b7b763cde70b70e893d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: when support for #[link_name] is implemented, ensure that the import names \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":"compiler/rustc_codegen_ssa/src/back/archive.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d412f1fff9b50248f2a3f6c7e1111022d0e946c943c7a915033c81db7bd07aa"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: implement \u0060-Clink-self-contained=\u002B/-unwind,\u002B/-sanitizers\u0060, move the shipped libunwind \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":"compiler/rustc_codegen_ssa/src/back/link.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"291ce0b435d9f03d3f2fd239f5a3c57643e352e9bb43e9e6954b9522c5341b38"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: On AIX this also has the side-effect of making the list of library search paths \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":"compiler/rustc_codegen_ssa/src/back/link.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d7976de811d9783b485cd39612ce07ce81f26813cb2319c3d4ca9292602d6ac"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Tracked by https://github.com/rust-lang/rust/issues/136113"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/back/link.rs"},"region":{"startLine":1128}}}],"partialFingerprints":{"codehealthFindingId/v1":"e36e0e727038530cedc03a046f2fcee075496bd95504e79bc8bbea73746f872a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This is a real warning we would like to show, but it hits too many crates \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":"compiler/rustc_codegen_ssa/src/back/link.rs"},"region":{"startLine":1142}}}],"partialFingerprints":{"codehealthFindingId/v1":"d508d2eabf6ca68edcdda13fdfff9fc00887f1323223ce3194129c69247e637b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: maybe check that binutils is older than 2.40 before downgrading this warning? \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":"compiler/rustc_codegen_ssa/src/back/link.rs"},"region":{"startLine":1165}}}],"partialFingerprints":{"codehealthFindingId/v1":"63164481f4c8529ce2a7d77a64c29302a6840ea923b3eaf3f8b95324c65677dd"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: AIX\u0027s strip utility only offers option to strip line number information. \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":"compiler/rustc_codegen_ssa/src/back/link.rs"},"region":{"startLine":1614}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cbb81296953b80e1b91c28c1f44d98c51989c772aaab84a1c485c0684d8b76d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME deduplicate with add_dynamic_crate \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":"compiler/rustc_codegen_ssa/src/back/link.rs"},"region":{"startLine":2057}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d65e4f8117513a0d5af8fa019e51e489bc8d5e9c2cdbd7184ef28c52cc467a5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Find a better heuristic for \u0022native musl toolchain is available\u0022, \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":"compiler/rustc_codegen_ssa/src/back/link.rs"},"region":{"startLine":2368}}}],"partialFingerprints":{"codehealthFindingId/v1":"32fb311123518ebbd71b809a02a21ab24017f184eeff51786869d443fdc9d757"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: we are currently missing some infra here (per-linker-flavor CRT objects), \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":"compiler/rustc_codegen_ssa/src/back/link.rs"},"region":{"startLine":2394}}}],"partialFingerprints":{"codehealthFindingId/v1":"c57963c7dd8c9c5aff61d1522f14c7b636f9b8ea312ed0b5094206d342f5fe44"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: Determine where exactly these args need to be inserted. \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":"compiler/rustc_codegen_ssa/src/back/link.rs"},"region":{"startLine":2428}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbc2f2bf878cead294c89bc8b43fe526c277d5105b5a0d7c1d1da8ed2a335466"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: Determine where exactly these args need to be inserted. \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":"compiler/rustc_codegen_ssa/src/back/link.rs"},"region":{"startLine":2469}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b2b27fd599a8975f51fc7b375eab381c5270c014105beb62b0de53841cd0fdf"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: Determine where exactly these args need to be inserted. \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":"compiler/rustc_codegen_ssa/src/back/link.rs"},"region":{"startLine":2475}}}],"partialFingerprints":{"codehealthFindingId/v1":"20960db847f21b78b84591b9ea25ae548be7892df0799cd8ca0a378684c4ae8d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: Determine where exactly these args need to be inserted. \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":"compiler/rustc_codegen_ssa/src/back/link.rs"},"region":{"startLine":2501}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8af6d0a3abc34fca3091858eb2667134a848ea981078578491f077ffb8e8063"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME (#2397): At some point we want to rpath our guesses as to"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/back/link.rs"},"region":{"startLine":2783}}}],"partialFingerprints":{"codehealthFindingId/v1":"21ec4ac10ced31b1ebd3be832db3638839ec18c8e5572ae48eb1b7970920b120"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: In practice built-in target specs use this for arbitrary order-independent options, \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":"compiler/rustc_codegen_ssa/src/back/link.rs"},"region":{"startLine":2965}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d0bbc86aea16175670b30b8be10545380d6ed78646116d94dda2350890d15f4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Support more fine-grained dead code removal on Solaris/illumos \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":"compiler/rustc_codegen_ssa/src/back/link.rs"},"region":{"startLine":3032}}}],"partialFingerprints":{"codehealthFindingId/v1":"f93887d51eeb86ab56c0cd9a66a0d8e0e0712617481fdf8bf026beb56a66ae94"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Built-in target specs occasionally use this for linking system libraries, \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":"compiler/rustc_codegen_ssa/src/back/link.rs"},"region":{"startLine":3162}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1fe3224fdcd4c34321e81fe6ed0ee52668b2cb228237b82639dc4e20b01e852"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: In practice built-in target specs use this for arbitrary order-independent options. \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":"compiler/rustc_codegen_ssa/src/back/link.rs"},"region":{"startLine":3203}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d1503b90d83b24346f2320cad8dddd8cdadd533337e80746352f56304fe7018"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: \u0060dependency_formats\u0060 can report \u0060profiler_builtins\u0060 as \u0060NotLinked\u0060. \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/back/link.rs"},"region":{"startLine":3581}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed4424395dfcecb2b62785c73f4f8bf6515dd391f08cb2c7800a754df4cdd794"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Merge this function to \u0060add_upstream_rust_crates\u0060 so that all native libraries \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":"compiler/rustc_codegen_ssa/src/back/link.rs"},"region":{"startLine":3660}}}],"partialFingerprints":{"codehealthFindingId/v1":"07291599443f383f2771fbcc29f3fd98ced8ad757067dd40ca52e73f65f4596f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(madsmtm): Parse the SDK version from the SDK root 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":"compiler/rustc_codegen_ssa/src/back/link.rs"},"region":{"startLine":3947}}}],"partialFingerprints":{"codehealthFindingId/v1":"efd4346b9ec0377358c011accb2941a94aeccd92adeaff23412d00c0ee8cbfa7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(madsmtm): Make this more robust (maybe read \u0060SDKSettings.json\u0060 like Clang does?). \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":"compiler/rustc_codegen_ssa/src/back/link.rs"},"region":{"startLine":4067}}}],"partialFingerprints":{"codehealthFindingId/v1":"3833a0aa68a792e1be141bf01bcd4b9cacd5210d2cd1c66c788047e53f7bf212"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Move this to \u0060fn linker_with_args\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":"compiler/rustc_codegen_ssa/src/back/linker.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"f51a4b78cad09e787b4e892cb4a152a7df0772aaf4b5a337bab2e3d4d92c88c3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Move \u0060/LIBPATH\u0060 addition for uwp targets from the linker construction \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":"compiler/rustc_codegen_ssa/src/back/linker.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"17839e6b4402d6a88881a331aa63ad2ed632b2918a976e4d55f8a71e68f367eb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(81490): ld64 doesn\u0027t support these flags but macOS 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":"compiler/rustc_codegen_ssa/src/back/linker.rs"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdf1f998e99f9db9bd8ae477fa354173f57c52657d6160a8cd76cf1ed1c2b47c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Switch to using \u0060#[link]\u0060 attributes in the \u0060libc\u0060 crate \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":"compiler/rustc_codegen_ssa/src/back/linker.rs"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"7823e554a089c46ff7948b8a01e866969626dc912e734b952958f17832b39f38"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(81490): ld64 as of macOS 11 supports the -needed_framework \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":"compiler/rustc_codegen_ssa/src/back/linker.rs"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"fec41042b9cf918c72c60c109312a0d536d8d0986fc673c91a626e4cafac487f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Use CreateExportList utility to create export list \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":"compiler/rustc_codegen_ssa/src/back/linker.rs"},"region":{"startLine":1503}}}],"partialFingerprints":{"codehealthFindingId/v1":"68973427372fafff219173c63bf1e9e1d7c3b8b1fd7ecc98d138c17d0b0191a2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: use llvm-nm to generate export list. \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":"compiler/rustc_codegen_ssa/src/back/linker.rs"},"region":{"startLine":1597}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e791255356d5aaf0b763d4a3ad81925e8fa46b5fe13a9c08e0a15b91a02df07"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME use the correct export kind for this symbol. override_export_symbols \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":"compiler/rustc_codegen_ssa/src/back/linker.rs"},"region":{"startLine":1676}}}],"partialFingerprints":{"codehealthFindingId/v1":"11c388e293c8fcc7c15d67b32fdb3a1d2fd1d6ccda32f56fc0761a5c04dd19f9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: The length of data here is not guaranteed to fit in a u32. \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":"compiler/rustc_codegen_ssa/src/back/metadata.rs"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cbdc21a426b605a661a5061f0eab5ba0b16b52c2c6a233e8d7d6701db143d47"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(madsmtm): Certain other targets also include a version, \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":"compiler/rustc_codegen_ssa/src/back/mod.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d07c890aaea9a60adf29a422b04e04e6c7be7e07c55e55d2fdd3eb3c0a7b48b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this is mostly a copy-paste of \u0060DefaultMetadataLoader::get_rlib_metadata\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":"compiler/rustc_codegen_ssa/src/back/rmeta_link.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"68a2a015a6c61188838b4410267063eac7390fde0c8ee20c9b92c5a273bb8357"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Sorting this is unnecessary since we are sorting later anyway. \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":"compiler/rustc_codegen_ssa/src/back/symbol_export.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad43a1b0c30bc48ae16fd9f508c51700e8e165c5db65f2164f34d57c8f83a00c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(jdonszelmann) don\u0027t do a substring match 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":"compiler/rustc_codegen_ssa/src/back/symbol_export.rs"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"b539c0f3215693933ce8a30b456f2d6018235cb82925b7c83c217bd2e0521378"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(workingjubilee): why don\u0027t we know the convention 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":"compiler/rustc_codegen_ssa/src/back/symbol_export.rs"},"region":{"startLine":757}}}],"partialFingerprints":{"codehealthFindingId/v1":"2835fb26324b4569775e06b32f111651fe405d34cad3406088e53ff49f94683b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME cache local pre-LTO bitcode \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":"compiler/rustc_codegen_ssa/src/back/write.rs"},"region":{"startLine":2149}}}],"partialFingerprints":{"codehealthFindingId/v1":"7306f2b9b1ccea6ed3c26da608f3b35484a3c8ae102a15b74cfb449ebed1950a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME include pre-LTO bitcode in workproduct 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":"compiler/rustc_codegen_ssa/src/back/write.rs"},"region":{"startLine":2185}}}],"partialFingerprints":{"codehealthFindingId/v1":"edc0b1ac653e91afb61465462c28bf468733f899f2e1d500557ea35f72b08976"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME add separate incr comp session for post-LTO outputs to use during link step \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/back/write.rs"},"region":{"startLine":2186}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f603b1e507845c0f6d304ed0cbd0bf90586058eeaa10b7c5bbbbe99a317d256"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: when we add support for ordinals, figure out if we need to do anything \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":"compiler/rustc_codegen_ssa/src/back/link/raw_dylib.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b4eaa0846ab77106b1a6c7389343a416c8cd5bae9ef8044cb217b11ec9bff29"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(llvm): LLVM \u003C23 does not recognize \u0060x30\u0060 as a register name. \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":"compiler/rustc_codegen_llvm/src/asm.rs"},"region":{"startLine":760}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d8ba49e2650a9c126409ff972faf66a6f5e10e7485205f8d70845d11c2f0787"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(llvm): LLVM \u003C23 does not recognize \u0060r14\u0060 as a register name \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":"compiler/rustc_codegen_llvm/src/asm.rs"},"region":{"startLine":795}}}],"partialFingerprints":{"codehealthFindingId/v1":"7be2c07041dde1863dc2b7de2d58cc743a50705f3f20aafede77ed9333627758"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: none of these functions interact with source level attributes. \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":"compiler/rustc_codegen_llvm/src/attributes.rs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"a68f7a090c4d5390f8ff05a852582e1aabf0c5a281625c48185ffd8a3e88cedc"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(jchlanda) If it ever becomes necessary to ensure that all compiler \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":"compiler/rustc_codegen_llvm/src/base.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"4646f708ca95694ffb0023e38c1963a098118460189212a4dcde897e9526b72a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // to manually do that. FIXME(offload): improve the genericCx and add more llvm wrappers 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":"compiler/rustc_codegen_llvm/src/builder.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"b01b47b2deb150709dc9a6495f820fca4d763316ef3c76e3117786e531a1d041"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(eddyb) pass \u0060\u0026CStr\u0060 directly to FFI once it\u0027s a thin 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":"compiler/rustc_codegen_llvm/src/builder.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"594c8dcd830c306adadadf9f2fc21bc0ce17e352d2f525a7227ef86209ef8c1c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Merge with the \u0060else\u0060 below? \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":"compiler/rustc_codegen_llvm/src/builder.rs"},"region":{"startLine":793}}}],"partialFingerprints":{"codehealthFindingId/v1":"a95aa69848f9fa18a6ecace2683b978f1843caadafa6bbaf5cb94fdf39231fec"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Merge with the \u0060else\u0060 below? \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":"compiler/rustc_codegen_gcc/src/builder.rs"},"region":{"startLine":1122}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ea4b7de9c04043258d20fb06f8718fbe5d5ab0881d51ae5c53b6d868f7fb226"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Switch this to use MD_captures once LLVM 22 is the minimum. \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":"compiler/rustc_codegen_llvm/src/builder.rs"},"region":{"startLine":932}}}],"partialFingerprints":{"codehealthFindingId/v1":"0db80a747d05d45bdf299dbabf035547209200f1080efd367117ee4901f94590"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: If \u0060ret_ptr\u0060 is true and \u0060src\u0060 is not a pointer, we *should* tell LLVM that 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":"compiler/rustc_codegen_llvm/src/builder.rs"},"region":{"startLine":1384}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd46e92e4b97921ecb20732e968a751dd08b02b44562e0ffcb119d5d3990ed6d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(jchlanda) Operand bundles should only be attached to indirect function calls. \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":"compiler/rustc_codegen_llvm/src/builder.rs"},"region":{"startLine":2168}}}],"partialFingerprints":{"codehealthFindingId/v1":"20ee8186826cf5c5384fa34b515e56087dbe0d75f3f80b3d77ab98fcd7c719cb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(eddyb) replace this with a \u0060Function\u0060 \u0022subclass\u0022 of \u0060Value\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":"compiler/rustc_codegen_llvm/src/common.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"76f4a7649921ed43dd0afeab6b337a33e7b322539f4a45d8923de30eac0f6fe1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(jchlanda) Decide if this could be better served by \u0060ctor\u0060 crate. See the discussion \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":"compiler/rustc_codegen_llvm/src/consts.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"657a03c377b5e457430e32efea86739bbccd245386e4f558099dfc2a505223a2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(nagisa): investigate whether it can be changed into define_global \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":"compiler/rustc_codegen_llvm/src/consts.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"66c2f56060ac0fa1c76231e983f1973de84a5e5c6f84438785989e1b79b10dbc"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(nagisa): investigate whether it can be changed into define_global \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":"compiler/rustc_codegen_gcc/src/consts.rs"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"248571978528ebb3b7f0b377353a6d47f371e896ec7f11b69cafdc632b7f8574"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: should we cache \u0060const_alloc_to_llvm\u0060 to avoid repeating this for 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":"compiler/rustc_codegen_llvm/src/consts.rs"},"region":{"startLine":912}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b3503dde01215246c4815fc20e9453539ca3132e6133065deeef61c032ae659"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This parses the ignorelist files for each CGU, which adds a performance overhead. \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":"compiler/rustc_codegen_llvm/src/context.rs"},"region":{"startLine":686}}}],"partialFingerprints":{"codehealthFindingId/v1":"a493a38f006740e176bdae18abb13c841a14a6980b81512e3f90d7fa64aae843"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME (jchlanda) extend possible values once we start supporting other platforms (for \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":"compiler/rustc_codegen_llvm/src/context.rs"},"region":{"startLine":800}}}],"partialFingerprints":{"codehealthFindingId/v1":"63aa6aff88ccd76c7efd99612c9843f436075e8db1bd172e54ff10c5b4395e7a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(jchlanda) Currently, all function addresses requested from \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":"compiler/rustc_codegen_llvm/src/context.rs"},"region":{"startLine":968}}}],"partialFingerprints":{"codehealthFindingId/v1":"50d985487a837a0639554bcee70ca0896b2229112d3ef2dfbebfc1a4a6a10f8f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(x87_f80) we should support this. \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":"compiler/rustc_codegen_llvm/src/intrinsic.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c6be6c97d08c7a8c49ca3af71490906eda1cd636537b029e0b41bae7959e68b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: could be \u0060trunc nuw\u0060, even for signed. \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":"compiler/rustc_codegen_llvm/src/intrinsic.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"e466485a2c2059f4230bd8c99d5a98b4cbbc178d2ba7300d50db90f1ed6f9017"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME Workaround the above issue by taking maximum alignment if the global existed \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":"compiler/rustc_codegen_llvm/src/intrinsic.rs"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"b76680d15e0442923b38851f351018f33790db518e1630c4d4f82aae7580edb4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: also do this for overloaded intrinsics \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":"compiler/rustc_codegen_llvm/src/intrinsic.rs"},"region":{"startLine":1231}}}],"partialFingerprints":{"codehealthFindingId/v1":"76fcd8d5c890d0ea743e4f8042e21028e653c337ceb1fa1bd0396acc6c79240c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(eddyb) find a nicer way to do this. \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":"compiler/rustc_codegen_llvm/src/intrinsic.rs"},"region":{"startLine":1684}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf34579c44116d75971c5131107d3ec4bf3309fd2637038720db801c0fce9815"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(eddyb) find a nicer way to do this. \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":"compiler/rustc_codegen_gcc/src/intrinsic/mod.rs"},"region":{"startLine":1483}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ffce2fae639737d2535180b322c9ec74f163c1aaf584614df208a808938bad6"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK(eddyb) LLVM inserts \u0060llvm.assume\u0060 calls to preserve align attributes \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/llvm_util.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"1afe4e4b12e6f445a3d0be16af7a63fdb61a485222e3796d795a55db8137176a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(f16b) until \u003Chttps://github.com/llvm/llvm-project/issues/97896\u003E"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/llvm_util.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"d70c44f1cd7ac4dccc3ac3e114a111712d7a346981b91c709c8ff9027364621c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#132514): This prints the LLVM target string, which can be"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/llvm_util.rs"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bdfc66fba21fd003ab487e89330938d148c218edeffa925867f93f9701f1595"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(nagisa): it isn\u0027t clear what\u0027s the best interaction between features implied by \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":"compiler/rustc_codegen_llvm/src/llvm_util.rs"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"048339c3a8cdb7e35ec63a0eb1645b698194c2c2b953eb81393767953f7d9e68"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(nagisa): it isn\u0027t clear what\u0027s the best interaction between features implied by \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":"compiler/rustc_codegen_gcc/src/gcc_util.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecf476ef9a1afeba6f8d5b66461134070d2dc975dd8b677938890fe5db0ee17a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(eddyb) producing readable type names for trait objects can 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":"compiler/rustc_codegen_llvm/src/type_of.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd8ceea3f69c7dc43973cf71d825fe432333e098c72da95073797044a8c0898a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(eddyb) producing readable type names for trait objects can 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":"compiler/rustc_codegen_gcc/src/type_of.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"200b737223b3da2e9264542bceb6e7ba70f4ce6881201a5db5ce38ab4359e4e5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(autodiff): We currently know that this is correct for all the cases in which we \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":"compiler/rustc_codegen_llvm/src/typetree.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"2539149430fc6e4197593bb4f87438baa84a5d03f976dece8c5f613bb552206c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(autodiff): We should think more about what it means if a function returns a slice 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":"compiler/rustc_codegen_llvm/src/typetree.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"236ceb024bf7d65e764af8b14b6d2f28c3258519a535e98292182aa0a08596e0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: vector ABI 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":"compiler/rustc_codegen_llvm/src/va_arg.rs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac82a8e4fdd97b37600dd04f523f3571aa12062813196a4498ebb10c5c61894f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(llvm): This really results in shameful code when we end up needing 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":"compiler/rustc_codegen_llvm/src/va_arg.rs"},"region":{"startLine":675}}}],"partialFingerprints":{"codehealthFindingId/v1":"91b1070a7364dcc459da074778ce66526c8ecb0336575ddf22ba4b90e5a20122"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: handle multi-field structs that split across regsave/stack? \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":"compiler/rustc_codegen_llvm/src/va_arg.rs"},"region":{"startLine":991}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5b0c2cb742ac78438864efb2b1626c7a4ff5f08dd8dbb3d82743622046d04c5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: clang manually adjusts the alignment for this ABI. It notes: \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":"compiler/rustc_codegen_llvm/src/va_arg.rs"},"region":{"startLine":1160}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e53b8aa93b1ab1c2f301154adb7d84a03d85b58d4cdd9b7f7a0fae2d83855c1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME(#147327): These trait/method names were chosen to avoid churn in"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/llvm/conversions.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"71b3a2b61e90139c200f2260034edc0abd5289722b68cb889fe0bc4f487f1767"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#134001): Audit all \u0060Option\u0060 parameters, especially in lists, to check"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/llvm/ffi.rs"},"region":{"startLine":1783}}}],"partialFingerprints":{"codehealthFindingId/v1":"9da0808eda615d8862c626e5c748ab5bb82074ae5d9c256c1703574ab48c489f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME(Zalathar): Use the stdlib\u0027s \u0060PhantomInvariantLifetime\u0060 when its API is settled. \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":"compiler/rustc_codegen_llvm/src/llvm/ffi/branded.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba67dd4923d082de920bdd6e57daeb882cd157498deee1d65077a8c564e29003"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: If this wide pointer is a \u0060Box\u0060 then we don\u0027t want to use its \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":"compiler/rustc_codegen_llvm/src/debuginfo/metadata.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"a385e83874028f7c17ab66725b68f1bb8924080fd3b6e51f154c7259162879bd"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(mw): Cache this via a regular UniqueTypeId instead of an extra field in the debug context. \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":"compiler/rustc_codegen_llvm/src/debuginfo/metadata.rs"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"799f0f2adb3017158b97dddb75d33fc7a469f5802cef5caa34adbca07a885771"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: the name \u0060\u003Crecur_type\u003E\u0060 does not fit the naming scheme \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":"compiler/rustc_codegen_llvm/src/debuginfo/metadata.rs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"191eee1b51810e03ea196a1c50caf5a30e0a4d2743552e8d3545118d401bba05"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: it might make sense to use an actual pointer type 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":"compiler/rustc_codegen_llvm/src/debuginfo/metadata.rs"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"717aa67054e516788515d78e800756526e4a435eca2aed41e07972b9f2bd0960"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#41252) Remove \u0022clang LLVM\u0022 if we can get GDB and LLVM to play nice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/debuginfo/metadata.rs"},"region":{"startLine":951}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2383e1fa45fc79f6fc5c6faa6add35452fb9cb3a86c2d0cd8b0fe33ee52e03e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: also do consts? \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":"compiler/rustc_codegen_llvm/src/debuginfo/metadata.rs"},"region":{"startLine":1480}}}],"partialFingerprints":{"codehealthFindingId/v1":"b86b4dd13ad4ea0f6b637c681c359e28c67d0b319df830e77e2dd490c57c96d5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(flip1995): The virtual function elimination optimization only works with full LTO 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":"compiler/rustc_codegen_llvm/src/debuginfo/metadata.rs"},"region":{"startLine":1744}}}],"partialFingerprints":{"codehealthFindingId/v1":"40e59814077c0d96f8906d785fae3c54af788fc6518b5695567563ecf43e664f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: LLVM only supports this optimization for \u0060Lto::Fat\u0060 currently. Once it 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":"compiler/rustc_codegen_llvm/src/debuginfo/metadata.rs"},"region":{"startLine":1778}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7ac49ec3eda5c8ce70a4fcd75685a1010029b96b68ad19839eb038ec2f40c64"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(eddyb) does this need to be separate from \u0060loc.line\u0060 for some reason? \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":"compiler/rustc_codegen_llvm/src/debuginfo/mod.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"b17627cc5965ceadae13d707aca8ac758f0fdc1554266f907244ddd4292d0363"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#42800):"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/debuginfo/mod.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"093994978f11cb49d09b6d4ac7847d2e9ce30f898ceab3362ff97039f5dd409b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: debug info for consts (using \u0060createTemplateValueParameter\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":"compiler/rustc_codegen_llvm/src/debuginfo/mod.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7b975d13ffdc265cc311e4f18a55875e3ccf096b2805b189435e2d69bad5796"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(eddyb) rename this to better indicate it\u0027s a duplicate of \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":"compiler/rustc_codegen_llvm/src/debuginfo/mod.rs"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"726956dbc47564d5073eadde7a70d5a2a35bcfaee02225f30f116fcee2b3694b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(eddyb) rename this to better indicate it\u0027s a duplicate of \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":"compiler/rustc_codegen_llvm/src/debuginfo/mod.rs"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c09f03125b9de5a69d207d50ead1b053bd9d1cf49da5624b10dcf82c5785a73"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(eddyb) rename this to better indicate it\u0027s a duplicate of \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":"compiler/rustc_codegen_gcc/src/debuginfo.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"3063adba7440a173c1f9e942c0438a1cbc918262b3bbf433f1e82a373d07e395"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(eddyb) rename this to better indicate it\u0027s a duplicate of \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":"compiler/rustc_codegen_gcc/src/debuginfo.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a2457519fc57fa662942ea8bdfddc17ef89e9b18039c6c31b7e1cb904d912ae"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: indicate that this is an expanding recursive type in stub metadata? \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":"compiler/rustc_codegen_llvm/src/debuginfo/metadata/type_map.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"65c4148990bcc004e043169200cc156a9b51f03ef030fd135d52f284c1ba94ac"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Currently we force all DISCR_* values to be u64\u0027s as LLDB seems to have \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":"compiler/rustc_codegen_llvm/src/debuginfo/metadata/enums/cpp_like.rs"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"c44cf6d3e5f0232091394ec639cc466a6d75f2d63da690c0b035a0541c301630"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This is problematic because just a number is not a valid identifier. \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":"compiler/rustc_codegen_llvm/src/debuginfo/metadata/enums/native.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"83579a22c158763e194f1f1a70a3150f108c14e4acd47a4822c6b23f64bd9b89"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#132395): Can this be none even when coverage is enabled?"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/coverageinfo/mapgen.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f8068b31f4270b6fa2ceeee67ccda03db5a319f0207b34f6d64fd825884b5dd"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(Zalathar): Consider sorting the file table here, but maybe \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":"compiler/rustc_codegen_llvm/src/coverageinfo/mapgen.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0fa284b153e3dc014e4a4ba88480b9382203c3a989ed43833e1e658f97ab9a4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(Zalathar): Find a better solution for mixed-coverage builds. \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":"compiler/rustc_codegen_llvm/src/coverageinfo/mod.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"99616f4fc4fd4d3025134e35588a58a9bd1cb372d31d540d12b13017c90b786c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(Zalathar): When expansion regions are supported, this also needs to yield \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":"compiler/rustc_codegen_llvm/src/coverageinfo/mapgen/covfun.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"aff787a16b84d3c4297aff4afb99c94926dee45eeed0d49ddb9965bbb0dab9de"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(Zalathar): Fill out support for expansion regions \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":"compiler/rustc_codegen_llvm/src/coverageinfo/mapgen/covfun.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"ede2d05b80e493ddfac3df9002829504d1ab5951cc0b2b2117952bcff0347dc6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(Zalathar): Consider giving \u0060newtype_index!\u0060 a safe transmute to \u0060\u0026[u32]\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":"compiler/rustc_codegen_llvm/src/coverageinfo/mapgen/covfun.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"81f7c1a524f618db7edbae1f9b4c6bb14eb210341d25c08f966814bb949b86e4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#79417): Currently we have no way to offset doctest _columns_."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/coverageinfo/mapgen/spans.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7a69992140cb39a77300357c26c4861ee260701a04a29bbf49e1ff14928d82b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#79651): Consider trying to filter out dummy instantiations of"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/coverageinfo/mapgen/unused.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"08b9c3ab195d0d6a5087c8134b5a5af45cec8c19c67eeb163bcd146fce1e3807"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(Sa4dUs): pass proper varargs once we have support for differentiating variadic functions \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":"compiler/rustc_codegen_llvm/src/builder/autodiff.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf6c5d03fb2bb19803eb6c4fd648d48a75c4b763e2157a0e9acfeb0e3f838db9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(Sa4dUs): Enforce ZST corresponding diff activity be \u0060Const\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":"compiler/rustc_codegen_llvm/src/builder/autodiff.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f5f6c33d53ebe00bc5c4265d2b7f816f77b612cd21c19e995e5574eab2e5c3d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(ZuseZ4): This logic is a bit more complicated than it should be, can we simplify 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":"compiler/rustc_codegen_llvm/src/builder/autodiff.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cfa9c8ea434d2f4b53f7929f00bc2f16535df12ad1ecdf5d7665e49de9dea74"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(ZuseZ4): This logic is a bit more complicated than it should be, can we simplify 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":"compiler/rustc_codegen_llvm/src/builder/autodiff.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"705d8607c83a698efddcb52655db91769f97fd0e3b15c6a8235a5508989385db"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(ZuseZ4): We should add support for Vec here too, but it\u0027s less urgent since \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":"compiler/rustc_codegen_llvm/src/builder/autodiff.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd0a9687458a0ac36097ebf0342ac3976bb84d897207719dee1d64a164c43128"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(ZuseZ4): We will upstream a safety check later which asserts that \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":"compiler/rustc_codegen_llvm/src/builder/autodiff.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecb72f7cdec18ccd3452c978739f3ec1d860512f4dedb205c595c7c6d114a894"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(ZuseZ4): \u0060outer_fn\u0060 should include upstream safety checks 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":"compiler/rustc_codegen_llvm/src/builder/autodiff.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c45f2a918375cb973685e08bc119ff2a093bc91ad1b3fda80ec489a8083fd9c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(ZuseZ4): the CC/Addr/Vis values are best effort guesses, we should look at tests 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":"compiler/rustc_codegen_llvm/src/builder/autodiff.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b616b3e986f8e3ccf2a4c00667cb2d5c98d5292d6aadd83b95d5b029848e049"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(offload): @0 should include the file name (e.g. lib.rs) in which the function to be \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":"compiler/rustc_codegen_llvm/src/builder/gpu_offload.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"86f2176ab4b2134aff6b93f848879f6bcf66a6d84e1c66b28799f400c59968f5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // The next two are debug infos. FIXME(offload): set them \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/builder/gpu_offload.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"f58f09f2a60cdc4c803c5184db4ad74518cc78c1272562b42c54a05cfeeb1015"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(offload): add \u0060OMP_MAP_TARGET_PARAM = 0x20\u0060 only if necessary \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":"compiler/rustc_codegen_llvm/src/builder/gpu_offload.rs"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"84720b1cfd4733a97a577be5714e933f3c833885e6826d326a11db362d2f60f8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(Sa4dUs): check for \u0060f128\u0060 support, latest NVIDIA cards support 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":"compiler/rustc_codegen_llvm/src/builder/gpu_offload.rs"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"2497766c1813550f11523e79c84a3717b5f7f8338f7bcea156d5e217e3ac4d87"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME(Zalathar): Consider using \u0060PhantomInvariantLifetime\u0060 when the 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":"compiler/rustc_codegen_llvm/src/back/llvm_backend.rs"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6dc3a2d73461f84ebb650ebbd42af5729efedb6b5f88986f225b0489a88dad7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: All upstream crates are deserialized internally in 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":"compiler/rustc_codegen_llvm/src/back/lto.rs"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"11639546dea8aecb79d6a700640674720b1b9910957b465c877948308b2d32ba"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(ZuseZ4): Test this, since it was added a long time ago. \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":"compiler/rustc_codegen_llvm/src/back/lto.rs"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"9292bcc09c1528212d9f6d4e4006fd0e69772a0868f2689db99cbbc0e45c0dc7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME use dcx \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":"compiler/rustc_codegen_llvm/src/back/write.rs"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c01e712ff0a2201b913c002fb5a01be83d8a9663805cbfa42ab2b006d3347a0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#164677): Don\u0027t ignore stack size warnings."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/back/write.rs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"857b5f63757681a3d6e25d0844623694669d9084a0b538efb836952a3a1bf388"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(ZuseZ4): In a future update we could figure out how to only optimize individual functions getting \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":"compiler/rustc_codegen_llvm/src/back/write.rs"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b2e9b824dabf49567ee5bcc6254260cb01dad0651bf7bf63678de519f3ed465"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(ZuseZ4): support SanitizeHWAddress and prevent illegal/unsupported opts \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":"compiler/rustc_codegen_llvm/src/back/write.rs"},"region":{"startLine":899}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3fd441884020f6e49e23d20835e5116e33d5d2c5c86b6e0b6770a30cf254174"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): find a better way to add the PATH necessary locally. \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":"compiler/rustc_codegen_gcc/tests/lang_tests.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"26e2948c394bc369f7533e4763d84d48786165c24199c4c29335407974256423"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): find a better way to add the PATH necessary locally. \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":"compiler/rustc_codegen_gcc/tests/lang_tests_common.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a100443237945db03a03a40be828b2ba53766a3b5a0360b7871a5b95d0fe082"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): panicking here makes the test pass. \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":"compiler/rustc_codegen_gcc/tests/lang_tests.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ae902f0fed08febc3330a13933cb6a44a663456d954681723a762189d909ab9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): panicking here makes the test pass. \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":"compiler/rustc_codegen_gcc/tests/lang_tests_common.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"8efd8f329ea9251e0e5897669d755dbbb44f15703e4b40e6b19aa4406efd6870"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): find a way to send this via a cli argument. \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":"compiler/rustc_codegen_gcc/tests/lang_tests.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa072b991c62ae3a7fc4b913d2dc23805809e224abe1fdc28280767c9985b0a8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): find a way to send this via a cli argument. \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":"compiler/rustc_codegen_gcc/tests/lang_tests.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c1bf8240c5e4b00d86226911fa0b3d7593b7c2a16d0faedfb7b9625c5ea81a9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): find a way to send this via a cli argument. \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":"compiler/rustc_codegen_gcc/tests/lang_tests_common.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f18f8e51d3340b085794bfb25c24116f3b4511b096ebc532a7e68c2335555ec"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: remove this when the unwind issue is fixed in GCC m68k upstream. \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":"compiler/rustc_codegen_gcc/tests/lang_tests.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"0924a74e959b10dec85f6921e7270cb20397686e56993fee5ca6a7d3aa110c55"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: remove this when the unwind issue is fixed in GCC m68k upstream. \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":"compiler/rustc_codegen_gcc/tests/lang_tests.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b89cc7e1cb8fcb7db094cafd7d9c4c230cc9ee97c651b1006b6daf0dcc71264"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: remove these tests (extracted from libcore) when we run the libcore tests in the CI of 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":"compiler/rustc_codegen_gcc/tests/run/core-float.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"d70a8e94862cd018bf05076722eeb660d79e7a139fc6618fe10e310b1a608389"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Remove this test once rustc\u0027s \u0060./tests/codegen/riscv-abi/call-llvm-intrinsics.rs\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":"compiler/rustc_codegen_gcc/tests/compile/call-llvm-intrinsics.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"47395de4ea4ac61a7346b7b060de936b7de15db097dccaf5d8c31179aa2d48a1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Remove this test once \u003Ctests/run-make/simd-ffi/simd.rs\u003E stops \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":"compiler/rustc_codegen_gcc/tests/compile/simd-ffi.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cd157eaf8096d4156a18f6551ed2d279514cd5d78b31097e353f11dfd1db86a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): return a function pointer type 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":"compiler/rustc_codegen_gcc/src/abi.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"2058217cd650e211306f8240eb9aa10f3955f06d933db275719d32644bd04e74"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): Should we do something with \u0060FnAbiGcc::fn_attributes\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":"compiler/rustc_codegen_gcc/src/abi.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"71d2392920be26d359d435cf2b4056d906e449cd43b97957dba586d564e083f2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): check if those AVR attributes are mapped correctly. \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":"compiler/rustc_codegen_gcc/src/abi.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f388c1727d5960b0b96db0c01a4016e80c2b90356258e49d01f134e47489658"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): emit unwind tables. \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":"compiler/rustc_codegen_gcc/src/allocator.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"386a46bac7c2e915672c90e9db2c80314d43ffae7e639c976dbe1b5136a36ad7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(@Commeownist): Check if we need to emit some extra debugging info in certain circumstances \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":"compiler/rustc_codegen_gcc/src/allocator.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"2503e83810c059069e1d8d9abab25061732a3aa11824675ecdf4d5cc2a6d3415"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(@Amanieu): Additional mangling is needed on \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":"compiler/rustc_codegen_gcc/src/asm.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"14e159b0d337d8322c9f305c1e78fe7c29c00e78792afb73c94b4bcf3d59b802"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(@Amanieu): Additional mangling is needed on \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":"compiler/rustc_codegen_gcc/src/asm.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"f53ece81d22cc07c7c35b818e2a83994f29d7c733fa3112d87aeb747f0d531db"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(@Amanieu): Additional mangling is needed on \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":"compiler/rustc_codegen_gcc/src/asm.rs"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"52509dd4390f0ec4e50c0e327a8bd1fd26e3af8417a43633d3237a15b80522c0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(@Amanieu): Additional mangling is needed on \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":"compiler/rustc_codegen_gcc/src/asm.rs"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"df11508df9c51b006196e5d1c578ef2b6bd9fb9f5fd4c562cc12868758cd96b0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(@Amanieu): Additional mangling is needed on \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":"compiler/rustc_codegen_gcc/src/asm.rs"},"region":{"startLine":1005}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bac29e32cbfe40a5a3e78b98febbc86a00d9c32f5429eab5fe8bff1aa226574"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(@Amanieu): Additional mangling is needed on \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":"compiler/rustc_codegen_gcc/src/asm.rs"},"region":{"startLine":1014}}}],"partialFingerprints":{"codehealthFindingId/v1":"27a5d90a4b12ef0dcd22cb4c0a664db7e5412f7173827363c0c63180cb830146"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(@Amanieu): Additional mangling is needed on \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":"compiler/rustc_codegen_gcc/src/asm.rs"},"region":{"startLine":1031}}}],"partialFingerprints":{"codehealthFindingId/v1":"11601a4870e213afa2d1424279720dfbd4c873e1820c7fb80cc1ac51ff95e7a9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(@Amanieu): Additional mangling is needed on \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":"compiler/rustc_codegen_gcc/src/asm.rs"},"region":{"startLine":1058}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ff5a9aba4f90ea28496fc880f272826307c7fa2ac790fb9f698f6202dda86cd"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We should remove this when switching to \u0022untyped\u0022 pointers \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":"compiler/rustc_codegen_gcc/src/asm.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"56e9a618716d047309dfb29ff4aef4c941aefbff97f320e747e2a141bd6863fd"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): might also need to escape | if rustc doesn\u0027t do 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":"compiler/rustc_codegen_gcc/src/asm.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"98e3d13998a583b3d2d1dd2b8698a4f8335b22add12dc4d19d5401a1e35a0cb2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(@Commeownist): I\u0027m not 100% sure this one clobber is sufficient \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":"compiler/rustc_codegen_gcc/src/asm.rs"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b5f12e75f56af4e563ee9f42e05e01582d64cd16d4f2dd33a17a224e956131d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(@Commeownist): figure out how to align stack \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":"compiler/rustc_codegen_gcc/src/asm.rs"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ac8288d02d4b6f8a1296ee894dd3ced4bcb493e1dcbcfebd7bb15205fb32beb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): add support for vector register. \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":"compiler/rustc_codegen_gcc/src/asm.rs"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"b42836caf9d63debcd0fd0d33b59c7e68712637cc06a35a9a33f305b5e44a008"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): set the global variable as used. \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":"compiler/rustc_codegen_gcc/src/asm.rs"},"region":{"startLine":1013}}}],"partialFingerprints":{"codehealthFindingId/v1":"bba867434eb3026b6febf16a6b92b270d020ec5b09261a084295127d8033583b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): set the global variable as used. \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":"compiler/rustc_codegen_gcc/src/asm.rs"},"region":{"startLine":1030}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc26218b2dc9ec739c804963a1c7c3d232d1933dab4a12d115604f7524b1deec"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): support removing feature. \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":"compiler/rustc_codegen_gcc/src/attributes.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"303f85a66b0b67af762599ad9f53a3df70ca734780d410cc59a1e2a400bddc98"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): cg_llvm adds global features to each function so that LTO keep them. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_gcc/src/attributes.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d708419c0199dc5ddecf23d49f1decf1bd66cefa4124172b947a678a26867a3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: GCC also supports the target attribute on other targets, with their own \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":"compiler/rustc_codegen_gcc/src/attributes.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0378f111b09c4a9399e16d573c136c0eb054a46ecd68cfb2f6c6c6de741372a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: to make it less error-prone (calling get_target_info() will add the flag \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":"compiler/rustc_codegen_gcc/src/base.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"a25784e3c928206a5a15311fa53564a8f9c8eeebb85261eac3d8f8289fdbe41b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: improve this to avoid passing that many 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":"compiler/rustc_codegen_gcc/src/base.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"c275f4367745b974588e2bd2aebb0481ef4ccc9929e70923cddba84aee6fe94f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo) \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":"compiler/rustc_codegen_gcc/src/builder.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"f31cec35940e3feae5c178419927edb03d72a59cfd867f5ec4fecdb761afa547"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo) \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":"compiler/rustc_codegen_gcc/src/builder.rs"},"region":{"startLine":1200}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6a88259896ac229c9906f6cf0f6985af015bed5ddbf5a22a28f6822a54db3df"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo) \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":"compiler/rustc_codegen_gcc/src/builder.rs"},"region":{"startLine":1204}}}],"partialFingerprints":{"codehealthFindingId/v1":"036fea9cf420df7514abdb26166490ee5690c753c6d670114c8679c2cbc54d67"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo) \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":"compiler/rustc_codegen_gcc/src/builder.rs"},"region":{"startLine":1831}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b8829d5d44dd92b76c0297ca956f6a96c7111f5687151bf82611463618c0c74"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo) \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":"compiler/rustc_codegen_gcc/src/builder.rs"},"region":{"startLine":1835}}}],"partialFingerprints":{"codehealthFindingId/v1":"90efde36a742d6c53fe4cdf9e501415bbed75d0983702f18e886451c11121ecb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo) \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":"compiler/rustc_codegen_gcc/src/builder.rs"},"region":{"startLine":1839}}}],"partialFingerprints":{"codehealthFindingId/v1":"d41cdf8f38b21369674a6d360c3fe3869a435a7189c75e4797ecbe9badf85087"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo) \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":"compiler/rustc_codegen_gcc/src/common.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd7f1de9cdb58ca39027aea74dc6a16b70aa988ba6230c5aaae02fadd10a9281"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo) \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":"compiler/rustc_codegen_gcc/src/common.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfdeab7acec58bd97ed2fd16cb185ec113ee8f070822ec2f62136c3033ec3c33"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo) \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":"compiler/rustc_codegen_gcc/src/consts.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"a69958ebdfbf9e9f04c8a75a535896af76d4fc13ceb33056d87020937d575f23"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo) \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":"compiler/rustc_codegen_gcc/src/context.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"b76f56147fae8927a6003b0a7e8172b33f4c452f041163cb163fd43fdac24140"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo) \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":"compiler/rustc_codegen_gcc/src/context.rs"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f26ce58d6ce6633da5fead3545a1d70824a5530f68ffd60bd14d20d38da6367"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo) \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":"compiler/rustc_codegen_gcc/src/context.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"a42ad0aa0b2591b683105725522a9b37b0d685300c302d03ca42c8c372cd66b1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo) \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":"compiler/rustc_codegen_gcc/src/context.rs"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"70e4670a74b9071440ba2489e641f784b67790db7be982b1ec03cd87a7e66d8b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo) \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":"compiler/rustc_codegen_gcc/src/context.rs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1c8fb4334cdcc539f425adf3ddaf87f8abbfe5b1e2624952727894e6260961b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo) \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":"compiler/rustc_codegen_gcc/src/coverageinfo.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"51ff18fdcb6c444d7f6bbb8857fe480ebd95358870b83046dad6983d4128890c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo) \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":"compiler/rustc_codegen_gcc/src/debuginfo.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"59e6c921c78fdce6d34e4c75618682cbe5cc2c8032d24d100fec193827876b30"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo) \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":"compiler/rustc_codegen_gcc/src/intrinsic/mod.rs"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f998f1f7fd4c56a01d5ecc70a7d9842a198dc953faacfd2200e908a1c54bd34"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo) \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":"compiler/rustc_codegen_gcc/src/back/write.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"865bb227c1081a1606883e7c106ce305b0af79361765a104dd6a431a8267666e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): does this make sense? \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":"compiler/rustc_codegen_gcc/src/builder.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"60e08b39d4973c3eac8b4aba2c503d54bdaec193780bedf2bc828b63142d9843"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this condition seems wrong: it will pass when both types are not \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_gcc/src/builder.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ab6889638bff6d651343e5e3a8c9b52dde7bca8af8a208ea9a2b7353721992f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): perhaps use __builtin_convertvector for vector casting. \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":"compiler/rustc_codegen_gcc/src/builder.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"beda6f1910f06dc9f73970d400f15aa3cd33e7bf4f45633c526da58ceebed945"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): perhaps use __builtin_convertvector for vector casting. \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":"compiler/rustc_codegen_gcc/src/int.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dfc6ba5c133c74741c4ad2622da755de959e7ade1b11de901448e8c3cc983f1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): perhaps use __builtin_convertvector for vector casting. \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":"compiler/rustc_codegen_gcc/src/int.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"849b860d2ba49ba0af8d1f9a0cd53197ce4892e9c85e9ccc71a09d42008f88ea"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): perhaps use __builtin_convertvector for vector casting. \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":"compiler/rustc_codegen_gcc/src/int.rs"},"region":{"startLine":964}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b9a9168a1e749757f84cd63c0ad9bcbc3d747424e1b18c8bff9fde2fbf398cb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: remove bitcast now that vector types can be compared? \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":"compiler/rustc_codegen_gcc/src/builder.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"b167dbf16362fefe44f241c12835659e72b6ca8e2c52873de2a08ef5ad63ed65"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: remove bitcast now that vector types can be compared? \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":"compiler/rustc_codegen_gcc/src/builder.rs"},"region":{"startLine":2465}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a61a0ad0be4778467c406b60c4548e204dd4490c27c92eb2b147713a6577727"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(bjorn3): Apply function attributes \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":"compiler/rustc_codegen_gcc/src/builder.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7d48f88816d190721adefb2a83080b6039feb9367ac829c62629b4daf7cdb23"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(bjorn3): Apply function attributes \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":"compiler/rustc_codegen_gcc/src/builder.rs"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"0827a0fd77a54715aa8efaa024be7f021d0b798d01737e679c617633d71c43c2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): As a temporary workaround for unsupported LLVM intrinsics. \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":"compiler/rustc_codegen_gcc/src/builder.rs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9c8cd8ac20e1dfc194e0617e014eb249b880b6e83b1901e0d78badc13fb86ab"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): return the new_call() directly? Since the overflow function has no side-effects. \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":"compiler/rustc_codegen_gcc/src/builder.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"04620fd6392f318e8b61dc87c8fb8aef6244204122a9645a4f38a3966aa2709f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(FractalFir): This is a workaround for a libgccjit limitation. \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":"compiler/rustc_codegen_gcc/src/builder.rs"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5e72b0c4cfe9c6321be13e7211dcab0248f71444274d23ae7d42287a1e2d4b0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): use funclet 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":"compiler/rustc_codegen_gcc/src/builder.rs"},"region":{"startLine":663}}}],"partialFingerprints":{"codehealthFindingId/v1":"fea238f4242ac3bd57688e9282ac54de7eff0cd197f72b1a60a3ad6df2fd937b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): should we also override the \u0060unchecked_\u0060 versions? \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":"compiler/rustc_codegen_gcc/src/builder.rs"},"region":{"startLine":746}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5b80b1be22b41b078d9b4b05673ff68843d2591edc57aaabb3a782e32cc16c9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): poison if not exact. \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":"compiler/rustc_codegen_gcc/src/builder.rs"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"378ab4b136ae755c4c39581b14639ae14778864206d37e9774055f6c3f69ede0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): poison if not exact. \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":"compiler/rustc_codegen_gcc/src/builder.rs"},"region":{"startLine":787}}}],"partialFingerprints":{"codehealthFindingId/v1":"4959305efd7ae39f2a3ec4cadbd341a0e7b0720228189006e0691830c43f7042"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): rustc_codegen_ssa::mir::intrinsic uses different types for a and b but they \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":"compiler/rustc_codegen_gcc/src/builder.rs"},"region":{"startLine":788}}}],"partialFingerprints":{"codehealthFindingId/v1":"e32e21f01fae34fc865f2582cdc457bd46302d28a2887abaa01f7c3b375af078"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): add check in libgccjit since using the binary operator % causes the following 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":"compiler/rustc_codegen_gcc/src/builder.rs"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"94c19fa5309e69a27ca1c0b78930e3454012c76d296b6f83a8c01ebc63ef05e4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): this seems to produce the wrong 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":"compiler/rustc_codegen_gcc/src/builder.rs"},"region":{"startLine":837}}}],"partialFingerprints":{"codehealthFindingId/v1":"18c90dd86079b4cfe645b5b452e62f3679bfba659027689c3f90c74f79aa0f74"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): use get_simple_function_f128_2args. \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":"compiler/rustc_codegen_gcc/src/builder.rs"},"region":{"startLine":860}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cf81bd7c48c1b5ff08e524fb2310fef6c2041d6a4ff1c0a5cd40f6795982f99"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): It might be better to return a LValue, but fixing the rustc API is non-trivial. \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":"compiler/rustc_codegen_gcc/src/builder.rs"},"region":{"startLine":1009}}}],"partialFingerprints":{"codehealthFindingId/v1":"a637f61c20b54455381e94e46b072a4011fc4d770944e816d7914a383b6b7dff"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): set alignment. \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":"compiler/rustc_codegen_gcc/src/builder.rs"},"region":{"startLine":1059}}}],"partialFingerprints":{"codehealthFindingId/v1":"1306dd0229f14f07c3d4c97661bf152f67fe5fb13a828a5f2200807b4250b65e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME we are always making the load volatile \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":"compiler/rustc_codegen_gcc/src/builder.rs"},"region":{"startLine":1073}}}],"partialFingerprints":{"codehealthFindingId/v1":"669d96e316821507d260d6ca77603b170345010be2115732f01df21b6aa8fc5d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): use ty. \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":"compiler/rustc_codegen_gcc/src/builder.rs"},"region":{"startLine":1080}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fd81d7a3ed3a10c6078596f178de7785952d3af3b666141ba0d4d26681fcbe0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): handle alignment. \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":"compiler/rustc_codegen_gcc/src/builder.rs"},"region":{"startLine":1081}}}],"partialFingerprints":{"codehealthFindingId/v1":"91664852b3edf99acb1e6e4c6a2a29eda896155444b5b3cd555cc29ef87a8949"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): handle alignment. \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":"compiler/rustc_codegen_gcc/src/builder.rs"},"region":{"startLine":1246}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e937115f578b093353fb31be470f3501a1483bfe3c4d495331769e3733a493c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): handle \u0060MemFlags::NONTEMPORAL\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":"compiler/rustc_codegen_gcc/src/builder.rs"},"region":{"startLine":1229}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb03f1556fa82df3f1e26d4c3b8cc38ced880af769c4431499a6e6f7ab71d47c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME we are always making the store volatile \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":"compiler/rustc_codegen_gcc/src/builder.rs"},"region":{"startLine":1239}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c40b3dc1ea11be8ffe00cb1c79482de8aa8b647ba45695744160fdedd32361b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): fix libgccjit to allow comparing an integer type with an aligned integer type because \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":"compiler/rustc_codegen_gcc/src/builder.rs"},"region":{"startLine":1254}}}],"partialFingerprints":{"codehealthFindingId/v1":"db7e8de5e1cdce44a221a0912e4f1e1e9afda07c364b0ddaf7c8e404a80badc9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // always considered in bounds in GCC (FIXME(antoyo): to be verified). \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":"compiler/rustc_codegen_gcc/src/builder.rs"},"region":{"startLine":1268}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6579952cfcc849816c7be9f9bd73eea13c66754174a16375d1f1984abb69dc7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // NOTE: array indexing is always considered in bounds in GCC (FIXME(antoyo): to be verified). \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":"compiler/rustc_codegen_gcc/src/builder.rs"},"region":{"startLine":1286}}}],"partialFingerprints":{"codehealthFindingId/v1":"d35e0f77bf00ed6ef268c829ae7c84586773de258547a33d5bff275ac74b38bc"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): check that it indeed truncate the value. \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":"compiler/rustc_codegen_gcc/src/builder.rs"},"region":{"startLine":1293}}}],"partialFingerprints":{"codehealthFindingId/v1":"f03abaffeb9e59267ee15a1943a3923f3e834efebaea0e49b5af54c5d025ea49"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): check that it indeed sign extend the value. \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":"compiler/rustc_codegen_gcc/src/builder.rs"},"region":{"startLine":1298}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e3ba0dc7af22c0ab61f842a85a0365bb4b38add235376e24273660df49155be"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): nothing to do as it is only for LLVM? \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":"compiler/rustc_codegen_gcc/src/builder.rs"},"region":{"startLine":1300}}}],"partialFingerprints":{"codehealthFindingId/v1":"49f1c8226dc4bdb02b6c7692a7778895ed9ea1c55042d66ea5d0f573b0119a38"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): make sure it truncates. \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":"compiler/rustc_codegen_gcc/src/builder.rs"},"region":{"startLine":1323}}}],"partialFingerprints":{"codehealthFindingId/v1":"02354c69b049f5a0340f882f2174d2fc6526e1209fbbd63cb5eae4116be5e315"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): it would be better if the API only called this on struct, not on arrays. \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":"compiler/rustc_codegen_gcc/src/builder.rs"},"region":{"startLine":1578}}}],"partialFingerprints":{"codehealthFindingId/v1":"69c4189ddd4fb1794b244594e75fd3c0d0a8ee44336341f85679451111adbc99"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): it would be better if the API only called this on struct, not on arrays. \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":"compiler/rustc_codegen_gcc/src/builder.rs"},"region":{"startLine":1605}}}],"partialFingerprints":{"codehealthFindingId/v1":"202624c06962c5e31b3567e99ddf41163dceeaaae5bcd229de1bef58179915a4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: If \u0060ret_ptr\u0060 is true and \u0060src\u0060 is an integer, we should really tell GCC \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":"compiler/rustc_codegen_gcc/src/builder.rs"},"region":{"startLine":1803}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fccc7068671eecfb34c172b5f71aba57bd5149e030690883f8f3d4c9a33da40"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): not sure why, but we have the wrong type 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":"compiler/rustc_codegen_gcc/src/builder.rs"},"region":{"startLine":1809}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bd4d3e2d4ba74745cf01c22f42996d25aded2619704b1e9c1699553e790b4ef"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): this does not zero-extend. \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":"compiler/rustc_codegen_gcc/src/builder.rs"},"region":{"startLine":1885}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2562489e8d7dcf3bde493fd7e8972ba4ddf639e0f2647edd7a1b66c9c9cfa56"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(bjorn3): implement \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":"compiler/rustc_codegen_gcc/src/builder.rs"},"region":{"startLine":1894}}}],"partialFingerprints":{"codehealthFindingId/v1":"03e90e37783ab9c6befe70506d6078b537b34585a3958728f7ff49987c4d5163"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(jistone): the following was originally the fallback SSA implementation, before LLVM 13 \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":"compiler/rustc_codegen_gcc/src/builder.rs"},"region":{"startLine":1941}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e9f1ef099f4cfc6f84acb435a944b03ada52aac0da94426183398153ac218a1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: rewrite using a generic function with \u003CF: Float\u003E. \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":"compiler/rustc_codegen_gcc/src/builder.rs"},"region":{"startLine":1975}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e257860795ab71210c7bdf14bdb9bd130dddd7b0feae73dee07abc87d71ce93"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): use a recursive unqualified() 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":"compiler/rustc_codegen_gcc/src/builder.rs"},"region":{"startLine":2116}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0986fb50f55ee93f6947b721d0a082aa67a3ec9254565beb28df6f0836ddb90"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): dyncast_vector should not require a call to unqualified. \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":"compiler/rustc_codegen_gcc/src/builder.rs"},"region":{"startLine":2426}}}],"partialFingerprints":{"codehealthFindingId/v1":"eab2ab7d57ef659f881e171e7d0a18a507992b206ae20eb5aaaef4c180887213"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): dyncast_vector should not require a call to unqualified. \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":"compiler/rustc_codegen_gcc/src/intrinsic/simd.rs"},"region":{"startLine":793}}}],"partialFingerprints":{"codehealthFindingId/v1":"650d83f8a052da253deb97bc60e9c497d9985c949680d836df9e22b966521f5f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): dyncast_vector should not require a call to unqualified. \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":"compiler/rustc_codegen_gcc/src/intrinsic/simd.rs"},"region":{"startLine":1330}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdaf93b65f00d804234da4ca1215286430d61ff74d86f22ab74a6157140ba17a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): dyncast_vector should not require a call to unqualified. \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":"compiler/rustc_codegen_gcc/src/intrinsic/simd.rs"},"region":{"startLine":1364}}}],"partialFingerprints":{"codehealthFindingId/v1":"090674b092670d827081e032a0f4e426923720ab0a4728dbf69ccacc5338b5d3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): check that ordered vs non-ordered is respected. \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":"compiler/rustc_codegen_gcc/src/builder.rs"},"region":{"startLine":2624}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dcca262930959316004dc4311b9daf02d7c84546d051a4ef9731a2b7c11bdbd"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): check if that\u0027s the same. \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":"compiler/rustc_codegen_gcc/src/builder.rs"},"region":{"startLine":2666}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa180690f2c50545f2ec34334a46a68dc42e7508a109784917f5546337fb92bd"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): we never reach this because get_declared_value only returns global variables \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":"compiler/rustc_codegen_gcc/src/callee.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6a65c4bee1215efbe238dcbea7e9ff706f6a96098a0c533ca92f3955399f3d0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): cast the 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":"compiler/rustc_codegen_gcc/src/callee.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"248b27aae845a6f3d1591a5979966fa7010de9d77b33785e31556b2bbbbc602e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): set linkage and attributes. \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":"compiler/rustc_codegen_gcc/src/callee.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"08ca61090207c2cdfa603af2250eb4227d97d630beed439bb9b0800e3363eaeb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): set linkage. \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":"compiler/rustc_codegen_gcc/src/common.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"569000d7f4225dbcc59496ae3d23904fc45f8c026e0f8172e30a831de3827abb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): set value name. \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":"compiler/rustc_codegen_gcc/src/common.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"407d31ced294284377c9d223692cfef6439f16ae1dabf6745300544572e754e0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): cache the type? It\u0027s anonymous, so probably not. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_gcc/src/common.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f34670a187f6e3cd529fab6b12de3f23f17ecf9514a30e634008fbf1d56cd9e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): fix bitcast to work in constant contexts. \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":"compiler/rustc_codegen_gcc/src/common.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d9f8a402f3a3b66e28235b404e7e52ef393b72e25c101f06d6c6f4d294be0e1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): perhaps only use bitcast for pointers? \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":"compiler/rustc_codegen_gcc/src/common.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"468e6a7bfdca02802dacb04785fc32378124ab48a159aa443710a1a93d37a997"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(bjorn3): assert size is 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":"compiler/rustc_codegen_gcc/src/common.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"de6748fc375b5e510fd703c59372f6cd339e4e9aac0f47f040d5e0eaa3c8dacf"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This check requires that the (arbitrary) value of undefined bytes \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":"compiler/rustc_codegen_gcc/src/consts.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a6c653360fd269ee814cd3ee71c9a9c6281a45642f83c07b9716713b4f2edda"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): check if it\u0027s okay that no link_section is 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":"compiler/rustc_codegen_gcc/src/consts.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"67fa1ae54dd5b469e68c0f43bbbb18d42d1ad6efa0cda8e8dbb9c7f80c519f97"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): set unnamed 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":"compiler/rustc_codegen_gcc/src/consts.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"78308e54cdb2769d4912cf1bae354b0f26833b9d84ee0c5dcf081a5f434d1e27"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): set unnamed 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":"compiler/rustc_codegen_gcc/src/declare.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"8247740e74e0e187c5c7e491a3cfe7a458eb02a41a904888178fc0c6d31f8445"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): set dll storage class. \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":"compiler/rustc_codegen_gcc/src/consts.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d9085543a76bab69c331feba74844190d6d7d6331f6e8e8403f13bb62a8a1c1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: relay undef bytes to codegen as undef const bytes \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":"compiler/rustc_codegen_gcc/src/consts.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"35c16baceb85f62c4fa0d9dc674e7a625b36cb04f0f2ea9c2696cccfbd375543"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(bjorn3) avoid wrapping in a struct when there is only a single element. \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":"compiler/rustc_codegen_gcc/src/consts.rs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"255dd94dee22a2017ee655d558b308dc6635a7f7853282dd7ee66dc90689bf10"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(bjorn3): Can this field be removed? \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":"compiler/rustc_codegen_gcc/src/context.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"f16a2936b34554fbb88f61d1e586d83740209030ac2d93a72b9e86d803c1a5a2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): improve the SSA API to not require those. \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":"compiler/rustc_codegen_gcc/src/context.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"df1e8d3d81e1055103700399dad177d7fa5f5b2071ab6084caef5e99ccb48996"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME(antoyo): remove when the rustc API is fixed. \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":"compiler/rustc_codegen_gcc/src/context.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"f09b396c51bf266ad3439777c6c8622f56f3d68ddac60d71f60663ad4959c57f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): re-enable the alignment when libgccjit fixed the issue 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":"compiler/rustc_codegen_gcc/src/context.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed26322f8e23ed71568ec3a3a12db00e8cf520175271bfa7432cb34f7897aaa0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): set alignment on those types as well. \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":"compiler/rustc_codegen_gcc/src/context.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"5020ae67acffdbac8afbfb8a1932ad27d85b96efa026c90f968de765e349201b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): instead of doing this, add SsizeT to libgccjit. \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":"compiler/rustc_codegen_gcc/src/context.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"92ee376b0e6d75670efd315bd5b689c60755b9ae27d46f0842e82d71f3b7389a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): don\u0027t do this twice: i.e. in declare_fn and 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":"compiler/rustc_codegen_gcc/src/context.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2326ca7440836deee14a1cd321e416f49ce30cf6ec08dad7b09dbb2ce8a21cd"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): the rustc API seems to call get_fn_addr() when not needed (e.g. for FFI). \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":"compiler/rustc_codegen_gcc/src/context.rs"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"bab1415f8f8ab11696e1b3834e21767795b4d91cc98a6e813ddae7eb71ca8d7d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): apply target cpu attributes. \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":"compiler/rustc_codegen_gcc/src/context.rs"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c3f31b7e81fa988e23211ea28219443c8dd8f690072381ca50e96e5fa8de5cf"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): implement. \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":"compiler/rustc_codegen_gcc/src/debuginfo.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd9cb49ba095a7c0a392239f971144dc446bedae18fded660e9b432bc409df5f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): implement. \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":"compiler/rustc_codegen_gcc/src/debuginfo.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4f0acdc20e7bbd201bd74b009ff665707130b83fc29274eb0313025d4fcae5b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(tempdragon): Not sure if this is correct, probably wrong but still keep it 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":"compiler/rustc_codegen_gcc/src/debuginfo.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"d85a0411f699650afdac663af3ee8ec42deac73a1f630b8ad45fd6aba851450c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): insert reference to gdb debug scripts section global. \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":"compiler/rustc_codegen_gcc/src/debuginfo.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"0892174844a4994e4c6b3cf8d864f1c512ae7e6215c44fe84ceeae0dfbd49507"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME(tempdragon): Currently, this function is not yet implemented. It seems that 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":"compiler/rustc_codegen_gcc/src/debuginfo.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1016d78df1c3c3803e8cc98068f4ea8b07cf0532b36c676553353e5a8537910"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): use the fn_type parameter. \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":"compiler/rustc_codegen_gcc/src/declare.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ccae8bf453547645cf2a973c3ae6df2bf34488ab2402b4251946f44e7894cf2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): use a different field than globals, because this seems to return a 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":"compiler/rustc_codegen_gcc/src/declare.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"71881c1cbc933bc49d010ddb3bde6df7c488eb2a18b16783ed4a5b4c625d6c54"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): set name. \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":"compiler/rustc_codegen_gcc/src/declare.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2b5e4c0bcd3869b1dc7d78d0cf75d51c6287acf0f9e5794d4ba3dd4d7e056cc"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): set name. \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":"compiler/rustc_codegen_gcc/src/declare.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5f87da53ed62b910ebe3d82409e93915dd3ed7ccb195ca94586b7eb08c1b494"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): set function calling convention. \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":"compiler/rustc_codegen_gcc/src/declare.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"87c36eb10e59458a4c260702335fe1a40ab0607d186adce3ff6a6e196f3da628"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): set no red zone function attribute. \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":"compiler/rustc_codegen_gcc/src/declare.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"f656617cd03bba5e65aedd85e6cb2594b31ba350579921277c38dd266619b7f9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): set attributes for optimisation. \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":"compiler/rustc_codegen_gcc/src/declare.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c46e744811e2895edae8f3e0ca10825eec7cd7233a287e2c42b8e942be972b9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): set attributes for non lazy bind. \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":"compiler/rustc_codegen_gcc/src/declare.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbcc1f99f0d762b68c9cd6081b2bd4216d86ded4485394924e8ec9cf902fcbcf"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): invalid cast. \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":"compiler/rustc_codegen_gcc/src/declare.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"f86cf796aabd7dd47e52ecfe0735f34b8253b250403254e93e70c8facbbac6d5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): this is a hack because libgccjit currently only supports alpha, num 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":"compiler/rustc_codegen_gcc/src/declare.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"d71839c33aa591527211ad285bb8e48a39f0780a61b8535e41479cbd955f86de"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): \u0060*\u0060 might not be expected: https://github.com/rust-lang/rust/issues/116979#issuecomment-1840926865"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_gcc/src/declare.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"70876f2d649f6b94068e9ca96bc80e2a4cd3b1671a16a4609f40309b2ec189cf"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: LLVM also sets \u002Breserve-x18 here under some conditions. \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":"compiler/rustc_codegen_gcc/src/gcc_util.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"627d7cca7906f16d1b37336ae9e9186bda62fe647e823fe01ea0585b18c562ef"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: seems like x87 does not exist? \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":"compiler/rustc_codegen_gcc/src/gcc_util.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5f6c6ed9e50c98475a744f59afc902697493932a4f6f969bac4d891036ac26c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): use the proper builtins for llvm.x86.sse2.cmp.pd and similar. \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":"compiler/rustc_codegen_gcc/src/gcc_util.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"c32781810940b28f9c0b8f7937ef9b57daecd437545de71c7337c270bc9a50a0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): We should define the stack probe symbol to be __rust_probestack, but it seems GCC cannot do that. \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":"compiler/rustc_codegen_gcc/src/gcc_util.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"00f4c58b6f703392fd70994dca93bf04480f1c6c2d99d6240fdbb43abb030f90"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): support soft-float. \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":"compiler/rustc_codegen_gcc/src/gcc_util.rs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"0710b57352ac2343f0acf1b028d5cf489a63c5b324a39614eaf2f200d80dcdc0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): remove the casts when libgccjit can shift an unsigned number by a signed number. \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":"compiler/rustc_codegen_gcc/src/int.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"835073753e6a75d378146ef1c53264aba9d7dba9a1e66c3820d94068e3a92f48"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): remove duplication with intrinsic? \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":"compiler/rustc_codegen_gcc/src/int.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"95d262bbb8841279f47188b80a0d38f752861df07cd51148925385e2dc339cad"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): use __muloti4d 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":"compiler/rustc_codegen_gcc/src/int.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"19732402863491300fcd99ed1278ab6e954726087901073a173d944db309fc9b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): is it correct to use rhs type instead of the parameter typ? \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":"compiler/rustc_codegen_gcc/src/int.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"979e167932054ff3ec8d0d429476c1dcd5c60a8f7a8c8b63b6382da4ddaf7820"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): cast to u128 for unsigned comparison. See below. \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":"compiler/rustc_codegen_gcc/src/int.rs"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a3ca1cd3be3b7914fab4fdda9510aa58bbeedfa6e58b06ebd5afabe60229e34"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): remove the casts when libgccjit can shift an unsigned number by an unsigned number. \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":"compiler/rustc_codegen_gcc/src/int.rs"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3c5eeaeae311934a26930cd08ee8dc6611be0961e28b6eb75c210bb58a28900"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): adjust this ^ comment. \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":"compiler/rustc_codegen_gcc/src/int.rs"},"region":{"startLine":766}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3514a10453647193ec6760ef333ca6c0b57f517280cf0c328d138421e1c0305"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): check if it\u0027s faster to use string literals and 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":"compiler/rustc_codegen_gcc/src/int.rs"},"region":{"startLine":805}}}],"partialFingerprints":{"codehealthFindingId/v1":"df77a87c490a874c7ef6a89f5fe99a3e02d15abe77651525893fa8b8755ce727"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): this cast should not be necessary. Remove \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":"compiler/rustc_codegen_gcc/src/int.rs"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"265d668131c12e2ee2cd99a00f9e1d8db336c366c3baf500b98681216eab6c5f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): libgccjit cannot create 128-bit values yet. \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":"compiler/rustc_codegen_gcc/src/int.rs"},"region":{"startLine":830}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e4560b8776ece5e1e793dd86764f2a4c849a97dc6c27d176fb53087b72d7b1d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): libgccjit cannot create 128-bit values yet. \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":"compiler/rustc_codegen_gcc/src/int.rs"},"region":{"startLine":856}}}],"partialFingerprints":{"codehealthFindingId/v1":"faaecaffde3d146dae662e3fdbd054b7f06418e7bfcc7a791dc7f5297f5c100d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): use a new function new_rvalue_from_unsigned_long()? \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":"compiler/rustc_codegen_gcc/src/int.rs"},"region":{"startLine":844}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4a71b75e79050a1bfb72db091eff9d2a0ef8e0762eb7b1aedc6d9f79dbcad3c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): can we use https://github.com/rust-lang/compiler-builtins/blob/1a99c2aa295bb2d507fa0e67a3b5eef64fba92a0/libm/src/math/support/int_traits.rs#L485 instead?"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_gcc/src/int.rs"},"region":{"startLine":938}}}],"partialFingerprints":{"codehealthFindingId/v1":"22fd53a83aecf7e3bacb3bfa03f7f020136823e7e3ebe8b8f114dc1f2b7ca159"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: use self.location. \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":"compiler/rustc_codegen_gcc/src/int.rs"},"region":{"startLine":943}}}],"partialFingerprints":{"codehealthFindingId/v1":"428432b4b374ab963c28883100e3ec31eb302103ba0a2dea9706598d9fee9477"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): that shouldn\u0027t be Sync. Parallel compilation is currently disabled with \u0022CodegenBackend::supports_parallel()\u0022. \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":"compiler/rustc_codegen_gcc/src/lib.rs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"61ffb492cff15fed8c0ba958507f3fc9ba1b776d63c1d31b72bef25025dd621d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): set opt 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":"compiler/rustc_codegen_gcc/src/lib.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"deae7f1bb40f4875136718129fcbea20ac19beef108c2f777ae837d44f07fdb6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(bjorn3): Limit LTO exports to these symbols \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":"compiler/rustc_codegen_gcc/src/lib.rs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"043b97fde398eb3d91fc391a9d02af816939f36e4efec73fc199c7debaf28be9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(bjorn3): Limit LTO exports to these symbols \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":"compiler/rustc_codegen_gcc/src/lib.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"032b5cf69948380e7defea5212fe19cb725b0d1478f9f6d075ae201418c18ba5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): set unique comdat. \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":"compiler/rustc_codegen_gcc/src/mono_item.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b5178c87361b89edb966c8802cae4e08f31b411159ea6c4bdf492e33d416f97"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): use inline attribute from there in linkage.set() above. \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":"compiler/rustc_codegen_gcc/src/mono_item.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b216bb94a8003da6e7d3c8360c993fbc88d8ee3cffe4a5c3850230e18475c44"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Should we handle dso? \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":"compiler/rustc_codegen_gcc/src/mono_item.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5771622b5b43af169016dce97effbb637e36bcfb569cf8875c184f529d6675b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): this is misleading to use the next power of two as rustc_codegen_ssa \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":"compiler/rustc_codegen_gcc/src/type_.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"48d27671e307297b9440cedfc195811a30c87b563db983cc6cbfb761ea1ab65b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): use address_space, perhaps with TYPE_ADDR_SPACE? \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":"compiler/rustc_codegen_gcc/src/type_.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"17136aab9f14f3d6cbe3df57996c684d3f0010419daf1e0c58b2fb0487c50943"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(eddyb) We could find a better approximation if ity.align \u003C align. \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":"compiler/rustc_codegen_gcc/src/type_.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8924eeeab3ab1ba740748cecf85b8bc59aaea833104190dc2f922e501a6d2f9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(ppcf128): The GCC gcc_jit_types enum (which CType is based on) does not \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_gcc/src/type_.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"8393d8150c8b9bfd7c74eb5bf8959670bd33582c2ceae6db792693444d5c9e4f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(x87_f80): The GCC gcc_jit_types enum (which CType is based on) does not \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_gcc/src/type_.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"09a9976b8e6309e93ef7d0b70ef5ef53ec5f5c0618cc879040150b96fcb33099"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): support other 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":"compiler/rustc_codegen_gcc/src/type_.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd5df48249ec15aa41001a689ef14b46c130e9ecd16f1972106745b4e3edaa05"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): I don\u0027t think that\u0027s true for libgccjit. \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":"compiler/rustc_codegen_gcc/src/type_of.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f615d635dfa9008da4eaea5652dadf5088f8223edde218617165b288146d1d3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): find a less hackish way to handle the on-stack attribute. \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":"compiler/rustc_codegen_gcc/src/type_of.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab5c0ccbd74dd40caaff0e6e85cf6440a53563e01c4188f3dca2e8ca93f89417"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): this bugs certainly don\u0027t happen in this case since the bool type is used instead of i1. \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":"compiler/rustc_codegen_gcc/src/type_of.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccaf224a8437f63e1a5cd59920b97c65aca249215e692db5cf70d9c471496740"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: we should not need this hack: this is required because both _mm_fcmadd_sch \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":"compiler/rustc_codegen_gcc/src/intrinsic/llvm.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"c48fea6bd28fa996d03cfe9b3c9a9253ea8c46f18510fe1cd21788b287bf0f6e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this might not be a good way to workaround the missing tile builtins. \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":"compiler/rustc_codegen_gcc/src/intrinsic/llvm.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"c63b3af40054755a52df8864aa8f275f6cb5efd45bfcf5c360b41906fe01b67c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: the intrinsics like _mm_mask_fmadd_sd should probably directly call the GCC \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":"compiler/rustc_codegen_gcc/src/intrinsic/llvm.rs"},"region":{"startLine":707}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac1ce09191f2b4dfd4333a64027acd3f2ca4d94861e3b10a1ddc1a4eff7923a4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): find a way to refactor in order to avoid this 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":"compiler/rustc_codegen_gcc/src/intrinsic/llvm.rs"},"region":{"startLine":1026}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6749ec580f0361786652cc6ebbda8c341924bb22c1ade94e78c52b87c7e3f68"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: GCC doesn\u0027t support __builtin_arm_isb yet, check if this builtin is OK. \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":"compiler/rustc_codegen_gcc/src/intrinsic/llvm.rs"},"region":{"startLine":1103}}}],"partialFingerprints":{"codehealthFindingId/v1":"c14da95bcdc12fff1608e086aeadbc4cdf993f70a69973b9d53a1bdf31f1a13c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Should handle other targets than \u0060ia32\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":"compiler/rustc_codegen_gcc/src/intrinsic/llvm.rs"},"region":{"startLine":1111}}}],"partialFingerprints":{"codehealthFindingId/v1":"73faa3632a597b5cb868d60bf0d407f7801db03731386f069378a3c6f0169c28"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Should handle other targets than \u0060ia32\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":"compiler/rustc_codegen_gcc/src/intrinsic/llvm.rs"},"region":{"startLine":1113}}}],"partialFingerprints":{"codehealthFindingId/v1":"41c9731d8dfb268ae106df633d72e0735f7368c435f80e2ca9bae0ba053d9807"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Should handle other targets than \u0060ia32\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":"compiler/rustc_codegen_gcc/src/intrinsic/llvm.rs"},"region":{"startLine":1116}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4178e7e67abb2f891d485fb1dac48c0bce7964dcce20fe1e36c7c3adcaa83c5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: support the tile builtins: \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":"compiler/rustc_codegen_gcc/src/intrinsic/llvm.rs"},"region":{"startLine":1647}}}],"partialFingerprints":{"codehealthFindingId/v1":"072acf9dd37aed31c5cb5c8ef412af99e5414072f2b8b9640736cdf0abde0cbb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): We can probably remove these and use the fallback intrinsic implementation. \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":"compiler/rustc_codegen_gcc/src/intrinsic/mod.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"edc9a50f47feafbaec27ad5a69ab778d24d1118a4a81f60812bf815e8b848c99"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: calling \u0060fma\u0060 from libc without FMA target feature uses expensive \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":"compiler/rustc_codegen_gcc/src/intrinsic/mod.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2964975e6a49f1596bd758d9e9623516c9f5e4b7d061c7d0893ed8ccf577fb0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: calling \u0060fma\u0060 from libc without FMA target feature uses expensive \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":"compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs"},"region":{"startLine":1108}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ad418f172f2e721a0f6265d0a1260940219146b219a051db503144fada97442"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: use gcc intrinsics analogous to llvm.fmuladd.f32/f64. \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":"compiler/rustc_codegen_gcc/src/intrinsic/mod.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1e07b66d2a596a67b21a65d1c39933b55da2180117fe2e85e95a0a9f7e42679"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): LLVM creates an integer of 96 bits for [i32; 3], but gcc doesn\u0027t support this, so it creates an integer of 128 bits. \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":"compiler/rustc_codegen_gcc/src/intrinsic/mod.rs"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d4330a334aac9ed97d17180875738c485cc1423cb340abfe24bc29d97e0771a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME directly use the llvm intrinsic adjustment functions 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":"compiler/rustc_codegen_gcc/src/intrinsic/mod.rs"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0f88d4c60faadb125cc8706f6273681511a61f66a07973d294909bec87ebfae"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this should use IFN_ASSUME when we have internal functions 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":"compiler/rustc_codegen_gcc/src/intrinsic/mod.rs"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"4faaa9d2011e04b725a5b01c61f91591aa9321a18629bf25e2f4ba607b9789c6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(eddyb): Figure out when the simpler Store is safe, clang \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":"compiler/rustc_codegen_gcc/src/intrinsic/mod.rs"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"835799ff9d2b756ca8a0cb0155a8e064e1cfa34949eb7bcd8bbfddfb998ad795"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): find a more efficient implementation? \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":"compiler/rustc_codegen_gcc/src/intrinsic/mod.rs"},"region":{"startLine":891}}}],"partialFingerprints":{"codehealthFindingId/v1":"802893394780c73ec55d0ec16e2e6cba07c1916dae842aae171d02d9f3ae08b8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): use width? \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":"compiler/rustc_codegen_gcc/src/intrinsic/mod.rs"},"region":{"startLine":972}}}],"partialFingerprints":{"codehealthFindingId/v1":"80c54ec8049ed58294626aca4374d102c4aa7f2600669171efbe45097ad478e5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): write a new function Type::is_compatible_with(\u0026Type) and use it 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":"compiler/rustc_codegen_gcc/src/intrinsic/mod.rs"},"region":{"startLine":981}}}],"partialFingerprints":{"codehealthFindingId/v1":"4146fb34498e14133107b79b75bfa6cc0395a5ae58e1fe595054e3b439ac25b9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): use the optimized version with fewer operations. \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":"compiler/rustc_codegen_gcc/src/intrinsic/mod.rs"},"region":{"startLine":1085}}}],"partialFingerprints":{"codehealthFindingId/v1":"befec6d3c851da4c52fa0bed4fa6b091a9344eb67d7d5716c4a6fe6a87a0e852"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): remove this if/when native 128-bit integers land in libgccjit \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":"compiler/rustc_codegen_gcc/src/intrinsic/mod.rs"},"region":{"startLine":1094}}}],"partialFingerprints":{"codehealthFindingId/v1":"629d0f90bae7a1a7d8c895418283ccbdaac05a4685e8c5a6c7a5917549cca438"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): add a check in the libgccjit API to prevent this. \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":"compiler/rustc_codegen_gcc/src/intrinsic/mod.rs"},"region":{"startLine":1395}}}],"partialFingerprints":{"codehealthFindingId/v1":"55dccebc57525c40ea495f9f0741ac79a477f2474d32513412e6f0925a3aa560"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): refactor with the above require_simd macro that was changed in cg_llvm. \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":"compiler/rustc_codegen_gcc/src/intrinsic/simd.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea5ab06a2760aacc503241b8d18b7a5dc98495525ed2b2683f375116b8ab563a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): allow comparing vector types as equal in libgccjit. \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":"compiler/rustc_codegen_gcc/src/intrinsic/simd.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"e883cd6a4184c81accc25095396a7ce700f74b9af7338c59b03b30bb045e0439"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): For simd_insert, check if the index is a constant of the correct size. \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":"compiler/rustc_codegen_gcc/src/intrinsic/simd.rs"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"8528bc4867e6e6e7f1382ce27a7ef2561533db987576bea67b06a9ac561eb152"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): if simd_insert is constant, use BIT_REF. \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":"compiler/rustc_codegen_gcc/src/intrinsic/simd.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa4e54aac69b669fb6117cb3cd3e37aad04ba6c895ac9583ee1891c73cd4ea20"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): For simd_extract, check if the index is a constant of the correct size. \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":"compiler/rustc_codegen_gcc/src/intrinsic/simd.rs"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cd8c4bd6c38bad73a706d0743a7b6812db80d232e518a2d8a78391145317972"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): that\u0027s not going to work for masks bigger than 128 bits. \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":"compiler/rustc_codegen_gcc/src/intrinsic/simd.rs"},"region":{"startLine":801}}}],"partialFingerprints":{"codehealthFindingId/v1":"c53f0389c40b04fe151217b81c4c15975146b8a355a6034cdb97f96a79a9cd2c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): pand with 170141183420855150465331762880109871103 \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":"compiler/rustc_codegen_gcc/src/intrinsic/simd.rs"},"region":{"startLine":888}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e382da3b7ba81874c4ea7f55b1f4825adc3ae280c765a8a4c3b8e624fff0327"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this should relax to non-fused multiply-add when necessary \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":"compiler/rustc_codegen_gcc/src/intrinsic/simd.rs"},"region":{"startLine":897}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddd6f7f5fb3f30d68ed559b06c2bf55110216306ff7a48297421143dc0769ff0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): add platform-specific behavior here for architectures that have these \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":"compiler/rustc_codegen_gcc/src/intrinsic/simd.rs"},"region":{"startLine":908}}}],"partialFingerprints":{"codehealthFindingId/v1":"d382fc3a814003f5150d682a4c96c7d8496ae0e027736c5b7784d34ba9c849ab"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: it would probably be better to not have casts here and use the proper \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":"compiler/rustc_codegen_gcc/src/intrinsic/simd.rs"},"region":{"startLine":916}}}],"partialFingerprints":{"codehealthFindingId/v1":"98ca51612b2d5b2b3144edbc87f0a94d619c4692b535263ce3ed06ab477b788c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: use cx.layout_of(ty).llvm_type() ? \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":"compiler/rustc_codegen_gcc/src/intrinsic/simd.rs"},"region":{"startLine":961}}}],"partialFingerprints":{"codehealthFindingId/v1":"03f9e6218c8d7ad1ba8816c71bd9bcb3cb3da33c6a538b6f5902b241d966cdfe"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: also support unsigned 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":"compiler/rustc_codegen_gcc/src/intrinsic/simd.rs"},"region":{"startLine":1116}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b9a74ee44bd8ee37285ff6b6f3de4d9cb4c26abe4faa99f872409d5b1123080"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: also support unsigned 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":"compiler/rustc_codegen_gcc/src/intrinsic/simd.rs"},"region":{"startLine":1231}}}],"partialFingerprints":{"codehealthFindingId/v1":"7619a559ee0aafbf67eff093ab12f98acfcc293e930314840cb3889d2c0c5a72"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): calling \u0060or\u0060 might not work on vectors. \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":"compiler/rustc_codegen_gcc/src/intrinsic/simd.rs"},"region":{"startLine":1276}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c3097e50ec4cbecbe16a0482f808712ab200f85a66bf89ba484a2c003347748"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): improve using conditional operators if possible. \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":"compiler/rustc_codegen_gcc/src/intrinsic/simd.rs"},"region":{"startLine":1329}}}],"partialFingerprints":{"codehealthFindingId/v1":"15b7f26f2da555110ba1ba0cc15cdfe01f0c09dd546ab646ca80cbe494e3c14b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): convert lhs and rhs to unsigned. \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":"compiler/rustc_codegen_gcc/src/intrinsic/simd.rs"},"region":{"startLine":1332}}}],"partialFingerprints":{"codehealthFindingId/v1":"06b8009734cf008160c305e97a55a6107dc5dafb90226483fac9631204d5d320"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): convert lhs and rhs to unsigned. \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":"compiler/rustc_codegen_gcc/src/intrinsic/simd.rs"},"region":{"startLine":1366}}}],"partialFingerprints":{"codehealthFindingId/v1":"6028e85e10a3bbb54e018fcc72658fac9434d36b41412b6d7f5766645366cdd3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Use this argument. \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":"compiler/rustc_codegen_gcc/src/intrinsic/simd.rs"},"region":{"startLine":1443}}}],"partialFingerprints":{"codehealthFindingId/v1":"344f13b896a3a8ae71d9d7672098ee994749963d216fab3dc76e507789ca6de4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: handle the alignment. \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":"compiler/rustc_codegen_gcc/src/intrinsic/simd.rs"},"region":{"startLine":1558}}}],"partialFingerprints":{"codehealthFindingId/v1":"72f3bca09be936209aca993d7a086673e4485eb5fc622e44c6a7773730682011"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: handle the alignment. \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":"compiler/rustc_codegen_gcc/src/intrinsic/simd.rs"},"region":{"startLine":1646}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fb33668f81f8f847dbbedaeacb7711ccbe67e21244567e613f726f4bc8736ce"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): the executables compiled with LTO are bigger than those compiled without LTO. \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":"compiler/rustc_codegen_gcc/src/back/lto.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbf5f549c82d4fb5e729a09262cb5cf254142396690a4014f9143594a377d47f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): for performance, check which optimizations the C\u002B\u002B frontend enables. \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":"compiler/rustc_codegen_gcc/src/back/lto.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"f76669fbb667918203d7b5d24d7cd15b13aecff11956ec99b177e3515a9b32eb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): use symbols_below_threshold. \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":"compiler/rustc_codegen_gcc/src/back/lto.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5597a94809548701edf2aafbeb149577acc1286565209046cde3fab48c7c69b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): compute the cost of a module if GCC allows this. \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":"compiler/rustc_codegen_gcc/src/back/lto.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a617c8ad3feff7158929eceae9645eca7af9172bc1d3c0edd9ca7594a536914"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): Send -plugin/usr/lib/gcc/x86_64-pc-linux-gnu/11.1.0/liblto_plugin.so to linker (this should be done when specifying the appropriate rustc cli argument). \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":"compiler/rustc_codegen_gcc/src/back/write.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"52be7d6d293a4ea09cebead582d3b9bf59eb0adddb9f3852be25306dca3457b6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): segfault in dump_reproducer_to_file() might be caused by \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":"compiler/rustc_codegen_gcc/src/back/write.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ef741cdd5aaecd63239bfdd3c54fdc3c782406944570a213f0d10b20004b7f8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): since we do not do LTO when the linker is invoked anymore, perhaps \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":"compiler/rustc_codegen_gcc/src/back/write.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"491bf657889b05f61e6a6cb379bd39b8f42319d6488a2239603597cb4d8c1a2b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): The LTO frontend generates the following warning: \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":"compiler/rustc_codegen_gcc/src/back/write.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb32f036c3930865fea980b26aaf4151ba860bc9b139fce980aa482b66924888"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): to make this work, support weak linkage. \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":"compiler/rustc_codegen_gcc/example/mini_core_hello_world.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1908aef98aee842ebcd89cc5b1a9bf015ac64e47ba1acfa278939ac8aefb17a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: should not use shell 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":"compiler/rustc_codegen_gcc/build_system/src/build.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba89e144fdb73e1f86d1dc487f5e9844121632c915b39c679f423ee57b4c37bb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): remove once the atomic shim is gone \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":"compiler/rustc_codegen_gcc/build_system/src/config.rs"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"18ef8da7403eba741893b41b9538d5ca0812f399d680ad906838b67db902dce4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: create a function \u0022display_if_not_quiet\u0022 or something along the line. \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":"compiler/rustc_codegen_gcc/build_system/src/test.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7daacef443bef5b4b48ea9a6efbc1ef64c1b08beeb63a5aaf54eea8403227be"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: create a function \u0022display_if_not_quiet\u0022 or something along the line. \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":"compiler/rustc_codegen_gcc/build_system/src/test.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"88bbd31ee8d43b329216115c9df91a095b9ab6d0a9ad8121a97899427b16308b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: create a function \u0022display_if_not_quiet\u0022 or something along the line. \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":"compiler/rustc_codegen_gcc/build_system/src/test.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"1baa5fd42a5064b365838ba31d2874e50ed0bc5bfa52aea2416eedb09cc166af"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: create a function \u0022display_if_not_quiet\u0022 or something along the line. \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":"compiler/rustc_codegen_gcc/build_system/src/test.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"28512cd8c15fc63f085592231f7ad16234dda387897891641164be4d2bd1b471"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: create a function \u0022display_if_not_quiet\u0022 or something along the line. \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":"compiler/rustc_codegen_gcc/build_system/src/test.rs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"82470b0d1b22d9980505ebf28dfedadae720cd405867d40407dbff00dbf1abad"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: create a function \u0022display_if_not_quiet\u0022 or something along the line. \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":"compiler/rustc_codegen_gcc/build_system/src/test.rs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c237512732418160b7d40482f881ecd0bd1334b90feccb85f12a40082d50758"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: create a function \u0022display_if_not_quiet\u0022 or something along the line. \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":"compiler/rustc_codegen_gcc/build_system/src/test.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"41b56da36bb4380aadb6938cb751e57eb67095021e0546b0709b79610bc3ead9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: create a function \u0022display_if_not_quiet\u0022 or something along the line. \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":"compiler/rustc_codegen_gcc/build_system/src/test.rs"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"25e3aa12799f958406ab92edd2d59b629dbb05227f7da619466062d92c292739"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: create a function \u0022display_if_not_quiet\u0022 or something along the line. \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":"compiler/rustc_codegen_gcc/build_system/src/test.rs"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"3891a7817ba3badd895d13de8fde5edb0dd2cca877e6294c5ccea9e925559d1a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: create a function \u0022display_if_not_quiet\u0022 or something along the line. \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":"compiler/rustc_codegen_gcc/build_system/src/test.rs"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9d370f9af6d01b92d97d6ebf46dd5628ed50e8c1d946824d7c1af040e7e3636"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: create a function \u0022display_if_not_quiet\u0022 or something along the line. \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":"compiler/rustc_codegen_gcc/build_system/src/test.rs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"b875ae016c080d989911a66b7d92afd8af931891b02e1c22a55f6cdd4955d2bf"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: create a function \u0022display_if_not_quiet\u0022 or something along the line. \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":"compiler/rustc_codegen_gcc/build_system/src/test.rs"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8906cb49008ccefd48e9e8160e2a0496a125ea3b9bc730fa7bb459c2b1f5178"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: create a function \u0022display_if_not_quiet\u0022 or something along the line. \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":"compiler/rustc_codegen_gcc/build_system/src/test.rs"},"region":{"startLine":903}}}],"partialFingerprints":{"codehealthFindingId/v1":"3664c99f20bb244f69f35d299cb8eda474eb55f56a7c3263b9c2dec4d3048f86"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: create a function \u0022display_if_not_quiet\u0022 or something along the line. \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":"compiler/rustc_codegen_gcc/build_system/src/test.rs"},"region":{"startLine":933}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c3da27c26913baf3fe676af37e1dcc4d03790e629b89b21474bd61f9493f43b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: create a function \u0022display_if_not_quiet\u0022 or something along the line. \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":"compiler/rustc_codegen_gcc/build_system/src/test.rs"},"region":{"startLine":1004}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b936c1a03183ff11890fc4d809bcc24d1c1087da53c339d64d211fa2846a727"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: create a function \u0022display_if_not_quiet\u0022 or something along the line. \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":"compiler/rustc_codegen_gcc/build_system/src/test.rs"},"region":{"startLine":1091}}}],"partialFingerprints":{"codehealthFindingId/v1":"3df7e3a8168fa107ad0e037684dfde750f7b262eb0439b552e72e2e5b010cc26"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: create a function \u0022display_if_not_quiet\u0022 or something along the line. \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":"compiler/rustc_codegen_gcc/build_system/src/test.rs"},"region":{"startLine":1097}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ecd37148a1cf65294af51ead4a8e9e9dda86b4e15c1a85687daab778eaa50ea"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: create a function \u0022display_if_not_quiet\u0022 or something along the line. \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":"compiler/rustc_codegen_gcc/build_system/src/test.rs"},"region":{"startLine":1157}}}],"partialFingerprints":{"codehealthFindingId/v1":"65b06980d0eafcd371c57b31edcf7b8ac8e1aedd1b2f79d1518efe72754a4f1c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: create a function \u0022display_if_not_quiet\u0022 or something along the line. \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":"compiler/rustc_codegen_gcc/build_system/src/test.rs"},"region":{"startLine":1195}}}],"partialFingerprints":{"codehealthFindingId/v1":"9604da983a7423773ab8e3e8cdd24d6795419f35a2b0e9f27b2d6a26bfa6346c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: create a function \u0022display_if_not_quiet\u0022 or something along the line. \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":"compiler/rustc_codegen_gcc/build_system/src/test.rs"},"region":{"startLine":1531}}}],"partialFingerprints":{"codehealthFindingId/v1":"d23327afbbc7c89b4b9811d6192bcf0970dcf3b3634ed0725dd7e628e7468ba9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(GuillaumeGomez): when rewriting in Rust, refactor with the code in tests/lang_tests_common.rs if possible. \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":"compiler/rustc_codegen_gcc/build_system/src/test.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"588c4bc848b053b2524d4087b5f5534a7620f040ba94117e282bcd4bb31bd6f4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: doesn\u0027t work on m68k. \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":"compiler/rustc_codegen_gcc/build_system/src/test.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"88f2fa4851ae0b29bf3e949006f6effc554ee1f75a01d14fb4aa446934ae632a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): Re-add -Zmir-opt-level=2 once rust-lang/rust#67529 is fixed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_gcc/build_system/src/test.rs"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ccc9fa300fd6644267c22450777d884d4985c05a9cf9a83e73c764b4f0f3d50"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: the test tests/run-make/no-builtins-attribute will fail if we cannot find \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":"compiler/rustc_codegen_gcc/build_system/src/test.rs"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"66d5b6ca63b42bdac031e2a592e9b71ebe8f6273a7d02dc3c0528c4c2efa979d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): linker gives multiple definitions error on 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":"compiler/rustc_codegen_gcc/build_system/src/test.rs"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"53ee585e72a7d2ec167ffdbbeeec0e4239caf9c2d91f32ed524101aeadfa4851"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: too slow to run in the CI: the release build alone takes 46 minutes and 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":"compiler/rustc_codegen_gcc/build_system/src/test.rs"},"region":{"startLine":802}}}],"partialFingerprints":{"codehealthFindingId/v1":"f89fef918175798d1ab14d6139b49013404064122c4eb52ccf7373a373cea741"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: remove \u0060-Zforce-unstable-if-unmarked\u0060 once the doctest of \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":"compiler/rustc_codegen_gcc/build_system/src/test.rs"},"region":{"startLine":957}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb6dcebfc50a72d4cce4f181c781f0808543d2c79cee9f407739fe2437050000"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: one test (mem::transmutability::Assume::alignment in core/src/mem/transmutability.rs) \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":"compiler/rustc_codegen_gcc/build_system/src/test.rs"},"region":{"startLine":961}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f088702cc711826aa8d737487b042230927d7207cb7431511b5f24c5647ad2b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(antoyo): run in release mode when we fix the failures. \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":"compiler/rustc_codegen_gcc/build_system/src/test.rs"},"region":{"startLine":1008}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b805f76650d4b2af3b1722ddecb2d1a386d54a19a3b573ad45ce08c688e52f2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Right now, remove_dup_assign cares about assignments to the exact same 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":"compiler/rustc_codegen_gcc/build_system/src/fuzz/reduce.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"75474cb6adbec78290d9b2fd9caa0d3f33d0239a747ed9fe033d7202af1a80e9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this check is flawed: it will never remove the very last function(the one before main). \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":"compiler/rustc_codegen_gcc/build_system/src/fuzz/reduce.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"7187e2cf5d82d2d8c5a8477bb73df8d994eef99170b89cc31d89afded25255e8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME Can sometimes happen, see rust-lang/rust#70531"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/src/base.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"d17669d740a77f862c084d85c8b76638e643067b3f205063c57967669a245891"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(explicit_tail_calls): add support for tail calls to the cranelift backend, once cranelift supports tail calls \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":"compiler/rustc_codegen_cranelift/src/base.rs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cc0280db2266fd7740363150d5e9d00f432c7964f040a99b02b6903f84c2b4e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(bytecodealliance/wasmtime#8312): Remove"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/src/base.rs"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"58dc63148e11f15f7847472d02bac266ec6a4c703bc7e8b42b5b5f9270877122"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME use emit_small_memset where possible \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":"compiler/rustc_codegen_cranelift/src/base.rs"},"region":{"startLine":852}}}],"partialFingerprints":{"codehealthFindingId/v1":"958f70f40e1bfd3c72764d8ada3a63c149835c2e3914e317152f14a433f1dd6e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(bytecodealliance/wasmtime#8312): Remove in favour of native"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/src/cast.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bf9791117c0c65f3d396f0349a541face62f000b53c1af77fed32ccca744779"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME implement fcvt_to_*int_sat.i8/i16 \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":"compiler/rustc_codegen_cranelift/src/cast.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"be029e2ad0ac8ff596f165b6801dbf016fc130c99b92774bd2a5186469a9dba0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(bytecodealliance/wasmtime#8312): Remove once backend lowerings have"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/src/codegen_f16_f128.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"c41d6d4d0b80c71c4937472cae43095a5ae2ee015cd7d266a8ecea6905b13428"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(bytecodealliance/wasmtime#8312): Remove once backend lowerings have"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/src/codegen_f16_f128.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"d656d29cbc300f40e32508cacae2c86f5e00ab11a059916b36ddd9b172fd93b5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(bytecodealliance/wasmtime#8312): Remove once backend lowerings have"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/src/num.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb4de3087c503616b225b98ac638a2c1007fb1e29fb4b81e52a80ac597428975"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(bytecodealliance/wasmtime#8312): Remove once backend lowerings have"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/src/num.rs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"a86d640ab4f346c44922553584a6afc17f6a99df83118c6a603586f1bc7e9e5d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME legalize \u0060icmp_imm.i128\u0060 in Cranelift \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":"compiler/rustc_codegen_cranelift/src/common.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"08d2c704e1fe19d3ba3e27d010d9c570f59cf0ca2cbb58ce7671647ca1f46658"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME replace with core::ffi::c_size_t once stabilized \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":"compiler/rustc_codegen_cranelift/src/compiler_builtins.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2cfe0c58297d7c73f1e6aae84238447210a1495039d3340eed984680e7effd4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(f16_f128): Add other float intrinsics as compiler-builtins gains support (meaning they \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":"compiler/rustc_codegen_cranelift/src/compiler_builtins.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"66ec05969bb4e16a96b894a6b7ea13675f2db91117def97e3f69d44d228a9eea"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME avoid this extra copy to the stack and directly write to the final \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":"compiler/rustc_codegen_cranelift/src/constant.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff2e0a8f355e7a81847ba56346ce36994c4f39e339494388fc96a100d39637a5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: should we have a cache so we don\u0027t do this multiple times for the same \u0060ConstAllocation\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":"compiler/rustc_codegen_cranelift/src/constant.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"157f7553c82c100419a2928b8aacbe9878166987ccbf3aea4dc4f3616d66f35b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(rust-lang/rust#85105): Casts like \u0060IMM8 as u32\u0060 result in the const being stored"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/src/constant.rs"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"69bc15e5a674198717063d80da6adfeb1f94395fcd032de30a0f6ad1038bb32a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME handle the case where the function was made private to 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":"compiler/rustc_codegen_cranelift/src/global_asm.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b8344e3d87c3005fe49f3552b55e61dba14f24dc594fc5a844f86fc29fddee7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME no inline asm support for s390x yet, but stdarch needs it for feature detection \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":"compiler/rustc_codegen_cranelift/src/inline_asm.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"234bb92d2ab06e48f21b7911d5010c492575af668a1039ab9965d0c68911794c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME add .eh_frame unwind info directives \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":"compiler/rustc_codegen_cranelift/src/inline_asm.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c8904692e57f70f2643d312ee08caa607f21dd9254162427084f735166c9444"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME use try_call once unwinding inline assembly is 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":"compiler/rustc_codegen_cranelift/src/inline_asm.rs"},"region":{"startLine":916}}}],"partialFingerprints":{"codehealthFindingId/v1":"085ec7e068d3dd1ed167b02f074ecb205b01769a93fbe42f20a926ced59f4156"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME return the actually used target features. this is necessary for #[cfg(target_feature)] \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":"compiler/rustc_codegen_cranelift/src/lib.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5996e63f0a29d6f06c5a73f64bb2de6a7170badb5bc8af3823a4a4a3abc4d3b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(f16_f128): \u0060rustc_codegen_llvm\u0060 currently disables support on Windows GNU \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":"compiler/rustc_codegen_cranelift/src/lib.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b512c66d9a4ea7d791a525cf62ccb23989c7a02d45aaeb7b5cc7dc656480421"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(f128): f128 math operations need f128 math symbols, which currently aren\u0027t always \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":"compiler/rustc_codegen_cranelift/src/lib.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"db3ed9b125ae1a8b41657dec7db4837bbcd273a804c0c72dac1784af2286d64b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME handle \u0060-Ctarget-cpu=native\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":"compiler/rustc_codegen_cranelift/src/lib.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f585fc96076ee1d08affdc47f41664bee1949f751143204558228736748803f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME remove dependency on this from the Rust ABI. cc bytecodealliance/wasmtime#9510"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/src/lib.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"98cfd2d8d26343e3c6238903a2b2c16978dd301796bd1e61142c9d20a9db8fc2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME remove dependency on this from the Rust ABI. cc bytecodealliance/wasmtime#9510"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/src/lib.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cf0198a82a32954e6ffa9068fd711daef1ab4bc0cd5555b971e4c93a82a49bb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME set program arguments 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":"compiler/rustc_codegen_cranelift/src/main_shim.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8d420349e2981b12695f6c55d2d34d4a327337fea72961200c0f4fa2a597f8e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME do proper abi handling instead of expecting the pass mode to be identical \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":"compiler/rustc_codegen_cranelift/src/main_shim.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc67fb02d29036660972b886a32cbb7d9ef591a30a2287f63e524a4038fb6ecf"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME trap on overflow for the Unchecked versions \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":"compiler/rustc_codegen_cranelift/src/num.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"6418a03b0a70d4bba3f122b52bc8f058b81a21e13cdc258d193628e4fc7d7cb8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(CraneStation/cranelift#849) legalize iadd_cout for i8 and i16"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/src/num.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"78c1498148de212b01dd9c8243672854667dd29815f29fc3e31a86b9ca339055"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(CraneStation/cranelift#849) legalize isub_bout for i8 and i16"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/src/num.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf4ca30187b30b8678ccf29f5f0bbb2d95125afe00ba88e498dfab6b26290325"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(bytecodealliance/wasmtime#8312): Remove once backend lowerings"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/src/num.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"472625ad479d81108f51cdf8af076722ebf3e4cbb87bc8d45856e902b650afd0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(bytecodealliance/wasmtime#8312): Already converted"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/src/num.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"832b0c2cdaa1bb1c9fe375117e46afb5f4aa6a3159a20253c0b474b0d4776e78"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(bytecodealliance/wasmtime#8312): Already converted"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"db64c4b74fa963843af66fc3488c4903081803360e167f58eccfac38c6956209"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(bytecodealliance/wasmtime#8312): Replace with Cranelift"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/src/num.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a6c46dd7802a7014a26971c846056c1885c0aecdbcef95adca3e87f87f31f30"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(bytecodealliance/wasmtime#8312): Replace with Cranelift"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"0051146ca0e35255ce6df1874395cfea307c928adfe85b9b9b5f1d7474b1ce53"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(bytecodealliance/wasmtime#8312): Replace with Cranelift \u0060fcmp\u0060 once"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/src/num.rs"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"409e3eb968a85b550f6bd4e9c7e4fe40bad57e04eff9de90a37351c8d425dc7a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(bytecodealliance/wasmtime#8312): Replace with Cranelift \u0060fcmp\u0060 once"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/src/num.rs"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"74f05c338a3b23f6fda5c576314dac7c1ba58b0dcb87516b067bd0f40989b4a4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME work around filename too long errors \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":"compiler/rustc_codegen_cranelift/src/pretty_clif.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"abc0347dadb8ce1c269d87d446c01535fba31fd863720a7e3cc1486273b59f2d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME remove \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":"compiler/rustc_codegen_cranelift/src/value_and_place.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"1357d3c396c77ebf962b3a4fb8ab3ac565ee4dd7b42956e557158292ee476b78"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME generalize vector 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":"compiler/rustc_codegen_cranelift/src/intrinsics/llvm_aarch64.rs"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc378a2056a4372f436f88b7699395c9e673520b586366289f1a6374e84f2f06"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME split this one out once saturating 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":"compiler/rustc_codegen_cranelift/src/intrinsics/llvm_aarch64.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"afacb2efb24624b3a9605e2c736a54bb13c0d9faba4366636b0488aa643bbd46"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME saturate? \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":"compiler/rustc_codegen_cranelift/src/intrinsics/llvm_aarch64.rs"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f6608ddb2f3d5cbe0e5b4dbd7a8c6aa1a827b633014d1cd68b95b84fb9d1b7e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME correctly handle unalignedness \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":"compiler/rustc_codegen_cranelift/src/intrinsics/llvm_x86.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"af6b17311ddd44be0c4b4d3ce215d820fa946f563ae7ef5d028dccf1622911c9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME use vector instructions when possible \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":"compiler/rustc_codegen_cranelift/src/intrinsics/llvm_x86.rs"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb717cba8232c38b0e92ab08a846f438734ca7a2428902da74b6ef20fb890432"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME use vector instructions when possible \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":"compiler/rustc_codegen_cranelift/src/intrinsics/llvm_x86.rs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0a8e064918f9f3a4d4a69a0bff992f174c45aeb4a1936430cc4d420ba43c5e6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME use vector instructions when possible \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":"compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"66b43f9177e17c1a66071a33b4694d0579193c511017394211ee7a0316f26d53"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME use vector instructions when possible \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":"compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a58b6f57ee89d652559c948a44c376b9ac79a7ff37fc1df3188bda2f848c89b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME use vector instructions when possible \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":"compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"0802af6971d9eaffd3c12b7071f071043a59258349faeb7869cc886242e6788f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME use vector instructions when possible \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":"compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs"},"region":{"startLine":986}}}],"partialFingerprints":{"codehealthFindingId/v1":"e47e2bb75f9798ba85ce0fa31a2d08a6e4e8bbc2bde9642a12adb252b1744d23"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME move all uses to \u0060simd_reduce\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":"compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cfb45e12f60cc62b989fedb359a60855360d8092b64a231bf305d4b736e78e8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(bytecodealliance/wasmtime#8312): Use native Cranelift operations"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b75013b56f60cbc6d3167fade91ecca16a0337dd10d05df25220642bc6f28c9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME emit_small_memmove \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":"compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"490d60cbcf9794b3ef7192ecd35d5379e1ddb0c5c0ba0297fcf5150bc5aacde8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME emit_small_memmove \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":"compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"479a57c9fb8be2890d5a0ea0f2e4e8103204e00cece747b2fd321d2f996d2285"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME make the copy actually volatile when using emit_small_mem{cpy,move} \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":"compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3a2edf52cc4f8910f1f826317dc4aff9eb55e311729326dd6d40f70bb13d167"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME emit_small_memcpy \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":"compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"886e0c64e4d86024e27e16f74535170d0801e5fa29aac72067a22cc445cf252a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME trap on inexact \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":"compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b2c8d7c595020afbcd9eda1a08a9c3cd63f6a3ba98a0138f88762ec30afc5dd"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: remove the guard here once \u0060umin.i128\u0060 and friends 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":"compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ca56e982c052cdc0e5fdab28708a2b2055f072e95feef151ea97bebf9c3be59"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME make the memset actually volatile when switching to emit_small_memset \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":"compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"33b65d789ea13864db98cebae9828eede92527dcf2f8c449add0e07d2d90ab42"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME use emit_small_memset \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":"compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"b792821834a7de2125871f3bc9c4b0def568007d8713f9b09ae86413ab5e57ab"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME trap on \u0060ctlz_nonzero\u0060 with zero arg. \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":"compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa6f60cee27f152bf19d7cc0f480ce104e809b0856bf121ff7eb6ac264d008ff"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME trap on \u0060cttz_nonzero\u0060 with zero arg. \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":"compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e8cb44c6b01da99ccbc36b031b062c8eec16b0674e4c3fe3ffc63d8df55e801"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME correctly handle unaligned_volatile_load \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":"compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs"},"region":{"startLine":693}}}],"partialFingerprints":{"codehealthFindingId/v1":"649b79654f3904dcb4f8f97486ada7f0f8791cfd71514952bd692a10e5220b4a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME correctly handle unaligned_volatile_store \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":"compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs"},"region":{"startLine":703}}}],"partialFingerprints":{"codehealthFindingId/v1":"12b3fc1ebdf14f3e738721da47ad2ae3e9b0b77345033720edc9b1cddd6fea45"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME actually do nontemporal stores if requested (but do not just emit MOVNT on x86; \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":"compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ca4e6115e6f9c9b5b19d7d1f53aa1077f6769c952178958e269f99c6064f611"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME this can be an exact division. \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":"compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs"},"region":{"startLine":718}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cb0810b6c2ff62f2eb05ce8237699f51a0f01ab4bb0f1721e7b74395aaf5408"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME use a compiler fence once Cranelift 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":"compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ed39923947bcab02f61c8efe9eac7a6a810c52d54332b9d92a2db051cb42035"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this ignores the atomic ordering and the volatile flag. \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":"compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs"},"region":{"startLine":758}}}],"partialFingerprints":{"codehealthFindingId/v1":"4561164ad3c70aca2be27491dee463a18a83848793c8c9b669c8d79bd9debb6f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this ignores the atomic ordering and the volatile flag. \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":"compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs"},"region":{"startLine":794}}}],"partialFingerprints":{"codehealthFindingId/v1":"239e4fb0afdb86361d5194b10fdb178ed29cf490bcf4452cfa36610df73afa59"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME implement 128bit atomics \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":"compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs"},"region":{"startLine":763}}}],"partialFingerprints":{"codehealthFindingId/v1":"a21bdb06223f5563b76b911bd519e3b33d0f1b7d7fe7ba40cef4f72f736c01fc"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME implement 128bit atomics \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":"compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs"},"region":{"startLine":799}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d0f96422720794b9a4dbf6abf7601cfe03cbe5e92021af3994ecfd396d4bef5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(bytecodealliance/wasmtime#8312): Use the native operations once"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs"},"region":{"startLine":1250}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd4754c1b65d130e93b7258f54cebcb6945b6e96475a7c13a6819015f97b052c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(bytecodealliance/wasmtime#8312): Use \u0060fmin\u0060 once  Cranelift"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs"},"region":{"startLine":1303}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5345445f5fbbf9d5db4fde92fbb6afeb40c81d6ef756b55fcbda1536ac58d99"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(bytecodealliance/wasmtime#8312): Use \u0060fmax\u0060 once  Cranelift"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs"},"region":{"startLine":1343}}}],"partialFingerprints":{"codehealthFindingId/v1":"86c2fdf97207445fabe61f4dec57bcd96415efbf0768fa94a25d26b7ae6bfd22"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME add and use emit_small_memcmp \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":"compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs"},"region":{"startLine":1542}}}],"partialFingerprints":{"codehealthFindingId/v1":"cec33e22aa02badf9f422da130c5ef904b2e0bca0e8c30e52ef1ad4720453999"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME implement black_box semantics \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":"compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs"},"region":{"startLine":1583}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ed66e5940c26ef3025320406565cd879e3b26db3b0b1047ae51ee01b3a761dc"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME implement variadics in cranelift \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":"compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs"},"region":{"startLine":1587}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2b07870848405baf8f4c65f0fec4437cc6e942906916471999c462515295296"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME implement variadics in cranelift \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":"compiler/rustc_codegen_cranelift/src/abi/mod.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a452f5d38e67d55c9cc7eb91c64aab08211f1452b8823dbd626c52c5123c5ff"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this is a terrible abstraction-breaking 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":"compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb04427eb8d0984ebae2ffdd31a94d30b3bc915aedcc16606fea7f1bab4fb884"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME validate \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":"compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"b532eec27ee29d02cad25b90abec05a2f004c2a9882cfdcf95f9436a0b49c75a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: simd_relaxed_fma doesn\u0027t relax to non-fused multiply-add \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":"compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"c407001717324a82891c851cd593dd2f3d924e10d0590503e5379e2e7bff517a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME there must be no acc param for integer vectors \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":"compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"980179488d48e3bb9a5da83014b12bef04256308ac5f6e11ec0e78e81cf652ec"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME there must be no acc param for integer vectors \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":"compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6671a9eb568748fbc0c578fa467c0c1c544cf21f15062a11d63fffbb56eecf8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME there must be no acc param for integer vectors \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":"compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs"},"region":{"startLine":673}}}],"partialFingerprints":{"codehealthFindingId/v1":"017d84815c43b88ec4ce9257aebe726be73c13978536c6c5d6da2a9ac847ea4a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME there must be no acc param for integer vectors \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":"compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs"},"region":{"startLine":693}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb71d5ea0f62ab474e1dad6a4bb89fd46a39ab623b94bf6cd6a0642e3d7c154d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME better handling of sign \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":"compiler/rustc_codegen_cranelift/src/debuginfo/emit.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"321e0c75515d018ac4110f1f521189129ae5912db735d9f5b8b86905d0410909"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME use the actual type layout \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":"compiler/rustc_codegen_cranelift/src/debuginfo/mod.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"628fbcbdccf92aac61700633e19daff12adcb6d0a8ed0db209741a48916b689a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME implement remaining types and add unreachable!() to the fallback branch \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":"compiler/rustc_codegen_cranelift/src/debuginfo/types.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b5497f6046c31db37d0f0a1819bc96a1eeafdcc441cc1e9804a005e0616012b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME implement debuginfo for wide pointers \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":"compiler/rustc_codegen_cranelift/src/debuginfo/types.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ddb58258dfa940167519716ff00dd909654a23ac01a20848fdec02d027a58a4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME only add personality function and lsda when necessary: https://github.com/rust-lang/rust/blob/1f76d219c906f0112bb1872f33aa977164c53fa6/compiler/rustc_codegen_ssa/src/mir/mod.rs#L200-L204"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/src/debuginfo/unwind.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"d34f5f5053c82f844b5c67785366c96f693e11c434a107fe786526906838125c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME only add personality function and lsda when necessary: https://github.com/rust-lang/rust/blob/1f76d219c906f0112bb1872f33aa977164c53fa6/compiler/rustc_codegen_ssa/src/mir/mod.rs#L200-L204"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/src/debuginfo/unwind.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef1d871363efb54522d687e467d4772aaa78497e8cb82067b6dab4088a34ccd1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME use eh_personality lang item 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":"compiler/rustc_codegen_cranelift/src/debuginfo/unwind.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"861835c06aec54c3f89f964045d50dbd6c4211b52f8d4afed8a2f2fdf9454032"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME use unique symbol name derived from function name \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":"compiler/rustc_codegen_cranelift/src/debuginfo/unwind.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"afc1bcb4e10af0bced91e3a06f2c3aef7daaf1c7254d1f9c2da12010c4339555"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME support unregistering unwind tables once cranelift-jit supports deallocating \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":"compiler/rustc_codegen_cranelift/src/debuginfo/unwind.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"8432c27334c09179b37027ca954dc1e3f65f3d104fb589bb2729d7f27c0633d4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME any way to reuse the abi adjustment code in rustc_target? \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":"compiler/rustc_codegen_cranelift/src/abi/mod.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"e385b4a0c6674bd1925d5c0536de13f05df39d43518f31fc1c463aa01968928c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME avoid intermediate \u0060CValue\u0060 before calling \u0060adjust_arg_for_abi\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":"compiler/rustc_codegen_cranelift/src/abi/mod.rs"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a39c38d877147944467ea9b87f468d6781aa147094736b973671efd6b1959b0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Find a cleaner way to support varargs. \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":"compiler/rustc_codegen_cranelift/src/abi/mod.rs"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"d661a133be216199d1b680c1b34ef295aba14816ca9a48728483d0fbba410885"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Add support for non-integer 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":"compiler/rustc_codegen_cranelift/src/abi/mod.rs"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"144709af39c3249481df9afd911e03ddc2049a4f77d37bb7b3cfb93831779918"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Set %al to upperbound on float args once floats 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":"compiler/rustc_codegen_cranelift/src/abi/mod.rs"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b6539091981e1576ae36a0cc040ef5bc02bc7f5e6db66888283ad91eea69f57"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME dedup terminate blocks \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":"compiler/rustc_codegen_cranelift/src/abi/mod.rs"},"region":{"startLine":937}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6da5d6e40e72c1037fa0f232beae9f76859b723f2fe7e5c9ff4d8668d045de5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME add an actual unwinder or somehow register JITed .eh_frame with gdb to avoid relying on \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":"compiler/rustc_codegen_cranelift/scripts/jit-helpers.py"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"d411cac08cbf812df257d7f3dd56c08f4cb47cbd668da44009f95eefedc2154c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME personality signature depends on target \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":"compiler/rustc_codegen_cranelift/example/mini_core.rs"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"418bd6080f069636851693808fa03c28b5c810bf5b201c44c7035db38acfa16f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME false positive \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":"compiler/rustc_codegen_cranelift/example/mini_core_hello_world.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f4218a4de7c485ea64e4c72d5b77ecf40694e69f75aa1ada45cfe96a84a20d8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME enable once inline asm sym references are stabilized in cg_clif \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":"compiler/rustc_codegen_cranelift/example/std_example.rs"},"region":{"startLine":769}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d8e8c5bb25c2c7452686773ca8f7ca962c7618a6e9b83e3e5abeaacb65c6524"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME check that all passed in tests actually exist \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":"compiler/rustc_codegen_cranelift/build_system/main.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"c46b914bc2fe2c5ba62b94e57c3d7423121189c286fc41c1133b98e431492031"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME avoid copy and patch if src, patches and target are unchanged \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":"compiler/rustc_codegen_cranelift/build_system/prepare.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0bfab4688f2b07db801c1c88343b21d0261f08a5e426b65cd37476e6087d913"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME call once for each target and pass result around in struct \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":"compiler/rustc_codegen_cranelift/build_system/rustc_info.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"a28cd7dc1fc1b04cb3093a37c5bf0ddc901591b7b3c0496fdf7eebcfc1194b26"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME reduce usage of custom test case commands \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":"compiler/rustc_codegen_cranelift/build_system/tests.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"349975f378cb609cdb59772a45d3498325e6ea05226415d6276bcebf78aa7522"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Disable AVX-512 until intrinsics are supported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/build_system/tests.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffab5cdd925e1fd979b30378d1bf6f36c8d06d0d20255f62d26646bd73656b30"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME uncomment once examples work: https://github.com/rust-lang/portable-simd/issues/470"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/build_system/tests.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"362dc733f86432f8029b95905e607857547340d60387bb0e44e60e93b71e1a75"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME remove --tests once examples work: https://github.com/rust-lang/portable-simd/issues/470"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/build_system/tests.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fc47a5c6d9f4253ce4092a13c937fabf514e44f7444929a5e2fdfcf67ba20c4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME missing arm64 intrinsics for swizzle_dyn \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":"compiler/rustc_codegen_cranelift/build_system/tests.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"d062075dc31c2121861e4da900f82966da11a8a301d876042456651ee9886f7e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Add support for remaining architectures. \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":"compiler/rustc_codegen_cranelift/build_system/tests.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8054e06cf2b49a28f31c2020da9cb85bb8012a10f0836eccb7f71279f178f7f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Add support for remaining architectures. \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":"compiler/rustc_codegen_cranelift/build_system/tests.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"91258cb57e1dee57c1c31881c0772d982806d47f431f588b65f50755fddc4924"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME - if we get deref patterns, use them to reduce duplication 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":"compiler/rustc_builtin_macros/src/alloc_error_handler.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccb5f2f45134568b1dd08502dbbedf206563d589d86da31bdde0419700854aba"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME - if we get deref patterns, use them to reduce duplication 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":"compiler/rustc_builtin_macros/src/global_allocator.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"9849a577275527c0a11d84302db63f49d2541d9451cc05cc35cb90a94a3e8dc6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(c410-f3r) See https://github.com/rust-lang/rust/issues/96949"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_builtin_macros/src/assert.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"b304b3edd35739cee5ca2a24f95a927a40460abf0dbad54ff65171b779466d49"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //! FIXME(ZuseZ4): Remove this once we have a smarter linter. \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":"compiler/rustc_builtin_macros/src/autodiff.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"f50fbb34989079dd778d65f077a8797f41c8979cdb7682c4cb733ceda4c8d312"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME(ZuseZ4): Once autodiff is enabled by default, make this a doc comment which is checked \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":"compiler/rustc_builtin_macros/src/autodiff.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd8304a4da79b477b75b7e3c9a250eb8a8cca2e41eb8aa0710c164e6fe408bb5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(Sa4dUs): make individual activities\u0027 span available so errors \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":"compiler/rustc_builtin_macros/src/autodiff.rs"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"02a112c2665952fd58b639597393e43d5df8268b4e6c8dcb63feca80919fe9b8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this kind of manual token tree munging does not have significant precedent among \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":"compiler/rustc_builtin_macros/src/contracts.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f442cda8bbbbc919f6d67e4d62f9058d24ec797594f1b2d60826ad5e1833328"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: idk yet how EIIs show up in docs, might want to customize \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":"compiler/rustc_builtin_macros/src/eii.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"75cafa71ab6d8cc3ef98c21ba4ff67ca773474bb2cbffcfb7515e6182a8c202c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: \u0060get_exprs_from_tts()\u0060 already performed macro expansion... \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":"compiler/rustc_builtin_macros/src/env.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9534dd2753ee767decab493803fff4bc00f1e7f58a997a0a17a02fe9a2cebe1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(dingxiangfei2009): Investigate the set of attributes on target struct to be propagated to impls \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":"compiler/rustc_builtin_macros/src/deriving/coerce_pointee.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2c5ed055ce9063dd4079b690fa79c6440a04f209642ebf582647cb9729fea08"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This is currently needed to avoid a regression with attribute macros after \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":"compiler/rustc_builtin_macros/src/deriving/default.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"88af7aeb419369733f63a4b30d7ef5474934f03ff81fb0207b8d5fe88a23e533"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Built-in derives often forget to give spans contexts, \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":"compiler/rustc_builtin_macros/src/deriving/mod.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb92a0c8cc658ba2432e4acde65845e460dfcec43a71d7df8e4dd7ccb6b20fed"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(reborrow): same as above. \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":"compiler/rustc_builtin_macros/src/deriving/reborrow.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"14a46a111a1b37d5b60928517a54cc47417350632722c054fd2aa5f6947a12c8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME(reborrow): if the Reborrow experiment is rejected, this can be turned \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":"compiler/rustc_borrowck/src/borrow_set.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"65132d676d67caa86ede744ebd59881bdd74e7894c94148bed21e790053c1fa9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: differentiate \u0060TwoPhaseBorrow\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":"compiler/rustc_borrowck/src/borrow_set.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e756da43739cb1e95d8aa039ec7acd9906cb2cf5f43ee0f40406f20c2bdc11f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(reborrow): why doesn\u0027t SmallVec offer reserve? \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":"compiler/rustc_borrowck/src/borrow_set.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba97c8a18c211c1554708d6e89067f30dc88e16d57425ac5ba3c9a864ff635ee"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: if the issuing region \u0060i\u0060 can reach a live region \u0060r\u0060 at point \u0060p\u0060, and \u0060r\u0060 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":"compiler/rustc_borrowck/src/dataflow.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"a45abbabc0022736ad29acefb5661b591e0de30ec82d1021b571fbeca40582ce"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: We first check whether we can name the highest existential universe \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/handle_placeholders.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"08c2335a231a326e737f40912ee2356ed4f3c415aef1547717d78e9325d02d5f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This is also used by opaque type handling. Move it to a separate file. \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":"compiler/rustc_borrowck/src/handle_placeholders.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d6f8e42caa330900e3ae531405f7e8b6af14c6bdd3fda6be345fad076e786d3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this two-step method is annoying, but I don\u0027t know how to avoid 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":"compiler/rustc_borrowck/src/handle_placeholders.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"65e89a13f4d42060a85edc94516186c4e84c4b07917790431d3492b2c2b0cc91"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: if we can extract a useful blame span here, future 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":"compiler/rustc_borrowck/src/handle_placeholders.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d2e8df74f7f50cc184688f3120b9aee43889e7baabdb62d8f8d2bbedd3eacad"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: ideally this would be a set of \u0060BorrowIndex\u0060, not \u0060Place\u0060s, \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":"compiler/rustc_borrowck/src/lib.rs"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"62f1e74160f0ec8719684839d9b77e9a33079d32c72136c20fa8d177a8df605c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // 1. assignments are always made to mutable locations (FIXME: does that still really go 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":"compiler/rustc_borrowck/src/lib.rs"},"region":{"startLine":803}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5dcbbf243799c94a9ed426d099d131ccc1b3ecaa512f3cd952cba88fa604bdb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Remove check that the place is initialized. This 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":"compiler/rustc_borrowck/src/lib.rs"},"region":{"startLine":830}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f6089a88a5222f3bbae39d31f198c15336cd7c000b6aec222faf98d503a17c9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: @nikomatsakis suggested that this flag could be removed with the following modifications: \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":"compiler/rustc_borrowck/src/lib.rs"},"region":{"startLine":1118}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f5c987ce738bd27e176b35abade66982e492dd0c018800c6757f34d920e1c53"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We\u0027re cloning the \u0060SmallVec\u0060 here to avoid borrowing \u0060root_cx\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":"compiler/rustc_borrowck/src/lib.rs"},"region":{"startLine":1627}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8ef1e609a322790c0c522225275c9d7596b1af255504828f77e230b7715311e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // (FIXME: see check_loans.rs) \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":"compiler/rustc_borrowck/src/lib.rs"},"region":{"startLine":1765}}}],"partialFingerprints":{"codehealthFindingId/v1":"013d1bdcb1c068a2c80cc021f296239c28425527f0f1efbd245ed3dbd9ef5f11"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(nll-rfc#40): do more precise destructor tracking here. For now"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/lib.rs"},"region":{"startLine":1819}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa402fb5b44f41872fc7ca72c0fdce9ecb69bc87bc5546b62515bfa498598083"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: allow thread-locals to borrow other thread locals? \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":"compiler/rustc_borrowck/src/lib.rs"},"region":{"startLine":1823}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bedeb878fa9b14789819147b0de606017671472072489481d3f47cf78831d82"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: should be talking about the region lifetime 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":"compiler/rustc_borrowck/src/lib.rs"},"region":{"startLine":1846}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1df2634b93c6da8523b544bfcae1aca93fc4131f1a963d93c032d5a31dce029"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: is this true even if P is an adt with a dtor? \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":"compiler/rustc_borrowck/src/lib.rs"},"region":{"startLine":2260}}}],"partialFingerprints":{"codehealthFindingId/v1":"15446d4914303b73400eb464354222b5b711628e17c9c25ad120998bfb62912f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#146079): we shouldn\u0027t have to clone all this stuff here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/nll.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"f15696ac188ca91cc486db6b4b621b3547efcaf542897931b4c4ad9faaea6b8a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(@lcnr): We currently don\u0027t dump the inferred hidden types 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":"compiler/rustc_borrowck/src/nll.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c6ab85229b341386c73a1ddabb30f2b6d49cb8652bc511f99f7b243752b29ae"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: add union 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":"compiler/rustc_borrowck/src/prefixes.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0a457a5c7aec51e875fc87cbcf8ca6cc00aae3c4a3c207a26fb4760f47a07f1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#146079)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/universal_regions.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"65d074c1131ad4c0c7e721b2e207371ab4c1f705a2160e21153f4e80ec96d172"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#146079)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/universal_regions.rs"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"e87b3b495c24d29c0c323ae8d6e99c8e37258136f51e8d2b9dc87f927ea27d50"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#146079)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/type_check/free_region_relations.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3467620d130ae7eb39136c885c69e069adb3e5fa5d833ec44059a90290c21a2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#146079)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/type_check/mod.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"754a130c49075ee604c322eeb12ea55a8f1e25fba5ddbe3e4ca6b6b90762241b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#146079)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/region_infer/values.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bc5ecb5e034f54d68feba4b06ef7f9ae87d75a077af209aa5c7405c7282b182"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#146079)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/region_infer/values.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"652abbd191ca4c7b7fe4466be61bfd8acf92cbb22b4366aa0aff23d9f28c9f5c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#146079)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/region_infer/values.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"298bd816d3670b312c840ec1c4123883c50a570abd06b48911a12e1c35d0ed5f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#160495): Don\u0027t use an anonymous region here"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/universal_regions.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"51be86d363e6e98a07e49b69790e49a8ff5711802bac46cd5e8700e2e02702ee"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: It\u0027d be nice to print the late-bound regions \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":"compiler/rustc_borrowck/src/universal_regions.rs"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a0f8d32355d4c0c4dcaaa0eb7d4ac1a0380abb622e373d6b50e8bcfdc4dce37"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: As above, we\u0027d like to print out the region \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":"compiler/rustc_borrowck/src/universal_regions.rs"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc41f54045aff0bc88d823d7e2f774c1e980fe3f37b8860061e99ad31f36907d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#129952): We probably want a more principled approach here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/universal_regions.rs"},"region":{"startLine":889}}}],"partialFingerprints":{"codehealthFindingId/v1":"14f4e31bc07673ad5dfab9349854568baff3af27876bb16e6d3ae69fd11ed81c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME(#104478, #104477): This is a hack for backward-compatibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/type_check/canonical.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"17c93d5c92474a300e1b81393e6c30ee12ec9ba185bcbe6de62076a2509e47a3"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // hack in \u0060equate_inputs_and_outputs\u0060 which does have associated test cases. \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/type_check/canonical.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"1de8f28169ee3231e8989a479c77b8703dab48183809889d07e2727703c91b30"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: This should get removed once higher ranked region obligations \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":"compiler/rustc_borrowck/src/type_check/constraint_conversion.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d487b24e3369b9a7e247a7cd58464167a8426a8e26b3b236222ce563844a257"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(async_closures): It\u0027s kind of wacky that we must apply this \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":"compiler/rustc_borrowck/src/type_check/input_output.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fcffaad7de0bc57730ae866cad974bdcffbc6843ae6ad84ae62921484a69ef2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //  FIXME(BoxyUwU): This should probably be part of a larger borrowck dev-guide chapter \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":"compiler/rustc_borrowck/src/type_check/input_output.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"76a9c35a81c55dad15b8d7a93cfd82ac3c197a42a3ad2a60b6ce71c920a04d62"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: check the values \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":"compiler/rustc_borrowck/src/type_check/mod.rs"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b6780a040ae489f7480c67ea2995a61ee248709eec4639f2f5856094c9e8724"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK(#114936): \u0060WF(sig)\u0060 does not imply \u0060WF(normalized(sig))\u0060 \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/type_check/mod.rs"},"region":{"startLine":838}}}],"partialFingerprints":{"codehealthFindingId/v1":"262fb87f40c3e5879cc4c643f31b85b362d82d2ad5b74364f71ee1924f28d6da"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: This shouldn\u0027t be necessary... We can remove this when we actually \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/type_check/mod.rs"},"region":{"startLine":1062}}}],"partialFingerprints":{"codehealthFindingId/v1":"53d756193efaf4efe2cc86054491f70b337e9ee112c13a70dc8eb2e2b43c355e"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: We want to assert that the signature of the source fn is \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/type_check/mod.rs"},"region":{"startLine":1121}}}],"partialFingerprints":{"codehealthFindingId/v1":"b73ccf43cc3214d98539777932823376349bbc0862c998d74fe240efb4c810e8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#132279): Using \u0060Ty::is_sized\u0060 causes us to incorrectly handle opaques here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/type_check/mod.rs"},"region":{"startLine":2196}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff90ada37990c9026447ddffef0991dc58d4ff98a31cac6c8aba2c27823ba7f5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(reborrow): for CoerceShared we need to relate the types manually, field by \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":"compiler/rustc_borrowck/src/type_check/mod.rs"},"region":{"startLine":2576}}}],"partialFingerprints":{"codehealthFindingId/v1":"405ad187d42b608755a8a41fa335b95e4f2ebb5b5af4c0c72e79282e28969e2b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(reborrow): the covariance relations here seem confused even after we \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":"compiler/rustc_borrowck/src/type_check/mod.rs"},"region":{"startLine":2607}}}],"partialFingerprints":{"codehealthFindingId/v1":"344e16a25dc6e6413739380044d52a67c5ce92ce786c35a728b8932288c5bd47"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(async_closures): It may be useful to add a debug assert 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":"compiler/rustc_borrowck/src/type_check/mod.rs"},"region":{"startLine":2728}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ced1c51e0e85db3bc757cc820f87942c9976c8a64bdadda5c23b34ec9441d96"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this NLL optimization idea, to reduce work to relevant locals only, still makes sense \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":"compiler/rustc_borrowck/src/type_check/liveness/mod.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"4812b761d7718e15b48984c5b22a3e1df17ef5fe8a3c80139ff01d2effe22a8f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: there is an argument to be made that we don\u0027t need to do this for boring locals \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":"compiler/rustc_borrowck/src/type_check/liveness/trace.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffdf98b01e6c4e4e985c7c4ada967cc1841ea4e0d5c1af8be7eccfc51125a0b1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME for future hackers: investigate whether this 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":"compiler/rustc_borrowck/src/type_check/liveness/trace.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3feced1c6036a6e6542147d89069ff91d838c9ada8b3698e69ddbc41e2d543e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: reduce the \u0060MaybeInitializedPlaces\u0060 domain to the useful \u0060MovePath\u0060s. \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":"compiler/rustc_borrowck/src/type_check/liveness/trace.rs"},"region":{"startLine":718}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c3fb948e1c9bacedfbf925e419cc06cbde808b8737aca424de1df07d9fbf2f0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME - determine what we should do if we encounter multiple \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":"compiler/rustc_borrowck/src/region_infer/mod.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc1ebff621c2a7682aa078a8d2f0eef2a8589f283a84db98b13fc77d28418e92"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(dianne): That note shouldn\u0027t depend on a coercion being blamed; see issue \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":"compiler/rustc_borrowck/src/region_infer/region_context.rs"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"18e6f18010c30396b23daf0bb245127a77eaa0d297ee64e3e58fae4c4e2a6abb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We could probably compute the LUB if there is 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":"compiler/rustc_borrowck/src/region_infer/opaque_types/mod.rs"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"5305954bdb376c04eac33f1fe7aaeea980e23c13500617432fa6aca789741c1e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: add killed loans and constraint kind as edge labels. \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":"compiler/rustc_borrowck/src/polonius/dump.rs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eeac562ce073ee271cb8a509f45a5b73fb8f7d9be0057650f6fc6049d68eaae"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: add the missing variance information and remove this fallback bidirectional edge. \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":"compiler/rustc_borrowck/src/polonius/liveness.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bef65873c0a3ef64c5cb1f19f781a5cc3719e0f593f4b17ff95f3aaad3e583b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: that being said, we need to investigate these cases better to not ignore regions \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":"compiler/rustc_borrowck/src/polonius/liveness_constraints.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"5323c34b38d0d18c37e4eb18d7292de69d1efa9dcbb370212df507246129cc8c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: investigate the \u0060generic_const_exprs\u0060 test that triggers this issue, \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":"compiler/rustc_borrowck/src/polonius/liveness_constraints.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9cf778f2f4b35d145b9051552c28ccf79ccff682dd7bf3f4f0fdb03b575bb0b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: analyze potential unsoundness, possibly in concert with a borrowck \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":"compiler/rustc_borrowck/src/polonius/mod.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d7f25901ccd34260a89d6edbefe271ee441444957aa129c886d1ba2a74c6b42"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(bob_twinkles) is this actually the right thing to do? \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":"compiler/rustc_borrowck/src/polonius/legacy/loan_invalidations.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9b499351d895b35a66990a9a38b3e9700c526a5d3fe03e6c600a424533e8d75"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This error message isn\u0027t great, but it doesn\u0027t show \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":"compiler/rustc_borrowck/src/diagnostics/bound_region_errors.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"39ed7fe13adc297972335514090cc481c906895b67fb0c5c25646202d41dd570"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: one day this should just be error_element, \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":"compiler/rustc_borrowck/src/diagnostics/bound_region_errors.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"86c0e6a0b509a84862c7f85da7b39c0cbb70c3cbb0bffa7bd6cf1e0314287476"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(lqd): Unify and de-duplicate the following with the actual \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":"compiler/rustc_borrowck/src/diagnostics/bound_region_errors.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"57354d06eeb1e19ed5a9051c83d17d0b1f76a70c1f0b3bdb47786fd922aa8c36"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This error message isn\u0027t great, but it doesn\u0027t show up in the existing UI 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":"compiler/rustc_borrowck/src/diagnostics/bound_region_errors.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"e325fd9ad6effc6b280ce12dce57cf3f6142070ff3ede61620080136026fd720"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This error message isn\u0027t great, but it doesn\u0027t show up in the existing UI 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":"compiler/rustc_borrowck/src/diagnostics/bound_region_errors.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"aea32956200308936b556846a575d5dfd017cdf9093728ba76e4c96accef5c73"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We make sure that this is a normal top-level binding, \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":"compiler/rustc_borrowck/src/diagnostics/conflict_errors.rs"},"region":{"startLine":979}}}],"partialFingerprints":{"codehealthFindingId/v1":"b88169a43032a35d6d6b2527c4eedf906e3f9c0e74235dce53ae31646b3ae6d8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We could check that the call\u0027s *parent* takes \u0060\u0026mut val\u0060 to make 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":"compiler/rustc_borrowck/src/diagnostics/conflict_errors.rs"},"region":{"startLine":1222}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce16d5b88aefd734106f23c7a826c079694ec38cd3311309207e17afa12cd028"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // \u0060move || x.clone()\u0060 will not work. FIXME: suggest \u0060let y = x.clone(); move || y\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":"compiler/rustc_borrowck/src/diagnostics/conflict_errors.rs"},"region":{"startLine":1539}}}],"partialFingerprints":{"codehealthFindingId/v1":"59391fc1cc17e09dfca0828eb612f8b5341b8ec9985fb88e7cd7a97585e2d816"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: supply non-\u0022\u0022 \u0060opt_via\u0060 when appropriate \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":"compiler/rustc_borrowck/src/diagnostics/conflict_errors.rs"},"region":{"startLine":1821}}}],"partialFingerprints":{"codehealthFindingId/v1":"54e2b4a8742c51810a226623d5818d193fdb421d0f906d78b79f729e5780a3af"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This stops the suggestion in some cases where it should be emitted. \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":"compiler/rustc_borrowck/src/diagnostics/conflict_errors.rs"},"region":{"startLine":2298}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b9a2254ee711cfb0e2729ef7caeeaf1d107014155b5e361580b4f52c9120520"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: actually support such cases (need to figure out how to move from 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":"compiler/rustc_borrowck/src/diagnostics/conflict_errors.rs"},"region":{"startLine":2734}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a188b4909faad7d66ae22ad2b73eedae490e29079521ffad12041be87aeea46"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: also support deref for stuff like \u0060Rc\u0060 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":"compiler/rustc_borrowck/src/diagnostics/conflict_errors.rs"},"region":{"startLine":2779}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf6bc259a31266050dd79dac17f4a38fe6b5853bd60f8584f59a2c3d7f50c374"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME use a better heuristic than Spans \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":"compiler/rustc_borrowck/src/diagnostics/conflict_errors.rs"},"region":{"startLine":3580}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c4a87e7df7587c0a4e11ed808e4d5d6ac336c5ce93b058a81265bba3778e855"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: should we also account for binops, particularly \u0060\u0026\u0026\u0060 and \u0060||\u0060? \u0060try\u0060 should \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":"compiler/rustc_borrowck/src/diagnostics/conflict_errors.rs"},"region":{"startLine":4996}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e802ce5aea8afb3106bc04565b822b84d9ab0bc57d54f488e801eba8f207657"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#101728): enable rewrite when type ascription is stabilized again"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/diagnostics/explain_borrow.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"c201fac63a4cc3c5de87b86f395253b78f4afeb7588c92a021d770e23d74112e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#101728): enable rewrite when type ascription is"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/diagnostics/explain_borrow.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"1be3e05e610e6391a5b48c48bfb4fad4c6921fdcb325bc6c8830def9a9032b05"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(project-rfc_2229#36): print capture precisely here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/diagnostics/mod.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"710474dc76ee023e82977bbf8052dd11a5ecc9fcfe8cb7270367c2be4af3d545"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(coroutines): Make this just return the \u0060ClosureKind\u0060 directly? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/diagnostics/mod.rs"},"region":{"startLine":801}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf401b7d158eb9e1b7d514d01735771740a9cb2ee2b9c8d0718c497fc69ffc7c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(coroutines): Do we want this to apply to synthetic coroutines? \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":"compiler/rustc_borrowck/src/diagnostics/mod.rs"},"region":{"startLine":892}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a9774040a2667d42c2462b19a6544f4883ec95f81983fc461584da236a5a6aa"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: need to check whether the assigned object can be a raw pointer, see \u0060tests/ui/borrowck/issue-20801.rs\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":"compiler/rustc_borrowck/src/diagnostics/move_errors.rs"},"region":{"startLine":947}}}],"partialFingerprints":{"codehealthFindingId/v1":"814b1a480baf09aabc449dad47db8d62f50e43b674a57ff1f491f1a6fe5635ad"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: can this case be generalized to work for an \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":"compiler/rustc_borrowck/src/diagnostics/mutability_errors.rs"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"edd0bd90684b9843de335d7b0bfb92275212f8f7c5e2333b52df95bc63418802"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(fee1-dead) this somehow doesn\u0027t fire \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":"compiler/rustc_borrowck/src/diagnostics/mutability_errors.rs"},"region":{"startLine":1603}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dd9f2f9c17db083e50f45ff9db5c091b02626016d40402a74c69cb446008a8b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This error message isn\u0027t useful, since we\u0027re just \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":"compiler/rustc_borrowck/src/diagnostics/mutability_errors.rs"},"region":{"startLine":1644}}}],"partialFingerprints":{"codehealthFindingId/v1":"1685b8b3054ed0d5965ed50e6a6f0ecae07182567941a7723506248759869201"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This code is otherwise somewhat general, and could easily be adapted \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":"compiler/rustc_borrowck/src/diagnostics/opaque_types.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0932c418d9f51665272e4a16276bcd9f79d7773f2a506c7c1f773a4e7d9d0eb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We should be using a better heuristic for \u0060use\u003C\u003E\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":"compiler/rustc_borrowck/src/diagnostics/opaque_types.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2144d17e45c3c79a557bb5f03bb47b374c87ed0921666bc4a5d04f087f1836e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Currently, we only report suggestions if the \u0060RegionNameSource\u0060 is an early-bound \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":"compiler/rustc_borrowck/src/diagnostics/outlives_suggestion.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"f147a7cab5cfa2f25a883c6f15284f3b7ff3a660c69c3b067d3779e2798ac68d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME. We should handle this case better. 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":"compiler/rustc_borrowck/src/diagnostics/region_errors.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f263bdcbff484e63d3043093f05297fe467b0201ad29edc262aedf65ab69e2e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: currently we do nothing with these, but perhaps we can do better? \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":"compiler/rustc_borrowck/src/diagnostics/region_errors.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"e129b6dd021e90337a176c3b21d94d72f45652e7022cd263fd397987d8d7672f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: try collecting these constraints on the outlives suggestion \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":"compiler/rustc_borrowck/src/diagnostics/region_errors.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"19212ca87507ffecd37f62e36bee5bfdb654713793c8d1c7796815caacb9882f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Is throwing away the existential region really the best 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":"compiler/rustc_borrowck/src/diagnostics/region_errors.rs"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"24e501957d581a498c42106bf43d2e5838ad9e160746d9e4df9d0bd20a54aa6b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME these methods should have better names, and also probably not be this generic. \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":"compiler/rustc_borrowck/src/diagnostics/region_errors.rs"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdf67b9dd28107a6f9fbf72a96c637f40c5ebaf03df28cb20f8c4aa2c8f209a6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME note that we *throw away* the error element here! We probably want 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":"compiler/rustc_borrowck/src/diagnostics/region_errors.rs"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebadcb25cdad9ea1bbcfdb94185909ea54d7ba88eae371731edb9a78fbfdd789"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We should be able to do something similar 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":"compiler/rustc_borrowck/src/diagnostics/region_name.rs"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d8953b4713d108eb52e2e46940c2f7cac10c69a5ae6d1e2f861f92c04ce9890"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME there are other cases that we could trace \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":"compiler/rustc_borrowck/src/diagnostics/region_name.rs"},"region":{"startLine":701}}}],"partialFingerprints":{"codehealthFindingId/v1":"0931dd8ed40824889457657d3caaa5e2067bb322e43adaca3891faad994fa60b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(compiler-errors): Does this ever actually show up \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":"compiler/rustc_borrowck/src/diagnostics/region_name.rs"},"region":{"startLine":1070}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf802e8b7b9b7560c8a18ec0f66c97c5eb679ac01a52774e9c24af9fc3a5636b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(project-rfc-2229#8): Use place span for diagnostics"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/diagnostics/var_name.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"b18c086d28a36b5efba33b9e22ecefb2d0c40dd2063001a85b01f636eecbb695"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //! FIXME(jdonszelmann): delete \u0060rustc_ast/attr/mod.rs\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":"compiler/rustc_attr_parsing/src/parser.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"1370b50ddc8b0b7faf65d1ee21544c8deb242b0350e83e634a3db0ecbcbd5aa0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We currently emit a very confusing diagnostic if somebody tries to apply an \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":"compiler/rustc_attr_parsing/src/parser.rs"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"fee08f14ee80c3402e44b548c2330a4fa74f7581ff9533f9f0a33f6147234e82"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: We should make this a nice and extendable system if this is going to be used more often \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":"compiler/rustc_attr_parsing/src/synthetic.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"905d4abfcebfb89887622284bb9fa58af8053113956655b805c6b21340a2227f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Fix \u0022Cannot determine resolution\u0022 error and remove built-in macros \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":"compiler/rustc_attr_parsing/src/target_checking.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e28124c9d1ef8847d325adfefc3272e766e2f442772b41576517aa106ea7bf9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(jdonszelmann): all attrs should be combined here cleaning this up some day. \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":"compiler/rustc_attr_parsing/src/target_checking.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"be2d96a1013d5b6e54893c6d37d8c463c27567a833f2affd5803d2c51bb18209"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: support nested comments. \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":"compiler/rustc_attr_parsing/src/target_checking.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"734ee1fda57d11da7e61d00111e47130dcc22a096e4ce058503b82e67f0439f4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: properly find the end of the attributes in order to accurately \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":"compiler/rustc_attr_parsing/src/target_checking.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d952d00ea16e73c6ca9d127f2f8d846ff905b6764059f179a138873455e7751"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(where_clause_attrs): Currently, as the following check shows, \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":"compiler/rustc_attr_parsing/src/target_checking.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"959c2040884b667edbe818aa71999a896d2fff03c5baa3db6e6ba0dfc592e733"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We shouldn\u0027t need to special-case \u0060doc\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":"compiler/rustc_attr_parsing/src/target_checking.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ecebd28504ac428e42d36189ee688745299407dd859ef611f06e1dabbe42111"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(https://github.com/rust-lang/rust/pull/149960#issuecomment-3780301699): expand capabilities."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_attr_parsing/src/attributes/cfg_select.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eb547549d498e27e569fee03bd0a089afeaa2806a4875af6b92e8177d58e5d1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(https://github.com/rust-lang/rust/pull/149960#issuecomment-3780301699): expand capabilities."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_attr_parsing/src/attributes/cfg_select.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"9177779bbc3e006a448a2c0e189e49bf9780089cda00ab991c07f378b25a3488"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(jdonszelmann): upgrade this list to *parsed* attributes \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":"compiler/rustc_attr_parsing/src/attributes/codegen_attrs.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"12cdd58be57642c9cfedaf7fe54866800d5b7c13ce2585042fe3e66d8f9b4393"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(rtjkro): Currently, we\u0027re enum matching on \u0060cx.target\u0060 instead of \u0060cx.ast_target\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":"compiler/rustc_attr_parsing/src/attributes/codegen_attrs.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"efab970c09bf9daf55a03fba40c55cf20a23a8e3332d11a0aa9a372862803166"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Once rustdoc can handle URL conflicts on case insensitive file systems, we \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":"compiler/rustc_attr_parsing/src/attributes/doc.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"99164a4e96ea317919ccfdd044e118267ee0a75e12cbae2d41a8493ea60c8a6e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This should support attributes with namespace like \u0060diagnostic::do_not_recommend\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":"compiler/rustc_attr_parsing/src/attributes/doc.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"95dc3a79a5432198cac3f927bb77298878fc93fcd0b32c60b4ced02cb71e5b7d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: To be removed once merged and replace with \u0060cx.expected_name_value(span, _name)\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":"compiler/rustc_attr_parsing/src/attributes/doc.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"7681e8e1ddde84476b28ae9c1e1a8769db786b4cc3e5e378814c1a49912f5c35"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: remove this method once merged and use \u0060cx.expected_no_args(span)\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":"compiler/rustc_attr_parsing/src/attributes/doc.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"dad6e81630b2f0afe39b3deaf0b8e2f4dbcd194cfb0433cc585a562c1802cceb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: remove this method once merged and use \u0060cx.expected_no_args(span)\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":"compiler/rustc_attr_parsing/src/attributes/doc.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4a8c070a847c9cd730f38a8a09efffe3eaa8711432fc083417fd7f80ef09265"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(164728): every invalid notable trait attribute lint produces exactly \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":"compiler/rustc_attr_parsing/src/attributes/doc.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"908cb2c08323e44e7e21574687763fcf07b74ca50fbcc83ad7954834fabc2dd8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(164728): remove this method once merged and uncomment the line \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":"compiler/rustc_attr_parsing/src/attributes/doc.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"55145fc2f162fa4b2e9340ae04d2d82c3eb8fdd26cb84c90eadbf98936c0b9ee"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(164728): remove this method once merged and uncomment the line \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":"compiler/rustc_attr_parsing/src/attributes/doc.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"b691a218615f0a2c733dd882088f12c47ac0e2d4f53a4d020e3965dd296afc13"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: It\u0027s errorring when the attribute is passed multiple times on the 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":"compiler/rustc_attr_parsing/src/attributes/doc.rs"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd925eee117910ee37dd233ad6b42712662718e4c8d2e0beb176f632cbd2f19f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: It\u0027s errorring when the attribute is passed multiple times on the 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":"compiler/rustc_attr_parsing/src/attributes/doc.rs"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"39d4082eb9508c3516525dd3b982d020926936295d01117bdcffb7db1fbaea14"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: remove this method once merged and uncomment the line \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":"compiler/rustc_attr_parsing/src/attributes/doc.rs"},"region":{"startLine":817}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5ca41d6edb4c4aecd24e69a218314d90fabecb1becd8917fdbfec0874fa4fef"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Currently emitted from 2 different places, generating duplicated warnings. \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":"compiler/rustc_attr_parsing/src/attributes/doc.rs"},"region":{"startLine":937}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ada1189905f015a7e1243e13570f205c7325e9930d972a73690e4d5f119ea57"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: should we allow an ordinal of 0?  The MSVC toolchain has inconsistent support for \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":"compiler/rustc_attr_parsing/src/attributes/link_attrs.rs"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"92621edd0f8f264b0b16e030feb6b5d15c9e3d0f76ebff7bae78d4fcf79ea03b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We should recommend \u0060reason\u0060 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":"compiler/rustc_attr_parsing/src/attributes/lint.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d10d1931e7512c8c054129742420e91ee8ed3a149be9652ed95f73b14d72ce8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(164898) Lint attributes are unique because they\u0027re parsed twice with \u0060ShouldEmit::ErrorsAndLints\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":"compiler/rustc_attr_parsing/src/attributes/lint.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d56234549e4c001740e3753a4a314a5c9aeca245913c19733b584cdce011946"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME I don\u0027t think this does anything? \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":"compiler/rustc_attr_parsing/src/attributes/stability.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2b8f74337a3833e6328cc8ec60ec0201f0edae248f8e4897c0dd62cd4ef3ead"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME I don\u0027t think this does anything? \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":"compiler/rustc_attr_parsing/src/attributes/stability.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"f841a0c7bc8f5a0890ec87d340fd928c9d31e34773b109c15c306e8625fd5c8e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(jdonszelmann) change to Single \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":"compiler/rustc_attr_parsing/src/attributes/stability.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"55df14683849f4546240ddc42c0a12428c0a9d21f8139166060295b9077a6121"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#159429): temporarily renamed to mitigate \u0060#[unroll]\u0060 nameres ambiguity."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_attr_parsing/src/attributes/unroll.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ccbfa4417fc01718a5920a4590a93c1675700b79ac974517534f6183fa9438f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(mejrs) \u0060DiagnosticOnUnimplemented\u0060 is intentionally not 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":"compiler/rustc_attr_parsing/src/attributes/diagnostic/mod.rs"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"30f59a3b1718c92c47f69b3c72f7df75b0561e2d0de1573d6ed23f2e8af268f3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(mejrs) unfortunately, all the \u0022special\u0022 symbols above might fall through, \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":"compiler/rustc_attr_parsing/src/attributes/diagnostic/mod.rs"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f5574a3407d408421237501b1434db8ee7e793d601fe996cbaa883a65d30985"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(mejrs) no constness field on \u0060Target\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":"compiler/rustc_attr_parsing/src/attributes/diagnostic/on_const.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"502795c79ee1d891a33f741c303a54fb4cf26c5928c83fd0f1306e512a22e0d2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: use core::ops::FnPtr once trickled down to beta \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":"compiler/rustc_attr_ir/src/attribute_docs.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d510496208c6f2484a65ce50fcd0776e4377fe713b9e76f239443a9654ebb5a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: The \u0060doc(inline)\u0060 attribute is never encoded, but is it actually the right thing \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":"compiler/rustc_attr_ir/src/data_structures.rs"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"096c74a9966f5020410b30c0d3085c0ded6b77b2ffcddb4c5d733628ed2eca96"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME(#82232, #143834): temporarily renamed to mitigate \u0060#[align]\u0060 nameres ambiguity"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_attr_ir/src/data_structures.rs"},"region":{"startLine":1187}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff9912c4ca9aa0b8447eb218b5c859b527b991f06ee04b6ec6ff6d6be498b7d3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#134963): Temporarily prefixed with \u0060rustc_\u0060 to prevent potential name resolution ambiguities."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_attr_ir/src/data_structures.rs"},"region":{"startLine":1579}}}],"partialFingerprints":{"codehealthFindingId/v1":"eea134a0d8adf371451997249039c42159d31380271a8b4e6b991b570955c975"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME(#159429): temporarily renamed from \u0060#[unroll]\u0060 to mitigate nameres ambiguity."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_attr_ir/src/data_structures.rs"},"region":{"startLine":1586}}}],"partialFingerprints":{"codehealthFindingId/v1":"e05bb821e02a47996ba9379d83073cb05ce3b5544a67f71a255fa5e7184756f9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(rtjkro): \u0060AstTarget\u0060 has nearly one-to-one mapping with \u0060Target\u0060, barring the extra fields from \u0060AssocConst\u0060, \u0060Method\u0060, and \u0060AssocTy\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":"compiler/rustc_attr_ir/src/target.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"265c323eef5b0df41b3ff259a91df5b568740516f46f17135fe9db46d2b5509c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(deref_patterns, internal_syntax, forced_keywords, clippy): \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":"compiler/rustc_ast_pretty/src/pprust/state.rs"},"region":{"startLine":2021}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5af446ffa8eac4d8ad05ff25b06df7569c3057ace239eda86c9f2078bbe9928"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Print \u0060k#asm\u0060 once macro \u0060asm\u0060 uses \u0060internal_syntax\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":"compiler/rustc_ast_pretty/src/pprust/state/expr.rs"},"region":{"startLine":780}}}],"partialFingerprints":{"codehealthFindingId/v1":"381e3932e2a32e63dfc9d0b8c94070e160a988c744a1c3e99fd72291eefab17e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Print \u0060k#format_args\u0060 once macro \u0060format_args\u0060 uses \u0060internal_syntax\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":"compiler/rustc_ast_pretty/src/pprust/state/expr.rs"},"region":{"startLine":785}}}],"partialFingerprints":{"codehealthFindingId/v1":"8febcbde6ea4f7190c00bbe319c96ff732b766dd6a9b505e677db8da0124c2bc"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Print \u0060k#global_asm\u0060 once macro \u0060global_asm\u0060 uses \u0060internal_syntax\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":"compiler/rustc_ast_pretty/src/pprust/state/item.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9f1828ba9613a603603967a7e03428cbb3a573a6086a8ab6031c08b76c8474f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(splat): should splatting extern \u0022C\u0022 or other ABIs be 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":"compiler/rustc_ast_passes/src/ast_validation.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"df505ac610786b98265c3a6a530f2517f98ff0392e3d7002f138a145b06d889e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(precise_capturing): If we were to allow \u0060use\u0060 in other positions \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":"compiler/rustc_ast_passes/src/ast_validation.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5e4c78240a91143d213554eda759ce79d877f601c636d95cd759159ad45b169"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(workingjubilee): properly lint on acceptable input 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":"compiler/rustc_ast_passes/src/ast_validation.rs"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"05b8f8f793bf6e3b04260cc37c56203ec2776ccb502167a559accc29c5a0e10f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: The current diagnostic is misleading since it only talks about \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":"compiler/rustc_ast_passes/src/ast_validation.rs"},"region":{"startLine":1126}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a9a842fe377b0789f6cc2f5d62d2abebe83c0dec04235a46e6eac008bbea414"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(davidtwco): This is a hack to detect macros which produce spans of 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":"compiler/rustc_ast_passes/src/ast_validation.rs"},"region":{"startLine":1265}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e5f0285b99d066883e6955ff58821b991587ebfd1a5dfdb85a83970b36acf96"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const_trait_impl): Consider making the note/reason the message of the diagnostic. \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":"compiler/rustc_ast_passes/src/diagnostics.rs"},"region":{"startLine":863}}}],"partialFingerprints":{"codehealthFindingId/v1":"c40458bcca4d38e3ce98916b20e60fb5421ff4c68f8dc3b57feff9b1813ea95d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const_trait_impl): Provide structured suggestions (e.g., add \u0060const\u0060 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":"compiler/rustc_ast_passes/src/diagnostics.rs"},"region":{"startLine":864}}}],"partialFingerprints":{"codehealthFindingId/v1":"05cc780d20630b0924dc6965e428304ff10ae5a2ef25e452dcd073470305dfc3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: deduplicate with rustc_lint (\u0060BuiltinLintDiag::PatternsInFnsWithoutBody\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":"compiler/rustc_ast_passes/src/diagnostics.rs"},"region":{"startLine":975}}}],"partialFingerprints":{"codehealthFindingId/v1":"66a628bf67272607606c040545ff389be08fd6336890c024da4a5990938448d6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: deduplicate with rustc_lint (\u0060BuiltinLintDiag::PatternsInFnsWithoutBody\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":"compiler/rustc_ast_passes/src/diagnostics.rs"},"region":{"startLine":984}}}],"partialFingerprints":{"codehealthFindingId/v1":"25038698d23c096360f879b09e813e3783e463d5406b94c6d7ef75d6ab0ca044"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(non_lifetime_binders): Const bound params are pretty broken. \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":"compiler/rustc_ast_passes/src/feature_gate.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"6080c28d38a56af39e30d28a35f0f22bd0259a9cc823c2b17f407c9057f86315"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#154045): Migrate all of these to erroring feature gates and"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ast_passes/src/feature_gate.rs"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6e3213ac0e29e4dd3ca30bd20b84668173fde904d9a0c1c3d8fc3cfe77e5b94"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: should probably format this in fluent instead of 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":"compiler/rustc_ast_passes/src/feature_gate.rs"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"674ebb3fa35cde586084f973d032778136642cdeadc105e0293a7f3f705ad0f1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: parentheses/precedence \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":"compiler/rustc_ast_passes/src/feature_gate.rs"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b38189e303c0cfe52b626a1fb5373ab45208cf0a87409fc8fa3f533ad51f51c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: walk path segment with \u0060path_segment.hir_id\u0060 parent. \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":"compiler/rustc_ast_lowering/src/index.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3b169b08a50ecc9b1b48b7fdbf0618167fe852a5ea953bf3646cf586e7fd956"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(move_trait): We likely want to not add an implicit \u0060Move\u0060 super trait \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":"compiler/rustc_ast_lowering/src/item.rs"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7679be902341479febfcfee61f1a08855c1f80710b34f95d09d26657f09143b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#156628): lower unnamed enum variants to HIR."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ast_lowering/src/item.rs"},"region":{"startLine":699}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3ae8ee83a07d898038b9bedbcc87c3b519bf50248f49e4ca9d267f7a6df3bad"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(jseyfried): positional field hygiene. \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":"compiler/rustc_ast_lowering/src/item.rs"},"region":{"startLine":797}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1f0c7f8fa3ef744a8f7145ce38e28ba3554f7eb0a96e31692befc1ef8ea2968"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(contracts): Deny contract here since it won\u0027t apply 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":"compiler/rustc_ast_lowering/src/item.rs"},"region":{"startLine":856}}}],"partialFingerprints":{"codehealthFindingId/v1":"47a63fa25f9a9924bbd64ebfa0ada3c109166aee6f7fb3ccdd65f5f5d98c86c3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(contracts): Support contracts on async fn. \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":"compiler/rustc_ast_lowering/src/item.rs"},"region":{"startLine":1348}}}],"partialFingerprints":{"codehealthFindingId/v1":"c675f8ca7a8b271a62462fbfe736ae9396ff380ff9786232b6221644bc98daa3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(async_fn_track_caller): Can this be moved above? \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":"compiler/rustc_ast_lowering/src/item.rs"},"region":{"startLine":1359}}}],"partialFingerprints":{"codehealthFindingId/v1":"69ae84959305264a222a352a3946ec15bb7185ba8e82bd5055bf1922d001e72e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(gen_blocks): how does \u0060closure_track_caller\u0060/\u0060async_fn_track_caller\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":"compiler/rustc_ast_lowering/src/lib.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"da9b5711ed9b7c426a5b21fd5d757d98b0412e8e1a291c8570481c7edaa1f75b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Should we be handling \u0060(PATH_TO_CONST)\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":"compiler/rustc_ast_lowering/src/lib.rs"},"region":{"startLine":1419}}}],"partialFingerprints":{"codehealthFindingId/v1":"e85afe387140a36ed8a0b9eb0207ea381cd2aa6e49227bed0047b415b626eead"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(mgca): make this non-fatal once we have a better way to handle \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":"compiler/rustc_ast_lowering/src/lib.rs"},"region":{"startLine":1765}}}],"partialFingerprints":{"codehealthFindingId/v1":"00819dd6ffd3b2ee2136b966fc25ea24708263cce5907bc5f3f2f1065c7f4835"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(mgca): make this non-fatal once we have a better way to handle \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":"compiler/rustc_ast_lowering/src/lib.rs"},"region":{"startLine":3446}}}],"partialFingerprints":{"codehealthFindingId/v1":"18e4f1ac29009c0220388d9af45bae09491d9290078015bacb4ddb6054a39333"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME This uses \u0060fn_hir_id\u0060, which is not correct, it should use the parameter hir id 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":"compiler/rustc_ast_lowering/src/lib.rs"},"region":{"startLine":2016}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcecd280c75187b3673c6d163a5e9274d3a5c01b017553204f1c5b976462497a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(mgca): make this non-fatal once we have a better way \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":"compiler/rustc_ast_lowering/src/lib.rs"},"region":{"startLine":2417}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f9dc6f5941ef9e11f0e5054b3b1ae103a562629be156436ff8783776819bce2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(more_maybe_bounds): Moreover, if we actually were to add proper default traits \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":"compiler/rustc_ast_lowering/src/lib.rs"},"region":{"startLine":2492}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a8e2ea7840384daf1c7d7a868d8f138c0bc66e3146aa5180a92ff61c5c87b6e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(gca_macroless_args): Handling of underscores should be moved into \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":"compiler/rustc_ast_lowering/src/lib.rs"},"region":{"startLine":2649}}}],"partialFingerprints":{"codehealthFindingId/v1":"d316b6de51f8d6fdc7eae0f224ba3678f7def7c31d4ea5de226747d24f8c702e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(gca_adts): This check is incomplete. Type-relative paths and other complicating \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":"compiler/rustc_ast_lowering/src/lib.rs"},"region":{"startLine":2777}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea572cebf2cb897287647bb0ce73a664bfbeaac7d89e76f08903d73dc1f6649b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(mgca): update for \u0060fn foo() -\u003E Bar\u003CFOO\u003Cimpl Trait\u003E\u003E\u0060 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":"compiler/rustc_ast_lowering/src/lib.rs"},"region":{"startLine":2876}}}],"partialFingerprints":{"codehealthFindingId/v1":"9af92f1034600bdbbb64fc429bd3cd4e4682167c26d2ece23573d9bd9a53312b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(mgca): we may want this to be \u0060Optional\u0060 instead, 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":"compiler/rustc_ast_lowering/src/lib.rs"},"region":{"startLine":2936}}}],"partialFingerprints":{"codehealthFindingId/v1":"7240db3727637554cc1934da4aadb5e94d5b4122e5e11f7ad6967fd726c8edd8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(mgca): This might result in lowering attributes that \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":"compiler/rustc_ast_lowering/src/lib.rs"},"region":{"startLine":2947}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c784c80dde5b7002c75a44c856a853606e53f946dbcd70dcba537ad9de6f1e1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: do we want to allow \u0060expr -\u003E pattern\u0060 conversion to create path expressions? \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":"compiler/rustc_ast_lowering/src/pat.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"9569522defe73cf1474e140c01887e48e31e9d8bc5ff824aac48fd1decddb38b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // \u0060\u0060\u0060rust,ignore (FIXME) \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":"compiler/rustc_ast_lowering/src/pat.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"295ec4aa8e8cbcfde6a727fed4eaa9fe54e232812ed6f213d1699c04a16c9a1b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(return_type_notation): Is this correct? I think so. \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":"compiler/rustc_ast_lowering/src/path.rs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fed9cd09c8ce318448b3b398c10d2716a7bcd9d3bea52352c0c2e8f9a042c09"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME uses the segments HIR id which is not correct, it should \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":"compiler/rustc_ast_lowering/src/path.rs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"cde2486a29a30718a441d1ed9056d9dc732591ceb0125c663ec0a6b6ba2ca5d4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(contracts): Support contracts on 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":"compiler/rustc_ast_lowering/src/expr/closure.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa7bcbf4113841d62202df509dadb530253d7e0056d0d7b282ad33d79c47b861"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: for now we generate predicates such that all lifetimes are early bound, \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ast_lowering/src/delegation/generics.rs"},"region":{"startLine":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"f32d5e47adcce453fb0089c6873cc32013dc8dfdda2412050d06a2d8befa2135"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(cjgillot) AssocItem currently relies on self parameter being exactly named \u0060self\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":"compiler/rustc_ast_lowering/src/delegation/mod.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdd60c3934892f906121fd57e74041fb9e29d41d481077c26930e19f2b260c97"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(cjgillot) AssocItem currently relies on self parameter being exactly named \u0060self\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":"compiler/rustc_ast_lowering/src/delegation/mod.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a06f15fc844ff11049e7016b273f0b371a034558a7a499b5201de123f6fb4c6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(fn_delegation): add default \u0060..\u0060 for all other fields. \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":"compiler/rustc_ast_lowering/src/delegation/mod.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9430cdd408e0c912ae1f4f9cf0e5c2dbd03d6fb28c59183033e823729e2a751"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME(fn_delegation): correct resolution through \u0060ProbeContext\u0060 engine \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":"compiler/rustc_ast_lowering/src/delegation/resolution.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"92af72bd2e1a10bf5ab3249949438b61d699af6676be0baf0f9463d6fc71f3b5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(splat): use \u0060sig.splatted()\u0060 once FnSig has 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":"compiler/rustc_ast_lowering/src/delegation/resolution.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca2d2a0114f5c693dcc0603cf862d37d728ce2b37100e32ed49830410b97f7dc"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(fn_delegation): support deletion of target expression with defs inside. \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":"compiler/rustc_ast_lowering/src/delegation/resolution.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d3d892fb8f62f52eda7655f6605bf6de3bec011fbd0f4feae0ef1a08a7d3646"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(fn_delegation): support relowering with defs inside \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":"compiler/rustc_ast_lowering/src/delegation/resolution.rs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"c217b6d9cf514c6239f720597d0b79f0a1e761c8cff619ab27356ea1377026e3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //    FIXME(fn_delegation): think of enabling wrapping in more scenarios: \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":"compiler/rustc_ast_lowering/src/delegation/resolution.rs"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"32f268fff05b4e46807355275482c8ffbf307ec03f14fc990f53bdcdb7f82e5f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: remove after \u0060stmt_expr_attributes\u0060 is stabilized. \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":"compiler/rustc_ast/src/ast_traits.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cbea67f86124f829c543f0a26eee0779eca68a8fa9879d784c84039b5608b70"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Remove \u0060box\u0060 from this list given we officially no longer support box expressions \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":"compiler/rustc_ast/src/token.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad2eb172d50b21c199cc60d07fd12f09aad2b672e627455df4dc47880294859a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Arguably, \u0060use\u0060 should be included in this list since it can begin bare trait \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":"compiler/rustc_ast/src/token.rs"},"region":{"startLine":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"d99f9c3602625aeb3ba7997d57a55b01eacfe78ef7123b17cb1b5774b6c8f49f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: we currently don\u0027t return \u0060Delimiter::Invisible\u0060 open/close delims. To fix \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":"compiler/rustc_ast/src/tokenstream.rs"},"region":{"startLine":1012}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd156e06a32287a99821f5e84d6be3c392b8d56f739389417842d8839322a5d7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: ideally this would be derived from attributes like \u0060#[rustc_allocator]\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":"compiler/rustc_ast/src/expand/allocator.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8d6c66d5bd7f022d98e43fcbebdcdc4b0c2d187bb07cea9dca39626c27b5e4d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(ZuseZ4) We should make this more robust to 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":"compiler/rustc_ast/src/expand/autodiff_attrs.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"53ef4ec8df4870fd8b44167f6bf2f66c3ac77b3cca81a7b4e9eb83671677cf5e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //! FIXME: This description might be partly inaccurate and should be extended, along 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":"compiler/rustc_ast/src/expand/typetree.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"f904382f9eafc20280e00d36461bcabdc62576c8e9d479b3ce3aae2d82df1f36"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //! FIXME: Rewrite the TypeTree logic in Enzyme core to reduce the need for the rustc frontend 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":"compiler/rustc_ast/src/expand/typetree.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fe2772909e80ef8b7097008db72d5e4ff2189db950977f4c59c92bcb8c5a7bb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //! FIXME: We should also re-evaluate where we create TypeTrees from Rust types, since MIR \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":"compiler/rustc_ast/src/expand/typetree.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd23ebfcd3784019c5e1bcb7f115cc9cfd42307895ffc69347ab2783ac3c165f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Share code with \u0060parse_path\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":"compiler/rustc_ast/src/attr/mod.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"c367aec7bbf4be3704a33bdd63a145bfa6f5b927b641022256e1575217f4d4b4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This parses \u0060unsafe()\u0060 not as unsafe attribute syntax in \u0060MetaItem\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":"compiler/rustc_ast/src/attr/mod.rs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f84fa9265fad86730ea89c5dc9e62d5ca5edb4b06bc9d872f0eb3738438b4f4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this should *likely* use \u0060offset_from\u0060, but more \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":"compiler/rustc_arena/src/lib.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"4943383fee4b23f073733e1c983c10a19a423f61d9f46c1c00ffb6121161255e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this should *likely* use \u0060offset_from\u0060, but more \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":"compiler/rustc_arena/src/lib.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6576ebd221dfadc8bcfffb5e86395e3adbbe8339d8d91e0bac2f13da6cc756e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this should *likely* use \u0060offset_from\u0060, but more \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":"compiler/rustc_arena/src/lib.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d9765cb2966480b40a4792881c42fc3e249907049b48d986c8737f677d528b9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME(Zalathar): This is *very* fragile; perhaps we need a different \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":"compiler/rustc_arena/src/lib.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e21d2f64dd247f315614ff59c9ae76a3eee9e13558ab8508a0062d461ffee28"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK(eddyb) pretend the \u0060enum\u0060 field (discriminant) \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_abi/src/callconv.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"935c282476a6be6b2e25390baf8d13790ef7a0c263570815b3e9da2776a9053e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(workingjubilee): a particular reason for this nesting is we might not need these? \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":"compiler/rustc_abi/src/canon_abi.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"3309d00a136dc7957d0c01e7c3d8c245e7273ed760de29a244e965b0ace751c7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: ideally we\u0027d avoid printing \u0060CanonAbi\u0060, and preserve \u0060ExternAbi\u0060 everywhere \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":"compiler/rustc_abi/src/canon_abi.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"fab600c8a4ba4c1896b04166519579f24cbe3edf5aa70cfffdedfdac1542c4d8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: why do we have two of these? \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":"compiler/rustc_abi/src/extern_abi.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ed4aa9834dea10f81d7df53cf26fe1b118a2d5b22754bcb71ec841eb1152f98"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(FnSigKind): when PartialEq is stably const, use it 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":"compiler/rustc_abi/src/extern_abi.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"18d53d5809f3a9fe2cfb918dc1ff7c411d8f2e8c344242d6461b9847e4868a93"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(Kixiron): We can always shuffle fields within a given alignment class \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":"compiler/rustc_abi/src/layout.rs"},"region":{"startLine":745}}}],"partialFingerprints":{"codehealthFindingId/v1":"a774259302edf0fef491a38094426a0d0bb3c88339c916f0a864c16b3f3e3aa3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(oli-obk): deduplicate and harden these checks \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":"compiler/rustc_abi/src/layout.rs"},"region":{"startLine":819}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ded4cbb40fdc7d860c0ba5468eb5f42c7866efe2256007a89c5be96308560fa"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(oli-obk): deduplicate and harden these checks \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":"compiler/rustc_abi/src/layout/enum_layout.rs"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9a706842bad738820abf7230c57a9f5ac081c9e3a3490563e0ee990e1d5fbc5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME(workingjubilee): Consider adequately reflecting this in the compiler? \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":"compiler/rustc_abi/src/lib.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"81b4de9c4d3601747621d302e4a1e814e48ac571cc432ab76066f006d80ecd23"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(eddyb) maybe include I128 in the future, when it works everywhere. \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":"compiler/rustc_abi/src/lib.rs"},"region":{"startLine":1358}}}],"partialFingerprints":{"codehealthFindingId/v1":"78b6347d028f478ee4248a91d5511a51f7e054eab42613c1e5f4c605878228bc"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(eddyb) consolidate this and other methods that find the appropriate \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":"compiler/rustc_abi/src/lib.rs"},"region":{"startLine":1367}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aaf7035bb6415a983a84821453de4b206f71cf48cc11cc159527021ec599222"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(eddyb) always use the shortest range, e.g., by finding \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":"compiler/rustc_abi/src/lib.rs"},"region":{"startLine":1569}}}],"partialFingerprints":{"codehealthFindingId/v1":"e44a8624392193212f4183a05dc36f3e49b253509ca8ce7165a572d1d7e113b2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(eddyb) use small vector optimization for the common case. \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":"compiler/rustc_abi/src/lib.rs"},"region":{"startLine":1712}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfdc2f42731dcf149d114352c61e443da555d54fde4505a222e014190e69f54f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(camlorn) also consider small vector optimization 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":"compiler/rustc_abi/src/lib.rs"},"region":{"startLine":1721}}}],"partialFingerprints":{"codehealthFindingId/v1":"b762926526c6685ea834b7b553199eb0b8ced900a53e3af888a09792a58c932f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: I sometimes use memory, sometimes use an IR aggregate! \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":"compiler/rustc_abi/src/lib.rs"},"region":{"startLine":1866}}}],"partialFingerprints":{"codehealthFindingId/v1":"50396aba9686e90411e6c6b1841ca8c84cf5ffbb1f023538281d42d88b75a628"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this ought to work for \u0060bool\u0060 too, but that seems to be hitting a miscompilation \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":"compiler/rustc_abi/src/lib.rs"},"region":{"startLine":2165}}}],"partialFingerprints":{"codehealthFindingId/v1":"d41b0a3d4036bb57f7a49de309c385f27d58b8edcda6691daeef18dc487dca1d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: ideally we\u0027d remove these as variants should not have their own \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":"compiler/rustc_abi/src/lib.rs"},"region":{"startLine":2512}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8463ff7435b422926688b39cb9a1e4d79cb799f8bbd59b3328069bacdedfefc"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Remove when \u003Chttps://github.com/rust-lang/rust/issues/125735\u003E is implemented and aliased coroutine fields are wrapped in \u0060UnsafePinned\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_abi/src/layout/coroutine.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"75391838e58f56816dab28a88602f06ade650b53cd7f7fa262697a4995b38c63"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK(nox): We iter on \u0060b\u0060 and then \u0060a\u0060 because \u0060max_by_key\u0060 \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_abi/src/layout/simple.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"b720db8d9ed2536424ca378eaf1bde607cd5d8a77532b1e4b2a8e43bb08e833a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Peeling the wrappers above would not work correctly if we are a 1-ZST. So we make \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":"compiler/rustc_abi/src/layout/ty.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"aafe8d934ab2a709af6cdcd50c623e8998690313e6eed43ff8a64ba1ff8ea97c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this is really inefficient for large arrays. \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":"compiler/rustc_abi/src/layout/ty.rs"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"268a360046007e8622b9d293addb0a47493385ef34aacb9758169c329311fb23"}},{"ruleId":"D20","level":"note","message":{"text":"No ADRs found: No ADRs found. The recognised ADR directories in this tree were read \u2014 \u0060src/tools/clippy/book/src/development/proposals\u0060, \u0060tests/ui/rfcs\u0060 \u2014 and none of their files is a decision record (a README, index or template page does not count). 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 \u0060src/bootstrap/Cargo.toml\u0060 makes this repository a deployable product (line 16)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/Cargo.toml"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"c487c4fc169031f00adf5f07d9bdefd5831630b7dae48ccda3d2d5f208369b84"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022is a snippet text edit\u0022 repeats the code it sits on: 3 of its 3 words (snippet, text, edit) are already in \u0060snippetTextEdits.push(\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/editors/code/src/commands.ts"},"region":{"startLine":1169}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe65b69f7022da6d2cb2691a10d897dc529519ab7de5cd920884b87c709c207a"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: 27 of 234 project(s) overshoot their size bounds, lowering Project Cohesion to 7.7/10. The most over is \u0060library/stdarch/crates/core_arch\u0060 (226607 LoC, 534 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":"D28","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":"51cf2d3a75ba2bea84b03df3c77b65b2bdc0017c05fc748f1dba07a6c9f4e726"},"properties":{"commitSha":"1a2ed98d344b6cbddc57db8841b42f935877e08d"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D28","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":"1c5f04f069be7828dec4cd8184a64fbe35672d3ce7461b281a1f8d9476423682"},"properties":{"commitSha":"1a2ed98d344b6cbddc57db8841b42f935877e08d"}},{"ruleId":"D28","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":"439950a7733fec1ebea6c58e1bfa811b1165b9b7452b2f1d8c6a5a2facfeb580"},"properties":{"commitSha":"a68d5314fbd5d6dece2c09d71cc8fea179884c7c"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-540","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D28","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":"eaa4cee281f46a5272a411c48230614c421eee09d1ac0b73318ffa1dbf11a949"},"properties":{"commitSha":"22d840e501d52310dfc1ef95792ed211e3673e62"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-540","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D28","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":"f72214e9d0ee73103b233b3a32e1098c75fcd9fd786a68bbc1c129b6cefe943b"},"properties":{"commitSha":"9a21b9007775343b7ca59245380b38d5b41a2e2b"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-540","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D28","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":"a6e36dc1b10e4e33966683d91e49336bf3d55ca07cd61eb27ec6c007e83a4a49"},"properties":{"commitSha":"9a21b9007775343b7ca59245380b38d5b41a2e2b"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-540","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D28","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":"ffb52214d5e6e8902ed021307402e8ad98310d59dd596454fd0de86eef692def"},"properties":{"commitSha":"9a21b9007775343b7ca59245380b38d5b41a2e2b"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-540","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D28","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":"89f8a77210fd0665970bf04f08961cec1c8e70c3efa9fcb47db07a3b5401f159"},"properties":{"commitSha":"9a21b9007775343b7ca59245380b38d5b41a2e2b"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-540","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D28","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":"569129ccdaa02f932672d87c4b6078daa836e3e1d4dff199a8e9a8e78d83e99f"},"properties":{"commitSha":"9a21b9007775343b7ca59245380b38d5b41a2e2b"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-540","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D28","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":"c97ef847a5053262d87ce5f7be6fe4301641bd7f0a5a6401bb50384bf98467b8"},"properties":{"commitSha":"9a21b9007775343b7ca59245380b38d5b41a2e2b"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-540","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D28","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":"cdeefda001fdbc38e33685b1c0d14fe5f1d3116dbebe74543e7a25f2162b8f7c"},"properties":{"commitSha":"9a21b9007775343b7ca59245380b38d5b41a2e2b"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-540","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D28","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":"11f6243d968fffc2e1a279749e9501e0557bc9956099f39b37e25cd3c896f9b3"},"properties":{"commitSha":"9a21b9007775343b7ca59245380b38d5b41a2e2b"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-540","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D28","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":"028aa5e28c46b374f6c53511268b5d1be0960f32ad559a30e951be50397cf499"},"properties":{"commitSha":"904f443fa99a6349a09441c645aa8f5e4d86fd25"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-540","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D28","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":"48674f0cbd2e83ac0844baa0c2038167af1d042d4960a6c75fabd5c066b59f95"},"properties":{"commitSha":"904f443fa99a6349a09441c645aa8f5e4d86fd25"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-540","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D28","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":"aadf56e03d844c5bb59ac3e2665d812c49e99a7441f16eba5a17e6ef1302b06a"},"properties":{"commitSha":"904f443fa99a6349a09441c645aa8f5e4d86fd25"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-540","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D28","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":"a8a2c3b323780d8f0eef7632a75d9831aa2b4b5fc6c15478528afee05f9409d7"},"properties":{"commitSha":"904f443fa99a6349a09441c645aa8f5e4d86fd25"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-540","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D28","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":"85d2db33a7212af540fc99b0226274256e68224b9d208f2d0a4df316e751134b"},"properties":{"commitSha":"904f443fa99a6349a09441c645aa8f5e4d86fd25"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-540","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D28","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":"d54cca51a3921a3428283c1b3c24c107d29c3d06644eef22059f99ba2d255398"},"properties":{"commitSha":"904f443fa99a6349a09441c645aa8f5e4d86fd25"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-540","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D28","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":"d9ed8ae14323acfd76bd8774b00be93ca92b9b26aa61de7d96c4e408d35c4487"},"properties":{"commitSha":"904f443fa99a6349a09441c645aa8f5e4d86fd25"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-540","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D28","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":"02ee7d6c47fa7aa479b76dc889f2daf74173835a8060e341cd55bed5b0031f5f"},"properties":{"commitSha":"904f443fa99a6349a09441c645aa8f5e4d86fd25"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-540","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D28","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":"f6c51a78aa6bb3a159202ae37dd6665ce7f4c89acdc497759c53833c9177f3ee"},"properties":{"commitSha":"8229c3fa752c7fca3760245da4e23ba67acdee33"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-540","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D28","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":"8af42d004c9daf7c6b2b43e28042965e971b5d8cff4f6bfa20a113e1e1993fa6"},"properties":{"commitSha":"8229c3fa752c7fca3760245da4e23ba67acdee33"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-540","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D28","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":"2b42fce40746bb20f8ebe7e885ac74aecffe026add18cf616a9c184979977a22"},"properties":{"commitSha":"8229c3fa752c7fca3760245da4e23ba67acdee33"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-540","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D28","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":"9cdc06a37850ff69c149fbc96cb40628070365eb5967eab196c9844321c5ed87"},"properties":{"commitSha":"8229c3fa752c7fca3760245da4e23ba67acdee33"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-540","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D28","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":"651b3329c75b23a0154b7525466e7b9a33975ffb89038b1d04fcb8d9fc970a55"},"properties":{"commitSha":"8229c3fa752c7fca3760245da4e23ba67acdee33"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-540","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D28","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":"bc0bc89bbc8095b64a8a467eb07e972e7d1b1f36d8bfe2f334663c9ec3430380"},"properties":{"commitSha":"8229c3fa752c7fca3760245da4e23ba67acdee33"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-540","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D28","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":"838c3add8893d81f8df5d2c7ca81564137a113a218f3dcb41b8b6e202416d00c"},"properties":{"commitSha":"8229c3fa752c7fca3760245da4e23ba67acdee33"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-540","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D28","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":"245f85f3b3db2a04b7851ed1c184703121f377afc292959eed14aa4821ed69bf"},"properties":{"commitSha":"8229c3fa752c7fca3760245da4e23ba67acdee33"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-540","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D28","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":"7ede441edd6f2c07a562a8b501b2fd6b7a77eef37b81949ed6557895e18a4664"},"properties":{"commitSha":"5f066e06b991041f2c1d988f493d5b29f8e56b7e"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-540","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D28","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":"f126bc0607c6cea8fdeaaa2dcf41cb86fbe6e637fba8108be1dd27fe3ad5b4f0"},"properties":{"commitSha":"5f066e06b991041f2c1d988f493d5b29f8e56b7e"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-540","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D28","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":"f2bde65fb02e9cab7f2ba1b356341dcde7db50c00356ad51be2374e7158b7705"},"properties":{"commitSha":"5f066e06b991041f2c1d988f493d5b29f8e56b7e"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-540","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D28","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":"906b91c862e75b3ffa939f5c37700b1cdccf7ac28fb4899628be7006189c446c"},"properties":{"commitSha":"5f066e06b991041f2c1d988f493d5b29f8e56b7e"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-540","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D28","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":"3c514d806dfbce7618227cd309cb78b174a1fbb6abff1b2b796a68a828a2b047"},"properties":{"commitSha":"5f066e06b991041f2c1d988f493d5b29f8e56b7e"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-540","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D28","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":"f2548097ed9103c71d958b211ef8f9e77d6e15b7b47bfe492c4d9dc745f2da61"},"properties":{"commitSha":"5f066e06b991041f2c1d988f493d5b29f8e56b7e"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-540","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D28","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":"6336ba965a2c00a4089eb82932616a845193f69a74b3dcfee4cfbedb061182a9"},"properties":{"commitSha":"5f066e06b991041f2c1d988f493d5b29f8e56b7e"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-540","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D28","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":"91df5dc275466f384c5615684ab88e2d724b66d31d48376bce07264695d762c4"},"properties":{"commitSha":"5f066e06b991041f2c1d988f493d5b29f8e56b7e"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-540","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D28","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":"897fae1777b4abef0bc4f91792f0a0ad033be35920b6675fbd470398fe6e7867"},"properties":{"commitSha":"b5ad15b6ebc6fac580dfd56aaf056102f1958e77"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D28","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":"7861ad46c6d3bfb0ddb8ebb0173e6288c1204c39e2946e8ee0982822f816721b"},"properties":{"commitSha":"b5ad15b6ebc6fac580dfd56aaf056102f1958e77"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D28","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":"68bc507cd03a434550ebbabc24db126072a994ef226a8e3904a8e741ff9af34f"},"properties":{"commitSha":"9beb8f54774ca0d41dd2eb7622809f4073676757"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D28","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":"29d3fb12b21ebf96aae0ef5393688a6e899f26e6ba6a2149f0908424ac4e6655"},"properties":{"commitSha":"9beb8f54774ca0d41dd2eb7622809f4073676757"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D28","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":"1a0f1dbb8e14cbf6ff5e7ef5427abba57a7eb3fdadf2e156a9d8fc5602f26599"},"properties":{"commitSha":"96a5fc76dcce1bd6669a9e288721ee6aad521096"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D28","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":"ed6cedd0162ab484bc1576edfc893a9df659a560074673d255865d7dcb22842c"},"properties":{"commitSha":"27e18d3c5083859a3798107ad89eebe9306843b3"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D28","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":"c85bfe55b7a7a2bc6d726f0a57b3efd324a861a7c57a136a41a8a7676c1c238d"},"properties":{"commitSha":"27e18d3c5083859a3798107ad89eebe9306843b3"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D28","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":"5c7a917a91d68b0d91fcc96d10ed33705fac772b57ee5590c6ab40881dca3c99"},"properties":{"commitSha":"27e18d3c5083859a3798107ad89eebe9306843b3"}},{"ruleId":"D28","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":"9b6a4bae42577e71e319cf923ceeb98b244ac601a0ba879fcc33422c55a29bdd"},"properties":{"commitSha":"96a5fc76dcce1bd6669a9e288721ee6aad521096"}},{"ruleId":"D28","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":"e52ea35ea44d3b85a70dd1d94d4ab395249bb14dbdc89b7b4dd623a7de752457"},"properties":{"commitSha":"27e18d3c5083859a3798107ad89eebe9306843b3"}},{"ruleId":"D28","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":"e26ef987dae935717ab5fbe3c4a707af830ceeb3b21a7a9781a55ea3f8072b75"},"properties":{"commitSha":"9beb8f54774ca0d41dd2eb7622809f4073676757"}},{"ruleId":"D28","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":"4493e1b4cd6dad3bed2192103f9e2000f3fc7a3210cbe69f825e164ccab794fc"},"properties":{"commitSha":"b5ad15b6ebc6fac580dfd56aaf056102f1958e77"}},{"ruleId":"D28","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":"30f87c608460b5508df50c1a3cfc2216eb41f8dec6a568fff26b90d96f0890ae"},"properties":{"commitSha":"9beb8f54774ca0d41dd2eb7622809f4073676757"}},{"ruleId":"D28","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":"e27cc6fbdb620784a38ac50ced3afa237ac58709d96c4645239c9f0f0af13736"},"properties":{"commitSha":"b5ad15b6ebc6fac580dfd56aaf056102f1958e77"}},{"ruleId":"D28","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":"b94fb3fd9672488db5c6f679e236e5329c6db44fddc1da7cd9a44d29c6736f85"},"properties":{"commitSha":"7a90679e28382ebd48790eaab80cb2381704223e"}},{"ruleId":"D28","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":"46d9d1584136b35fa3ae689d9adcd1d4ce622de31a66e95d4b329e3dc9a80f91"},"properties":{"commitSha":"7a90679e28382ebd48790eaab80cb2381704223e"}},{"ruleId":"D28","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":"3cdfd7beb31b791ae18dcb425e21eb157c842e7bbcd522cc330573c1a6538db1"}},{"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":"28847bfb68128ad6c95eb6a19a3df3a0787d1bdadcf090baba24802b8a233364"},"taxa":[{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"8a7c60d84ec124dea0266da2cf23510056e10aadd6ac2dae11dd81d8528da72e"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9a497f82d21698fa865fb4fe8dd1c6138e493fa6f07389b086c8a9811c240e71"},"taxa":[{"id":"CWE-214","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-532","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A09:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"c625834323140bf1eaad2d263b0374c886006f5aafd8f218e1a4cf729b48ad92"},"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":"d1f9be8b2826f393e1f65cce7abb73d8db26a272367906516e08a8e27ed5a80b"},"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":"6aba5efe47650685e968f02793a2e2af12bf4186f482297c74960d857e138ef5"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"5ea16e50953858b85ab365e77a1463322ff353a8664fbe546cd985693012c9b4"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3cd114bcf1dcacdb5357d6a0acc191b43b86c79e88a9580e20a6a5fe218a8111"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"b107698ba88bf5a24d50fde8375aaf8f5c0bd95ebe079af203c7b06a637973bb"},"taxa":[{"id":"CWE-611","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5e62e64450e628f6a8bde3649cfe4d4f2171003491ef093bfd7e771574a1ddb7"},"taxa":[{"id":"CWE-611","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"125d882e4a3a5b5063e752ff7c8fd3315dad0f001b5e40f8d04d43b06967c7f9"},"taxa":[{"id":"CWE-191","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-248","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7a981cb8e35fabfc1c4ee7edb66c736a75aa9a31778a26c9d566b376f3eb1f28"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1a0bff055f32d787b98fdff9298d5e597e33bf5bf2d562aac74aa4788165dd23"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6d5f75c10f34109f8a06b01eb2eacee15df6cf02656bcb265e51c51e52fec653"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2b1d13e6f0c2d56c3ebd58c322ddd1029b719765d54905f9b1b0420de64e883d"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4fb3f00093f4ee60b311ee881bf26c3e923c59a5aa336f34b388267a38c5b4f3"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c1927552926e233e162f593795065b145ff7166b0ba2c2cec2a3f528e0405d3e"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7b9a60a660af64beb1c59ad709d314b86ae8921e8fbeabda4257cb5c311b575b"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3d6dddf948ece9b0891272705d2f3a31f75ca7c97556eadeaf177945ec8bc3a3"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0c31bc1d4728633c3579b2d94c33c36f5cf37066a4aeadf1b1d60e610d9d300d"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7404e81ab093cf6641d556af57995e8bf18f47b03d5f163b442d78b8db1413ec"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1492e54825598460aa8cd09e44f9ce2174faec69bc631d797acfba925c6aa950"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c188d2e45503d36b3d7b179f759e942df784d5581313fa06fb592b88376d5c30"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"acdfd1732ffe7cbbb9761d25aa217c3206f7c4ac221a46695addda973b320ea8"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cbd6ce4e665775949db643edf5674409f70087c340dad0872fa1e188236bfff5"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4a521104403b74c38cfd670ebbed3d5d68ac46e917aa33d2aa2204860c93dc71"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"95f277a7de852a1a95fa9d5c03cedfb5b60cdac491989f3133bd774befbd8508"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"24e5382c90e0b870d7878d6295b3872c974e8a9c46b7946dff772178411ca745"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"39433d286b50cc86938881fb445ead5de08bc67cb62b142a70e04de2a78866ae"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4ad11a1e362e0a60bf0b39d1c8634a3a82cac6ca62955a8e07094ed200da1153"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7e1b71848d22b55f09d9ff7c73abb56285153617b74f626926e68c33043c5db4"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"48f3551540e09c5aa05c858a6125ad69aa5f269fad58d693f2e3a9cf3f125705"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a1f48934b9b8a991667530ae4a284eb732ac3a423592e5fc1f50177a177f9e90"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fa73c62a7fd12e30df124c13ad276c3ff31f70648c87d2830ed0c55d72286b33"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f7a1df65ec9d69a4697ac81d9cc736d0a9fe8967149c8b1770ef83677c73d67f"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8065b12ac0270d9a805c9a622e0f40e9de7c1a45728595a8629733d518713ed6"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8ae1ad1cf7ea5c56d4b863d95d40afcdff2704dd11aba43ea2ad421231fb18a5"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ca44629aa41ed54709bf3c5b0c6d3fc9e62ab016dcd5fb5cc2a60dc5a3bd8dda"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"088b41538679cd24e94711fbca95c47f131f53e9246bdb9ebccf0d60822ca91c"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"503f9f9207c8318f1310ecded185930b189131c314005a6ff2282103b2f19bee"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"59b0fdb89bb634e3f83180fe00e66a8f723d078869c9b616c9210c49c9773853"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"aad9dc9f2786de036d2d3bddd00ad562b1298b4195fffa21f7aed437fae51784"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"73b3db83a6a0d8c4cb0995ef94001836fc4cadb53345cba4c259f8c3233b7db7"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"da5ec19b831e9bff11cba0bbf4c0a7415262c10a8e99c10d73f84ef4e9b46ac9"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2acaeccf14acb44d268d03cbb3bf85d0aed35fb07e33c5486150de38fad12607"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f0bcc119aab37b610a9e65ee24185f26d6437352969723da64b032c0efcc6588"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"86e088733519c617c20169c1e0c7f109ab96354a1cd34ddb79a88e83f2f2afd6"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b5c8f6ac03152bc1d1d0192c595c0047cc0c4746796438161e39a70cb3a1ea2d"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6a22db9f7e5dea018b74c896361718e72baacccf2bf3360291b19dd0a8a5368d"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eaea5536d50ffdbfb05f0d08ca58ef6c47384dd5a30e6056fab26553fb0cfe7a"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f4a868e54f68c54ecd4a75c8ee4d5204845fc0938d3d6944ba385315fbed3861"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb8434d961a094da7f53c335874fdc8dd9788a9df4e8fe95f1090d5292bd0f54"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e8ec2a42e05e9bd8a9179c1ab5f0fef65996d3039ab5814138fcd6d495bb9c60"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9ad80939ffaca863b0c8a7071b9fe8143c9ace9c1f3000cd7e5edefea72a3905"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8673c11ced8e83f555d73cbc7f4c7dfe348068be18d46a34cdc9f05da8092af0"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2b3ecfca882aa00ed043299296d7022ef753e6c874266b5b381a1c162d817d20"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"347290bdd2627c33f2cd6b9bfff7597d769f1e0b6df15f7b3464b972669ff26f"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ef7e8ee0a5d4a63385482461343f4e3392ec5ca1e4b2255f29925c6fbac06186"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7e6d5a1dafd9bd43a776f776bd0416e6b9037b115f573f95bac70ec7381a0f8e"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c597b3aaf4339ac083d6412d3ffebd54e12705ccd51ff9b9f61847b308e59f75"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0d1ee1c49f2032bede79c1bbfaa06314f75ce433e7962c1bfea5379688ac2e7b"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"647984971ba6a80f40411dfb1c5a5b61b95ab286eeb825b4bbf7979e4d2cd814"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7df362ee5426ac796a3f53b53aced5f70931de51f22c46b07db068e0617cf4ab"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"940cd5923be27198d0cdcaef7a9b896e50225f874d6ff44ac0208003ad7f6f52"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"168a519d3ac15f99243166c4921a4b595680ddf3507eabeb47e5aa995fd4214a"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ed6e0b6bbc5505ccaa602e5fac18e875a9e8bcf95d17e856071405f42ffe9fc7"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0e7df9f4d5999651f3db6957c32b45ddcc32366c50eaafc65e7253bf5d23c542"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a9e36a33a760a4139a3aa95694328e49e78fc9ea8bd68bede00447fd938904ca"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"11e99f23a8bf66b389be036f58852e35e43a38e25f49430aedfc54637b0a6bd2"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"b6fb4e0e474696490182b830e353970d4d0ca43ac2fb4bdf23f3512f46b561b8"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"df06d814f28b594a08ec23d7ff1c20f5425081b5e2b74f66bb519a89e85e9cd3"},"properties":{"dependency":{"package":"zip","version":"4.6.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","RUSTSEC-2026-0367","RUSTSEC-2026-0368","RUSTSEC-2026-0369","RUSTSEC-2026-0429"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5e99d5935cea849afb5c09f4061f3c3789f199a58c48f60d697a5684ee57af1c"},"properties":{"dependency":{"package":"js-yaml","version":"3.14.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"77bfa3e661b7bdc8fa023b544d82c18216eb3f5d2139aec026fe52ed8605677c"},"properties":{"dependency":{"package":"brace-expansion","version":"1.1.13","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ed9ddc3f41cdaffe1cc05e309d432940bcf940049c145c23edd2c9b93f2518b5"},"properties":{"dependency":{"package":"brace-expansion","version":"2.0.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8308530e914a1519d8132947fa21abde60b2c8eb5c5efd778b89a60cf2805d8a"},"properties":{"dependency":{"package":"fast-uri","version":"3.0.6","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"624e166d4434bdefb7349408bb64715010501419236c30a330c3679e150d43a9"},"properties":{"dependency":{"package":"follow-redirects","version":"1.16.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"068ca4b34117b23192a2cf7beab5d1fc7702510012c2344bea376878bae5de3a"},"properties":{"dependency":{"package":"form-data","version":"4.0.4","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"21b069f7b509dd7d2bae6773d783ffdd88d93b1a9efb7c435e6d189e8b48ae23"},"properties":{"dependency":{"package":"js-yaml","version":"4.1.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d2c4fa9eba824483041469d490ffbb5d146788de4fcc97b0451c8050254f45a7"},"properties":{"dependency":{"package":"linkify-it","version":"5.0.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5464b32fd8de3edf1bbfdde80255540b0bfe73c09d669527e768401c5b3891d1"},"properties":{"dependency":{"package":"markdown-it","version":"14.1.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"aa2695f995d35beb2516bcbb6f543910ab86e75fa1e09129fb0c8b5796e3506c"},"properties":{"dependency":{"package":"brace-expansion","version":"5.0.5","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dd2bfb9dcf09c0004e42ac4700a2e5a92913ad77a019e2f97466710d23c12009"},"properties":{"dependency":{"package":"tmp","version":"0.2.4","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c50d5ed86ca226a2f10f93e5cbc7fb2e4927ee57c85695e298bbab97f1dc0d2b"},"properties":{"dependency":{"package":"underscore","version":"1.13.7","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4dd0a57dbca31d794891cc8da6f51bad0c09142b6fdf34d64d2cdcd938b61105"},"properties":{"dependency":{"package":"undici","version":"6.24.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7f1d3e7b89d9226840b5bdd13bc6fe4e670524984723cceb0fdea017efa6b42d"},"properties":{"dependency":{"package":"brace-expansion","version":"1.1.14","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8551343a455849fc5616830b4bf1c4631f2d9b63f581741ea2452b582f417c70"},"properties":{"dependency":{"package":"js-yaml","version":"4.1.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"35f515c602cab79b02eda4b40627f29cbf5f189b811c3d25ecabf4a331b8df46"},"properties":{"dependency":{"package":"zod","version":"3.25.76","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"759d36a63e8483c4a467399ff199fa57fa2e02d89ef311720974588edb9516d4"},"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":"aee23c0997519f9a53e2269c98d35b0a266e7a24cad6a6d93c1c088edb4f3e32"},"properties":{"dependency":{"package":"basic-toml","version":"0.1.10","advisory":"RUSTSEC-2026-0374","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":"47c5576439236b8a201d46e552e9541555e69819faee22cce09defc812266cff"},"properties":{"dependency":{"package":"cxx","version":"1.0.188","advisory":"RUSTSEC-2026-0202","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":"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":"728758c9d3428053e1082b5fb9832c05e2e04dab40233f2ffbfd7792b93201ec"},"properties":{"dependency":{"package":"libz-sys","version":"1.1.23","advisory":"RUSTSEC-2026-0418","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":"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":"e9cf74773a6e34d2f2cd5f4cc024a1a57cb07e5917cf84c703df779cadb57013"},"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":"d38736f2611cc8a68dd6d9310c78b5d2d83dfcca00f3553b710b7486c0d08717"},"properties":{"dependency":{"package":"ruzstd","version":"0.8.2","advisory":"RUSTSEC-2026-0344","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":"02ba0fb1601fc015ee8b1fdad911ade18f68d7a6778d873932c9f3de9e2260ce"},"properties":{"dependency":{"package":"rustix","version":"1.1.4","advisory":"RUSTSEC-2026-0486","aliases":["[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f3c29720398604acb970a56c6d6d627f5625746070c2409466f5868dac5a4ce1"},"properties":{"dependency":{"package":"paste","version":"1.0.15","advisory":"RUSTSEC-2024-0436","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":"19c0ad3267b8cdd558b2bcb8d2a12eeadaa54906cd39cc1b895e8f6131a93ecc"},"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":"4d7c6178a6ebd95f5155b18af112e681534cf7f85f85b23e939d12723484c4d3"},"properties":{"dependency":{"package":"ruzstd","version":"0.9.0","advisory":"RUSTSEC-2026-0344","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":"fc1132584c4f80bdf7a331770dfb2382664a990fc16047ac2a2076b96b1eed45"},"properties":{"dependency":{"package":"rand","version":"0.9.2","advisory":"RUSTSEC-2026-0097","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":"918e5a38eb4f544c16c2811ddaf78245f7190e604587090b886f02b4aa568e6f"},"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":"26c55db99cf99ca5682b17be2db10d91880867ec025225e6da696840562eaa68"},"properties":{"dependency":{"package":"crossbeam-epoch","version":"0.9.18","advisory":"RUSTSEC-2026-0204","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":"8bd60366242ef05d7c6b3707eece521a3de3c6331992bfd90f50d99a8e4e0b52"},"properties":{"dependency":{"package":"quick-xml","version":"0.33.0","advisory":"RUSTSEC-2026-0194","aliases":["RUSTSEC-2026-0195"],"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":"e388df650a508975792df9388097ec800c68cb449ad77fd94eec6dfc1b6c084e"},"properties":{"dependency":{"package":"quick-xml","version":"0.37.5","advisory":"RUSTSEC-2026-0194","aliases":["RUSTSEC-2026-0195"],"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":"48bf4a6a938fd04134c1c6717ea29277c9d6d472cb9907a8a9235c5227628b51"},"properties":{"dependency":{"package":"rustix","version":"1.1.4","advisory":"RUSTSEC-2026-0486","aliases":["[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"80e9bf4776e9197da422fafdd57d7077fccef9fe24c4954edebb26fb2cc91165"},"properties":{"dependency":{"package":"serde_with","version":"3.18.0","advisory":"[GHSA redacted]","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a6da2e73babea8f221332a4fdce6172d37606d62c66ef3a6dbfa4d3a94a857ab"},"properties":{"dependency":{"package":"yaml-rust","version":"0.4.5","advisory":"RUSTSEC-2024-0320","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":"f8a96b8b6f9967eacb8d51f4640dd72e0da3b7ad30f79ae9eed541266bda0043"},"properties":{"dependency":{"package":"crossbeam-epoch","version":"0.9.18","advisory":"RUSTSEC-2026-0204","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":"35e45d45c46738fd7568d9030f6d7d4f0b1cb02c15a12b18f6829fdbf039c922"},"properties":{"dependency":{"package":"rustix","version":"1.1.4","advisory":"RUSTSEC-2026-0486","aliases":["[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dfe24ac1a24b021c6842b36b092f01a5f7a35e099a208a1ae3f37bfa128fdeb8"},"properties":{"dependency":{"package":"basic-toml","version":"0.1.10","advisory":"RUSTSEC-2026-0374","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":"ca751887bc64ce641b08570f33b7c46c0484bb01f6277366b9d98c79a7ac4d94"},"properties":{"dependency":{"package":"rustix","version":"1.1.4","advisory":"RUSTSEC-2026-0486","aliases":["[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e3f40add58fd25d456f91a7daf6c6ec1d50561838c5cd3e9a7a858207144f441"},"properties":{"dependency":{"package":"unsafe-libyaml","version":"0.2.11","advisory":"RUSTSEC-2024-0449","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":"1df172f1b55c809812be5b5dcd2da1e84c7931f91abacb401ee1434118cf8f9f"},"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":"53ce31e949561e14800fbc0f58afcb35bf73d8fbb7b06de3b66c0bc3b14ac8d6"},"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":"d94c53bf64810b841e75904d5f014490e2f0a3842f9035252534262445e34c7c"},"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":"7cdaa2f09d528552301b2d614c0114e975ceb6e5074bb1c924ada57e6388d10e"},"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":"1cb6fc166d53e2207b9ceb5de791752d9e79a0c6cf90daa1d1dd5d6ece0936f8"},"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":"b9e300c18ce60ee1206ac7be5f2ce30e2418bb5d6d15b5f47d81ea5e75601f6a"},"properties":{"dependency":{"package":"rustix","version":"1.1.4","advisory":"RUSTSEC-2026-0486","aliases":["[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"114ce6059f94d72351274273a078a05b3b208a43d13a2b98701811c5e62f8dcd"},"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":"dea931da2f9406d8b1b377e02c663c37720e3961d0ea4c6fe7d4c6c8f79ff65c"},"properties":{"dependency":{"package":"crossbeam-epoch","version":"0.9.18","advisory":"RUSTSEC-2026-0204","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":"6ba8a1ff7d992051e106a012327345bbdac5a18a0875bcdcc12d04a3607813f3"},"properties":{"dependency":{"package":"paste","version":"1.0.15","advisory":"RUSTSEC-2024-0436","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":"6e88f07e5f9acc3441777210b68eee9367f3653d957089288370546244696646"},"properties":{"dependency":{"package":"rustix","version":"1.1.4","advisory":"RUSTSEC-2026-0486","aliases":["[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f0e8d50057598c24ea955a1e475c984ed7b3fe4fb7a105cac62c4910ab0528c4"},"properties":{"dependency":{"package":"bincode","version":"1.3.3","advisory":"RUSTSEC-2025-0141","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"febb4b0c599c13e10c59eef138d6e5c2d7daa55b1d66fd9aeb72f7780e29e304"},"properties":{"dependency":{"package":"block-buffer","version":"0.12.0","advisory":"[GHSA redacted]","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"770d79237fb70609e6646f4920249c0907ba43be61228c2c90ba31734513c232"},"properties":{"dependency":{"package":"pulldown-cmark","version":"0.13.4","advisory":"RUSTSEC-2026-0414","aliases":["RUSTSEC-2026-0433"],"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":"58e6464c013e03855e781cc72bcc476a1e9e14beb4ce38db82f6cf1b13fa41c4"},"properties":{"dependency":{"package":"rustix","version":"1.1.4","advisory":"RUSTSEC-2026-0486","aliases":["[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3057e1e639a878980a571e424ef1ef5dea901ccac6d7e0a4841bb2a7216b82d1"},"properties":{"dependency":{"package":"anyhow","version":"1.0.56","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":"aa754b15a5b0dc0e2e347a52a2f95079adab2b66cb1a2e20303839945cf5c867"},"properties":{"dependency":{"package":"rustix","version":"1.1.2","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":"777c2e983fb24b545b2f9b7201158e198819a139ff09e72dafeb83d03b88bdb7"},"properties":{"dependency":{"package":"crossbeam-epoch","version":"0.9.18","advisory":"RUSTSEC-2026-0204","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":"c16ce5f2e84b6182fadc5f2b2123d6f2c9efb9d31cf63770a52db840215d0351"},"properties":{"dependency":{"package":"glob","version":"10.5.0","advisory":"[GHSA redacted]","aliases":["[CVE 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":"45f48501752f069b4089f61ed7c6384a619b76a32618fc4afad7305d8b2b892b"},"properties":{"dependency":{"package":"minimatch","version":"9.0.9","advisory":"[GHSA redacted]","aliases":["[CVE 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":"16c8132ce6e2487d06b268b3425fa521fe51f11dcbd501c79a9643752313097f"},"properties":{"dependency":{"package":"@humanfs/node","version":"0.16.6","advisory":"[GHSA redacted]","reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d8c8594b0a49d6ec7daa5b44f6657cfb06d3f8fc62938ab1645f3a923c8b7f4b"},"properties":{"dependency":{"package":"ajv","version":"8.17.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"559e896a53696bdcf8239cf8d16bdfde1f09530e022ded7aa738468bc1b80c70"},"properties":{"dependency":{"package":"glob","version":"11.1.0","advisory":"[GHSA redacted]","aliases":["[CVE 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":"83546f2e1e62e111ec8ccafb40ec71914739947bb9b8381cb48c939d409efc50"},"properties":{"dependency":{"package":"minimatch","version":"10.2.5","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fce62831a5bb3cb611d550808b0017dac451d9a8451411f1acc145659cb68d35"},"properties":{"dependency":{"package":"qs","version":"6.14.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"399b28c09acf5c3e7200d14f1f018dc03df78110e85daf01b75de05b7c7b736b"},"properties":{"dependency":{"package":"uuid","version":"8.3.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"55197dc39d22778f94cb13c8244b6a2c9647d10a74ca4d1e55fc4fd78c4a4264"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"116b40a66b30af651aca7db0224201bc0b8ccc47a3326da5aa9ec2b98384ed25"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b54819f2b3235e3019a17c5c5feba5663f6d25c50c4a2533a3b1c46526eaa00a"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"da5c42a81aa3c4f7d98c56592a442dfde3f86bc6e4a716417cab97f3f87616b5"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c9b21686ae7482f64294b8e27acd8996f89492826532db4e841bcb030b60c58f"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a4d36a21266705bb0b4b42088751c43478ab85800d519ed036f38a1f616bf6d1"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bf2478d26ac905550db787166799100f6d4f93d70694f67b493eb9fba6f02b59"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9c51aa89e0dbabcc1777c0633ebe99b278aaaf6afa90893a9b9f42ce3eef52f5"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"de04e5b6ab5e4b386eb1abd311fb9b15b0e1da8fded0a00947591d55c3744177"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a4736e8c3c32b8f6fc3f4ac41a38b9796f8fe76f3f3067c4868abe2df38968fa"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0c1c1543417964e37ea1d92c9583c404a2ca019fc6dd0b9e7f193cd4e1bebf95"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1875aed92cc485709cf06db775e3dcf1114c5c8fee8096a833942d6825fcb837"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5542f158d4cc2aa91532812472734e986d1c87e66728accc75f4a382d56ab291"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c0ebe9ffaa414fdc9761cdd6e308043b2423af8ce894bcfc0da72d6ef270426b"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b3bfe8fca33bfadb2bdc30be4f8e4ea37cd5e9b0a9a701ca99786f04a52fce1b"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"aa1feed675d87bb700ad118aa8a1465728bfc8a2b0ad344c834e339b7e3e8d1c"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0fd56aab0972d31bcaa2b88cd488fb462bfb8f7f711327485bd51513363ed573"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b3315713f31a0c746c0253dfb5a5d92f54cf554f7d19acf5f9ced39d1600f704"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3a983c06a9b04a6a9870e05b4322f80e8c590d56befeb702986957c4e76e461a"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a95eeac0b301181bce374bec487a2f0bff157112f7f95417b5a2188fcc5dc35d"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"81cb2895d0e1db89bec6629326bf70425b483946a475415eb30a1a0637ed0d06"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"464b579ccad890a2f6082a18fbf0ba920e5df58053825ff19b5fc7e4571c0b6c"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"41d17683e66718090fa1125c4c82f85fb5c22a67b34e3df71e6c448144522bd0"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"430f5825134915cd2964480bbf2194662398ea15faf7a9dadd54004bb293001e"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8e77fcd37ffde795881f06c58c5cd9f6904691614effbf03fa8d18527614c6ff"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e5540f2359539f95873dbe95a44d05a6023d63460ab9407d314bfbef9984db8d"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a490010adf54cd4f4b4f9a7b7cd833ded396fe49e7587def5e0bfa47fae66aa7"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a8a0914d687d5dc9ff940924c2e149ff578e90a44ec6a518b90702362c9ef561"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1badff7ee114d06916dcf283ad5fe23bfc98228328b4310fac203eaba0cd94cd"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"27bf7b06b7f029abb34713a072a2e910f4949a52e5653e9b78a936915fad2a8c"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1fd63ec67153177b1600a7ffa3f02e1da8ae4d9c22b1751acfc12e21d081d1db"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"12e67405218f68b8d11acd18c9eb39b8ae69b3993bd9656e5ff0e15e3ef696e0"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"701e4676a12cb8dffa2f13b4d883e3f83773dff49fcd8b822e9807526f1daff7"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"910b1257eb6b64ba2eb475d87bc1b9fc55ab8e430d4933589da437360c8385ba"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"368d09169025d4240af290cef80bc53bc812d147f3cb8e1a4320d49e2700bc7c"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dad63ed801d93ab12b6cc2612533990ec3b88bb9ca680cfbe1bb571973d2ab08"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a95ff42493cfe2e7a0f00292ac0991ab088d00db832285cf24f2e8449a123efd"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1652307a5fede366cca5f0f31f10896fcf8b26a4c01574312e14b2e22a697722"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fbdb6a1bb5e5cbacfb640cd64e9285858cd3d58d9b457d36cd08da480a8eac60"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3e085f3a85c375d73714b9197285dae533c9e10e9a05fba6729b74659bb63e44"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"06d8af91d71bc56057bbe0c35faf2b010c9d1bb1987de1a43492c0ecd4d10d47"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1068b0284abb9c47bef2e1940e487b89108a2069bee35147ae83225bcbc78d73"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3d553bdbc4591e93cc456df648620732b032c57a080a40b4ca6935385cdf953d"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c991d8698365c5c8b63f5a13fbaa223b1988674556b6e5928cd9f9b704ba70a3"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"70ae2ec4533dbdb51adec90a2445251209a37a38812f8b64a63e4fbfdc796463"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e05682012c9711d0417c3dfa18a9a05ff32bdcd10824b4678e4179c0ba693997"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"26e57adc84a89512c377ccf1507dbc830f0e3929467b0f9aa82d0ad8fcd9ef54"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8b8ba6a1c026d172750bac28f70576468f16cd8d58f9b7d8e0403b3a30167c85"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"44aad04baf5febe4d5a7f11d9a0dd4e73dc99f3b8807c8ac6fc480ae92da3d30"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fc5f68b309c0f0500c0a802286407bc0647597bdc38a41cf91fc289363b594d7"},"taxa":[{"id":"CWE-345","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8dc78885ae7b1f80b87714250ea763c8bde53e6d41867046b9fa7a475949e753"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4ba1412356e2802f3fc56c0c4fe8bacffdf4862222128af2b92eb94392bf5b0c"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cf9bde55a0687afb48eb8ea110a23227d18091b3fd1ac0e65d63017aabf6b152"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"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":"740cb85f293ccfecedd25ffd0f91d14fb7d0a70636aa5e23d5b5d085766bc61c"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0a3b20f40014444902961cae0bb63388a6eba92de5a317f0162dd5d749af3963"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b3821a5b6747d9bc37e6c24606df97c387aa929148075d5f0125dbed3f52674c"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"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":"bbd1beb52f1c9273c06bcffeb4175375fe08dfc15931cfa30ef5aed90cd5cf00"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4b5c77e012ce56fd4d2fd873e71a48f9954fea422627d3098fd232d2453297f9"},"taxa":[{"id":"CWE-345","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6b2569bf6b75e5bdc49ce7be7a3aeb6f18bc361f01a82af8d033a3b718e58469"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f9105675417b8afdc1982c8b304c159dc8c5550b51f9e72881cc4c80f54d6274"},"taxa":[{"id":"CWE-345","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0731f73523c62667694b137418cb9df74a9487e51774caad346ec04cb596bd14"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4f2664fcaa111e4f0297a836eb7497ba9ced6c1d51b7d76c7a4761e3530ea601"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"91cafdd3bac5ef82e5eabddcea65160debc160fd8dd39bf3879b9258142a7e1a"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c0ac05da4b2cda08fb2c2339f0d217720b8512546b99750a775eb3d65a0866ac"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c97fa332cc1a8cd13b9fe82fdb38cb2da3109496ad359f2a8492fdf1a152a5a0"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4390f8dc02928e4bf0fc545943d5714a47477e86290f5bfe944cda80cbf63a1f"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"55253a2332b8eaccfa1ef7f68671a5ea67167ad9ed3bd613930572307841e80f"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"aa234bed6fa674332c3a9b09858a138cc2e8745a2b12161ae69580565cbb1715"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8493748e4d6e00f5078dfadbb9b8fafa775f9325fe94587c50fb43b9473ec0ae"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"86e33c957bb0ad8b985220dbedd78c9a7c7409355f5dc8a55bd139e3205754bf"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"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":"3868dfcfb323d41f11cd2ef7f83c780b579e1efe4a4dc68edbcbe9f5ba6e7ca4"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b4af5f91535872ba9f422a6f0b6ce3f2e209655f9452664f1b5d235ab47940b3"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"94782c0c6b05ac078658ce3f4791eb8cd710edc2166d9342f9303e1d2c48c757"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fba968e8e78074a95e7f256807fcb9914eb0f4bf3eae42fdd2fa334fd0caa9fe"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"389edfdd0e7a9ca26969acb5ae53329373feebb03c5dc29161d0d1bcb7fa71f2"}},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"10fd06ead3666a9f030bf0251b0ad721ae9a48fe162c8e3b27f68e6b82ffd9a1"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"43d45e685894d2b48d4406e7905215b7c620a098807599cefaacd45f626662fa"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8a6e3baacb264e50eafa52517c33fd8c4920efdda85ba3dde42c085fa6922562"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"752c3656cca8e3b789736ae9c1a820ca4f22ec7658999f22ca8b27a55504c9f8"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c2e0fd75ab959dd1e5ffb981a1ac7465612557a3f4a26221e9788f1d1ab6cfb3"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"98b2f04fcca7bee0e17c6e006b7aab2ba0fbc0dd699ee32d4f7bc28ec60ca0a0"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"33d04bab37ff59ccd66162219260c790e28ee8b2be47846a68c04aff6d56756c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e702363549daffe0d6ace53bbe214b44e06acf5c0e089897403fd3e2b996aab7"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"772042f24fd5b42ae4d01daa59101c0cfc8e15572f635072bfe912dda80a56e1"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"81ff5cc42c51ff2c216a96e6ba0ccc0d8885a3e774302e77ade28c2d407188dc"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cad863375318b521a72c62795ee10ce54e465020a7f24f6bb3085e10ae367c4f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2bb109f91077713ced9681c64d04dfffca4596433ae4f219f65127849ca55210"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"726b2ba10e40e42a0f28efbe6abf5ab22d7c592a372765ff76a30e9ffb401408"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2e432b8080eb3c4ad8debfde0f9fac03f1cc359d754653012c62989e77209314"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"67e9757b9528f2ab1642103b92d4f041ea3c8bd62802bfb444fd918e38b33793"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"333d5f31b41864880d786cf0ce2ade454f7a6bdcd60a748cc8bb6c8960c3e2a3"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"07bb34653c61b2b614c47723f470629bd328779e23169255e01175da53aa9a1b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"144222efac4b206d2f3cd0ca4f04bd6fa08e010d323453201e729797ed9065cb"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"05e13a887f76855f42d1c62fd17802c08b2a91208a0842d960d4b08d6b5edb31"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"015493dfea589f2dad09abf0951a0c79de1a2e204379550875836878138971e5"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cb91ab4d1d9158a98f747a59567aaccf63f7ba77885e13548766e7844f2808cd"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d1407b3e23aabd36131fd11cfcbdf1dccbb4a7fbcea488cd5ffc430aa8f22e12"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5ec071ec728bd817b21d378e0b08ec143fc1ef9815b3de2493392c4c26e7f89a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5dddcdd90c6c5aec1a41962c4031e6a4433226b91ff9cc0a6e6b62751a1adae0"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1c56c2ad8f272433c75e716037296801d28e33619bd25a9ca6f67bdc50c7b292"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8d1cfe3efd1c0030747d716733452c9fa3d21e06168179cc47a78bcebb144d60"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"240d6835b53cac1dfa912bc203a72a2d9ff78bd21c7f91e03a7f8d53b3999c6e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4fc6f16ae28e1e31be95197e18ff8bfa6545ecb90c98aed667ddc3926ba60f69"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9c5f6dd382506890fc3670f02e00a4b34f26307407628c9271b368d60a4ade7d"}},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b3f10cd4bc3d512b2114351009644694536e4e19e53a15ba94abe6cbe25ef0e4"}},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"799d2a47825555f4d5f494a503bc49678e25b0e57d41135f56235c806b21ba3a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"10ffbf88d7e1a62f6a78ff1e67b7a8f4fce87821e77af066d073a86bb3ef86d7"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8e836a9f2efc49331be0a9f18e03738cb91829ee424b6ac7cf70f3bd451657ff"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"18a37c5ade8b224bb1e16f111656b7a1e67d20fb226926dd223fc346d0a69ee0"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"84ddd37f9a726c713b4a7a74b0a23a4d58f82c5899d2cfba95fbfc6d9228d453"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"86ccc41ceb7198b5c08971590e88995213f35e60253f4ec09b15ac3d49cd50fd"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5bf9c6989fa5924f8b6cff844f490a01750d1199551978aff425000cc6c56936"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"644cdc39201b0d581b531289562503d9625d606625f43d37fc60c3db71f733d4"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3e7c9a5122a4868f25991be9d8da8a23066962a8d8ed9ad67b0d572f1c7ac097"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"655f50c1bed534d8c122bf3cef0352308f53dfc237f7f402bc7459c2909ea534"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6aef06b03306a459737fa04397be77f660b3b1b32f5b213471421a52e25d8b36"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"10d84d777e3bc194a998c9804b0db4c87b62dec5edfefd28f995fc013deb03d8"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1f92cee1d553534547e4a73feb8c38c7786595e04d9621e250988947ea39f732"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fefe7056e82b6ef26edd08b6bcbf75e27084cac9540cbd62794e677f6262901b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"750dd7c8d46aa75552f85ce952f8f0d577e13f43037010ca60eae4e2514293c0"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c477e08014e70426e57b6cdf28937eecdee4a774cec2dc9d23415c81271928ac"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"81ff88ef7eb9bef4fa192f295c9f305851e48eac536ede3c0fa4f72ef87cee7e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c827f5a28ae7fb7fc8b4d2564aced663df834376b3f339b40bfa29ef7f4586a5"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f6278b0165cec34f8b63f8edfa8cd4e343164aac8db06dca2e305ba0157aa2cf"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"30e1f750f98314aa01ca747591701e0d1d27d004d04faf2b7bd2d6cc5ee4851e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7ace0380ce16d050bc493fe32dce90f545457bde705d71a520a146f464c02b3a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5e5cf649b26518ca10a76233331d3e029f720981e4d7a610b8c5cd4627730558"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6635c938828c3476ab8865a171e9abaa738349689679c80c982cdcf7e28e841a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"79277cfca3557db7de647b276c067bc9579fa3761860727a73394f3e9319711d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3644700a3a9a381d7786a5eea98702e2e3812b812dd62bdff74d7eb3fc95f24d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ef73665e4a86a38e19b01bc701d5c0ec722b00c13d91d5677f24ea246e33b71c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bb2edde480fa80dbca83aa5fadc43c57e2fa1681b2240a62951a6865721bd9bf"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d2bf1da33e05979898bca07957ba22c283a219a6001e70513877e7bd705f307b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9a628b20203232fb39affccaf5fb0afebc85b48445d00422208ebf19e6586c81"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b067f1aaaef7f909748e6b24e1198c65a9881f1ff83a85bb984a92b5063f4820"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4060df13e4ebad0a00dc0fac0a52825bd433508d8d1d0d8d308cc708d2290c2c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"30199c5c58651fe2c78bfb6496c1622b6332834e1aa6aa39021b2c18af7c17c0"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"562088f9e3a2aa8769fdc9d77e8e7f3cfd8ad64969440a54704e87e8ad6f70d7"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5d58bc898281a171b5bc699cfd21b7c1b1c024e918a0428c1f5155d82a3dabbc"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"02f728ec7e87c139dafdd1d4ef52df319e4896c02a3ab143178101c5fe46a77f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b32c7fe1e12abea558df1d25aab627e03e057955b0f4e5f5058933fa91ffd0ef"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"32d1f7a5e49c7136e97d8b9a838948cd175230f3a893a0b95a30b4de24b6dc5d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f2bf46f41baecb386b3240e166bfc89a4fa291707d466f1be2c23482f760aa35"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d2b7ae7cad6ad8a4e42dd2e8092a43987f9fe88294e00687a37f33bb78109ce9"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7ffd303961dc2ab4e702eadbebf830cf1899290d99b1d44f80f24bfb4802d04a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e1083e6b6a025d43806a41b892c58fd31ff4853436cc675c329a9b5ecb39ddd5"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"15b8092208e8bfd9d8e901dfa87d982dba8ecbd0e6a45424a8d45b89d54d724b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0070c2c285ab07b63b2d91d0c5f9b713c12ffd0deef888508efd3b7680f3fbd3"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ce3f63df53288ab58cf6dbe2b6aeea19e57ec204f22a2810bb20007e8b3d4bf7"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a6742d7db6d467ff23e3eb3ac05b19d524f481006df72130ccb06914ad83f730"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"310fe0a69880d53c7b4873b68db33bf65dac3712b00ca700481718931345909f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5a684884cbb5f3a4bf28145476290690260f9aa0c91f2c60cfb1e94e0cd4db41"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"77ab2fa62cbd5842f0828c259cde72766c36c047622ab1da2194c986aafb15a6"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"20ad218498d52970422ee9a60bb0d1633a95fd745299fd899ac2dcee1ff4b7f3"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3056d37a874d7e469da2193faf97898022762c4ef4871c6b0bf15037e3fbf1ad"},"taxa":[{"id":"CWE-527","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-538","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","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":"635a35bac0c9edb62e962e7a8248095cafd3de89c77896b7989894acbfb2af42"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_thread_pool/src/registry.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6579145b04945179fb2bd7eebca5a5c30a5580fbe4e29a49dae90221dd1b3bbb"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away, so if it breaks, no one currently understands it. It does carry its own tests, so the behaviour is pinned even though the understanding is gone: schedule a read-through, using those tests as the specification, before the next change lands here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_thread_pool/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d32d251f2d236421b95862ac0ca72f1d7f01342755a87b22782198021c3dc507"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/project-model/src/project_json.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fe13ec799a21bd2ec9fd8662ff8561a48666b853de2928aedb6e261c662483e"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/attr.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"971b410f1766c22fb104d7f65b4fb4dfcbaebeb46381bfa0af42e61e5c2dcf1c"}},{"ruleId":"D34","level":"note","message":{"text":"Further orphaned files (smaller): 16 smaller file(s) also have no living knowledge \u2014 folded into the freshness score and metrics rather than raised one row each \u2014 most significant first: src/tools/jsondocck/src/directive.rs, src/tools/compiletest/src/runtest/coverage.rs, src/tools/rust-analyzer/crates/ide-db/src/prime_caches.rs, src/tools/rustfmt/src/reorder.rs, src/tools/rustfmt/src/sort.rs, src/tools/clippy/clippy_lints/src/methods/or_fun_call.rs, src/tools/rustfmt/src/shape.rs, library/std/src/sys/process/unix/fuchsia.rs (and 8 more) (20 orphaned of 2581 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; 2581 of the 6286 production source files in this repository met that bar). 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/tools/jsondocck/src/directive.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c1595460e1c77e784161785f5b2787b55742dac86d7d18efa66e161d4aab141"}},{"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/tools/compiletest/src/runtest/coverage.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9265d168af41f0aa629c24e24d9757c5bc9340eda56528af5842c885e444b31a"}},{"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/tools/rust-analyzer/crates/ide-db/src/prime_caches.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfc9cd04c3b0abe96b8f12c94fdbe1f08c0fabbe9010930eaf3be515bc1b2f11"}},{"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/tools/rustfmt/src/config/file_lines.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d49cd210d093bc046a93e023d3fbe06afd37815580069dac30a725f0f45adac"}},{"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/tools/rustfmt/src/reorder.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd93cf0f9b2223c51faf1bdc7507f0e640cd8f80a6641d5ca6326e755d521f2b"}},{"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/tools/rustfmt/src/sort.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"629675426fe310a425c0d0faf85da3537de70561688db204cfd246ea1dcc4616"}},{"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/tools/clippy/clippy_lints/src/methods/or_fun_call.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1215bf305f6f791ed123c09b955f8bf64632baca3f8095f9ee7314f576320359"}},{"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/tools/rustfmt/src/shape.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdcfac78ba54a1eed086cb12a167b9dde144df5bea3ea8a626d38f971d2760fb"}},{"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":"library/std/src/sys/process/unix/fuchsia.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9da2d0b9dab2ac706f006677a802df10f18549c4bc91d22fc4b7447875cddfc"}},{"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/tools/rustfmt/src/vertical.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b88b94565d0e4730b3b1c5c3e3cf62a73c75df658d2e9d619f99af8cd5514cef"}},{"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/tools/rustfmt/config_proc_macro/src/item_enum.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4b253dce13d930a8ef9e05c499b5e5aa2efb9ad9e141fbe61e8b4560b3f8197"}},{"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/tools/rustfmt/src/formatting/newline_style.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1cfbeb47cc8e67fbd2da3ba2fb6fd7b3240fe4c32decf8d69741b2a3232ac07"}},{"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/tools/rustfmt/src/format-diff/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff9d3a48ff6943aa22e06d2fd654b98d357c49d80b5973531e3b631d90095ac6"}},{"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/tools/rust-analyzer/crates/hir-ide/src/diagnostics/decl_check/case_conv.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e8b3b02ccb8dd12262a4bca2af3a1ffcc1aa431e3c6dbf27b8f5fc1ff5295b6"}},{"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/tools/rustfmt/src/git-rustfmt/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"144cb6b58b7305f04733f5928686b05a7ad61abc5751961438074c29d2fa9411"}},{"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/tools/rustfmt/src/rewrite.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c82d803fcb02c5fc0bd1bfc7140ef545fa6460dd51ff029dee78086a16b7850"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: mod.rs \u2194 intrinsic.rs: \u0060compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs\u0060 and \u0060compiler/rustc_hir_analysis/src/check/intrinsic.rs\u0060 change together 75% of the time (9 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are \u0060b6c9f78a\u0060 core: Split the \u0060resumable_breakpoint\u0060 intrinsic and constify it; \u0060d428655c\u0060 Make \u0060powi\u0060 generic; \u0060ac667d22\u0060 Make \u0060fma\u0060 and \u0060fmuladd\u0060 generic \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3032883d0a97236bf5da3ee2073690fdd2413d8bf448ec26ac235fbf3a293f72"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: encode_cross_crate.rs \u2194 builtin_attrs.rs: \u0060compiler/rustc_attr_ir/src/encode_cross_crate.rs\u0060 and \u0060compiler/rustc_feature/src/builtin_attrs.rs\u0060 change together 57% of the time (8 of the 14 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are \u0060a6443cbb\u0060 Port over \u0060rustc_should_not_be_called_on_const_items\u0060 to lint helper \u2026; \u00606c51a7c9\u0060 port over \u0060rustc_never_returns_null_ptr\u0060 to lint helper namespace; \u00603aae1361\u0060 Introduce \u0060#[rustc_unchecked_type_alias]\u0060 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_attr_ir/src/encode_cross_crate.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"49f36a83dc24d2b8b022cd06cf888bc2919ca54098da4756eeaad2a3034c8472"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: data_structures.rs \u2194 builtin_attrs.rs: \u0060compiler/rustc_attr_ir/src/data_structures.rs\u0060 and \u0060compiler/rustc_feature/src/builtin_attrs.rs\u0060 change together 53% of the time (9 of the 17 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are \u006034d13389\u0060 Remove documentation from \u0060BUILTIN_ATTRIBUTES\u0060; \u0060a6443cbb\u0060 Port over \u0060rustc_should_not_be_called_on_const_items\u0060 to lint helper \u2026; \u00606c51a7c9\u0060 port over \u0060rustc_never_returns_null_ptr\u0060 to lint helper namespace \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_attr_ir/src/data_structures.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ce9690f088665f4ae8252df18589bc61abdeecbfb4ef2c49002e05e2bc8a1c9"}},{"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":"5de3798f7095a8bcfe3bbb2781b6858c60c5877895e3017bb79a1e18cff00079"},"taxa":[{"id":"CICD-SEC-4","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":"fe274ba5adebde25ca0b3db842e44cbb1aaeb7cfecfbb7215cd452596ba1f4c2"},"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":"4f1e7684f8281bd255ddef97105c7055c2ebae06964c8745716b83e174debe83"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":5291}}}],"partialFingerprints":{"codehealthFindingId/v1":"c72d90a5c16f2783ee80bd950c0cf789f01c06ae5f1f4e2984786f8da9aa4fc4"}},{"ruleId":"AC3","level":"error","message":{"text":"\u003Chtml\u003E without a lang: The page declares no language, so assistive tech can\u0027t pick the right pronunciation. Add lang (e.g. lang=\u0022en\u0022)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/polonius/dump/polonius-mir-dump.template.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd0b97ed9d1826f903895269311100d7c1bbef18c97735d8f5ddee90d9e8c6a3"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/polonius/dump/polonius-mir-dump.template.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"6451b2ab1f50545dcca88853b1086d7a1d6a1b7f669640bb792d571f62c027d6"}},{"ruleId":"AC3","level":"error","message":{"text":"\u003Chtml\u003E without a lang: The page declares no language, so assistive tech can\u0027t pick the right pronunciation. Add lang (e.g. lang=\u0022en\u0022)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/generate-copyright/templates/COPYRIGHT-library.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"3628ae32696c124b08ab61cab05f616bcc7196c583519d9a1f595c4b24df9090"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/generate-copyright/templates/COPYRIGHT-library.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bc6d4d96b6ee650b394ae520f74c09b90b345c30a884f64db062a6236b39395"}},{"ruleId":"AC3","level":"error","message":{"text":"\u003Chtml\u003E without a lang: The page declares no language, so assistive tech can\u0027t pick the right pronunciation. Add lang (e.g. lang=\u0022en\u0022)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/generate-copyright/templates/COPYRIGHT.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d424a24a5bdaae3925b93ded6c1bcbd4458494e3916ff088e9cfa3155b2cfee"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/generate-copyright/templates/COPYRIGHT.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef1784e67eb32eba2e2c4d663cc2674de061df8db555243bd7bccdf624d0b440"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/editors/code/src/commands.ts"},"region":{"startLine":1362}}}],"partialFingerprints":{"codehealthFindingId/v1":"50719bce4ef7f574eff14addb50173c45c8be46603a8c406ba8e7c43eada1020"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed in CSS without a :focus replacement: \u0060#main-content\u0060 sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/css/rustdoc.css"},"region":{"startLine":1138}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f45265d8a39b6a145072880004129509891e6c62df628a7aef3d0876082029f"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.github-corner:hover .octo-arm\u0060 moves (\u0060animation: octocat-wave 560ms ease-in-out\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/util/gh-pages/style.css"},"region":{"startLine":742}}}],"partialFingerprints":{"codehealthFindingId/v1":"b155c3f9338b18332accd775aa7644c06363ef35bd6753d0f5f285eac37a2202"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.github-corner .octo-arm\u0060 moves (\u0060animation: octocat-wave 560ms ease-in-out\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/util/gh-pages/style.css"},"region":{"startLine":763}}}],"partialFingerprints":{"codehealthFindingId/v1":"7554a91adba9e759e406fd099ce7c0a215af2284991b26f10c14a3a4ca53908e"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.settings-menu.rotate \u003E a img\u0060 moves (\u0060animation: rotating 2s linear infinite\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/css/rustdoc.css"},"region":{"startLine":2442}}}],"partialFingerprints":{"codehealthFindingId/v1":"e17a2cebec49875bd32a56cf1a0f1d847645a44567b49acb71c9c9ba8c35dbca"}},{"ruleId":"AX8","level":"error","message":{"text":"Production project references a test project: compiletest \u2192 miropt-test-tools: \u0060compiletest\u0060 (production) references the test project \u0060miropt-test-tools\u0060. Production must never depend on test code \u2014 it pulls a unit-test framework and test fixtures into the shipped product and inverts the only correct direction (tests depend on production, never the reverse). Move any shared helper into a production support library, or invert the reference."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"29d2339ecf1f9460011c74fea952aa3fa4fb6b709c172e55f2a2b41086ec1a84"}},{"ruleId":"AX8","level":"error","message":{"text":"Production project references a test project: sysroot \u2192 test: \u0060sysroot\u0060 (production) references the test project \u0060test\u0060. Production must never depend on test code \u2014 it pulls a unit-test framework and test fixtures into the shipped product and inverts the only correct direction (tests depend on production, never the reverse). Move any shared helper into a production support library, or invert the reference."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"652b3adf4d67f04b9132b886e364414eb9626a8ba907655a0f91f7ec685f5033"}},{"ruleId":"AX8","level":"error","message":{"text":"Production project references a test project: tidy \u2192 miropt-test-tools: \u0060tidy\u0060 (production) references the test project \u0060miropt-test-tools\u0060. Production must never depend on test code \u2014 it pulls a unit-test framework and test fixtures into the shipped product and inverts the only correct direction (tests depend on production, never the reverse). Move any shared helper into a production support library, or invert the reference."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"b91c1cfa37d5cae26f2ac49febc65bdeebd56a3fe61ee2ebd02899c98ef2e856"}},{"ruleId":"AX8","level":"error","message":{"text":"Production project references a test project: util \u2192 libm-test: \u0060util\u0060 (production) references the test project \u0060libm-test\u0060. Production must never depend on test code \u2014 it pulls a unit-test framework and test fixtures into the shipped product and inverts the only correct direction (tests depend on production, never the reverse). Move any shared helper into a production support library, or invert the reference."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"eaa65d38b2cb285d0671d1f63601d2f369d390660ddf3d953829b9f909612ffa"}},{"ruleId":"AX9","level":"error","message":{"text":"Query writes persistent state on the read path: xous$module.get_env_store: \u0060xous$module.get_env_store\u0060 is a read-named query yet it performs a durable write on the read path (a persist to a store/repository). A query must stay side-effect-free so reads are safe to retry, cache, and route to a read replica; move the write into a command."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/env/xous.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"c58fd7cdf2cbd159aed926c4f1eac126869808b02f545223d0339d4e99fbe9ab"}},{"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":"P10","level":"note","message":{"text":"Implementation type on the public API: 1 public type in \u0060rustc_ast.ast\u0060 is marked as implementation by its own namespace, folder or name: \u0060EiiImpl\u0060 (compiler/rustc_ast/src/ast.rs:4106, name ends in \u0060Impl\u0060). While it is public, every consumer of the library can bind to it, so changing it is a breaking change for those consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ast/src/ast.rs"},"region":{"startLine":4106}}}],"partialFingerprints":{"codehealthFindingId/v1":"d715c070a0f31e2d5a1b4d5ce2ad723d8b88ec44e040cd88c6f0c2c61df898ea"}},{"ruleId":"P10","level":"note","message":{"text":"Implementation type on the public API: 1 public type in \u0060rustc_attr_ir.data_structures\u0060 is marked as implementation by its own namespace, folder or name: \u0060EiiImpl\u0060 (compiler/rustc_attr_ir/src/data_structures.rs:45, name ends in \u0060Impl\u0060). While it is public, every consumer of the library can bind to it, so changing it is a breaking change for those consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_attr_ir/src/data_structures.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ac69b323847aad41b92b21fd56d679f3ce60074343b9fd5b8bb852b2e462dd4"}},{"ruleId":"P10","level":"note","message":{"text":"Implementation type on the public API: 1 public type in \u0060rustc_mir_dataflow.impls.borrowed_locals\u0060 is marked as implementation by its own namespace, folder or name: \u0060MaybeBorrowedLocals\u0060 (compiler/rustc_mir_dataflow/src/impls/borrowed_locals.rs:13, \u0060impls\u0060). While it is public, every consumer of the library can bind to it, so changing it is a breaking change for those consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_dataflow/src/impls/borrowed_locals.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"038265fca489533597d48544dfc46a1ba5ae4c05f3553ce19b05f7fcebc362de"}},{"ruleId":"P10","level":"note","message":{"text":"Implementation type on the public API: 4 public types in \u0060rustc_mir_dataflow.impls.initialized\u0060 are marked as implementation by their own namespace, folder or name: \u0060MaybePlacesSwitchIntData\u0060 (compiler/rustc_mir_dataflow/src/impls/initialized.rs:25, \u0060impls\u0060), \u0060MaybeInitializedPlaces\u0060 (compiler/rustc_mir_dataflow/src/impls/initialized.rs:139, \u0060impls\u0060), \u0060MaybeUninitializedPlaces\u0060 (compiler/rustc_mir_dataflow/src/impls/initialized.rs:380, \u0060impls\u0060), \u0060EverInitializedPlaces\u0060 (compiler/rustc_mir_dataflow/src/impls/initialized.rs:595, \u0060impls\u0060). While they are public, every consumer of the library can bind to them, so changing them is a breaking change for those consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_dataflow/src/impls/initialized.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"53a5aba9e5aae409a79dac03e523a9d85333bf3fbd219b9014741ecf744db77b"}},{"ruleId":"P10","level":"note","message":{"text":"Implementation type on the public API: 4 public types in \u0060rustc_mir_dataflow.impls.liveness\u0060 are marked as implementation by their own namespace, folder or name: \u0060MaybeLiveLocals\u0060 (compiler/rustc_mir_dataflow/src/impls/liveness.rs:24, \u0060impls\u0060), \u0060LivenessTransferFunction\u0060 (compiler/rustc_mir_dataflow/src/impls/liveness.rs:81, \u0060impls\u0060), \u0060DefUse\u0060 (compiler/rustc_mir_dataflow/src/impls/liveness.rs:133, \u0060impls\u0060), \u0060MaybeTransitiveLiveLocals\u0060 (compiler/rustc_mir_dataflow/src/impls/liveness.rs:209, \u0060impls\u0060). While they are public, every consumer of the library can bind to them, so changing them is a breaking change for those consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_dataflow/src/impls/liveness.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"64f026301d31159e2de6d1302e90650f1f7cd1ae6b1362304ae89ebeae0cd9eb"}},{"ruleId":"P10","level":"note","message":{"text":"Implementation type on the public API: 4 public types in \u0060rustc_mir_dataflow.impls.precise_liveness\u0060 are marked as implementation by their own namespace, folder or name: \u0060VisitAllocatedLocalsWith\u0060 (compiler/rustc_mir_dataflow/src/impls/precise_liveness.rs:50, \u0060impls\u0060), \u0060VisitDeallocatedLocalsWith\u0060 (compiler/rustc_mir_dataflow/src/impls/precise_liveness.rs:66, \u0060impls\u0060), \u0060SplitPointEffect\u0060 (compiler/rustc_mir_dataflow/src/impls/precise_liveness.rs:344, \u0060impls\u0060), \u0060SplitPointIndex\u0060 (compiler/rustc_mir_dataflow/src/impls/precise_liveness.rs:349, \u0060impls\u0060). While they are public, every consumer of the library can bind to them, so changing them is a breaking change for those consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_dataflow/src/impls/precise_liveness.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"026c0e2a8f763d6b4525be0465e1be6b7a4b332136a5cb7632da55e769ff5afe"}},{"ruleId":"P10","level":"note","message":{"text":"Implementation type on the public API: 3 public types in \u0060rustc_mir_dataflow.impls.storage_liveness\u0060 are marked as implementation by their own namespace, folder or name: \u0060MaybeStorageLive\u0060 (compiler/rustc_mir_dataflow/src/impls/storage_liveness.rs:29, \u0060impls\u0060), \u0060MaybeStorageDead\u0060 (compiler/rustc_mir_dataflow/src/impls/storage_liveness.rs:71, \u0060impls\u0060), \u0060MaybeRequiresStorage\u0060 (compiler/rustc_mir_dataflow/src/impls/storage_liveness.rs:120, \u0060impls\u0060). While they are public, every consumer of the library can bind to them, so changing them is a breaking change for those consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_dataflow/src/impls/storage_liveness.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"1706280a335451d58d942b5b92ea9cc38e19bd25182ec2952ba8a274d6cce890"}},{"ruleId":"P10","level":"note","message":{"text":"Implementation type on the public API: 1 public type in \u0060core.mem.type_info\u0060 is marked as implementation by its own namespace, folder or name: \u0060TraitImpl\u0060 (library/core/src/mem/type_info.rs:22, name ends in \u0060Impl\u0060). While it is public, every consumer of the library can bind to it, so changing it is a breaking change for those consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/mem/type_info.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"07b22684bc5a7e0dcd2e402083cf23b1dff2f9e67d2a5a82340fc686068a862b"}},{"ruleId":"P10","level":"note","message":{"text":"Implementation type on the public API: 1 public type in \u0060hir.diagnostics\u0060 is marked as implementation by its own namespace, folder or name: \u0060IncoherentImpl\u0060 (src/tools/rust-analyzer/crates/hir/src/diagnostics.rs:523, name ends in \u0060Impl\u0060). While it is public, every consumer of the library can bind to it, so changing it is a breaking change for those consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir/src/diagnostics.rs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"22d24f49a4fd91461cb578a1b28811990a8cc6c1e6ec19c0f9087a5df542332b"}},{"ruleId":"P10","level":"note","message":{"text":"Implementation type on the public API: 1 public type in \u0060hir.semantics\u0060 is marked as implementation by its own namespace, folder or name: \u0060SemanticsImpl\u0060 (src/tools/rust-analyzer/crates/hir/src/semantics.rs:171, name ends in \u0060Impl\u0060). While it is public, every consumer of the library can bind to it, so changing it is a breaking change for those consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir/src/semantics.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"626de4b1ec7bf1c13ebc98b303a4d65dea1890cb86f99ef2e17adf79989521dc"}},{"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 87/161 runnable modules use logging (modules with no entry point or server are excluded \u2014 they are libraries a runnable module hosts). Silent: \u0060.\u0060, \u0060compiler/rustc\u0060, \u0060compiler/rustc_codegen_cranelift/build_system\u0060, \u0060compiler/rustc_codegen_gcc/build_system\u0060, \u0060compiler/rustc_codegen_gcc/build_system/asm-tester\u0060 and 69 more."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"91a94e21d6d4d0e6a2003f94505b0b02b157176f0b24c4820f3f82b4447a97fe"}},{"ruleId":"P3","level":"note","message":{"text":"No dependency-update automation: \u0060package.json\u0060 declares packages, and nothing in the repository keeps them current: no Dependabot or Renovate configuration that schedules updates, and no dependency-review gate on pull requests. A pinned dependency stays at the version it was added at until someone notices \u2014 including after an advisory is published against it. Add a \u0060.github/dependabot.yml\u0060 with one \u0060package-ecosystem\u0060 entry per ecosystem the tree uses (or an enabled \u0060renovate.json\u0060), and gate pull requests with \u0060actions/dependency-review-action\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b237f7efe841e3a95b381b232502a3a473094adeb069a11eaca8ca533fb1c34"}},{"ruleId":"R10","level":"warning","message":{"text":"Wholesale file copy (66 identical lines \u00D7 2 files): src/librustdoc/html/static/.eslintrc.js:1 \u00B7 src/tools/rustdoc-js/.eslintrc.js:1 \u2014 these 2 files are line-for-line copies of one another \u2014 66 lines are identical, in the same order, in every one of them \u2014 so this is one fact about the file set, not a block to extract. An edit made to one file and not the others changes behaviour silently, which is the failure a wholesale copy guarantees. Pick one file as the single source and derive the others from it (re-export it, spread it into the local overrides each variant genuinely needs, or generate the copies at build time) \u2014 the few lines that differ between the files are exactly the part each variant should still own. Check first whether the copies are deliberately standalone deliverables (a translation file seeded from its sibling and waiting to be translated); where they are, the duplication is the design, and the honest move is to mark the seeded file as untranslated rather than to let it pass as done."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/.eslintrc.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"344ca6204b6664656d688fe3862a888c34da71fdaa6bebaa802301ee1711c637"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (42 lines \u00D7 2 locations): src/librustdoc/html/static/js/stringdex.js:1941 \u00B7 src/librustdoc/html/static/js/stringdex.js:2441 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/stringdex.js"},"region":{"startLine":1941}}}],"partialFingerprints":{"codehealthFindingId/v1":"03bb1cdfa6d5a03f5357ad679c19352b6c7d11c5ede1cc40f12d8371fa316e58"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (36 lines \u00D7 2 locations): src/tools/rust-analyzer/editors/code/src/commands.ts:210 \u00B7 src/tools/rust-analyzer/editors/code/src/commands.ts:247 \u2014 both copies are in the same file, so extract the block 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/tools/rust-analyzer/editors/code/src/commands.ts"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"4518f8f66facec3e564aa62a07e8d21004fc1074679171d055dfe265be840240"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (34 lines \u00D7 2 locations): src/tools/rust-analyzer/editors/code/src/commands.ts:722 \u00B7 src/tools/rust-analyzer/editors/code/src/commands.ts:786 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/editors/code/src/commands.ts"},"region":{"startLine":722}}}],"partialFingerprints":{"codehealthFindingId/v1":"7720a9ff9e67f59440d20900616666578fe0b846f2f5fb947775f83b46475cba"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2 locations): src/librustdoc/html/static/js/stringdex.js:27 \u00B7 src/librustdoc/html/static/js/stringdex.js:118 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/stringdex.js"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e4ba87acc9b9d0b69cde639a68edcc14195dd1210fab0d0709354beec52fa59"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2 locations): src/librustdoc/html/static/js/stringdex.js:3117 \u00B7 src/librustdoc/html/static/js/stringdex.js:3155 \u2014 both copies are in the same file, so extract the block 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/librustdoc/html/static/js/stringdex.js"},"region":{"startLine":3117}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb43a779ef57f402455fa95e894eaaad7d4245cb9747cadf2666ba49789ca604"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2 locations): src/librustdoc/html/static/js/stringdex.js:2646 \u00B7 src/librustdoc/html/static/js/stringdex.js:2710 \u2014 both copies are in the same file, so extract the block 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/librustdoc/html/static/js/stringdex.js"},"region":{"startLine":2646}}}],"partialFingerprints":{"codehealthFindingId/v1":"71f4e1be1fb6967d19a32d39292ee460d2e4a5c67bf252b5ace8108cd6dc7ebc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2 locations): src/librustdoc/html/static/js/stringdex.js:1805 \u00B7 src/librustdoc/html/static/js/stringdex.js:2355 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/stringdex.js"},"region":{"startLine":1805}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e83f402c01d0ff03f31e29a189bb0dde67cb9317700610233075a383aabd1ff"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2 locations): src/librustdoc/html/static/js/search.js:3478 \u00B7 src/librustdoc/html/static/js/search.js:3514 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":3478}}}],"partialFingerprints":{"codehealthFindingId/v1":"d813342d9655c18cddb0b2693b9628c8c38c794bef113fdd1aac1789b24633f4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2 locations): src/librustdoc/html/static/js/search.js:3223 \u00B7 src/librustdoc/html/static/js/search.js:3422 \u2014 both copies are in the same file, so extract the block 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/librustdoc/html/static/js/search.js"},"region":{"startLine":3223}}}],"partialFingerprints":{"codehealthFindingId/v1":"13549e781893c723945a4fd63983967105de24f7ce64e8a7765513fd2e453a30"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2 locations): src/librustdoc/html/static/js/stringdex.js:2160 \u00B7 src/librustdoc/html/static/js/stringdex.js:2220 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/stringdex.js"},"region":{"startLine":2160}}}],"partialFingerprints":{"codehealthFindingId/v1":"c98b45a3bc5c534a6ed91b1133063daac2217a3c1928fb070bb57486ff7ffbad"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): src/librustdoc/html/static/js/search.js:3020 \u00B7 src/librustdoc/html/static/js/search.js:3353 \u2014 both copies are in the same file, so extract the block 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/librustdoc/html/static/js/search.js"},"region":{"startLine":3020}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dbb9f2100446c8fe3f6487258a506cec86c633b8bd63642eb521513ab2c31ff"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): src/librustdoc/html/static/js/stringdex.js:2203 \u00B7 src/librustdoc/html/static/js/stringdex.js:2259 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/stringdex.js"},"region":{"startLine":2203}}}],"partialFingerprints":{"codehealthFindingId/v1":"17f134c076611e030e26c550043274b8df9aff0e0a09e56d5dd80b703991cc09"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): src/librustdoc/html/static/js/stringdex.js:4040 \u00B7 src/librustdoc/html/static/js/stringdex.js:4347 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/stringdex.js"},"region":{"startLine":4040}}}],"partialFingerprints":{"codehealthFindingId/v1":"7efb49dafc37d89ccb8f7544425158f90d24b51ea8476df100d7db0db5de3668"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): src/librustdoc/html/static/js/stringdex.js:371 \u00B7 src/librustdoc/html/static/js/stringdex.js:494 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/stringdex.js"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"dce03ad5b3945df3e97bd16fc76a89308fa01e484050396e386944b15b5bbace"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): src/librustdoc/html/static/js/stringdex.js:404 \u00B7 src/librustdoc/html/static/js/stringdex.js:517 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/stringdex.js"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"f043603d96dee52594c9664d9c64f5e5da1930f4b92fc3bea3e919f77853b486"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3 locations): src/tools/rust-analyzer/editors/code/src/commands.ts:622 \u00B7 src/tools/rust-analyzer/editors/code/src/commands.ts:727 \u00B7 src/tools/rust-analyzer/editors/code/src/commands.ts:791 \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/tools/rust-analyzer/editors/code/src/commands.ts"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"91d5e83a0d0f91a98473c7f676ba9b33b0c9f8520596ceaefad0f9087239900b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): src/librustdoc/html/static/js/main.js:1622 \u00B7 src/librustdoc/html/static/js/settings.js:354 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/main.js"},"region":{"startLine":1622}}}],"partialFingerprints":{"codehealthFindingId/v1":"b506756f38e1a5626e289f16b7796f4b6767cb81542be668c8a6e013e67bcef9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): src/librustdoc/html/static/js/stringdex.js:3632 \u00B7 src/librustdoc/html/static/js/stringdex.js:3649 \u2014 both copies are in the same file, so extract the block 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/librustdoc/html/static/js/stringdex.js"},"region":{"startLine":3632}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8855fd1febf5f6a7567926e8b545507cd5719d9c1ef9952eba8ef3d63b61b63"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): src/librustdoc/html/static/js/search.js:2484 \u00B7 src/librustdoc/html/static/js/search.js:2502 \u2014 both copies are in the same file, so extract the block 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/librustdoc/html/static/js/search.js"},"region":{"startLine":2484}}}],"partialFingerprints":{"codehealthFindingId/v1":"05e269aa14b2913df5a75b2b22380869808930a9de2be4574a5ee5f344e5fb5f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): src/librustdoc/html/static/js/stringdex.js:716 \u00B7 src/librustdoc/html/static/js/stringdex.js:766 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/stringdex.js"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"0445ee29e8f31f356f61821ac65d15cd275b81c56013d56a7e1e9a0b85c7b0ed"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/librustdoc/html/static/js/stringdex.js:3225 \u00B7 src/librustdoc/html/static/js/stringdex.js:3263 \u2014 both copies are in the same file, so extract the block 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/librustdoc/html/static/js/stringdex.js"},"region":{"startLine":3225}}}],"partialFingerprints":{"codehealthFindingId/v1":"28012011ae62879ca7d41285a26eb5ac42a18467b15e1f60e21553c143719d4e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/tools/rust-analyzer/editors/code/src/commands.ts:648 \u00B7 src/tools/rust-analyzer/editors/code/src/commands.ts:817 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/editors/code/src/commands.ts"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"f70aa5773275ffcb6e565d2a2a99be9631cd46323de71d1dbd44be84205875cd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/librustdoc/html/static/js/stringdex.js:906 \u00B7 src/librustdoc/html/static/js/stringdex.js:988 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/stringdex.js"},"region":{"startLine":906}}}],"partialFingerprints":{"codehealthFindingId/v1":"19f7901da286d2695dcd5f881a0f43b8e6d6362e6ac84520d26c6d9734aff764"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/librustdoc/html/static/js/stringdex.js:3502 \u00B7 src/librustdoc/html/static/js/stringdex.js:3555 \u2014 both copies are in the same file, so extract the block 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/librustdoc/html/static/js/stringdex.js"},"region":{"startLine":3502}}}],"partialFingerprints":{"codehealthFindingId/v1":"676661f93aa27adff62f634f1c5139231e3ab8177d10c594f4edddbbf14a3734"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/librustdoc/html/static/js/stringdex.js:3516 \u00B7 src/librustdoc/html/static/js/stringdex.js:3597 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/stringdex.js"},"region":{"startLine":3516}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfb4a588f6d7cd3acb9668631ad53a85ccc1dd29a124217224e3a9e9d4525001"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/tools/rust-analyzer/editors/code/src/commands.ts:1032 \u00B7 src/tools/rust-analyzer/editors/code/src/commands.ts:1067 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/editors/code/src/commands.ts"},"region":{"startLine":1032}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc2e894d58f68cd3993a268440669f407cd96971146692e340cbe27d18b10a5a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/tools/rust-analyzer/editors/code/src/commands.ts:1058 \u00B7 src/tools/rust-analyzer/editors/code/src/commands.ts:1083 \u2014 both copies are in the same file, so extract the block 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/tools/rust-analyzer/editors/code/src/commands.ts"},"region":{"startLine":1058}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca4a19f44696019288990102a9b4c8c30f1afbdac304b483d554672b89444878"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4 locations): src/librustdoc/html/static/js/search.js:1650 \u00B7 src/librustdoc/html/static/js/search.js:1706 \u00B7 src/librustdoc/html/static/js/search.js:1731 \u00B7 src/librustdoc/html/static/js/search.js:1808 \u2014 all 4 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":1650}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8fcb4a6460d06d67c49f107309f7e112559d03ebaa0410b259256b44cd674ce"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3 locations): src/librustdoc/html/static/js/search.js:1845 \u00B7 src/librustdoc/html/static/js/search.js:1858 \u00B7 src/librustdoc/html/static/js/search.js:1911 \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/librustdoc/html/static/js/search.js"},"region":{"startLine":1845}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e6984644dd9c6505c5a32d72fa4d0438659039ae0b6728661a1a63320caa7ed"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/librustdoc/html/static/js/search.js:5573 \u00B7 src/librustdoc/html/static/js/stringdex.js:3701 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":5573}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb0375de53eb5af6abc66f7433defffea9cb7b1826de24da932b4575ce9423a3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/librustdoc/html/static/js/stringdex.js:457 \u00B7 src/librustdoc/html/static/js/stringdex.js:566 \u2014 both copies are in the same file, so extract the block 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/librustdoc/html/static/js/stringdex.js"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd5f2d247ae40111b75c0b6555ae6873504e236c2a0d17f9665e32f7d657a31b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/librustdoc/html/static/js/stringdex.js:1485 \u00B7 src/librustdoc/html/static/js/stringdex.js:1520 \u2014 both copies are in the same file, so extract the block 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/librustdoc/html/static/js/stringdex.js"},"region":{"startLine":1485}}}],"partialFingerprints":{"codehealthFindingId/v1":"b21c0ee2219fe362535c8b79236b9be8feed02fb1e398c6c8d77ddcc575379d7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/librustdoc/html/static/js/stringdex.js:2285 \u00B7 src/librustdoc/html/static/js/stringdex.js:2551 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/stringdex.js"},"region":{"startLine":2285}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e1d55cfca119a41ad31acdaa8f9ce11a6011bd5185040167e40721ce21dc307"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/tools/rust-analyzer/editors/code/src/commands.ts:102 \u00B7 src/tools/rust-analyzer/editors/code/src/commands.ts:279 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/editors/code/src/commands.ts"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"d69d65b6b2008d77c3a0e1e4c3edae0abd192eda534b0b386edebece3231e9cf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/tools/rustdoc-js/tester.js:199 \u00B7 src/tools/rustdoc-js/tester.js:246 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustdoc-js/tester.js"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f190be3d7af00a95fc957e76ffb0b2785e85332ff196e0bb5363272c29d3180"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/librustdoc/html/static/js/main.js:38 \u00B7 src/librustdoc/html/static/js/main.js:167 \u2014 both copies are in the same file, so extract the block 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/librustdoc/html/static/js/main.js"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"5768f57c83b2a04ecdd20e3d13a2b37aea6dab6b84e36ac148497eeb78edc26f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): src/librustdoc/html/static/js/search.js:4142 \u00B7 src/librustdoc/html/static/js/search.js:4166 \u00B7 src/librustdoc/html/static/js/search.js:4189 \u2014 all 3 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":4142}}}],"partialFingerprints":{"codehealthFindingId/v1":"2673f4dc2999f2a44530e8d8c93690f9dd5e6839881560096f016235e23015f6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/librustdoc/html/static/js/search.js:5061 \u00B7 src/librustdoc/html/static/js/search.js:5101 \u2014 both copies are in the same file, so extract the block 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/librustdoc/html/static/js/search.js"},"region":{"startLine":5061}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dee0eb271f465381154cf8989fd3a99ce37c80e3b899a2b5e53672a4591d6c6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/librustdoc/html/static/js/stringdex.js:940 \u00B7 src/librustdoc/html/static/js/stringdex.js:1013 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/stringdex.js"},"region":{"startLine":940}}}],"partialFingerprints":{"codehealthFindingId/v1":"307128ab5c911d06f67a1f0c6e391404339663781ded80006a312aa9dce45418"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/librustdoc/html/static/js/stringdex.js:3086 \u00B7 src/librustdoc/html/static/js/stringdex.js:3098 \u2014 both copies are in the same file, so extract the block 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/librustdoc/html/static/js/stringdex.js"},"region":{"startLine":3086}}}],"partialFingerprints":{"codehealthFindingId/v1":"59d574c9ac96812d7ca550f1755885943894d4df5d9c2eefedb2092d34832c48"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): src/tools/rust-analyzer/editors/code/src/bootstrap.ts:203 \u00B7 src/tools/rust-analyzer/editors/code/src/ctx.ts:223 \u2014 the two spans are one implementation copied and then locally edited \u2014 58 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/editors/code/src/bootstrap.ts"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b356a951d9f078b2832ccd729220b3cda8e5117d51b311f5c74faec99294a1f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4 locations): src/tools/rust-analyzer/editors/code/src/commands.ts:55 \u00B7 src/tools/rust-analyzer/editors/code/src/commands.ts:770 \u00B7 src/tools/rust-analyzer/editors/code/src/commands.ts:836 \u00B7 src/tools/rust-analyzer/editors/code/src/commands.ts:966 \u2014 all 4 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/editors/code/src/commands.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"e892476bc930f5f1d539d5efe06b7e70791b04de0da841e175a1bf0a0f59ccee"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/librustdoc/html/static/js/search.js:4170 \u00B7 src/librustdoc/html/static/js/search.js:4193 \u2014 both copies are in the same file, so extract the block 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/librustdoc/html/static/js/search.js"},"region":{"startLine":4170}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b74e3c8d6d6fc11bff0bc9ea78bec460a1f56e907635ebce1b0fd3f75f8c2f0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/librustdoc/html/static/js/stringdex.js:2045 \u00B7 src/librustdoc/html/static/js/stringdex.js:2111 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/stringdex.js"},"region":{"startLine":2045}}}],"partialFingerprints":{"codehealthFindingId/v1":"f430962f51caf16615fe6dd72c104d0e172b234edb2266922996f018f19e17c7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/librustdoc/html/static/js/search.js:2593 \u00B7 src/librustdoc/html/static/js/search.js:2656 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":2593}}}],"partialFingerprints":{"codehealthFindingId/v1":"bec9126c476a0d13ba3b81d7a1d9902095223ae4664cd691163101b1ba25fc1a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/librustdoc/html/static/js/stringdex.js:3872 \u00B7 src/librustdoc/html/static/js/stringdex.js:3883 \u2014 both copies are in the same file, so extract the block 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/librustdoc/html/static/js/stringdex.js"},"region":{"startLine":3872}}}],"partialFingerprints":{"codehealthFindingId/v1":"c840631c703c2eb3e81d71401b9460648dca068c10008246694373817e255d13"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/tools/rust-analyzer/editors/code/src/commands.ts:767 \u00B7 src/tools/rust-analyzer/editors/code/src/commands.ts:833 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/editors/code/src/commands.ts"},"region":{"startLine":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6305974cb5defa79144f85cc94b0f4f18ccafd806a8e12e1012e9a33364bed3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/librustdoc/html/static/js/search.js:3056 \u00B7 src/librustdoc/html/static/js/search.js:3568 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":3056}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a6dbfd15f9e165a69aeed927c471d9518e5da91627ff0e1459665d81c59b9ff"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): src/librustdoc/html/static/js/stringdex.js:2251 \u00B7 src/librustdoc/html/static/js/stringdex.js:2289 \u00B7 src/librustdoc/html/static/js/stringdex.js:2556 \u2014 all 3 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/stringdex.js"},"region":{"startLine":2251}}}],"partialFingerprints":{"codehealthFindingId/v1":"b40998a7d9484ce8c55e78317afa069042ab8e9303399ef17deded86067e86a2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/librustdoc/html/static/js/stringdex.js:3274 \u00B7 src/librustdoc/html/static/js/stringdex.js:3284 \u2014 both copies are in the same file, so extract the block 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/librustdoc/html/static/js/stringdex.js"},"region":{"startLine":3274}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d3e9012770803068334f362d26d5ee8e55817e5e3afd35ce046eb29cf9ee89b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/librustdoc/html/static/js/main.js:870 \u00B7 src/librustdoc/html/static/js/main.js:1013 \u2014 both copies are in the same file, so extract the block 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/librustdoc/html/static/js/main.js"},"region":{"startLine":870}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7c2d6dd189814fd655df3af724bdb290490c06cd78e69ca0be47d058c1f2c9c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): src/librustdoc/html/static/js/search.js:3139 \u00B7 src/librustdoc/html/static/js/search.js:3314 \u00B7 src/librustdoc/html/static/js/search.js:3538 \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/librustdoc/html/static/js/search.js"},"region":{"startLine":3139}}}],"partialFingerprints":{"codehealthFindingId/v1":"20a9bd18ea53176b35447f41a90c94db7094ebe5608a338ee50f4d86eada7b6b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 8 locations): src/librustdoc/html/static/js/stringdex.js:924 \u00B7 src/librustdoc/html/static/js/stringdex.js:956 \u00B7 src/librustdoc/html/static/js/stringdex.js:3134 \u00B7 src/librustdoc/html/static/js/stringdex.js:3172 \u00B7 \u002B4 more site(s) not listed \u2014 all 8 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/stringdex.js"},"region":{"startLine":924}}}],"partialFingerprints":{"codehealthFindingId/v1":"5192c8b6744deb58604e1d18f1794834b9f2971d3d4791e588efb2848d9adea4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/librustdoc/html/static/js/stringdex.js:2634 \u00B7 src/librustdoc/html/static/js/stringdex.js:3367 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/stringdex.js"},"region":{"startLine":2634}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a481c9b366cc80d7509bee4a6ed19ff360976b09b87705f93e0c2a71032faeb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): src/librustdoc/html/static/js/search.js:1359 \u00B7 src/librustdoc/html/static/js/search.js:1364 \u00B7 src/librustdoc/html/static/js/search.js:1369 \u2014 all 3 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":1359}}}],"partialFingerprints":{"codehealthFindingId/v1":"71ca2587be8112d84b151a2b9518eaafccef878d21b1930ee1ab1765f343b248"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/librustdoc/html/static/js/stringdex.js:471 \u00B7 src/librustdoc/html/static/js/stringdex.js:581 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/stringdex.js"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"050a821f63d5e6d038763f8f18e895570ebc1bce02c2209565b27661e3a668a0"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: src/tools/rust-analyzer/editors/code/src/client.ts:5 imports vscode-languageclient/lib/common/utils/is, reaching past a declared dependency\u0027s public entry into its build output \u2014 that path is the package\u0027s toolchain layout, not its API, and a minor version bump can relocate it with no semver signal. Import from the package\u0027s documented entry point instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/editors/code/src/client.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fb9d1abc67ce71443375f68db008b8e9bdefac34d16195c17331d60045b281c"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: src/tools/rust-analyzer/editors/code/src/config.ts:1 imports vscode-languageclient/lib/common/utils/is, reaching past a declared dependency\u0027s public entry into its build output \u2014 that path is the package\u0027s toolchain layout, not its API, and a minor version bump can relocate it with no semver signal. Import from the package\u0027s documented entry point instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/editors/code/src/config.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"93117b317fd2f62c37252a5f03d7576501e2607792293993c2a6d4b7a99fc8ab"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function makeSearchTreeFromBase64 (cyclomatic 59, cognitive 195): makeSearchTreeFromBase64 has cyclomatic complexity 59 and cognitive complexity 195; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/stringdex.js"},"region":{"startLine":3009}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbcf99d4420f738919d763005ef7e2f758e4e2f3f1a764bd32cee26cacd3a841"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function unifyFunctionTypes (cyclomatic 47, cognitive 87): unifyFunctionTypes has cyclomatic complexity 47 and cognitive complexity 87; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":3020}}}],"partialFingerprints":{"codehealthFindingId/v1":"bee90394450bd9e142233f06e8940bfc6727f09157ac2b9620a8d7f3448bfe7f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getNextElem (cyclomatic 39, cognitive 70): getNextElem has cyclomatic complexity 39 and cognitive complexity 70; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"57ef8dfb078e171d5fb0cee13f43217c7d06276bec03cf0b0a534838039563b6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function unpackPostingsList (cyclomatic 37, cognitive 80): unpackPostingsList has cyclomatic complexity 37 and cognitive complexity 80; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":4302}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec7dccf6aeb0f200f07f5844b3e72749082ba029dde9500f79adb73b3a1256e3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function makeBranchesFromBinaryData (cyclomatic 36, cognitive 93): makeBranchesFromBinaryData has cyclomatic complexity 36 and cognitive complexity 93; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/stringdex.js"},"region":{"startLine":3045}}}],"partialFingerprints":{"codehealthFindingId/v1":"5afb3292cb01ab7683961e18c8b8542ce42b58f549c68ac0920288ca38dcc810"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function innerRunNameQuery (cyclomatic 35, cognitive 72): innerRunNameQuery has cyclomatic complexity 35 and cognitive complexity 72; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":3982}}}],"partialFingerprints":{"codehealthFindingId/v1":"2578df31b0f4cd9c400639690ba619f8d0dcd39a612241d0a75e4a6c88c22077"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function unifyFunctionTypeIsMatchCandidate (cyclomatic 33, cognitive 49): unifyFunctionTypeIsMatchCandidate has cyclomatic complexity 33 and cognitive complexity 49; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":3565}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8b8bd665d7d5f8683da0adbed363e6b8c4a32befb04b4f58c435cd88f999b6f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 32, cognitive 47): constructor has cyclomatic complexity 32 and cognitive complexity 47; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/stringdex.js"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"29c094621c69579580d2783369e07802c578aac50d6a61a149ccbdd3446724f7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function prefixMatches (cyclomatic 31, cognitive 83): prefixMatches has cyclomatic complexity 31 and cognitive complexity 83; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/stringdex.js"},"region":{"startLine":2031}}}],"partialFingerprints":{"codehealthFindingId/v1":"bec4b65c9959d23a60888a79c60ade85d249ac05d97b20f3df2a0b61ede1af4c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildItemSearchType (cyclomatic 31, cognitive 41): buildItemSearchType has cyclomatic complexity 31 and cognitive complexity 41; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":2032}}}],"partialFingerprints":{"codehealthFindingId/v1":"b95af4607a12126bfc284a3d67b8b2426dbd691e4faddf8be0d16364d2388fe4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function intersection (cyclomatic 30, cognitive 60): intersection has cyclomatic complexity 30 and cognitive complexity 60; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/stringdex.js"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"4939bd4842f8656afc2d4c8a948716bb751eb5a1ec10cbe6f3827a025d31b5bd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 29, cognitive 45): (anonymous) has cyclomatic complexity 29 and cognitive complexity 45; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":2843}}}],"partialFingerprints":{"codehealthFindingId/v1":"a70dc4abf4c71b2a3780f1bf9a4ad88749919b7d8cfa83b3506bfdb414a37855"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getItemsBefore (cyclomatic 29, cognitive 42): getItemsBefore has cyclomatic complexity 29 and cognitive complexity 42; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"eda33c9955fc49a6066d9ecef761959395251a975b320ec70fc0c14764a0bd47"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function union (cyclomatic 28, cognitive 49): union has cyclomatic complexity 28 and cognitive complexity 49; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/stringdex.js"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9a10c2fe96ad15dcf64481189e3cd61ac51601917d03a3cd3940b7bce5ef531"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function writeFn (cyclomatic 27, cognitive 47): writeFn has cyclomatic complexity 27 and cognitive complexity 47; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":2538}}}],"partialFingerprints":{"codehealthFindingId/v1":"453ae4e664f8793509498adbe5e4c754a193e28987b4778a3a1b5fb63faddfa5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getIdentEndPosition (cyclomatic 25, cognitive 48): getIdentEndPosition has cyclomatic complexity 25 and cognitive complexity 48; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":972}}}],"partialFingerprints":{"codehealthFindingId/v1":"3326a905bedb2065e1dcf0d887dd0955723c53f5071508a8c94e826bc22e002b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getRow (cyclomatic 25, cognitive 24): getRow has cyclomatic complexity 25 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":1930}}}],"partialFingerprints":{"codehealthFindingId/v1":"220f5330c59a369e143a3183dd3e04a3825bcb3d82f56c4dc22586000f66855e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function valueCheck (cyclomatic 23, cognitive 50): valueCheck has cyclomatic complexity 23 and cognitive complexity 50; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustdoc-js/tester.js"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b4a10c5b7d38d4068146a5f6e0843e574c31f38c7373da36b198e87bd620335"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function unifyGenericTypes (cyclomatic 23, cognitive 36): unifyGenericTypes has cyclomatic complexity 23 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":3353}}}],"partialFingerprints":{"codehealthFindingId/v1":"312491ab151e8cbc42e21f5e7050f7754049f5d92411f866974ae11bed0d99fc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function transformResults (cyclomatic 22, cognitive 53): transformResults has cyclomatic complexity 22 and cognitive complexity 53; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":2694}}}],"partialFingerprints":{"codehealthFindingId/v1":"26572f2df512871740dc7e325692a6caf9b953d2bc235348d55f28031acb9b38"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function substringMatches (cyclomatic 21, cognitive 70): substringMatches has cyclomatic complexity 21 and cognitive complexity 70; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/stringdex.js"},"region":{"startLine":1947}}}],"partialFingerprints":{"codehealthFindingId/v1":"61b474e39fd45e7cc56f6e0a6f30458197d7528c0d359fb849b7ac2977f95de3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getDebugConfiguration (cyclomatic 20, cognitive 28): getDebugConfiguration has cyclomatic complexity 20 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/editors/code/src/debug.ts"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1d2d7724415becc3af505b8f12c672b63ce80c0207b0133d26deb0df56cd02d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createQueryElement (cyclomatic 20, cognitive 26): createQueryElement has cyclomatic complexity 20 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":810}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d2002e50bd78cdbe7750751df4a81201b3f064a396df5a6bf66beaa0e3cf9eb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function substringMatches (cyclomatic 19, cognitive 61): substringMatches has cyclomatic complexity 19 and cognitive complexity 61; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/stringdex.js"},"region":{"startLine":2447}}}],"partialFingerprints":{"codehealthFindingId/v1":"55c1b6e43d52f5bc91b3563f2d270af9c20dacd65f2738aca093a9b7ac442a79"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleShortcut (cyclomatic 19, cognitive 10): handleShortcut has cyclomatic complexity 19 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/main.js"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d06791f82ce8e94d70cb0cae91133f4a43a62a30e60be3c9c81b3688b107bf3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildHrefAndPath (cyclomatic 18, cognitive 21): buildHrefAndPath has cyclomatic complexity 18 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":2199}}}],"partialFingerprints":{"codehealthFindingId/v1":"adb0cec2c228816c5194e07f660b5f8a2ae1417266b1de2ecd764347ac73ab7b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function register_type_impls (cyclomatic 17, cognitive 35): register_type_impls has cyclomatic complexity 17 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/main.js"},"region":{"startLine":941}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e1d23444f6b9efedecea86bc333a9d636d843d6719cecaab8eaf75575338006"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function innerRunTypeQuery (cyclomatic 17, cognitive 35): innerRunTypeQuery has cyclomatic complexity 17 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":4228}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fb3247431731b2589bfaf49fcdb0111b3d001c9e7be19db0adf2811c3c881c4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseInput (cyclomatic 17, cognitive 30): parseInput has cyclomatic complexity 17 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":1442}}}],"partialFingerprints":{"codehealthFindingId/v1":"13bd58e391947ecf8394e13063bba6cc87080bcfd0d0a23487ecf20e5db3db43"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function decode (cyclomatic 17, cognitive 22): decode has cyclomatic complexity 17 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/stringdex.js"},"region":{"startLine":2597}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c388ad3ed5c5ea3968428a62fbfbda7408d13da90c9d3f82969239466284dbf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function calculate (cyclomatic 17, cognitive 19): calculate has cyclomatic complexity 17 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ecdf37bbae5377912aaaff370e94886825519f9e7b77f9b7d2947cc83c7c445"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function changeSetting (cyclomatic 17, cognitive 16): changeSetting has cyclomatic complexity 17 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/settings.js"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6d4a6f3e2d5f7ff0d892e1911e2d956d9c6aa17d741cf01f768972c20bf0313"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runSearch (cyclomatic 16, cognitive 26): runSearch has cyclomatic complexity 16 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustdoc-js/tester.js"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6809fda2a3e12372b7e1f32ed36827e82a7bae5bbb5cc89fb50f73e69080173"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 22): (anonymous) has cyclomatic complexity 16 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":5499}}}],"partialFingerprints":{"codehealthFindingId/v1":"000f40dd7597f580f66015f1053df399526ecbf0f49e6f991427c3e25a04a4f5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function showResults (cyclomatic 16, cognitive 19): showResults has cyclomatic complexity 16 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":5280}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7979e3774864c5ba948b7a82f0178d84a1f651d0d2ebd1e9076ebe2763ff0cf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function toggleCheckOnSave (cyclomatic 16, cognitive 15): toggleCheckOnSave has cyclomatic complexity 16 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/editors/code/src/config.ts"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"561d8ffc4ed95053025100fdefc8a7cad76cd68273fbf9b754dc41cc6432e342"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getServer (cyclomatic 15, cognitive 25): getServer has cyclomatic complexity 15 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/editors/code/src/bootstrap.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"67bfae70e26467ce9bc2863a1c11ac8730813f3c0f0c8598bf6b5ff261062a53"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 21): (anonymous) has cyclomatic complexity 15 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/editors/code/src/client.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"658eada4bd1ca1a0e35db7dd629c097aece9cd9b6dd9d81463af8a043b7181dc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadDatabase (cyclomatic 15, cognitive 13): loadDatabase has cyclomatic complexity 15 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/stringdex.js"},"region":{"startLine":1089}}}],"partialFingerprints":{"codehealthFindingId/v1":"df8e9788f13c01479a8bf65e8db44d433d8cc018a6e25174a38e137e6ee76037"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function writeSpecialPrimitive (cyclomatic 15, cognitive 12): writeSpecialPrimitive has cyclomatic complexity 15 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":2463}}}],"partialFingerprints":{"codehealthFindingId/v1":"dac8decfcc55828df7bb2d5dc72d357cafc286d7f2c39a1fec3dee887c4b04cd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function register_implementors (cyclomatic 14, cognitive 29): register_implementors has cyclomatic complexity 14 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/main.js"},"region":{"startLine":791}}}],"partialFingerprints":{"codehealthFindingId/v1":"febee056c99a7f0d92e0f0556e73943d21a3e4ea5d773f93eb0d8997774597fb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkPath (cyclomatic 14, cognitive 23): checkPath has cyclomatic complexity 14 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":3896}}}],"partialFingerprints":{"codehealthFindingId/v1":"6987d5798cba1a2c93a8de744d20d91622ab5f02da63adad19ff4a8eb9566320"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getTypeData (cyclomatic 14, cognitive 21): getTypeData has cyclomatic complexity 14 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":1814}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae184da145af09354819865b403062cdaf2fb64757a71cc247349c09ff541cb3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getEntryData (cyclomatic 14, cognitive 12): getEntryData has cyclomatic complexity 14 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":1656}}}],"partialFingerprints":{"codehealthFindingId/v1":"d87f94d0a9eea306219b38dc6543f42a0c5aa7dda4956d87861fa0a39fa827fd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function transition (cyclomatic 13, cognitive 20): transition has cyclomatic complexity 13 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/stringdex.js"},"region":{"startLine":4010}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3fce69fa56a1fc30f7c48f94677fa3bf9f5ec944e8ea803b8c4fef3170c657c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function substituteVariablesInEnv (cyclomatic 13, cognitive 20): substituteVariablesInEnv has cyclomatic complexity 13 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/editors/code/src/config.ts"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"d268d7d2d52106b5985814b4941f872b5b097a6725d0343fcf0118115fee1c23"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 16): (anonymous) has cyclomatic complexity 13 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":4450}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d70075f1e6017dc265d5f6f606019ce8860b393400989a174091a0f83d043fc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function addNextResultToOutput (cyclomatic 12, cognitive 23): addNextResultToOutput has cyclomatic complexity 12 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":5012}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aea4df70999652b07e58b4a2d996997af4a1ea052dd2e2c9a60e5f023ba18ce"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 19): (anonymous) has cyclomatic complexity 12 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/main.js"},"region":{"startLine":1056}}}],"partialFingerprints":{"codehealthFindingId/v1":"e934a0340a1db13814db37feb2b8d7b2e46af983127953520749a08cf3799491"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function addTab (cyclomatic 12, cognitive 17): addTab has cyclomatic complexity 12 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":4994}}}],"partialFingerprints":{"codehealthFindingId/v1":"7137114c2922bc00b890f43ad6cf821cbdbeb015b5639519252eef9e7332bec4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleRefOrPtr (cyclomatic 12, cognitive 11): handleRefOrPtr has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"d999807c5b3f6552c62371cc321459a2f42a207b2872bf01e393407b46a37940"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function doSearch (cyclomatic 11, cognitive 21): doSearch has cyclomatic complexity 11 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustdoc-js/tester.js"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d174535ffb8bd04abf733d79e95994f86616592e5f1f97a17ccc0c94c12ccb9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function switchTheme (cyclomatic 11, cognitive 16): switchTheme has cyclomatic complexity 11 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/storage.js"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"e80f5c441d97b68719955aee679c2b6c518b4c36555de662f73dcc2dffac2d36"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function addSidebarCrates (cyclomatic 11, cognitive 15): addSidebarCrates has cyclomatic complexity 11 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/main.js"},"region":{"startLine":1122}}}],"partialFingerprints":{"codehealthFindingId/v1":"ded25716d985f761e217b322c456a30f5b15dc24a8eabe758a6373973643e27b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function initSearch (cyclomatic 11, cognitive 11): initSearch has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"10908e89ce73c07bb621236c2bde9f424854d9ea16e0147b6378a311d693f386"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 11): (anonymous) has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":5219}}}],"partialFingerprints":{"codehealthFindingId/v1":"50f0a874952978142a8d99dfe2127d691532d94c1669b56c626fc0a039169fe1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseFlag (cyclomatic 11, cognitive 10): parseFlag has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/stringdex.js"},"region":{"startLine":1630}}}],"partialFingerprints":{"codehealthFindingId/v1":"963d58f2060e598037b84d93ee0371467ac92afb0c052b97e695db324b9ec5d7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 9): (anonymous) has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":4684}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bfd86e80d91f48cdc08df83a60f43a37f840524ad3dcae0c56f86fd8c9c1547"}},{"ruleId":"R3","level":"warning","message":{"text":"src/librustdoc/html/static/js/search.js: 5429 lines of code: src/librustdoc/html/static/js/search.js has 5429 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"08534f410796bd27b557fc3221dbea17e06384bc4514c3009c98d88f46a66cb5"}},{"ruleId":"R3","level":"warning","message":{"text":"src/librustdoc/html/static/js/stringdex.js: 4322 lines of code: src/librustdoc/html/static/js/stringdex.js has 4322 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/stringdex.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6525613233d20280cc09b16e47f38d56d9e3db74f230fb0ca80b40dc361c19db"}},{"ruleId":"R3","level":"warning","message":{"text":"src/librustdoc/html/static/js/main.js: 2127 lines of code: src/librustdoc/html/static/js/main.js has 2127 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e68a0696eb64a94d3035b0aae0771bb3965873ca80fa0b39e8c6ce0f5878dce"}},{"ruleId":"R3","level":"warning","message":{"text":"src/tools/rust-analyzer/editors/code/src/commands.ts: 1416 lines of code: src/tools/rust-analyzer/editors/code/src/commands.ts has 1416 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/editors/code/src/commands.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8c5de0af996aa9d7aafc26a0c5889872888d24153c94c2ff933f7a7d911c8ae"}},{"ruleId":"R3","level":"warning","message":{"text":"src/tools/rustdoc-js/tester.js: 619 lines of code: src/tools/rustdoc-js/tester.js has 619 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustdoc-js/tester.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"21c0f1b89bd6a29ed67d3e10ffedee1df87d95e21fa0e54a60838b7177114844"}},{"ruleId":"R3","level":"warning","message":{"text":"src/tools/rust-analyzer/editors/code/src/ctx.ts: 572 lines of code: src/tools/rust-analyzer/editors/code/src/ctx.ts has 572 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/editors/code/src/ctx.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7495cffe74a1f0a6b44bfa86aeacb70c3fba96d61349b878e1e480decf7eec32"}},{"ruleId":"R3","level":"warning","message":{"text":"src/tools/rust-analyzer/editors/code/src/config.ts: 546 lines of code: src/tools/rust-analyzer/editors/code/src/config.ts has 546 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/editors/code/src/config.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"87f0de6852aaa70facb757aae0776109735e2e3cd3d91c10c20532dc9aad15c6"}},{"ruleId":"R3","level":"warning","message":{"text":"src/librustdoc/html/static/js/storage.js: 409 lines of code: src/librustdoc/html/static/js/storage.js has 409 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/storage.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6617ecc6f270966c08a117fffc075b13369bca31c849ef9e5792570c5961aa9"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c98c83302b417e72171141163c1435005c470c876b6a681fe2c367bba1f9248"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/stringdex.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"69d5979c188fc79065bc37b227a25ef27fc7e4700bac996dddb185d0d5e020ae"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"69c3a881a4fc67bdf309a6bd02a6430af1e7248706ddfd35b8fe238e38dbe5bf"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustdoc-js/tester.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d80eb089ba306b0fae8413e4c4ec61dfde20c0ad808fd89866a1c164d639165c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/storage.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d94ab39bcd6bd4cff87d6203ba9e7516d88ccdcfb53d8ed963ece989e2259475"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/settings.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4d52d0fb4546771a622843036ab3ef102fc45d7cdd9d0d4839dbd4407291c47"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/src-script.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9faa31bbd4070211b2da683df648e787df9ca61272de1d27f367f735749219ad"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/scrape-examples.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b6d73396cccdd10cb1dd77eb081ccacaeb57552de6312a5410acf28b042680b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/error_index_generator/redirect.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c6c78ebcd90d4a9f8c78006d58965d141f2ca8bb28d4ccf58bdb3b98a686a77"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/error_index_generator/error-index.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1a415891b5e8fd6de5658a74f2e040de3a8f2cd17776ec28231d3085ee52c4c"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~12 LoC): no import path from any entry point (20 application, 6 tooling, 159 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/error_index_generator/redirect.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2de1a1dd6e6040c88d6b787fce9eefb05e4652f1ac2144cb861370b9860c6fcf"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~9 LoC): no import path from any entry point (20 application, 6 tooling, 159 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/error_index_generator/error-index.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff750d26ea5b127e220a8f3d26c8c5483fb4b1cbc62e93afdddc6e86f7a271fd"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027fetchDependencyGraph\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/editors/code/src/lsp_ext.ts"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2c939281e77db61f1d0da845724c9150b88f2fadc218d5a1a58ffff7fa0eb0d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027unwrapNullable\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/editors/code/src/util.ts"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4d929c25c9ca22a344e43e97ddb271a1d8fe5c104990569e3d4304dad30d173"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027lodash\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/editors/code/src/config.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a144ce7573bd7c349df2b3f2ff613d1d3b6f0cf5af783d40e56d5be1e7982ce"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027browser-ui-test\u0027: Declared in the root package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"fd20f1938a56289ea8aec1afc9963b05b78cb8be808cf0287d753c91a3444e47"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027es-check\u0027: Declared in the root package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ec8a742f5550488e6452c3af0cb0f2820cf5f5166f150c7856178a90d9bdbc09"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@hpcc-js/wasm\u0027: Declared in src/tools/rust-analyzer/editors/code/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"4bd21e15fcb162910ed81406b8fc57a70339074eaf635a0df17b0db06274afab"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027d3\u0027: Declared in src/tools/rust-analyzer/editors/code/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"52810b1726ab092cf1266738f3092e03217feee8e959388bade7fc5b05f48e11"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027d3-graphviz\u0027: Declared in src/tools/rust-analyzer/editors/code/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"a039d2c03d4786c24081de4d6f636425ad430f97a79680835256c665fb2812dc"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027ovsx\u0027: Declared in src/tools/rust-analyzer/editors/code/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"94f2bfb1ab39190e7bc29c506f807beee5c2976947e314addbd16eec7f3d1524"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027tslib\u0027: Declared in src/tools/rust-analyzer/editors/code/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d8a3d0faa47fd18b071ac2ea263bb7395790d201b593acc4743b98814298e27d"}},{"ruleId":"R9","level":"error","message":{"text":"Import cycle (2 files): src/tools/rust-analyzer/editors/code/src/debug.ts \u2192 src/tools/rust-analyzer/editors/code/src/run.ts \u2192 src/tools/rust-analyzer/editors/code/src/debug.ts"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/editors/code/src/debug.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"53889580ec9b40467680f7ffdfeaef8443c7ecfe8edf1a397a6438dc7b55521f"}},{"ruleId":"S1","level":"warning","message":{"text":"Weak hash algorithm: MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything \u2014 a signature, an integrity or tamper check, a credential, or any value an attacker can influence \u2014 that is a real weakness: use SHA-256\u002B (\u0060sha2::Sha256::digest(\u2026)\u0060) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead \u2014 a non-cryptographic hash such as xxhash or murmurhash says it in code \u2014 since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_span/src/lib.rs"},"region":{"startLine":1825}}}],"partialFingerprints":{"codehealthFindingId/v1":"55ea44c456fd04d6c71db8df25ccbcbbfe0ab4569feb4b4eb274f3916a19bba5"}},{"ruleId":"S1","level":"warning","message":{"text":"Weak hash algorithm: MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything \u2014 a signature, an integrity or tamper check, a credential, or any value an attacker can influence \u2014 that is a real weakness: use SHA-256\u002B (\u0060sha2::Sha256::digest(\u2026)\u0060) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead \u2014 a non-cryptographic hash such as xxhash or murmurhash says it in code \u2014 since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_span/src/lib.rs"},"region":{"startLine":1828}}}],"partialFingerprints":{"codehealthFindingId/v1":"2617f83718d3a0dbfa39f4cfeec98da4355b72fdaa31a313aaa0b19f40d0bead"}},{"ruleId":"S1","level":"warning","message":{"text":"Weak hash algorithm: MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything \u2014 a signature, an integrity or tamper check, a credential, or any value an attacker can influence \u2014 that is a real weakness: use SHA-256\u002B (\u0060sha2::Sha256::digest(\u2026)\u0060) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead \u2014 a non-cryptographic hash such as xxhash or murmurhash says it in code \u2014 since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_span/src/lib.rs"},"region":{"startLine":1880}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d0fef7f241866b65a81fd4ce2e701d1cf5fe890887ce63e4f585de4094d7305"}},{"ruleId":"S1","level":"warning","message":{"text":"Weak hash algorithm: MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything \u2014 a signature, an integrity or tamper check, a credential, or any value an attacker can influence \u2014 that is a real weakness: use SHA-256\u002B (\u0060sha2::Sha256::digest(\u2026)\u0060) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead \u2014 a non-cryptographic hash such as xxhash or murmurhash says it in code \u2014 since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_span/src/lib.rs"},"region":{"startLine":1892}}}],"partialFingerprints":{"codehealthFindingId/v1":"d93327e27db491c8ae88fc27e0d2ddc0cfffb59efb16edac879bb70a1c128aef"}},{"ruleId":"S1","level":"warning","message":{"text":"Weak hash algorithm: MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything \u2014 a signature, an integrity or tamper check, a credential, or any value an attacker can influence \u2014 that is a real weakness: use SHA-256\u002B (\u0060sha2::Sha256::digest(\u2026)\u0060) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead \u2014 a non-cryptographic hash such as xxhash or murmurhash says it in code \u2014 since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/coverage-dump/src/llvm_utils.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"268a42706c3975cbbd9bff199c5fe08c156c329ab8f5a11209a20f43a7224d70"}},{"ruleId":"S1","level":"warning","message":{"text":"Third-party script without Subresource Integrity: \u0060https://cdn.jsdelivr.net/npm/mermaid/dist/mermaid.min.js\u0060 is executed by this page with no Subresource Integrity. Whoever can answer that request \u2014 the CDN, anyone who compromises it, anyone on the network path \u2014 runs arbitrary script in this page\u0027s origin, with its session. The URL also names no version, so it resolves to whatever that origin serves at fetch time \u2014 the executed bytes can change with nobody touching this repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/polonius/dump/polonius-mir-dump.template.html"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"c302d155fdc078da475490872a59d9d1e6a1fc3f4395ed1f6e2506f515bcceaa"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ev.ctrlKey || ev.altKey || ev.metaKey || disableShortcuts\u0060 appears character-identically in 2 files \u2014 src/librustdoc/html/static/js/main.js, src/tools/clippy/util/gh-pages/script.js. 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/librustdoc/html/static/js/main.js"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4aae66848ac1cb7f33e0554f469ba5a877819ac5ba3f49a7c4637815f37aa5a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060menu.contains(document.activeElement) || menu.contains(event.relatedTarget)\u0060 appears character-identically in 2 files \u2014 src/librustdoc/html/static/js/main.js, src/librustdoc/html/static/js/settings.js. 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/librustdoc/html/static/js/main.js"},"region":{"startLine":1632}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e3f17051e9db68e8466ac26bcd5ce17a5ec68cdd56eafd558880811859fb5db"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060child_types_ok == Result.Mismatch and all_providers_ok\u0060 appears character-identically in 2 files \u2014 src/etc/debugger_tester/gdb/check_gdb.py, src/etc/debugger_tester/lldb/check_lldb.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/etc/debugger_tester/gdb/check_gdb.py"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ab6355f43162365d2bfa5977882f8d06202dfee72582b01c2582f3c7328c33d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060fields[0].name == ENUM_DISR_FIELD_NAME or fields[0].name == ENUM_LLDB_ENCODED_VARIANTS\u0060 appears character-identically in 2 files \u2014 src/etc/lldb_lookup.py, src/etc/rust_types.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/etc/lldb_lookup.py"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f77db1c1b6d0319d355a2bf660a9fbbec0853371f510b2e64ca5258ab4633c7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060got.name != exp.name or got.type != exp.type or got.value != exp.value\u0060 appears character-identically in 2 files \u2014 src/etc/debugger_tester/gdb/check_gdb.py, src/etc/debugger_tester/lldb/check_lldb.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/etc/debugger_tester/gdb/check_gdb.py"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"910f0bc858b7e607f6a123a5dc956109f613938f73372d77cc326d5138f69cfe"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not children_ok and var.synthetic is not None\u0060 appears character-identically in 2 files \u2014 src/etc/debugger_tester/gdb/check_gdb.py, src/etc/debugger_tester/lldb/check_lldb.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/etc/debugger_tester/gdb/check_gdb.py"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d7f5716e971c0c056cd9938ef3be81b7f15db8ca7f45359820673cb37919b19"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060type_match_ok == Result.Mismatch and all_providers_ok\u0060 appears character-identically in 2 files \u2014 src/etc/debugger_tester/gdb/check_gdb.py, src/etc/debugger_tester/lldb/check_lldb.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/etc/debugger_tester/gdb/check_gdb.py"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed2453763a584b12f25b287de8f66fba4fcab37c5f95371c485b4c5a1a85296a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060type_ok and type_match_ok and pretty_type_name_ok and pretty_print_ok and value_ok and synthetic_ok and summary_ok and format_ok and childre\u2026\u0060 appears character-identically in 2 files \u2014 src/etc/debugger_tester/gdb/check_gdb.py, src/etc/debugger_tester/lldb/check_lldb.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/etc/debugger_tester/gdb/check_gdb.py"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"dda37530f2149780a69af6f29c8b4869a270d3c2ad1164a67931e8ceee06b80c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060var.has_visualizer() or expected.has_visualizer()\u0060 appears character-identically in 2 files \u2014 src/etc/debugger_tester/gdb/check_gdb.py, src/etc/debugger_tester/lldb/check_lldb.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/etc/debugger_tester/gdb/check_gdb.py"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3d9e8fa374e887a4cb6e072c2bffad7e93221ebfa9db10a2dfbcb284ac45244"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!attrs.first().unwrap().is_doc_comment() \u0026\u0026 context.config.inline_attribute_width() \u003E= line_len\u0060 appears character-identically in 2 files \u2014 src/tools/rustfmt/src/imports.rs, src/tools/rustfmt/src/items.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/tools/rustfmt/src/imports.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b1e0ba3f2b30e52250553eca5a441336e327333febb73485b6518b7b9c7f63a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!fn_abi.ret.is_ignore() \u0026\u0026 fn_abi.ret.layout.is_sized()\u0060 appears character-identically in 2 files \u2014 compiler/rustc_target/src/callconv/mips64.rs, compiler/rustc_target/src/callconv/sparc64.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":"compiler/rustc_target/src/callconv/mips64.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"b45e35f310b2550815e25f80f6fef5c06c733dad604ccd515967a98ad4191db1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!is_ret \u0026\u0026 arg.layout.pass_indirectly_in_non_rustic_abis(cx)\u0060 appears character-identically in 2 files \u2014 compiler/rustc_target/src/callconv/powerpc64.rs, compiler/rustc_target/src/callconv/xtensa.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":"compiler/rustc_target/src/callconv/powerpc64.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"8972d471230c2587c63ee628ce11bc53c32810ed00df46f25837b4b101b3775b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!lhs_ty.is_ty_var() \u0026\u0026 !rhs_ty.is_ty_var() \u0026\u0026 is_builtin_binop(lhs_ty, rhs_ty, category)\u0060 appears character-identically in 2 files \u2014 compiler/rustc_hir_typeck/src/op.rs, src/tools/rust-analyzer/crates/hir-ty/src/infer/op.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":"compiler/rustc_hir_typeck/src/op.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ca88f70e820062a24b4d4665980b03fcfe925c21a644d70ee8198a96e7d355a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!out_value.has_infer() \u0026\u0026 !out_value.has_placeholders()\u0060 appears character-identically in 2 files \u2014 compiler/rustc_infer/src/infer/canonical/canonicalizer.rs, src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/canonical/canonicalizer.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":"compiler/rustc_infer/src/infer/canonical/canonicalizer.rs"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0b46cbd0fb2bc7b64b70bd46af72c78d16872d776f02f13724d7d118e501183"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!self.cx().renormalize_rigid_aliases() \u0026\u0026 !ct.has_non_rigid_aliases()\u0060 appears character-identically in 2 files \u2014 compiler/rustc_next_trait_solver/src/normalize.rs, compiler/rustc_trait_selection/src/solve/normalize.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":"compiler/rustc_next_trait_solver/src/normalize.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"0db825f4a8112a6447034cc9dca5315db4cb1a727292e9c105cfc7d946f23ba2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!self.cx().renormalize_rigid_aliases() \u0026\u0026 !ty.has_non_rigid_aliases()\u0060 appears character-identically in 2 files \u2014 compiler/rustc_next_trait_solver/src/normalize.rs, compiler/rustc_trait_selection/src/solve/normalize.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":"compiler/rustc_next_trait_solver/src/normalize.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8ae5894eff9259c306018daee149d61a3e280aafc2fabbdeb6d3b428b4146c3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!self.cx().renormalize_rigid_aliases() \u0026\u0026 orig_is_rigid == ty::IsRigid::Yes\u0060 appears character-identically in 2 files \u2014 compiler/rustc_next_trait_solver/src/normalize.rs, compiler/rustc_trait_selection/src/solve/normalize.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":"compiler/rustc_next_trait_solver/src/normalize.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"082f66b22dae235904d807fd900b55b94c214649882212f11aca1feff3b1eda7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!self.is_empty() || self.is_disconnected()\u0060 appears character-identically in 2 files \u2014 library/std/src/sync/mpmc/array.rs, library/std/src/sync/mpmc/list.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":"library/std/src/sync/mpmc/array.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b896074f0af7a082d0ab69915971fdd2d7cf840564f78de98456eeac25c7feb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!self.tcx.features().return_type_notation() \u0026\u0026 self.tcx.sess.is_nightly_build()\u0060 appears character-identically in 2 files \u2014 compiler/rustc_ast_lowering/src/lib.rs, compiler/rustc_ast_lowering/src/path.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":"compiler/rustc_ast_lowering/src/lib.rs"},"region":{"startLine":1269}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cafe02b375c71d4f6f1e6c96871a2b49f03580207f59cc02d4fc01d31ff56e5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!trait_ref.skip_binder().args.has_infer() \u0026\u0026 !trait_ref.skip_binder().args.has_placeholders()\u0060 appears character-identically in 2 files \u2014 compiler/rustc_hir_typeck/src/method/probe.rs, src/tools/rust-analyzer/crates/hir-ty/src/method_resolution/probe.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":"compiler/rustc_hir_typeck/src/method/probe.rs"},"region":{"startLine":2738}}}],"partialFingerprints":{"codehealthFindingId/v1":"e43e88a5735b12ad5288f99d8464e046eb9f66dd4d2a37ed137dbae9202171e8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060$imm == 4 || $imm == 8 || $imm == 9 || $imm == 10 || $imm == 11\u0060 appears character-identically in 2 files \u2014 library/stdarch/crates/core_arch/src/x86/macros.rs, library/stdarch/crates/core_arch/src/x86_64/macros.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":"library/stdarch/crates/core_arch/src/x86/macros.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"db7d602db8c387a2627afedd43088b245d6decce180a5f6b0eae85765cee391e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060F32(f32_consts::E) == value || F64(f64_consts::E) == value\u0060 appears character-identically in 2 files \u2014 src/tools/clippy/clippy_lints/src/floating_point_arithmetic/log_base.rs, src/tools/clippy/clippy_lints/src/floating_point_arithmetic/powf.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/tools/clippy/clippy_lints/src/floating_point_arithmetic/log_base.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e3978981d3e641f5733f54fac45feb3cba59180e5269f0ad50583c176ca4a59"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060a.skip_binder().has_escaping_bound_vars() || b.skip_binder().has_escaping_bound_vars()\u0060 appears character-identically in 2 files \u2014 compiler/rustc_infer/src/infer/relate/lattice.rs, src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/relate/lattice.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":"compiler/rustc_infer/src/infer/relate/lattice.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"aec7d740b528671e369112abb19795a80c98ada36a686d8b2b814a6b94b6092e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060arg.is_ignore() || !arg.layout.is_sized()\u0060 appears character-identically in 4 files \u2014 compiler/rustc_target/src/callconv/mips64.rs, compiler/rustc_target/src/callconv/powerpc64.rs, compiler/rustc_target/src/callconv/x86.rs, compiler/rustc_target/src/callconv/x86_win32.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":"compiler/rustc_target/src/callconv/mips64.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"847809e0cf02a8ffc3b179bb5400f0a0e1c133a55c4db14603ca3cbe644b8828"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060arg_ty.is_ref() \u0026\u0026 !drop_is_single_call_in_arm\u0060 appears character-identically in 2 files \u2014 compiler/rustc_lint/src/drop_forget_useless.rs, src/tools/clippy/clippy_lints/src/drop_forget_ref.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":"compiler/rustc_lint/src/drop_forget_useless.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a3a84f165c029853dfc997729c3a495ce98009ea8abf0afebce2c171210fc5d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060arms \u0026\u0026 first_arm.guard.is_none() \u0026\u0026 second_arm.guard.is_none()\u0060 appears character-identically in 2 files \u2014 src/tools/clippy/clippy_lints/src/matches/manual_filter.rs, src/tools/clippy/clippy_lints/src/option_if_let_else.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/tools/clippy/clippy_lints/src/matches/manual_filter.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bc4d93f98a933a3824ff0006c6ae2900cc217b10bd8140528d5e3af8ca882f6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060builder.config.allocator(target) == Allocator::Jemalloc \u0026\u0026 env::var_os(\u0022JEMALLOC_SYS_WITH_LG_PAGE\u0022).is_none()\u0060 appears character-identically in 2 files \u2014 src/bootstrap/src/core/build_steps/compile.rs, src/bootstrap/src/core/build_steps/tool.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/bootstrap/src/core/build_steps/compile.rs"},"region":{"startLine":1413}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d1b3e0ae67cb1981f1f2ce4048b76421d7b671cbcaa5a8270c847fe675a56a6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060builder.config.llvm_enabled(target_compiler.host) \u0026\u0026 builder.config.llvm_tools_enabled\u0060 appears character-identically in 2 files \u2014 src/bootstrap/src/core/build_steps/compile.rs, src/bootstrap/src/core/build_steps/dist.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/bootstrap/src/core/build_steps/compile.rs"},"region":{"startLine":2516}}}],"partialFingerprints":{"codehealthFindingId/v1":"c03177f9a6752aca6069d6590ac8608c95643b723dcb8f4efd2baad21b09f27f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060builder.config.rpath_enabled(target) \u0026\u0026 helpers::use_host_linker(target)\u0060 appears character-identically in 2 files \u2014 src/bootstrap/src/core/build_steps/llvm.rs, src/bootstrap/src/core/builder/cargo.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/bootstrap/src/core/build_steps/llvm.rs"},"region":{"startLine":1179}}}],"partialFingerprints":{"codehealthFindingId/v1":"11a8dc581b90e72a31f0577bf4e33b4e8137b431cc7d8fc92919fd3e8d17945e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060byte_offset \u003C= (isize::MAX as usize) \u0026\u0026 !overflow\u0060 appears character-identically in 2 files \u2014 library/core/src/ptr/const_ptr.rs, library/core/src/ptr/mut_ptr.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":"library/core/src/ptr/const_ptr.rs"},"region":{"startLine":862}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8c9e27663668756683122632d298fc577f3f3c3ef407de2a54d433884157d24"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060byte_offset \u003C= (isize::MAX as usize) \u0026\u0026 this.addr() \u003E= byte_offset\u0060 appears character-identically in 2 files \u2014 library/core/src/ptr/const_ptr.rs, library/core/src/ptr/mut_ptr.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":"library/core/src/ptr/const_ptr.rs"},"region":{"startLine":943}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2ca19e2a6216cf52fa9dcb727bcdd27adf15d1e6da5b7b7d51e9900b1fd5c3b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060c1.has_non_region_infer() || c2.has_non_region_infer()\u0060 appears character-identically in 2 files \u2014 compiler/rustc_trait_selection/src/traits/fulfill.rs, compiler/rustc_trait_selection/src/traits/select/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":"compiler/rustc_trait_selection/src/traits/fulfill.rs"},"region":{"startLine":825}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dd4d3da01ff147d8b7c24b8f5d752b1458f46e684d0b03b5b56216ea6b2fc39"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060char_range.len() == 1 \u0026\u0026 char_range.start == prev_end\u0060 appears character-identically in 2 files \u2014 src/tools/rust-analyzer/crates/hir-expand/src/attrs.rs, src/tools/rust-analyzer/crates/syntax/src/ast/token_ext.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-expand/src/attrs.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"90e724d972c356f11b774aaa4fe1adbb1c4c61ba6ed7c34767bb3f31d8146c6e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060codegen_attrs.flags.contains(CodegenFnAttrFlags::USED_COMPILER) || codegen_attrs.flags.contains(CodegenFnAttrFlags::USED_LINKER)\u0060 appears character-identically in 2 files \u2014 compiler/rustc_codegen_ssa/src/back/symbol_export.rs, src/tools/miri/src/helpers.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/back/symbol_export.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd75a3cc6386ab6ac0b5a4d6424f68c9708570da9d30e31e4f2e6c8efedb0b98"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060config.emit_bc || config.emit_obj == EmitObj::Bitcode\u0060 appears character-identically in 2 files \u2014 compiler/rustc_codegen_gcc/src/back/write.rs, compiler/rustc_codegen_llvm/src/back/write.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":"compiler/rustc_codegen_gcc/src/back/write.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff767a79990d454be797c3f961277a0824e2c16a0cc0574ed9f79fcdb13f95e8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060contains_exterior_struct_lit(lhs) || contains_exterior_struct_lit(rhs)\u0060 appears character-identically in 2 files \u2014 compiler/rustc_ast/src/util/parser.rs, compiler/rustc_hir_pretty/src/lib.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":"compiler/rustc_ast/src/util/parser.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"befc0072f3e3d2d545f95615d3f2e17b21c654845dacabf65aa96cb129a2e19e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060context.config.style_edition() \u003C= StyleEdition::Edition2021 || context.config.indent_style() == IndentStyle::Visual\u0060 appears character-identically in 2 files \u2014 src/tools/rustfmt/src/items.rs, src/tools/rustfmt/src/types.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/tools/rustfmt/src/items.rs"},"region":{"startLine":2225}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a052a923978270efac079f1e78810e28f082f67edd86d31e52fd463348f675c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060coroutine_marker \u0026\u0026 coroutine_marker.kind.is_gen()\u0060 appears character-identically in 2 files \u2014 compiler/rustc_parse/src/parser/expr.rs, compiler/rustc_parse/src/parser/function.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":"compiler/rustc_parse/src/parser/expr.rs"},"region":{"startLine":2209}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdd979444f281d14ee466a0d38971f32b2c05f1318e4117453dd5471e2ae09f3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ctx.mir_opt_level() \u003E= 2 \u0026\u0026 ctx.opts.unstable_opts.mir_move_elimination\u0060 appears character-identically in 2 files \u2014 compiler/rustc_mir_transform/src/move_elimination.rs, compiler/rustc_mir_transform/src/tail_copy_to_move.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":"compiler/rustc_mir_transform/src/move_elimination.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"819e4eeace5331bc7f89a1f27bc73be860b90b90b56f2a8c093925eff5b6192c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060cx.tcx.is_codegened_item(instance_def_id) \u0026\u0026 (!instance_def_id.is_local() || !cx.tcx.is_reachable_non_generic(instance_def_id))\u0060 appears character-identically in 2 files \u2014 compiler/rustc_codegen_gcc/src/callee.rs, compiler/rustc_codegen_llvm/src/callee.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":"compiler/rustc_codegen_gcc/src/callee.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c8150025925c4ada6bb4967f3f0fb76ece4569447775ee86e4fc7666efbe56b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060cx.tcx.is_unreachable_local_definition(instance_def_id) || !cx.tcx.local_crate_exports_generics()\u0060 appears character-identically in 2 files \u2014 compiler/rustc_codegen_gcc/src/callee.rs, compiler/rustc_codegen_llvm/src/callee.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":"compiler/rustc_codegen_gcc/src/callee.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"23d3b83e8943ca1b6cc7722b4619722e7b6c660900822f0c5fa3d1ba02a21edd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060data_a.principal_def_id() == b_principal_def_id || b_principal_def_id.is_none()\u0060 appears character-identically in 2 files \u2014 compiler/rustc_codegen_cranelift/src/unsize.rs, compiler/rustc_codegen_ssa/src/base.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":"compiler/rustc_codegen_cranelift/src/unsize.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"39a4b534d3b37d948d3063de78de076d8413afffb556e0c57d4eab02162fa7fe"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060def.is_unsafe_cell() || def.is_unsafe_pinned()\u0060 appears character-identically in 2 files \u2014 compiler/rustc_lint/src/types.rs, compiler/rustc_ty_utils/src/layout.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":"compiler/rustc_lint/src/types.rs"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"be11b6087f36f8f2911cd3c61e2e0c5ab5753b7cab57afc17feb840b72f5cf41"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060def_id.is_local() \u0026\u0026 !self.tcx.is_foreign_item(def_id)\u0060 appears character-identically in 2 files \u2014 compiler/rustc_codegen_gcc/src/consts.rs, compiler/rustc_codegen_llvm/src/consts.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":"compiler/rustc_codegen_gcc/src/consts.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6b60412bd88e89c834369e1bf5f36f3f5a1f2a57b204591a28d6355ed8e3446"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060dur.as_secs() == 0 \u0026\u0026 dur.subsec_nanos() == 0\u0060 appears character-identically in 3 files \u2014 library/std/src/sys/net/connection/socket/hermit.rs, library/std/src/sys/net/connection/socket/solid.rs, library/std/src/sys/net/connection/socket/unix.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":"library/std/src/sys/net/connection/socket/hermit.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fb95067d2bf03b20eec7b33a3a95498ba7ba9daab3eb11679db9baabd7f32de"}},{"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/tools/miri/src/shims/unix/fd.rs, src/tools/miri/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/tools/miri/src/shims/unix/fd.rs"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6949e5e10b0edca5aaf43c81eff524004fe2f65fc5e79778d97778a473f0a95"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ex == ey || (ex \u002B 1 == ey \u0026\u0026 (2.0 * x \u003E y || (2.0 * x == y \u0026\u0026 (q % 2) != 0)))\u0060 appears character-identically in 2 files \u2014 library/compiler-builtins/libm/src/math/remquo.rs, library/compiler-builtins/libm/src/math/remquof.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":"library/compiler-builtins/libm/src/math/remquo.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dd11e4466df3c09b91824b88c109374f396524dfd8f6b4ad5ed8db4cf2ab391"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060expected.kind() \u0026\u0026 self.should_peel_ref(peel_kind, expected)\u0060 appears character-identically in 2 files \u2014 compiler/rustc_hir_typeck/src/pat.rs, src/tools/rust-analyzer/crates/hir-ty/src/infer/pat.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":"compiler/rustc_hir_typeck/src/pat.rs"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"327d6df1218f8ad21861bd9fec3829b613d70c99b98d0ace81f4bf1e260d1426"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060explicit_params.get(idx \u002B 1) \u0026\u0026 end != Some(next.def_id)\u0060 appears character-identically in 2 files \u2014 src/tools/clippy/clippy_lints/src/extra_unused_type_parameters.rs, src/tools/clippy/clippy_lints/src/lifetimes.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/tools/clippy/clippy_lints/src/extra_unused_type_parameters.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"db141c94a8c434abfc9eae1bc97ffb688364d1db55f33d96430e5e6f1ec2c97f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060expr.kind \u0026\u0026 !expr.span.from_expansion()\u0060 appears character-identically in 2 files \u2014 src/tools/clippy/clippy_lints/src/len_zero.rs, src/tools/clippy/clippy_lints/src/single_range_in_vec_init.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/tools/clippy/clippy_lints/src/len_zero.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"48de52fb6b9c333fbae0317abad4f04f4e23c6f17d4784fa2b7a5f0b9fa19886"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060expr.kind \u0026\u0026 self_arg.res_local_id() == Some(searcher.local_id) \u0026\u0026 name.ident.name == sym::push\u0060 appears character-identically in 2 files \u2014 src/tools/clippy/clippy_lints/src/pathbuf_init_then_push.rs, src/tools/clippy/clippy_lints/src/vec_init_then_push.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/tools/clippy/clippy_lints/src/pathbuf_init_then_push.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"b58bb832af73e1db920503d69974491ef0c4d90a82d364dabecb58db746e1451"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060f.precision().is_none() \u0026\u0026 f.width().is_none()\u0060 appears character-identically in 2 files \u2014 library/core/src/net/ip_addr.rs, library/core/src/net/socket_addr.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":"library/core/src/net/ip_addr.rs"},"region":{"startLine":2176}}}],"partialFingerprints":{"codehealthFindingId/v1":"28147415f4f98e7efb942bc397434b50c40533dcd40205dca80bdcfca56cacca"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060field.ty.kind.is_simple_path() \u0026\u0026 !seen_type_names.insert(name)\u0060 appears character-identically in 2 files \u2014 compiler/rustc_builtin_macros/src/deriving/clone.rs, compiler/rustc_builtin_macros/src/deriving/eq.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":"compiler/rustc_builtin_macros/src/deriving/clone.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f355832c501c2b1965dd207898acd09033548bcf926aa082633fc0a1a46bfa5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060field_tys.len() \u003C= 3 \u0026\u0026 field_tys.iter().all(Self::is_trivially_pure_clone_copy)\u0060 appears character-identically in 2 files \u2014 compiler/rustc_middle/src/ty/sty.rs, src/tools/rust-analyzer/crates/hir-ty/src/next_solver/ty.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":"compiler/rustc_middle/src/ty/sty.rs"},"region":{"startLine":2031}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc53f89dfc7599da925cbd55bf12945a58fb8d7345877170b6a701ad78f4cc87"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060func.syntax().descendants().find_map(ast::MacroCall::cast) \u0026\u0026 m.syntax().text() == \u0022todo!()\u0022\u0060 appears character-identically in 2 files \u2014 src/tools/rust-analyzer/crates/ide-assists/src/handlers/add_missing_impl_members.rs, src/tools/rust-analyzer/crates/ide-assists/src/handlers/replace_derive_with_manual_impl.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/tools/rust-analyzer/crates/ide-assists/src/handlers/add_missing_impl_members.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd77fc7ac429e42cb9f0ae2a6df5b58de61e9fb5eab42dade9664cf73e9f9316"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060goal.goal().predicate.as_projection_clause() \u0026\u0026 !projection_clause.bound_vars().is_empty()\u0060 appears character-identically in 2 files \u2014 compiler/rustc_trait_selection/src/solve/fulfill/derive_errors.rs, src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/errors.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":"compiler/rustc_trait_selection/src/solve/fulfill/derive_errors.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b9a0fe9a4ce7f5f040dd00e4f80c18913870b2a26917c1c9303ff9411958361"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060goal.unique_applicable_candidate() \u0026\u0026 cand.shallow_certainty() == Certainty::Yes\u0060 appears character-identically in 2 files \u2014 compiler/rustc_hir_typeck/src/coercion.rs, src/tools/rust-analyzer/crates/hir-ty/src/infer/coerce.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":"compiler/rustc_hir_typeck/src/coercion.rs"},"region":{"startLine":2268}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e52e932a5bb5d293504baf5722413bc36a3fa9322edf6b78c216213771290d0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060header.abi != ExternAbi::Rust || requires_exact_signature(attrs)\u0060 appears character-identically in 2 files \u2014 src/tools/clippy/clippy_lints/src/needless_pass_by_ref_mut.rs, src/tools/clippy/clippy_lints/src/needless_pass_by_value.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/tools/clippy/clippy_lints/src/needless_pass_by_ref_mut.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"85a524604a0c81140863d63175f798da531629c92c98a04987ee6fb29b22869a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060i \u002B 1 == template.len() \u0026\u0026 bytecode.is_empty()\u0060 appears character-identically in 2 files \u2014 compiler/rustc_ast_lowering/src/format.rs, src/tools/rust-analyzer/crates/hir-def/src/expr_store/lower/format_args.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":"compiler/rustc_ast_lowering/src/format.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"46921e3f30c7862cc1deb9058953611052c393301df0aaad740aa4dfa80c6c6c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060imp.polarity != ty::ImplPolarity::Positive || !self.tcx.is_user_visible_dep(def_id.krate)\u0060 appears character-identically in 2 files \u2014 compiler/rustc_trait_selection/src/error_reporting/traits/ambiguity.rs, compiler/rustc_trait_selection/src/error_reporting/traits/fulfillment_errors.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":"compiler/rustc_trait_selection/src/error_reporting/traits/ambiguity.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8a516abd5f5271682fff6b4d1d5f1c72dbfab8052dd2dea95b64c7a35f1eefa"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060instance.upstream_monomorphization(tcx).is_none() \u0026\u0026 !cx.tcx.local_crate_exports_generics()\u0060 appears character-identically in 2 files \u2014 compiler/rustc_codegen_gcc/src/callee.rs, compiler/rustc_codegen_llvm/src/callee.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":"compiler/rustc_codegen_gcc/src/callee.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"985584520157d4f5cae539f3a38933256200d91d243627901408a2d4155601ed"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060kind == ErrorKind::WouldBlock || kind == ErrorKind::TimedOut\u0060 appears character-identically in 3 files \u2014 library/std/src/net/tcp/tests.rs, library/std/src/net/udp/tests.rs, library/std/src/os/unix/net/tests.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":"library/std/src/net/tcp/tests.rs"},"region":{"startLine":788}}}],"partialFingerprints":{"codehealthFindingId/v1":"0830ebef27967b188b8ad0da94d67185cab1960e2b052e7f4766c0b06dbca41c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060kind_ty.to_opt_closure_kind() \u0026\u0026 !args.tupled_upvars_ty().is_ty_var()\u0060 appears character-identically in 2 files \u2014 compiler/rustc_next_trait_solver/src/solve/assembly/structural_traits.rs, compiler/rustc_trait_selection/src/traits/project.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":"compiler/rustc_next_trait_solver/src/solve/assembly/structural_traits.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"c30591bb32e6b30cb29edb1cb8d28952449cc68cf55a7bdea607ae252f86ffeb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060layout.align() \u003C= MIN_ALIGN \u0026\u0026 layout.align() \u003C= layout.size()\u0060 appears character-identically in 2 files \u2014 library/std/src/sys/alloc/solid.rs, library/std/src/sys/alloc/unix.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":"library/std/src/sys/alloc/solid.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4daf4c4e9b0353c5ad77784bd432aaa20394d5651b194e0fa23808a6c588731"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060layout.align() \u003C= MIN_ALIGN \u0026\u0026 layout.align() \u003C= new_size\u0060 appears character-identically in 2 files \u2014 library/std/src/sys/alloc/solid.rs, library/std/src/sys/alloc/unix.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":"library/std/src/sys/alloc/solid.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"551daba18c7088fc9221e61de588f07d75b7b6cca0e99688c0bfcf10eae651e7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060lhs_ty.references_error() || rhs_ty.references_error()\u0060 appears character-identically in 3 files \u2014 compiler/rustc_hir_typeck/src/expr.rs, compiler/rustc_hir_typeck/src/fn_ctxt/adjust_fulfillment_errors.rs, compiler/rustc_hir_typeck/src/op.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":"compiler/rustc_hir_typeck/src/expr.rs"},"region":{"startLine":1424}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b695f981e6d28a54d5550421ab7aac00879df3ef7875246ec0abc179a8a831d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060lines_since_mismatch \u003E= context_size \u0026\u0026 lines_since_mismatch \u003E 0\u0060 appears character-identically in 2 files \u2014 src/tools/compiletest/src/runtest/compute_diff.rs, src/tools/rustfmt/src/rustfmt_diff.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/tools/compiletest/src/runtest/compute_diff.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"a061fa1860c78f2ebc7dd77d0ed02d7e24240f2d5a07c6d073ae96cb1293b561"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060linkage != Linkage::Internal \u0026\u0026 self.tcx.is_compiler_builtins(LOCAL_CRATE)\u0060 appears character-identically in 2 files \u2014 compiler/rustc_codegen_gcc/src/mono_item.rs, compiler/rustc_codegen_llvm/src/mono_item.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":"compiler/rustc_codegen_gcc/src/mono_item.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"d006391af342a75f23686a8097f63e15862ae140bbcd29fc69ac6d8700491119"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060mode == Mode::Byte || mode == Mode::ByteStr\u0060 appears character-identically in 2 files \u2014 compiler/rustc_parse/src/lexer/unescape_error_reporting.rs, src/tools/rust-analyzer/crates/parser/src/lexed_str.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":"compiler/rustc_parse/src/lexer/unescape_error_reporting.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"69af2ff27688fd87aeecf9e18cd2e233cb71ea50f0daf4a7f8ef4ed39be9fee7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060more_leading_zeros == MoreLeadingZeros::Equal \u0026\u0026 lza \u003C lzb\u0060 appears character-identically in 2 files \u2014 src/tools/rust-analyzer/crates/ide-db/src/imports/merge_imports.rs, src/tools/rustfmt/src/sort.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/tools/rust-analyzer/crates/ide-db/src/imports/merge_imports.rs"},"region":{"startLine":1014}}}],"partialFingerprints":{"codehealthFindingId/v1":"da07a47a23d157d4ea60aca005d6a692aa5716102cdf17f86b0354aaf9803d80"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060more_leading_zeros == MoreLeadingZeros::Equal \u0026\u0026 lza \u003E lzb\u0060 appears character-identically in 2 files \u2014 src/tools/rust-analyzer/crates/ide-db/src/imports/merge_imports.rs, src/tools/rustfmt/src/sort.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/tools/rust-analyzer/crates/ide-db/src/imports/merge_imports.rs"},"region":{"startLine":1012}}}],"partialFingerprints":{"codehealthFindingId/v1":"1220989b4d0e41e0a31c59a908e19d4bdf7c3542e182fc1801ded0eea4cd2b44"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060name == sym::simd_cast || name == sym::simd_as\u0060 appears character-identically in 2 files \u2014 compiler/rustc_codegen_gcc/src/intrinsic/simd.rs, compiler/rustc_codegen_llvm/src/intrinsic.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":"compiler/rustc_codegen_gcc/src/intrinsic/simd.rs"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b740370c51b358ec0f4253d84822e7e3cf03d7b5408ccfafee96ef53409aaa2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060name == sym::simd_extract || name == sym::simd_extract_dyn\u0060 appears character-identically in 2 files \u2014 compiler/rustc_codegen_gcc/src/intrinsic/simd.rs, compiler/rustc_codegen_llvm/src/intrinsic.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":"compiler/rustc_codegen_gcc/src/intrinsic/simd.rs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8e52c93784280026a9e2c14c9547dce29f2c8591eaffbe436f530f0b14edb19"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060name == sym::simd_insert || name == sym::simd_insert_dyn\u0060 appears character-identically in 2 files \u2014 compiler/rustc_codegen_gcc/src/intrinsic/simd.rs, compiler/rustc_codegen_llvm/src/intrinsic.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":"compiler/rustc_codegen_gcc/src/intrinsic/simd.rs"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2fa678cf5d30801e4f1fd94104dc535b5bcb6d0687eb16dc1063aa7a4de5ac8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060name == sym::simd_saturating_add || name == sym::simd_saturating_sub\u0060 appears character-identically in 2 files \u2014 compiler/rustc_codegen_gcc/src/intrinsic/simd.rs, compiler/rustc_codegen_llvm/src/intrinsic.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":"compiler/rustc_codegen_gcc/src/intrinsic/simd.rs"},"region":{"startLine":1301}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cbc2d4ab4c96d8cc359cec103a3131a57e40c601b9e2b2192393ff943c963f5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060name_bytes == b\u0022.\u0022 || name_bytes == b\u0022..\u0022\u0060 appears character-identically in 2 files \u2014 library/std/src/sys/fs/hermit.rs, library/std/src/sys/fs/unix.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":"library/std/src/sys/fs/hermit.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"00544ebde799f378b6057979fc55048d9f99019fb3af35d4e43105b76a9db373"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060opaque_types.is_empty() \u0026\u0026 duplicate_entries.is_empty()\u0060 appears character-identically in 2 files \u2014 compiler/rustc_infer/src/infer/opaque_types/table.rs, src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/opaque_types/table.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":"compiler/rustc_infer/src/infer/opaque_types/table.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3bb0a8a75556894bcb440950cbb060ac0cfe7aa5df195f26ac0f83a291eeafd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060opt_slice_ty.is_some() || slice.is_none()\u0060 appears character-identically in 2 files \u2014 compiler/rustc_hir_typeck/src/pat.rs, src/tools/rust-analyzer/crates/hir-ty/src/infer/pat.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":"compiler/rustc_hir_typeck/src/pat.rs"},"region":{"startLine":3130}}}],"partialFingerprints":{"codehealthFindingId/v1":"36cc57b4b51c805d54fe1005b24e6fded5bbe8fcb510ce75f5dce22d18a25c51"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060p_ty == values_elem \u0026\u0026 p_ty.kind() == values_elem.kind()\u0060 appears character-identically in 2 files \u2014 compiler/rustc_codegen_gcc/src/intrinsic/simd.rs, compiler/rustc_codegen_llvm/src/intrinsic.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":"compiler/rustc_codegen_gcc/src/intrinsic/simd.rs"},"region":{"startLine":1595}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a10345e8b0fd0b51793ecad6cd23b8a2fbdb1904def04cbf9fd303259b69f3d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060p_ty == values_elem \u0026\u0026 p_ty.kind() == values_elem.kind() \u0026\u0026 p_mutbl.is_mut()\u0060 appears character-identically in 2 files \u2014 compiler/rustc_codegen_gcc/src/intrinsic/simd.rs, compiler/rustc_codegen_llvm/src/intrinsic.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":"compiler/rustc_codegen_gcc/src/intrinsic/simd.rs"},"region":{"startLine":1677}}}],"partialFingerprints":{"codehealthFindingId/v1":"942d10b5c9ba40c870617fb9700321a91a821e1ff522584dae3169deeb045445"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060param.index == 0 \u0026\u0026 param.name == kw::SelfUpper\u0060 appears character-identically in 3 files \u2014 compiler/rustc_borrowck/src/diagnostics/region_errors.rs, compiler/rustc_middle/src/ty/sty.rs, src/tools/clippy/clippy_utils/src/lib.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":"compiler/rustc_borrowck/src/diagnostics/region_errors.rs"},"region":{"startLine":1488}}}],"partialFingerprints":{"codehealthFindingId/v1":"404b95037b72bdb5a296beca3d4d6aabcd283cdebf8b8c7361d09dfc626875ac"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060parser.token != TokenKind::CloseBrace \u0026\u0026 parser.token.kind != TokenKind::Eof\u0060 appears character-identically in 2 files \u2014 src/tools/rustfmt/src/parse/macros/cfg_if.rs, src/tools/rustfmt/src/parse/macros/cfg_select.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/tools/rustfmt/src/parse/macros/cfg_if.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"6669718f18899829431771b14da53f7dfb1087ce9a4037b384098196275e065f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060pat_ref_layers \u003C expected_ref_layers || self.should_peel_smart_pointer(peel_kind, expected)\u0060 appears character-identically in 2 files \u2014 compiler/rustc_hir_typeck/src/pat.rs, src/tools/rust-analyzer/crates/hir-ty/src/infer/pat.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":"compiler/rustc_hir_typeck/src/pat.rs"},"region":{"startLine":870}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b576415b0ba2fa3f90e2fa075b72609e27b1e2411288247e64f5e284956fb05"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060path.has_root() \u0026\u0026 path.prefix().is_some()\u0060 appears character-identically in 5 files \u2014 library/std/src/sys/path/cygwin.rs, library/std/src/sys/path/sgx.rs, library/std/src/sys/path/unix.rs, library/std/src/sys/path/unsupported_backslash.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":"library/std/src/sys/path/cygwin.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"1071c54e64f1b4f7dcc7ffa036a72050927e6d9e738a85db3bac71b2e737ef7d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060path_os.starts_with(b\u0022//\u0022) \u0026\u0026 !path_os.starts_with(b\u0022///\u0022)\u0060 appears character-identically in 2 files \u2014 library/std/src/sys/path/cygwin.rs, library/std/src/sys/path/unix.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":"library/std/src/sys/path/cygwin.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"03c605bc330ae5529b2119e03e797ca574b78226018ef75a7404e7ded8c4bb73"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060place.projections[i].kind == ProjectionKind::Deref \u0026\u0026 is_mut_ref(place.ty_before_projection(i))\u0060 appears character-identically in 2 files \u2014 compiler/rustc_hir_typeck/src/upvar.rs, src/tools/rust-analyzer/crates/hir-ty/src/infer/closure/analysis.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":"compiler/rustc_hir_typeck/src/upvar.rs"},"region":{"startLine":2647}}}],"partialFingerprints":{"codehealthFindingId/v1":"c05f8660cc17dbc4cde2e298e6e023109bcc0b725392680c4ddb95bc2027e18d"}},{"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/tools/miri/src/borrow_tracker/stacked_borrows/mod.rs, src/tools/miri/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/tools/miri/src/borrow_tracker/stacked_borrows/mod.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"abeae017a3aac963231fb38295b4b911dcfa0df5a77fc557277479ebc847f132"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ref_pat_matches_mut_ref \u0026\u0026 pat_mutbl == Mutability::Not\u0060 appears character-identically in 2 files \u2014 compiler/rustc_hir_typeck/src/pat.rs, src/tools/rust-analyzer/crates/hir-ty/src/infer/pat.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":"compiler/rustc_hir_typeck/src/pat.rs"},"region":{"startLine":2807}}}],"partialFingerprints":{"codehealthFindingId/v1":"86f936c5e7454b9dde5e49ff0e78e2446a990a0884465cdd583bafb7c6908bdc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060result.is_none() \u0026\u0026 autoderef.next().is_some()\u0060 appears character-identically in 4 files \u2014 compiler/rustc_hir_typeck/src/callee.rs, compiler/rustc_hir_typeck/src/place_op.rs, src/tools/rust-analyzer/crates/hir-ty/src/infer/callee.rs, src/tools/rust-analyzer/crates/hir-ty/src/infer/place_op.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":"compiler/rustc_hir_typeck/src/callee.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c55b8acf719a52bfe2aac6c2682b357d9dfdaffc806b7887fcb5411e3b3ad70"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ret.layout.is_aggregate() \u0026\u0026 ret.layout.is_sized()\u0060 appears character-identically in 2 files \u2014 compiler/rustc_target/src/callconv/nvptx64.rs, compiler/rustc_target/src/callconv/x86.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":"compiler/rustc_target/src/callconv/nvptx64.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"063d0639c2f5f1864f2e034bac9867eb6c6c5de7d17ce6ea057a6e1e530c97bf"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060rhs \u003C= self.trailing_zeros() \u0026\u0026 rhs \u003C \u003C$SelfT\u003E::BITS\u0060 appears character-identically in 2 files \u2014 library/core/src/num/int_macros.rs, library/core/src/num/uint_macros.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":"library/core/src/num/int_macros.rs"},"region":{"startLine":1842}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d9003b9810b662f706c89638230b804ebd26cd37325389decfc0e19fe1afa47"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.avoid_breaking_exported_api \u0026\u0026 cx.effective_visibilities.is_exported(def_id)\u0060 appears character-identically in 3 files \u2014 src/tools/clippy/clippy_lints/src/pass_by_ref_or_value.rs, src/tools/clippy/clippy_lints/src/unnecessary_box_returns.rs, src/tools/clippy/clippy_lints/src/unnecessary_wraps.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/tools/clippy/clippy_lints/src/pass_by_ref_or_value.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"06b33a51494c0f0455e004b1fc8e6cbf1430d8dc9076beb24316afbfddc7fc3a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.avoid_breaking_exported_api \u0026\u0026 cx.effective_visibilities.is_exported(fn_def_id)\u0060 appears character-identically in 2 files \u2014 src/tools/clippy/clippy_lints/src/needless_pass_by_ref_mut.rs, src/tools/clippy/clippy_lints/src/single_call_fn.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/tools/clippy/clippy_lints/src/needless_pass_by_ref_mut.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aefd17fe86949b6d40e9457bc750180ad25e3a9ccc7f3fd057967267504bd3f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.const_span \u0026\u0026 span.contains(body_span)\u0060 appears character-identically in 2 files \u2014 src/tools/clippy/clippy_lints/src/operators/arithmetic_side_effects.rs, src/tools/clippy/clippy_lints/src/operators/numeric_arithmetic.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/tools/clippy/clippy_lints/src/operators/arithmetic_side_effects.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc99d88d4d10e0c047d8ab2b9124cd715d131bb798f8eb7caca7261f41035999"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.i1.is_empty() \u0026\u0026 self.i2.is_empty()\u0060 appears character-identically in 2 files \u2014 library/alloc/src/collections/vec_deque/iter.rs, library/alloc/src/collections/vec_deque/iter_mut.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":"library/alloc/src/collections/vec_deque/iter.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ac41cf60c7df5cfcf39488d1fddba053b386444e2f26a2e502b7c19580cc502"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.is_integral() || self.is_floating_point()\u0060 appears character-identically in 2 files \u2014 compiler/rustc_middle/src/ty/sty.rs, src/tools/rust-analyzer/crates/hir-ty/src/next_solver/ty.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":"compiler/rustc_middle/src/ty/sty.rs"},"region":{"startLine":1502}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7be082807b09a09c1122677524c58f045e7a2d0f14edbe7c28e1a284a6aeb37"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.is_nan() || bits == Self::INFINITY.to_bits()\u0060 appears character-identically in 5 files \u2014 library/compiler-builtins/libm/src/math/support/float_traits.rs, library/core/src/num/f128.rs, library/core/src/num/f16.rs, library/core/src/num/f32.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":"library/compiler-builtins/libm/src/math/support/float_traits.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f19841dca0490ee8e09c87839c274644565e6f747de05a934e37f0f563360f6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.is_nan() || bits == Self::NEG_INFINITY.to_bits()\u0060 appears character-identically in 5 files \u2014 library/compiler-builtins/libm/src/math/support/float_traits.rs, library/core/src/num/f128.rs, library/core/src/num/f16.rs, library/core/src/num/f32.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":"library/compiler-builtins/libm/src/math/support/float_traits.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"64a823ad9789da6b204f7a38218ec72f551cb497933da0a7c228c3d2ab78a1f0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.is_ref() || self.is_raw_ptr() || self.is_fn_ptr()\u0060 appears character-identically in 2 files \u2014 compiler/rustc_middle/src/ty/sty.rs, compiler/rustc_public/src/ty/tys.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":"compiler/rustc_middle/src/ty/sty.rs"},"region":{"startLine":1352}}}],"partialFingerprints":{"codehealthFindingId/v1":"b01276e0cf01503795afa6fe2c14572b7b2e99bc3c08a4e47956a75766edcc1e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.param_env == other.param_env \u0026\u0026 self.predicate == other.predicate\u0060 appears character-identically in 2 files \u2014 compiler/rustc_infer/src/traits/mod.rs, src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/traits.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":"compiler/rustc_infer/src/traits/mod.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"3469f48458a04c92ff439e91aae61e28f26d076964df2cfc7a2cfd483fef6853"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.start \u003C= max_value \u0026\u0026 self.end \u003C= max_value\u0060 appears character-identically in 2 files \u2014 compiler/rustc_abi/src/wrapping_range.rs, compiler/rustc_public/src/abi.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":"compiler/rustc_abi/src/wrapping_range.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b4d7d256f89005b8913006a998e5212b60fcacb5c6af2fb87feb0f92b8f287d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.truncate || self.create || self.create_new\u0060 appears character-identically in 4 files \u2014 library/std/src/sys/fs/hermit.rs, library/std/src/sys/fs/solid.rs, library/std/src/sys/fs/unix.rs, library/std/src/sys/fs/windows.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":"library/std/src/sys/fs/hermit.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cb6bfd27cef938c29a6fa9458ce5a3ff2accb221834cbb0ed730e9d321e1232"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.verbatim.is_some() || self.kind.has_modifiers()\u0060 appears character-identically in 2 files \u2014 compiler/rustc_crate_store/src/cstore.rs, compiler/rustc_session/src/utils.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":"compiler/rustc_crate_store/src/cstore.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bbf4cc04e32e3cfcdc36d06d037e8e13489d066e4034dc3c2997753c6bc510b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060snippet.starts_with(\u0027(\u0027) \u0026\u0026 snippet.ends_with(\u0027)\u0027)\u0060 appears character-identically in 2 files \u2014 src/tools/clippy/clippy_lints/src/needless_parens_on_range_literals.rs, src/tools/rustfmt/src/types.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/tools/clippy/clippy_lints/src/needless_parens_on_range_literals.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4816e014c6766cd9e16ce60b560626d1f2935d7c42cb12f479e3a1979846c76"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060target.is_windows_gnu() || target.is_windows_gnullvm()\u0060 appears character-identically in 2 files \u2014 src/bootstrap/src/core/build_steps/compile.rs, src/bootstrap/src/core/build_steps/dist.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/bootstrap/src/core/build_steps/compile.rs"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebc4fbaff7dceac5d2964211c8745a870213ba190b158dc1b72ba6bfe2f6acba"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060tcx.opt_associated_item(def_id) \u0026\u0026 assoc.is_method()\u0060 appears character-identically in 2 files \u2014 compiler/rustc_borrowck/src/diagnostics/region_errors.rs, compiler/rustc_hir_typeck/src/fn_ctxt/_impl.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":"compiler/rustc_borrowck/src/diagnostics/region_errors.rs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"67e7f8fe148be2fa59862383199cdafa17a2f11cc3850114fd214838c575b682"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060timeout.as_secs() == 0 \u0026\u0026 timeout.subsec_nanos() == 0\u0060 appears character-identically in 4 files \u2014 library/std/src/sys/net/connection/socket/hermit.rs, library/std/src/sys/net/connection/socket/solid.rs, library/std/src/sys/net/connection/socket/unix.rs, library/std/src/sys/net/connection/socket/windows.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":"library/std/src/sys/net/connection/socket/hermit.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"a94d549c132496f0a51ee53298e0ed96a9c2aa488b92a4f9f807a37ccb75fb20"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060timeout.tv_sec == 0 \u0026\u0026 timeout.tv_usec == 0\u0060 appears character-identically in 4 files \u2014 library/std/src/sys/net/connection/socket/hermit.rs, library/std/src/sys/net/connection/socket/solid.rs, library/std/src/sys/net/connection/socket/unix.rs, library/std/src/sys/net/connection/socket/windows.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":"library/std/src/sys/net/connection/socket/hermit.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"e710f2ea22815ab229d0c271502243c28fa686022e5a809fc2771eeb9d907401"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ty.is_closure() || ty.is_coroutine() || ty.is_coroutine_closure()\u0060 appears character-identically in 3 files \u2014 compiler/rustc_borrowck/src/diagnostics/mutability_errors.rs, compiler/rustc_trait_selection/src/error_reporting/infer/mod.rs, compiler/rustc_trait_selection/src/error_reporting/infer/note_and_explain.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":"compiler/rustc_borrowck/src/diagnostics/mutability_errors.rs"},"region":{"startLine":1999}}}],"partialFingerprints":{"codehealthFindingId/v1":"2021a6649d49ebf2058c798d7aba75e73b945f180f9b632d1773bf21a82dd242"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ty.is_global() \u0026\u0026 ty.is_trivially_wf(tcx)\u0060 appears character-identically in 2 files \u2014 compiler/rustc_middle/src/ty/sty.rs, src/tools/rust-analyzer/crates/hir-ty/src/next_solver/ty.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":"compiler/rustc_middle/src/ty/sty.rs"},"region":{"startLine":2087}}}],"partialFingerprints":{"codehealthFindingId/v1":"e879dd1a10618c2b9a1dec859e650c4d05ed9dc378aad669fb78cd2d104225a2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ty.is_numeric() || ty.is_char() || ty.is_ty_var() || ty.references_error()\u0060 appears character-identically in 2 files \u2014 compiler/rustc_hir_typeck/src/pat.rs, src/tools/rust-analyzer/crates/hir-ty/src/infer/pat.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":"compiler/rustc_hir_typeck/src/pat.rs"},"region":{"startLine":1038}}}],"partialFingerprints":{"codehealthFindingId/v1":"91ee4614e06fdaf0edc7bc7970957ba1d085b1abbf987797ffae8edfb74df98b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ty.is_numeric() || ty.is_char() || ty.references_error()\u0060 appears character-identically in 2 files \u2014 compiler/rustc_hir_typeck/src/pat.rs, src/tools/rust-analyzer/crates/hir-ty/src/infer/pat.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":"compiler/rustc_hir_typeck/src/pat.rs"},"region":{"startLine":1078}}}],"partialFingerprints":{"codehealthFindingId/v1":"e80fa77476ae9bfe1adee0079882bf95df78a99e9c30708bcd0f22a40ef5f2f6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ty.is_str() || ty.is_lang_item(cx, LangItem::String)\u0060 appears character-identically in 3 files \u2014 src/tools/clippy/clippy_lints/src/assert_is_empty.rs, src/tools/clippy/clippy_lints/src/methods/manual_str_repeat.rs, src/tools/clippy/clippy_lints/src/methods/no_effect_replace.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/tools/clippy/clippy_lints/src/assert_is_empty.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a8b2bd57b85cc6d657b9dbde2daee9270a31bae37707d9e914ac86ff755d8ab"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ty.is_trivially_wf(tcx) \u0026\u0026 ty.has_trivial_sizedness(tcx, SizedTraitKind::Sized)\u0060 appears character-identically in 2 files \u2014 compiler/rustc_middle/src/ty/sty.rs, src/tools/rust-analyzer/crates/hir-ty/src/next_solver/ty.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":"compiler/rustc_middle/src/ty/sty.rs"},"region":{"startLine":2080}}}],"partialFingerprints":{"codehealthFindingId/v1":"986c739a36e36f8fa40f7b9fe74ced304da27cd8dcbfdac5047009a36a864f57"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ty.ty_adt_def() \u0026\u0026 get_clippy_attr(self.cx.tcx, adt.did(), sym::has_significant_drop).is_some()\u0060 appears character-identically in 2 files \u2014 src/tools/clippy/clippy_lints/src/matches/significant_drop_in_scrutinee.rs, src/tools/clippy/clippy_lints/src/significant_drop_tightening.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/tools/clippy/clippy_lints/src/matches/significant_drop_in_scrutinee.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce75f0a461420d0c79f5ca7487d5d2fee64438e4c86307d33a7ca9d1c0cba49d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060unit.size.bits() == 64 || unit.size.bits() == 128\u0060 appears character-identically in 2 files \u2014 compiler/rustc_target/src/callconv/aarch64.rs, compiler/rustc_target/src/callconv/arm.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":"compiler/rustc_target/src/callconv/aarch64.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6f8a3f9fa1113ceed28e73b5cbe6e50e4153dd4be38c226377121e04d1bfba7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060utils::is_signedness_cast(cast_from, cast_to) \u0026\u0026 msrv.meets(cx, msrvs::INTEGER_SIGN_CAST)\u0060 appears character-identically in 2 files \u2014 src/tools/clippy/clippy_lints/src/casts/cast_possible_wrap.rs, src/tools/clippy/clippy_lints/src/casts/cast_sign_loss.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/tools/clippy/clippy_lints/src/casts/cast_possible_wrap.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"569fb09fd54f03719bd62dbbc69e34aa396883a2483d5d5b6460ead7fe33a72d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060vendor_id == *b\u0022AuthenticAMD\u0022 || vendor_id == *b\u0022HygonGenuine\u0022\u0060 appears character-identically in 2 files \u2014 library/compiler-builtins/libm/src/math/arch/x86/detect.rs, library/std_detect/src/detect/os/x86.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":"library/compiler-builtins/libm/src/math/arch/x86/detect.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"b87df6bed69c4b26644bd65046fbd9455cfb631d4da72062356b81b3ec5528b2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 152 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/tools/rustfmt/src/attr.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8f0f6685ba356d8b02619716e509098f27002dbe88486d204a74986bb138a5c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 150 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/tools/rustfmt/src/chains.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"756fb6db197745f2ed680f6d14c54a433cd352c547d2a95ccfc326e592f89186"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 560 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/tools/rustfmt/src/chains.rs"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1fd58e59224cefdad6d56ac8ad7aded010b1cf00d367ba21cd77734d0bf1ee3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 43 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/tools/rustfmt/src/closures.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"4da9108b355a8bacdbb99610aa6a3e14d94b0b5d502636c4836425e51aecc4e6"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 363 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/tools/rustfmt/src/closures.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea40de9a9da947d4ad8cc01a3d049543501407f5b32d8f24c7d2683f27b01c5b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 162 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: \u0060trace!(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/tools/rustfmt/src/comment.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"f30c26a1a9fe19d12826bf268aed8ae1504e847b046e4771948620329230839f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1813 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/tools/rustfmt/src/comment.rs"},"region":{"startLine":1813}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba75f5fb7981630a36ff4289a332bc94230e7a85d2e5feb70572eb3c65661e04"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 936 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/tools/rustfmt/src/expr.rs"},"region":{"startLine":936}}}],"partialFingerprints":{"codehealthFindingId/v1":"b359e902288252117c36aa9d0b3f39474878e6224432b2d8ded7734916bef6ee"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1201 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/tools/rustfmt/src/expr.rs"},"region":{"startLine":1201}}}],"partialFingerprints":{"codehealthFindingId/v1":"929d320ac5b2bde1a4a15716299f3f335e6df70a46d58ab208e95a68eeba6cf5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1687 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/tools/rustfmt/src/expr.rs"},"region":{"startLine":1687}}}],"partialFingerprints":{"codehealthFindingId/v1":"41e544502deb580517ea0de33d6e89c0ff1b2b7916dd3e49469aba86bab47408"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1837 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/tools/rustfmt/src/expr.rs"},"region":{"startLine":1837}}}],"partialFingerprints":{"codehealthFindingId/v1":"68d867ac63320f0a2013909bf226978986d082bf8edc8a1ca4b3e53d6d5a11b9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 2056 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/tools/rustfmt/src/expr.rs"},"region":{"startLine":2056}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a380a72833e8e23d999dc59cd5ffeb51d3783019db8d2cb880b00c0e923e0e2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 2141 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/tools/rustfmt/src/expr.rs"},"region":{"startLine":2141}}}],"partialFingerprints":{"codehealthFindingId/v1":"a87cea253c62e4f167431749c5f1df740d4ab4bf8eaebb1f5c25395da0e604be"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 476 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/tools/rustfmt/src/formatting.rs"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ca07b9183bdee6e7ca0b89123d45df1bcd40aabd506a262f89362e6a2bfe0f0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 56 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/tools/rustfmt/src/items.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"492eddfab1e7da47ce1517e8afbc3b54b4f9e5fafcceb7d4c694405933816af4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 2549 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/tools/rustfmt/src/items.rs"},"region":{"startLine":2549}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d5db02d86af7c66a2accdff4c7b960fc44347a9c92fe8149f2801a84626b533"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 2943 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/tools/rustfmt/src/items.rs"},"region":{"startLine":2943}}}],"partialFingerprints":{"codehealthFindingId/v1":"9469efe9b60e3f6be28ca9eb9cc2dc29a30cf31091859e694eaa32e3c24d56be"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 592 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/tools/rustfmt/src/macros.rs"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"8686f630c8c7c4be4109527772d66df572cd9bbc891498a79ab2a544df31f859"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1094 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/tools/rustfmt/src/macros.rs"},"region":{"startLine":1094}}}],"partialFingerprints":{"codehealthFindingId/v1":"42496cf00fa416f6c3d9f60ca6a640827ea56b9c446faf073e172b228ee7f3d9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1146 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/tools/rustfmt/src/macros.rs"},"region":{"startLine":1146}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdc5eda81fe5f77040fe1f42b17beaeb73a4336d159ba5ae3f9e13ed19c91765"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1423 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/tools/rustfmt/src/macros.rs"},"region":{"startLine":1423}}}],"partialFingerprints":{"codehealthFindingId/v1":"8accfc84c5b46e82bab894f026bf5a35331cf690757425d29b1163fd3b9b1d37"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 614 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/tools/rustfmt/src/matches.rs"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbd7f86d2a78d58ef44c046a82cbc2a39b54b7e8376281b474c9f1f606f067cc"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 159 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/tools/rustfmt/src/missed_spans.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea23eb212b7be3a747bfb4589db4f41eeea4e00e7de765b62b42321722bc4f31"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 198 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/tools/rustfmt/src/missed_spans.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"74117aaa9b085729cc776eebf36b6cce59843343fef020577d2e5c9cdbc843fc"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 484 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: \u0060warn!(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/tools/rustfmt/src/modules.rs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab291e8a04162c4eca5d5b1078a704fb2e33a6dabdfb4552d3f7a1345cc1fd29"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 625 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/tools/rustfmt/src/overflow.rs"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"9867e414e033fe27bb4ba9babaf05f4cf2bbebb8f8b75d46e5013a0da971cf62"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 641 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/tools/rustfmt/src/overflow.rs"},"region":{"startLine":641}}}],"partialFingerprints":{"codehealthFindingId/v1":"287c9402b36bc7fe6ed3ba23ab29dd5723bfbc801afa4f09308c1962cd84e207"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 328 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/tools/rustfmt/src/types.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c3780c695d6e4ac860022a092960ecd751f6130905423c957d45e75e3c479ac"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1097 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/tools/rustfmt/src/types.rs"},"region":{"startLine":1097}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fc457c4f6dc4cb937369bddff4a0bd49a4df91c7b481caaab702422ad0bf621"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 119 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/tools/rustfmt/src/visitor.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cf2afc84afb5f5e190c480fd24a43bcd8657331c32b03ec5250e16157e58c33"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 228 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/tools/rustfmt/src/visitor.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0d61bca60c683db85e20dc8ee9194d909ef26678fa5c14d154156da477c6367"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 289 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/tools/rustfmt/src/visitor.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"6431112aef1b9e12700a909d9a0bb7373d31a52c406d72efdb016f2790127062"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 38 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/tools/rustfmt/src/modules/visitor.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb7a5a14f238b96f0ae37c4a873a34e120ebc3e2b655b863a37a62d93fa16e53"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 98 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/tools/rustfmt/src/modules/visitor.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"a41cbff2344e39b608af80070256fe89a283c27e1b352d4b11d38080c84d3d35"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 33 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/tools/rustfmt/src/git-rustfmt/main.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"07250f8652263d5b2c5e3097a97ebbec12056ab11506819b44f8ac8dbdbe2bf9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 120 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/tools/rustfmt/src/git-rustfmt/main.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"542f0dd3b993b8445f0e8a82739b9a1b07ff6e3e89cc6c20dbc696bbc3ad446d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 203 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/tools/rustfmt/src/git-rustfmt/main.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"31c40fa08021a810b9402062c3a73eabafc64c7760c51ba85993011fe8cc2851"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 205 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/tools/rustfmt/src/git-rustfmt/main.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"23a23cf5cea9a6466d665179ff283310daebf345d36b33551126006d19d5d012"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 97 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/tools/rustfmt/src/format-diff/main.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e704de9c33c9c36a5b261817086822ec4f79854299c69002b76672e69b8075a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 98 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/tools/rustfmt/src/format-diff/main.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"af25b280e8e683b599a1bd9b4528647b0844878630653a00d9c8cd1aa358ee82"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 505 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/tools/rustfmt/check_diff/src/lib.rs"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"55d9a95e3c0b601fd4b8db044896b8b1d633b44850f3c06345df4a4d91844750"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 524 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/tools/rustfmt/check_diff/src/lib.rs"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7b568ed40d7c475a69c6985875679ee8fc8a8b40d1000e460e0b13c90557bbc"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 543 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/tools/rustfmt/check_diff/src/lib.rs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee2384e86e56fbded7c77530234766d825a1d6cf61b1ea48b49344db691fe4db"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 554 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: \u0060error!(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/tools/rustfmt/check_diff/src/lib.rs"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"71ead5c741361f1c15c97ee3449e29048dfae04121e7534f20d2db51c0a97eca"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 561 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/tools/rustfmt/check_diff/src/lib.rs"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"d34401c13acde9d37d2da53e817e368dc973c47e06f0369b6b3bcec0b08eda6b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 568 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/tools/rustfmt/check_diff/src/lib.rs"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"55d5e5d352665a88d83201267ddedd9544056237aa21aba09cf07ae7b34ee863"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 613 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/tools/rustfmt/check_diff/src/lib.rs"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bc7e3029e3bdd6b2949d7dc8103381bbfdead09ddf5d415558ff0e193dde956"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 659 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/tools/rustfmt/check_diff/src/lib.rs"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"cddc2c0d99da2441b9af450844b562c63688288267a1629391af5e6b251eaec7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 679 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/tools/rustfmt/check_diff/src/lib.rs"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"697209940fb6633d82df094501cd52b94538de33256b77e38c12a0bf985e3112"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 681 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/tools/rustfmt/check_diff/src/lib.rs"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"88175e1ddb2bdf9c041288fa42ead2c5a535f9f07ae72de01dcd90a3b50ed629"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 685 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/tools/rustfmt/check_diff/src/lib.rs"},"region":{"startLine":685}}}],"partialFingerprints":{"codehealthFindingId/v1":"d367eee2666aad54056fac217bcb5b5fac091052c2ffd833baa45543bd32ebb1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 686 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/tools/rustfmt/check_diff/src/lib.rs"},"region":{"startLine":686}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f312e49d256adf338d0fc24e0680c60b22abcae3017d57946341edcaa4664de"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 737 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/tools/rustfmt/check_diff/src/lib.rs"},"region":{"startLine":737}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d71031c58a732deb0cdd8ada777612241d5622deca3c17e7eea2413427947dd"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 785 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/tools/rustfmt/check_diff/src/lib.rs"},"region":{"startLine":785}}}],"partialFingerprints":{"codehealthFindingId/v1":"054e3618d5e69c01b0edc84a50e5ab496053271c7befca7e356f5646ab6f38c0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 787 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: \u0060warn!(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/tools/rustfmt/check_diff/src/lib.rs"},"region":{"startLine":787}}}],"partialFingerprints":{"codehealthFindingId/v1":"83b02b88036c16cae0b456e292dffe78a87d2e936c5cbcc38a9c8ebcc6ca29ff"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 795 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: \u0060warn!(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/tools/rustfmt/check_diff/src/lib.rs"},"region":{"startLine":795}}}],"partialFingerprints":{"codehealthFindingId/v1":"47cdd2fa9c2d8e229b176439300149357aa89411def8ed7e07d3b3237e193b8c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 829 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: \u0060trace!(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/tools/rustfmt/check_diff/src/lib.rs"},"region":{"startLine":829}}}],"partialFingerprints":{"codehealthFindingId/v1":"599e4d26a2e092a7736950f205694863c4b30f243ac7bd6b5be4eb4b3a89e22c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 840 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: \u0060trace!(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/tools/rustfmt/check_diff/src/lib.rs"},"region":{"startLine":840}}}],"partialFingerprints":{"codehealthFindingId/v1":"deefec992f9e01bce0adbb39f1b5c3eb03e9c61960082ae279bf232cd8f77d10"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 849 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/tools/rustfmt/check_diff/src/lib.rs"},"region":{"startLine":849}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fae1634e522c737089c69fed47a4f715612bed3709d6c180836b0b7708e5e21"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 858 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/tools/rustfmt/check_diff/src/lib.rs"},"region":{"startLine":858}}}],"partialFingerprints":{"codehealthFindingId/v1":"77a0d913a9578b6ab8f94f8a4808c4ea225097752c99f74ceef0e055d576120e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 867 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/tools/rustfmt/check_diff/src/lib.rs"},"region":{"startLine":867}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5d73814d081eddef3c4a2746fc37910d9eb6fa4a5542fb76e86ff1d74447d4f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 81 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/tools/rustfmt/check_diff/src/main.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"f03d9a80587ca38b06771cc6bc27287ea7346063439d3fd074439dd70657e6a1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 97 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: \u0060error!(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/tools/rustfmt/check_diff/src/main.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"a849a55df1d1501d934762359836b3b56ac052fd9677f66b7364d32bdff6d503"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 117 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: \u0060error!(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/tools/rustfmt/check_diff/src/main.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e4c9d7143551ff8bf3611ea0d97551e5190671ffaed0cdb07e1d6c27172078e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 125 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: \u0060error!(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/tools/rustfmt/check_diff/src/main.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"72fe93ae371c835584a4492072975f6c8cf5ed11ab6e79899d3182909ab6f5f0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 372 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: \u0060warn!(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/tools/rust-analyzer/crates/vfs-notify/src/lib.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a2cff47a2279a2f7905b26bbeffc9ab9db0567a3bff789334b8cc3d8416ca18"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 43 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/tools/rust-analyzer/crates/stdx/src/tempfile.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"efd15e936bb037329e52698f4ab23548aa5e9692fa1a8cba7005f2630fcdb290"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 67 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/tools/rust-analyzer/crates/stdx/src/tempfile.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c0442276f40268f95135bb0ab7c1a09905201f46afda868bb3da49a215877db"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 1216 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/tools/rust-analyzer/crates/rust-analyzer/src/config.rs"},"region":{"startLine":1216}}}],"partialFingerprints":{"codehealthFindingId/v1":"3145cf2f46d74ba245a9b0ff0e0d637191c7a6733675c12d2acc9c0b5ee44c3e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 1240 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/tools/rust-analyzer/crates/rust-analyzer/src/config.rs"},"region":{"startLine":1240}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d77a562225db543d0aa91bd3e406a4afe7e7a3ff2714bcfffad74d02e9274cd"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 1318 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/tools/rust-analyzer/crates/rust-analyzer/src/config.rs"},"region":{"startLine":1318}}}],"partialFingerprints":{"codehealthFindingId/v1":"e67eb6e7d40330150be0f14ff0ff8826ff79db6cc48ab7e630dff0cc8e126531"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 1360 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/tools/rust-analyzer/crates/rust-analyzer/src/config.rs"},"region":{"startLine":1360}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c4371d44f93c1dad3ce1205c75b04f9deada66185d847f4e9cd936c8dff582e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 1807 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/tools/rust-analyzer/crates/rust-analyzer/src/config.rs"},"region":{"startLine":1807}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb9ffe49ab971ca974008c0b3420bfa82dbcca2df5f29d24a395ca3433090151"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 1809 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: \u0060error!(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/tools/rust-analyzer/crates/rust-analyzer/src/config.rs"},"region":{"startLine":1809}}}],"partialFingerprints":{"codehealthFindingId/v1":"a672032f3f42ce043b421a86e672661b4230c0553f3b652956cd1c1849b0f895"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 2302 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: \u0060error!(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/tools/rust-analyzer/crates/rust-analyzer/src/config.rs"},"region":{"startLine":2302}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c738958f132b6ac5d2edfacc9e42fd783f386e04bf5b77ad9daf5b540eb5e8e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 3665 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: \u0060warn!(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/tools/rust-analyzer/crates/rust-analyzer/src/config.rs"},"region":{"startLine":3665}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cbf63d5b8f272b01d171d5ab2402a9cc094858c39d466864109ceaf56d11019"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 3694 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: \u0060warn!(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/tools/rust-analyzer/crates/rust-analyzer/src/config.rs"},"region":{"startLine":3694}}}],"partialFingerprints":{"codehealthFindingId/v1":"afbbf3f1884e0982f540d5553f3c68b9acae8254049590997582b382915d0cfb"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 692 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: \u0060error!(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/tools/rust-analyzer/crates/rust-analyzer/src/flycheck.rs"},"region":{"startLine":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"24d96a6b2cec3f5724c8f7154ac09b8539706c5a2c6fab1890b9966d9a82cca6"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 511 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: \u0060error!(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/tools/rust-analyzer/crates/rust-analyzer/src/global_state.rs"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aa5f63d74314bfcb6918e6ba5dd8e011c859b3cba67b1f17df9680a66df8352"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 42 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/tools/rust-analyzer/crates/rust-analyzer/src/main_loop.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"9849d7b47c6f27ee5871dae2aa56cfeb61a35c32915d47965614e3d337b7bb61"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 633 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: \u0060warn!(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/tools/rust-analyzer/crates/rust-analyzer/src/main_loop.rs"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b6450d3ebed6e5b3e63d58209f0cf93f5ccb17ec26387cf1db9c7d7d7e482c7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 691 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: \u0060trace!(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/tools/rust-analyzer/crates/rust-analyzer/src/main_loop.rs"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"62eaf95f662fdfc8301531a974171c36851daeba84ddb70f8db2cdf846b779eb"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 787 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: \u0060trace!(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/tools/rust-analyzer/crates/rust-analyzer/src/main_loop.rs"},"region":{"startLine":787}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d65a7a0edb10c3b6c089580053f0f7ea22fc7fa2bd831cd98b43b49dac45d8c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 885 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: \u0060error!(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/tools/rust-analyzer/crates/rust-analyzer/src/main_loop.rs"},"region":{"startLine":885}}}],"partialFingerprints":{"codehealthFindingId/v1":"f479bfdcdd015b2af719bc595065848c53ff8f20388b7514741ba364f420804a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 941 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: \u0060error!(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/tools/rust-analyzer/crates/rust-analyzer/src/main_loop.rs"},"region":{"startLine":941}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a0c3f8f977e2535893a7d740f90e1c0e3111daf34f6997659ca9a77e4d4ab8e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 1238 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: \u0060error!(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/tools/rust-analyzer/crates/rust-analyzer/src/main_loop.rs"},"region":{"startLine":1238}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eecb6e243077c6a408f85db595bf032520fc069de33af59b4aa0f1d2b7b9325"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 712 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/tools/rust-analyzer/crates/rust-analyzer/src/reload.rs"},"region":{"startLine":712}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4f0e806c0dd81be591d2f8c3c658011d6291860bdb2886453200424675540e2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 721 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: \u0060error!(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/tools/rust-analyzer/crates/rust-analyzer/src/reload.rs"},"region":{"startLine":721}}}],"partialFingerprints":{"codehealthFindingId/v1":"373d76679e95999f488daeaee30015e948e7231a3375bb293eaffab8cea9ba00"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 42 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/tools/rust-analyzer/crates/rust-analyzer/src/session.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"19a2708035b1322dd6d8205da54067f0e45a05318886464aaeac1d7c50611cad"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 54 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/tools/rust-analyzer/crates/rust-analyzer/src/session.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"63f65789fdee362b803ce6e7a156423b4c3b679fb442a725e7c77a789bcfd798"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 79 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/tools/rust-analyzer/crates/rust-analyzer/src/session.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2683a7b6d7eafca82fd2520b1c8a6c910b9780e4d283ce81a95242b6289b4b5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 78 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: \u0060error!(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/tools/rust-analyzer/crates/rust-analyzer/src/lsp/utils.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"5430f31cf674933ca3fc28f617dab52a421da93faff62fb601a7276a04ada051"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 86 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: \u0060error!(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/tools/rust-analyzer/crates/rust-analyzer/src/lsp/utils.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"c74fe4517922cd857702359f462a840d13ba7ac2634f3f290fd582ee3268e5bd"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 131 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/tools/rust-analyzer/crates/rust-analyzer/src/lsp/utils.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"48a7e97706e1de28cb819d3c3158c67c9d1422a1a94c00a8b42dd647b9a7524b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 226 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: \u0060error!(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/tools/rust-analyzer/crates/rust-analyzer/src/handlers/dispatch.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"5de1de172ff7816f64214002f039509649d682f3b783e42a33bf27765a6937a0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 440 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: \u0060error!(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/tools/rust-analyzer/crates/rust-analyzer/src/handlers/dispatch.rs"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d159664ebac7ec7907430deff2318623d1811baab9f10cfe09632ef26fcaa11"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 77 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: \u0060error!(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/tools/rust-analyzer/crates/rust-analyzer/src/handlers/notification.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"f93652d00696ab0c5b2ec7100fbe9f6daf0779357432681423639e2529391abb"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 83 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: \u0060trace!(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/tools/rust-analyzer/crates/rust-analyzer/src/handlers/notification.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c5bfb7bc978cf4011eb5d83c2f3a141605c315dd1b5a7fdac5a0fc233f73429"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 145 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: \u0060error!(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/tools/rust-analyzer/crates/rust-analyzer/src/handlers/notification.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"7495444c41a3b6c340a9e41e56af31534ab7cb3796dde41363f693ec3afa833c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 242 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/tools/rust-analyzer/crates/rust-analyzer/src/handlers/notification.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8520a7e19064c9bc8ad2112d259c04a9e4d57e82e51d4fff44a0853a01566d6"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 247 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: \u0060error!(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/tools/rust-analyzer/crates/rust-analyzer/src/handlers/notification.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"465cb1df5cbcf77fde24599f7e2698d5e0d2bfdc5145ed6e21f8d4a75962ff10"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 527 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: \u0060error!(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/tools/rust-analyzer/crates/rust-analyzer/src/handlers/notification.rs"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"1be2065868dccd7f0e84bcdc930016395da8a9e052e1c054c0a52d7106b41260"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 274 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: \u0060error!(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/tools/rust-analyzer/crates/rust-analyzer/src/handlers/request.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"05c01edb955a81088e702d7e4f4cf6f91060e0b27a89157f208f35e746c12509"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 248 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: \u0060error!(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/tools/rust-analyzer/crates/rust-analyzer/src/cli/scip.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ef9be1a9507a58587d7b5781624ddbaf0fefb8315f62fa5be3dd589c7e74509"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 148 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: \u0060error!(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/tools/rust-analyzer/crates/project-model/src/build_dependencies.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"925e2783b724003823ca5d456e53063e895f3a5b9812593877dc190dcf757ad1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 165 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/tools/rust-analyzer/crates/project-model/src/build_dependencies.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"1066479227b4b5ecc6e4c2602a6674bfdc19e2e08b64e41eedcc26882d0a32f0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 209 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/tools/rust-analyzer/crates/project-model/src/build_dependencies.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"99e643e60eb39f7a7332b247ea31f4d69cefbcf088137f805c751971bb8dcc8c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 231 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: \u0060warn!(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/tools/rust-analyzer/crates/project-model/src/build_dependencies.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7a291d3bde03be2bcd229c52382c890c1b4f7b1870d23b9cbd6cbb46bd591be"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 241 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: \u0060error!(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/tools/rust-analyzer/crates/project-model/src/build_dependencies.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed19c580a5feaef1656eb709ce46258db3a1e6c330b7da02a175d30898579b84"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 272 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/tools/rust-analyzer/crates/project-model/src/build_dependencies.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b317d226d4248125a9464d906d2494f175370c8768d85c36e1ad764c7966bb2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 320 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/tools/rust-analyzer/crates/project-model/src/build_dependencies.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"e062c6860309a40c437c38100bb2937c9418be3dcbd6f76bb9f77b0f11189ba1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 343 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/tools/rust-analyzer/crates/project-model/src/build_dependencies.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7c094a290d6dbb05ba04fcb9b4fb4cecb76dc8cc4bd0fe214fcc0e21a727ab3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 34 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/tools/rust-analyzer/crates/project-model/src/cargo_config_file.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7df3fed127d7c8f89db54409660f86862d79a161d0729f647049ad30756c56d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 37 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/tools/rust-analyzer/crates/project-model/src/cargo_config_file.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"53ff9d53b4f84faf1b25f9f1efe390b17514aa3efd7e578358265453dbe16576"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 40 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/tools/rust-analyzer/crates/project-model/src/cargo_config_file.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"594363cd6a9250072e219113f021ff9625de74e8f1cd05cf63c6bd47e4bfe325"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 65 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/tools/rust-analyzer/crates/project-model/src/cargo_config_file.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"613ec9904ccdacbfb15dc78df1cc405f1d51a8791973ee6aa32733360f41f69d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 366 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: \u0060error!(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/tools/rust-analyzer/crates/project-model/src/cargo_workspace.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"34d7f0efcec6b250324015299c8ea2c77969e3fc167603e749e749fceb0af991"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 790 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/tools/rust-analyzer/crates/project-model/src/cargo_workspace.rs"},"region":{"startLine":790}}}],"partialFingerprints":{"codehealthFindingId/v1":"111cfbca20ea6a99c4869995da9a66a13d9c0771800a021762b4e57e37d3a3d0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 150 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: \u0060error!(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/tools/rust-analyzer/crates/project-model/src/project_json.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"294acdcfd92257523a54f0cc11a28647b562504b64be3c35ad54d80ed750c3bb"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 272 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: \u0060error!(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/tools/rust-analyzer/crates/project-model/src/sysroot.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f52c4a30694b1f42e6e73761215e12e6478aad73de93dd2946e83f854c9a750"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 276 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/tools/rust-analyzer/crates/project-model/src/sysroot.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e9d9095dbac59d47d81eb0a671f947cfb52eac9ec3bea18f912e10246b4f3e6"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 367 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/tools/rust-analyzer/crates/project-model/src/sysroot.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9dd19c0e0c321cede7121ad31a1de3f0349d9b5652a0867757c98ff131a54e7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 396 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: \u0060warn!(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/tools/rust-analyzer/crates/project-model/src/sysroot.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"769ef8a8430f7f6d99b8f517da68a215bcbde5112d811cf99dc1192241982336"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 445 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/tools/rust-analyzer/crates/project-model/src/sysroot.rs"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5e42a4c990c8c8cc655216a914544a28cee47b6f2a9eb3ceaacfac348f3be91"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 455 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/tools/rust-analyzer/crates/project-model/src/sysroot.rs"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf7df0e53f0ac41d457a96d242455134324ee1498c8ae5395ef92ffafdc065eb"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 458 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/tools/rust-analyzer/crates/project-model/src/sysroot.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"cddd8c3bcf5e149992beed8a3450c614f9f87580b7f566044f658cd8b9223e5a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 476 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/tools/rust-analyzer/crates/project-model/src/sysroot.rs"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"50e46f207077ccde692ac17fcfc4b0eef354215a6cb1bfe461ebb7381d54ba0f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 495 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/tools/rust-analyzer/crates/project-model/src/sysroot.rs"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"19a932f1456cc0cb2a53970b3105a8b6cca70ca932b674335be0cacd0e5fa6a1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 501 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/tools/rust-analyzer/crates/project-model/src/sysroot.rs"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa6d4804f4738a23e103cc9ec440c12eca888ba11b28be572cb4c7f7252d30bf"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 283 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: \u0060error!(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/tools/rust-analyzer/crates/project-model/src/workspace.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"9643c1abaa30faffce3dcecb366d3621063b76b0f041991bf48c8084ab1b509e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 328 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: \u0060error!(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/tools/rust-analyzer/crates/project-model/src/workspace.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"949b0b88c52b4689cbc93e78e2dedb4325506b723abc380cb64607c7616d585c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 383 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: \u0060error!(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/tools/rust-analyzer/crates/project-model/src/workspace.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed94c18c1a0ff71e0e07b8ca7e9f7911bdc6b070ed349bee30ab727ef32edde0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 1508 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: \u0060error!(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/tools/rust-analyzer/crates/project-model/src/workspace.rs"},"region":{"startLine":1508}}}],"partialFingerprints":{"codehealthFindingId/v1":"26194b0ba1cc0fdb0e65f2472c033dd52de9369b54babfa2a11ab75d2c618602"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1965 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: \u0060warn!(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/tools/rust-analyzer/crates/project-model/src/workspace.rs"},"region":{"startLine":1965}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c883f770462092c72eadc449a3c3a41a880b635a9f7b36b0ed3fb8f64712fb5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 78 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: \u0060warn!(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/tools/rust-analyzer/crates/project-model/src/toolchain_info/rustc_cfg.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a959ee42943e74abf9cbf24422b2307066ebdf63365ab1430e898a196047acd"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 64 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: \u0060warn!(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/tools/rust-analyzer/crates/project-model/src/toolchain_info/target_data.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"4862fb165cfe9e839c9ad404d0d81a77b71a3f613c3b0eb05807881c4b58c17f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 59 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/tools/rust-analyzer/crates/project-model/src/toolchain_info/target_tuple.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb06d467a94e03af54bbd8b0343fa1e7a73130c9bd4b038807683617c0d2010b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 28 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: \u0060warn!(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/tools/rust-analyzer/crates/project-model/src/toolchain_info/version.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7b16dc60bf99f8c93b448860f39395cea08b24b7c04c2a07d3a34ff42038ff0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 185 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/tools/rust-analyzer/crates/proc-macro-api/src/process.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2769def745c2b9a2425b659ce751df753c3583340406c554955a19aa55d1f76"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 196 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/tools/rust-analyzer/crates/proc-macro-api/src/process.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d98bc66af64793921b8a5e22db5d32b57437ebe9e0e31d8996bf8314dc9ca54"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 23 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: \u0060error!(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/tools/rust-analyzer/crates/proc-macro-api/src/transport/json.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"9317963219e241a57d3bf41ba2ed717238f1c6910dd16db2fea0c26a7d6a3182"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 32 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/tools/rust-analyzer/crates/proc-macro-api/src/transport/json.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fa14d4bf63d9be54684b19dcaea58bd011e66076a903c071596bc33650e729c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 69 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/tools/rust-analyzer/crates/load-cargo/src/lib.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"5922ca283f4ea29fcf40b8e7dbbe7098baa71f429f248580ba05b8d8adad6a5f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 501 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/tools/rust-analyzer/crates/load-cargo/src/lib.rs"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f7cc663654b284dc0cf1a229fd46a5d291cae5ea81f468b9a665b7738cfbaab"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 508 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: \u0060warn!(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/tools/rust-analyzer/crates/load-cargo/src/lib.rs"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"7702d6ce7bebe50bef19f9aac20b1d2759ab6b28d5e206eda5414a27878310e7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 16 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: \u0060trace!(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/tools/rust-analyzer/crates/ide-db/src/apply_change.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bc95b279397b222993d960a8cfa1b042a3be92066c5be872c504583dbb5b420"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 666 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/tools/rust-analyzer/crates/ide-db/src/search.rs"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"34779be3c8447c6a4df8ce909e9c6a615cd768304f14f731a80293b62a024e24"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 717 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/tools/rust-analyzer/crates/ide-db/src/search.rs"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8d07efc0ab7739291080a6b8fa015537a374ae6b718f2be4ee3c3801b33e6ed"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 176 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/tools/rust-analyzer/crates/hir-ty/src/autoderef.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7888d0aa9b12b3410061df1205f34afec12d30a8cee667fbf331f17aacaf815"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 179 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/tools/rust-analyzer/crates/hir-ty/src/autoderef.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8aaede78278bef4b00bcd823e2618a6d5dfd39a7218541aaf13efe2b3a56a28"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 219 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/tools/rust-analyzer/crates/hir-ty/src/autoderef.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff139b5affdd9f2a3f06d409cc970d0c8cb1b796e6eeed5bf93072ab21bbb245"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 339 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/tools/rust-analyzer/crates/hir-ty/src/autoderef.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"649786c4484e5d926d6467f650cf7eabde72950f1d9efde249c709533b97ca45"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 363 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/tools/rust-analyzer/crates/hir-ty/src/autoderef.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec4815110b7919ec790271e7a4c60cd8428a9dfed2ec50c4663bec5cac079c69"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1157 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/tools/rust-analyzer/crates/hir-ty/src/lower.rs"},"region":{"startLine":1157}}}],"partialFingerprints":{"codehealthFindingId/v1":"2520e6281555888769dd2564d785f481f2783e032f3e85da4e46d66a625fbf00"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 154 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/tools/rust-analyzer/crates/hir-ty/src/method_resolution.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"519509e987516849ad6cddefff38840eeb9c7eb1121023dcb8f246cfed90f4be"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 289 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/tools/rust-analyzer/crates/hir-ty/src/method_resolution.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"669ac0b89150ac922b2dc194ba2cdf3ea68a2a35007b96c5afd3994610785ed0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 327 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/tools/rust-analyzer/crates/hir-ty/src/method_resolution.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfc1afec0d09a9241323a3fded7bbe4357d3328054d13b69d4caf93e19996216"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 341 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/tools/rust-analyzer/crates/hir-ty/src/method_resolution.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f4b3b619cb317a243fa10543c92d36079439503bbb52923a486f6eddf3775a7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 81 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/tools/rust-analyzer/crates/hir-ty/src/specialization.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ad44856eef1696345d4359fdf8dc781a25bf4dea5e8b645913197d1ad2cf448"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 117 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/tools/rust-analyzer/crates/hir-ty/src/specialization.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"32ac0eed8e407679f02122bbb534036423643214dcdffdd6cdbe82d7166f15dd"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 127 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/tools/rust-analyzer/crates/hir-ty/src/specialization.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffd2627198c15904e9bdf5c3ea849282ef7a64f00b913d9df65f35cc4c71d95d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 43 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/tools/rust-analyzer/crates/hir-ty/src/variance.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"bba421e15b60ff2c044040fd00f06714175a4e71294eabded44918d96281ec8a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 123 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/tools/rust-analyzer/crates/hir-ty/src/variance.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"787b65f744d4a9c866cc278d4feb348630839cce6a2b95160492a840e51c48c8"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 177 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/tools/rust-analyzer/crates/hir-ty/src/variance.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"adae5113f2f5ed69ee37e4384651434f87d5b23527611898a8f98fd9a7760ff3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 347 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/tools/rust-analyzer/crates/hir-ty/src/variance.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"36ada21f6a32a1f50d6d9b0a87d796c8b9dad8141ed7aa09985b04a6bd77f32b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 390 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/tools/rust-analyzer/crates/hir-ty/src/variance.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae54227078487e913bdbe8f8e1f09d7d327d6f6eb96a4bca812e5be4e45bf954"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1167 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/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/mod.rs"},"region":{"startLine":1167}}}],"partialFingerprints":{"codehealthFindingId/v1":"829b9f42f12a32c05e5e1b41a3f36d484d8bd23fe8cae53f24a5619afe0e79dd"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 183 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/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/type_variable.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"9099b62dcbc45ccdb1722827ca6bba821cf2e92a4c0160511106e4ae32b29410"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 89 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/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/snapshot/mod.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f76689f60459b5af9fdfb76266aa7bc2d0bf2593f293980ac1e88d028e6a657"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 134 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/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/snapshot/undo_log.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaa4b1ebfd75276f95dad45a27336b5e20b8af4ff00842e92e24e6bb7b98f513"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 154 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/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/snapshot/undo_log.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ebd2efc42913512aaaf4f885b56c1d4ff712c6f88f474d0bc08e941b48bce09"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 375 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: \u0060warn!(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/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/relate/generalize.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"21d6432d967347a132b39b7741be3418e890a8d3c2a66bb1f2eafabe0d2e1191"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 514 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/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/relate/generalize.rs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"b08a982095f7970cfe8e6ef6294808a7ce12ffdd07aa37a34cfe987dd857d2d5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 532 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/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/relate/generalize.rs"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"24159a54c8569a7e2d4c75fe1731e7e433208a3c7d908c0f9ea59912f4795eb5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 659 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/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/relate/generalize.rs"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f8798ca8d22bf0e1adfb5ac6d4423d70ec421d3c42090a1e67f58e9989cdf42"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 379 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/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/region_constraints/mod.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"83c4f0dfaf2ac45baf6ce49d5a0ff442dff9e66610c01e7a81bcf33d932f3e3d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 390 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/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/region_constraints/mod.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"d02a0242606b1fe2c2ffe03bec644f00837ae7efa0a891f28d8cab63874871dd"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 396 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/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/region_constraints/mod.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc1588b7b28b7612617642926818a868ba6ee64c09e99830cf36bdf657f3d441"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 412 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/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/region_constraints/mod.rs"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"93c7ee0970d6b4667e483e5ebfe44dda6e279626ae6f1f87cedc7b65b105d946"}},{"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/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/region_constraints/mod.rs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"a65e4ce274e2a94e3bf2c391a87198b00c2179c38f77cdfacd760dfcf3251519"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 428 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/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/region_constraints/mod.rs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"c65f971e841972995a3b399800fa81ea2178e993555b1529980dd6281e3b84d4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 476 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/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/region_constraints/mod.rs"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ffb116e2c37b63cb47ee4468a0c4afbd97ef8c2b57a6a4037d33bcedca8e48a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 495 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/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/region_constraints/mod.rs"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"732fd55644d8d0e3ff01ed3839207412b7426412c5e82e329c7e14a5a928dcc8"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 562 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/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/region_constraints/mod.rs"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"93d5b3d58654bafc267a48d36b9826777a4d36a85f1ef41d7c331797169d9109"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 174 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/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/canonical/canonicalizer.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1de3fed6b0941f6d5571388749dd7ade8db99d50f229a56ccbb1ed879546451"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 340 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/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/canonical/canonicalizer.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"6421452132e0c56ee4228c3ecbb40c9a5264da004459026a24a2c2ae4b2a29bd"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 344 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/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/canonical/canonicalizer.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"384f34c1fe0080d08e51192ce8e7ab90ae6d0443d1bb84a6184a017caacee7e2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 444 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/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/canonical/canonicalizer.rs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d13929554a1a5a8ce8772545de55661aeef737b748c694ce46142837bd94fec"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 447 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/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/canonical/canonicalizer.rs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"f97e1b8a148c32748107130087c83e395f3336877d825cabc432820aa7d01f47"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 286 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/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/canonical/instantiate.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c8baac0d4bd0d2d6bd0d41c9cb4215278dc96f0eba36e51f77d5a03d8ce2915"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 60 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/tools/rust-analyzer/crates/hir-ty/src/method_resolution/confirm.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"01b82ac3ba8dd8ef740e1d67229126f1261eb2994b9086d435e76f79d83a0690"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 110 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/tools/rust-analyzer/crates/hir-ty/src/method_resolution/confirm.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e363e977319557a6ac2ab90f6ff0bed122c296a6b92459a0f03a905f065a0ea"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 151 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/tools/rust-analyzer/crates/hir-ty/src/method_resolution/confirm.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6f48cbf57e7379d56ed40d8bd9874836c31e377cbd4c61ba67ad496c17d9d7c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 288 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/tools/rust-analyzer/crates/hir-ty/src/method_resolution/confirm.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec104b953baf79383c4f2ad2e8faaeccbac64e9b1fe160ed2f7d358836ec8157"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 486 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/tools/rust-analyzer/crates/hir-ty/src/method_resolution/confirm.rs"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"a884623a2834d4e8437b7e230d6ce89cdcb858cbd33d28a799595b8e39c2c79f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 511 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/tools/rust-analyzer/crates/hir-ty/src/method_resolution/confirm.rs"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc35e37dae438664eacdce31982b5f9b46f8e4e68c0461414071fb554d3e4b8c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 530 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/tools/rust-analyzer/crates/hir-ty/src/method_resolution/confirm.rs"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dec89c5d2d9c7048a3a36a6bf984cddd09c4f85faf6b665dc4c0166a2105dab"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 533 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/tools/rust-analyzer/crates/hir-ty/src/method_resolution/confirm.rs"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ef6b68dfc256e3fe185a8f67d62162c882f2be27151ae6b37104c444f22ca64"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 544 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/tools/rust-analyzer/crates/hir-ty/src/method_resolution/confirm.rs"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c9416ec5790e81530f865bc7eef60713db934ff4730a9186097194b01f5d62c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 361 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/tools/rust-analyzer/crates/hir-ty/src/method_resolution/probe.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"447223f2e7512a61d4a684dbcf641cdaf46fd0c45ae2a25caa978cfbced0dda0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 379 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/tools/rust-analyzer/crates/hir-ty/src/method_resolution/probe.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"b94b43b2065c49111d8ceaaf0ade15930dbceb8206a7c24ac6626920e22b1a09"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 513 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/tools/rust-analyzer/crates/hir-ty/src/method_resolution/probe.rs"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"dda2e8f75b4d2136cacc5dd993d3033d00fb9dc7be61bc6c61b772abd4829084"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1103 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/tools/rust-analyzer/crates/hir-ty/src/method_resolution/probe.rs"},"region":{"startLine":1103}}}],"partialFingerprints":{"codehealthFindingId/v1":"2849389bdecb3b08eb7a4f5f164369b0289ae98afdf832be1dc611bac4968659"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1267 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/tools/rust-analyzer/crates/hir-ty/src/method_resolution/probe.rs"},"region":{"startLine":1267}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a9681360e8cad57130717875eba86b4af2d674106c6f3189cf4e787282a5579"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1464 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/tools/rust-analyzer/crates/hir-ty/src/method_resolution/probe.rs"},"region":{"startLine":1464}}}],"partialFingerprints":{"codehealthFindingId/v1":"e366942badc2916e4e4d49bdd9cd115d5211edb2f8bf210bec7f15dae48f2360"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1469 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/tools/rust-analyzer/crates/hir-ty/src/method_resolution/probe.rs"},"region":{"startLine":1469}}}],"partialFingerprints":{"codehealthFindingId/v1":"8db91bf770f6082de6be948596fd6d9b4750fb1156ce997eada41d8191864234"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1503 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/tools/rust-analyzer/crates/hir-ty/src/method_resolution/probe.rs"},"region":{"startLine":1503}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e564029141f505340a81cc74fd087eaed90e493a94bb0760f9ce4d83eee7312"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1614 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/tools/rust-analyzer/crates/hir-ty/src/method_resolution/probe.rs"},"region":{"startLine":1614}}}],"partialFingerprints":{"codehealthFindingId/v1":"309218585dafc17e15ceac4f0c4f3ff9f9bc71bcc821a2a43188872572ffdc13"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1678 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/tools/rust-analyzer/crates/hir-ty/src/method_resolution/probe.rs"},"region":{"startLine":1678}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b1f7018514431d79467e641c6f98073d7d9288f663584e1bdef38e133ef5470"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1717 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/tools/rust-analyzer/crates/hir-ty/src/method_resolution/probe.rs"},"region":{"startLine":1717}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcaed2222a6b138ced7574dadfb9f46afdfad152952b4da944c681e23b3d0f6c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1722 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/tools/rust-analyzer/crates/hir-ty/src/method_resolution/probe.rs"},"region":{"startLine":1722}}}],"partialFingerprints":{"codehealthFindingId/v1":"a89eb5e5b68c991afc1000b4a8eec5e36e9f1acdf6849f367c4b7c76166980b4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1737 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/tools/rust-analyzer/crates/hir-ty/src/method_resolution/probe.rs"},"region":{"startLine":1737}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2541ade64c59e58d4dc2d63a4a6feade42cad0e411473e41cdf5e4bc2e0dd3c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 545 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/tools/rust-analyzer/crates/hir-ty/src/infer/callee.rs"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a4b934c83edd713ceb6e396db5808ea882b33865cb31d328e9e27cad93e270f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 564 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/tools/rust-analyzer/crates/hir-ty/src/infer/callee.rs"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"33a59926bb22cbe7fe7a732734b1bac3a6bae104ee18d2f2ad939be92d320b96"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1092 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/tools/rust-analyzer/crates/hir-ty/src/infer/closure.rs"},"region":{"startLine":1092}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba4c97e4a9f5a8f866d202eae12964c2dc2614512722b38038691f5662ac30aa"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1123 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/tools/rust-analyzer/crates/hir-ty/src/infer/closure.rs"},"region":{"startLine":1123}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b9cbdeb6ff79ff6ea61f2101fba3e3ec4cf6fb3c6a77f7b0c3b54f90baf76cc"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1158 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/tools/rust-analyzer/crates/hir-ty/src/infer/closure.rs"},"region":{"startLine":1158}}}],"partialFingerprints":{"codehealthFindingId/v1":"541831046fccc3ef57665a29941268bbb8268321e0e17545672f2d0ad91be43b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 160 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/tools/rust-analyzer/crates/hir-ty/src/infer/coerce.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"aff66de5dda2f313e5b96a2873b4a306493321a827d354b7a03aa3d3b40afd0f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 223 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/tools/rust-analyzer/crates/hir-ty/src/infer/coerce.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ea4758683a5f21cd2a8c0eadf39d51f4530ed3dc42cf7d71ae2876cb8d58005"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 311 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/tools/rust-analyzer/crates/hir-ty/src/infer/coerce.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"55ef11828cd364043c6b805ffff00cb17542fca532f0c3b15e8b1552eabb6d42"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 335 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/tools/rust-analyzer/crates/hir-ty/src/infer/coerce.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0570c415f6119939cd32805c58208760d8ae59865c24cc93a37f5880faac613"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 357 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/tools/rust-analyzer/crates/hir-ty/src/infer/coerce.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe597d8c5a80849aa0ee814252332473d0da2ad7bd993fe538ddb3f0f288d50a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 497 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/tools/rust-analyzer/crates/hir-ty/src/infer/coerce.rs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"418f46d347171d4a5d542e54325e9a446ef05860e13a350faa936eb82aebf11e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 534 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/tools/rust-analyzer/crates/hir-ty/src/infer/coerce.rs"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3d830b14514ad13aa55fa78d83383ec0ab4905a8a19954fecafd9f7dc9c37f3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 743 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/tools/rust-analyzer/crates/hir-ty/src/infer/coerce.rs"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc6efae15f20a2de60ebaaf9cc925804e4fba67f0c83b0898b7239dfdc85235c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 815 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/tools/rust-analyzer/crates/hir-ty/src/infer/coerce.rs"},"region":{"startLine":815}}}],"partialFingerprints":{"codehealthFindingId/v1":"288d279e5372fbb776714a6b66b7d661281853007306baedca28fcd65a196189"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 828 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/tools/rust-analyzer/crates/hir-ty/src/infer/coerce.rs"},"region":{"startLine":828}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f86a35258e591c1676df1424a9a662137499c9194aac39f4743ea4f84bb2e6e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 902 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/tools/rust-analyzer/crates/hir-ty/src/infer/coerce.rs"},"region":{"startLine":902}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dab1ae930ff11bd2bfb63e78e5ab03cafbc343fe03bf2156514e8de1c3bc59a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 935 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/tools/rust-analyzer/crates/hir-ty/src/infer/coerce.rs"},"region":{"startLine":935}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c16639339ec53ebf4ad6e758b75b3b10edf56b1d1c5cf3b006363f17ff1d43a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1100 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/tools/rust-analyzer/crates/hir-ty/src/infer/coerce.rs"},"region":{"startLine":1100}}}],"partialFingerprints":{"codehealthFindingId/v1":"e36dfb1fb8463dbbac711851dc1a4b952bc268d397ea765244ec0d1461e6a8f5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1119 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/tools/rust-analyzer/crates/hir-ty/src/infer/coerce.rs"},"region":{"startLine":1119}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d03f7b2d0be148f7810ed670f9650366ed72940c3d25cb4626c9e17d8b892a6"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 2058 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/tools/rust-analyzer/crates/hir-ty/src/infer/expr.rs"},"region":{"startLine":2058}}}],"partialFingerprints":{"codehealthFindingId/v1":"cac55fd6eec3c07b5d8ad2f49a7623ddb15151224a3919cf23ce4d81303528f6"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 32 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/tools/rust-analyzer/crates/hir-ty/src/infer/fallback.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d0e3686a9ebf19d1a314c154575c222c9c1c6182defb2bfc0047f560274fe41"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 40 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/tools/rust-analyzer/crates/hir-ty/src/infer/fallback.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b7a1e3e5664ad7c0f43f3c972c77874cec4fdc7c41b4d0a66ad1ff9e3321ae9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 107 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/tools/rust-analyzer/crates/hir-ty/src/infer/fallback.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"692a73f534e06602f3db5bb1abf71951c822579d9cb0dd6f05047f8781fa2f74"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 160 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/tools/rust-analyzer/crates/hir-ty/src/infer/fallback.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9b2bbfaddec56d5f0cd548cec59b288be3b61a910ee1899277b89a3a82456bb"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 238 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/tools/rust-analyzer/crates/hir-ty/src/infer/fallback.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7d53ef18fd4532b9db80a8e33a047901577e4056f2c064b1542e59d9cf9bd01"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 262 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/tools/rust-analyzer/crates/hir-ty/src/infer/fallback.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"f515ada881fb9a2987ef834244d16fd97ed55bfbea04365f478c63defbb0c4f0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 266 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/tools/rust-analyzer/crates/hir-ty/src/infer/fallback.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"91ad9c27c4d4e0cec34f2b5814d810faeebc1b04507eaef6331f19fd242cf6b6"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 277 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/tools/rust-analyzer/crates/hir-ty/src/infer/fallback.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c361353943c20efd7daa4f48b32493a11ab0adedcc3dba397012f1f5d853982"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 294 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/tools/rust-analyzer/crates/hir-ty/src/infer/fallback.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fa40e626ce507ba3c990bfd7753776d6b722ca589def73dc47e67e30283aaf8"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 312 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/tools/rust-analyzer/crates/hir-ty/src/infer/fallback.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fcb973baa8abfaf0dc283941b8041e36655b8344459ebd61ec841c4ff56dc3d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 317 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/tools/rust-analyzer/crates/hir-ty/src/infer/fallback.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"f366571c6135cb6f557608182127869cae8a4f7e7509dbac7956e58cbd83502b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 338 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/tools/rust-analyzer/crates/hir-ty/src/infer/fallback.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"7761a215c20eaee79f313da7935a1041973c413b207070c8c41a91c47085a789"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 373 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/tools/rust-analyzer/crates/hir-ty/src/infer/fallback.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"507e08a0c6768967e6938317ec5be97fce1dc27a6997ff7658dca2042b4d755c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 376 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/tools/rust-analyzer/crates/hir-ty/src/infer/fallback.rs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"17b7565eb61567b9b4c71e861d649a649dfe0e05923a0e57a6c5bec0001e15c2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 381 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/tools/rust-analyzer/crates/hir-ty/src/infer/fallback.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfe27d2ac6eef80a654bdd6eaebcc47843f820a3814aee423fa7d159447a082c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 398 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/tools/rust-analyzer/crates/hir-ty/src/infer/fallback.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"29b1551c6039d7db652ee86ba5e16e7e32aefec654b90a2266747a8f72306dce"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 59 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/tools/rust-analyzer/crates/hir-ty/src/infer/op.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"41ed446baef7db9c7be89d444e17677f508e61a3e9bd26877312a43e60c56a6f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 165 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/tools/rust-analyzer/crates/hir-ty/src/infer/op.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b64f0b0a59beaeeb137df7c31ce21a2d991ca96bfbae6f395e2e6b50686c35a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 296 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/tools/rust-analyzer/crates/hir-ty/src/infer/op.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7bb368e044c761c7395b3a81a6ad336e1f7e0bbc064afa58ce0f735781f7744"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 410 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/tools/rust-analyzer/crates/hir-ty/src/infer/pat.rs"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f4fe1a1a5e2b3100ee34fca12f6ea3aeef00041ef6203a8dd074a76bf2979d0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 432 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/tools/rust-analyzer/crates/hir-ty/src/infer/pat.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b3473dee9b0c7ace6b19e2fe4ccc1fad6734f3abbf7d9941abb2d9166e78d4f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 562 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/tools/rust-analyzer/crates/hir-ty/src/infer/pat.rs"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"542cc6fc1a91303411fb8731d2ee11043774c3a3ab093104c78ea824b70a5e0d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 921 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/tools/rust-analyzer/crates/hir-ty/src/infer/pat.rs"},"region":{"startLine":921}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dd5f768fba3aa3e3fa5f396e3e28de890e2cda17ff9d72a7f96f62d1dbaa26a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1491 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/tools/rust-analyzer/crates/hir-ty/src/infer/pat.rs"},"region":{"startLine":1491}}}],"partialFingerprints":{"codehealthFindingId/v1":"1171f497f894a6588817e93e870a3bba8a31b216b58577d74baf040355075f94"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1506 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/tools/rust-analyzer/crates/hir-ty/src/infer/pat.rs"},"region":{"startLine":1506}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f1d9490a47e0264b83a1ec4b7f13e1546cdd5d5de36972865a44039ebfdf2e5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 115 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/tools/rust-analyzer/crates/hir-ty/src/infer/place_op.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9c899fc82a300cb2b2a78ba5e28211bbba437528ae1dd75df6fedcaeaf6b6e1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 195 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/tools/rust-analyzer/crates/hir-ty/src/infer/place_op.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f4abf9ce62e1b882a2524ea52e94f9c6c2325567e8bab01c08bac7dc55ae924"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 225 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/tools/rust-analyzer/crates/hir-ty/src/infer/place_op.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"04b4fb0c8b9293cc6bbd62af20ac032a01519a269c469ff65644e10d67ac50f2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 258 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/tools/rust-analyzer/crates/hir-ty/src/infer/place_op.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"085051c958d06dc82089d07fece6cfb3d9b72505d898c135dc207e74fe2cae74"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 295 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/tools/rust-analyzer/crates/hir-ty/src/infer/place_op.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"c552cf2203479d1784dc1ecb9157239b29d505350689ccee8bda12488da2be6e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 312 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/tools/rust-analyzer/crates/hir-ty/src/infer/place_op.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"f91fe89da873b3d6647b94abf782e76d65e77167bcaf8dadd79bde90a1d42015"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 359 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/tools/rust-analyzer/crates/hir-ty/src/infer/closure/analysis.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5b8605b1921c0064d2c8fac7c334b061d13f821beb51411a07fe0c890af79f9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 381 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/tools/rust-analyzer/crates/hir-ty/src/infer/closure/analysis.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dfc6d6430c0f3726a4f2b81f47fdf44f01271cc1e4f85d185dfdbb3ac272cb8"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 863 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/tools/rust-analyzer/crates/hir-ty/src/infer/closure/analysis.rs"},"region":{"startLine":863}}}],"partialFingerprints":{"codehealthFindingId/v1":"d78cc6a81672c79d9e4f5b41728cf4d1c2c5f750d4f6c0754d7a415c33b1e056"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 918 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/tools/rust-analyzer/crates/hir-ty/src/infer/closure/analysis.rs"},"region":{"startLine":918}}}],"partialFingerprints":{"codehealthFindingId/v1":"8257f334b2ff37e0addf9d6cccd9bce385059ff7a25e12e600cdbb199c2e4198"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 432 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/tools/rust-analyzer/crates/hir-ty/src/infer/closure/analysis/expr_use_visitor.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"2973878231802b20ed913da4534e48909921177b262ed7e530bfbce9e70f601e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 806 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/tools/rust-analyzer/crates/hir-ty/src/infer/closure/analysis/expr_use_visitor.rs"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a0f465be9c471c470086127242edee8c45ef60defe5c1686d9d607d1d36986c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 839 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/tools/rust-analyzer/crates/hir-ty/src/infer/closure/analysis/expr_use_visitor.rs"},"region":{"startLine":839}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f5e2ea597baba069855df4bfe9f824faf558a32bcaee1ad64b50f1a9d5af011"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 847 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/tools/rust-analyzer/crates/hir-ty/src/infer/closure/analysis/expr_use_visitor.rs"},"region":{"startLine":847}}}],"partialFingerprints":{"codehealthFindingId/v1":"22a3749c06535240bf53b3237e6c35aff5b9407f7785878d813aebd111575f89"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 900 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/tools/rust-analyzer/crates/hir-ty/src/infer/closure/analysis/expr_use_visitor.rs"},"region":{"startLine":900}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eea674f9b77e6ab95921d2c433955aa3df32dcf95d0280497f3d5c92369554e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 906 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/tools/rust-analyzer/crates/hir-ty/src/infer/closure/analysis/expr_use_visitor.rs"},"region":{"startLine":906}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c0a4706a43fc8f0b3fa934fce70ae7cd8764daec7cf7cffa4bbe28cb62b7ffc"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 916 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/tools/rust-analyzer/crates/hir-ty/src/infer/closure/analysis/expr_use_visitor.rs"},"region":{"startLine":916}}}],"partialFingerprints":{"codehealthFindingId/v1":"632600b0a269e4a7c7faaba064ccd917cf3531ddbe838d364ab8d7be1d9e60fb"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 918 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/tools/rust-analyzer/crates/hir-ty/src/infer/closure/analysis/expr_use_visitor.rs"},"region":{"startLine":918}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f6dfbcb9efa06ad55f97c58f918b4a9cea989648b2731744f60ea20566902c2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 922 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/tools/rust-analyzer/crates/hir-ty/src/infer/closure/analysis/expr_use_visitor.rs"},"region":{"startLine":922}}}],"partialFingerprints":{"codehealthFindingId/v1":"30f01402be44b548bf842559297633b0cdb91da098d048784fd40b67f8d26d2d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1199 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/tools/rust-analyzer/crates/hir-ty/src/infer/closure/analysis/expr_use_visitor.rs"},"region":{"startLine":1199}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f304cb23ea0baed29a12e2c86db85abccc0daacdd6c033999e3158c5045b4f6"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1233 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/tools/rust-analyzer/crates/hir-ty/src/infer/closure/analysis/expr_use_visitor.rs"},"region":{"startLine":1233}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fa031c70b431d382c9991c9b19db26613138c2bf0b6e5efb0eac5d3fc0800d6"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1459 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/tools/rust-analyzer/crates/hir-ty/src/infer/closure/analysis/expr_use_visitor.rs"},"region":{"startLine":1459}}}],"partialFingerprints":{"codehealthFindingId/v1":"c119d4ca3a47b2c61abf5c0b015e17401e90c342c32d73311e14b1fc656494ac"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1540 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/tools/rust-analyzer/crates/hir-ty/src/infer/closure/analysis/expr_use_visitor.rs"},"region":{"startLine":1540}}}],"partialFingerprints":{"codehealthFindingId/v1":"967b32d4317412856e143f9ceccd53bc47d0a8e22f2ff0f5969410b2557713f0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1559 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/tools/rust-analyzer/crates/hir-ty/src/infer/closure/analysis/expr_use_visitor.rs"},"region":{"startLine":1559}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1051a3b65679b4fe532a0ca928b998688a892d3e384e615c41f4894b1b98734"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1662 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/tools/rust-analyzer/crates/hir-ty/src/infer/closure/analysis/expr_use_visitor.rs"},"region":{"startLine":1662}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef346a02a2b239ec45a33e704c6dc730211febc9392014cd3c097ddb94b40fc2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 379 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: \u0060error!(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/tools/rust-analyzer/crates/hir-def/src/attrs.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4fd4e0bc60919e0a2a51e345066482c0c54157191c0711e61fd6018bd91864f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 357 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: \u0060warn!(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/tools/rust-analyzer/crates/hir-def/src/find_path.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"f02acf57bfac09dff8496aaaaa74f4842ea717f8aa25e4d2ee022ec215084dc9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 165 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: \u0060trace!(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/tools/rust-analyzer/crates/hir-def/src/lang_item.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"187da94c808efa8ac1694d20dcb7077c92707f1fd603b1843c908f3242a449ad"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 76 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/tools/rust-analyzer/crates/hir-def/src/nameres/collector.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eefc997990713ccf0c0107562f0578f7708fa2ed8789072c0967ad347a85f4e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 590 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/tools/rust-analyzer/crates/hir-def/src/nameres/collector.rs"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"b52cc393fdc2caf3d61045c8a0b6853fad01125f6e806d163398d0fd91414434"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 849 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/tools/rust-analyzer/crates/hir-def/src/nameres/collector.rs"},"region":{"startLine":849}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ac83a83a32002042610fac031158caa323f965b8cca4ded19ac7fcc20be6c64"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 923 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/tools/rust-analyzer/crates/hir-def/src/nameres/collector.rs"},"region":{"startLine":923}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff901cc5a3eb0921c06c3b9ec6f472a411c99af269a877ee3d4ea8c1d1b3e715"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 950 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/tools/rust-analyzer/crates/hir-def/src/nameres/collector.rs"},"region":{"startLine":950}}}],"partialFingerprints":{"codehealthFindingId/v1":"29c03ceaed70c23ba4b82c3b7fc9baecb9b002f7e48fa18ce513b882df7ec080"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1089 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/tools/rust-analyzer/crates/hir-def/src/nameres/collector.rs"},"region":{"startLine":1089}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e3ccc6605ab9334e9342581f2c5a483816f01e247f21d5d0bb0f11f7c8cd90b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1092 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/tools/rust-analyzer/crates/hir-def/src/nameres/collector.rs"},"region":{"startLine":1092}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fa3d7e5039b971144833b7aa2d92caf2ace85136624ae7af52ec6ab7f1190c3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1140 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/tools/rust-analyzer/crates/hir-def/src/nameres/collector.rs"},"region":{"startLine":1140}}}],"partialFingerprints":{"codehealthFindingId/v1":"b94e2fc09daab012b16afdd000f878c245d09c07efea2cf74cc684fe15254a3e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 2487 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/tools/rust-analyzer/crates/hir-def/src/nameres/collector.rs"},"region":{"startLine":2487}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce0a010addf677a03b045a41553e35211b6bcd12793da2a10b160773080bb1fd"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 134 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/tools/rust-analyzer/crates/hir-def/src/nameres/path_resolution.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0f82f95de28928fe75ef125ee07b56034a3b48afdd8b2f4b55ab244dd924baa"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 277 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/tools/rust-analyzer/crates/hir-def/src/nameres/path_resolution.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"781b4843ee12befcb25876648d8a69e529128105a1be0560f65553c550061098"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 299 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/tools/rust-analyzer/crates/hir-def/src/nameres/path_resolution.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea99455f992498a5518bd082d3d9cad0d3c7a5d5acf5fdc099e02d672f765856"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 392 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/tools/rust-analyzer/crates/hir-def/src/nameres/path_resolution.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c318726e5ad4ac33ecdc5943a8f12c154bb75cc21969f1995537f05edb458e0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 400 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/tools/rust-analyzer/crates/hir-def/src/nameres/path_resolution.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"183e0690d1d7c32305c7afd8e9351785187c9c74c76c26addddeeb14dd0f199e"}},{"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/tools/rust-analyzer/crates/hir-def/src/nameres/path_resolution.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"943e1a6c990a9e215ea6db27893d03e035315fefd572f8c8168e467a32e09c4b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 480 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/tools/rust-analyzer/crates/hir-def/src/nameres/path_resolution.rs"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"b536c5def76e82cc3b852078dd66fc896a32d99df20657de08bca5313ea6e4c7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 596 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/tools/rust-analyzer/crates/hir-def/src/nameres/path_resolution.rs"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"184ad6ca5531b198000affdb159b6152415b83e72b7ad746d12c791744e9643a"}},{"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/tools/miri/src/concurrency/genmc/mod.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"c09a400b8beaa179a19e6092f4b7baa08e2ecd83b6d9ecf6affcff242fa450a8"}},{"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/tools/miri/src/concurrency/genmc/mod.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"d29ed4621835ae82405d493b4e65e7f141c26105f064be8688b6f56eecf94a3f"}},{"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/tools/miri/src/concurrency/genmc/mod.rs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"b599926cd5e826270f76f1ee09cdba0f57bc0bdd09e210100db1b9bdc940e637"}},{"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/tools/miri/src/concurrency/genmc/mod.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c20e7639a95a0dc5fe5e3972fe05dfd3a2df213f62ce518bb3e6ff287294215"}},{"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/tools/miri/src/concurrency/genmc/mod.rs"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2efd3f596c7ae2ae3d2cfe787ff83f1200f2f350c8dd8525b0c1add8a280238"}},{"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/tools/miri/src/concurrency/genmc/mod.rs"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"68adbaf9a5be6564e1bfa1be1bd1c2cc3dadf67308070bd3da043fd3b1aa0b8d"}},{"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/tools/miri/src/concurrency/genmc/mod.rs"},"region":{"startLine":658}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6ad7ee42ec2e2201177bf1dc95ba1de0461a7145081b08ca6a5ef0e0e7b9795"}},{"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/tools/miri/src/concurrency/genmc/mod.rs"},"region":{"startLine":671}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4a6c1f9d20211a08efaaf52d477b51246cbd52d40a12bbe349a98582dabecf2"}},{"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/tools/miri/src/concurrency/genmc/mod.rs"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f4a1d3d3f21f3304345d3a02431712b528cbf94355445265be00fdff4ce135b"}},{"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/tools/miri/src/concurrency/genmc/mod.rs"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd643ba8761482af1bf6905dc2d8ee874210f3383db2421d452d299e69215844"}},{"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/tools/miri/src/concurrency/genmc/mod.rs"},"region":{"startLine":744}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d85dc9ca7d3900e3f80487b1fb8cc40366ddd6b8cf6c5d3393036ae82298eb1"}},{"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/tools/miri/src/concurrency/genmc/mod.rs"},"region":{"startLine":783}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e0ee8a97f387873fd2dd6158905d7c28eb43b86cc7d15450cd07a6ab33c7461"}},{"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/tools/miri/src/concurrency/genmc/run.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca733b8c6e30672cbda336c90b2ac54110405d1bee1ca29176c47c2fb6950c24"}},{"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/tools/miri/src/concurrency/genmc/shims.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"2301fe62608dc7e745deaf61b0951f14afef9e3268fcd6db1ff17ceb9c9dd7d0"}},{"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/tools/miri/src/concurrency/genmc/shims.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"e06bb02e5ad5cd37947efc033e4c0942a7d98ef81f450fc5f255d684f278bc73"}},{"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/tools/miri/src/concurrency/genmc/shims.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"313caef1219c69fddce8ce1a16f47db205cedaabdfc03546846b8c66f33c6f6b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 63 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/tools/llvm-bitcode-linker/src/linker.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d7848236097ace13b991b84a2cda02b60c2c558eb5c724f1463a7041e2dea1b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 74 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: \u0060error!(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/tools/llvm-bitcode-linker/src/linker.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"70b88e3798c6c146473ba042071148b28488c3accb16417cab83bd1a5a5f94e8"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 98 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/tools/llvm-bitcode-linker/src/linker.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"77b0785bd80c3d44b6620a3f0c8cba90a357a295b0e1789c920cb0ca40ec1115"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 116 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: \u0060error!(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/tools/llvm-bitcode-linker/src/linker.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"3963702128fbe10e03be7175a28d3acde934d8c8d0e8bb5287c53d7681544dad"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 149 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: \u0060error!(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/tools/llvm-bitcode-linker/src/linker.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a70700031c29692e9a9fd23b6b5e7f22974f3626b8e729b4243a13383cc9348"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 650 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: \u0060error!(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/tools/compiletest/src/directives.rs"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"de7918df47e8b15bf3522d2818155634abacc8ec706260c719d566b2ec32fa8d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 685 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/tools/compiletest/src/directives.rs"},"region":{"startLine":685}}}],"partialFingerprints":{"codehealthFindingId/v1":"f034fb0b94ba78c8027f4ad73fb30688f8edaeb3cef28a6f0d680734019bb267"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 689 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: \u0060error!(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/tools/compiletest/src/directives.rs"},"region":{"startLine":689}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e7509a534daf31075c2c012f153f3d0a442d833dc0eb20439829ffda691a3c7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 949 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: \u0060error!(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/tools/compiletest/src/directives.rs"},"region":{"startLine":949}}}],"partialFingerprints":{"codehealthFindingId/v1":"6281daa2e3abe9267048c0d10d82374dd046f96158de8615806c095414433dea"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 186 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/tools/compiletest/src/errors.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"c57647d475ec143f2fb20bcee994ade141bc258665073bd83a99e05ddb30144b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 180 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/tools/compiletest/src/lib.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"c83f2754ded5a5b944e6fd8af816e63c630853ff85ce53129cb49bd36f11d4bf"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 136 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/tools/compiletest/src/runtest.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd61e02423341dd8ddf2d994f946917a245b5a81dcc595db0cc89849b971f2e5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 522 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: \u0060error!(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/tools/compiletest/src/runtest.rs"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"e56f0fc9329a006c570d18ee1eb8e64b78a723ce0e2f87ddfe68b0e5480fd738"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 529 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: \u0060error!(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/tools/compiletest/src/runtest.rs"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"eed04b3c94a057f7d498749ad14b90f314c6fd91fe2e4c28dc5b96845c58b210"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 650 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/tools/compiletest/src/runtest.rs"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8acf02fcc7517050deaa32b5d0207fa004ad2b447829b85e1090a0c55ee462d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 677 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/tools/compiletest/src/runtest.rs"},"region":{"startLine":677}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9edd85c8d2c96aed46e261779e85a8c460042f0d9c972087f07724c9f2493a5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 695 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/tools/compiletest/src/runtest.rs"},"region":{"startLine":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8f035384aac526ab42cca9f959b06a9149e338fd42c98a84c508dd30ec2467a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1817 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/tools/compiletest/src/runtest.rs"},"region":{"startLine":1817}}}],"partialFingerprints":{"codehealthFindingId/v1":"a216ea970683852124515e429bbde270654498ed465ac7b0cf95a6053c820714"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 2244 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/tools/compiletest/src/runtest.rs"},"region":{"startLine":2244}}}],"partialFingerprints":{"codehealthFindingId/v1":"72296c3e5e9ea80bab14f63262e40a2fc1926c30bfd8abf3bee469d574303476"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 2264 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: \u0060error!(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/tools/compiletest/src/runtest.rs"},"region":{"startLine":2264}}}],"partialFingerprints":{"codehealthFindingId/v1":"4270ac0334b066e4fb839be58d20b70207821a5a799e59ac17b509e3637f2003"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 81 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/tools/compiletest/src/runtest/debuginfo.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe86166d1a6b0f67c64f952cf23ce47ee3247d664637bc61322d7d6226ff8e55"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 153 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/tools/compiletest/src/runtest/debuginfo.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"b51e4bd7c4b74016827bfb1bb7b1aa44cc4e0325db880fad7db115136b5fccb8"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 183 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/tools/compiletest/src/runtest/debuginfo.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aab727ce3fd4890ec1fe4f23573a939a5815427234381b7b0c658aae1f3a294"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 322 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/tools/compiletest/src/runtest/debuginfo.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bd1fd597bc05a3e749bcc9bc930bf621b2886bb44a0240ed651469bcb3ffdb5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 463 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/tools/compiletest/src/runtest/debuginfo.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5842f2b3553960796eed2fa9749f991439121f95999fc7ff05742d6cb3b1573"}},{"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/tools/compiletest/src/runtest/mir_opt.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e2214781d8f7707e40ca1c7ceb21b25e2209454db4a0ea0a73841d4281fc7ef"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 103 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/tools/compiletest/src/runtest/mir_opt.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d2bf3cbf52f38ae6d0309d3e02fff0751b1dfe791193a90150745542c1ffba5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 126 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/tools/compiletest/src/runtest/mir_opt.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ad313f00a7c716478b10a27787ff8479a137df9fa39a27e070d54303ef56a3d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 82 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/tools/compiletest/src/runtest/ui.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"a74fc9f1af715c97a423f5b64dcf211a59715462df638271db33b7c6d542a200"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 234 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/tools/compiletest/src/runtest/ui.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bca605565e8620111eaad3c247dd33f7a93f94f783908c354cb1469249394df"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 282 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/librustdoc/calculate_doc_coverage.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ee11237341a1802fe826d9be25c20bd8db7c84733e340b62613434c32426c34"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 883 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/librustdoc/config.rs"},"region":{"startLine":883}}}],"partialFingerprints":{"codehealthFindingId/v1":"9759e03df5add20a938e4aa73a3a13f8d21ae026b2d1fab411e569e85294cd09"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 336 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/librustdoc/core.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfef147b19a70f1893e14f06caebf3f67af0b88f354b510ed7dd5aaf4112b365"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 480 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/librustdoc/core.rs"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"176b8d281bff7d9180613be0daf82ef816dd91412d402dfa7d26977da4574d4b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 412 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/librustdoc/doctest.rs"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f092eee1e2fa1a2060a0e6df631427585e45f74a69776c0e8ada5c792c8ac31"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 724 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/librustdoc/doctest.rs"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"64c30a4db2cbc33052a78468904c4d1972624a2f46fd8264a2faebb12c0b4c4b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 791 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/librustdoc/doctest.rs"},"region":{"startLine":791}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ff75c32e06787d2967c7e0f463947631ddd021386950b4e048d8903dbf54a09"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 891 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/librustdoc/doctest.rs"},"region":{"startLine":891}}}],"partialFingerprints":{"codehealthFindingId/v1":"10f67a232b3ecbb18dc103501127530e946bc6e4bc3468bc02a77305b5d06d05"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1144 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/librustdoc/doctest.rs"},"region":{"startLine":1144}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ad24498d581cd3c95c2fcf529abbe8fb67a86021c1e1d2e049ea2a854d99acf"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 150 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: \u0060trace!(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/librustdoc/scrape_examples.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ef08917b9a3aecd07f5e8e5daa323624f672d8b900fc00d276a83e26dceceef"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 157 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: \u0060trace!(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/librustdoc/scrape_examples.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"f226be6fb11eaba5ac470d5231277c6b700db7590de7f69583d1bfdc99021c70"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 177 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: \u0060trace!(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/librustdoc/scrape_examples.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcc71b74bd23b4e515233d5a8f58fecf8f0cd90b9acb65ca601884892c5810d4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 185 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: \u0060trace!(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/librustdoc/scrape_examples.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a8a89bc661f7c2e1c4a0c7fb55b52484c18eb1f1df870b5ce1fa79745377138"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 192 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: \u0060warn!(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/librustdoc/scrape_examples.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a55318e500bc7592816e6aea8c3b1529f60585b53bf2025e2a6359c103542ed"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 201 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: \u0060warn!(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/librustdoc/scrape_examples.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e88e51a978b5584a5d1379fddd775a1b155270905881961e28c309a3d336a9f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 211 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: \u0060trace!(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/librustdoc/scrape_examples.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"884a2a082aaf71ef32aa5e36a9c821aa26f2e80ef517a0e4b75d94fdfb587282"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 226 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: \u0060trace!(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/librustdoc/scrape_examples.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d954c50c1d6c24746de50b7b392bc3f8bc9fd3e12c603f4629a4ef630d3d98a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 236 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: \u0060trace!(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/librustdoc/scrape_examples.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d3f2ea9568694b2fcbf82a14b550fdc1a41ee0e02a6211b4a6595b9865d9ef6"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 255 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: \u0060trace!(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/librustdoc/scrape_examples.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b48cc7d6e90a60d6f9d493df0a221b6bacc9ab21338ebc8480a94e4a99d10bf"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 262 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: \u0060trace!(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/librustdoc/scrape_examples.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a140b80d7a9597fb8afa238efab13bda52dda439f1f20584a600daee21347a0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 303 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/librustdoc/scrape_examples.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"2134275acfcbcb2fd85b1afe0cb52d3cef488dfd5982abc71fb044b58bd14118"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 304 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/librustdoc/scrape_examples.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d040b9600749eb2b8a1ee5d8d30c34b341dfb53b7b30dea9d22578ecad6e5e3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 636 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/librustdoc/visit_ast.rs"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1d93b62e3274d4096dafa4547fe847e064804894cc9308c5ad288e5c45d20cd"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 305 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/librustdoc/passes/collect_intra_doc_links.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ae95e6f406f2e347c996a37f35a41c59492e8506a4000c2c098620dc3f9cf86"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 389 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/librustdoc/passes/collect_intra_doc_links.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"571d08f64fb67e49568bc49344da9f0ba6df8d267a8e0b631ebeda5c12eebe04"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 432 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/librustdoc/passes/collect_intra_doc_links.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"84ce71916a9d4c2d52d85f4cc85e4b7b7e3f854cd90f21167a0c60fd6f968e5e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 698 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/librustdoc/passes/collect_intra_doc_links.rs"},"region":{"startLine":698}}}],"partialFingerprints":{"codehealthFindingId/v1":"eed25107f1612325844b78c0888169618992d8adae7427f7bef79520379f0a71"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 751 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/librustdoc/passes/collect_intra_doc_links.rs"},"region":{"startLine":751}}}],"partialFingerprints":{"codehealthFindingId/v1":"113a274069ecc356117e7345d099233b5046d24da5079e8e62b7508b65a93b2f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 766 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/librustdoc/passes/collect_intra_doc_links.rs"},"region":{"startLine":766}}}],"partialFingerprints":{"codehealthFindingId/v1":"37ddd62160c6b82cd496103f94e222de2b696668eb731d56ccc2571ebb8e5cf8"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 771 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/librustdoc/passes/collect_intra_doc_links.rs"},"region":{"startLine":771}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9464130658918627dd4eb361d58624c879b0271cf559f53b1d29e5b0b54edea"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 799 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/librustdoc/passes/collect_intra_doc_links.rs"},"region":{"startLine":799}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef4eb6a191585931574c28a9f943946765234d7dcf263d52fc22c3a42e2b12ae"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 812 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/librustdoc/passes/collect_intra_doc_links.rs"},"region":{"startLine":812}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aca95a780837c8d82557d3e467f7a91edeaa8fe510ae2de4abd5f556ca4f931"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 856 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: \u0060trace!(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/librustdoc/passes/collect_intra_doc_links.rs"},"region":{"startLine":856}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0aa7ee155bcd6c66f2ddc6f73f09582a2dfc1555c5c0384ebe841b2e522106b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 868 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/librustdoc/passes/collect_intra_doc_links.rs"},"region":{"startLine":868}}}],"partialFingerprints":{"codehealthFindingId/v1":"f48f7b71f92b6727a9eefaca682925a1cc63cd3d6563f74e51eec393beb0bbe0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1050 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/librustdoc/passes/collect_intra_doc_links.rs"},"region":{"startLine":1050}}}],"partialFingerprints":{"codehealthFindingId/v1":"b946019cc3fe23740d4a66d1a054897583d28cb81cd4e011eeae89031ff975ef"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1150 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/librustdoc/passes/collect_intra_doc_links.rs"},"region":{"startLine":1150}}}],"partialFingerprints":{"codehealthFindingId/v1":"906698c00862710df3f507fe64a66732ee6b696bd6e6a0c19f4c10c9ae5a05fc"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1174 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/librustdoc/passes/collect_intra_doc_links.rs"},"region":{"startLine":1174}}}],"partialFingerprints":{"codehealthFindingId/v1":"70b8ecc0691b0d75050d28d17bc43401b6f196150b25daee42cd9b12a1bae035"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 1217 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: \u0060trace!(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/librustdoc/passes/collect_intra_doc_links.rs"},"region":{"startLine":1217}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee70457942fb4c4ac232ba162e87650e7d99802bd0be5fff9c901e4f196671a6"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1460 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/librustdoc/passes/collect_intra_doc_links.rs"},"region":{"startLine":1460}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e65c523ec9aa9ae6f68ec70ab053d54fb0cab4ab953bbb4bf28b781eff99f1c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1463 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/librustdoc/passes/collect_intra_doc_links.rs"},"region":{"startLine":1463}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d680f246929a18e1dbf4243f98897886c268d214f9f011685c16ee9b4b10dc0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 1971 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/librustdoc/passes/collect_intra_doc_links.rs"},"region":{"startLine":1971}}}],"partialFingerprints":{"codehealthFindingId/v1":"05985f95c7c34b14a34a0796faec3aa10a6b92a4b4ae6fb678538577503c3082"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 2188 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/librustdoc/passes/collect_intra_doc_links.rs"},"region":{"startLine":2188}}}],"partialFingerprints":{"codehealthFindingId/v1":"f442a267c6abd2fe539073c55da11f514988f5e3b369624b554b315423fa434b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 2682 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/librustdoc/passes/collect_intra_doc_links.rs"},"region":{"startLine":2682}}}],"partialFingerprints":{"codehealthFindingId/v1":"060aeaa5a5de23b637ae254aa6ee78e675560f8e97776e5f2340ce764affddc4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 48 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/librustdoc/passes/collect_trait_impls.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8c250316d9ee0c8c1b4c59904d8a656a8e881b8c874049bd0557aaaef5b32e8"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 33 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/librustdoc/passes/mod.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"8db961b18965911cd068037c433f896fb70f7f740aa813a0e386dea4e69fceed"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 155 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/librustdoc/passes/strip_hidden.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"945591eaa4e583c06333bf0e45e1f03c0bfffb1d50dfa774f2c5c3376c7ea048"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 47 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/librustdoc/passes/stripper.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"2da91ea45be3efdec7c42479d0d75e907bac8e9d8890e00d97b92882ef1749b2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 77 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/librustdoc/passes/stripper.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d7a95d86ff950f0711708d1289d289bdcdc7f784b1885a9b8573f7b682331ef"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 89 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/librustdoc/passes/stripper.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb5f2360352b576187658ff11811dc30f26c6dc7944bdc8612a3c8897b8357d2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 109 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/librustdoc/passes/stripper.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"84cada6f05c2b4f5b2a545a261c365af76c9413f92f6da265e294568fde3e8e3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 227 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/librustdoc/passes/stripper.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"2662a5ca4ad275b887b88bf894e90077dbc5fa06f5256f7d12a6726af2e5618b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 230 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/librustdoc/passes/stripper.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"857cdae7405ba980e8fa18eafe943f993d4a9436eae290f87526820e0fa7ef0e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 241 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/librustdoc/passes/stripper.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"18a989b2f9113a5678818aa1d8d7a7e3ac7d655c99eb1e3f65ada2db9afd200d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 247 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/librustdoc/passes/stripper.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"b38fd46229121af08213c9002b5b50f9f1af7d35af679334ae91664e5d971d53"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 255 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/librustdoc/passes/stripper.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"acd8bdd6d7f5ef3c8d46e865dc3c5059bd9c4837f96cdc30b3c43ff6f326db78"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 290 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/librustdoc/passes/stripper.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"f95f7f5a8dc75ef2a80344499fc8d0a922919d29055055a297656e48c6f237c8"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 297 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/librustdoc/passes/stripper.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"b241d2bba6155de175a28e7dff1605f8f6a0d13d415834d9597106c24dadccb5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 96 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: \u0060trace!(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/librustdoc/passes/lint/bare_urls.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cfe4b0018a4d88b72395cb556dcebee47fbdcd087fc7fff61cc2718ae096f1d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 252 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: \u0060trace!(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/librustdoc/json/mod.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"0758e366805ce80e8330dada614640fb30fdfdf8fdd5e3c2088739f3ff14f48d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 320 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: \u0060trace!(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/librustdoc/json/mod.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"45c2abdef1ade3b8d9689f8de1c76c485ca05fe9448b635c21425f2a33e0664d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 326 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: \u0060trace!(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/librustdoc/json/mod.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d3e1cd8dee97820b63f54c25a80f13c662c19fbf1e09308b87d5f0ab36937a8"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 365 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/librustdoc/html/format.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd2bd5a95aa116b7b0e91b5a73a1239a734558165fa51013bcaed9a680492344"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 407 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/librustdoc/html/format.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab0e75b8bde4de39ae8eff36c092239f62b87a32dc9142d102c2318cefe9ed5e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 1122 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: \u0060trace!(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/librustdoc/html/format.rs"},"region":{"startLine":1122}}}],"partialFingerprints":{"codehealthFindingId/v1":"b40f1a126115697551e50cd9d323280757dcc8bc3c39e3fe4bfd9db0698cc921"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1677 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/librustdoc/html/format.rs"},"region":{"startLine":1677}}}],"partialFingerprints":{"codehealthFindingId/v1":"47ebcf39334469dec7573dde11a435361b8e3c1c0bf2b4ae78c20b2d5facc74d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 405 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/librustdoc/html/markdown.rs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed03bb4e6523c026fa7a07633ba38b3be7e22b23c7d27393bf0df48fe4c94a1f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 428 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: \u0060trace!(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/librustdoc/html/markdown.rs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f188cc305ebe56a19beec74b4cb270fcb021fe6d2b9b8718955e910c03b1e0c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 443 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/librustdoc/html/markdown.rs"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"4560bf1484ec648f1fc60ea2bd04bc686c6e573cf935622fcc1cac23631f683d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 451 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: \u0060trace!(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/librustdoc/html/markdown.rs"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"afb8f5fd1857944b4cc5fa69ad56b216c5b842f5d67a755ca71823ccdec76ac9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 459 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/librustdoc/html/markdown.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac1cc7ad0d0d788c71700386648ed4639968e4e21a6d99911c5da26141c4a0ef"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 724 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/librustdoc/html/render/context.rs"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"6680fbcd549f8ee7874e046865d1594cd962d921aa9cb21623a3050f79f90c49"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 756 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/librustdoc/html/render/context.rs"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3a5228289481835cab06edafd8296ac6db588814a6119405fa7ec5d22259f1f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 711 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/librustdoc/html/render/mod.rs"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"300edd6a888fe347d0811c811cfb462a6dd32b2102c97ba1372a5a2341cb0984"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 816 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/librustdoc/html/render/mod.rs"},"region":{"startLine":816}}}],"partialFingerprints":{"codehealthFindingId/v1":"5438e9469da266c4294b2f5e2130dce5ea162c11523d74a9e7bf41781d52e157"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 866 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/librustdoc/html/render/mod.rs"},"region":{"startLine":866}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae3c3557ba8ca33645747799b80d4439dfd3605f5b2dd84442f7f3c666622c4e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 1488 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/librustdoc/html/render/mod.rs"},"region":{"startLine":1488}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b495fac094c1cec1f0b56d10b38ceb0b4d186369551975d3a10bd1f58413468"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1624 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/librustdoc/html/render/mod.rs"},"region":{"startLine":1624}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b2c3d584fd5d8dd87477d89de24ebdab90c93b378d237c58d949a61758452bc"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 340 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/librustdoc/html/render/print_item.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"d40f16d6415aeed03a5ca80f24ebf92642d01d7609b890c3d3d0648e3835ef00"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 557 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/librustdoc/html/render/print_item.rs"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b4cd86c8a2294bca9d2b93b40df9aa30ca747313e071df2eb5d9e4302572e01"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 827 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/librustdoc/html/render/print_item.rs"},"region":{"startLine":827}}}],"partialFingerprints":{"codehealthFindingId/v1":"d995fa1ef7f3b069ed3606c91c331568e0eb8fc22c192760a1cc286bf98b5551"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 554 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/librustdoc/html/render/sidebar.rs"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"40349f35d192d90fe5f4657f35bd7db67a2579e5a8a874468ebf95d2d179c813"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 563 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/librustdoc/html/render/sidebar.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dd8b78c0c7340f9fec24fb3ae7225d17cdfa3887c4ce0eb9c988a0ba5b4e675"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 581 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/librustdoc/html/render/sidebar.rs"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"b37afe2f585af943a870814ed0b87a7f3808381cc813b6493f00ae41c16eefb9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 303 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/librustdoc/formats/cache.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"b55a3ef29e85c6873a984044bd151e3d1652b0a13a407af709e16d5d9edc47eb"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 164 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/librustdoc/doctest/make.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9890dfbe30b4a24981a27dee637e3fad4eef0a3b9340dab75b5540e3a3bb688"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 165 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/librustdoc/doctest/make.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"069fb5eaed94929bfb28e3a227987b710686b03033e8ffea74b68b6a153c342f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 166 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/librustdoc/doctest/make.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8caa00da5445c11d49b6b024c74aea6bb340c65af48f8649eea695d1fe75140"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 167 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/librustdoc/doctest/make.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"6261156395bc66b37ec80ab5327583e864d2c65d7ca63b8c7e119fb1a6b89d08"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 332 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/librustdoc/doctest/make.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef6c4f4d243d1aa43a358d03987e409a4fbc96d0f989027832ddf12b4d6744d7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 35 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: \u0060trace!(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/librustdoc/clean/blanket_impl.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8dc70284746f4428fa77b9c133aed798f7c63762d12d143a4534ac593d3673d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 82 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/librustdoc/clean/blanket_impl.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb0a33da2018c3ace3f472c422e8540fb53a20da5c77d6ce576f912de62b75ce"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 76 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/librustdoc/clean/inline.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc81af0d27278ed24b021eff5e79df006db32cab5cbd2c703c0dcb13a4e634d3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 657 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: \u0060trace!(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/librustdoc/clean/inline.rs"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"56bcfd6aa5b94d67d30bc9859a78eba600f382b20cf2cd7673fbad1f725e6a02"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 659 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: \u0060trace!(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/librustdoc/clean/inline.rs"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"48d522ad68172211d4e9f3a6cce6b0bf1cfb5a4530bc48e2448951933915ce39"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 936 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/librustdoc/clean/inline.rs"},"region":{"startLine":936}}}],"partialFingerprints":{"codehealthFindingId/v1":"b22f431c1343e77d184cbe92369899a435018fb537c2b51124e081dfb94ce99f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1988 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/librustdoc/clean/mod.rs"},"region":{"startLine":1988}}}],"partialFingerprints":{"codehealthFindingId/v1":"b69fb54258b99d6ee94e4f80f70ed4abdcb6e6a92d57cae5d0153dfaa27c9253"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1992 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/librustdoc/clean/mod.rs"},"region":{"startLine":1992}}}],"partialFingerprints":{"codehealthFindingId/v1":"f362915fe4e933d4f51fa755830e6b9d2f3af0c2267c1d283de5a5c4fe862029"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 543 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: \u0060trace!(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/librustdoc/clean/types.rs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c73ab3e1436475b827656981d60fed8232bb464a8b0c5bf27d50b8e126047db"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 300 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/librustdoc/clean/utils.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca2e6d4d8c2fe35a96560ed2f685a5a201fb6ebe80e539f84ae4b6664f4f6804"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 471 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/librustdoc/clean/utils.rs"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7aaf53c39203220732599c1e1816650afe0a3d211985136bdac4bfc03b8fb92"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 510 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/librustdoc/clean/utils.rs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"908d4f1d1cbc00106c5c7b5167b12897deea7a3adddeac5f481558f8c1154cf2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 898 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":"compiler/rustc_type_ir/src/region_constraint.rs"},"region":{"startLine":898}}}],"partialFingerprints":{"codehealthFindingId/v1":"6368a903f29a857374e97a26617278e47c780b49017c25a61d1e07465bd0b1f4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1111 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":"compiler/rustc_type_ir/src/region_constraint.rs"},"region":{"startLine":1111}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c1dcdbb3c16a14465473b0b7cce65bac6ade6a87354213a491411f265c5e91e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 557 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: \u0060trace!(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":"compiler/rustc_type_ir/src/relate.rs"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8c952c430440f6a84b31e25d998f556dd0ab1671661f320caaf235ea952803a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 570 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: \u0060trace!(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":"compiler/rustc_type_ir/src/relate.rs"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b6e10ce857fca03681e8a5e7f0c92b9e87047afb0ac65e371342e07e43fd549"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 124 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":"compiler/rustc_type_ir/src/universe.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1cf3c8975266182a243b515bc294f9ef16d023c0519b878556574a4308828cd"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 144 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":"compiler/rustc_type_ir/src/universe.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"eff900473e2da3924d5a328ec949720b79d06764821223318120187b88925f1b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 163 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":"compiler/rustc_type_ir/src/universe.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0bf1eb94f62c1ed2acb27c70aff69f5a1eb0267ac2918f4360628588ac52362"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 55 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":"compiler/rustc_type_ir/src/walk.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"576891a7e091b3e8056149967ac16b78d6c0df428d1b50d3d4695a42401f467f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 61 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":"compiler/rustc_type_ir/src/walk.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"db7f9633ed271c87aa44f111c185ec30739e6379cdbb8e09fb0f3f5c81fdb499"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 240 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":"compiler/rustc_type_ir/src/sty/mod.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"994518834eaeaac7dd26e1e9e8eee2ed16f76ed9d21bcc3c299484f76eb79885"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 257 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":"compiler/rustc_type_ir/src/solve/mod.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7e18a436c7e69f2550cd61cb580c8beaffdc49756d5d58214f01a7e6a581c75"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 362 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":"compiler/rustc_type_ir/src/solve/mod.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"93bbeabceab773e0b597a838d9ba9666c04ddd87fc617518966484946d6a37d1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1323 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":"compiler/rustc_type_ir/src/search_graph/mod.rs"},"region":{"startLine":1323}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cc7e8a9c07aa9ff50e4f7def2889a60bfe0ae0a7fb5b151eb1f1a7d029785e0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 47 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":"compiler/rustc_type_ir/src/relate/combine.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"9923b7559a62b503e68f58470fa7321ad82590f735e8c48aa5083b2e65234e84"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 154 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":"compiler/rustc_type_ir/src/relate/combine.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"174ea54db2b910548c6ae0fbb08854395f39ada9573c610122999012d1ed7fcd"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 618 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":"compiler/rustc_ty_utils/src/abi.rs"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c1b84d252be052b7c768c229436e1d719a0f89ef25775d951ac32a564be33a9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 661 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":"compiler/rustc_ty_utils/src/abi.rs"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d5bb43fccaff923eb07676f7fddf8ac446c9798f22e1070e534abc5f3dd2774"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 24 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":"compiler/rustc_ty_utils/src/instance.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee708dfecc56541023aebf26a611d2216844130930990851b89812b9b27cdb6d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 105 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":"compiler/rustc_ty_utils/src/instance.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fb97281275fa0d9d7fc999ba0c3ba01f3bc4cbe2e3ddf128f4225ea274054b4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 133 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":"compiler/rustc_ty_utils/src/instance.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"bae575dc92659e6c7bc685403eafbfb5c80a7096f2a02c5f2776edb139e39bb7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 600 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":"compiler/rustc_ty_utils/src/layout.rs"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"451675d7a0a6304764480dd0921aae4b531d6e3c2a98d33dd5df1a791c34e51e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 926 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":"compiler/rustc_ty_utils/src/layout.rs"},"region":{"startLine":926}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a9c7d8bbf8f401aa07cfad450e6057a3da4ee92428e10637c33c7d71018e095"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 934 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":"compiler/rustc_ty_utils/src/layout.rs"},"region":{"startLine":934}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f7e5a0ae9eae640b28f56154852ba95cd82198e9b21a180361b32d225a5087f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 942 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":"compiler/rustc_ty_utils/src/layout.rs"},"region":{"startLine":942}}}],"partialFingerprints":{"codehealthFindingId/v1":"472b0f21eff38fad4a9cc42276e179fe4dd54fe10ed42fbc7206035a0263124d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 947 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":"compiler/rustc_ty_utils/src/layout.rs"},"region":{"startLine":947}}}],"partialFingerprints":{"codehealthFindingId/v1":"456a9324fd6d5880f5fbf91ac79a41c02047aa2da24b3408c2f124f39bc4df21"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 990 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":"compiler/rustc_ty_utils/src/layout.rs"},"region":{"startLine":990}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e395d7aa1c1d5af3e8df569744399c40d7840e4da13e60ff842a539992b6c17"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 997 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":"compiler/rustc_ty_utils/src/layout.rs"},"region":{"startLine":997}}}],"partialFingerprints":{"codehealthFindingId/v1":"19c1521a1a22d0d4d6cdcdaa18c32562c1e87c65fa5fdb321a4b343e615d18c0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 37 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":"compiler/rustc_ty_utils/src/needs_drop.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"a259e74b81c29652b7ec8709ec527ad654660850feda009daf03b4879fa40615"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 61 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":"compiler/rustc_ty_utils/src/needs_drop.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"24e26dd5494d16e90b79d9083faf908b5f2fa7b2d08633b37939450b52ef9e59"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 108 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":"compiler/rustc_ty_utils/src/needs_drop.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"c87c053997739d6a7ce2038ac227036f1ccfeb44aad381a84859bc52253d4d99"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 193 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":"compiler/rustc_ty_utils/src/needs_drop.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"b695e81ebae0bf79fea7e9b781a166e781d7b54ae58174cfc658e6a7023513db"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 393 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":"compiler/rustc_ty_utils/src/needs_drop.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ba240fe4870ed1cb55b34c5bfacc792ed03062b33bf82791acbd1ebe676953e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 416 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":"compiler/rustc_ty_utils/src/needs_drop.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"72a4bd5d8f5b0979c6d3879101e2aeca042199cb9ae57fd9bbedf09b29b9be6a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 420 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":"compiler/rustc_ty_utils/src/needs_drop.rs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"65a77085860f56871cf07c14b1d549d2cf7b397da210468ae6342df4084e0d12"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 429 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":"compiler/rustc_ty_utils/src/needs_drop.rs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"9604055c0d60a0c0864ab7b07853a8846054c8785c9b79fb6362aab1484b7437"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 434 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":"compiler/rustc_ty_utils/src/needs_drop.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"09881f96a866c82de38235dad444d8d837d52212cb839195b372a33090631a8a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 24 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":"compiler/rustc_traits/src/dropck_outlives.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"01950a800549258df2f4b96354119d2f85c9e97198968700ac6afff3f028b5de"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 36 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":"compiler/rustc_traits/src/dropck_outlives.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a069c01e7e8feaf677a8ee4247e286df0c54bc8e8098bec2f9039939ce96560"}},{"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":"compiler/rustc_traits/src/dropck_outlives.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"982533ac5d2fec6cf4533b0ee4730d2d55ca171a66479ffc99216bf9a805ec75"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 62 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":"compiler/rustc_traits/src/dropck_outlives.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"c57dd16669d33647383d6239356cf77ef8f4c26e5f7e45407fb3eb9d6f8f2619"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 21 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":"compiler/rustc_traits/src/evaluate_obligation.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"baef13b21451907a8bb7c5bae18bced5e3b522910f87801585cdaa1842a4d1c4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 24 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":"compiler/rustc_traits/src/evaluate_obligation.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9662e167f9d3524dd55574cf053db5c11aad240f2cde6781afcfa0bb59012ef"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 12 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":"compiler/rustc_traits/src/normalize_erasing_regions.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3cbf4d5ba2c9800927ce8d3fab1963b6c6e589906228cf3d50319b450472c1e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 45 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":"compiler/rustc_traits/src/normalize_projection_ty.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"26ecc256a7eb56d46ad9a7caece9753f7cb6b57daa3c67b56c51ddd83a8440fc"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 92 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":"compiler/rustc_traits/src/normalize_projection_ty.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"67c5f80e01853f42829aeb0a2483804996ae985a9a07985b71b0ddc7ec2998e7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 131 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":"compiler/rustc_traits/src/normalize_projection_ty.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee6b0fb4e8f2d263ee2aab7692358042572358261374305ac5f01d9c721d22c8"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 118 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":"compiler/rustc_trait_selection/src/traits/auto_trait.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"cedc91e2601fa570a3f31e80502339f75643975effe2ad1d1d52d508aead67f5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 172 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":"compiler/rustc_trait_selection/src/traits/auto_trait.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"23bb0c6b578fd0a45138d4e528d52b79962d39da39569f3847863db24553c9b8"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 234 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":"compiler/rustc_trait_selection/src/traits/auto_trait.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"83c3b56c0429c729d89a76d6bb70aa6469ed07c5c12e263c8fa7f3bb5013a8d5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 379 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":"compiler/rustc_trait_selection/src/traits/auto_trait.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"37fd876718341bb12a881a8fa8bd245e4d4cef7e3027a7f223f225bfa5220f88"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 408 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":"compiler/rustc_trait_selection/src/traits/auto_trait.rs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"2db31b1e5df20873c47f07bf19b074b6c412518436d23465dead2cc49477d56f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 429 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":"compiler/rustc_trait_selection/src/traits/auto_trait.rs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"071f4c9125ae6a20f2f2e4c7638ef201cfe45a7ec4a97486823e96a9710e4ba8"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 714 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":"compiler/rustc_trait_selection/src/traits/auto_trait.rs"},"region":{"startLine":714}}}],"partialFingerprints":{"codehealthFindingId/v1":"de0d7191529c5afcac02d64506743ea693e731cca2ae1262035ce523bd850e70"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 728 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":"compiler/rustc_trait_selection/src/traits/auto_trait.rs"},"region":{"startLine":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"df2f2d5c5d922a4369fe9dde60b995731b68c06c08068b62fb5c3befd3beaf49"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 794 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":"compiler/rustc_trait_selection/src/traits/auto_trait.rs"},"region":{"startLine":794}}}],"partialFingerprints":{"codehealthFindingId/v1":"274d5cdf7f9ea10bb7ca633c2912289204c8021f961d12b7cec73dbb03e4c3b6"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 799 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":"compiler/rustc_trait_selection/src/traits/auto_trait.rs"},"region":{"startLine":799}}}],"partialFingerprints":{"codehealthFindingId/v1":"58687657cd7dedf52c4cb11153e9de62c6d073d95332d526518e7f00e6d67e96"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 243 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":"compiler/rustc_trait_selection/src/traits/coherence.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"01f286ffb82ec8ed11225315af6b826bfe1af69cef681a527ce8320e7e88acca"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 394 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":"compiler/rustc_trait_selection/src/traits/coherence.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"febcc54ca80d642619f89ce34e52330445541184f1d286806c89f0ac5e8cb16e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 697 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: \u0060warn!(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":"compiler/rustc_trait_selection/src/traits/coherence.rs"},"region":{"startLine":697}}}],"partialFingerprints":{"codehealthFindingId/v1":"92459a3603fee2889df22dd8adacda3f7ec406dd01f0c8b552979b2d937feab0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 178 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":"compiler/rustc_trait_selection/src/traits/const_evaluatable.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"443b35434f21e1244973404d9deaf17cafdbce58324e106957bf1cd1fcb9b35a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 55 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":"compiler/rustc_trait_selection/src/traits/dyn_compatibility.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"5955e43941491cd24471931cfd09eeefdea22d12f5397fb0aa9b118cc7d77142"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 72 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":"compiler/rustc_trait_selection/src/traits/dyn_compatibility.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"19d8bbb0b5ec5cbf0c948beeeddc8b8346ba9fd0a74f98e94ba9376a6678c49f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 630 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":"compiler/rustc_trait_selection/src/traits/dyn_compatibility.rs"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"67db4cb4a134e1d0553b40b82e294225616a0150cbeb0bf368a0f0f7b7a0c939"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 636 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":"compiler/rustc_trait_selection/src/traits/dyn_compatibility.rs"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a40bfa635606aee916c91106d832a4a29576bbd0b1b9bd56961c9d085f4ac7c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 697 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":"compiler/rustc_trait_selection/src/traits/dyn_compatibility.rs"},"region":{"startLine":697}}}],"partialFingerprints":{"codehealthFindingId/v1":"723ed96659a5b558c65a7f8fa8e9072d571abb0ee6f4f343b62fa2c2215ca547"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 124 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":"compiler/rustc_trait_selection/src/traits/fulfill.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ccd612789c23d07c431020fb9dcf9ce5e3492825dcd66a3dacaff99cdca65cd"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 718 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":"compiler/rustc_trait_selection/src/traits/fulfill.rs"},"region":{"startLine":718}}}],"partialFingerprints":{"codehealthFindingId/v1":"43d8388056e88121fbb068e182cda1ca423f2570ff80c90a78161fb43eaa5e59"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 882 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":"compiler/rustc_trait_selection/src/traits/fulfill.rs"},"region":{"startLine":882}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaa98877dfa5422598ce36961fe4b7493b253367544e9157be8a11a112651fbf"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 892 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":"compiler/rustc_trait_selection/src/traits/fulfill.rs"},"region":{"startLine":892}}}],"partialFingerprints":{"codehealthFindingId/v1":"574f0f5217dc8751212e7bbcce346ea9bb1fa9a3335bd9047480549f5ad08003"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 896 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":"compiler/rustc_trait_selection/src/traits/fulfill.rs"},"region":{"startLine":896}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cc849388273da41dedb20c262232ec4c0f3b6088e23be41ee7cf16c8110201d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 908 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":"compiler/rustc_trait_selection/src/traits/fulfill.rs"},"region":{"startLine":908}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3c5273aff5b66ffeddc9beef43bb16b04f534654169069fd4997501f0d204d0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 917 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":"compiler/rustc_trait_selection/src/traits/fulfill.rs"},"region":{"startLine":917}}}],"partialFingerprints":{"codehealthFindingId/v1":"5af2d799c51ce7fcd8d02a0bd46a88bc3873f3083bb2d6f0e096d7836bf2cab7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 953 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":"compiler/rustc_trait_selection/src/traits/fulfill.rs"},"region":{"startLine":953}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddb486be693b91644d1e9a7b7ae30ae5db22e0b94fb0f631856a672e84e8ea20"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 400 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":"compiler/rustc_trait_selection/src/traits/mod.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ce35f4e203c9b78cabab9ee88681428f6487e04bac890a48e3b14a04c55de8e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 537 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":"compiler/rustc_trait_selection/src/traits/mod.rs"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"8694f2363a6a13523d6ab17e2941f1695e71742307456f28a19fa0e113ec6de3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 568 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":"compiler/rustc_trait_selection/src/traits/mod.rs"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"2db8698a55c06001f518aa9ca847eb17311e67ae4dbc0ad4cb3edc13d6cc8e6b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 574 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":"compiler/rustc_trait_selection/src/traits/mod.rs"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fd41ce88b12c77fafc31c003dc4ca752a1c385448bb6da90a0809675c431be3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 582 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":"compiler/rustc_trait_selection/src/traits/mod.rs"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0262cd70f6652daf7fe7423be0a1a302aa845de5576f79b2f4fac6936f43564"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 586 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":"compiler/rustc_trait_selection/src/traits/mod.rs"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcfc4260428e143cc2e1f8f524d001a2312c39408b530af7b9506d08c6bde6ef"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 861 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":"compiler/rustc_trait_selection/src/traits/mod.rs"},"region":{"startLine":861}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eeb3a7658bf7ecbe0611a62c89b2c30777c83703d574923084f12dee9374622"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 889 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":"compiler/rustc_trait_selection/src/traits/mod.rs"},"region":{"startLine":889}}}],"partialFingerprints":{"codehealthFindingId/v1":"e385f80f790f172ab0799af70fed0d3984b58a8a51ecf365d74dc089ea05f734"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 909 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":"compiler/rustc_trait_selection/src/traits/mod.rs"},"region":{"startLine":909}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca0d0a4286792ea1c8dc1a0a7f24f757cb0435e7f37ca0008c7a058e37b23b58"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 249 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":"compiler/rustc_trait_selection/src/traits/project.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"13a2cccf80a19f3a9b477f08c0abe46fd5e0b2c05f8512b2e5e5048f240acf5c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 2047 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":"compiler/rustc_trait_selection/src/traits/project.rs"},"region":{"startLine":2047}}}],"partialFingerprints":{"codehealthFindingId/v1":"6510438f1ec9a301cb311537621a39f4cdf8239c296cfac98d2ee0616ef1d2e3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 2088 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":"compiler/rustc_trait_selection/src/traits/project.rs"},"region":{"startLine":2088}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3b3204b74cafe35c2f53d669512d7e2f2542f9325f8aee7cc8b6bec7de69de2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 211 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":"compiler/rustc_trait_selection/src/traits/vtable.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"d93f5e278939822c08ba8ff426cad94f1bd26abd62a8eeb499ad1acd8ba1b916"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 240 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":"compiler/rustc_trait_selection/src/traits/vtable.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac05db8ee1e8c4afd9d7a9d0c18e6cd8808e2cee53b78ec405223cfcec094009"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 257 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":"compiler/rustc_trait_selection/src/traits/vtable.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"592f71689fac67cd4494502040fb3d319ed11bdfbca2a83f916cd8a59bf884fa"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 84 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":"compiler/rustc_trait_selection/src/traits/wf.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"2df3606adf258b008dcbc8e46d48be16861d6c97d124ecf14268cf87e7114682"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 87 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":"compiler/rustc_trait_selection/src/traits/wf.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0eb3105c04fd41a3984706559b65fb50f2d687df0af3cdfab7881e2384e766c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 335 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":"compiler/rustc_trait_selection/src/traits/wf.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae36261b8f2c2a6ef085776d301cbfe37c236e3324b180ae707967c9e0e8b967"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 425 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":"compiler/rustc_trait_selection/src/traits/wf.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ebe8c05abe14262af324752894c2cd712bec29c8b1aeac2af4ccfe72de8619c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 776 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":"compiler/rustc_trait_selection/src/traits/wf.rs"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"84fdce54916995c2999c158034a64595833c0d9ad303cf72d73c08679fb31d05"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 115 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":"compiler/rustc_trait_selection/src/traits/specialize/mod.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"08f0e38a2bb7eedfbbe609c22e6fd5af8b3d3d0c1e71dafa7c88127a638067c0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 159 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":"compiler/rustc_trait_selection/src/traits/specialize/mod.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7d49a1b5045c69e178750f414253e61619692fb6d109aad1c6e2aa4d996452f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 200 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":"compiler/rustc_trait_selection/src/traits/specialize/mod.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"aac8263d498aa5b9f439ef00aade50af0854a57b057c336c9492edec38e14a83"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 208 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":"compiler/rustc_trait_selection/src/traits/specialize/mod.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3debe7c8e3f8f12ca04512104e4b32045f0c6d004dfffbe11b69f1676abcf9f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 282 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":"compiler/rustc_trait_selection/src/traits/specialize/mod.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"995a2513fd7f11307b9c5417f135aea93b10b9f96a21470336c8f9145dd61f60"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 328 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":"compiler/rustc_trait_selection/src/traits/specialize/mod.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"c527fd8b13d28533b0f5f8c7400969088e393fa708d3a1b275c47ed279cd7cba"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 361 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":"compiler/rustc_trait_selection/src/traits/specialize/mod.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e434fa2d97d25f70807b69f7fa782088c901d503ef6920f75532505be1d0c62"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 370 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":"compiler/rustc_trait_selection/src/traits/specialize/mod.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"c109514cd8623f1aa45216acd3412855bee6db1f1a686bd36b6348bac462620f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 45 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":"compiler/rustc_trait_selection/src/traits/specialize/specialization_graph.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ef8b580e5a7c7d91b2737019dd49916a988899a459a5bade77572ed9f4e7b2d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 48 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":"compiler/rustc_trait_selection/src/traits/specialize/specialization_graph.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4025b3f65466b9b6a587d2e7e7e99c186a227d2aaa33ae90de22a1b6cffb996"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 62 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":"compiler/rustc_trait_selection/src/traits/specialize/specialization_graph.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2ceb6553d79da47231f6307ec6cf26c5f577ccf092ffd00f9dfd1e6fab5fdd8"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 65 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":"compiler/rustc_trait_selection/src/traits/specialize/specialization_graph.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"01dbb2474e0a96c6de5b21a601b72309b3d57888aa89624294ad3f62b588f9f6"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 165 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":"compiler/rustc_trait_selection/src/traits/specialize/specialization_graph.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dc175562b863702803e989b008a621b454939664eaf31b373ab2c52a11b18d7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 173 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":"compiler/rustc_trait_selection/src/traits/specialize/specialization_graph.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"75b5674d79880c0cb0166eaea9283d726c4c3a54e941527b28256bb74442fd61"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 248 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":"compiler/rustc_trait_selection/src/traits/specialize/specialization_graph.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a5dbab90512d6cd2e44b53a47b8ea3c7e1bcaa50853f696849a198ea809b33d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 258 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":"compiler/rustc_trait_selection/src/traits/specialize/specialization_graph.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"6856472b7477ce226d89405d133dc5e63c189f0bf9ddd4557272cb0cedc6772a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 190 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":"compiler/rustc_trait_selection/src/traits/select/candidate_assembly.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ca37bf15fc61a7d5a508b8980023a0dc294a13b7eab53bc9f2cac442be17716"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 491 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":"compiler/rustc_trait_selection/src/traits/select/candidate_assembly.rs"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"f574747d1bf6d4dbe427eb951ec10c4d2a46dbf2438ee821034c1c6d9aee61b3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 344 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":"compiler/rustc_trait_selection/src/traits/select/mod.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"5068bd05dde37c843538e084647b7a96da1281a9199e73417f43e54e4ed407b5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 394 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":"compiler/rustc_trait_selection/src/traits/select/mod.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f5b369c8312f518af86dd7b299db5689b008ae3c3cac383f0034be3cb190f04"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 623 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":"compiler/rustc_trait_selection/src/traits/select/mod.rs"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c8c218b98c6b2391faf74b506ce61fdf4bd6f73d6478b48b72618a7d91ac581"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 800 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":"compiler/rustc_trait_selection/src/traits/select/mod.rs"},"region":{"startLine":800}}}],"partialFingerprints":{"codehealthFindingId/v1":"701615485044cdc57df961fefa79e49896f80d884b9b5acd970f962e2db9eca3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1047 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":"compiler/rustc_trait_selection/src/traits/select/mod.rs"},"region":{"startLine":1047}}}],"partialFingerprints":{"codehealthFindingId/v1":"703c36c27a69418868676c3fbdce85407360a2ec42338cce75d0726a28d3cf63"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1091 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":"compiler/rustc_trait_selection/src/traits/select/mod.rs"},"region":{"startLine":1091}}}],"partialFingerprints":{"codehealthFindingId/v1":"20daea945e8b6f9ac5ceb2f8e89f9adb64c54b5ae3606f4cda3786e929993b80"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 1353 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: \u0060trace!(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":"compiler/rustc_trait_selection/src/traits/select/mod.rs"},"region":{"startLine":1353}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dcc0261cb850efd2bc5be5471904b28480fd2af979d380e2f8d251b74da4491"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 1370 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: \u0060trace!(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":"compiler/rustc_trait_selection/src/traits/select/mod.rs"},"region":{"startLine":1370}}}],"partialFingerprints":{"codehealthFindingId/v1":"87f1cf9241d5e6aae5dc61c1a838033fd56d89c90f365aec94e5a385f500dbef"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 2439 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":"compiler/rustc_trait_selection/src/traits/select/mod.rs"},"region":{"startLine":2439}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c28463c2d5099a7f60b8acbcd7845c1db9d761a46fbb8ab2a654869dc4c0f37"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 2961 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":"compiler/rustc_trait_selection/src/traits/select/mod.rs"},"region":{"startLine":2961}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd0dd81e6fd6c631ffe06b8109c2356bf6b465fb55f6e7d12acb563e3c0e74e2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 3019 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":"compiler/rustc_trait_selection/src/traits/select/mod.rs"},"region":{"startLine":3019}}}],"partialFingerprints":{"codehealthFindingId/v1":"a072b276f0b70fd9bb5153f27b9915a6288cd17274af6094533be09f47777a4f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 163 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":"compiler/rustc_trait_selection/src/traits/query/dropck_outlives.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"080477c99c56a346258f18302d207fa4c0251569e2ba93d27fccabbd2727af25"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 201 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":"compiler/rustc_trait_selection/src/traits/query/dropck_outlives.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b174ddf86c88b57f9fed8a1eb26cc5f8f806db2b8ade6251404ece3282648d7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 251 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":"compiler/rustc_trait_selection/src/traits/query/dropck_outlives.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"1458d5f27648487f7a25a64a11f819e938777ece62fd61f3524d56d1e6e2f4ff"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 52 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":"compiler/rustc_trait_selection/src/traits/query/normalize.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"29b31b8d24f6d86374615a50a8a753177147f92ba3190055af2825708bede2e6"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 125 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":"compiler/rustc_trait_selection/src/traits/query/normalize.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"acc703e1b73aa6743bea0c62851bcdbafb6a8911dc8f0a8a399e5331f2eec4a6"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 131 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":"compiler/rustc_trait_selection/src/traits/query/normalize.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"068f85e659a6941dbef5d2c88cfe47ac2126f10f267db8984888068176f9d49e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 344 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":"compiler/rustc_trait_selection/src/traits/query/normalize.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"53bc6c962fe50abf640ca4851b36a5a172eca679504446e06829eec93a4d4838"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 345 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":"compiler/rustc_trait_selection/src/traits/query/normalize.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"a317946dc03617beefe5bedf3d0f0f54af3dbb4018a356fc7dcf941c501407d3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 378 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":"compiler/rustc_trait_selection/src/traits/query/normalize.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"c61da1be9743f085bb7d2cbc39ece52130f89ec2339f00f0961d377cdf7f829b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 379 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":"compiler/rustc_trait_selection/src/traits/query/normalize.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"096fc4cde011d3643357b28c9f57940fe7860123108993683df0ac45e36f9d0d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 43 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":"compiler/rustc_trait_selection/src/traits/query/type_op/ascribe_user_type.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4c45f4aa9d0d76646eedf8a2b8b4a43f98d52ea40648cadb21ae83c5295ddc1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 96 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":"compiler/rustc_trait_selection/src/traits/query/type_op/ascribe_user_type.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c83fdd61dee36931a3b16bc42c49510ae193c7b0c660870a8449407b1b64545"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 52 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":"compiler/rustc_trait_selection/src/traits/query/type_op/custom.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e0a1a8cd100f34d20d381417c2f00be1d9985e94d68b0f70130989f96a985a0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 262 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":"compiler/rustc_trait_selection/src/error_reporting/traits/mod.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba26b15c7664a2f5289d950191702f8572f39622203b8d6738d862549fdc10e0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 164 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":"compiler/rustc_trait_selection/src/error_reporting/infer/mod.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d475f84fd2deb3bd9d913b6380b03ba21db5799a5b588be9f7dda5876a2ae00"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1130 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":"compiler/rustc_trait_selection/src/error_reporting/infer/mod.rs"},"region":{"startLine":1130}}}],"partialFingerprints":{"codehealthFindingId/v1":"abb93eea496a90923db3bc1b6dfdb5ee4d754ac74a946ed29ebbbed8910dbaef"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1575 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":"compiler/rustc_trait_selection/src/error_reporting/infer/mod.rs"},"region":{"startLine":1575}}}],"partialFingerprints":{"codehealthFindingId/v1":"7948669a2a499f02f68f9606063fb726b9ef870f25924fd300923c577513ed1b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1899 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":"compiler/rustc_trait_selection/src/error_reporting/infer/mod.rs"},"region":{"startLine":1899}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4357587152bd13a69ccf3084825006459293c7d267ece0a71e292c58f0cf049"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1939 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":"compiler/rustc_trait_selection/src/error_reporting/infer/mod.rs"},"region":{"startLine":1939}}}],"partialFingerprints":{"codehealthFindingId/v1":"f68b026ba6144d38a4c8b015eba9483312d05c65192ac1c81d8d6f5a893d2825"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 2235 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":"compiler/rustc_trait_selection/src/error_reporting/infer/mod.rs"},"region":{"startLine":2235}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb70b71fa3ce6e5d784c7324baa53c9e09a5c7a1cab1febd3cfc5bfffd0975c7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1300 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: \u0060warn!(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":"compiler/rustc_trait_selection/src/error_reporting/infer/need_type_info.rs"},"region":{"startLine":1300}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2f86b2ffeedd0c319cf5d128d04cdb5885dd3f6dc4fad91936768b0d2fb337d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1386 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":"compiler/rustc_trait_selection/src/error_reporting/infer/need_type_info.rs"},"region":{"startLine":1386}}}],"partialFingerprints":{"codehealthFindingId/v1":"308b9b77b25b81effd5723510b1be79619032d4ccf3ff014a0e2a12aaa8d1c84"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 28 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":"compiler/rustc_trait_selection/src/error_reporting/infer/note_and_explain.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"1141a08e5b96c38ad408b055fccac90fccddcf04cda83e13e287410eea755e3e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 603 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":"compiler/rustc_trait_selection/src/error_reporting/infer/note_and_explain.rs"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e7e8b6630ec28176b25514ddf810e4a39c67d1d09e4d74db7752234383046d0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 943 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":"compiler/rustc_trait_selection/src/error_reporting/infer/note_and_explain.rs"},"region":{"startLine":943}}}],"partialFingerprints":{"codehealthFindingId/v1":"84d5058f7c10bcf5800bbb47910ab826a80d7a0974e08617539b2032d23a7311"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 49 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":"compiler/rustc_trait_selection/src/error_reporting/infer/region.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"51b2be6f641d0acfcda42fec53170d20ca56e5683de11d93b79153f866e83209"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 55 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":"compiler/rustc_trait_selection/src/error_reporting/infer/region.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dfadeb31b0fa3b110dd3c88b50c3a8df19d33acc132dc3bed44e88dbab5f795"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 59 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":"compiler/rustc_trait_selection/src/error_reporting/infer/region.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"479213c04550c9087767af83c25cac5ce8f91e310948c8b9fed2a6053601362d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 990 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":"compiler/rustc_trait_selection/src/error_reporting/infer/region.rs"},"region":{"startLine":990}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a88912093ca87c3b69647e56acdc91c6b03437ec8e063c7abd5da7924d204c8"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 991 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":"compiler/rustc_trait_selection/src/error_reporting/infer/region.rs"},"region":{"startLine":991}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f95094ae251cf652d124842f177a1c73d3eb9a77725f4dcbe586c942b28e730"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 992 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":"compiler/rustc_trait_selection/src/error_reporting/infer/region.rs"},"region":{"startLine":992}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aade7e48e8037d241d6bdc3dbe6291c70a6e061c816dfb1a853ab353711fda3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 993 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":"compiler/rustc_trait_selection/src/error_reporting/infer/region.rs"},"region":{"startLine":993}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fa95b7d29d4b5310f9485a402e0b4a6a85c7458cbf1d07dd71d8afd5a9f3fa0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 994 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":"compiler/rustc_trait_selection/src/error_reporting/infer/region.rs"},"region":{"startLine":994}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5dad6da7ad2f9b10bed7c2702598b562b48d0857d9c6583e9ff0bbda4137e9d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 172 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":"compiler/rustc_trait_selection/src/error_reporting/infer/suggest.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"91a8f8244660c1aaf6516486f3312971a802ba3663445df2a0dedfd71953e0f5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 339 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":"compiler/rustc_trait_selection/src/error_reporting/infer/suggest.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"568223ec7fdcfaa2ca111a13343e2355847bc70dadecd8492e75eaa559a07be1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 598 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":"compiler/rustc_trait_selection/src/error_reporting/infer/suggest.rs"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f076a4050308f56455729dfdccb708579dd2a8e11be1784517ec2a106cc624b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 860 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":"compiler/rustc_trait_selection/src/error_reporting/infer/suggest.rs"},"region":{"startLine":860}}}],"partialFingerprints":{"codehealthFindingId/v1":"5244c819804742dd1f0dac3758b2d19c1407c26c23e51d11902ebf0f76fe36e7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 74 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":"compiler/rustc_trait_selection/src/error_reporting/infer/nice_region_error/different_lifetimes.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"317e1c98cac7848f40db83a7bc217c345c124f392edae8a164612258013abda9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 75 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":"compiler/rustc_trait_selection/src/error_reporting/infer/nice_region_error/different_lifetimes.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"e409bdb5b31d56c7b88dff708bcf0d117af7d9a7d7d376b0b22f7bc7a2ec31c6"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 90 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":"compiler/rustc_trait_selection/src/error_reporting/infer/nice_region_error/different_lifetimes.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0b62968d4c60b4deaa7a27e7a8553ce76030b12c3cc52a2d6b7461b6bb455e8"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 101 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":"compiler/rustc_trait_selection/src/error_reporting/infer/nice_region_error/find_anon_type.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"312be8772032897f1fa63b1a8718e4461a5bc0ebb997f2868d3e31eca3724eaa"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 111 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":"compiler/rustc_trait_selection/src/error_reporting/infer/nice_region_error/find_anon_type.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec5f5d7de1eb9d33171125e767c75fd0040f309e857d1f0ade83365a11b48483"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 115 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":"compiler/rustc_trait_selection/src/error_reporting/infer/nice_region_error/find_anon_type.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f1b2d1f1a0bd5adc6f84c37d43f369e045378937eee9aac61d5c498de9902f9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 186 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":"compiler/rustc_trait_selection/src/error_reporting/infer/nice_region_error/find_anon_type.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d0f6731a3a9310ac5136059ce310b677beb73d58e2e75e16ad5a2c804baf549"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 193 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":"compiler/rustc_trait_selection/src/error_reporting/infer/nice_region_error/find_anon_type.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce0dcad77433f8b7142dbda0e20ef4e23ee3a4e923a8e0f525319798afb47407"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 194 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":"compiler/rustc_trait_selection/src/error_reporting/infer/nice_region_error/find_anon_type.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b1499c49b711e719824e9ce9676fd5ebce3e913e8755493bd4054d2df5a3ea4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 220 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":"compiler/rustc_trait_selection/src/error_reporting/infer/nice_region_error/find_anon_type.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcb2fc50073933e5255ece6d983669235bf7ab3b684bbebcdcad3a461171a6f6"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 23 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":"compiler/rustc_trait_selection/src/error_reporting/infer/nice_region_error/mismatched_static_lifetime.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3690273d078149617c65f72abd4a0fe7334f59831713d60b663ad7c29961727"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 18 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":"compiler/rustc_trait_selection/src/error_reporting/infer/nice_region_error/named_anon_conflict.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2b53213be4590c07e17a3f1ece3debedaa485bacf78c9e6aee13acabbab3462"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 49 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":"compiler/rustc_trait_selection/src/error_reporting/infer/nice_region_error/named_anon_conflict.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"3066616fc617255d316c73ff953af1dc2b0deed825b4bebda998c4232452e1c3"}},{"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":"compiler/rustc_trait_selection/src/error_reporting/infer/nice_region_error/named_anon_conflict.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"75b1c4d3965508a324b8337518ed9c3ac1c8880c520ef20bc35353c628435b73"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 51 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":"compiler/rustc_trait_selection/src/error_reporting/infer/nice_region_error/named_anon_conflict.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"957356f2fa2b0dc69d89a9ff66e729ceb4ee4b424ad65ff920eb6556a4e430ad"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 24 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":"compiler/rustc_trait_selection/src/error_reporting/infer/nice_region_error/static_impl_trait.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a202fbc16cfa5ee0aa3595cc4ceb154a5f5c75bbb80e343a002980ab9c06c76"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 38 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":"compiler/rustc_trait_selection/src/error_reporting/infer/nice_region_error/static_impl_trait.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"be088eb027749419985457736b2bd9b2cfb5006843cd52b281799c5c0c3ea64e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 43 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":"compiler/rustc_trait_selection/src/error_reporting/infer/nice_region_error/static_impl_trait.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b8656132620ed21abf62d9917730ae057a3a7f4cdf9bff178554148d3171754"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 69 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":"compiler/rustc_trait_selection/src/error_reporting/infer/nice_region_error/static_impl_trait.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5193229ab941a91f8f15022231723befb7b03ee528f7e07562885abfd92f062"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 147 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":"compiler/rustc_trait_selection/src/error_reporting/infer/nice_region_error/static_impl_trait.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fb3ddffdbef7603530ebaddc82af6da8e99853097e4a31d4438c55a9f2a7fd7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 26 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":"compiler/rustc_trait_selection/src/error_reporting/infer/nice_region_error/trait_impl_difference.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"25c3c2465aade13cea8e4e301912ff9e290b348cc6e6b36aa62f115ad8e03f95"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 141 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":"compiler/rustc_symbol_mangling/src/legacy.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"88b13a6c0ae0d56da8bb757672b9c4a1a38719217d0e56cb383c25c8d154f352"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 262 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":"compiler/rustc_symbol_mangling/src/lib.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"6125141f696eccdf8f73fbd7c698576a85abb74100851c536a6f045e8d84505d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 635 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":"compiler/rustc_span/src/hygiene.rs"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"2304a8937e10312b6ae76992c677770fcb1cd44792192460460e375c0ebd8bbd"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 645 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":"compiler/rustc_span/src/hygiene.rs"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"cabea4980f8c9f5046d23ac6d3334eceffbbe16978f16ed9ac6e23750dfef241"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 646 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":"compiler/rustc_span/src/hygiene.rs"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"343cedfd9abf4db0d273aab5672b86fa3881917f3a04857cd51960d904cd1b19"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 649 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":"compiler/rustc_span/src/hygiene.rs"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0ea138edd5b645027a2f6d89ebf0575141a00ad5ba533f8574edeed4f21ebac"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 651 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":"compiler/rustc_span/src/hygiene.rs"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"242aa430103d440606977f880f99049e8fd3b8c77a7c544cb9aba7e0df260b94"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 654 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":"compiler/rustc_span/src/hygiene.rs"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"d84be4bf42dd599d114dc65d7b8930402ab1aca1d2f1af0f7952e7bb3d3e06a5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 661 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":"compiler/rustc_span/src/hygiene.rs"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"6546aa4cd84fe0b1f798f8c2c498ac3780a33a2905367b78401c076b3beafbc7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 662 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":"compiler/rustc_span/src/hygiene.rs"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"85eae7b8f7b5106724f8c6ac464774b829b3be0e57cbceca656262516536003f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 668 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":"compiler/rustc_span/src/hygiene.rs"},"region":{"startLine":668}}}],"partialFingerprints":{"codehealthFindingId/v1":"5479c9201378d3b814feeac15b22bf1a0f62fa509516bdde67d78753ead30fca"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 670 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":"compiler/rustc_span/src/hygiene.rs"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fadffe85ac9a0129b2f33cf6e03da77427519cd2300dae6f3168b7500cc428e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 676 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":"compiler/rustc_span/src/hygiene.rs"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ac226b2ba47b9ce7eebc4e95f421317b78915e0d31fc5c251073857d4f7bfa2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1466 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":"compiler/rustc_span/src/hygiene.rs"},"region":{"startLine":1466}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd20b7fabe2bfca0463c9adda7a58de7125439d29e88268ae329f82b770d0121"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1670 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":"compiler/rustc_span/src/hygiene.rs"},"region":{"startLine":1670}}}],"partialFingerprints":{"codehealthFindingId/v1":"8538d3fdd3ccc1c8295f7acf7512775aabdc08973ddfef12cedbf46a7defaf1c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 2518 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":"compiler/rustc_span/src/lib.rs"},"region":{"startLine":2518}}}],"partialFingerprints":{"codehealthFindingId/v1":"1427faa9927c135a42320be52d23b31f78a872dd1aff48c0328fed0e4faa740e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 2545 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":"compiler/rustc_span/src/lib.rs"},"region":{"startLine":2545}}}],"partialFingerprints":{"codehealthFindingId/v1":"dba0aae9d9259a8a1a0415842b6fa9ce8e368ff3471fd84b2d8be99939c8d8eb"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 2546 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":"compiler/rustc_span/src/lib.rs"},"region":{"startLine":2546}}}],"partialFingerprints":{"codehealthFindingId/v1":"164a16c84f7cadee1524e6153f92e23cb947527fa89f0625a855d5dfcfe0ec8e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 2547 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":"compiler/rustc_span/src/lib.rs"},"region":{"startLine":2547}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f4885db30f3812aa2b46f38cd0d48b8276895b37d3df70bdd4173157fbe7045"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 2569 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":"compiler/rustc_span/src/lib.rs"},"region":{"startLine":2569}}}],"partialFingerprints":{"codehealthFindingId/v1":"230c7eddd1d146bb7dcd8e62661b22a710c4857264acea610eccb7408b1aa299"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 562 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":"compiler/rustc_span/src/source_map.rs"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef7fdb6d048441fd8f5e95650a89159d5c33470b7feb57b94c949cd9af879130"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1024 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":"compiler/rustc_span/src/source_map.rs"},"region":{"startLine":1024}}}],"partialFingerprints":{"codehealthFindingId/v1":"42dad29cf313ccd7af2b52f9c5d229d025d371c9019b53c477843e2df5895054"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1033 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":"compiler/rustc_span/src/source_map.rs"},"region":{"startLine":1033}}}],"partialFingerprints":{"codehealthFindingId/v1":"942effb3b8a1b887d89c7a3d3d5e35d1379c7b536067073a313352f37c47d28e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1043 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":"compiler/rustc_span/src/source_map.rs"},"region":{"startLine":1043}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7f21c0b5f6ea4a2d05e215e7167717d86de10fb138d7f69fe067f5edf938a2e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1197 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":"compiler/rustc_span/src/source_map.rs"},"region":{"startLine":1197}}}],"partialFingerprints":{"codehealthFindingId/v1":"c23522dc6d38d4bc82e2e016c552596b6578022f02f8f645e959e303ea479b20"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1215 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":"compiler/rustc_span/src/source_map.rs"},"region":{"startLine":1215}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc4c53efedcc43ae3b9986731be76f7c069774ac062703eb8725162501efd34b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1322 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":"compiler/rustc_session/src/config.rs"},"region":{"startLine":1322}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4001763a30289e5a8239d5f63fb0e3c31b50ce588741944ed28da784b9e7f10"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1332 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":"compiler/rustc_session/src/config.rs"},"region":{"startLine":1332}}}],"partialFingerprints":{"codehealthFindingId/v1":"80872ed22d57d72a38ab71b77dc341506f3d48071ef3de60549428ba9814f99f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1393 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":"compiler/rustc_session/src/config.rs"},"region":{"startLine":1393}}}],"partialFingerprints":{"codehealthFindingId/v1":"861d31ce98679edde71fce2ebaa87c4a4fee3f4a7cf79416dbee81ac33abd1dd"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 3248 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":"compiler/rustc_session/src/config.rs"},"region":{"startLine":3248}}}],"partialFingerprints":{"codehealthFindingId/v1":"77fc8515141706b19760da7885d31bfe8c6b9519a5a032b2f4cc6440fabffd13"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 604 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":"compiler/rustc_resolve/src/build_reduced_graph.rs"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5b20e338b66cd27d6f9b9774bfd6edf8c0b0fed157b720780fba75611312472"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 644 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":"compiler/rustc_resolve/src/build_reduced_graph.rs"},"region":{"startLine":644}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6d4a148cb949fd9e45d1c58f481942685222e70683cd8f43298e202f38195c2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 28 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":"compiler/rustc_resolve/src/def_collector.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"83c6754d52c880a9671031ecdc799d1b9fe3a2a645f01f2ef75ec3d0f88d45c4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 53 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":"compiler/rustc_resolve/src/def_collector.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bf750a54cd33d2f7d3e317e7300a69200c76f078040e45dbef7c862087b25c0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 124 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":"compiler/rustc_resolve/src/effective_visibilities.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"0647f4f6dee721e6db9806d15bad1a48ba03ed917c97adee13eec70bbf33aeca"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 335 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":"compiler/rustc_resolve/src/ident.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aabbc37c0220c19d9d71f2229fbfd44e34a559dd9ffaa2900f95ab6cd58e0ca"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1486 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":"compiler/rustc_resolve/src/ident.rs"},"region":{"startLine":1486}}}],"partialFingerprints":{"codehealthFindingId/v1":"227344f505a9b9cf64c0e946b19b760d1de4595a36b0b5b16ccbf24ae78f6486"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1916 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":"compiler/rustc_resolve/src/ident.rs"},"region":{"startLine":1916}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9357d187296fb57b39d11b2aeebc5480003ab4117cd94beb35fdbce59082f1d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1126 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":"compiler/rustc_resolve/src/imports.rs"},"region":{"startLine":1126}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4b856549cd8cdb2641b2a789afeb88f315541cc03dfc4d7ae493f2358a5d27b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1488 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":"compiler/rustc_resolve/src/late.rs"},"region":{"startLine":1488}}}],"partialFingerprints":{"codehealthFindingId/v1":"81a26922024f3fde1d97df887a5a5e30c51a330be12be71f96518832b6478b71"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1950 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":"compiler/rustc_resolve/src/late.rs"},"region":{"startLine":1950}}}],"partialFingerprints":{"codehealthFindingId/v1":"09789ccb3fcf25416e635ca31bcb7968407525d4799cdd22d24559016c2fbf84"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1999 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":"compiler/rustc_resolve/src/late.rs"},"region":{"startLine":1999}}}],"partialFingerprints":{"codehealthFindingId/v1":"d032d72d85334fcf0104806c2c356edbb5c7fa30a5cb0ba416f59b8bfcf3eb6e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 2673 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":"compiler/rustc_resolve/src/late.rs"},"region":{"startLine":2673}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5c28ef850b6dffbb74682f89c2de4e13d428561efd4ea40fee3f5bdaff5c082"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 2683 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":"compiler/rustc_resolve/src/late.rs"},"region":{"startLine":2683}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d214076539c74b05c5f59c9bac26a1c8e58f26d7367f0627d7bb63dc7c0eebb"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 2777 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: \u0060trace!(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":"compiler/rustc_resolve/src/late.rs"},"region":{"startLine":2777}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b0f4c43761cebbacce67e2616561a00e182fe127ecc6d927cc3569f38159ea9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 2783 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: \u0060trace!(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":"compiler/rustc_resolve/src/late.rs"},"region":{"startLine":2783}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb51e62ec904435523767609e157895f73f46e0c7b844e1af550200d5f4710fe"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 2793 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: \u0060trace!(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":"compiler/rustc_resolve/src/late.rs"},"region":{"startLine":2793}}}],"partialFingerprints":{"codehealthFindingId/v1":"20244f9e44990fbeb17dbd146592d98f8df33d4a2732c3f34fde0345276885ef"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 2832 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: \u0060trace!(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":"compiler/rustc_resolve/src/late.rs"},"region":{"startLine":2832}}}],"partialFingerprints":{"codehealthFindingId/v1":"3966fe8d4bac609cb32c2d40d4622c45d28b0916b657a721a1ee9292e3c7e858"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 2867 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: \u0060trace!(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":"compiler/rustc_resolve/src/late.rs"},"region":{"startLine":2867}}}],"partialFingerprints":{"codehealthFindingId/v1":"1297338b465661466303107227b89cd01a8eda762c68eb6f15c808032760551f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 3007 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":"compiler/rustc_resolve/src/late.rs"},"region":{"startLine":3007}}}],"partialFingerprints":{"codehealthFindingId/v1":"c95a296de310043e87bfae5b7aa9cc6740de42ce69eb166f5974ce54846f6cc7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 3320 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":"compiler/rustc_resolve/src/late.rs"},"region":{"startLine":3320}}}],"partialFingerprints":{"codehealthFindingId/v1":"c40716343238d98d9f0a5c8fbff864191f2ebfeda6a394bd895192fb7a720cc2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 3435 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":"compiler/rustc_resolve/src/late.rs"},"region":{"startLine":3435}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd7549f5949ef4c6a3486974073508c3ae777c299aef8f81865509633aa0d41b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 4299 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":"compiler/rustc_resolve/src/late.rs"},"region":{"startLine":4299}}}],"partialFingerprints":{"codehealthFindingId/v1":"7339f5d16d3f8bc30efc7f6d6b20ae73df30c12e763b19fbc57904eaeb2d24ac"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 5446 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":"compiler/rustc_resolve/src/late.rs"},"region":{"startLine":5446}}}],"partialFingerprints":{"codehealthFindingId/v1":"38ff7015873538ab1695a64b4ddd2180a4eda593143bb735d61a73b5118842b5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 5745 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":"compiler/rustc_resolve/src/late.rs"},"region":{"startLine":5745}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac6c3803fed3ef02724b7c52c40db5524c315b2d579302360895ae84b5db2701"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1758 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":"compiler/rustc_resolve/src/lib.rs"},"region":{"startLine":1758}}}],"partialFingerprints":{"codehealthFindingId/v1":"36b7343202298f4a671e3b0216083220f26ffbe98b03e749c690d0d7a89722ba"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 2376 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":"compiler/rustc_resolve/src/lib.rs"},"region":{"startLine":2376}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7da975344a81c78e314e5456931de7ddd5b27926021ec2579347399ca3732c2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 2386 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":"compiler/rustc_resolve/src/lib.rs"},"region":{"startLine":2386}}}],"partialFingerprints":{"codehealthFindingId/v1":"047bd45e34ba9da6878dc0ec90afc93be528528d0121e3e3d59a353846444331"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 2401 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":"compiler/rustc_resolve/src/lib.rs"},"region":{"startLine":2401}}}],"partialFingerprints":{"codehealthFindingId/v1":"d551eb16bb086b5221faf1d38663223020ec74e441d3180890638c09506fd551"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 2414 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":"compiler/rustc_resolve/src/lib.rs"},"region":{"startLine":2414}}}],"partialFingerprints":{"codehealthFindingId/v1":"80b3ab10689b20cdfb15ec287ce000bf57c26bbc2197c211f558a107e0920f38"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 2428 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":"compiler/rustc_resolve/src/lib.rs"},"region":{"startLine":2428}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8fa340180ac6bca19f5b89f83a5be352a83cc044f939841f7d21490e4ab0489"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 2438 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":"compiler/rustc_resolve/src/lib.rs"},"region":{"startLine":2438}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d3035d2239ed7c4dad7a342291736d2310c61d6fed6ba4ef04c8ec1b48b32f4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 2458 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":"compiler/rustc_resolve/src/lib.rs"},"region":{"startLine":2458}}}],"partialFingerprints":{"codehealthFindingId/v1":"b73b6fc82fe22366c45fab04c05a57bdc3b648b88b6d2d5b24e184fb7799cc15"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 2465 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":"compiler/rustc_resolve/src/lib.rs"},"region":{"startLine":2465}}}],"partialFingerprints":{"codehealthFindingId/v1":"2386c53cba176614ae6bfa49cd6c1860db1f6d7d2bd51ab22cfc708de0afaf2c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 355 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: \u0060trace!(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":"compiler/rustc_resolve/src/rustdoc.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a9193d32f339a60d698598030b6041e9ff9c57237378815c91042999e2acbf1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 365 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":"compiler/rustc_resolve/src/rustdoc.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"65423f322298b753d15f52de1159d3f43b1e0f1f73962a547ceb18ae5cec79ec"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1690 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":"compiler/rustc_resolve/src/late/diagnostics.rs"},"region":{"startLine":1690}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cfb51842220ad605482af35b6a42e0158866fb561367c452fd2cdb8ed760ba5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 4116 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":"compiler/rustc_resolve/src/late/diagnostics.rs"},"region":{"startLine":4116}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f6036e1dc4c8e1b25937fea486d4cbb69fdef87c9bef8ac830f5ad7d462d763"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 132 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":"compiler/rustc_query_impl/src/job.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f33b5af9296ba7b00c8200d480fa7f3d597c5c6f83740a10fdbc3bc96029b35"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1502 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":"compiler/rustc_privacy/src/lib.rs"},"region":{"startLine":1502}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfb087d0bf69f6e32f12d95584fb98dc35acd0feb285e3309a4c9d473c6810d0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1741 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":"compiler/rustc_pattern_analysis/src/usefulness.rs"},"region":{"startLine":1741}}}],"partialFingerprints":{"codehealthFindingId/v1":"fefab8195c1ec7b303070b5881b14acf707f03ab993d6742ccd5d6090b40f459"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 160 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":"compiler/rustc_passes/src/eii.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9570004e15831483c0523255bba1461d20fc4f13d34896974679c0a7c5e8628"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 522 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":"compiler/rustc_passes/src/reachable.rs"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b1e74e6cad7a90fb44d3ca6c18a2770366703ff9484338dbe4f880bb5f39237"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 120 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":"compiler/rustc_parse/src/parser/attr.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"12b1620dbbf6403cfdfe92b26f1a80a33fcc53bd4e396ae48e38de5bda7482d7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 413 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":"compiler/rustc_parse/src/parser/attr.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf87adc21baf8d1f9b98878cc7dadccb03597978b69d6d47ec54198b73df1506"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 350 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":"compiler/rustc_parse/src/parser/diagnostics.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"34defca0480f1865318e950e7cee313a57924aebcd14be66c3481012877a06b4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1035 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":"compiler/rustc_parse/src/parser/diagnostics.rs"},"region":{"startLine":1035}}}],"partialFingerprints":{"codehealthFindingId/v1":"201dd0b70032181677d23dcb775f9202c83920d4fc087b03b1f7d4da75648084"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 1058 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: \u0060trace!(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":"compiler/rustc_parse/src/parser/diagnostics.rs"},"region":{"startLine":1058}}}],"partialFingerprints":{"codehealthFindingId/v1":"413f9a9c39bfcd425b65cd983eba300f2b84af14b06e038c1d48a8839542614a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1073 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":"compiler/rustc_parse/src/parser/diagnostics.rs"},"region":{"startLine":1073}}}],"partialFingerprints":{"codehealthFindingId/v1":"5428ef94eb56ab312f7a17eab17f2ea077586a0669bb4a757fa490f4a695a2dd"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 1084 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: \u0060trace!(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":"compiler/rustc_parse/src/parser/diagnostics.rs"},"region":{"startLine":1084}}}],"partialFingerprints":{"codehealthFindingId/v1":"5709067d52fc5fa87bede6a4ca6d6487265c0531cdc43a2107bd2379a95ad5ec"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1930 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":"compiler/rustc_parse/src/parser/diagnostics.rs"},"region":{"startLine":1930}}}],"partialFingerprints":{"codehealthFindingId/v1":"02a62cdd7fe94b27d3700076b1398783bb882de4df68c3e9c143a9b18f8a001b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1932 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":"compiler/rustc_parse/src/parser/diagnostics.rs"},"region":{"startLine":1932}}}],"partialFingerprints":{"codehealthFindingId/v1":"d81c96d07c951190658384f05184883073cb5fe46c520071bd789448bb38c622"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1948 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":"compiler/rustc_parse/src/parser/diagnostics.rs"},"region":{"startLine":1948}}}],"partialFingerprints":{"codehealthFindingId/v1":"37ab753477b98d521b41ab93a16c6cd37842fc93c68bcdf52fe8f36bb4e5c052"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1954 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":"compiler/rustc_parse/src/parser/diagnostics.rs"},"region":{"startLine":1954}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b33955a42bf9da478891c6482620e335857bdc594d627aff0041fe53bac4e5d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 786 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":"compiler/rustc_parse/src/parser/function.rs"},"region":{"startLine":786}}}],"partialFingerprints":{"codehealthFindingId/v1":"677e31751bf16f99309b41f6bab85f9f9625b6ba27cd3086f0def10ae0172313"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 321 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":"compiler/rustc_parse/src/parser/item.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3c0aaf453cd6569bdf90f9a3f5b5b69606ae56911120000189683204c2b6eef"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 815 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":"compiler/rustc_parse/src/parser/mod.rs"},"region":{"startLine":815}}}],"partialFingerprints":{"codehealthFindingId/v1":"321d482cef88c4eef96eb00c7f875222ea40f5d9d310ecf23a13ddf717770028"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 833 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":"compiler/rustc_parse/src/parser/mod.rs"},"region":{"startLine":833}}}],"partialFingerprints":{"codehealthFindingId/v1":"940091d3ff251cdcdf55d2dd8f069f8fe194caef1b403e615df7b9f5edc23db4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 98 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":"compiler/rustc_parse/src/parser/path.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3f9ed95aea0d6b1585ef19ca95257a2842d786501ca884f1708415f106c0f4a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 709 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":"compiler/rustc_parse/src/parser/path.rs"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"61dcba1131f528cf762d9419fd5247841bf797177cd12a4d3f49247dfc0076c2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 172 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":"compiler/rustc_parse/src/lexer/mod.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd1b51ccdb5bc43a0a2c862fceb019c3a60c8f2240e1d05eee0b32950617013a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 988 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":"compiler/rustc_parse/src/lexer/mod.rs"},"region":{"startLine":988}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bbf10e073b1237ce6c7d1ca85d6da47f449123a7a77a7ef9019607adeb8c991"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 28 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":"compiler/rustc_parse/src/lexer/unescape_error_reporting.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"f602f56ac332bb3ebd51a384533c0e72528cd62a448262ad56fc7307dac8e899"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 862 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":"compiler/rustc_next_trait_solver/src/solve/eval_ctxt/mod.rs"},"region":{"startLine":862}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccca91eb9f0efeadbc434c6af7972aea66d8e0465001f72cb760aa2f0e6b6f55"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 119 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":"compiler/rustc_next_trait_solver/src/solve/eval_ctxt/solver_region_constraints.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bbc701f869401ff6c6e53d3d33034d0b5756544d4d02f809237c9e05272c01f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 139 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":"compiler/rustc_next_trait_solver/src/solve/eval_ctxt/solver_region_constraints.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"54766cee5098c11cfd47d02546426ab3873b48e22bb0d42bac9ffc98da1977bc"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1179 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":"compiler/rustc_next_trait_solver/src/solve/assembly/mod.rs"},"region":{"startLine":1179}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb4a99d498c8ce497fdd94457f2cf942ff716a3db7d213f1684173a2c3b20bca"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 525 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: \u0060trace!(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":"compiler/rustc_monomorphize/src/collector.rs"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"ede079e4bc6a098f9713b312b99dcb939a554bc9c3b61ff7265b64618e83f302"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 664 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":"compiler/rustc_monomorphize/src/collector.rs"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd400fb1a0294971050d4107d04c65fc21bf47457c58703023ccf85cc637a393"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 703 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: \u0060trace!(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":"compiler/rustc_monomorphize/src/collector.rs"},"region":{"startLine":703}}}],"partialFingerprints":{"codehealthFindingId/v1":"452c75739dbf3646326e5ee58b551fd5ec065825b310bab17a30db92fb482cf4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 735 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":"compiler/rustc_monomorphize/src/collector.rs"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f5edc52e35e1266949eae48f61ad7e7694a2cca5553554d4a81f7ecb78f6439"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 803 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: \u0060trace!(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":"compiler/rustc_monomorphize/src/collector.rs"},"region":{"startLine":803}}}],"partialFingerprints":{"codehealthFindingId/v1":"98f45b2af6ab9ca4be0a278cbaa05593e1f42752402273415ecf63f7b6d8da75"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 823 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":"compiler/rustc_monomorphize/src/collector.rs"},"region":{"startLine":823}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c9b329479a4973ac422ff9a943dd493f304a012a6303fc4e0cdbf3052739921"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 900 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: \u0060trace!(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":"compiler/rustc_monomorphize/src/collector.rs"},"region":{"startLine":900}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebffac8dd2c1b732f6fb70cc909b246db286ec4e449a1c21fa67044412ac89e7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1002 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":"compiler/rustc_monomorphize/src/collector.rs"},"region":{"startLine":1002}}}],"partialFingerprints":{"codehealthFindingId/v1":"e887a6391e5d80c5c56b0ed0634096f62cd0601f62539c8ed136e31f50ccb0c0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 1293 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: \u0060trace!(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":"compiler/rustc_monomorphize/src/collector.rs"},"region":{"startLine":1293}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d620e34641109b51689890e5acc3de7545706b2c744e30d43b65f7b2e8a38a1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 1298 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: \u0060trace!(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":"compiler/rustc_monomorphize/src/collector.rs"},"region":{"startLine":1298}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9ac7495ce3cfa8259e18401abadfa38746a758706e3f23e84608c9b49a1d060"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 1308 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: \u0060trace!(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":"compiler/rustc_monomorphize/src/collector.rs"},"region":{"startLine":1308}}}],"partialFingerprints":{"codehealthFindingId/v1":"09a6e999e2828e3447550f01a40cf455a04fac5dcf4c7e36913fc4200b4f8326"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1520 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":"compiler/rustc_monomorphize/src/collector.rs"},"region":{"startLine":1520}}}],"partialFingerprints":{"codehealthFindingId/v1":"a72ad416d556993856cc7ff01d5ab17acf4904cf326bdb6d4151cabb61addf8c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1610 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":"compiler/rustc_monomorphize/src/collector.rs"},"region":{"startLine":1610}}}],"partialFingerprints":{"codehealthFindingId/v1":"be9355341d85dcadbe0ecdab2f98fb3cea3f8ee6864228dae3ca960039fa47d0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1646 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":"compiler/rustc_monomorphize/src/collector.rs"},"region":{"startLine":1646}}}],"partialFingerprints":{"codehealthFindingId/v1":"71a2505b5eadad1f8394568b6430b01cd1147e6915107b3d4bd732d957eb1a52"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1654 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":"compiler/rustc_monomorphize/src/collector.rs"},"region":{"startLine":1654}}}],"partialFingerprints":{"codehealthFindingId/v1":"efae1950aabd30327db61d3c57209584f739f0291330a3a3dab022b9ce3992b0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1135 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":"compiler/rustc_monomorphize/src/partitioning.rs"},"region":{"startLine":1135}}}],"partialFingerprints":{"codehealthFindingId/v1":"7342c296032144b686833a80d35a9ad70f285fef2ee68a3a6e0746a39e9b9e73"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 63 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: \u0060trace!(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":"compiler/rustc_monomorphize/src/mono_checks/move_check.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c814e70494756e95aac120b86fcbb9ef92fdd350252fdb2a64663bfe5b2d439"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 123 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":"compiler/rustc_mir_transform/src/add_call_guards.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdae426591ba83f8e00ba7848b0cb464d1ad4477ff8d2a7f5a2a4e3fc62874e4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 42 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":"compiler/rustc_mir_transform/src/add_moves_for_packed_drops.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"a971145abb843ceb706195a38c897a1493f5689f742959981ab4ff9a9f050033"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 84 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":"compiler/rustc_mir_transform/src/add_moves_for_packed_drops.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"f517650a953a632f5205bc27246acf357e0577ae54aac5d4ee0b37e3bafa3213"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 90 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":"compiler/rustc_mir_transform/src/check_pointers.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"524ee0ddb655182aed8b68e30c64d5a4af5d50453facf2c95cc2a502cc491be1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 191 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: \u0060trace!(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":"compiler/rustc_mir_transform/src/check_pointers.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"e186bd0f61c1813a11efdaae9b1af7dc264fe4675a93b93e914c85d37de3e572"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 210 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: \u0060trace!(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":"compiler/rustc_mir_transform/src/check_pointers.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d3ef067f583eac02444b298b441b7e3f998af1345886a699c8bac22df0a9fb2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\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: \u0060trace!(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":"compiler/rustc_mir_transform/src/check_pointers.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"e23ff3049ad3d1193d04284477a76075488a7589f6511f0ad71e721ce71d1b02"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 291 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":"compiler/rustc_mir_transform/src/dest_prop.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9e38136b3cd8d8a89b8cfbd7ac04009722fc1aaabe89cbbc38fe81b62a29d7c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 416 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: \u0060trace!(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":"compiler/rustc_mir_transform/src/dest_prop.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"c881da390ffe718836f5c1816f3b25d98a41aea7a324ad9497849a4e40a070d3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 105 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: \u0060trace!(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":"compiler/rustc_mir_transform/src/early_otherwise_branch.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"b64d539fb0c8043d89fc88231051a75ac1acb368b299f147a2bbb7b94d15b1fd"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 119 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: \u0060trace!(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":"compiler/rustc_mir_transform/src/early_otherwise_branch.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e2e914849fbd2a6e225cb529b1db647a143580d7494580018c906fdaec2c820"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 931 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":"compiler/rustc_mir_transform/src/elaborate_drop.rs"},"region":{"startLine":931}}}],"partialFingerprints":{"codehealthFindingId/v1":"befdd6a45f85c0dc8c15277ba0e287f9272223e78aa0ac7e9612cf2d24e8170c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 54 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":"compiler/rustc_mir_transform/src/elaborate_drops.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"be04eb7ce862a4586b1466e6fd4f7f6bb3298ee05618bfd344060e2d8a8a3677"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 174 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":"compiler/rustc_mir_transform/src/elaborate_drops.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"f78468068eaaf130293be26f1815f827be43fd881586bd5f79594880d327c176"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 267 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":"compiler/rustc_mir_transform/src/elaborate_drops.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"15ade64b8497b09ec23dc9de5cfe595e793a1c6cb9d683e3597a1178001c78d3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 296 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":"compiler/rustc_mir_transform/src/elaborate_drops.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"38ab80af00651a89b7a41d33363292951018500d75d019334f8ba35b2e343feb"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 303 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":"compiler/rustc_mir_transform/src/elaborate_drops.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f133af2184fb922f4eb98827dee7123420290fab3fd2f9dc95f39f7abf485eb"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 472 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":"compiler/rustc_mir_transform/src/elaborate_drops.rs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"4761cb92d0c7c6bc5d82f6dcda1204566e7e2db9660bc6ba29106f64b34a3d7c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 474 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":"compiler/rustc_mir_transform/src/elaborate_drops.rs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f6d788a6f8e9039baf59e6fcb11a64784c9c5fe5c6313879ccb868b4d805228"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 16 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":"compiler/rustc_mir_transform/src/ffi_unwind_calls.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"afa0b09a62e54209741ebaa4b873d86384b1fb70053e0e86a6c2cd89f7132833"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 68 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":"compiler/rustc_mir_transform/src/inline.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1c05cd530113f28d11fe7ca275a6d5e35dd81342d0875b549b7bb4235193670"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 92 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":"compiler/rustc_mir_transform/src/inline.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba8f5570d589a791776ef1520727447688902fd22aa6e64e11df1a5dda389054"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 382 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":"compiler/rustc_mir_transform/src/inline.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"07cd06cbe26b7239f6c4493efcc12111f9bfe8982aeca56c568feec3fa508742"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 443 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":"compiler/rustc_mir_transform/src/inline.rs"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"04bcf238bbd884e57e95bacc2a2ce4db1ac4b49b7b4b2d364b3d8ded9ec311e0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 446 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":"compiler/rustc_mir_transform/src/inline.rs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef7bb69ba7d3193ecfe347cc7d88feec75c5b51ff9ac11856229a378263207c4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 517 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":"compiler/rustc_mir_transform/src/inline.rs"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"88e3430d3be20e053adda60cf9fade4ed35a31f23e7e087bc1e834fecb1abcbb"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 521 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":"compiler/rustc_mir_transform/src/inline.rs"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf5c7ef59db12528f8d39c403ee0b85fd6c036253a75f87601e5c5c4d9fd778b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 568 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":"compiler/rustc_mir_transform/src/inline.rs"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5ea087015069e1dd76a85c03901f1a6e6e43fad0f634265c4a27ce6925a9403"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 1123 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: \u0060trace!(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":"compiler/rustc_mir_transform/src/inline.rs"},"region":{"startLine":1123}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7f3425b003e86514f0c439fc18638cc1fe69f05cfaab619b67d3c1dbbae6246"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 1189 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: \u0060trace!(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":"compiler/rustc_mir_transform/src/inline.rs"},"region":{"startLine":1189}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5d35e04840bb31b412e2836f4a2c302ff1fc0a5887be3a81878697e11782a6a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 1195 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: \u0060trace!(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":"compiler/rustc_mir_transform/src/inline.rs"},"region":{"startLine":1195}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0bafe3ca34ec44263603fb937e24deaacc72c33d34e0c01d06b55042a712510"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 1201 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: \u0060trace!(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":"compiler/rustc_mir_transform/src/inline.rs"},"region":{"startLine":1201}}}],"partialFingerprints":{"codehealthFindingId/v1":"4675f9401486a08f3665ebca7d041f81724f624aa8bf3800911d251b024162b4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 94 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: \u0060trace!(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":"compiler/rustc_mir_transform/src/jump_threading.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"21020b88fccc9df6d25315bb369ff269e2157a8e72659f0a03724dd160606013"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 115 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: \u0060trace!(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":"compiler/rustc_mir_transform/src/jump_threading.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"60a99f76b9baf5e54a5f2b398af562c7430db535a277f45d404a9bec6961a787"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 118 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: \u0060trace!(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":"compiler/rustc_mir_transform/src/jump_threading.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"272f6058bea68c3936df32982cb4976c479d568af67f836b602c156afeefb48c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 136 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: \u0060trace!(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":"compiler/rustc_mir_transform/src/jump_threading.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"f49913997bf69da657e488c1f0c6a788e443344491371b4261c386213d400671"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 876 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: \u0060trace!(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":"compiler/rustc_mir_transform/src/jump_threading.rs"},"region":{"startLine":876}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2a05752b78c758240d89eb4cc528b61f11f929ad5129709080cf8504121638c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 919 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: \u0060trace!(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":"compiler/rustc_mir_transform/src/jump_threading.rs"},"region":{"startLine":919}}}],"partialFingerprints":{"codehealthFindingId/v1":"9700b7a5ec156394810222dacffa3effdfa5a21bd7989f8f7a85257ec49c67d6"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 45 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: \u0060trace!(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":"compiler/rustc_mir_transform/src/known_panics_lint.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"f783374d263572c83da15efb10a1e33831d9d56e32872862f196b32e9ecbff87"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 52 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: \u0060trace!(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":"compiler/rustc_mir_transform/src/known_panics_lint.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"83ec862ea0189f5015a5d48f867a48454099f1858ff895a5319da971dec8bb51"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 56 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: \u0060trace!(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":"compiler/rustc_mir_transform/src/known_panics_lint.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"128f95dbcddd4d56e59f6040cc353e56591b7b7d67c7cf00f0c1c7bfdcbca772"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 61 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: \u0060trace!(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":"compiler/rustc_mir_transform/src/known_panics_lint.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"62d5abd14c420c084e97ba44dbafa9c919550cf78b3385bf97be43aa7ce51833"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 237 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: \u0060trace!(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":"compiler/rustc_mir_transform/src/known_panics_lint.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"a646e01857423244919112a6ec818ab64af16a13436c50641b0d457e5ed71ddd"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 358 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":"compiler/rustc_mir_transform/src/known_panics_lint.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"31c510f7cfecd50f3a2464c9bc3165ea8fad6a375f705b76a8c60b6f27ebe4d3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 414 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: \u0060trace!(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":"compiler/rustc_mir_transform/src/known_panics_lint.rs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"af94f8b08d23f6231b9fd2fa041bc12f4bc232736e6a01eb08697df2457d23fc"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\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: \u0060trace!(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":"compiler/rustc_mir_transform/src/known_panics_lint.rs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"e84dffc0b1d991751e29c6fd7f1873180e97ae354e145a7ebad4b10f811be189"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 424 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: \u0060trace!(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":"compiler/rustc_mir_transform/src/known_panics_lint.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"54e12d598d214111b474eeccceecc0618fa3b8d5718f27b51c31ea8084118994"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\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: \u0060trace!(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":"compiler/rustc_mir_transform/src/known_panics_lint.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ea54e2aeb4e8422fa5399c73016a6ab41b6a6ffeb083717fac7acbb22f1af78"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 473 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: \u0060trace!(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":"compiler/rustc_mir_transform/src/known_panics_lint.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3e0851f26bf490de1f4b8110130a3e924d5374d39ffae92c1ffe8bcd02b6ee0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\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: \u0060trace!(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":"compiler/rustc_mir_transform/src/known_panics_lint.rs"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0c5d17c4176db7b7ad923f6be754fff17d2264638d063f7ac789e663a8bc3c7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 709 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: \u0060trace!(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":"compiler/rustc_mir_transform/src/known_panics_lint.rs"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1e655dfe7201a5ae02c52802d1c67be944aca3af6bc4ff2bb09d05535157bf5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 721 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: \u0060trace!(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":"compiler/rustc_mir_transform/src/known_panics_lint.rs"},"region":{"startLine":721}}}],"partialFingerprints":{"codehealthFindingId/v1":"0365e04fb2576995be7a56711d50db798641a82461b8bb85d03b18de316179bb"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 956 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: \u0060trace!(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":"compiler/rustc_mir_transform/src/known_panics_lint.rs"},"region":{"startLine":956}}}],"partialFingerprints":{"codehealthFindingId/v1":"9645fc07ba04376962cef81e367a6198be04d82faf39b142ff1b9023ce4c94da"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 983 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: \u0060trace!(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":"compiler/rustc_mir_transform/src/known_panics_lint.rs"},"region":{"startLine":983}}}],"partialFingerprints":{"codehealthFindingId/v1":"f80528215fb6d776a8af28bff227566439ea40db05b2a3db350a691652b8bf60"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 612 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":"compiler/rustc_mir_transform/src/lib.rs"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c5ca725fe0e4fb53cccf3df0ff26c3441589e83aef5b40054f0ec727fee41ad"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 630 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":"compiler/rustc_mir_transform/src/lib.rs"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3910c01cedc3cf6d946efe3ac5cfd18076076a753a60d57a6c1cb0ead49b2ba"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 634 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":"compiler/rustc_mir_transform/src/lib.rs"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"4867ed53a39118d0ad209ead8d8947d29c9566d1e2d95b8b665771b62b9af92e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 206 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: \u0060trace!(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":"compiler/rustc_mir_transform/src/move_elimination.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"0362214fa1f99b6b4b7d9a3adf78bf0a45b8173f9446a28746f311867c4b60e2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 228 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: \u0060trace!(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":"compiler/rustc_mir_transform/src/move_elimination.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"44690b772597e89c83179580e29446d140524707ff38012ff7fe418647b83c3a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 310 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: \u0060trace!(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":"compiler/rustc_mir_transform/src/move_elimination.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"072271ac011ee99f62e6557df88d708bd5f7bc3fed496347a80a74665602f697"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 338 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: \u0060trace!(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":"compiler/rustc_mir_transform/src/move_elimination.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"44062a4873df961066a2c2c98346b2638dcc8f05deece49f2c597895a6634458"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 349 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: \u0060trace!(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":"compiler/rustc_mir_transform/src/move_elimination.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c24f32f953895f9b53668a01fa126aca3da51211bfc501e63c1507fb3942d26"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 356 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: \u0060trace!(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":"compiler/rustc_mir_transform/src/move_elimination.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"b707f81372fc024ba4d580b2d18e34eef8c52e54d85b4a729b135630e1f0f1a9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 366 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: \u0060trace!(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":"compiler/rustc_mir_transform/src/move_elimination.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4297a2f90938cd5292c8346d2a1beedb0103e2f6d24b6280321b7f26dec6266"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 375 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: \u0060trace!(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":"compiler/rustc_mir_transform/src/move_elimination.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"b473e5720f35f5731f7b6fbbe8a5682d1109f992d4d8fbf71a2179ae800eb689"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 380 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: \u0060trace!(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":"compiler/rustc_mir_transform/src/move_elimination.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f21997691d282b4e2445b6fac2f9ed64ec6b3fdcf9c1b872529b11cffeb9b13"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 388 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: \u0060trace!(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":"compiler/rustc_mir_transform/src/move_elimination.rs"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dab611e10a493ecf61cd1770e077b0027ad8ba5d3ab8e5b2e2465c6ed2e86ff"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 431 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: \u0060trace!(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":"compiler/rustc_mir_transform/src/move_elimination.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"113b7b7350205bd5d712a65dd822d2018b26a6355db1f6318bc8e28eb40bb366"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 478 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: \u0060trace!(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":"compiler/rustc_mir_transform/src/move_elimination.rs"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea4f9d30b9bff39dd553f9d903367e8ed377512671c2bb4202922a90515a8d27"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 574 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: \u0060trace!(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":"compiler/rustc_mir_transform/src/move_elimination.rs"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"16e8b5acdf8621d188c3ce54966e4d11b2904b41352b9804d38cffe909931883"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 581 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: \u0060trace!(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":"compiler/rustc_mir_transform/src/move_elimination.rs"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab51cbd1d42abf27b77bb5189957b23f807a1b206996f2a07d80ca9b413ac1d1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 1020 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: \u0060trace!(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":"compiler/rustc_mir_transform/src/move_elimination.rs"},"region":{"startLine":1020}}}],"partialFingerprints":{"codehealthFindingId/v1":"08ed66686f947c21b7eaa65d1202594f83a6991b5b3f7f1a381a9c727f8c6fe1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1074 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":"compiler/rustc_mir_transform/src/move_elimination.rs"},"region":{"startLine":1074}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d4389060339aa5bc7774f59bad4edb9b5079cbd366bb63a97374b102aa44b9d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1139 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":"compiler/rustc_mir_transform/src/move_elimination.rs"},"region":{"startLine":1139}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1d7594997bc5dd4322526d1e681bff30b459800c87290481125ed455165f70a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 271 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: \u0060trace!(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":"compiler/rustc_mir_transform/src/pass_manager.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"2183a21d6a777f620fbccab56fe9cea77508ceb4ab243e88662cf8d825582761"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 201 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":"compiler/rustc_mir_transform/src/patch.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"e25bc5f1491e5cbe4db1d3aa7c9ca174162bcafb7f49964cc3a039cb4cd5c1c8"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 209 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":"compiler/rustc_mir_transform/src/patch.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"41cd829d386613387c60da048c3449b928bdf19e1906bcac8218937d7b2ede20"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 251 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":"compiler/rustc_mir_transform/src/patch.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2921d53f9daac6073f84d57621887c572405f0fba679b664533b66659bc0378"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 262 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":"compiler/rustc_mir_transform/src/patch.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"e02b0bfe128229012a81e687182cc0d804fd6629ae62028c0503848e86f8f413"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 268 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":"compiler/rustc_mir_transform/src/patch.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2c94ab71d2c9ee3ae45d40ec645403bcb5843af202e07f60c47f6b5297c5639"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 299 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":"compiler/rustc_mir_transform/src/patch.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a54da1c0aa065c90c4bb662d71e82a9e63c83d7d9da9e607cae6ade5f8d7e7d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 311 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":"compiler/rustc_mir_transform/src/patch.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d596847eb75e71fd42cd026df2376a672eac83a552f91cb036e509ff0445e47"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 798 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":"compiler/rustc_mir_transform/src/promote_consts.rs"},"region":{"startLine":798}}}],"partialFingerprints":{"codehealthFindingId/v1":"34156bfd34008258e940ef3e9df2c7cb8a9990e7404bef8a5f933919128fe4c0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 54 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":"compiler/rustc_mir_transform/src/remove_noop_landing_pads.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"fee5c9b2f7ca3f4a9609772132364dfe9a346da79b4ef7c00627f4a2cbc699df"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\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: \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":"compiler/rustc_mir_transform/src/remove_noop_landing_pads.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f9b235362d00f17c1cecc4d07789f0b7ad1134df9a02c8ac187bccf5f8b86e7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 127 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":"compiler/rustc_mir_transform/src/remove_noop_landing_pads.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5c74e9ef524b06fb078530f4f901f0fddcf92e12edaecb7e9b53a6c24718b5a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 181 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":"compiler/rustc_mir_transform/src/remove_noop_landing_pads.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"00b481aafda30089e90db587d71ecc63e87973d5422dd562690c0ad73bfa3c05"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 17 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: \u0060trace!(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":"compiler/rustc_mir_transform/src/remove_place_mention.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"9072399a6465d098ec7d1ceedcb203cee1733b6d8e9dbb63cb7283de7a5ddb4a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 17 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: \u0060trace!(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":"compiler/rustc_mir_transform/src/remove_storage_markers.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"098e84a93561a8e5e9c0e19a17dcccb277d6a28f15aafd4f878647f193712c31"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 19 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: \u0060trace!(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":"compiler/rustc_mir_transform/src/remove_unneeded_drops.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"23474c7342c5d98e6ca5f8f52f942b98ff837eacf990bd28bb450645dbd35ee8"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 31 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":"compiler/rustc_mir_transform/src/remove_unneeded_drops.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"5825b2cb5e965318da40634a407fda90b7f2c81d5cc369295f3db41d08ef015c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 33 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":"compiler/rustc_mir_transform/src/shim.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"55292617b6b1e273b459147a186736543a95f7781a57f9682d02de7e2305b115"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 109 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":"compiler/rustc_mir_transform/src/shim.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd294648958c7a90f6cd1b7624813aca51cdc020ed50702c6a6a993385fde3bf"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 146 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":"compiler/rustc_mir_transform/src/shim.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"528264930e80e473c76b1e3c12968c48a377dcc33b2744c34b6d6d5d822b5a7a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 168 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":"compiler/rustc_mir_transform/src/shim.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"3221c7840ec7af69e2032a878ac630259683e1925760a457cbef172406dacd2b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 174 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":"compiler/rustc_mir_transform/src/shim.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"f489868de4c990b0f4c5ad8db645c1750d088b9b185a7f02c19ebcb905779071"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 178 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":"compiler/rustc_mir_transform/src/shim.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d566fb3a2ab3e74c49498b4f0ac0756bf7a7f3c22a3843bfd94fe01faca4e91"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 203 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":"compiler/rustc_mir_transform/src/shim.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d6466ecd0325de6ab44022d759c8e376002df74ab86865e492b6579d219069e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 264 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":"compiler/rustc_mir_transform/src/shim.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad3f27917e3057ed9fba35b0469b9d71eb5064a11d01be665dcf33e35560e0aa"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 513 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":"compiler/rustc_mir_transform/src/shim.rs"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec26d4b1c23ca700ec9483d31a7563d582861fac9881e26daf34849c2747ce1c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1029 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":"compiler/rustc_mir_transform/src/shim.rs"},"region":{"startLine":1029}}}],"partialFingerprints":{"codehealthFindingId/v1":"2945e432d7e392b9bfb5a5cec90f395607c98483ca2dc775ed306d22e65a2a71"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1046 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":"compiler/rustc_mir_transform/src/shim.rs"},"region":{"startLine":1046}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2ccf7636975c3f4a1113df5f64288b4449f34efff77ce521282c7f053f601f5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 103 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":"compiler/rustc_mir_transform/src/simplify.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"136a8ed2dfb689db6394010db956128815997e96f34100f9f989af76ad4c0243"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 159 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":"compiler/rustc_mir_transform/src/simplify.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"a55e714e0d17bbf7d5603c8c74bea2c9c176eef59bdc6971aed11278c18a5fa7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 266 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":"compiler/rustc_mir_transform/src/simplify.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"350df0d7c1e9089884f6fe11e74eef7840fa89b0ed6cf77ee127cedbe741bc52"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 291 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":"compiler/rustc_mir_transform/src/simplify.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"2397e5afaef1078465db44c38c3b242c5712ed48fb6027f336b0205c7a3da933"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 327 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":"compiler/rustc_mir_transform/src/simplify.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"38b106abf154cdfda2fa407373d8d940cca55e4b8199555e160134d0d30d4e7c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\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: \u0060trace!(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":"compiler/rustc_mir_transform/src/simplify.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8f8caa02a8326ceb66992f0882048af51578713868445323239150fcd83d500"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 528 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: \u0060trace!(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":"compiler/rustc_mir_transform/src/simplify.rs"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bcd6b9c6e724ce526fe8774dc2deb00a20219a2b36434b1757976be8b6a1170"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 637 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: \u0060trace!(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":"compiler/rustc_mir_transform/src/simplify.rs"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"62b6d118795356032b201b1e85d2e35065ad6173aefe8b8ee9ea036a9945fa46"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 31 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: \u0060trace!(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":"compiler/rustc_mir_transform/src/simplify_branches.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"be2f5cd7c321c0ac36b23b5884cd2240d270b268e4e9b35da1b16795220a5d5b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 35 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: \u0060trace!(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":"compiler/rustc_mir_transform/src/simplify_comparison_integral.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b305003f971a348c393cbacd03ad4f2b6aeded6e8f4a5dd32d2c687f7f056d3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 42 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: \u0060trace!(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":"compiler/rustc_mir_transform/src/simplify_comparison_integral.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"f991fe68b0ee49dd0122c537736593aff9d0fb9a8cb2ec464d1c9bff1061cf17"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 310 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: \u0060trace!(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":"compiler/rustc_mir_transform/src/ssa.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee89938fffd4e48e45c1c6306de87c537d59956608547322e8462a503f5fb6ca"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 86 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: \u0060trace!(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":"compiler/rustc_mir_transform/src/unreachable_enum_branching.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f3676b7a3cfa7037210ba6e56c749af041fb429d8285d1c114a16240f8afd10"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 92 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: \u0060trace!(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":"compiler/rustc_mir_transform/src/unreachable_enum_branching.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3be7363e754a433ed7de6791dde89aa938c4537b48653d3f2563bf4efaa2913"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 116 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: \u0060trace!(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":"compiler/rustc_mir_transform/src/unreachable_enum_branching.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c4a3a50d29c21b4c32b474ef5770106276fd6c22bf14961f6bdfd9b6b3995d6"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 22 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":"compiler/rustc_mir_transform/src/shim/async_destructor_ctor.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"c098fa28ff53b53650bc8e1ee880d09b74b2cef454a598abbfa5ea6926f2a075"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 142 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":"compiler/rustc_mir_transform/src/coverage/graph.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e841167debe50dbf21b4392fdd66a65eb6219384e4c4857e2c4ef54d267d0ba"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 42 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: \u0060trace!(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":"compiler/rustc_mir_transform/src/coverage/mod.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"0764a4e0ff6534ea11fcfbf6030fc0a8cc99a531284ac7bb5b9245fd50643a70"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 109 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":"compiler/rustc_mir_transform/src/coverage/mod.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"67368b9bfd38934cdcd277a5bf9210c93763f67a253827d402e1d364e489d2ca"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 36 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: \u0060trace!(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":"compiler/rustc_mir_transform/src/coverage/query.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e1492464b3b539ac5315f53265c0ecdab8377a9758eb6e15de35189a4e1bfbe"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 47 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: \u0060trace!(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":"compiler/rustc_mir_transform/src/coverage/query.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d4328e00acb45931f3e97f529afa695163f4e9776c16fe5d1b556752d94c316"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 52 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: \u0060trace!(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":"compiler/rustc_mir_transform/src/coverage/query.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"416bd4885a405aaf940299937acf7334b8c419cd344c4b3f6150fcba7618ba79"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 57 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: \u0060trace!(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":"compiler/rustc_mir_transform/src/coverage/query.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"1af6f4936fe038ebeee64587d621220d7e8817498db4b316734cc5e9e928d555"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 243 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":"compiler/rustc_mir_transform/src/coroutine/layout.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"52b6b6c7ca7bbba77ea8e29ceed9c8883051a5cb1a7e839419bb4888cb8b46d1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 244 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":"compiler/rustc_mir_transform/src/coroutine/layout.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"da23c5f9867b1268ab7da216be269a57d400751e831dfce0adf3326cc22f1419"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 364 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":"compiler/rustc_mir_transform/src/coroutine/layout.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a938627638218e9af910f8a381c8aa549c251c15da726a255f34eb76b5b394d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 587 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":"compiler/rustc_mir_transform/src/coroutine/layout.rs"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb6cef066bae793fbc47365abec647ce3aab45cb6b2ae6e43098270442bbcbcd"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 116 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":"compiler/rustc_mir_dataflow/src/drop_flag_effects.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"e34a8e904c3e2e4d1845ce85865f04b2fe2efc26eb5005fbd94536b11d394a5f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 121 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":"compiler/rustc_mir_dataflow/src/drop_flag_effects.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd0274faac0d31b184b075506b8b4483e2293722791554f9c7b69ed19acedf00"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 134 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":"compiler/rustc_mir_dataflow/src/drop_flag_effects.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"a38d6bc33e84d3b3e83499dc15943621cac82ed4c71158185369b8433142da83"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 20 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":"compiler/rustc_mir_dataflow/src/rustc_peek.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"885736476695278e419181775720be633ecac82cff127dd0cf1061b833defd84"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 45 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":"compiler/rustc_mir_dataflow/src/rustc_peek.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"a918b4312ef6e70d7ea06e023746c69232157089b64e74fdf7ec11c52c6c0c7d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 70 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":"compiler/rustc_mir_dataflow/src/rustc_peek.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"17103f009523983afbed10fa0d83d29368a14d729016bd1a0359bfcd6811fe4a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 220 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":"compiler/rustc_mir_dataflow/src/rustc_peek.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a2de2fb90db2762c23ceef9919835651c803899a5d26753063f498d169b31bf"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 352 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":"compiler/rustc_mir_dataflow/src/value_analysis.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"f84a03e14b4f0724b3a096271e2a2ed8ac4be808da9402758dd28abca7b125d2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 113 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":"compiler/rustc_mir_dataflow/src/move_paths/builder.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"007507d30a9b64eea7aa0c8972d977777842144c52de35d804695f653ca49b7a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 330 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":"compiler/rustc_mir_dataflow/src/move_paths/builder.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"b721f9fd1605123355cfa9022ff2f2e94c260b2a10c9354b307c49397235f3fb"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 331 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":"compiler/rustc_mir_dataflow/src/move_paths/builder.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"12c1824ac00726675d44bf86eac6e2b5184ecd4263006c5be16a31e97c49e971"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 333 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":"compiler/rustc_mir_dataflow/src/move_paths/builder.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"cda60ae907d462aaeff5b1e40410c9074940bd21fdcec47ded26d2e65b8638d7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 335 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":"compiler/rustc_mir_dataflow/src/move_paths/builder.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"adde3b54cc038588ca56e6263c12001662046cce6c36f2d6ba26e125b4bfccbf"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 337 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":"compiler/rustc_mir_dataflow/src/move_paths/builder.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b5cf828f3db5dcd697991ac3b6044a5f71d275b3ca2dd9cc097960c04d203d2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 378 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":"compiler/rustc_mir_dataflow/src/move_paths/builder.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"df31a708aa58d4dd76e447580e7ad22b58c3ad598e3525bb1876b89a7091167d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 386 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":"compiler/rustc_mir_dataflow/src/move_paths/builder.rs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cdfe2db9d2280f288d50ee749ebe77d2dab39407157826ec7ce490a4627d687"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 455 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":"compiler/rustc_mir_dataflow/src/move_paths/builder.rs"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"234ad13cda8e08da75e72b41e2e7329a33292b49034be81856b9378253985bc6"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 557 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":"compiler/rustc_mir_dataflow/src/move_paths/builder.rs"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f76c31074ca2f95fbfd3e78ab837c0eed6338a802cf83fad21e2106757d6d55"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 563 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":"compiler/rustc_mir_dataflow/src/move_paths/builder.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"9741198490952db0d925bc70154ffb54cfa4c903b6d7b5627998e3510e5f229d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 572 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":"compiler/rustc_mir_dataflow/src/move_paths/builder.rs"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f9c6e350c33681c6cb09a57b1d34268b7a6e630dd2b84a974e52dcdfa5b7c6e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 591 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":"compiler/rustc_mir_dataflow/src/move_paths/builder.rs"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bdde68b03ba04a2718a36ddc7a3bf88725bc06567d6506790aca4586a152b22"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 157 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: \u0060trace!(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":"compiler/rustc_mir_dataflow/src/impls/precise_liveness.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"656bc40304ada98c00175ab6b9833b3d2198a15b11046241d02c8e4beb3ba8a9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 45 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":"compiler/rustc_mir_dataflow/src/framework/graphviz.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"3137b5484fd2d6ea105cc499e87941ca340b11bc3e4f65a0b516c85950b166c8"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 389 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: \u0060error!(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":"compiler/rustc_mir_dataflow/src/framework/mod.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7861021cfdf02d0e38f4cfdf2c74ae3ecf5f3a383fdc9a170ab4b6e6716b0f3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 26 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: \u0060trace!(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":"compiler/rustc_mir_build/src/thir/constant.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"62abd94d4f09d7b9f362b5fd49774f12af6482d88e16dc448ac4cca4bdccf3db"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 28 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: \u0060trace!(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":"compiler/rustc_mir_build/src/thir/constant.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"4116091603b6def77fd73718cef8f0b2c7dbcdd6b02526315073b04d8140c4a3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 19 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":"compiler/rustc_mir_build/src/thir/util.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5043a530b1b3e9885989255b483f2cc5432efa6711897ab2638df89dbac4397"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 137 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":"compiler/rustc_mir_build/src/thir/pattern/mod.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ee4f3bc70bd2491a8ded49279bd7eb504b924c3c54b2c4163a2b4d9cb84a7cc"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 413 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":"compiler/rustc_mir_build/src/thir/cx/expr.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"593107813ca13f0f42ad8138863e5651feb2ba747082882d7d625461b776e6fa"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 523 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":"compiler/rustc_mir_build/src/thir/cx/expr.rs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"0785ff0db13e02debc3be3169a181bf33586ef40855148eeee808f659f79b52a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 734 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":"compiler/rustc_mir_build/src/thir/cx/expr.rs"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f54310bb150dfd1cc48f9ca700de403fa1656e9e50c8c03bfd5f4d3837eeb8e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 777 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":"compiler/rustc_mir_build/src/thir/cx/expr.rs"},"region":{"startLine":777}}}],"partialFingerprints":{"codehealthFindingId/v1":"35e9c52066131c47803999861e684c684060b5ef17235361824632d922346e9a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1178 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":"compiler/rustc_mir_build/src/thir/cx/expr.rs"},"region":{"startLine":1178}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f592f3335298be25ac395d3c429a597bb5d802633b419d036cc1687316d0e15"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1194 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":"compiler/rustc_mir_build/src/thir/cx/expr.rs"},"region":{"startLine":1194}}}],"partialFingerprints":{"codehealthFindingId/v1":"af18cf166af2fe5c4e6d36d9c4a40873113a9e443b44d57d19b5475860b180e4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1208 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":"compiler/rustc_mir_build/src/thir/cx/expr.rs"},"region":{"startLine":1208}}}],"partialFingerprints":{"codehealthFindingId/v1":"873fa975ff99eccb7f6f426f2e4bd61149af6c2b50f903c3852d149a1c4bfa87"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1258 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":"compiler/rustc_mir_build/src/thir/cx/expr.rs"},"region":{"startLine":1258}}}],"partialFingerprints":{"codehealthFindingId/v1":"5154aa90f5fe5cc2cbc41740b4598056640c69cec05a87705d310440b51c597b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1284 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":"compiler/rustc_mir_build/src/thir/cx/expr.rs"},"region":{"startLine":1284}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab1a65f7922055920d24cda29fde0b506172f321baede65b78bddc596bd273b5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1302 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":"compiler/rustc_mir_build/src/thir/cx/expr.rs"},"region":{"startLine":1302}}}],"partialFingerprints":{"codehealthFindingId/v1":"c45ad91be9db32ff5cd81780dd695bea79858c7e3365ddc274ded453a6504547"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1355 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":"compiler/rustc_mir_build/src/thir/cx/expr.rs"},"region":{"startLine":1355}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4addfcba39cfb05fceb4665e29853e25afd61030ee48b31f0f3a1a3a9a09158"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1410 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":"compiler/rustc_mir_build/src/thir/cx/expr.rs"},"region":{"startLine":1410}}}],"partialFingerprints":{"codehealthFindingId/v1":"825f2f6c0f563743f32d01d996a4655069799a8c0298980a649a1a7a53fe242e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1432 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":"compiler/rustc_mir_build/src/thir/cx/expr.rs"},"region":{"startLine":1432}}}],"partialFingerprints":{"codehealthFindingId/v1":"6969c6cddc8d615603cebfd6c2cb100772434a292efe17f741ae1fe27ab0f64f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1515 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":"compiler/rustc_mir_build/src/thir/cx/expr.rs"},"region":{"startLine":1515}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb6306b5a544f411e7601e266b97e9d637244e22625123ab45799e4dd05a5767"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1565 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":"compiler/rustc_mir_build/src/thir/cx/expr.rs"},"region":{"startLine":1565}}}],"partialFingerprints":{"codehealthFindingId/v1":"48ec1f924b706dfba123fc7fee719d19ba9aa8091764e27cf9eaaca150efb9a7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 297 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":"compiler/rustc_mir_build/src/builder/block.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e454f307af8f2e8b987468aaf889dc0d064ec72613bfeeea00ced3dc13b7420"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 62 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":"compiler/rustc_mir_build/src/builder/cfg.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"42c7962256cc65bb784150ad308c64053783829624fd6478a113e692303f33fc"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 141 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":"compiler/rustc_mir_build/src/builder/cfg.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"9270706a893683b795f95b30b0229fd07d28698723731f95a74b72dac422b21a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 21 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":"compiler/rustc_mir_build/src/builder/misc.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b9865012acbfce31b5c3adfd6ecc7773e202f887a48c816ac39e1471465ce3e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 333 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":"compiler/rustc_mir_build/src/builder/scope.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6a83a23acd853022a6942bb08bbba3ec5aadde1d1cba6525f0953a67ac5fd3d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 407 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":"compiler/rustc_mir_build/src/builder/scope.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"45091c4a44692d5e9cf9a1e1f0911dee566f42e4cc3552d57c5c4a60f7ccbb8f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 491 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":"compiler/rustc_mir_build/src/builder/scope.rs"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a7662ae92ee17e6644fa8aba7948df8105df38bcbbf16fd77d4e188c1c38f3c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 736 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":"compiler/rustc_mir_build/src/builder/scope.rs"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6560a220f3fff586cbb972992fc73edb6ff634c3f9c2a5deae729084ee3946b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1326 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":"compiler/rustc_mir_build/src/builder/scope.rs"},"region":{"startLine":1326}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5f14f09582128249fb88b1e9e8b029962d709f151e7d3933e62140e3981182b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1805 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":"compiler/rustc_mir_build/src/builder/scope.rs"},"region":{"startLine":1805}}}],"partialFingerprints":{"codehealthFindingId/v1":"673a2f5f306a136646d87c275b6d7803dd45a559dcd2ff812273ff98746b02ac"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 89 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":"compiler/rustc_mir_build/src/builder/matches/buckets.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"5291f89008c10f354ea6b529b1ce3d0fb92f64060bf6b15e3d52d746682d3339"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 90 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":"compiler/rustc_mir_build/src/builder/matches/buckets.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ba2c9bc5db9c874badbaf4f3c7e9292028ce042ace8b3694038a9bfd95e1506"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 409 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":"compiler/rustc_mir_build/src/builder/matches/mod.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9f2c987504dc3c0303701acb352cc673e27134be2edfbe77248f889cf1d7936"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 905 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":"compiler/rustc_mir_build/src/builder/matches/mod.rs"},"region":{"startLine":905}}}],"partialFingerprints":{"codehealthFindingId/v1":"b74ae8a54b3bfeca91df148fffe5e9efa675a4fa14395b1dc494808ef1bebb03"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1930 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":"compiler/rustc_mir_build/src/builder/matches/mod.rs"},"region":{"startLine":1930}}}],"partialFingerprints":{"codehealthFindingId/v1":"91a5791f89faea400a4fe0dc59179b09195e4b1dbe7088814cc07838824b97f2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 2395 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":"compiler/rustc_mir_build/src/builder/matches/mod.rs"},"region":{"startLine":2395}}}],"partialFingerprints":{"codehealthFindingId/v1":"be17b21570b6166bd020957a05ee122f5e347a623c1a47eff0c8b8216d8329ff"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 2427 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":"compiler/rustc_mir_build/src/builder/matches/mod.rs"},"region":{"startLine":2427}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8e19037916a29ce4f9baab0f9c61e991ea2bcc39631c8e05bbc80d8e8f9e1eb"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 2464 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":"compiler/rustc_mir_build/src/builder/matches/mod.rs"},"region":{"startLine":2464}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc0c8d9aff2ba97bfb83618b12a8c38d3c6fa6ba4825080ef0bc1e070a777509"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 2641 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":"compiler/rustc_mir_build/src/builder/matches/mod.rs"},"region":{"startLine":2641}}}],"partialFingerprints":{"codehealthFindingId/v1":"f63ba1ccc5ecfa5d2564621e6c8ec27525d13f20b6cf0ef2958a46b395a79379"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 2648 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":"compiler/rustc_mir_build/src/builder/matches/mod.rs"},"region":{"startLine":2648}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9246e6246f536feb2c8f2eab83554f5444b76f0e2ecbb0e0d2aa9b6868b6fa4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 2707 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":"compiler/rustc_mir_build/src/builder/matches/mod.rs"},"region":{"startLine":2707}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6169eb5fe12bb58c7acccbc7836a538f4ec4efb5c6bae4196e7363f678e5ead"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 87 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":"compiler/rustc_mir_build/src/builder/matches/util.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f96f85c5ba80f3137aebc952e6eb9d7411f1bb61858bb9040233de76c22eda5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 118 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: \u0060trace!(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":"compiler/rustc_mir_build/src/builder/expr/as_constant.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"d09eba5e46e60e085a1186cd96b5849078444282eeb1fdc2baebf30d1fd86809"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 120 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: \u0060trace!(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":"compiler/rustc_mir_build/src/builder/expr/as_constant.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"500a435f59af266272ae7337cbed2ab727573ac654bba200f5568ea11fee4eb6"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 168 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":"compiler/rustc_mir_build/src/builder/expr/as_operand.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"10663eee54fa56f4b771ed9b037749606d112cc736c645dfd2f8b4ca63fc11ca"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 190 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":"compiler/rustc_mir_build/src/builder/expr/as_place.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cf1beda7f40e2f5b856debabc1f751cc0b6f17b9e8b45205ac13dd6dd2e3566"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 424 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":"compiler/rustc_mir_build/src/builder/expr/as_place.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff5387f20bee13a0ae32d91d8a4ffcacb9279610291bb68d0e6e3b490e8aea78"}},{"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":"compiler/rustc_mir_build/src/builder/expr/as_rvalue.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba13dfe81f93940a27d60b7f929856a40ba60c0ae67af5acd6e670628fb00b4c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 159 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":"compiler/rustc_mir_build/src/builder/expr/as_rvalue.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e81cca64dd1b0f956f39a701150779fbb6aa3eee467d01abfe0813d9c17846a"}},{"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":"compiler/rustc_mir_build/src/builder/expr/as_temp.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8665a5ed63f5f07c685a2b79e37345e667a38a66215ce7c104f2bd306284755"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 501 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":"compiler/rustc_mir_build/src/builder/expr/into.rs"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ec87759dfbc2b8c1c312d27505dbe7ae3058925b0d9f6b0dd3bcb55ad27e3fc"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 40 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":"compiler/rustc_mir_build/src/builder/expr/stmt.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea22a756fcc64b6d9df6754910c326a22dacdb06c597af5beb0cf056f0220b75"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 70 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":"compiler/rustc_mir_build/src/builder/expr/stmt.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"d620f4932e59bae1c51c8640a85485901d774010af5ac7b5bfdbbeaa4405c2e0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 131 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":"compiler/rustc_mir_build/src/builder/expr/stmt.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"95cd41b738fc52c6dc98e045bc1767a36cd526fce98d5431b316b3c453587f3f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 42 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":"compiler/rustc_mir_build/src/builder/custom/parse.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"77f78dc548da5c07c799cf65009c876011d9aba853cd3192aade30453061beb2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 273 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":"compiler/rustc_middle/src/mono.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ca7cc6bef3d20c54cc29a78be630b224f234a8dd301a873e03fda841a07b151"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 375 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":"compiler/rustc_middle/src/ty/adt.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2d5097fbb969fffbaa0e8e1f4ba4d3da7b7817902becbf6e7f4d583f7938298"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 379 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":"compiler/rustc_middle/src/ty/adt.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5faea5fbb91e44d642eea574f706c1420fb3b245e30c007ec586b2aff18e9fd"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 383 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":"compiler/rustc_middle/src/ty/adt.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e0e124e3b10e357e6ae554420b2d5a7e3eefb1410829ce851905adc99e86744"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 655 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: \u0060trace!(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":"compiler/rustc_middle/src/ty/adt.rs"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8c3a2e0538aa3badbff00c7ef54bd7f172c224ac6f8eca3981cfb832f96c474"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\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: \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":"compiler/rustc_middle/src/ty/adt.rs"},"region":{"startLine":658}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd1632840df4e467d45ca2c5cd7b20441036678621a2064a69be39403b1e481c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1285 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":"compiler/rustc_middle/src/ty/context.rs"},"region":{"startLine":1285}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4ef20b4dfd0967108dd37d1770e7fad22df74ddabed41be50d7b16428ffd2af"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 31 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":"compiler/rustc_middle/src/ty/erase_regions.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"b22fb8e5fa37379ae282e0d713eb35c26c9a997fc5d1191586061a4721cdafde"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 33 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":"compiler/rustc_middle/src/ty/erase_regions.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"e817e41624f6d31dd5585c90c58a8a692ffe05d02e471888d88e444ef4cde706"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 57 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: \u0060trace!(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":"compiler/rustc_middle/src/ty/impls_ty.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f54817e9b470a9011c66388cc711ad0c1bb2f36a0574aebc5eb3e08f5127427"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 661 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":"compiler/rustc_middle/src/ty/instance.rs"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f38568d62f6c6d24abf335d7ad8c7ada42a7cf4892a204b7501f78004f0fbd0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 711 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":"compiler/rustc_middle/src/ty/instance.rs"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"c782875e5eca8460b4d4917752bf6e979c78417ad3498986eda55e271496cc5b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 754 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":"compiler/rustc_middle/src/ty/instance.rs"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7fc14e2262c0d14e3b64498b567ff103b2f0cceb00c3f08eaa77a6e27c74fc9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 767 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":"compiler/rustc_middle/src/ty/instance.rs"},"region":{"startLine":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"1df3443ce6bb965105bf7dfcadc74786a989d09483e35faf29e31d537271b976"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1226 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":"compiler/rustc_middle/src/ty/layout.rs"},"region":{"startLine":1226}}}],"partialFingerprints":{"codehealthFindingId/v1":"5348ce0baf80071b5867dd8198710b71aafb2ed05465943116563140adadd9e5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 927 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":"compiler/rustc_middle/src/ty/mod.rs"},"region":{"startLine":927}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6fe671981b0860550de344249d97b421b829d2410b4117ab59d8f73c9c5c6f6"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1881 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":"compiler/rustc_middle/src/ty/mod.rs"},"region":{"startLine":1881}}}],"partialFingerprints":{"codehealthFindingId/v1":"2adf811355307748c35f03b23cc01596793a2ce9fe4ab698ea6542f902906c2c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1883 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":"compiler/rustc_middle/src/ty/mod.rs"},"region":{"startLine":1883}}}],"partialFingerprints":{"codehealthFindingId/v1":"70e38985ca03c2a12af9a54f5ac97b7c6a1d912b81b15ea4db34d3f3f5b52d28"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 51 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":"compiler/rustc_middle/src/ty/normalize_erasing_regions.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"91245a565b2279eddcecc188b429c9cb12aaaeb6399f800e64d538445e2480e5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 112 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":"compiler/rustc_middle/src/ty/normalize_erasing_regions.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f0d359ee76a07fb26182c18fc505332c56799de37823718a9b7c27b6cae1bbc"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 193 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: \u0060trace!(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":"compiler/rustc_middle/src/ty/opaque_types.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"3757d4641a5dbd3d078ea15341a1be1ec1d44a4a8ebf0dd02589a864c6cf4f85"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 108 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: \u0060trace!(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":"compiler/rustc_middle/src/ty/typetree.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec114fabb74f169cbd93d929153d39ee44bc6be2e6fe178654aa7d472bf9b855"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 468 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":"compiler/rustc_middle/src/ty/util.rs"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"44656e58d5998c3b00e96f849bcf9318a4b5efb36055f32ff981e4e621d8eb2b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 535 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":"compiler/rustc_middle/src/ty/util.rs"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"6958042ad19570136cc2e24392cb306f88dfd98b84043210d29bf693b90ace73"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 256 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":"compiler/rustc_middle/src/ty/print/mod.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"a96b6ec60acf767cf9d5bc8b920368ccd931ae54e73048dc1378b6ab9ab640a5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 495 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":"compiler/rustc_middle/src/ty/print/pretty.rs"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"7077e1023fed1b435ec30b9f687ff07c5fb3aff5990a7af8d330618915c73cdd"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 560 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":"compiler/rustc_middle/src/ty/print/pretty.rs"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"e74c385da4f3a7e6544efda455929e5537112858e4ae7c3219c1087f96913464"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 583 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":"compiler/rustc_middle/src/ty/print/pretty.rs"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce5a37df20f7b851372714873ac568adec1dfbba02ea76f194a68e9799801ed6"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 589 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":"compiler/rustc_middle/src/ty/print/pretty.rs"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e0a52c7b3149c028a3041e2621bacd2512b56f9e6a36a0f88f63c6dc0516ec4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 650 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":"compiler/rustc_middle/src/ty/print/pretty.rs"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4e63b469e67f8de3a27b1398fa8e774438a1f866727f089cc19ae9ec6a3da52"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 2216 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":"compiler/rustc_middle/src/ty/print/pretty.rs"},"region":{"startLine":2216}}}],"partialFingerprints":{"codehealthFindingId/v1":"72f32022a924d237e9cfa866ebe0589dd63f9c82d76e4b8a6357e69b7be0f037"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 2229 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":"compiler/rustc_middle/src/ty/print/pretty.rs"},"region":{"startLine":2229}}}],"partialFingerprints":{"codehealthFindingId/v1":"723948b461dbf19253f8403eda8c52d871255b6f7d2d06aa201a8138b516a54b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 2845 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":"compiler/rustc_middle/src/ty/print/pretty.rs"},"region":{"startLine":2845}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4128b2f73c423681f118e8225b15d9a1290044c5817921c0a26f65f36415586"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 2965 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: \u0060trace!(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":"compiler/rustc_middle/src/ty/print/pretty.rs"},"region":{"startLine":2965}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeee704c54aac1a679ab76636c0a22481c86179ed23dbb133bba449986a2f2c9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1715 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":"compiler/rustc_middle/src/mir/mod.rs"},"region":{"startLine":1715}}}],"partialFingerprints":{"codehealthFindingId/v1":"f81a88b91b522df19fde5ed4dafadfb78f031754c09ccfd8e886de19b1eecd11"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 691 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: \u0060trace!(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":"compiler/rustc_middle/src/mir/pretty.rs"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"47c0bc7210a0374fdf4b59ca5393d4f4b174c424dc7519bbfdb7e3c46cb43c52"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 111 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: \u0060trace!(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":"compiler/rustc_middle/src/mir/interpret/mod.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"568a721c28efce7faa643dadfe7be9f414f7d54c461d9b27fbfa8708b5740d4a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 116 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: \u0060trace!(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":"compiler/rustc_middle/src/mir/interpret/mod.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"e687248920f8814a1d63e2d3b5a800a16d5beae7515dd401682e84e49d9fad23"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 121 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: \u0060trace!(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":"compiler/rustc_middle/src/mir/interpret/mod.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcde18b8a3721e6a9d130a9b4133e31134a49cf11c285476d9fe650a152e73b6"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 127 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: \u0060trace!(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":"compiler/rustc_middle/src/mir/interpret/mod.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"7771efc0991eb98fb2eff84794feb8a576ef9c621ab519ac1efac04aa532bf10"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 216 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: \u0060trace!(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":"compiler/rustc_middle/src/mir/interpret/mod.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ff0f3894366e43e7c1e05f6d6ba3c2256d666cd188e97cceea9232bf4a214fa"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 222 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: \u0060trace!(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":"compiler/rustc_middle/src/mir/interpret/mod.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"66ca86482df9a597787b078c4d23f8f2d83e16199cb55f7cf8429ec606baa5e0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 229 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: \u0060trace!(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":"compiler/rustc_middle/src/mir/interpret/mod.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"04a49c4f9c0e4d26e8b3b4b00d22cda5bf05fa2f7bac64b9e795662e727e4904"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 235 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: \u0060trace!(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":"compiler/rustc_middle/src/mir/interpret/mod.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"8146e206c0cc6e29a6c585644075ee724910e430fa79602b6d54170c727c4eeb"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 241 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: \u0060trace!(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":"compiler/rustc_middle/src/mir/interpret/mod.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"53088dd86b40ca1c4a1ea02c39348d103c010af853a37f27fb644d3b2e8d4c87"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 474 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":"compiler/rustc_middle/src/mir/interpret/mod.rs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"5403dfc888f78cd440513fef0dadf243a51f23600b852d9fe7703bcefe6680e8"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 448 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: \u0060trace!(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":"compiler/rustc_middle/src/mir/interpret/allocation/provenance_map.rs"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa65aee666d7f205f8fe2a1ca13a5ef3ec4f1dbd44659de6725fc013b5bd6f32"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 250 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":"compiler/rustc_middle/src/middle/region.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"a06e0dd5f9aef394834bf5e14cf2f26d3be0c0eb5e779fb6ae7ee91b5bf13c03"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 259 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":"compiler/rustc_middle/src/middle/region.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"d97c185431e40bbab246984c173b96a4c602f967bf7779473b6e83dc6104447d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 289 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":"compiler/rustc_middle/src/middle/region.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"f77fe175c314bb4e6aa96dabdd8f93de47b7bc3b3784a710abaf134ff76c410e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 293 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":"compiler/rustc_middle/src/middle/region.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"9558784cdb952664bb69e2aa109d9e69deee452ba2052fdecdcfc52443c9341e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 300 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":"compiler/rustc_middle/src/middle/region.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f89fab8ca77a61320709c84791a298531634f19cea44ddfb110158d724a71bd"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 315 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":"compiler/rustc_middle/src/middle/region.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d0b92b359be7654f31766478e28c54b7b6dda7771ded805dce30a741bab762e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 319 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":"compiler/rustc_middle/src/middle/region.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d3ad81c701f76849beddba0edd8dc2cb58e135481cee71196ef4a0b8bc95a7e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 349 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":"compiler/rustc_middle/src/middle/region.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"6240f481e3537183b0a42f3d037c8d075ae6799c459485032ebad848a3b9cccc"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 344 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":"compiler/rustc_middle/src/middle/stability.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7f22bf78b418cfdc1715b2b6d5237f80b4da4eda11e9d0f6ac99d9d857d2e94"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 357 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":"compiler/rustc_middle/src/middle/stability.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"a43a5b3fafd649d4f3c30e119625c841f03bf6284c86d7d9e366e2004d4ffb5f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 422 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":"compiler/rustc_middle/src/middle/stability.rs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"adb7916c8573924da96aef6e53414ec709d749a5050359e58429d8669184644e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 432 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":"compiler/rustc_middle/src/middle/stability.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2596cf52ae45a116e85c77a97dbaf87418cc5a62386cce0ef48fb6b3402eaf3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 550 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":"compiler/rustc_middle/src/middle/stability.rs"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"08574b0898ea3f93af0ae437a882be5d48896c572032aec6e98ebb0cbc9b3de8"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 563 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":"compiler/rustc_middle/src/middle/stability.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1bb431b68a8f7b3d1ec82ee635ae0ec09c98cfd2b24bedac018e6f94af394eb"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 311 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":"compiler/rustc_middle/src/dep_graph/serialized.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9fd392498396f2f31bfe9ac1e2c2f7c5135e9402ce571d144c43ce621d056fb"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 317 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":"compiler/rustc_middle/src/dep_graph/serialized.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e5a99b09f86be7363b7507676b7dc9b87cb925ce1198a0fb61b26ef0f1cc0f1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 323 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":"compiler/rustc_middle/src/dep_graph/serialized.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"75e142d23e18f9cda9afc370543568c53fb2d152346ada1c7acfab81d2de0d44"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 818 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":"compiler/rustc_middle/src/dep_graph/serialized.rs"},"region":{"startLine":818}}}],"partialFingerprints":{"codehealthFindingId/v1":"033894dd8c9635c895561ff9f012d282ea196b1e09945829c45db0d7b03db411"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 822 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":"compiler/rustc_middle/src/dep_graph/serialized.rs"},"region":{"startLine":822}}}],"partialFingerprints":{"codehealthFindingId/v1":"52bc815296b673d79d5cc285e01dd1d8acaadb3d8d80ffb5a4268a499913d2ea"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 688 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":"compiler/rustc_metadata/src/creader.rs"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"01c247ece3c884dc54733fbb8f2730f77c34e985d8b6e2f43e04217faa62c3d0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 839 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":"compiler/rustc_metadata/src/creader.rs"},"region":{"startLine":839}}}],"partialFingerprints":{"codehealthFindingId/v1":"433d0ba015b0605740eb1cd5df485946a9762b7624353c7f4281f764b50fbd37"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 866 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":"compiler/rustc_metadata/src/creader.rs"},"region":{"startLine":866}}}],"partialFingerprints":{"codehealthFindingId/v1":"779f53e95afe770390fd3d6ad0b1c462cd55a1981e5dc59f77b316f9f75443fc"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 921 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":"compiler/rustc_metadata/src/creader.rs"},"region":{"startLine":921}}}],"partialFingerprints":{"codehealthFindingId/v1":"081f50adb2c0ddb5e7cb0a263c0935acb15545c6389aac5e4e4ed094412059c2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 936 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":"compiler/rustc_metadata/src/creader.rs"},"region":{"startLine":936}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d828da74dc5a370931b85c11a5858b0e6c64dd86c2dbd054b50a1acf876cba3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 962 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":"compiler/rustc_metadata/src/creader.rs"},"region":{"startLine":962}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd7a6ba3c1c0d37a5d2bea5fb633c2a2e02740fe612a35f34ec217b79fa2bd3e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 981 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":"compiler/rustc_metadata/src/creader.rs"},"region":{"startLine":981}}}],"partialFingerprints":{"codehealthFindingId/v1":"39a6f6557f0e9ab2d1328286e90f84ec8489f1f8976f670ae565f66c90028a09"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 1008 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":"compiler/rustc_metadata/src/creader.rs"},"region":{"startLine":1008}}}],"partialFingerprints":{"codehealthFindingId/v1":"c71f05c17325c3ba5348808d3533300c1657e7209c18964f5e42c3a1b9dc5d92"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1034 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":"compiler/rustc_metadata/src/creader.rs"},"region":{"startLine":1034}}}],"partialFingerprints":{"codehealthFindingId/v1":"f315f120244476c92352775f12b3a8f42efddeb861b70021d3ea9b468ff4d47f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 1098 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":"compiler/rustc_metadata/src/creader.rs"},"region":{"startLine":1098}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfbbefaab1d28b5219be44871ccb72df063e03551cd78388ebd1f1d1b481fbd2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 1310 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":"compiler/rustc_metadata/src/creader.rs"},"region":{"startLine":1310}}}],"partialFingerprints":{"codehealthFindingId/v1":"64f8c0061dd5be8455014286aa6b8d0ebb10d5272e1413310be9ed30399b7d21"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 1413 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":"compiler/rustc_metadata/src/creader.rs"},"region":{"startLine":1413}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9710d34d39605a862cf623ac27430b687cd2db7516cef1999a3ebd2e77f476c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1426 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":"compiler/rustc_metadata/src/creader.rs"},"region":{"startLine":1426}}}],"partialFingerprints":{"codehealthFindingId/v1":"232be94b03ffc41cf4e3bf6cb255abf189c301fd3f6124cb903dbb15ddafe4d0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 195 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":"compiler/rustc_metadata/src/dependency_format.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d0355b981e615428d129c3b15c5558021577d399a4fae00c817261e1103635b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 202 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":"compiler/rustc_metadata/src/dependency_format.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"087606e3d5ddd706b2a40841dd6d87b196e92ba9b2e2b6d6950367835045bba2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 206 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":"compiler/rustc_metadata/src/dependency_format.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"74f1eb71f675c04ce4219e993ef4415b463813bdfbe31cae6417ca80f40283e9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 246 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":"compiler/rustc_metadata/src/dependency_format.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"131e1e17a5856744c1e3682991503f9e84f46e5347e67b583e4c6efa9d1ece78"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 49 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":"compiler/rustc_metadata/src/host_dylib.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ec8c3fa1ffc90981ce698d31ffa009321ac3889bfe29a9f4a0c9583df86e71b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 53 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":"compiler/rustc_metadata/src/host_dylib.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"f625aca41cc4ef90417280097ff7632bb6a76956657c636a8c6f97e068e71a9e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 64 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":"compiler/rustc_metadata/src/host_dylib.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"33e5b8c78577b827a48b3edd5840c43094de8707a99774fc00c1a5c7a457a9f7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 76 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":"compiler/rustc_metadata/src/host_dylib.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c272ef306235975073ed7e672c2d1776d26054f06fd94b4c064a52914ef5d6b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 81 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":"compiler/rustc_metadata/src/host_dylib.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"28309900b19492e7a6cfa7fa385f0b384c1da5fb7a342dcd3a03ec6ad1fc8bee"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 131 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":"compiler/rustc_metadata/src/host_dylib.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"e70158d11d2877409050c11819c6cad50fc1462b24073d502b0a3f275617ef0c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 138 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":"compiler/rustc_metadata/src/host_dylib.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"b807ef7d734b98532122129edf5ee3fcbcbeb155c63891fc983f5295270dc91f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 142 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":"compiler/rustc_metadata/src/host_dylib.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"20130067fc492c4116182810915cb68f847d91ca3a046cf5eb45e0978da3bc68"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 447 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":"compiler/rustc_metadata/src/locator.rs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"926c12a65824012e18ba3e796cbf0425e49807e24e189c762aec5200a7d4ee1b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 598 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":"compiler/rustc_metadata/src/locator.rs"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0b98675d5c2b702520b1a9c929e299b296bdd3877e96c8b8fab902dd9ff0ae4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 628 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":"compiler/rustc_metadata/src/locator.rs"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"b23f51d67a4d9c109145ba28ddf80b73fd59b48837200ac4369b21d84563f860"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 638 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":"compiler/rustc_metadata/src/locator.rs"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e2900b46d27cd7bc2d808ac3a9fb40011749fcbdbef0cbf3a7f88f9fca51426"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 651 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":"compiler/rustc_metadata/src/locator.rs"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"496bbb10c5c03565f7564f81d38ad1f5bfd37b42bd90ded073a8c1722658ffac"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 706 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":"compiler/rustc_metadata/src/locator.rs"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd65c1388a445744f1387bc5435c17e3969509e25e08892e23cc401c1411df23"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\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: \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":"compiler/rustc_metadata/src/locator.rs"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"830f40ed03733833b0f5ce6023f269a140eb1ae1c0e1ac6cfe90f902d7579414"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 730 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":"compiler/rustc_metadata/src/locator.rs"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc74b439eb2657c38ff663d67d5d6dbc485e3bf0add87e5244798dd9a9dccb61"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 745 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":"compiler/rustc_metadata/src/locator.rs"},"region":{"startLine":745}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5e4dd907bea755530f0f758157c97a7a3565196e4012c841763b5e1b0d9438c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 851 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":"compiler/rustc_metadata/src/locator.rs"},"region":{"startLine":851}}}],"partialFingerprints":{"codehealthFindingId/v1":"54e73824bdba2067d54b4170147c6a599c66f921e59f2d2bb430e46e37abfd14"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 875 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":"compiler/rustc_metadata/src/locator.rs"},"region":{"startLine":875}}}],"partialFingerprints":{"codehealthFindingId/v1":"59a0d71d2a50f232bccae60812be24c3b1e5acfd3b13715358e9da48960b0f53"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 888 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":"compiler/rustc_metadata/src/locator.rs"},"region":{"startLine":888}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3332fe73e6145e735a9253cb86d2908beff402d90bd66a9731a7eaa3424f5ad"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 480 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":"compiler/rustc_metadata/src/rmeta/decoder.rs"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e1c461eaeb2dc7cecdc9535b47658bd8ca7e7ab1dd51b177a2da78f231c0eed"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 652 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":"compiler/rustc_metadata/src/rmeta/decoder.rs"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f32934babe456ed1d07afa1a6a94878012f8f91afb4798edeecad041fb4ca87"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1677 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":"compiler/rustc_metadata/src/rmeta/decoder.rs"},"region":{"startLine":1677}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bd68bf4140cd4b6b2fe531b1e1611a3596a91a0780849ab210baf87a156bb0e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1789 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":"compiler/rustc_metadata/src/rmeta/decoder.rs"},"region":{"startLine":1789}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1c27b93c0b7fdf63ed9b932a728453edb427fecfa810163368061d4e89c1ac1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1803 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":"compiler/rustc_metadata/src/rmeta/decoder.rs"},"region":{"startLine":1803}}}],"partialFingerprints":{"codehealthFindingId/v1":"d846008a55eb0db1572fba1fd68032aa0b3d8d629ff09677b507730ddfb6f404"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1945 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":"compiler/rustc_metadata/src/rmeta/decoder.rs"},"region":{"startLine":1945}}}],"partialFingerprints":{"codehealthFindingId/v1":"6924bc06037db2bcb6241b67b3c5097d4452825dae10e5a504896a9d91fd8dc0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 721 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: \u0060trace!(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":"compiler/rustc_metadata/src/rmeta/encoder.rs"},"region":{"startLine":721}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0068bd346fd2cc1d04eb10a3844a3b670a39365580a1f0140a4bc9a301c9ca4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1879 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":"compiler/rustc_metadata/src/rmeta/encoder.rs"},"region":{"startLine":1879}}}],"partialFingerprints":{"codehealthFindingId/v1":"53d21ac1fd8af5310523a55152589e695e859169309963dbdce819b79dd3251e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1885 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":"compiler/rustc_metadata/src/rmeta/encoder.rs"},"region":{"startLine":1885}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d1a732664777661b7c8e861c7ed27ab41dbcad4e4302d6a4f00e031dee4bcc2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1953 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":"compiler/rustc_metadata/src/rmeta/encoder.rs"},"region":{"startLine":1953}}}],"partialFingerprints":{"codehealthFindingId/v1":"e369f122c2f99318371d8896a2b374950241f29a31f5fd6b6579e8bc4f03bd9e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 2633 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":"compiler/rustc_metadata/src/rmeta/encoder.rs"},"region":{"startLine":2633}}}],"partialFingerprints":{"codehealthFindingId/v1":"83bf884617bbbeeed0f7e0d8e6637303c9acaddcebea335f3410c4f9968a57f1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 329 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":"compiler/rustc_lint/src/context.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fd474664aacdcac98749d29f9bdbc832b8629cdf90945027e8040460f546173"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 369 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":"compiler/rustc_lint/src/context.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"71d38e24d0bbacdda0ad94e7fc6cdd1776e9fbaa6bba33be93de3ab632b7fafa"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 57 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":"compiler/rustc_lint/src/early.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"3efd0c588169f5a4b8a19aa361e38cf198fe1c9222661a1619f519bf73e61b68"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 60 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":"compiler/rustc_lint/src/early.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"fee35fd7efa5734e9d4848422197e3607f717bb309d535c4c5d12db45c78ce4c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 114 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":"compiler/rustc_lint/src/foreign_modules.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3a26082139121d19f2020dcd2072f7a1fa21c50bdef546ce15eed9e31ac220b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 216 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":"compiler/rustc_lint/src/foreign_modules.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee454846e2880e9cb0228c86fcaeea4105e04b14d86926f68877a982f76db2d1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 237 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":"compiler/rustc_lint/src/foreign_modules.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"40cd584b24fc7e137f9abb009e6dc1d7640a9ac1e688fb824a3b1e7c57fa8da1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 58 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":"compiler/rustc_lint/src/late.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eb59bc5ca76801fcbacf4e70fee304883c9b5fc1b0d78df9314612d27d43047"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 64 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":"compiler/rustc_lint/src/late.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"fce4de611c19f0fcb4b41b60cd30c89ab1dec5df5109a23e63c64359ee149e1c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 590 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":"compiler/rustc_lint/src/levels.rs"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"8467ecc44aa3b93fe86f876b9ff63f0378ea8d49bee15e49d59fb31c7a73529b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 86 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":"compiler/rustc_lint/src/macro_expr_fragment_specifier_2024_migration.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"67065b4caf85e9b33f800576ead106dab63bc9f1d69b831432c47aec7f067870"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 121 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":"compiler/rustc_lint/src/macro_expr_fragment_specifier_2024_migration.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc6e51ff857fb305780b45a2984b93375da9eaa8ecec3942ce2ab0978d24b12f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 125 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":"compiler/rustc_lint/src/macro_expr_fragment_specifier_2024_migration.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"15da7f4162e7fb9c4efbee669c52ee0fd8d6ce902d3ccde57a7a26ef6cd8fd5f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 909 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":"compiler/rustc_lint/src/types.rs"},"region":{"startLine":909}}}],"partialFingerprints":{"codehealthFindingId/v1":"879db4fe0cf04b076faa5751b7a9aef789b75b267feb23245a75b249ffc336fe"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 953 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":"compiler/rustc_lint/src/types.rs"},"region":{"startLine":953}}}],"partialFingerprints":{"codehealthFindingId/v1":"d05c940bde7f1743773959189f1b2aff2647c362befeb601bcad90fcbaa66c5d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1058 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":"compiler/rustc_lint/src/types.rs"},"region":{"startLine":1058}}}],"partialFingerprints":{"codehealthFindingId/v1":"40f9dbc96366a233a11b6a01b0567f55516c556d989fde0627743abdfd40a54e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1070 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":"compiler/rustc_lint/src/types.rs"},"region":{"startLine":1070}}}],"partialFingerprints":{"codehealthFindingId/v1":"13f1c621d01c8133f0fb3db5eb9d7954271323042bb25dce0c5bbd9ca0a38ffd"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 439 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":"compiler/rustc_interface/src/passes.rs"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff5cb030384d1d27fecc3cc8392d77ff10c29d406b0c98e1cf766ee94d17896f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 647 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: \u0060error!(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":"compiler/rustc_interface/src/passes.rs"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"922429f38662e6d6bab6460342d3cd2068bd30871f5f3ac8003c2d0e6960adb4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 1326 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":"compiler/rustc_interface/src/passes.rs"},"region":{"startLine":1326}}}],"partialFingerprints":{"codehealthFindingId/v1":"799a49a82eb92e58b9f9ce82fd6770a0b6c5cc30fc36e9fb9cd09f98ccf074a0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 1359 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":"compiler/rustc_interface/src/passes.rs"},"region":{"startLine":1359}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b620aa6135db302bba6023626882a10083c9095d194f6c7d42ce1b7c4ece8ee"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 580 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":"compiler/rustc_interface/src/util.rs"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad0ba3136114de87adbfc3283c58156154976cb22456ca50a89378abfb4335c6"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 596 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":"compiler/rustc_interface/src/util.rs"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6f04e040dd70b1c101bd9bc41bcb4dd5100bd49a7f5decd013055512aad75ef"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 170 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":"compiler/rustc_infer/src/traits/project.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f0c045d42e70fd0415225ca651304dec1bb02f7971b960fecfa3b92e8978faa"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 192 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":"compiler/rustc_infer/src/traits/project.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"895b4cbc68fa2881f31a276458f2f29deb0ccc71aa7c602880938165bfe242b7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 205 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":"compiler/rustc_infer/src/traits/project.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"697c2caaf9ab04387238d448d3a0a3737db953e2a19d426f26ed73b9bd0695ab"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 90 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":"compiler/rustc_infer/src/infer/free_regions.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f411e3c3c58ed24d843edc0b34bb4da2a0291522adbeaffdf60edb1baee551a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 101 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":"compiler/rustc_infer/src/infer/free_regions.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cc57e94c277600ca228b462877c10345c74fe7f50e2a03c96992167c6f2de33"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1624 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":"compiler/rustc_infer/src/infer/mod.rs"},"region":{"startLine":1624}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5d3505b6e77dfa33c797b8b8fa4a666ae7a092680e0d8ba19f4743b2c558c7a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1653 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":"compiler/rustc_infer/src/infer/mod.rs"},"region":{"startLine":1653}}}],"partialFingerprints":{"codehealthFindingId/v1":"45256e430b1820c9f9252be5dc3a364ebe90478f0605893278c1c59e7239744d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 232 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":"compiler/rustc_infer/src/infer/type_variable.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"b39f9d5bc119892e9e30888e4636d35341299af2099d9fc1a2e36e385095b3b5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 87 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":"compiler/rustc_infer/src/infer/snapshot/mod.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccfc017598514f8af7b2986a01fe5072946dd4877df6e05d43f4959571a40cc9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 139 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":"compiler/rustc_infer/src/infer/snapshot/undo_log.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"b559586aebf673ab56ec49fa84411fc57696cebe25758549e3748caaee22f6f7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 159 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":"compiler/rustc_infer/src/infer/snapshot/undo_log.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"33576eb084b0d394ede7634d1c576ec6a6a3c2843c95cdce3e22d818168f2d48"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 434 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: \u0060warn!(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":"compiler/rustc_infer/src/infer/relate/generalize.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"229901c33bfcce956bd5879f3040251c629bf4d11a96bce009eeacec2472a738"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 570 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":"compiler/rustc_infer/src/infer/relate/generalize.rs"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfdf8358553ec7033619c20ae7573c0f67e4e7692002f65456acd5e165c22124"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 588 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":"compiler/rustc_infer/src/infer/relate/generalize.rs"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"f533a2981ffd00efb2530b7c0982ff46c497934065d4bd157e43a746ab0b9eea"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 739 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":"compiler/rustc_infer/src/infer/relate/generalize.rs"},"region":{"startLine":739}}}],"partialFingerprints":{"codehealthFindingId/v1":"336139587fddcc6c5fe8321abba9638974bbfef634a6edfa8483670e39f5ddac"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 237 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":"compiler/rustc_infer/src/infer/relate/lattice.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1c2ab5ab74e1823de07f71790c7695fd91efccc0d9bfa6eaf702cea8f48ef75"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 151 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":"compiler/rustc_infer/src/infer/region_constraints/leak_check.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"443068ab8affba616479dd9cd9beaf5706ac883129c5291ffd55d515ca822e8b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 201 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":"compiler/rustc_infer/src/infer/region_constraints/leak_check.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"c54759e0c66d0e6ad7dfeb05069a02afda3f6ce0733fa6230d7d79177c531531"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 230 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":"compiler/rustc_infer/src/infer/region_constraints/leak_check.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d0f2669c279e85b5eb1b42ba83b9d899c765abb2a30b5e202b2228e6bd2affe"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 272 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":"compiler/rustc_infer/src/infer/region_constraints/leak_check.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"666854385a187b0a5a320e777a19563fa70499cb1033506fd9e51782392b42fd"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 507 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":"compiler/rustc_infer/src/infer/region_constraints/mod.rs"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a9c8bb9502b1c6b3b90f33bf1b0faca793e97bb1680e04c2da7ffb0afb574bc"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 521 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":"compiler/rustc_infer/src/infer/region_constraints/mod.rs"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf1bd568de3ae9055004c00f57a75f588c1290c5d5d03004c03b3342f935a30b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 532 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":"compiler/rustc_infer/src/infer/region_constraints/mod.rs"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"101bc5507dbecb86ed59e2f8efb10e5729be18e838b22e9654cd7e5b1b1f5e17"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 541 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":"compiler/rustc_infer/src/infer/region_constraints/mod.rs"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bd5da65594d271c48eabd8399fc14a4bd12611e6f70f67df3d176a42c3cfda8"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 579 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":"compiler/rustc_infer/src/infer/region_constraints/mod.rs"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"2086433abbf5545fba5984397573be129727b9ae69c556746c0654e2f4825a10"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 607 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":"compiler/rustc_infer/src/infer/region_constraints/mod.rs"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"a06cc946093a897cde6be3a948bc5378eb4f0a75eb9805aac01242813a4ce071"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 652 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":"compiler/rustc_infer/src/infer/region_constraints/mod.rs"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"b925c8de82bf83547cda6ad4fcc1305db717a5de2c00ba3c75cc5dc4f767f712"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 716 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":"compiler/rustc_infer/src/infer/region_constraints/mod.rs"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdb121ca99dbabc0553a4fb1b095859e78ac3eeb1d6866217c6ebd51d72cedb0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 734 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":"compiler/rustc_infer/src/infer/region_constraints/mod.rs"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"f94f788aebabf615acf293553630215dc0df3afad5d933aba445f7c86045dee1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 807 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":"compiler/rustc_infer/src/infer/region_constraints/mod.rs"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"e94e82ed35353faf16c9b5d0298ffed68692cfe8d87b5b4050c805b8d7c099d9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 67 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":"compiler/rustc_infer/src/infer/outlives/env.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"e25a9ae84341cacc09271b1b06c9a78da41c5ec2a209b1fc331dcf822fc3e4bc"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 691 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":"compiler/rustc_infer/src/infer/outlives/obligations.rs"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f8e15f25fa9fd7e2250078927f9a94beced675021203a1df4d914fc61dd2b4d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 55 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":"compiler/rustc_infer/src/infer/outlives/verify.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"7093d5032782f6fb770d56ba574b3eac3d93b9adc84e90b1dceea23cd0fcc4f7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 63 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":"compiler/rustc_infer/src/infer/outlives/verify.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ee8356c5dcf2b67265792f286525e8cdb44c900c896f0b10b7ae56a3366a83e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 233 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":"compiler/rustc_infer/src/infer/outlives/verify.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc3a448e82393f1ed7a8c5749785613b82fce90ffc5d37ea17629c0d249c6328"}},{"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":"compiler/rustc_infer/src/infer/lexical_region_resolve/mod.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf4081aea447984062818f38b29e0a89ae16df4bd5b90197e04a70d2f28df1ee"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 227 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":"compiler/rustc_infer/src/infer/lexical_region_resolve/mod.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bb78403277042016cec17a3ca4225a4fe0622a62fc5044f27d7f0f52f36e1b8"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 247 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":"compiler/rustc_infer/src/infer/lexical_region_resolve/mod.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"82583472f1e1614d7d8ac6fa45f53efefd8f9d3445cc924b7676ebdee37aacf1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 331 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":"compiler/rustc_infer/src/infer/lexical_region_resolve/mod.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"c241c606fd54787830975a85d52fe1aff349474055b3fe7784ca24135b92fb30"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 350 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":"compiler/rustc_infer/src/infer/lexical_region_resolve/mod.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"0da430b8efb0708ea9321d9c1ee9d38f8e7921e822da0fe5ef8b83006801ae0d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 381 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":"compiler/rustc_infer/src/infer/lexical_region_resolve/mod.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b98dc59b9c99a26ab090ccf1af8074286aba2e7da041706ec84efafd69ace9f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 565 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":"compiler/rustc_infer/src/infer/lexical_region_resolve/mod.rs"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2bce5002c97fda2e5d92e938fb4addb44b82293aac135189895538ee5ea18e5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 580 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":"compiler/rustc_infer/src/infer/lexical_region_resolve/mod.rs"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"a24699b4b8809cab469b28595a78e52ad92be876b6053aaed250d329ece2f34e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 590 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":"compiler/rustc_infer/src/infer/lexical_region_resolve/mod.rs"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"81f397b9b29ba68df0177f705004a1cfa77eff9c50f9bb8178fbc8906033a9ad"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 605 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":"compiler/rustc_infer/src/infer/lexical_region_resolve/mod.rs"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c0bf2f678dd25c4798a051d0eff15b96f2cab934174a0469b8961d165a6fa19"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 614 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":"compiler/rustc_infer/src/infer/lexical_region_resolve/mod.rs"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"efbe127ccd054d82fe176b8cdc50f9a01836b006626927a4b5fc711117efc142"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 635 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":"compiler/rustc_infer/src/infer/lexical_region_resolve/mod.rs"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"5991cca9d61c97db5031a15d1b4d5027652c9b8c73c8df4cf945ca3e76e97c90"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 741 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":"compiler/rustc_infer/src/infer/lexical_region_resolve/mod.rs"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"f874a8f5a70cb232b6bbdbb8cb9f909801cc0565e9ee3b37e9b7ac9e6b6f6137"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 846 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":"compiler/rustc_infer/src/infer/lexical_region_resolve/mod.rs"},"region":{"startLine":846}}}],"partialFingerprints":{"codehealthFindingId/v1":"b05aad7cc3e896c276138f7e9338e69926336dca9cc2ce38b2307843a615ce04"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 864 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":"compiler/rustc_infer/src/infer/lexical_region_resolve/mod.rs"},"region":{"startLine":864}}}],"partialFingerprints":{"codehealthFindingId/v1":"611a4087457d7e5aa2ddbce89c076864457ad92a6983a7b67deee92e81b6a4c5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 991 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":"compiler/rustc_infer/src/infer/lexical_region_resolve/mod.rs"},"region":{"startLine":991}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dcb2d6a823456b0549bba8edf54db69290e7bf7344919c06477105167111f25"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 169 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":"compiler/rustc_infer/src/infer/canonical/canonicalizer.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ecbc2a191d55d391bebf74daca90ed3cdad3d7d4c502ede29c9bde3a1cbbd23"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 344 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":"compiler/rustc_infer/src/infer/canonical/canonicalizer.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"818ef4b282d835c4e6d7165ea9d4803c7b79a30562b4d00bc678b4eeb2490d7c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 348 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":"compiler/rustc_infer/src/infer/canonical/canonicalizer.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c13ffafc1a126637f4a8c6cdc1d96c84ab1190cf4ce6a48dd884ee76a41d983"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 447 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":"compiler/rustc_infer/src/infer/canonical/canonicalizer.rs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee5c6858e982e8d71f3c76322f47b461f5320b5b1bd743c2d693a5ce866fd2ba"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 450 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":"compiler/rustc_infer/src/infer/canonical/canonicalizer.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"7732c3d9995d121a21a30d5c2af5140662475a2a19c1de10a4d5f022e8e02e84"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 67 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":"compiler/rustc_infer/src/infer/canonical/query_response.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd07117699bb54ff0d816760477b1e765b043feba2afae8213902b324699230d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 69 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":"compiler/rustc_infer/src/infer/canonical/query_response.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3c079af4805292e15b0268f3ff861e3b02442f3d2b42006ddbe19a04edece23"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 375 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":"compiler/rustc_infer/src/infer/canonical/query_response.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d36f7afdc2e1d77f18e53d2eafbdd65f06b753bfe680967902196b7d44af35f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 275 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":"compiler/rustc_incremental/src/assert_dep_graph.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf81d5d7ef73e8655b806e72500a36ea25291ba3caa3d40bd243223a8c2982c8"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 290 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":"compiler/rustc_incremental/src/assert_dep_graph.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd04de370aebba70aefe5ce4186d7321326e23e913a8b84d03d69c85dbfc95c7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 324 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":"compiler/rustc_incremental/src/assert_dep_graph.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ef8a5ddd046f28e1adb6f581fbc5cf2df0cdbe8c7674bbd9aa7883c67a3b70d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 319 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":"compiler/rustc_incremental/src/persist/clean.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"509cb79183b3beca41aae76b0d68ce3c0d661fc5d5b41b5b5581333d7a93fbf1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 330 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":"compiler/rustc_incremental/src/persist/clean.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"70b1465eb9e9d34c616aeb1eb9ce3470473c3db708bd076475331389f0b5f264"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 46 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":"compiler/rustc_incremental/src/persist/file_format.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd1f92189e52222660a1511d1051f44c683449095d952e6d1f282cb4df04fecc"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 176 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":"compiler/rustc_incremental/src/persist/file_format.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"20bc7a2fc965f7ff44fb017d4129c575c2f1bf6a44ea92e94df4580f1174e2c7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 234 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":"compiler/rustc_incremental/src/persist/fs.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fe4ffb72a6161583df1beb45a51f71c9623acd8643931d82ee89d0ff0feeab0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 252 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":"compiler/rustc_incremental/src/persist/fs.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"d163bd9e446265978da6c4dbe2bf27955bb2a1fa9be97dedd592550aded97a0b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 264 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":"compiler/rustc_incremental/src/persist/fs.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1e4a29638a5f044f1f1a6d51f0137053db3f841c5fc40c584fd40c403bef0a7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 295 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":"compiler/rustc_incremental/src/persist/fs.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"b168716a30b94af01bd3eee96a403b83863cad52b14e0bb034938f3126360d97"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 315 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":"compiler/rustc_incremental/src/persist/fs.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"7894d82b8f25db5748f9bb7e7845100fb900c85f06f8a51858ad3ed8de35853b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 335 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":"compiler/rustc_incremental/src/persist/fs.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a3a416645fffdcab5053e59f41779d810ba147860e9f196ae6f1b0806369b26"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 381 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":"compiler/rustc_incremental/src/persist/fs.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d72fc267c01aaae4813618cedaa843185641025b5fccca135738951fa1f4b47"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 383 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":"compiler/rustc_incremental/src/persist/fs.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"4838fc1b453500c693a5972f4a055b5e366b77d762a267385ec65275497e9395"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 390 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":"compiler/rustc_incremental/src/persist/fs.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"939b27024e551c34d8c1cdd7def5b058fe23120c2487f2c9526fbde494fcd207"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 392 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":"compiler/rustc_incremental/src/persist/fs.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"d982ef969f152fbf2c6ce91a30618731b4a126ba030b429324d1d13a3c328269"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 399 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":"compiler/rustc_incremental/src/persist/fs.rs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c2da948e6a9073263f64404080bbd670a82a924a572895b446181dcd675171d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 414 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":"compiler/rustc_incremental/src/persist/fs.rs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ffdc82bc864ceb441f2ba4807a83e94ba89b1bd815baf119f16f07a13680b58"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 473 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":"compiler/rustc_incremental/src/persist/fs.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"98ba215ce525371511b2495696345bf08c00df691c3a9527997aa3bbae2f552e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 488 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":"compiler/rustc_incremental/src/persist/fs.rs"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"0219a6d5e7e334f11339ee8e23faa0eeb74c605cf172d42289cc9b525f6e693a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 563 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":"compiler/rustc_incremental/src/persist/fs.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fb7361b02abb640d8ba170aad53fcea698ea2f825bfc6a363c8e2e0fd8b282d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 569 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":"compiler/rustc_incremental/src/persist/fs.rs"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"c736e66e1bad34c432a8d44e51c7b76f5f525ee61474151dcce0cb460a7b0cc9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 621 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":"compiler/rustc_incremental/src/persist/fs.rs"},"region":{"startLine":621}}}],"partialFingerprints":{"codehealthFindingId/v1":"c49b2ddf0eb29025eb55b6226e9350be30256cf9a5ea065f83044c7dfe84cc25"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 632 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":"compiler/rustc_incremental/src/persist/fs.rs"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e2a191b359cd67afd0df226479afe2573f58c86c3f219608375b55cddb09106"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 639 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":"compiler/rustc_incremental/src/persist/fs.rs"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"69b4772e2af26b90001147256e784609acefa562e85fc51ffe553f75e39243b0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 667 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":"compiler/rustc_incremental/src/persist/fs.rs"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"0920f35a5f1ed3ff35ce45ff4ca79eea895e9e4405c8646527868e89e0acfe36"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 670 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":"compiler/rustc_incremental/src/persist/fs.rs"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb0b6bd8fec039f9a3dfb10fabb0712389e91aca84f757dfc5ae30125913b610"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 691 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":"compiler/rustc_incremental/src/persist/fs.rs"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"054a1c07ec29a89fb72ceb9b27fb40477ddf6ff77ac9f28e685b14ef320607cd"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 756 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":"compiler/rustc_incremental/src/persist/fs.rs"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c96878486ac9632551511db8a3abf222e6b1f3714a625d8efa13bf4b2bf529b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 774 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":"compiler/rustc_incremental/src/persist/fs.rs"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"e01c0cf8c3a52a9dec1b836b1bfddd247f0d609b505a87611c66514db7a84355"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 74 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":"compiler/rustc_incremental/src/persist/load.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f1322283ac88889f6c727640d34a222b6da97fd7c45beaa18f6715705f899d4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 77 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":"compiler/rustc_incremental/src/persist/load.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3e3584b0f3fbeaff7c1f748b8a3943bf9e03bc7c3440e35b7367b7ea6e1b194"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 196 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: \u0060warn!(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":"compiler/rustc_incremental/src/persist/load.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c8ed6834239db25f132617e059922b50d5e94c7ed4950510440b2547c4362b3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1252 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":"compiler/rustc_hir_typeck/src/callee.rs"},"region":{"startLine":1252}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8c4944c2827d5325c8c9adc8fffa9f7b016632be97c8fc7759cf6dff4e9715d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1271 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":"compiler/rustc_hir_typeck/src/callee.rs"},"region":{"startLine":1271}}}],"partialFingerprints":{"codehealthFindingId/v1":"dabcafbefaccdb4afef3fbd271970e068e1fd0033b12f0ab0d200c7c040bbd6c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 112 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":"compiler/rustc_hir_typeck/src/cast.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0366930277139116882ca00e6bc311f4ff0428b185005be792497cc5e143a1b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 834 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":"compiler/rustc_hir_typeck/src/cast.rs"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"3094219b869303feac2f7da2bcb3f4ce15afd6dd953ec222715ce9d80563055f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 864 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":"compiler/rustc_hir_typeck/src/cast.rs"},"region":{"startLine":864}}}],"partialFingerprints":{"codehealthFindingId/v1":"37b8ed6c7686309850b1fbacaa80c753ba0e60cccc259c3d62ada54c771652f7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1050 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":"compiler/rustc_hir_typeck/src/cast.rs"},"region":{"startLine":1050}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dbfbb80d10fdb60e846522b894cfda2885f31e87f55b288fb960b8c33da7fed"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 138 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":"compiler/rustc_hir_typeck/src/check.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eb7b2c83658d3c155bcc70bcd41994a8c1723b1d34f1b53b3d2f2e9f67a4ef8"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 144 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":"compiler/rustc_hir_typeck/src/check.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8c6e60a03a2a192f7318deeb7fb97b8c183187a05dfdc7443e895f132836c21"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 861 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: \u0060trace!(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":"compiler/rustc_hir_typeck/src/closure.rs"},"region":{"startLine":861}}}],"partialFingerprints":{"codehealthFindingId/v1":"110e0b35403be152fb8053547b5672011aa10015af77828be98bbc98335537a7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1016 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":"compiler/rustc_hir_typeck/src/closure.rs"},"region":{"startLine":1016}}}],"partialFingerprints":{"codehealthFindingId/v1":"6814c3b288cb1a58f240c3d5adf10c523500e0a6cfa8409a6cec3a851b0316e3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1048 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":"compiler/rustc_hir_typeck/src/closure.rs"},"region":{"startLine":1048}}}],"partialFingerprints":{"codehealthFindingId/v1":"715b63617efead6b63dd5aae34a8571958e991c83a95ee3e4c3c07183185d3e4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1080 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":"compiler/rustc_hir_typeck/src/closure.rs"},"region":{"startLine":1080}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdb661f57bbf80c7310ffa4a16561561821ca8d63b11ded0fb46de41b46e385b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 164 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":"compiler/rustc_hir_typeck/src/coercion.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bec06e1355df533d12abd640cf1e49b1547391842c689f144e402b1303f0389"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 246 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":"compiler/rustc_hir_typeck/src/coercion.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b4d0c47c509d85775c3ebc4db00f3f7caa8830ce43cdf156ca1b355b7c7ec4e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 374 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":"compiler/rustc_hir_typeck/src/coercion.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bd61ce801beb30dd29cab351a4b002dfe6f4c9cbb5914fac30629723cb7e128"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 403 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":"compiler/rustc_hir_typeck/src/coercion.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6cdec0853c8917a814eaf043cde296a45318dfcd0bea45f5fc836a65671e77f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 429 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":"compiler/rustc_hir_typeck/src/coercion.rs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0c9c0400a221ee34aafb85a62cb2d5e869babcaa73bea8ce23be1b532edba08"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 507 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":"compiler/rustc_hir_typeck/src/coercion.rs"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"6739dd48d812e85c43eb08329cc0c798cdc553005533436c692ec19aae2236be"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 555 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":"compiler/rustc_hir_typeck/src/coercion.rs"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc26f561c1cfa87169d11f60a47ec5ea758da7a74a1f936af49879c94225a23f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 775 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":"compiler/rustc_hir_typeck/src/coercion.rs"},"region":{"startLine":775}}}],"partialFingerprints":{"codehealthFindingId/v1":"54a6cb30498f543d812302c86d021a4fc79b97807e5f3e0b4aec6686a2937080"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 782 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":"compiler/rustc_hir_typeck/src/coercion.rs"},"region":{"startLine":782}}}],"partialFingerprints":{"codehealthFindingId/v1":"89c36be0da7433acd2ab1277f232c82d1f112f5b3361d0a3f17c043982153872"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 787 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":"compiler/rustc_hir_typeck/src/coercion.rs"},"region":{"startLine":787}}}],"partialFingerprints":{"codehealthFindingId/v1":"7838a8e5b23c325783f8f9ea6f02e32b13540926512c140885217c9735abeed7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 882 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":"compiler/rustc_hir_typeck/src/coercion.rs"},"region":{"startLine":882}}}],"partialFingerprints":{"codehealthFindingId/v1":"de00e4e4653431deb2d886cd040c7b97759d9976e2dfbb2489be1c10864a1cae"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 926 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":"compiler/rustc_hir_typeck/src/coercion.rs"},"region":{"startLine":926}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9a6f36fac8b0272c3ab7331391116ab7f3ef299ca944e25b6fdfbfdc1031ded"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1092 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":"compiler/rustc_hir_typeck/src/coercion.rs"},"region":{"startLine":1092}}}],"partialFingerprints":{"codehealthFindingId/v1":"da8a2338ff32d5d0dd336eb2c5bae18a20d22d0f53d7051b4f8a303b889ba990"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1127 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":"compiler/rustc_hir_typeck/src/coercion.rs"},"region":{"startLine":1127}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fc1e0da91bace042f33d3b5d872be72578cf10a745183788c4fffb6424960f5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1142 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":"compiler/rustc_hir_typeck/src/coercion.rs"},"region":{"startLine":1142}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2225cba81fae566eb22a6a437b859dfd92f9216259f74d223d3737a5433f0a5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1194 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":"compiler/rustc_hir_typeck/src/coercion.rs"},"region":{"startLine":1194}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec63ddce7eb3ca4c0eeef0996e2fed2ecb3b823f5014cf458edf417987657d5a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1390 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":"compiler/rustc_hir_typeck/src/coercion.rs"},"region":{"startLine":1390}}}],"partialFingerprints":{"codehealthFindingId/v1":"752c778cb47666fd4baf5ce93a11dd0d0ff7197f68b46ac117b29bca05411649"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1511 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":"compiler/rustc_hir_typeck/src/coercion.rs"},"region":{"startLine":1511}}}],"partialFingerprints":{"codehealthFindingId/v1":"51338890589a2b2cdf023d11cceda9292b26d27b313c60f977de4c1ed7bb23e1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1530 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":"compiler/rustc_hir_typeck/src/coercion.rs"},"region":{"startLine":1530}}}],"partialFingerprints":{"codehealthFindingId/v1":"2079d1878e9c88def31fa4a818f23185f466d90703461de02494ae12d95555dc"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 236 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":"compiler/rustc_hir_typeck/src/expr.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd98fb94addb20559d444f23df485dafea6d25847d525335ce355bbcc9fbeabd"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 241 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":"compiler/rustc_hir_typeck/src/expr.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a04a5acaead8ec2540dbd9c21348716ca3dcfda0575d5940c8bbb8bd9374758"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 242 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":"compiler/rustc_hir_typeck/src/expr.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4b7b0bcdfeb557e36d4b6b1be43fbed02ef1e910574d90d6ef30dcff05b1792"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 325 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":"compiler/rustc_hir_typeck/src/expr.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"5425345f296ba1bf6bea61a80c939c1e85f164974605237651d03ac40bfdc21c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 326 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":"compiler/rustc_hir_typeck/src/expr.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"b612b71d0e79d4b7d29b158cf915e9144850cf1457b466f8231064966809ede8"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 337 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: \u0060trace!(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":"compiler/rustc_hir_typeck/src/expr.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"d314f0fe1d7c91a6c9802dd30dfdb4cf47200d66bb7525b76309ec6352d316d4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1603 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":"compiler/rustc_hir_typeck/src/expr.rs"},"region":{"startLine":1603}}}],"partialFingerprints":{"codehealthFindingId/v1":"829be0b2f4fa8963908885446559f98717549d5a7c6116801f54cb8bd8303a82"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 2828 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":"compiler/rustc_hir_typeck/src/expr.rs"},"region":{"startLine":2828}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc1a71594112924f52926b43aa3aecbe91d4d21dc01d800dd9e1550df2d30aad"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 2838 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":"compiler/rustc_hir_typeck/src/expr.rs"},"region":{"startLine":2838}}}],"partialFingerprints":{"codehealthFindingId/v1":"334b99b7e295a296ee1247a064477b508ee7435aeeebac9965ecaf4b39120fc0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 2841 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":"compiler/rustc_hir_typeck/src/expr.rs"},"region":{"startLine":2841}}}],"partialFingerprints":{"codehealthFindingId/v1":"49a224aaa14bad9fdd3d12716a555fa6a8e0d9fe73b9055fc984c050297856a8"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 3049 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":"compiler/rustc_hir_typeck/src/expr.rs"},"region":{"startLine":3049}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1a90d3e239d421188412cebdd4cd037205c89c201e27f385fa53a547b4e30e1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 3276 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":"compiler/rustc_hir_typeck/src/expr.rs"},"region":{"startLine":3276}}}],"partialFingerprints":{"codehealthFindingId/v1":"4849ec42cd87ef10a0af29825dd7018a972cda3adbae4fc4f8809048eb43e871"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 3404 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":"compiler/rustc_hir_typeck/src/expr.rs"},"region":{"startLine":3404}}}],"partialFingerprints":{"codehealthFindingId/v1":"38eda4d58b6dbed5b3e43e0c5567a79211d541cbc5aea71f1b593dfcd96b1b9e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 311 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":"compiler/rustc_hir_typeck/src/expr_use_visitor.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"630e50e34e685b08386a6320e546bd7f90c572fbf7aa878420a3aa6f5b168bec"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 726 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":"compiler/rustc_hir_typeck/src/expr_use_visitor.rs"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cf2286ec345567ef4316db156616214364b46e3fcd648cb212400366c883b90"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 774 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":"compiler/rustc_hir_typeck/src/expr_use_visitor.rs"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a0babbf593c619d814b16094644319dad910c2b8c723f05a4f1859ef8f84250"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 789 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":"compiler/rustc_hir_typeck/src/expr_use_visitor.rs"},"region":{"startLine":789}}}],"partialFingerprints":{"codehealthFindingId/v1":"a62d5fb6319d5d99fa0f1cfd0cf0ef876a41b5ba790c48e2927af530e0dce138"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 836 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":"compiler/rustc_hir_typeck/src/expr_use_visitor.rs"},"region":{"startLine":836}}}],"partialFingerprints":{"codehealthFindingId/v1":"4108b8c149a6ce909a9b718a906b7b10061698e78e51cccb475d37f2f08b65b7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 843 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":"compiler/rustc_hir_typeck/src/expr_use_visitor.rs"},"region":{"startLine":843}}}],"partialFingerprints":{"codehealthFindingId/v1":"de6b3e85763aa89b17dcb5b084bd2dec8953e46b2532db0e98d84a1da10dc8f9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 848 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":"compiler/rustc_hir_typeck/src/expr_use_visitor.rs"},"region":{"startLine":848}}}],"partialFingerprints":{"codehealthFindingId/v1":"76de5f060942a916ecaf314a3997608ec636bbe6cafc81d36fb9bc03148e500d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 852 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":"compiler/rustc_hir_typeck/src/expr_use_visitor.rs"},"region":{"startLine":852}}}],"partialFingerprints":{"codehealthFindingId/v1":"982edabe7dac4ab691976ec09a7dcbe55b5f072c1e89030e22b0cd1d43a4ae2a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1172 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":"compiler/rustc_hir_typeck/src/expr_use_visitor.rs"},"region":{"startLine":1172}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac1f8a4601cde86a7646e6c80b06dd436eb99836f5ef2a656a7ed1cd836ec9ea"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1203 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":"compiler/rustc_hir_typeck/src/expr_use_visitor.rs"},"region":{"startLine":1203}}}],"partialFingerprints":{"codehealthFindingId/v1":"e70dda9aa335bf9e323fb43d0fb409a2a252eb6dc2390193d8448519c6c5e812"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1216 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":"compiler/rustc_hir_typeck/src/expr_use_visitor.rs"},"region":{"startLine":1216}}}],"partialFingerprints":{"codehealthFindingId/v1":"a92d1a8b3bcf39b30443a79ab548049d97826c94d32ee40a45a4c49e18c2f6d9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1510 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":"compiler/rustc_hir_typeck/src/expr_use_visitor.rs"},"region":{"startLine":1510}}}],"partialFingerprints":{"codehealthFindingId/v1":"66be6127579c6ffea574b522022325af7b3d55aff3c5033c981022ab8a528181"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1636 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":"compiler/rustc_hir_typeck/src/expr_use_visitor.rs"},"region":{"startLine":1636}}}],"partialFingerprints":{"codehealthFindingId/v1":"554878508291a6509c83d277612e8b3e755c5b9ea172a86624149b3b06a49d9d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1655 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":"compiler/rustc_hir_typeck/src/expr_use_visitor.rs"},"region":{"startLine":1655}}}],"partialFingerprints":{"codehealthFindingId/v1":"809519f5680fe7bfd6792062c2a4a8b46e20886aa7793e24bb9b091b1a7a3ba1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1670 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":"compiler/rustc_hir_typeck/src/expr_use_visitor.rs"},"region":{"startLine":1670}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f88a5950c94468cdffbfb235b96c4a92393a9d13a8914f120883b195274459f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1782 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":"compiler/rustc_hir_typeck/src/expr_use_visitor.rs"},"region":{"startLine":1782}}}],"partialFingerprints":{"codehealthFindingId/v1":"88773c1aab4e3c4ba8f4802e5ef41fb25cc496f41cc7229fa8bb11cec8ccd931"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 26 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":"compiler/rustc_hir_typeck/src/fallback.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c0293c5604678438cbeba3bff0d656e175dbf0c142e167fd25caa2299cc705f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 34 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":"compiler/rustc_hir_typeck/src/fallback.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bf3f73a33ab1d8f49e1c7f2061580eceab8448f2a352c69fcc8bb813c85cc66"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 193 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":"compiler/rustc_hir_typeck/src/fallback.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"11a8e6c419374d10787fb2fa1af59b0f38045d3cbc57ed9c6a83db4c1f291ee5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 280 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":"compiler/rustc_hir_typeck/src/fallback.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"13cffad0018794bfece715380b1dcb3e48881ebb4d477c645d8c39270547cff7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 310 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":"compiler/rustc_hir_typeck/src/fallback.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"52910cc8bc35fb8edb185a251ffcc0ca3ca3a03a43119305fe16918843c024c7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 649 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":"compiler/rustc_hir_typeck/src/fallback.rs"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eb4909c2311b543b7cedc7486fad7f4e7662de15a6c6763c362773df00a39ea"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 147 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":"compiler/rustc_hir_typeck/src/gather_locals.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"fab8c6da339b9c0d57db5bfbb184b2c02c57f8beb0b920bef45329b405e89224"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 160 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":"compiler/rustc_hir_typeck/src/gather_locals.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc3c92a823690ae9eb436c6f7c731e14620c171efb690e4105e35e8ec396e418"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 213 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":"compiler/rustc_hir_typeck/src/gather_locals.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b730b2a6b4eb0f2afbd50e02b7f98945872c6717a51e25a15041d6ec079d9cd"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 98 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":"compiler/rustc_hir_typeck/src/op.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"80d2cb278892285dde73d644ed9777ee9f2295ec33b64ee93bbd94c518a9529c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 202 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":"compiler/rustc_hir_typeck/src/op.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4a830828a3984b891d5a0398707dfe87fa600768352e323452e36b7cd761b79"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1088 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":"compiler/rustc_hir_typeck/src/op.rs"},"region":{"startLine":1088}}}],"partialFingerprints":{"codehealthFindingId/v1":"c87edd3004554f127b835106e36a83274343ea2d295a82ff1cd39da42dada5e4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 514 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":"compiler/rustc_hir_typeck/src/pat.rs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"336f1d8dbc0d3a91ce540103405932a8f20766bb23eb10422993e01211f790dc"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 544 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":"compiler/rustc_hir_typeck/src/pat.rs"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"da55829e90811547668ea002c0d274155157a037a46e00328649362a902c2dcc"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 567 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":"compiler/rustc_hir_typeck/src/pat.rs"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed20a8556f18784bbeea313081d07cdd0dd0aac59e44943ece7acd654cf16b27"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 708 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":"compiler/rustc_hir_typeck/src/pat.rs"},"region":{"startLine":708}}}],"partialFingerprints":{"codehealthFindingId/v1":"f845afe4b61b75cb7a4b70033293014e09548bb34891c65f1653b1dc83293b19"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1264 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":"compiler/rustc_hir_typeck/src/pat.rs"},"region":{"startLine":1264}}}],"partialFingerprints":{"codehealthFindingId/v1":"b16dbeef3a985aeb2dca18cc5f9902cf212a031cc8e731871d6c1c9540a848be"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 2938 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":"compiler/rustc_hir_typeck/src/pat.rs"},"region":{"startLine":2938}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bb91adff35fa1915c914adbff8621cc08665ac935374d1aded155325e123c81"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 2957 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":"compiler/rustc_hir_typeck/src/pat.rs"},"region":{"startLine":2957}}}],"partialFingerprints":{"codehealthFindingId/v1":"68c54b54d564c45c035bf4a5962a1e933cacf0ec0ba998738f7353fce2f70b40"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 113 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":"compiler/rustc_hir_typeck/src/place_op.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"147e5ae61ae157167f49f7ac318d000dead5d2ec8a61db9d15a0084c33fb8cec"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 206 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":"compiler/rustc_hir_typeck/src/place_op.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad8d41adc6b1290e13f95ab1dee31d4cff3c088f4d84e6817b1e5261ad26fb64"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 236 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":"compiler/rustc_hir_typeck/src/place_op.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ab650d9b49b79d821daf476c870e4ac6a07b33929dfce9f12a0cc93c27651f4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 279 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":"compiler/rustc_hir_typeck/src/place_op.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e22066bc04e77902019107f5f86ebdb22715b0f5c03f52d42517384886a37bf"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 284 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":"compiler/rustc_hir_typeck/src/place_op.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7008e258dfc00b9e30185668415f6e78f9d595305cc5a59199fef54f9d8ec49"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 361 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":"compiler/rustc_hir_typeck/src/place_op.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"808b219b3dd7d911198c8d9d6fe1c7867c6eb1ed05e41c24e95077106edb874a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 396 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":"compiler/rustc_hir_typeck/src/place_op.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ba945939b26063626b2242d39cd23052d8612b25637fd6cf071a7643c0d4661"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 412 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":"compiler/rustc_hir_typeck/src/place_op.rs"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe97e24328122d01471fe0cf57e842c0255491539e02727abe188f37726bb6f7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 390 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":"compiler/rustc_hir_typeck/src/upvar.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"8861f77ef3314a4624feb8df2be405887f8de98728d50cfe636f05dcfde5053a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 435 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":"compiler/rustc_hir_typeck/src/upvar.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ad94d47b815f4378f8c0f305de587e4fe6f1b2cb44fecb76ff8602448b8eebd"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1003 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":"compiler/rustc_hir_typeck/src/upvar.rs"},"region":{"startLine":1003}}}],"partialFingerprints":{"codehealthFindingId/v1":"60b0548bd359cff955cf123ef7362b4cd62086c851caa3945d0fcc38cc3f1346"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1064 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":"compiler/rustc_hir_typeck/src/upvar.rs"},"region":{"startLine":1064}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e41ccef8d041f3b50021f8da270518a4b23ead44032b4caeccde485f40e23ae"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 86 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":"compiler/rustc_hir_typeck/src/writeback.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"c87b27ae4ec810b8da5bee40a9ed0e5fcba78649cd39a0fef9468046c8c8fa9a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 89 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":"compiler/rustc_hir_typeck/src/writeback.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"09e9c0c7a2fc1f6f5ad03b59b713dd9e95129eeed14a4a2d36db80b8ffd499f4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 140 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":"compiler/rustc_hir_typeck/src/writeback.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb3a5893f241d4fe0650dfd37bd0cb888d92266a1742ae4e147e054af038d02b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 700 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":"compiler/rustc_hir_typeck/src/writeback.rs"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"e353746d94e1d74735fec087c283e7b01fb917dcd508687275a9dc21721e3024"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 70 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":"compiler/rustc_hir_typeck/src/method/confirm.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aedae0c7d5a7fedb1834038ca8e262d799e3b6ee1fb8c9fe70a2deb7410ebc2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 125 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":"compiler/rustc_hir_typeck/src/method/confirm.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"2335b855e20292213fb39428059c2a4bbfb9e090eaffbac4181f459f7b59266c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 152 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":"compiler/rustc_hir_typeck/src/method/confirm.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"37e0f8ecd1f5e9cff0868eef7124b75488fdab77229ef2d21723d950c350d7e1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 351 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":"compiler/rustc_hir_typeck/src/method/confirm.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e1de48f258becb04872e5f106d0271ab10f39879fe4f4ca08c68ff241baa9a9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 562 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":"compiler/rustc_hir_typeck/src/method/confirm.rs"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c04ca92232779425a975bfb41a9a1ea31db09d56a7a6feab9f72a604b011081"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 578 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":"compiler/rustc_hir_typeck/src/method/confirm.rs"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdcccdbe72cd24651a054e64ba011363fa737d510cd30405d4cab4d12b051e9e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 619 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":"compiler/rustc_hir_typeck/src/method/confirm.rs"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"9907f280badb30c982a5a1bee0effdddeece1b0e88af0853c7342faf7f0c1e3c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 627 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":"compiler/rustc_hir_typeck/src/method/confirm.rs"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"e408e3f1d32cc8dd49846eea6786b12ec18e00570e1ee59027403654fae0bdf3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 630 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":"compiler/rustc_hir_typeck/src/method/confirm.rs"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"48e25fce535d0085c2b65f146c1fca3c45b8671de61879ea4c69f39e8a296110"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 633 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":"compiler/rustc_hir_typeck/src/method/confirm.rs"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"5517ca83523bb3e083d71289d9eac304e27fc8ddc71ab4d76c85f906732a7579"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 645 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":"compiler/rustc_hir_typeck/src/method/confirm.rs"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"642c1d9158220f7d2fa8c26e09b593926cb18a2b26c5e1c8e178b8475d8145a7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 199 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":"compiler/rustc_hir_typeck/src/method/mod.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"41b3f122b902d9b3cdebfddec4e7b33b3a8533ed886c2c5bbaa6c7162a8aa677"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 207 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":"compiler/rustc_hir_typeck/src/method/mod.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ba5b3c7bf98eaea2b2481a69e2e6e007530d79fd8c268ff306fce3f15d0a981"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 415 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":"compiler/rustc_hir_typeck/src/method/mod.rs"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc82594a4253f1bdf68139c2770159bd8aab5fe5b5f7cb1d0ccfedc1efd61094"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 462 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":"compiler/rustc_hir_typeck/src/method/mod.rs"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"515759ca75ffd9c81f7d17d68a84d1707aa0a04abb1a8535539577721c171afe"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 476 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":"compiler/rustc_hir_typeck/src/method/mod.rs"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bd12d772b437bbe807111b46442ee9ce1ec52b06148d4793ed5e60635b9cb89"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 166 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":"compiler/rustc_hir_typeck/src/method/prelude_edition_lints.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7d32e4f465bb0de671e14ec5377e81702f2288b65792061d26cb9763a56b8c0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 568 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":"compiler/rustc_hir_typeck/src/method/probe.rs"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a846ffb784553810321f62d56fc381b58d96112b2529934341a40a58cd48521"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 639 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":"compiler/rustc_hir_typeck/src/method/probe.rs"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"f11de8e922f671b5fe18edc30fcca821c75d2654dbe6355dcd383588c6b6c6a2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 793 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":"compiler/rustc_hir_typeck/src/method/probe.rs"},"region":{"startLine":793}}}],"partialFingerprints":{"codehealthFindingId/v1":"27b03275f6163167d72f7e70d1b7c5b5f134efdd30976383a9526e71387157ab"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1075 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":"compiler/rustc_hir_typeck/src/method/probe.rs"},"region":{"startLine":1075}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ab8b18f8353d898d3bf3fed32c184c6b4bbb819ac67132fe4195ef788058664"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1338 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":"compiler/rustc_hir_typeck/src/method/probe.rs"},"region":{"startLine":1338}}}],"partialFingerprints":{"codehealthFindingId/v1":"7db5c3f13b2661f60f897e107ee822a2fb30d01f54fe1afb7699028a73dd62c0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1728 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":"compiler/rustc_hir_typeck/src/method/probe.rs"},"region":{"startLine":1728}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b110d3516aeb13e3a61ce8774b55d0a691d26a04f8e36ad16b770621099a772"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1733 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":"compiler/rustc_hir_typeck/src/method/probe.rs"},"region":{"startLine":1733}}}],"partialFingerprints":{"codehealthFindingId/v1":"071c18d1db2984aa491aeab70027f4f937278f27b984a8c096e29ef3923e0f1f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1792 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":"compiler/rustc_hir_typeck/src/method/probe.rs"},"region":{"startLine":1792}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd1d98ec8d718216a2089ea71f5070f249696fec3deac2a625d687864ca473f2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 2048 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":"compiler/rustc_hir_typeck/src/method/probe.rs"},"region":{"startLine":2048}}}],"partialFingerprints":{"codehealthFindingId/v1":"361f55bb5366c8971fa4299b18e7a6f43aa9d0bbf225f0d1ad774dd2809dd9af"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 2129 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":"compiler/rustc_hir_typeck/src/method/probe.rs"},"region":{"startLine":2129}}}],"partialFingerprints":{"codehealthFindingId/v1":"3619452b1dfb670a53293fde0ec2f1e7ba048dda9cec75478f816600c1a84ec5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 2189 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":"compiler/rustc_hir_typeck/src/method/probe.rs"},"region":{"startLine":2189}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c701781631f06a05618ec370946d47c5956c0973209534c2521ee713555c489"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 2200 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":"compiler/rustc_hir_typeck/src/method/probe.rs"},"region":{"startLine":2200}}}],"partialFingerprints":{"codehealthFindingId/v1":"b156e1d43cd39bbe59eff5269b532488bf945967b7b6ee10df3d2e40c0e7df61"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 2241 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":"compiler/rustc_hir_typeck/src/method/probe.rs"},"region":{"startLine":2241}}}],"partialFingerprints":{"codehealthFindingId/v1":"792db502c400e5c8cf889c41003929ec8f08d77965d1d04515a657fa7ff386f6"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 2503 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":"compiler/rustc_hir_typeck/src/method/probe.rs"},"region":{"startLine":2503}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c9bce5e5486d7dc59651608751afe6e0626f93e332fd861109a26cb33086e20"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 2164 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":"compiler/rustc_hir_typeck/src/method/suggest.rs"},"region":{"startLine":2164}}}],"partialFingerprints":{"codehealthFindingId/v1":"17116402d8241ce2585e5c9ab996cfbd2d8fb02812d0e1cfd6cb0bf4ad73910d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 3142 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":"compiler/rustc_hir_typeck/src/method/suggest.rs"},"region":{"startLine":3142}}}],"partialFingerprints":{"codehealthFindingId/v1":"8860d35ff26599c4e84af71bd5083df1b5d06793e53fa251ef834a9a05f656ca"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 3879 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":"compiler/rustc_hir_typeck/src/method/suggest.rs"},"region":{"startLine":3879}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f0b36f3c29f6de25eb42df2193418b317ffacda9afa77309fe2e82e00549d9c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 4157 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":"compiler/rustc_hir_typeck/src/method/suggest.rs"},"region":{"startLine":4157}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac281a7fae210e7333f4a7fca3ae88a040791013fc665416141996f422f23b4d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 4250 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":"compiler/rustc_hir_typeck/src/method/suggest.rs"},"region":{"startLine":4250}}}],"partialFingerprints":{"codehealthFindingId/v1":"371242308cf9687bfb825dbb69e467de7153a8926a9050741ee1a8417b0974a6"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 101 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":"compiler/rustc_hir_typeck/src/fn_ctxt/_impl.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"a769ed2f9ec6a8c6e86edbc03f870a1cd5bbcc6556744934d8345e2383101197"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 172 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":"compiler/rustc_hir_typeck/src/fn_ctxt/_impl.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"912206d101d3ad125f9c817963d1cb6b5bbb7cf398d1fe9479ccab288ca19537"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 290 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":"compiler/rustc_hir_typeck/src/fn_ctxt/_impl.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd8fa09becdb32db155ab966946f2f3603bf4a79bfff698d01496f3f8863ea5c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 311 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":"compiler/rustc_hir_typeck/src/fn_ctxt/_impl.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f9d53535a011b944527407a94da4abafab7cf08777abadae5a795789f3c0a0e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 335 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":"compiler/rustc_hir_typeck/src/fn_ctxt/_impl.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5d5ba751b60909595db28f976ec4e37dec867d17ed6ab5948764049f6be7813"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 350 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":"compiler/rustc_hir_typeck/src/fn_ctxt/_impl.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"854f2c23f077244261507ca860b89237af6ee2cab0fabd303c5eafe7dfef5730"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 363 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":"compiler/rustc_hir_typeck/src/fn_ctxt/_impl.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c4da489b7daba7683d4c122bf0d86d7411a8b24951ff83d1301f893a61f05f5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 409 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":"compiler/rustc_hir_typeck/src/fn_ctxt/_impl.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"4002c02964bcbd59f0b2f2f62fa3fe996a47aabdce42356bfdc6bc058f55b7e9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1526 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":"compiler/rustc_hir_typeck/src/fn_ctxt/_impl.rs"},"region":{"startLine":1526}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcc795b4c332b7d91796a742673b5dcb5587e4311dfa14bd66180a606fdea79a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 74 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":"compiler/rustc_hir_typeck/src/fn_ctxt/checks.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fad9a01e8df8ad0186afb3ce0dd5f3a11e26eed22c3c486153f7ad0511df496"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 84 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":"compiler/rustc_hir_typeck/src/fn_ctxt/checks.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf9b5b93ea4c2abf3080a951090af3e45fb323467714413fbcbe33f542227029"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 93 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":"compiler/rustc_hir_typeck/src/fn_ctxt/checks.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc1f96b59b086851561315988568e1a1ddc2c07bf88775abb8b2a0cf22cfced6"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 357 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":"compiler/rustc_hir_typeck/src/fn_ctxt/checks.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f609b78dbd35ee4f81555e248bfb2c2ae2be105f2795ae4254993a9b0fc30a6"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1135 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":"compiler/rustc_hir_typeck/src/fn_ctxt/checks.rs"},"region":{"startLine":1135}}}],"partialFingerprints":{"codehealthFindingId/v1":"6698f2512960087f8d0332cca77378542e0fb9bd08c18d70df1e7eeb70612cf7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 3812 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":"compiler/rustc_hir_typeck/src/fn_ctxt/checks.rs"},"region":{"startLine":3812}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4d6b29334836ae11d47955c7100fa538d6966084bdd6497132d391f1b42236b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 44 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: \u0060trace!(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":"compiler/rustc_hir_typeck/src/fn_ctxt/inspect_obligations.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"59af99ce11eca4151207ba9af8faf9d65b6781db64d57e44bb4e138b80bcfb5e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 769 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":"compiler/rustc_hir_typeck/src/fn_ctxt/suggestions.rs"},"region":{"startLine":769}}}],"partialFingerprints":{"codehealthFindingId/v1":"340fc29a5488f64b3edebd45d2d4ae574f76996b9d100bf0be9178c05664f530"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1212 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":"compiler/rustc_hir_typeck/src/fn_ctxt/suggestions.rs"},"region":{"startLine":1212}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8a768fe37fe0cfef5d3b64674e49e8d83232187e3f380dcb7ba63f4ac91876f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 211 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":"compiler/rustc_hir_id/src/definitions.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f5dd99219aea1bc7fc445589791876639fead24db35e5034525d7d531ec7e03"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 214 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":"compiler/rustc_hir_id/src/definitions.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"0477ab45dbdba7dec45efb274a46a47bc3f17f7b6e38b971f1091c931f01d167"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 393 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":"compiler/rustc_hir_id/src/definitions.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"90070192839960a11cdbfac5513b2b481006a2337b7e92a0a33937db403b5415"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 444 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":"compiler/rustc_hir_id/src/definitions.rs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccb03db08f1619e0e18bc2fc97f41b812c43fbb74bc2e56a9fa8e5f2c048b2dc"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 474 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":"compiler/rustc_hir_id/src/definitions.rs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"29960a9b518b21426ed645e2c27cb30a1fc51fa1d4f19d41c46b8d1b6f076e33"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 55 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":"compiler/rustc_hir_analysis/src/autoderef.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"81280b08dac5770c038a6024fb8729df134f56526fc06e28cddcbb33874ae021"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 58 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":"compiler/rustc_hir_analysis/src/autoderef.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"96c86bc53214769713b00e538fdd9bb2c023c88ad7a535e6681280eb69a186b2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 99 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":"compiler/rustc_hir_analysis/src/autoderef.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d9b96db1bdf6c7de1ff280a085e66321ef1254c6b4bb9db2615892829ee1ed6"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 138 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":"compiler/rustc_hir_analysis/src/autoderef.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"70e9a9110155c0a655713b6086b2928e5a19433fbd4e494f34c6bd7d040f18b4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 171 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":"compiler/rustc_hir_analysis/src/autoderef.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"0992fe1c504799a04acd1fcd853474ed74a1e74d0ff602ff8b806d2769559c9b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 35 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":"compiler/rustc_hir_analysis/src/check_unused.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"b386892a62be21147e1338e779fd5dc3eb90478a84aca300580709664dcecdd9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 599 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":"compiler/rustc_hir_analysis/src/collect.rs"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"826dfb067f5054b1d9604350c86c635ab83943c2ccd9af1ecc8b5c1b6bd8e0ae"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 608 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":"compiler/rustc_hir_analysis/src/collect.rs"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"e114519474f71c1ca99b20ae4a0a8b4c30eae8693b13359a8635039b6106e011"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 193 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":"compiler/rustc_hir_analysis/src/constrained_generic_params.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f4affae1eb785e24433b6deb8d2ff6decf30ac701d6c53f7468a4713241f0d5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 225 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":"compiler/rustc_hir_analysis/src/constrained_generic_params.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e46594f82716e31cad98b6ddce1abcdb610a4060ca08201ade44bf7391721e9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 100 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":"compiler/rustc_hir_analysis/src/hir_wf_check.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e59141d26ebffde136a539d85a891f87ec9a761efbdd125bc20d0eb0a1c7030"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 96 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":"compiler/rustc_hir_analysis/src/variance/constraints.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fc71fefdabdbc8a837b8ebbe503adf5e55025fb2320945e21477582fb37ab66"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 144 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":"compiler/rustc_hir_analysis/src/variance/constraints.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"658044e29e4a17408fbd25f3dbeca8829d04f079a6cb4be30cad9d6bd515d649"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 359 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":"compiler/rustc_hir_analysis/src/variance/constraints.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba314640ad976d198220091dc5f4228681ea6f25a642ba3b79cc999208154045"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 387 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":"compiler/rustc_hir_analysis/src/variance/constraints.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c4a4f4c6b1228bd35cd83a41cad991cd5f021912f048fb5bd4ae22e4b5ecc81"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 411 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":"compiler/rustc_hir_analysis/src/variance/constraints.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0c015989e6d831e5498bc0474555fc9640b8281f5cbf5ed9ecea431e6496875"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 92 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":"compiler/rustc_hir_analysis/src/variance/solve.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"81f4cfc7f4e3d5506f702448388f99db4ac4eb7b17fc600c895b1d4373313709"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 86 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":"compiler/rustc_hir_analysis/src/variance/terms.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"28356540a97c03fefab908c9917e666853ddd1579dee181078efba6bb850100d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 30 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":"compiler/rustc_hir_analysis/src/outlives/implicit_infer.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"1078bab9cd94f4c01d1b57144224bd8707d33a71ab8a15c8b79f5315fff30032"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 223 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":"compiler/rustc_hir_analysis/src/hir_ty_lowering/dyn_trait.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"c806f1384f4105c409c6593196b434d5be519ffbb897f59623a6fc066df7f510"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1263 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":"compiler/rustc_hir_analysis/src/hir_ty_lowering/mod.rs"},"region":{"startLine":1263}}}],"partialFingerprints":{"codehealthFindingId/v1":"12b1088adccabe199bc7d20e656e3b3c7ee3cba390bf2152974dc7de0c5fcb80"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 620 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":"compiler/rustc_hir_analysis/src/diagnostics/wrong_number_of_generic_args.rs"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"8308605fd93ca0ed629faf200059c09cac3fce3ca4a4d28829665a14339bf374"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 675 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":"compiler/rustc_hir_analysis/src/diagnostics/wrong_number_of_generic_args.rs"},"region":{"startLine":675}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbef9f8ac6e1794ab2dfa2b821f3593448350b381127505bb8a4cfb1368546b0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 684 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":"compiler/rustc_hir_analysis/src/diagnostics/wrong_number_of_generic_args.rs"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"6099f98ce72aef655b8c3c67a17ad319cb5aea2d461bcc71024e10e7557564b5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 692 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":"compiler/rustc_hir_analysis/src/diagnostics/wrong_number_of_generic_args.rs"},"region":{"startLine":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"3958211679df1d6811f46401e71b4b0c7d2ec0f59b88b290138c5c154d72247b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 717 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":"compiler/rustc_hir_analysis/src/diagnostics/wrong_number_of_generic_args.rs"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd1e3233c017d3a150b590514bb186785e0515e31e6f9512029ed8ae187abb15"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 735 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":"compiler/rustc_hir_analysis/src/diagnostics/wrong_number_of_generic_args.rs"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9953fc45ae6bbfb7a7bbbdf98dc4b7d3ed9c538137384e8de645dd48347d98d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 993 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":"compiler/rustc_hir_analysis/src/diagnostics/wrong_number_of_generic_args.rs"},"region":{"startLine":993}}}],"partialFingerprints":{"codehealthFindingId/v1":"4222ab15322eed930740e446ceb642de98ff3573b2bda5bacde5f05d88988975"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1041 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":"compiler/rustc_hir_analysis/src/diagnostics/wrong_number_of_generic_args.rs"},"region":{"startLine":1041}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0f418a181d02077cd9fcd2bf0e321f03f23918bf14905dd90860325244e5379"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 31 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":"compiler/rustc_hir_analysis/src/collect/clauses_of.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9eddb80b92dfb85474c26a91c411d2ce76c02208813ad1264e4b26c6e457a6e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 35 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":"compiler/rustc_hir_analysis/src/collect/clauses_of.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"08fce80aa7c04b0ed15a195f73a7d97af762124708ccca9e163448c0d675bbbf"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 76 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":"compiler/rustc_hir_analysis/src/collect/clauses_of.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c519ebaee15d6885c8f6fe7ba221958a891eb9ed2cb6f84306b57db3a46b038"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 710 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":"compiler/rustc_hir_analysis/src/collect/clauses_of.rs"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcb992a47e76315cc7ad6d55f8536b52ab081a1005efad730a9dbf3eac28ab9f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 720 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":"compiler/rustc_hir_analysis/src/collect/clauses_of.rs"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad00fc6d2bc6deeb88e69a9ffed3e651c27d976d1453ceb534aaf7bb43cb5505"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 36 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":"compiler/rustc_hir_analysis/src/collect/generics_of.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fc159dd268124251eb73708f56818a39c2ba786fbf837934491a0c8d17accfa"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 209 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":"compiler/rustc_hir_analysis/src/collect/generics_of.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cd6c7101c85ea1ca93e09100fb4c199eca49eec425b66e8920b47a92bfa4b38"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 98 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":"compiler/rustc_hir_analysis/src/collect/item_bounds.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"6472c954b91f8d03c13d5668bf64d28bbf079c396ec2aaccf0e289cc8a602365"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 386 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":"compiler/rustc_hir_analysis/src/collect/resolve_bound_vars.rs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"b56b31213df19a95d845e7d294634d3e536061190ad79f979e5585c699f4fa6c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 2643 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":"compiler/rustc_hir_analysis/src/collect/resolve_bound_vars.rs"},"region":{"startLine":2643}}}],"partialFingerprints":{"codehealthFindingId/v1":"e48a722c069dc20fe98c10387a45e15748965e12e8a1e62fa85793c0fd9b5ed8"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 2696 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":"compiler/rustc_hir_analysis/src/collect/resolve_bound_vars.rs"},"region":{"startLine":2696}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbb04b9dcc5bf3a6e2ec2f432ae61e100131a31be405e97914ad97e3efe6d53a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 84 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":"compiler/rustc_hir_analysis/src/coherence/builtin.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b4a85d60e7e06bbe04dc9081ead7a8b97cb4e823579aafc86b1bb2a8113cade"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 87 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":"compiler/rustc_hir_analysis/src/coherence/builtin.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"d60158dfa04758bd2b7f71a872674f2f9b0d802522053484928c323efc3df7f3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 92 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":"compiler/rustc_hir_analysis/src/coherence/builtin.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"213b5013a9d06e448d26ddf73a27c805b109ed65e9b53282466f83ec8374c73a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 137 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":"compiler/rustc_hir_analysis/src/coherence/builtin.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2bb72652439a37d111e4005e28ff78ece087e14856114a0367655dbffdb75d8"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 140 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":"compiler/rustc_hir_analysis/src/coherence/builtin.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a32e579381da920d2e9e153efe2bffbe1eeb6c3452752c65ae3f9a7f5c2e37b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 250 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":"compiler/rustc_hir_analysis/src/coherence/builtin.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3aef5797d12b5c33fbfdbf18d38e3d5c80d5b9f52db2b88ffe1e73143cbb722"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 261 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":"compiler/rustc_hir_analysis/src/coherence/builtin.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"156705635b214d5b5b8e37eb6fb8463a22c5d3befc10e167a1b2dde05b6bc121"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 272 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":"compiler/rustc_hir_analysis/src/coherence/builtin.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"f86ee6def52c29d061339862e4a6c7667f81cb067ebe25075e23d796102d4f92"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 291 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":"compiler/rustc_hir_analysis/src/coherence/builtin.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"aabbc81bc7ff0fd7639de6e07237714c0a14832b9f4a8fe1698d580d2366a7ea"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 315 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":"compiler/rustc_hir_analysis/src/coherence/builtin.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"b00d7bb0aef956fe095bb8382f60644c55273e04a5c1318b500387fcdf3dbbaf"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 469 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":"compiler/rustc_hir_analysis/src/coherence/builtin.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"353f02ea4715c9903d3351f97e6f066902119bb416250d1aa93b706902eba744"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 659 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":"compiler/rustc_hir_analysis/src/coherence/builtin.rs"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b3d9250ba61afac6f8cb7759cf1d170f402cd485a5aef68e310de01f8d8a884"}},{"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":"compiler/rustc_hir_analysis/src/coherence/builtin.rs"},"region":{"startLine":671}}}],"partialFingerprints":{"codehealthFindingId/v1":"113a7bc682c5427b51fde6122752266e5b95349cab5fdfbf6b66dbf872d91495"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 676 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":"compiler/rustc_hir_analysis/src/coherence/builtin.rs"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"00376af669b2d071c668bdbc7a8f62c2404d6663a01c5f986a0c052eac306fd1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 305 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":"compiler/rustc_hir_analysis/src/coherence/inherent_impls_overlap.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"84df0eea75ad1d2f3d5757346e63e7dee6b4e6efd102089894f34e93292bde35"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 34 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":"compiler/rustc_hir_analysis/src/coherence/mod.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"67242e2bb26cc8fbfd8a260033acc2d52825eeb62f6b24a922e4f47ce479e5a2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 200 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":"compiler/rustc_hir_analysis/src/coherence/mod.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"c840ed6ce2615fef2d042b45b0f5a1a0b17b66e6b7f94d2c017b9d764d6e5d00"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 92 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":"compiler/rustc_hir_analysis/src/coherence/orphan.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"950d567583481de0983f203200af9b4e947e91050f26cdf4102c0dbd2c7bb3ce"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 314 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":"compiler/rustc_hir_analysis/src/coherence/orphan.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"140ca632fc2250b163f27054d213fd4d80c8f728ef4ce2140f3065a204deb0bb"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 232 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":"compiler/rustc_hir_analysis/src/coherence/builtin/coerce_shared.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"2221a7b60e8af55543395f1f48394ad78af6aa1aa113851ae716cabdef2cb222"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 2149 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":"compiler/rustc_hir_analysis/src/check/check.rs"},"region":{"startLine":2149}}}],"partialFingerprints":{"codehealthFindingId/v1":"f79b8bc34b972e97bd6bae9c7a01baa834eab2631b9274b3731887702994421e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 399 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":"compiler/rustc_hir_analysis/src/check/mod.rs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc1a58168195374f83ff12ab04ad76686fc67e305c540fc24a8401f9f208c975"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 62 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":"compiler/rustc_hir_analysis/src/check/region.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"649962bde41a17f9142918e4eb8ddcc4b20ec98b4e191cfe971282861413768a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 224 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":"compiler/rustc_hir_analysis/src/check/region.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"718283b006f673c7ac447c51c60380033b553de4574d070d8dc4b30b215fd44f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 410 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":"compiler/rustc_hir_analysis/src/check/region.rs"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0007595bd869746db1e98ae1e949d7769ae2b064d8afa0ff103879097065779"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 769 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":"compiler/rustc_hir_analysis/src/check/region.rs"},"region":{"startLine":769}}}],"partialFingerprints":{"codehealthFindingId/v1":"6562929cc64d3777eab460fb7931eda8a48c86d0669b09e43309c008036b631a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 642 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":"compiler/rustc_hir_analysis/src/check/wfcheck.rs"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"848ff9073b6d75144a55c7a59ae523b349ebda985bbdc1bffccbb24a567229f0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 677 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":"compiler/rustc_hir_analysis/src/check/wfcheck.rs"},"region":{"startLine":677}}}],"partialFingerprints":{"codehealthFindingId/v1":"01df7b878597912fc7e2f39f001d3b72bfe33bc38283df53b0ddf313426d8eea"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1149 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":"compiler/rustc_hir_analysis/src/check/wfcheck.rs"},"region":{"startLine":1149}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4976942d30e47968a99f89b5a653128d51a5d055d827f2fa65eff0e9b2a4694"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1772 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":"compiler/rustc_hir_analysis/src/check/wfcheck.rs"},"region":{"startLine":1772}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d76ae02345bc233066ffb553c1ea5e8d2858925b648a98dd1a0c94b8c50fa2f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1970 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":"compiler/rustc_hir_analysis/src/check/wfcheck.rs"},"region":{"startLine":1970}}}],"partialFingerprints":{"codehealthFindingId/v1":"18dc467e5b412b58b95674c24df31fec61400db14d0c29c96aff724b0cedd809"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 2020 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":"compiler/rustc_hir_analysis/src/check/wfcheck.rs"},"region":{"startLine":2020}}}],"partialFingerprints":{"codehealthFindingId/v1":"5afc22262743ce3b624a086a8e1fabfb3de95ada39b28150697b81148fa3f903"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 2074 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":"compiler/rustc_hir_analysis/src/check/wfcheck.rs"},"region":{"startLine":2074}}}],"partialFingerprints":{"codehealthFindingId/v1":"8724c5ca4c938ce9436e8fef42ec1dac0c1b4faf1a3f240ec3d1b04917295a53"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 335 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":"compiler/rustc_errors/src/annotate_snippet_emitter_writer.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"07f347dc82e9fa369ac20b296b8276c8d124a9374a3372a0c6dd4ab8d24f7d58"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 354 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":"compiler/rustc_errors/src/emitter.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"da838886ae9453cbad43578a9b5931b4b904af13015ecabd86e586a5ac84fcc0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 359 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":"compiler/rustc_errors/src/emitter.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7eca570f2e32a09afacf3effb8c004d317095a0c245c371bb386d0a7426177d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 603 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: \u0060warn!(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":"compiler/rustc_errors/src/emitter.rs"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b1173736cc8a7d223551d7497fefaf78a008a6fd9eea988f9aaba59991df511"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 615 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: \u0060warn!(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":"compiler/rustc_errors/src/emitter.rs"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd60b6d4168713b95f50d755d52f8cc76380179bf7527720864d9889d5ef2344"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 241 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":"compiler/rustc_driver_impl/src/pretty.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c821e61bbb692f8190a0a460e2d79f8856f687e9aebf00f34e3e3d4a98f03c7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 272 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":"compiler/rustc_driver_impl/src/pretty.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"39b2515d3a5929d120ac5fae319d31f5abb6ff4430d1aab953771641f21cf9fa"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 669 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: \u0060warn!(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":"compiler/rustc_data_structures/src/profiling.rs"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"63edb00479cfc31f487f7cab6349507069b59a54dd7f1d980b23e7a75ab09d2a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 350 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":"compiler/rustc_data_structures/src/obligation_forest/mod.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eae18ec693493453f895c77b4b872874056eb9d5df3d48d38bcbf63f77293ff"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 202 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":"compiler/rustc_data_structures/src/graph/scc/mod.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"62f1e9e05720fcb1c6f527d48bf402e438dc29460feef81899a7a97b583e79c0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 398 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: \u0060trace!(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":"compiler/rustc_data_structures/src/graph/scc/mod.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"47a004d364b3c0fcf34698f6268deaffa7c72a89c37057cf7b3c66f854848d48"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 472 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: \u0060trace!(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":"compiler/rustc_data_structures/src/graph/scc/mod.rs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"550eded0999901c483b4944a606c65cf4de2e6c7ed44c9f17c84df1cb048c735"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 499 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: \u0060trace!(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":"compiler/rustc_data_structures/src/graph/scc/mod.rs"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"86f88073dd4cbcd7594ba2594b11404e9186551c3997e08d270d7a1f2542b7d0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 546 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: \u0060trace!(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":"compiler/rustc_data_structures/src/graph/scc/mod.rs"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"4744fd4da8df5b9773425f8e8934a63b8a45ca302ad123cf7b2138b85cf798f9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 595 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: \u0060trace!(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":"compiler/rustc_data_structures/src/graph/scc/mod.rs"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0795b7e79999799d2c8a6aa987a67d4191f9a0f7d8037fb88bd99cd4942f345"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 613 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: \u0060trace!(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":"compiler/rustc_data_structures/src/graph/scc/mod.rs"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9a17a34683a6413484e88c809d1aa07359c9125f2b93b53509ef9a2407f8f47"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 625 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: \u0060trace!(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":"compiler/rustc_data_structures/src/graph/scc/mod.rs"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3b533674cdf6e0eb4651f4acf27313fa6e63297dee67bee0efba7e6ae249268"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 645 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: \u0060trace!(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":"compiler/rustc_data_structures/src/graph/scc/mod.rs"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"b17cbfe2b2dd5ebd01f09cebdce0944c5ef2288cb90fae3c7a802ed0fe793457"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 675 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":"compiler/rustc_data_structures/src/graph/scc/mod.rs"},"region":{"startLine":675}}}],"partialFingerprints":{"codehealthFindingId/v1":"429e1ebe7011b0260f6c308ad35df2e14e725f0098882a98f081e2ef48ae0f64"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 177 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":"compiler/rustc_data_structures/src/graph/linked_graph/mod.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"490a4169d7235ddec736797ef81b50de8658f3e820994b8447eb9d1ef4de4f6d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 18 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":"compiler/rustc_const_eval/src/util/alignment.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a7a2308c21031f255c8e4e27a05aa08961b7da71c4d707a42a858e77194af63"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 20 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":"compiler/rustc_const_eval/src/util/alignment.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"3405364c1c13fe8d4268d723783106de65029b017990269481c4b044ceeec7c4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 37 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":"compiler/rustc_const_eval/src/util/alignment.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9a7c9128b3aa8136ca53136434f10720421368619d9cbb039173d95afd0fc1f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 47 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":"compiler/rustc_const_eval/src/util/alignment.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f02f7d807763cb47a8c263318f048ca7775c01c09fa39f522b77e4be2faf663"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 62 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: \u0060trace!(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":"compiler/rustc_const_eval/src/util/caller_location.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7fbe5d0a07c9cc1b90a34c689800eeca8a8c9d495b8785884f410a03480c423"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 398 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: \u0060trace!(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":"compiler/rustc_const_eval/src/interpret/call.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"11e1fbd35166f6aff0d3c3af3ef6c396dbc7ed0b2ac53d376d542dac050769ca"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 553 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: \u0060trace!(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":"compiler/rustc_const_eval/src/interpret/call.rs"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"eebc9126ec5d2311727dede44038b122a7d1532ccf3b5609e3b193f30221111a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 566 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: \u0060trace!(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":"compiler/rustc_const_eval/src/interpret/call.rs"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"61d9670bf5fa56aaeb154af3f8c628c52d6a84b029171e6d99e6c5be86d12adb"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 770 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: \u0060trace!(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":"compiler/rustc_const_eval/src/interpret/call.rs"},"region":{"startLine":770}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcd70d6eb4ddd970cfa5b3a0d348cc4efa0bc3922ca054feaa213c748dee8d3d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 962 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: \u0060trace!(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":"compiler/rustc_const_eval/src/interpret/call.rs"},"region":{"startLine":962}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ea98516dd330d926f3f5ce1a04f07da8b3c003527bc7ce22a81c674f8e2313a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 976 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: \u0060trace!(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":"compiler/rustc_const_eval/src/interpret/call.rs"},"region":{"startLine":976}}}],"partialFingerprints":{"codehealthFindingId/v1":"693c701d6b84a11d28772879613f08a877d1f834ed9007b6a59c7dff9a99b68a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 1034 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: \u0060trace!(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":"compiler/rustc_const_eval/src/interpret/call.rs"},"region":{"startLine":1034}}}],"partialFingerprints":{"codehealthFindingId/v1":"db5a8305a34c41303090c989ffa2986f7e0dd5da9d8d882eeb9bb3895e375426"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 1088 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: \u0060trace!(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":"compiler/rustc_const_eval/src/interpret/call.rs"},"region":{"startLine":1088}}}],"partialFingerprints":{"codehealthFindingId/v1":"4493eebfaf40160d376ea8ae489f35d1cdb5f1647c13b35bb43a9fbeda10fc8f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 1154 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":"compiler/rustc_const_eval/src/interpret/call.rs"},"region":{"startLine":1154}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccf0ba44dc1d18db527dc31e00df16d8e7e91dce972f1ad059c0a4d69da9d264"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 1180 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: \u0060trace!(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":"compiler/rustc_const_eval/src/interpret/call.rs"},"region":{"startLine":1180}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0df91d6e1149da1127561cc3a882aa0c13ce317c09c4bd3a944178b49069c81"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 536 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: \u0060trace!(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":"compiler/rustc_const_eval/src/interpret/cast.rs"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"9232803c8e5599cf3bb10d65bb9d5fcd044c2224e99f1e5ffe5f46c94e6cac40"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 58 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: \u0060trace!(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":"compiler/rustc_const_eval/src/interpret/discriminant.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f6e937e4fc48aa425ef33c0aebdbe8919b7252462f8c1ffe988690ede2bc156"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 61 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: \u0060trace!(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":"compiler/rustc_const_eval/src/interpret/discriminant.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"839e551eeaec070ee1916150eeb54308a2fe584ab1ed5ab99e180573c68f08ec"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 103 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: \u0060trace!(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":"compiler/rustc_const_eval/src/interpret/discriminant.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4d2464d265dfc50c3565891039357cc7a3984154a03189b4ce1a64b02db7bfb"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 312 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: \u0060trace!(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":"compiler/rustc_const_eval/src/interpret/eval_context.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"e20f841a4c1ee37ca0a6159c1556d5dda744ef3874bb77abe9d74dcc643c7b47"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 366 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: \u0060trace!(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":"compiler/rustc_const_eval/src/interpret/eval_context.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea3da4f0d4eae058ebde5577d4259cb6924880cde372c348aae3d537627b0f19"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 367 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: \u0060trace!(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":"compiler/rustc_const_eval/src/interpret/eval_context.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d95caf65a0e955bd171b95e2e05c6d1bb333b2a483dbdf1dd84f610055e9ffd"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 368 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: \u0060trace!(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":"compiler/rustc_const_eval/src/interpret/eval_context.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"3956f55de52adc8f8eb86dea3c153bf7072d290947fa587c9303df0ae5702fe8"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 436 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: \u0060trace!(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":"compiler/rustc_const_eval/src/interpret/eval_context.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f2fc89e0ea9f11b679c211749d33154f2748d319aab09dfa19fa895639d3a59"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 110 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: \u0060trace!(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":"compiler/rustc_const_eval/src/interpret/intern.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"05f8284ecc09abd4c3f1c828df2a9a096c1779908cd800a11e614e3e678396d7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 726 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: \u0060trace!(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":"compiler/rustc_const_eval/src/interpret/intrinsics.rs"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e1b96091be2950e3af0bb888d68886c14e4ce219687560a59cc0d711645f743"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 387 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: \u0060trace!(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":"compiler/rustc_const_eval/src/interpret/memory.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce7c084413052ed7424b8d06f25e89bb559d5343108d3878f2fcaa1566248160"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 1007 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: \u0060trace!(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":"compiler/rustc_const_eval/src/interpret/memory.rs"},"region":{"startLine":1007}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e56061254831c2ad29e0eef5cad02f377777f0fccd7ede82d1a46e410301e28"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 1021 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: \u0060trace!(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":"compiler/rustc_const_eval/src/interpret/memory.rs"},"region":{"startLine":1021}}}],"partialFingerprints":{"codehealthFindingId/v1":"79c1837a67cf5d0f5716acc3b5b780089be4026ea72812623432e0331ba6b3a2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 1040 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: \u0060trace!(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":"compiler/rustc_const_eval/src/interpret/memory.rs"},"region":{"startLine":1040}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b7470ce256cfa7f417071bfc38cc09165fa5076abf252a1659ab56e92e462a1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 1061 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: \u0060trace!(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":"compiler/rustc_const_eval/src/interpret/memory.rs"},"region":{"startLine":1061}}}],"partialFingerprints":{"codehealthFindingId/v1":"d440ed0fa2102b5626bf915d2f863bc84f0f6f45f4cb9d3af26f49b4254fecca"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1329 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":"compiler/rustc_const_eval/src/interpret/memory.rs"},"region":{"startLine":1329}}}],"partialFingerprints":{"codehealthFindingId/v1":"a101c97a00a7180a5a9b3c119cae491e5eb0dde81fab1b3296b90d55f9adc388"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 809 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: \u0060trace!(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":"compiler/rustc_const_eval/src/interpret/operand.rs"},"region":{"startLine":809}}}],"partialFingerprints":{"codehealthFindingId/v1":"7949c8aea77502502deacc63f1b6524dd978f0b573ce57b6130f860f3e149f8f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 867 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: \u0060trace!(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":"compiler/rustc_const_eval/src/interpret/operand.rs"},"region":{"startLine":867}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7d3d439e874ccfda5734459c65a4f6fbdc565aa838df8064983f002163873ed"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 373 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: \u0060trace!(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":"compiler/rustc_const_eval/src/interpret/operator.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"5264db4d4504d7a744e0757786568f27908001ae8f6b9ac45802da717b25d415"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 453 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: \u0060trace!(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":"compiler/rustc_const_eval/src/interpret/operator.rs"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3444e7fe699e95ad1dc9d5d743835806f853259fe1a12e45bd2607403929e6a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 479 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: \u0060trace!(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":"compiler/rustc_const_eval/src/interpret/place.rs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2d1596eef1d520b062b46d38725183bbcbd124d5c0e3add100d747cee622aa4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 622 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: \u0060trace!(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":"compiler/rustc_const_eval/src/interpret/place.rs"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"d33d108cfe321152959f98fa4d6264ae7214c093e77193c82ead9f9bfa249647"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 1025 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: \u0060trace!(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":"compiler/rustc_const_eval/src/interpret/place.rs"},"region":{"startLine":1025}}}],"partialFingerprints":{"codehealthFindingId/v1":"38fffde2f34473ae4f34565ba9225f1091a5af72cf2806504e7f67c3dd71b086"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 334 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":"compiler/rustc_const_eval/src/interpret/projection.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bbd0bfa7eb4679d352d4e9d862d3cba72bfebc50507c03a68b4478deaef14e7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 373 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: \u0060trace!(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":"compiler/rustc_const_eval/src/interpret/stack.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"c14613908b7fa0a5e567fa44aaa8a269013221adc8e7d18735cbda7a97c765a5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 391 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: \u0060trace!(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":"compiler/rustc_const_eval/src/interpret/stack.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa3dd6e3a4b145babb6da1d8e7666050474b6becaa17b0191dc5e68e4c7b3e77"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 516 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: \u0060trace!(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":"compiler/rustc_const_eval/src/interpret/stack.rs"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"2276c9100337cb42eb899f43aa23909ea87b1f9b138d2d16790da189d6cd4f4d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 609 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: \u0060trace!(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":"compiler/rustc_const_eval/src/interpret/stack.rs"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"c26884b49e6b4802a82ef93e62ebbe85679a5ac27360cb59018de0b9b37d87ec"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 621 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: \u0060trace!(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":"compiler/rustc_const_eval/src/interpret/stack.rs"},"region":{"startLine":621}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc71cdb91cac793fb67d0ac986ae7d873db551bf3106bf55c6f8a11ec9ce1def"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 691 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: \u0060trace!(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":"compiler/rustc_const_eval/src/interpret/stack.rs"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3950f6465237746c71d1cefd27cbedbdce12344a59a241efe1623c39147a3a9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 71 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":"compiler/rustc_const_eval/src/interpret/step.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"3edb6a39e0a38496b9f7e08d28b3730518d19c22f70e89849e35f4d64220f368"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 89 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":"compiler/rustc_const_eval/src/interpret/step.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"a526aa87f8a68fed4e3edbe0832ba9acc93f776024723ce38f5ae4c6b81362b9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 299 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: \u0060trace!(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":"compiler/rustc_const_eval/src/interpret/step.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"75850040b18464c31bf1f8e98f5daa5b29e77c83dcdca5117604c8b56917bfc5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 555 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":"compiler/rustc_const_eval/src/interpret/step.rs"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfd09d2074b735cb2ac44411db2f95c70016d76ee4ff8c1df6752665f5b1d13a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 567 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: \u0060trace!(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":"compiler/rustc_const_eval/src/interpret/step.rs"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a2dfda0c98b3cd7824b5f3983dc3d28824a195290bcbfdbf5f7e0fb8320f3df"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 673 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: \u0060trace!(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":"compiler/rustc_const_eval/src/interpret/step.rs"},"region":{"startLine":673}}}],"partialFingerprints":{"codehealthFindingId/v1":"56b92790ae8cc6e74fc0ebaf371684634898e2169088c016a5da7ff169ea7984"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 24 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: \u0060trace!(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":"compiler/rustc_const_eval/src/interpret/traits.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"427ba7d9310f1dc34cf87be105211981e12b41c2e264703104e83303755b40b9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 61 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":"compiler/rustc_const_eval/src/interpret/util.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"363a141c5532bea8e2262c534a1a97264a628076387102bb837d993d19a1aeee"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 304 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: \u0060trace!(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":"compiler/rustc_const_eval/src/interpret/validity.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"c431a1f258b9627f8e15869625b8e93e92fdf1531a1e436d78639f630bb2e964"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 1170 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: \u0060trace!(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":"compiler/rustc_const_eval/src/interpret/validity.rs"},"region":{"startLine":1170}}}],"partialFingerprints":{"codehealthFindingId/v1":"15bd097852bc42b2b3ca586e1a806fb0d7b01118b6db0bc2bc934a7e4dc5c088"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 1364 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: \u0060trace!(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":"compiler/rustc_const_eval/src/interpret/validity.rs"},"region":{"startLine":1364}}}],"partialFingerprints":{"codehealthFindingId/v1":"e62640b4ef9ac0ed0989b9a70fe4de4d6ed0719937effc54fa80ad277db92c55"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 1622 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: \u0060trace!(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":"compiler/rustc_const_eval/src/interpret/validity.rs"},"region":{"startLine":1622}}}],"partialFingerprints":{"codehealthFindingId/v1":"95e2a7c1a8ff4333f1e98155cb9f9d9c001cd6e7933291787517a5a73f98c29d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 83 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: \u0060trace!(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":"compiler/rustc_const_eval/src/interpret/visitor.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"1201cc23d5f433d73d9a45245cd0d3cf1354a20b7ce3df03ca3c2d6fda2c3e7c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 95 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: \u0060trace!(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":"compiler/rustc_const_eval/src/interpret/visitor.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b45a4061b76fb51c564fc28c18fccf21202e33d9b0f01c81953195d4125b44f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 175 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: \u0060trace!(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":"compiler/rustc_const_eval/src/interpret/visitor.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbc97741c67677ef5f91a80bc268cd3e3f431292faf3b593f13fb5d54c96d616"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 129 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: \u0060trace!(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":"compiler/rustc_const_eval/src/interpret/intrinsics/atomic.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"708b292d3483db8de1c935f5c258623c4fe6d7cd6a1e1b1a845823692957e009"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 793 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: \u0060trace!(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":"compiler/rustc_const_eval/src/interpret/intrinsics/simd.rs"},"region":{"startLine":793}}}],"partialFingerprints":{"codehealthFindingId/v1":"db64ec0711c696d33db85c4552d0ef80a5547874b3eeb29683675deb3e14463a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 106 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: \u0060trace!(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":"compiler/rustc_const_eval/src/const_eval/eval_queries.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"897503c42746d9ecf6545397d669671a6fedf13ab328965ce00bcfa8bd3c7c28"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 228 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":"compiler/rustc_const_eval/src/const_eval/eval_queries.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3ac80aea7c35e66d7652119b42c7c60bc1e152b312f9defff3bc6360a32394b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 313 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":"compiler/rustc_const_eval/src/const_eval/eval_queries.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"65d552923603bf912fb31d95624a70c9483e6921f67d6afb2f8b3ac3e3071bdc"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 444 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: \u0060trace!(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":"compiler/rustc_const_eval/src/const_eval/eval_queries.rs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"a18db8103ec7531b3d5aca25f475666ddc7c15803dd24459603d71e1b1d2b7a1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 436 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":"compiler/rustc_const_eval/src/const_eval/machine.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"eefe6eeeaeb39c5facb3294859b9028c6245dd5a4420927ecf3e2f3edd728b3b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 92 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":"compiler/rustc_const_eval/src/const_eval/valtrees.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"26fa3e925c76dbf32e9dfdcf8461e7a51af8e249eab8ac08c04507089ed09276"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 427 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":"compiler/rustc_const_eval/src/const_eval/valtrees.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"913857a6e20d90650e1e7b3f6392766d67dac60b4e1911dff0154dc6308bac3c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 490 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: \u0060trace!(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":"compiler/rustc_const_eval/src/const_eval/valtrees.rs"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d7610c6d6b80d012285c50a4c61d462952834e8c16dbed07fd6c67406021f14"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 512 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: \u0060trace!(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":"compiler/rustc_const_eval/src/check_consts/check.rs"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"da89fe1d0af11233c156375d58491cdce1bb608cb6044438e4616b469f3a2966"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 529 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: \u0060trace!(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":"compiler/rustc_const_eval/src/check_consts/check.rs"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"00fecccfc40df1f3c3bcbb9d4dfadb74cb980cf078fd8a4b2985a033880fcc5b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 697 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: \u0060trace!(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":"compiler/rustc_const_eval/src/check_consts/check.rs"},"region":{"startLine":697}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f12283259e67133b13eba4342501c95294635290bc04cbeeafeae8b6f084edb"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 702 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: \u0060trace!(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":"compiler/rustc_const_eval/src/check_consts/check.rs"},"region":{"startLine":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfdc1b42c16ccaf84467acc44abc142102c27706ea17f7c91f464ed059b02a73"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 60 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: \u0060trace!(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":"compiler/rustc_const_eval/src/check_consts/post_drop_elaboration.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"c95887a0315c2e411af84c9dc1aeb98d83ad5b4c45781cdae35659c01110170d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 71 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: \u0060trace!(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":"compiler/rustc_const_eval/src/check_consts/post_drop_elaboration.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"0308d0b2cdcf6e22035a8e71b1546ba436c82300a61e211fbce4a0a48a43cc7e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 150 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":"compiler/rustc_codegen_ssa/src/assert_module_sources.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"af4e3ffa9696fb80f32f5c8a4479f8440b0ce88dd84f615f71df2ceef7393169"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 177 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":"compiler/rustc_codegen_ssa/src/assert_module_sources.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"98a1dbe3d4cbda5e187a0d308c3153b6862fa01021eff33814199f4343a8836f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 239 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":"compiler/rustc_codegen_ssa/src/assert_module_sources.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5d755900a4b4915f7cd80355371a6d3ef18fedb9e8d16d6eaa534e0a7494950"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 255 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":"compiler/rustc_codegen_ssa/src/assert_module_sources.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"699f0a688b82c8253d1261dc5c5d7d57be2e0eef46d444f82d1539acd6900edd"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 227 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":"compiler/rustc_codegen_ssa/src/base.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"e697c863d4b1b8788bcd414102b8e599dbbd94ff2e0e09be1e4ec2ffb8549f56"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 398 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":"compiler/rustc_codegen_ssa/src/base.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4bae2928599aaca0a361609a2debb1547ee0c6384ad05ea0823d21780464641"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 52 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":"compiler/rustc_codegen_ssa/src/meth.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e5486810e1e913722d693f948d5e4432f84e7962d50ed67fe479922ee3b4b92"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 100 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":"compiler/rustc_codegen_ssa/src/meth.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea30bf03921f0bc0beae00b2204e5531c1e26c95aa2cdb005e124839c60dbebd"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 109 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":"compiler/rustc_codegen_ssa/src/meth.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"992e75db7cf994699af0a5e6b6cafd2fbc48d4718f5ba8ecf34028093a87e910"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 35 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":"compiler/rustc_codegen_ssa/src/mono_item.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"59637ca9aaa5322551c7f2ca85570533961cc3e0c56ae87c9cc6af28c8897d13"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 54 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":"compiler/rustc_codegen_ssa/src/mono_item.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"e57ec6fed54c4239e54d418ce36bbe15643f178cd3b92f4c0ac7c6f212733dc9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 64 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":"compiler/rustc_codegen_ssa/src/mono_item.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"81c9dec533dbc83640bd4ae0d62b075f13d07e060cb0a76b92eb11bd4a15e97f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 68 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":"compiler/rustc_codegen_ssa/src/mono_item.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bb8f2288cbcd41ff4b81ca730488d50772812dfd7a6354520629704132a7392"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 86 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":"compiler/rustc_codegen_ssa/src/mono_item.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"daf3d37c82fcb0e4402bdb0700907419847bb94a4d4c4680c0ee9f8b52429809"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 21 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: \u0060trace!(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":"compiler/rustc_codegen_ssa/src/size_of_val.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"759c86e0a7957db2a74ebf467ce4684ce192e217cb4a56fbff9f44628ec5d4c7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 96 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":"compiler/rustc_codegen_ssa/src/size_of_val.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"071ab9aa0344a2d356cce40638027bf65217c1358870f8c05e008cd9b7ecb1e3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 101 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":"compiler/rustc_codegen_ssa/src/size_of_val.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"75737577d859128e9fb2e047b757dea286240cfc7e93d1835db4eff79da55de3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 178 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":"compiler/rustc_codegen_ssa/src/mir/analyze.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bd45385283ff4b50ab0f06b2ff48878891ea28d8ef1a53b5e359614920b0189"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 190 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":"compiler/rustc_codegen_ssa/src/mir/analyze.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8d0723feb91b7109681f9ffbdcc0cef15af4cad82ae91ec537ca93149fcd3ea"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 324 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":"compiler/rustc_codegen_ssa/src/mir/analyze.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"79e6d8f3e74487309b9c8f277bdc0d038a1c9500e15d3a84b9464c35b96ccad7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 343 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":"compiler/rustc_codegen_ssa/src/mir/analyze.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d7bb523c30d273f44a4e192a1b47a9de0d695eea13838fa25089da6ab871a01"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 366 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":"compiler/rustc_codegen_ssa/src/mir/analyze.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"28f51a3217cead1eab69bd7dd7fe68318bbe6478d905e7f51707e3067b7887c6"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 373 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":"compiler/rustc_codegen_ssa/src/mir/analyze.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad066bf0b657677adb4dd470db2190f046148d080456b957bc243bca67fb8ddf"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 388 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":"compiler/rustc_codegen_ssa/src/mir/analyze.rs"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c385529bc9bf3d0e60161899914c178109ce8b0df9adbee0847e0ed38052cdb"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 406 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":"compiler/rustc_codegen_ssa/src/mir/analyze.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a3690c80f7bd9155b1fcd7cc118f82488f53f6bb348e684ecb33d1e8ea68b20"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 100 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":"compiler/rustc_codegen_ssa/src/mir/block.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"d287875ce2f44abd014c935291aa6bbf40192cff5395e1b8fe994c61e237ff8b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 197 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":"compiler/rustc_codegen_ssa/src/mir/block.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0b154addd5cb8f9ca5778dea26c4a8f9d3c277b2ced4f95eae658c3d70fece9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 696 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":"compiler/rustc_codegen_ssa/src/mir/block.rs"},"region":{"startLine":696}}}],"partialFingerprints":{"codehealthFindingId/v1":"77e147192ce79a22cdbf1a211803e8ea7afa3b48bca0610dd27f7b04a4122a53"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 697 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":"compiler/rustc_codegen_ssa/src/mir/block.rs"},"region":{"startLine":697}}}],"partialFingerprints":{"codehealthFindingId/v1":"f509da926e110f8fba7bc9c5ccd224dfbb22f90f9ddad89c217a23a707bf217a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 698 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":"compiler/rustc_codegen_ssa/src/mir/block.rs"},"region":{"startLine":698}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce926f2d62344c4ab2c46f3df63495d97d9c4743c919588d59562cffeab18855"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1445 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":"compiler/rustc_codegen_ssa/src/mir/block.rs"},"region":{"startLine":1445}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc2f2d8bd6408caa6cbf29da272ea418f759ae6df652fc18178bf47fc947c579"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1620 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":"compiler/rustc_codegen_ssa/src/mir/block.rs"},"region":{"startLine":1620}}}],"partialFingerprints":{"codehealthFindingId/v1":"79f3c9b5e763829742fa0a54088c559bc6a25cb407ef6d7ada8eed8945d0f48f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1653 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":"compiler/rustc_codegen_ssa/src/mir/block.rs"},"region":{"startLine":1653}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2bef81bc6bf4cb8942731a53aa47fd04d8e2a0d9813d2fcabae62e24924e303"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1663 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":"compiler/rustc_codegen_ssa/src/mir/block.rs"},"region":{"startLine":1663}}}],"partialFingerprints":{"codehealthFindingId/v1":"b998f5bc437ae095b4f1b39c025665a5fe141439bef24b028b12482c7c1275cf"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 51 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: \u0060warn!(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":"compiler/rustc_codegen_ssa/src/mir/locals.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"213c3bb9ac0a2f5aecccd6f1aed967d1f368dea6325958df760337ed8e676560"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 136 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":"compiler/rustc_codegen_ssa/src/mir/mod.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea202c2d83385cb3699d48b600162971bf46c109e99da0cc74b9f27e7b8d15ac"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 217 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":"compiler/rustc_codegen_ssa/src/mir/mod.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"78bcf5fdec703ab15f145b2928c5590623a1c1c15709b9c5c29db7fc58d20e7a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 329 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":"compiler/rustc_codegen_ssa/src/mir/mod.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d52220ac0e4074e7fec9215e2413816a04b69fee17fa650f125ddc67996ffae"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 334 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":"compiler/rustc_codegen_ssa/src/mir/mod.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5007a4818ea7e85eeb668c353ea2e84fd9e26b55493ff14301e032ff1f1d132"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 344 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":"compiler/rustc_codegen_ssa/src/mir/mod.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2c32fd4802db069398a2fbd7e09e601b77d65f089e9822d4a2dd71f76a97e02"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 351 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":"compiler/rustc_codegen_ssa/src/mir/mod.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"38572091afc2d5da26f1b4f5f9a9bfeba7cc3085c5eea3665051ab03f93d1cf0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 350 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":"compiler/rustc_codegen_ssa/src/mir/operand.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a99e81047e70ad7ab8d6bc598a399e9584db6f2f717bbeea22b726a8b1dc64c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 371 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":"compiler/rustc_codegen_ssa/src/mir/operand.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"93f710db289538a1f5c408fe96224bfc4825c5ba5d4cb17298735ced7b55ffd9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1034 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":"compiler/rustc_codegen_ssa/src/mir/operand.rs"},"region":{"startLine":1034}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8e4d8b05e3988c0c39108b8856a5a4fb580dd4a10e29a4c376aa02ccd63cbbf"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1077 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":"compiler/rustc_codegen_ssa/src/mir/operand.rs"},"region":{"startLine":1077}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ed7cfe4218c9803e0635279325e83bfea64feb5872c9f08e4bf852ea5071519"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1123 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":"compiler/rustc_codegen_ssa/src/mir/operand.rs"},"region":{"startLine":1123}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d0f6b0ea32e860a2695407bb723b20f9f729aa442367d00adefd6002fd81bea"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1148 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":"compiler/rustc_codegen_ssa/src/mir/operand.rs"},"region":{"startLine":1148}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4457b46b42744e25d03336ce097862f8820aeea5d37f80cb1a500172c73d72b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 251 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":"compiler/rustc_codegen_ssa/src/mir/place.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"28fcd7acaf9d5d02cc12cc50156125e70a6e20ce7dde4a35ddbc1e31afbd8b72"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 420 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":"compiler/rustc_codegen_ssa/src/mir/place.rs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a0628c3dcbe918e54ca3d09f103c6f393fbfbdeb9c88a2d5d892ec31eaf76ae"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 499 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":"compiler/rustc_codegen_ssa/src/mir/rvalue.rs"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"7041b764936e2facefc01e600b32f17944393da5c157c582f732b698842c4b8f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 99 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: \u0060trace!(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":"compiler/rustc_codegen_ssa/src/back/archive.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7da467380af74159c6ea9c17393e3c188f002de83c4b68e207163d98374e885"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 100 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: \u0060trace!(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":"compiler/rustc_codegen_ssa/src/back/archive.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cbbf89e07bfc33c50a3f6cef23fa88ff0fb0a548e8ea2c404ad3ec57d661fd1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 101 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: \u0060trace!(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":"compiler/rustc_codegen_ssa/src/back/archive.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a213fdccef310a708ee6895456943fd1621acfd083f39a19973f27df242d8bc"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 363 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":"compiler/rustc_codegen_ssa/src/back/link.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"818e2da6567c43f805351e8b7530353d86a4786f97dd2b836c8df89c129af9b7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 764 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":"compiler/rustc_codegen_ssa/src/back/link.rs"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"2491e2c2ffed60bccadc476881d57146d90e841de66bab940c4999ce8123234b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 1071 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":"compiler/rustc_codegen_ssa/src/back/link.rs"},"region":{"startLine":1071}}}],"partialFingerprints":{"codehealthFindingId/v1":"689545ae36101d4d55c846ed93694d5abaf52c69aa75cad8994f9999387f94b1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 1072 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":"compiler/rustc_codegen_ssa/src/back/link.rs"},"region":{"startLine":1072}}}],"partialFingerprints":{"codehealthFindingId/v1":"adfd18443d59f569226a58e9e5416ceb64e77df9741f278e74ba6d225b03224c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 1077 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":"compiler/rustc_codegen_ssa/src/back/link.rs"},"region":{"startLine":1077}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cd8dfb9fc00044c57e6953030b2503e83788552d93bd8e48b1afd9f31e5616e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 1244 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":"compiler/rustc_codegen_ssa/src/back/link.rs"},"region":{"startLine":1244}}}],"partialFingerprints":{"codehealthFindingId/v1":"03481bd260b6c5dbc1ed8ff796a570e6748c27ccf63f2ec5fddef19c8e4bf1f2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 1293 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":"compiler/rustc_codegen_ssa/src/back/link.rs"},"region":{"startLine":1293}}}],"partialFingerprints":{"codehealthFindingId/v1":"388f76a3bbdb0f9f34298b226a7d57574cd2e44205abb514d223b12332a69e20"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 1320 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":"compiler/rustc_codegen_ssa/src/back/link.rs"},"region":{"startLine":1320}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a1e89bf1def24f0ba84d246049d325d8273837c6449a0a2dcaff0010f97f972"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 1327 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":"compiler/rustc_codegen_ssa/src/back/link.rs"},"region":{"startLine":1327}}}],"partialFingerprints":{"codehealthFindingId/v1":"c32b795f909b9fc8c9656de99233e7f9d14d2cc348c7605a174b1c8dcf94cd81"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 1341 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":"compiler/rustc_codegen_ssa/src/back/link.rs"},"region":{"startLine":1341}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b8878fda1c83be836037d690a326d7f4a3f75e593e13f866f2488a99a84668c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 1348 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":"compiler/rustc_codegen_ssa/src/back/link.rs"},"region":{"startLine":1348}}}],"partialFingerprints":{"codehealthFindingId/v1":"1edb729b57146d92c6971d7f991f14319f042ef44171f655eeabe1b5993147ac"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 1361 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":"compiler/rustc_codegen_ssa/src/back/link.rs"},"region":{"startLine":1361}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c3fe424711ed294a6940ba8050a4139dbe1ddf4fd9ffeba44290f190c187b57"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 1370 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":"compiler/rustc_codegen_ssa/src/back/link.rs"},"region":{"startLine":1370}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f77c6d6abbb5095043eb31ed701ed86d0cc71a52f7bba9dbb332757738a6b4a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 1391 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":"compiler/rustc_codegen_ssa/src/back/link.rs"},"region":{"startLine":1391}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4ee4571fa65754da1171e42d95d0618d6e383cc521931aa58534b8d2c1eef4f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1392 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: \u0060warn!(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":"compiler/rustc_codegen_ssa/src/back/link.rs"},"region":{"startLine":1392}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b2e6074f046e328a1e9c41e917bacb2da1e4e76fb4df0637430ea8880ed3b3f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 1437 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":"compiler/rustc_codegen_ssa/src/back/link.rs"},"region":{"startLine":1437}}}],"partialFingerprints":{"codehealthFindingId/v1":"5668b73dba82ff10084d833b7df148e64bd2b00246ab665d320a5163ce2cab33"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 1500 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":"compiler/rustc_codegen_ssa/src/back/link.rs"},"region":{"startLine":1500}}}],"partialFingerprints":{"codehealthFindingId/v1":"0425807df3b51fe0c73138690abc852f397d4f74f459853d4648752bccadb77a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 2159 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":"compiler/rustc_codegen_ssa/src/back/link.rs"},"region":{"startLine":2159}}}],"partialFingerprints":{"codehealthFindingId/v1":"32c1ede1669579dba7cb206e0282c3351313594b8304ba30e311c7dcb730d41a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 2198 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":"compiler/rustc_codegen_ssa/src/back/link.rs"},"region":{"startLine":2198}}}],"partialFingerprints":{"codehealthFindingId/v1":"42965e32c3c3b0f83618939e93dbfb5daedf4fffd86a0287b519d9af161ab504"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 4118 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":"compiler/rustc_codegen_ssa/src/back/link.rs"},"region":{"startLine":4118}}}],"partialFingerprints":{"codehealthFindingId/v1":"f417ddb5d5687958b404cd8a8e49a3a7a46173e3290c072412379cfbf724990d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 817 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":"compiler/rustc_codegen_ssa/src/back/linker.rs"},"region":{"startLine":817}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dbb8dda7d904cb058e02ca286f477c498bf7e4f5bbd8fdf5f3b437d354f2dcb"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 835 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":"compiler/rustc_codegen_ssa/src/back/linker.rs"},"region":{"startLine":835}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e61d6b6fe897e7f53d6166329f034b4cda9b19e830b269219109f09ec70ddf6"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 855 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":"compiler/rustc_codegen_ssa/src/back/linker.rs"},"region":{"startLine":855}}}],"partialFingerprints":{"codehealthFindingId/v1":"02520d4ddd7039482a277e11fa9860119eea20e17ebe4c04e14df156730ab06d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 872 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":"compiler/rustc_codegen_ssa/src/back/linker.rs"},"region":{"startLine":872}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f4871c220df7950cf02302eb65e0c53a5cabc7f0b44cc8f140c3117428aa8e0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1313 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":"compiler/rustc_codegen_ssa/src/back/linker.rs"},"region":{"startLine":1313}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7a797b3ea08a46b6ab0cb9f52590a164ab448fee1c795446a987b1721bc7fa7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1599 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":"compiler/rustc_codegen_ssa/src/back/linker.rs"},"region":{"startLine":1599}}}],"partialFingerprints":{"codehealthFindingId/v1":"35e760d03a88cef272c043bbfad338f9702cd7aedc1cbe19b7b1fe1a81be79d0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 120 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":"compiler/rustc_codegen_ssa/src/back/lto.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ed022a471cf09bd370993efd0c1fd6116c04be3b7f17932806c448c46c27432"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 57 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":"compiler/rustc_codegen_ssa/src/back/metadata.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eca0e086fa6a5fadf075b65cc4e406a444bafd2e265f8a9229f0162fcc55afc"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 82 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":"compiler/rustc_codegen_ssa/src/back/metadata.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"e460d5ed24afc76405d69ac988f136d143b76750ae25a1c981901197af3df829"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 123 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":"compiler/rustc_codegen_ssa/src/back/rmeta_link.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"347550872fa6f90b180acda619740b52e290193a578753dc386eb5b06ead24f7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 127 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":"compiler/rustc_codegen_ssa/src/back/rmeta_link.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1d860bc488f0093f050b172afe1642a9a147c4a1a8dbc9fb5baab545bf673fe"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 40 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":"compiler/rustc_codegen_ssa/src/back/rpath.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"c057109cc927626843d0feafb39e389bb7782494e001bc4dc23851becc92fded"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 43 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":"compiler/rustc_codegen_ssa/src/back/rpath.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe914d94e156a6a8808357798c2e36bcf7e0816b7251212d95255e6ae0d38aa4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 53 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":"compiler/rustc_codegen_ssa/src/back/rpath.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa7d5653c12c033a97f46d7924b954f64978ac8fd725a2102fb63f29505f61f2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 136 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":"compiler/rustc_codegen_ssa/src/back/symbol_export.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"582a3327b14d7ad52076695b7e3df1114b8afb314f05bb97fbfcf86b87737734"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 885 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":"compiler/rustc_codegen_ssa/src/back/write.rs"},"region":{"startLine":885}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd74e199332330ccf5fc36c98bc2e758d7aa306f9cc1c9ca2b8fdcaba02aa838"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 554 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":"compiler/rustc_codegen_llvm/src/asm.rs"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4fb60c8ccf57fa5b386f3d3fc61d74bcdaa90be18d92f82bb4a4426706be8cf"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 559 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":"compiler/rustc_codegen_llvm/src/asm.rs"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2087154b2cc0afe4435b2d6196244435cf82eb949c495f438f55e63b5dfa02a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 564 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":"compiler/rustc_codegen_llvm/src/asm.rs"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d1927bd66f74c8f096b354fd6330a18186086270c3145f51379e95808555c31"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 68 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":"compiler/rustc_codegen_llvm/src/builder.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"8346d91033464100904ee74dbd5faeb180faf27da4c0fd4c0651d823e072f482"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 190 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":"compiler/rustc_codegen_llvm/src/builder.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d7bc1ad0c5aec1a295428f15d232d6e36f5840a8da9fc07767154cd258d8d4d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 485 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":"compiler/rustc_codegen_llvm/src/builder.rs"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"891a5cd40be84b24cff052a8e6b4288b81d7a4e1065683b3184d299d9dd95fde"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 887 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":"compiler/rustc_codegen_llvm/src/builder.rs"},"region":{"startLine":887}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee509bf6f065f9223fe4f1322eb86ec68d7fae24cfb8043a17b85e2ecf64b243"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 948 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":"compiler/rustc_codegen_llvm/src/builder.rs"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"96dbf94c7720975315b072db683d6ff0015ad2a8301bdb377165b67b00df42af"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1455 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":"compiler/rustc_codegen_llvm/src/builder.rs"},"region":{"startLine":1455}}}],"partialFingerprints":{"codehealthFindingId/v1":"08a1c269ff01875dc62ca90eebfaac7e2a203f6e1804e8aaecde0c514181107d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1826 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":"compiler/rustc_codegen_llvm/src/builder.rs"},"region":{"startLine":1826}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b9819f4ddf1dea20101200097b665f47e552c7f0c29c41765ff1b78feaecd69"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1923 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":"compiler/rustc_codegen_llvm/src/builder.rs"},"region":{"startLine":1923}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb350d918ad1f11456b2e6d8128b852c8080007907ad1ccf14226b3636b666ee"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 22 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":"compiler/rustc_codegen_llvm/src/callee.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"118cca22ea423f42a1f8dcc204ff7ae565f1ddc9eed9665f1de8103bb725e7c3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 32 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":"compiler/rustc_codegen_llvm/src/callee.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"16185d5736d1ec363a32ef3a3186fc6cca4c8ea1415cfbfe48494f1019f3233f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 161 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":"compiler/rustc_codegen_llvm/src/common.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ae3d3ab2cd2917043167fb968c97b2670370432cd730aeb7bdda1280475a947"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 197 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":"compiler/rustc_codegen_llvm/src/consts.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"25f8530a04a120420604c21640675361d6acdff6558b672dc082ce119c351812"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 44 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":"compiler/rustc_codegen_llvm/src/declare.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa1a2317efca46a1ccb839865b442dfdeaeb9a1e57e1ae1c0397b3816aa63639"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\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: \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":"compiler/rustc_codegen_llvm/src/declare.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"04e7b35c3b61098bb00cc291156966b34de107685c0805bde17643abcce8d58b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 95 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":"compiler/rustc_codegen_llvm/src/declare.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"44175338ae5c8fd8d42da180f23b2bfeedcdd9b8ed00863e048a6b873ec2fcad"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 111 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":"compiler/rustc_codegen_llvm/src/declare.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d2f3a3a4e4056b95c89bd71dfed6e8f7268aeabe6d25435304dae6daa424c49"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 171 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":"compiler/rustc_codegen_llvm/src/declare.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e13be204a978cd62557ef4f56c9101849ea72f0dead142aea2e08aefbc1aaa3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 256 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":"compiler/rustc_codegen_llvm/src/declare.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"852bf67881d64c1bbff03eb89fad806d5a3148c570ed83a587c414deaa101f47"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 878 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":"compiler/rustc_codegen_llvm/src/intrinsic.rs"},"region":{"startLine":878}}}],"partialFingerprints":{"codehealthFindingId/v1":"c17c8aee3a1d10669fb65fcc83211784a0009e19c02206578fb0bf6ec3dc6f74"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 951 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":"compiler/rustc_codegen_llvm/src/intrinsic.rs"},"region":{"startLine":951}}}],"partialFingerprints":{"codehealthFindingId/v1":"b184e7c5f2af237eeb1b0b1082b232129d411ea30203c99fbef6cc09fbd0fca2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 96 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":"compiler/rustc_codegen_llvm/src/mono_item.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a2ebe512a42f257e9b648807601c60dceaef9e4e65f598d90bc33c4652fd57f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 142 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":"compiler/rustc_codegen_llvm/src/mono_item.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"2049fdad91348ecec630e31cbe84e5ed44d6587be8d6e7a7d1acf948b7bd7f6d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 174 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":"compiler/rustc_codegen_llvm/src/mono_item.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"142029daaa092f2d1fe2d846096eac11d47a4f45cb01581543ca6496b4b9ab0b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 115 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":"compiler/rustc_codegen_llvm/src/type_of.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"161fcb551120fcc25aa9669549652234f41b162838a62b43e5fa8982f74f050c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 129 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":"compiler/rustc_codegen_llvm/src/type_of.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c73e5f9c7e50defcf61694dcc0e26727a065538dce4a619f0d1eec08b012bc9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 144 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":"compiler/rustc_codegen_llvm/src/type_of.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"790ffb42586270342668d75d95bd912920a2f1f933ca3d3802383c9357e03750"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 166 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":"compiler/rustc_codegen_llvm/src/type_of.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c65a0a8799e6a6c1b0a50f21000c77bd94c460405462a7025bf08fc5afff957"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 173 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":"compiler/rustc_codegen_llvm/src/type_of.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"29f391818df276be2691b89aef9af9a3bc9e8b4d6670aefa8b6788446847017e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 247 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":"compiler/rustc_codegen_llvm/src/type_of.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0dba827eaec3dcd4e213116024f6f88c7d6c6079b99b448490bdf714bb5518e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 265 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":"compiler/rustc_codegen_llvm/src/type_of.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"828652dfa95b43517e7366585257d7f66df12f5a2634d3fcee5e23f6f168d335"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 460 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":"compiler/rustc_codegen_llvm/src/debuginfo/metadata.rs"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca17d4ca9e92af4e6bcfb26b72fb99ecf3919c6b66ac0bf9bf13a14ef0c3250c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 757 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":"compiler/rustc_codegen_llvm/src/debuginfo/metadata.rs"},"region":{"startLine":757}}}],"partialFingerprints":{"codehealthFindingId/v1":"b89171cab6a00247418616a21904584caa052a2bfd1fc0e67cd48c4741e1d197"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 892 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":"compiler/rustc_codegen_llvm/src/debuginfo/metadata.rs"},"region":{"startLine":892}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aed42571a8c87a4b7b60632fa0c4806fbc6fedefa69cdbed71ff6173c35a41e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 949 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":"compiler/rustc_codegen_llvm/src/debuginfo/metadata.rs"},"region":{"startLine":949}}}],"partialFingerprints":{"codehealthFindingId/v1":"a62dc6fbfa6d8841a1202ef163b8de621c71326daa28f2d9e608e5d283adbff8"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 67 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: \u0060trace!(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":"compiler/rustc_codegen_llvm/src/debuginfo/utils.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"884c8aeca52e604ae62442ed80ccbd0bc3d712b9143d83ccfdaa46f3fd658136"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 55 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":"compiler/rustc_codegen_llvm/src/coverageinfo/mapgen.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"25ec7ac354c9d98c58a3b16391f96de9b58098670a648a8b22406c0f9f9d6921"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 75 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":"compiler/rustc_codegen_llvm/src/coverageinfo/mod.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b5ede14ea7babcede31602f8aa8c33604d35b952327485a078e699a95008cbf"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 124 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":"compiler/rustc_codegen_llvm/src/coverageinfo/mod.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c5d7325c8fbb66767894ac6d47170162e742dee5eaf61a09af718d735677f7b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 295 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":"compiler/rustc_codegen_llvm/src/coverageinfo/mapgen/covfun.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a6163d659bd67927afeda172a3705c5bb88f07a294b85c015dc3ba27d81dd6d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 112 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":"compiler/rustc_codegen_llvm/src/back/lto.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"a55275d8eca79a7204c579b10b8cf8d310de19527147931637dc9a9a0c86ea7a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 232 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":"compiler/rustc_codegen_llvm/src/back/lto.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e52851abe9410b330f649a06e020ed53256c1716e5452fba5c5ca877be5a85e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 272 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":"compiler/rustc_codegen_llvm/src/back/lto.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecd3f4b91962cfaf8578dae802a05e61933bc1d8704515a310b41803435d6a13"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 278 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":"compiler/rustc_codegen_llvm/src/back/lto.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"58c02c91935484b0f0121ef6baefe5fdced60bc752ccbea332f86b822060c727"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 314 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":"compiler/rustc_codegen_llvm/src/back/lto.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f060127982ac90e0766c075b49d1706ae0404fd4f58c3bc758ed777fb9b6e92"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 406 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":"compiler/rustc_codegen_llvm/src/back/lto.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc286b2648fef4374918ffe511eacae84e97c3464171e25a9c400cbf7f4fe1ae"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 435 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":"compiler/rustc_codegen_llvm/src/back/lto.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"4715c69a6813ede81d196a0a9e58ed141a94f1ba00a0aaa02a1d7ea5b280bd75"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 488 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":"compiler/rustc_codegen_llvm/src/back/lto.rs"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"54c59a6ae02270bbc8d805998f0307bf683fde2425d16e1e76d69f38c9922e3f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 489 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":"compiler/rustc_codegen_llvm/src/back/lto.rs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"320b3a7bcef55e6d751560b65caf74de97dd72a7a12267c0136ffc51620aefb2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 513 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":"compiler/rustc_codegen_llvm/src/back/lto.rs"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"64d82b7783df5c0ceddb66d3d061c00b57db89b95235265d1f7cb72f01dcaf51"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 518 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":"compiler/rustc_codegen_llvm/src/back/lto.rs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6c293f16e8a7570324a4c384232670731953a09594e454b0d152a40a64e5e9e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 791 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":"compiler/rustc_codegen_llvm/src/back/lto.rs"},"region":{"startLine":791}}}],"partialFingerprints":{"codehealthFindingId/v1":"758cfd1ac25b7fc628e8315c36985a83e0e0acbbd0b1602cfcd6787cf332be9c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 63 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":"compiler/rustc_codegen_llvm/src/back/write.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c82894d85c9a358fcf8b194916c1698acf73c8c02b5c30beaa84deb11d9608d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1140 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":"compiler/rustc_codegen_llvm/src/back/write.rs"},"region":{"startLine":1140}}}],"partialFingerprints":{"codehealthFindingId/v1":"001f192577fa272b05a4215810305f58d499c699550a52bd33662f1227adaf38"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1146 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":"compiler/rustc_codegen_llvm/src/back/write.rs"},"region":{"startLine":1146}}}],"partialFingerprints":{"codehealthFindingId/v1":"6224184be96fe0a2bb285268dc55a91a038f396f1dd5524af4b02934a0dda0c1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 694 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":"compiler/rustc_builtin_macros/src/autodiff.rs"},"region":{"startLine":694}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cb50adcee01b4fe977cecd12262913056f918aaf415b7e67cc2a1ed5041c1be"}},{"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":"compiler/rustc_builtin_macros/src/autodiff.rs"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6c1856e4d7294fc24e664cd17b74d399a37aad3c90a03db77bf7d88dc739d29"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 810 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: \u0060trace!(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":"compiler/rustc_builtin_macros/src/autodiff.rs"},"region":{"startLine":810}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4802a3593e0a185d3660af0a37e20704a14d8b57454e49479ee2dd58450b21b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 840 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: \u0060trace!(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":"compiler/rustc_builtin_macros/src/autodiff.rs"},"region":{"startLine":840}}}],"partialFingerprints":{"codehealthFindingId/v1":"78ba4d47cfcc3dd854f228d4dae0b42cf991370aa7e330f3be96f0e547ff9935"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 429 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":"compiler/rustc_borrowck/src/borrow_set.rs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"55ab1197b3c5181a21ce7900521202501d64fd0a9d63c3912e49498387888dd1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 444 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":"compiler/rustc_borrowck/src/borrow_set.rs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0fe31e328d69a7375fdccd240c8057909cf4e0106b93667063db16ac3def567"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 204 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":"compiler/rustc_borrowck/src/dataflow.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"d47083e77fb2682560ebe0fe911b51d168b1b0447776811e7ee524ba0547f1b0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 233 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":"compiler/rustc_borrowck/src/dataflow.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9da0841f6d0e7669c2386dac8f0fa66485576e2f31eeb3d1dce1737dfdfe7b5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 311 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":"compiler/rustc_borrowck/src/dataflow.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"e46400c11629d59c356da73c8902b7841360ea0c119e0f435bf721b7a4038ee7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 334 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":"compiler/rustc_borrowck/src/dataflow.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d70e543f128086dc75eaee71acea4e950ec470283ca6a6eab91d77b64128c7c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 443 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":"compiler/rustc_borrowck/src/dataflow.rs"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bcc7c0739769f05dfa0908c3ff387cb3b3a0da21e48d740bae4c2159685c875"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 156 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: \u0060trace!(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":"compiler/rustc_borrowck/src/handle_placeholders.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bb9a6b410ad5a5e0d132d785c0a4c487bed1f0c21c22927242ee194c62af43b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 200 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":"compiler/rustc_borrowck/src/handle_placeholders.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"c025fae17ce6477a5ae840b39adb626ef10ed15bfbde7fd215017a7885bf6b0d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 340 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":"compiler/rustc_borrowck/src/handle_placeholders.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"41963d4094adfcc4192c8d2c0b12279ae07d1f4f6447481cb5f7a08be9e7290f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 359 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":"compiler/rustc_borrowck/src/handle_placeholders.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"69b3fc2aea828b59253d3636b9765ed44329031205ad189fd7198b0cd7d3fe61"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 126 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":"compiler/rustc_borrowck/src/lib.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a8864fd9fe9dd204cd4131c40262cc41d03d6c4a02e3f020407a867e034c965"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 573 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":"compiler/rustc_borrowck/src/lib.rs"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"f69b9860632f58aca7eee4fc87128b24a0296f63290cad0e6f5ce4e8d8e5e5fd"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 600 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":"compiler/rustc_borrowck/src/lib.rs"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fcff60d5910ea742a66e3a7ee6f19fc58f630b42cd00dd1e971a4896e7f3b6d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 687 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":"compiler/rustc_borrowck/src/lib.rs"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e126a23f8b7cc1bcdd4d25ce48c14508f47e1b174385f475e047d2f015f9be1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 709 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":"compiler/rustc_borrowck/src/lib.rs"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"311eb78fa6f4b99491b36019789f6d59795a6d6841ff4297f40bcf6f6a2a0fdd"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 814 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":"compiler/rustc_borrowck/src/lib.rs"},"region":{"startLine":814}}}],"partialFingerprints":{"codehealthFindingId/v1":"08a34da09dc876dc5c1be62fb5748eae9cbedd0ebac04b8f60277adcdc46f589"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 888 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":"compiler/rustc_borrowck/src/lib.rs"},"region":{"startLine":888}}}],"partialFingerprints":{"codehealthFindingId/v1":"90fb26797e35c70e45c1396fbdd20bdc1eee8d06263b0f3f44ad38962d5feff9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 898 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":"compiler/rustc_borrowck/src/lib.rs"},"region":{"startLine":898}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c77d764861323e9ad571029f4e55f204b713d9e0816764af4052875645d1bbb"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1202 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":"compiler/rustc_borrowck/src/lib.rs"},"region":{"startLine":1202}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce2f1cd237f6e1f6e777ef29709e7406054d26e09d082aff077684a2ddd76061"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1216 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":"compiler/rustc_borrowck/src/lib.rs"},"region":{"startLine":1216}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a63922918a148eb42f0650f4be2ef9b6daac19a123e7121c5b40c08446bc481"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1244 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":"compiler/rustc_borrowck/src/lib.rs"},"region":{"startLine":1244}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7c24d49533659170c544ddab57ed7ba49608fc335209af65344dfeaeffa4b38"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1296 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":"compiler/rustc_borrowck/src/lib.rs"},"region":{"startLine":1296}}}],"partialFingerprints":{"codehealthFindingId/v1":"b08120e56d06f3f0244c3f9e85745be977e82b3c3fb0d48d25586fa936a1185e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1350 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":"compiler/rustc_borrowck/src/lib.rs"},"region":{"startLine":1350}}}],"partialFingerprints":{"codehealthFindingId/v1":"861dfda380d90c050465fe663708d5dbca6685fb1365d69a29710312c33d76f3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1358 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":"compiler/rustc_borrowck/src/lib.rs"},"region":{"startLine":1358}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e12fe42cee0f5447ff3eaaccd39d0b4be75b4a1d3bacc6a05a9646882d66b5d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1626 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":"compiler/rustc_borrowck/src/lib.rs"},"region":{"startLine":1626}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d6329e86d6164eb8465c2b042364512e74f324010b2ec7d7f39067a2acab01c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1731 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":"compiler/rustc_borrowck/src/lib.rs"},"region":{"startLine":1731}}}],"partialFingerprints":{"codehealthFindingId/v1":"a80794a22a55d46554cbc9407fc8d38a77d3bec2616d7af435b43aac8ac98616"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1845 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":"compiler/rustc_borrowck/src/lib.rs"},"region":{"startLine":1845}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5eb1406b908905bdd5f67b6b5f78d75d20f96480e5fb4f349a9064f7ad5f012"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1861 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":"compiler/rustc_borrowck/src/lib.rs"},"region":{"startLine":1861}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d8ada946893720feb7163966529eb0aa8d76389feb7e47df93db58506d61b67"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 2082 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":"compiler/rustc_borrowck/src/lib.rs"},"region":{"startLine":2082}}}],"partialFingerprints":{"codehealthFindingId/v1":"27f7cfaf08aa19d9155de4ac953f86757d7e8acd5cc2f25735b09e4ef5d3bf46"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 2195 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":"compiler/rustc_borrowck/src/lib.rs"},"region":{"startLine":2195}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1849c188e133f17f1d51bc5563ae5cd638f84afff56df05429cccb0b09cc168"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 2249 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":"compiler/rustc_borrowck/src/lib.rs"},"region":{"startLine":2249}}}],"partialFingerprints":{"codehealthFindingId/v1":"e887e5336930eaa473f51debcd17bb6b655ae06e6df5e13fe2c812d0e905ddbd"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 2368 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":"compiler/rustc_borrowck/src/lib.rs"},"region":{"startLine":2368}}}],"partialFingerprints":{"codehealthFindingId/v1":"f259bcc88221ae64916937fa2772afd601b31a2f18711a8c9728e49eb5889b8c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 2375 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":"compiler/rustc_borrowck/src/lib.rs"},"region":{"startLine":2375}}}],"partialFingerprints":{"codehealthFindingId/v1":"97d7382fecf4c0dff0bd0c18719789ffacba6fc743e682d1b159006ecc81c690"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 2420 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":"compiler/rustc_borrowck/src/lib.rs"},"region":{"startLine":2420}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bec354780542b4a47dec43f834b3ff91803e936813cc6bbdef88ec52792b60e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 2582 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":"compiler/rustc_borrowck/src/lib.rs"},"region":{"startLine":2582}}}],"partialFingerprints":{"codehealthFindingId/v1":"78c167d1a7c5865fbb3080d854c13d70c18933a3689c06419e774c4529ab5fa0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 2680 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":"compiler/rustc_borrowck/src/lib.rs"},"region":{"startLine":2680}}}],"partialFingerprints":{"codehealthFindingId/v1":"a692718cdd3f5d572209d2a43a2c216b1cd1d3c7b4b0df33473a85ac2d4f8f12"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 178 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":"compiler/rustc_borrowck/src/nll.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"87440b0dc9a68c86b5e326705d3358b7998e99ee35c7782dcf2a93f37cc1cf11"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 48 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":"compiler/rustc_borrowck/src/path_utils.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"41a62a04473bf079d1d7578e5de41a83ae3568059c6aea2860ad0bf6f7069eb3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 65 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":"compiler/rustc_borrowck/src/path_utils.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"96a3dea23b026b4c7df4d2a9c97f388fadb0baa21532b40560b479c16017dcb5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 34 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":"compiler/rustc_borrowck/src/place_ext.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"11463482e260cc465bc1f959268002469f2dfb119287fedbe05739fe5482e7eb"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 119 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":"compiler/rustc_borrowck/src/renumber.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"75e6fa0e95c2d3dbd347345f81fa75369f24229da59b5073d571500679f7f650"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 703 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":"compiler/rustc_borrowck/src/universal_regions.rs"},"region":{"startLine":703}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c8dcd8108ba43748c40821530f887bfb979e64a3b4f6b63a8d631258438524a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 706 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":"compiler/rustc_borrowck/src/universal_regions.rs"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbff03b4c035126252f19af7e0bf5b774c44bc26baf9c153e51f5ba977963854"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 723 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":"compiler/rustc_borrowck/src/universal_regions.rs"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"81148ebba72a36532c930ca7169b476ad7beca43aa31eba78efd0c42eddc3f8d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 726 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":"compiler/rustc_borrowck/src/universal_regions.rs"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cd247a234084a7edfad3ef691c1cfd8623f43ced4a3bef75e83f6d8d8072e30"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 805 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":"compiler/rustc_borrowck/src/universal_regions.rs"},"region":{"startLine":805}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3870def31c5e62bbaf90b10d081f9ee7c7272a7c5a6c72aa116ab3e15bc5cd1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 806 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":"compiler/rustc_borrowck/src/universal_regions.rs"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"86a1238b2e672aebdd641210defc6405802bd16b07cd72516f25b31fe191bf8f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 807 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":"compiler/rustc_borrowck/src/universal_regions.rs"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7f0f1cc7a3f9827fd6f1aa4ba6dfd61a8268711bcabd6e90cd4ab737b67cdf3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 945 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":"compiler/rustc_borrowck/src/universal_regions.rs"},"region":{"startLine":945}}}],"partialFingerprints":{"codehealthFindingId/v1":"4155f6646edf3f17d8ae2322941c97c842e61abadc7b1bcb66f4beda9825d845"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 42 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":"compiler/rustc_borrowck/src/used_muts.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1bfc6e02698deac5525117bd3bca07a3d7ecfac7e179890eff88baa699c9164"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 69 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":"compiler/rustc_borrowck/src/used_muts.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"3753283ef54014df8a07f0462e64cf35cc0d03eb8265426d312122ec36fa3713"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 82 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":"compiler/rustc_borrowck/src/used_muts.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"16a9361e85f6d062d169e59d057306aded354d088ae2afb25c0123548cf54145"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 99 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":"compiler/rustc_borrowck/src/used_muts.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"298f50fce6495ff0234610f8e71ff8a1b9e8bbbfccda5d3b2126338987ad10e2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 132 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":"compiler/rustc_borrowck/src/type_check/constraint_conversion.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"510fa6006ed177f13862e53e5cff2eaaf730669506f5b5fbef38feb7be629435"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 241 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":"compiler/rustc_borrowck/src/type_check/constraint_conversion.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"d207a06374f431e5cf2caa15dbc0eae2b61e06e5d02a0729914b78a45ab5b168"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 92 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":"compiler/rustc_borrowck/src/type_check/free_region_relations.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"a54540e699b830a07d71a522a4819c62ce64074791dbcd2cb715363857103a27"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 104 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":"compiler/rustc_borrowck/src/type_check/free_region_relations.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"1954e1388ffed6d41dbbbb573b938a505e8bb952334fb5457f36b1e7ab0a3930"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 135 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":"compiler/rustc_borrowck/src/type_check/free_region_relations.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"8627f46338ef1cac81f69b1b8891315ccdd88b13cec0e70364c4d243fea7446a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 181 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":"compiler/rustc_borrowck/src/type_check/free_region_relations.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"73f7dff52e44b70c5a62c6ff04a938733cb8a58cae5d4f9772c9ae902a0a095b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 205 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":"compiler/rustc_borrowck/src/type_check/free_region_relations.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e25d5f7d16ea20227de402b79ad034f46a28952d22145b37c7d9c6c24363e24"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 239 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":"compiler/rustc_borrowck/src/type_check/free_region_relations.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cfb733fa49e0350a490e6296b308452bfd4985a021b8772b53634747628d549"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 365 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":"compiler/rustc_borrowck/src/type_check/free_region_relations.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5528e31b7eaba0ca1a28c1b61cd0112e42908d326872ea00a052b41ef1b880e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 553 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":"compiler/rustc_borrowck/src/type_check/free_region_relations.rs"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4dafa9081b5f1dfd2cdf2c3d594c50bfe8a5b5d3cd564c00a3a7552d1613d67"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 571 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":"compiler/rustc_borrowck/src/type_check/free_region_relations.rs"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c229af108c766d6ff0562d3858812177cf205aeb92f6edcdd5e2774cf2e0de4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 409 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":"compiler/rustc_borrowck/src/type_check/mod.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f1d9d33c3881de8eca56cfac828019d9eada42df5413445c839f341ee560693"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 641 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":"compiler/rustc_borrowck/src/type_check/mod.rs"},"region":{"startLine":641}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecca271db60cc4cff5d877624a05cab740f1c4b4810a0a781a6c7a8a298e948b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 650 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":"compiler/rustc_borrowck/src/type_check/mod.rs"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb78c4340f492ea0167bd60a0ed80d7bb89c1fb71cc7b5b43e6e98b14b707af4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 654 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":"compiler/rustc_borrowck/src/type_check/mod.rs"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"232639dc4ae3abfe8a659f6e4bf2945e2bd688a7a146b60690383fde56f33996"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 742 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":"compiler/rustc_borrowck/src/type_check/mod.rs"},"region":{"startLine":742}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c749d3a712105ebcd974865a7615fd503f4b24398d9c5d06f3eccc0a1d2a8d5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 777 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":"compiler/rustc_borrowck/src/type_check/mod.rs"},"region":{"startLine":777}}}],"partialFingerprints":{"codehealthFindingId/v1":"138667990680cc2dfcbed0449db4226b05256ba28537dd8f8699abf5f8669f6d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 2390 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":"compiler/rustc_borrowck/src/type_check/mod.rs"},"region":{"startLine":2390}}}],"partialFingerprints":{"codehealthFindingId/v1":"4684fb6174cf5675959bb5f4767b67c721e57cd4990948988abedb2070c20eef"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 2407 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":"compiler/rustc_borrowck/src/type_check/mod.rs"},"region":{"startLine":2407}}}],"partialFingerprints":{"codehealthFindingId/v1":"136654e3c88f00f6c561859c243d899b93ddd97caed796b440c1a84f31d84a77"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 2413 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":"compiler/rustc_borrowck/src/type_check/mod.rs"},"region":{"startLine":2413}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d9815c3882d665d74260b1639cdc69f0a1ac8b22fa06f4f5ab66bebb1acb88e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 2494 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":"compiler/rustc_borrowck/src/type_check/mod.rs"},"region":{"startLine":2494}}}],"partialFingerprints":{"codehealthFindingId/v1":"a866feb3ad36590337674ebba550acb47916e64c035ca2068b11b6a6a5a15465"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 2661 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":"compiler/rustc_borrowck/src/type_check/mod.rs"},"region":{"startLine":2661}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7af0914373cf6a47c28aa68293fcebecaaedc71d5f4503de3e4e78d6817dd2d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 149 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":"compiler/rustc_borrowck/src/type_check/liveness/mod.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f4faab3e5993d8fa14dd00dda5ca7ab849d20eab9ed96d4f2efbe9f4144325d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 150 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":"compiler/rustc_borrowck/src/type_check/liveness/mod.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"ded40526db2f76182aeb28c76e755f7fa8525f98ef4e44c8e7d6eadcfc6b14e8"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 151 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":"compiler/rustc_borrowck/src/type_check/liveness/mod.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"b80b9a314f55fab13427b6e0d2ea0282412941377f034ba3a19e4123378531ea"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 262 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":"compiler/rustc_borrowck/src/type_check/liveness/mod.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7d11fea2f13d927636e06c5fb164d110a9ebf5b41f8959bbc5f27636b8dff89"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 287 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":"compiler/rustc_borrowck/src/type_check/liveness/mod.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc98bff04a77de66d642a91a37424808de34e88f39b60c50a23a7c18dbf84cb6"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 469 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":"compiler/rustc_borrowck/src/type_check/liveness/trace.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"9de22e5043dddc164759e58fe30bb78c7464582f3814c7dd5f919063c336ee80"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 481 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":"compiler/rustc_borrowck/src/type_check/liveness/trace.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"534540cb38cfd61ca8afed308a196e1e56bc118bfd938c24976ed2df2b3c0b24"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 535 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":"compiler/rustc_borrowck/src/type_check/liveness/trace.rs"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2aaefc84591cb9b68bdc791c64c221d7fcd03b3526088d64904856b5e77553d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 538 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":"compiler/rustc_borrowck/src/type_check/liveness/trace.rs"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"12962d66cc02e47ce37d22cc31c46480eb9b6be927a04208ace4306b88088f5c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 555 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":"compiler/rustc_borrowck/src/type_check/liveness/trace.rs"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2cd9768743dddb937846fdfdea21e1547c5a93758e4912188a3087daf1f67da"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 577 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":"compiler/rustc_borrowck/src/type_check/liveness/trace.rs"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8baffc329ad91c5977713c0e48fc044224d69d55ceb5f6043f86fd865e88add"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 595 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":"compiler/rustc_borrowck/src/type_check/liveness/trace.rs"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef048c6cff14f2343f08f43d8efcb46f125b7da8e5af2f396d266a91d8ae88e3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 606 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":"compiler/rustc_borrowck/src/type_check/liveness/trace.rs"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ce45c201dfbc76fcfde4e02941497bd170ed8927668a96591732af65844be3f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 618 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":"compiler/rustc_borrowck/src/type_check/liveness/trace.rs"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4eb0ae83bb083088d168a42aabf22e8f20f6c91d4100f0712273ffd354a9f4b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 649 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":"compiler/rustc_borrowck/src/type_check/liveness/trace.rs"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1ceff5a61ebf64b62abfe46f5f28ab484741699cdb3ee6b51f8ab41777cdbf3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 654 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":"compiler/rustc_borrowck/src/type_check/liveness/trace.rs"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"85574f250906866f3465b04e6b41596005bda79ff1a79ce80193357b9c704698"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 211 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":"compiler/rustc_borrowck/src/region_infer/mod.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"ade0e5cf57f13f1efe2ecef2ba6e9521c051ed182e94a473a963d2e0b9665658"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 232 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":"compiler/rustc_borrowck/src/region_infer/mod.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a00e2aa65d5d5cfc8ad60a2bf46ef1ce084b2a419d29a146139a23cda6479bd"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 260 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":"compiler/rustc_borrowck/src/region_infer/mod.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ea5b006d28ba453f4cbd90489f330be3f43984c340351269e8e266596e05ad5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 129 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":"compiler/rustc_borrowck/src/region_infer/region_context.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ac771401acd5ab588998eefa66301cdf1ec3d29670f8d78998f5971b61b7f5b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 130 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":"compiler/rustc_borrowck/src/region_infer/region_context.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"db45ed485b789dea275d58f3f3ceb84175b7c0524e7fe0410c7ab9ada81e693e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 131 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":"compiler/rustc_borrowck/src/region_infer/region_context.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"b77f3ac6022f52a60e02f65c15ba652abeed0090be3c473b95b674e2a33ad8ee"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 132 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":"compiler/rustc_borrowck/src/region_infer/region_context.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"65a2f24ece41e9cb51f99bc98352c63e375159b394cf20801103e0f1ce7d1186"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 348 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":"compiler/rustc_borrowck/src/region_infer/region_context.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"c673b459ff84b2a8503873c9e116814e985707b6c50f670fc76c98ba18b97af0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 465 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":"compiler/rustc_borrowck/src/region_infer/region_context.rs"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"bba382aa72812bb98decca08f15bb9386472fe2dd91ee118d44b9bff20e8db42"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 542 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":"compiler/rustc_borrowck/src/region_infer/region_context.rs"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"738a42c341b6e5451435cdb05d31caade8a7730f7a75072d5045614b39f15584"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 546 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":"compiler/rustc_borrowck/src/region_infer/region_context.rs"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"70689f1d8abb9217deec08b0f640890cda8c1e7d3ab198f0d15d5f7a57574f6c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 625 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":"compiler/rustc_borrowck/src/region_infer/region_context.rs"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"27ccc547516b91db2e28ee7ccd1e8ae1cc43702627d41acf9388879fe61efe28"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 759 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":"compiler/rustc_borrowck/src/region_infer/region_context.rs"},"region":{"startLine":759}}}],"partialFingerprints":{"codehealthFindingId/v1":"89da70ab23f530c5370f77af4adb3a4af031b3606aa4eb0a0514a140021b2133"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 865 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":"compiler/rustc_borrowck/src/region_infer/region_context.rs"},"region":{"startLine":865}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbee0a6813a81e7014911c7b3bbc840f7dbb47efd563ba7d704f4cbb1abb198a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 918 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":"compiler/rustc_borrowck/src/region_infer/region_context.rs"},"region":{"startLine":918}}}],"partialFingerprints":{"codehealthFindingId/v1":"2354979afe884faae76dafc3d8d089bdf320b1c8221be2515d039f9fea3a0f4e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 977 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":"compiler/rustc_borrowck/src/region_infer/region_context.rs"},"region":{"startLine":977}}}],"partialFingerprints":{"codehealthFindingId/v1":"92adb2967821dd942cdcbdc9c1521e871ea455ea3db0b6bc7e7abe8017acd4bc"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1029 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":"compiler/rustc_borrowck/src/region_infer/region_context.rs"},"region":{"startLine":1029}}}],"partialFingerprints":{"codehealthFindingId/v1":"b10883009fea089aab5900a9abd7bef437a052bf1a0c4a597c142b6b9d40474a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1042 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":"compiler/rustc_borrowck/src/region_infer/region_context.rs"},"region":{"startLine":1042}}}],"partialFingerprints":{"codehealthFindingId/v1":"4644420f45ecf188bb569980987b69b917b4a3c7c5a61c8c89c1044b4a36f035"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1062 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":"compiler/rustc_borrowck/src/region_infer/region_context.rs"},"region":{"startLine":1062}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fde4473e3411e62b8559267aa482424b6a2ab3d894932439fb7bf0492cf0de0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1126 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":"compiler/rustc_borrowck/src/region_infer/region_context.rs"},"region":{"startLine":1126}}}],"partialFingerprints":{"codehealthFindingId/v1":"b251df5d732cd9e3c588a38950029152151b09e3fda8a4955096c9c69f67c299"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1145 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":"compiler/rustc_borrowck/src/region_infer/region_context.rs"},"region":{"startLine":1145}}}],"partialFingerprints":{"codehealthFindingId/v1":"f904d2f8e8b5099864dd5652f85e4c48854456a81e706e9b654bc5c17762468e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1248 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":"compiler/rustc_borrowck/src/region_infer/region_context.rs"},"region":{"startLine":1248}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a5c81f89c24e8f589092d6f3bd46f6f39d11e5642fb01975c8fc6d5ce730381"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1253 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":"compiler/rustc_borrowck/src/region_infer/region_context.rs"},"region":{"startLine":1253}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0a1a81cda709824b52d3e06e9ba1f644e817b3a8f94522e6add6099cc7d8893"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1263 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":"compiler/rustc_borrowck/src/region_infer/region_context.rs"},"region":{"startLine":1263}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad60771cfcef960996441e702e1cd1ecaed6ad380e3ee54663942fa1790bbdb4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1277 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":"compiler/rustc_borrowck/src/region_infer/region_context.rs"},"region":{"startLine":1277}}}],"partialFingerprints":{"codehealthFindingId/v1":"da8aab7e5742cf74afc0af52dd8b938336f7455dab3f36675d01ecc0be7940cd"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1391 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":"compiler/rustc_borrowck/src/region_infer/region_context.rs"},"region":{"startLine":1391}}}],"partialFingerprints":{"codehealthFindingId/v1":"a54edf1201f72f71c98424562b1af1fdcbc974ceca5f3787cb29e99d1722b415"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1426 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":"compiler/rustc_borrowck/src/region_infer/region_context.rs"},"region":{"startLine":1426}}}],"partialFingerprints":{"codehealthFindingId/v1":"e611d3b303ca9edefdc09cfcf6c355797763c9c2164223e33ec1e8937cc2032e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1575 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":"compiler/rustc_borrowck/src/region_infer/region_context.rs"},"region":{"startLine":1575}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c47e7877f41df3263ab154a0ed25a4e28e9ed84b1e7a7c4987826722e0f8a07"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1596 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":"compiler/rustc_borrowck/src/region_infer/region_context.rs"},"region":{"startLine":1596}}}],"partialFingerprints":{"codehealthFindingId/v1":"7338ef22f921921a7f30df6e5a5f859f0132e5e49081a9a07ec83f548d0fc2bb"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1632 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":"compiler/rustc_borrowck/src/region_infer/region_context.rs"},"region":{"startLine":1632}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c16c027715e0fa4955d617d609d0cc463c5a10663146a4dd3e77f2eb0b4ef4e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1663 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":"compiler/rustc_borrowck/src/region_infer/region_context.rs"},"region":{"startLine":1663}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e65b01a8723068a682ad0a76b0ad90a4902fe638f560c67ee16a127a8582f77"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1666 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":"compiler/rustc_borrowck/src/region_infer/region_context.rs"},"region":{"startLine":1666}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd830576fdd6ff865e9519a1a5cea6ff5da2e67a20741949ccc63ff3fc0ba097"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 126 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":"compiler/rustc_borrowck/src/region_infer/values.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"e57196bee17488e673f720e7653cbd67670e3bb4a48c31ec4f136aa090a81664"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 144 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":"compiler/rustc_borrowck/src/region_infer/values.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"165309239e35d8b0603bf0875feecd1241b741cd4b00814bdf3e1549c0a1e6df"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 277 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":"compiler/rustc_borrowck/src/region_infer/opaque_types/mod.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0f8db6c699d511b5b476de5a6633f9c88c3ac163d356b3b6fdacee733f6a1ed"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 326 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":"compiler/rustc_borrowck/src/region_infer/opaque_types/mod.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"08b621f5ceeae1629b4341ae95d38ea84f80539059807aebdbff77f170187be1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 24 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":"compiler/rustc_borrowck/src/polonius/legacy/accesses.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"5def7d047890233b0e612d1307543aca758022c31df4e4ca5c90102780ec8ab7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 76 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":"compiler/rustc_borrowck/src/polonius/legacy/accesses.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"0afc27c815d109f136552b790691a2f027cd9dacb5ddcb385425c24fa55a4d8d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 358 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":"compiler/rustc_borrowck/src/polonius/legacy/loan_invalidations.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2a9776b5dcbddeadb45a4f7add8f845aa99fa1453c39eeb9221184def52614b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 102 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":"compiler/rustc_borrowck/src/polonius/legacy/loan_kills.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e8559c5b7edb7f86dd569884d3d8cc0a2b287be32aacbf909add961d1d2974e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 112 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":"compiler/rustc_borrowck/src/polonius/legacy/loan_kills.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"79495ab7e87731579c77c94480d6ec9c473983d2090641b4bfb277d2e5e2e294"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 46 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":"compiler/rustc_borrowck/src/polonius/legacy/location.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"0001a1ecf5ea28edc08c5f53188bf05087e2c9a7db881eac94451ee9d8a40773"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 47 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":"compiler/rustc_borrowck/src/polonius/legacy/location.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"92f3b52a8774d9661dc89f47b10d8985da8d42589d5b9adda7dabe316906e716"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 156 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":"compiler/rustc_borrowck/src/polonius/legacy/mod.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcedf980091e2b4a177789ffd8d237d1ebe3e6920c2cb44bcebc732fb6d31b9c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 172 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":"compiler/rustc_borrowck/src/polonius/legacy/mod.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"85cc53e0254f3bffa20ece18a926e6136657356f1c37623235136b9502675799"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 191 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":"compiler/rustc_borrowck/src/polonius/legacy/mod.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"eea62f51eff43424499ff43c67befde3092aa687a55ab141cbf726328c4d2366"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 446 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":"compiler/rustc_borrowck/src/diagnostics/bound_region_errors.rs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca21cb098c17f7c151ee7ece9de712ffdef70c2eb36d7863abe7be0e9afe87b8"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 81 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":"compiler/rustc_borrowck/src/diagnostics/conflict_errors.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"a098afe98c3e6dea2dc6c590b7084770966566b5e1505bd68541eee235b9dfde"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 92 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":"compiler/rustc_borrowck/src/diagnostics/conflict_errors.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"e15a579f1044974dbf71c7890876fde8809f3c2f35504404a6ac6792b142886a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 103 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":"compiler/rustc_borrowck/src/diagnostics/conflict_errors.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f52f1a89c0dd93e6b885baf1df4a60f6d96061de2c0383cf359c569f94b4598"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 123 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":"compiler/rustc_borrowck/src/diagnostics/conflict_errors.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c951ae3cf82b8cf6801e98558c64f60b8a9e1d6148d3e86491703b79d116ace"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1016 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":"compiler/rustc_borrowck/src/diagnostics/conflict_errors.rs"},"region":{"startLine":1016}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc76e088994f6c1419b732eec8c69183b7a77d34a4e3d5fdf48a467d20e1da68"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1690 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":"compiler/rustc_borrowck/src/diagnostics/conflict_errors.rs"},"region":{"startLine":1690}}}],"partialFingerprints":{"codehealthFindingId/v1":"f26166ff3c7d02fb6ff9d311e8f8d3151203e5bddfa64128032dd2f0e61ffc94"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 2259 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":"compiler/rustc_borrowck/src/diagnostics/conflict_errors.rs"},"region":{"startLine":2259}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f2659ed67695c91dbfa8745256edad0ef05ac877992686ddb5173931221277d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 2263 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":"compiler/rustc_borrowck/src/diagnostics/conflict_errors.rs"},"region":{"startLine":2263}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a1b26266bd2e88c610ecd4b5f18105b82f65ce3e6d67d14e0c09345292e4e4d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 2273 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":"compiler/rustc_borrowck/src/diagnostics/conflict_errors.rs"},"region":{"startLine":2273}}}],"partialFingerprints":{"codehealthFindingId/v1":"59bd5568da81e4ccc1759b4d38bf4545beacf6cb39ee96639aa376c8297717ec"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 2277 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":"compiler/rustc_borrowck/src/diagnostics/conflict_errors.rs"},"region":{"startLine":2277}}}],"partialFingerprints":{"codehealthFindingId/v1":"573720c6ea412404e1d3dc454f1f093c8a4337b01c8e916ca3e9aead715c6774"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 2280 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":"compiler/rustc_borrowck/src/diagnostics/conflict_errors.rs"},"region":{"startLine":2280}}}],"partialFingerprints":{"codehealthFindingId/v1":"2248359eb47207ea210d99bc1282cc9d8a9c7ef11074477c733c5c48735ba25c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 2290 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":"compiler/rustc_borrowck/src/diagnostics/conflict_errors.rs"},"region":{"startLine":2290}}}],"partialFingerprints":{"codehealthFindingId/v1":"f60362196699d1c0081477d78e23df6095a470bef68e453a95560ae4cca9c693"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 2300 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":"compiler/rustc_borrowck/src/diagnostics/conflict_errors.rs"},"region":{"startLine":2300}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc96b3dacbe14cdb497af274872a8b6a97246652bddf791168936a2f1a25004f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 3069 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":"compiler/rustc_borrowck/src/diagnostics/conflict_errors.rs"},"region":{"startLine":3069}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ab9c2ef5a9944f66b378898375356dba7eff2f6d7947e679f0d2fef029ae772"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 3333 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":"compiler/rustc_borrowck/src/diagnostics/conflict_errors.rs"},"region":{"startLine":3333}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d30b3a69d80d596f31bdddeddb356867db9429cda4d2e2b96b176a3eb9dcfa9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 3382 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":"compiler/rustc_borrowck/src/diagnostics/conflict_errors.rs"},"region":{"startLine":3382}}}],"partialFingerprints":{"codehealthFindingId/v1":"b510d29b0f38f5392188a1da62ea623ea6d5e32ee44ecbc6cff16da25000246e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 3892 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":"compiler/rustc_borrowck/src/diagnostics/conflict_errors.rs"},"region":{"startLine":3892}}}],"partialFingerprints":{"codehealthFindingId/v1":"d180a35e68b5f911b092c338194ff6b6639f89a7b9ee4680201c3e63472e8dad"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 3917 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":"compiler/rustc_borrowck/src/diagnostics/conflict_errors.rs"},"region":{"startLine":3917}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fcc8f9941f0ae2dab11a013543a9a26487dc1c4fc659590114a2f7602df9c4a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 3920 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":"compiler/rustc_borrowck/src/diagnostics/conflict_errors.rs"},"region":{"startLine":3920}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bc8a9120d3c6ec685654aedeab6a7273b5e593952b3a2be72b9fedacb85fa3d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 4366 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":"compiler/rustc_borrowck/src/diagnostics/conflict_errors.rs"},"region":{"startLine":4366}}}],"partialFingerprints":{"codehealthFindingId/v1":"1277f692ae4744c9eabaa32ad14b83cb206d234c6e033b60dbb2ee11a370fcd9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 4370 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":"compiler/rustc_borrowck/src/diagnostics/conflict_errors.rs"},"region":{"startLine":4370}}}],"partialFingerprints":{"codehealthFindingId/v1":"d97b610c3ceddcce12ec6dbfc6670c48d00feec3c41c8a0719fa0b3327de52c4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 4381 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":"compiler/rustc_borrowck/src/diagnostics/conflict_errors.rs"},"region":{"startLine":4381}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fe801e11903cd8cd8f5ce50bd9ab7c2167e181546492385a6070f1ef7bd230a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 4388 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":"compiler/rustc_borrowck/src/diagnostics/conflict_errors.rs"},"region":{"startLine":4388}}}],"partialFingerprints":{"codehealthFindingId/v1":"92b7d91d96bc0d7b9ed6bc60a119b2cda62e0dbc994ca5a77047625a1060402a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 4404 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":"compiler/rustc_borrowck/src/diagnostics/conflict_errors.rs"},"region":{"startLine":4404}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5e4cfa98b46321342e3615aecad5e94f7bb4a4f71a9cee7db4f54c7fd9ce1ed"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 4424 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":"compiler/rustc_borrowck/src/diagnostics/conflict_errors.rs"},"region":{"startLine":4424}}}],"partialFingerprints":{"codehealthFindingId/v1":"0df6f62a421b85d3f6595d0ad064ac309fa04effae735f5641b357df8d9acbe9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 4457 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":"compiler/rustc_borrowck/src/diagnostics/conflict_errors.rs"},"region":{"startLine":4457}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6645bcc5627288bca62aba47009a87095670fbba284f763536362adb7337c82"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 4467 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":"compiler/rustc_borrowck/src/diagnostics/conflict_errors.rs"},"region":{"startLine":4467}}}],"partialFingerprints":{"codehealthFindingId/v1":"40a3c2b8f9e7ab1ac0b1b11fee55be92da1834cc2ed1d1149af8fe8f228eb3ba"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 4481 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":"compiler/rustc_borrowck/src/diagnostics/conflict_errors.rs"},"region":{"startLine":4481}}}],"partialFingerprints":{"codehealthFindingId/v1":"5655912d0f08a4a619799cb8fad5fb72def446f50451f0e64ea774f429f42f13"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 4500 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":"compiler/rustc_borrowck/src/diagnostics/conflict_errors.rs"},"region":{"startLine":4500}}}],"partialFingerprints":{"codehealthFindingId/v1":"61dff146580cfab4e87de2989f19698c3a8e4629dfc8a17bce40a8e84588660e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 4508 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":"compiler/rustc_borrowck/src/diagnostics/conflict_errors.rs"},"region":{"startLine":4508}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7941bc613a6ba47ea0b6b90993844cd7ff363aea00ab41c5ee16567278d4153"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 4518 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":"compiler/rustc_borrowck/src/diagnostics/conflict_errors.rs"},"region":{"startLine":4518}}}],"partialFingerprints":{"codehealthFindingId/v1":"386d69dd26bb5d7f3ef87e129c81d6e9be1015dfa3f280e935f6ea87eee84516"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 4524 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":"compiler/rustc_borrowck/src/diagnostics/conflict_errors.rs"},"region":{"startLine":4524}}}],"partialFingerprints":{"codehealthFindingId/v1":"554ae922c0d1a52c5d906e92f7b33d375301fa84a608c4b562e99f606bf604d1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 4550 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":"compiler/rustc_borrowck/src/diagnostics/conflict_errors.rs"},"region":{"startLine":4550}}}],"partialFingerprints":{"codehealthFindingId/v1":"ada71d60c5f0e6e9023e893e90c5a045bc4bcb3262c2cf1d303f2e9704732a05"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 618 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":"compiler/rustc_borrowck/src/diagnostics/explain_borrow.rs"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7f438d623f7e3b8a3b66a24e84680194480ffa30acb2e5bc256765a84cbff03"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 826 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":"compiler/rustc_borrowck/src/diagnostics/explain_borrow.rs"},"region":{"startLine":826}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa9881598d0ad59f335fbf0fbd5c59503bd59ee840f277267772efe9f116826b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 837 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":"compiler/rustc_borrowck/src/diagnostics/explain_borrow.rs"},"region":{"startLine":837}}}],"partialFingerprints":{"codehealthFindingId/v1":"055b9a62fa14124163f44016c24ea67b5c1e812243bda259ccb31a8f0906f89e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 839 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":"compiler/rustc_borrowck/src/diagnostics/explain_borrow.rs"},"region":{"startLine":839}}}],"partialFingerprints":{"codehealthFindingId/v1":"67681850ecab5527d9285da2d92fcaaa405dc72c969c07727a49397c30dd000a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 845 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":"compiler/rustc_borrowck/src/diagnostics/explain_borrow.rs"},"region":{"startLine":845}}}],"partialFingerprints":{"codehealthFindingId/v1":"61831aff49272ebe0505d8cd8997c0ee2392510d744087dce1b77fad0b95adcd"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 879 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":"compiler/rustc_borrowck/src/diagnostics/explain_borrow.rs"},"region":{"startLine":879}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dc78ec6ee9a2e19295fb0b8bc828ab4b30d1d97c1216a9499a23637336e3ae2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 910 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":"compiler/rustc_borrowck/src/diagnostics/explain_borrow.rs"},"region":{"startLine":910}}}],"partialFingerprints":{"codehealthFindingId/v1":"713604891a0bef3f5adf718a614bd82e4ee4a67262e25887809c305e9bae408d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 916 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":"compiler/rustc_borrowck/src/diagnostics/explain_borrow.rs"},"region":{"startLine":916}}}],"partialFingerprints":{"codehealthFindingId/v1":"50a5f5a86ee18ce669e52414306e7cf1219a82726beeb1270f2d2efb36d17230"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 941 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":"compiler/rustc_borrowck/src/diagnostics/explain_borrow.rs"},"region":{"startLine":941}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4b461a311995240b9eec4c17eb42e9b9e78cf45a19af84a482f45096c6d6fc4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 228 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":"compiler/rustc_borrowck/src/diagnostics/mod.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"b04cbbe14ff11a86d19f773e730d4732a8d5439632b50b3126fc135c589a84f9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 231 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":"compiler/rustc_borrowck/src/diagnostics/mod.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3cc892022abd78e161d8ef8554ef8602928f17a3cbd638f5e61db1bf8a8352c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 233 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":"compiler/rustc_borrowck/src/diagnostics/mod.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbec7aff55657eb3c917ccf421247df47bcac44d496906cb6798bd00a9e9f697"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 247 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":"compiler/rustc_borrowck/src/diagnostics/mod.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd978f1b2436a1d94c65c875f9932cae49216963116392115b48ac7725ff6023"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 255 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":"compiler/rustc_borrowck/src/diagnostics/mod.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"b07580d1731567bec8a965c9d81d8e7a8669bb1d4a84f850e0d798d3b4140402"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 266 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":"compiler/rustc_borrowck/src/diagnostics/mod.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe0baa319e134f1eac26c635086f204b72a19c425c12337bf160b00d3c6bb861"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 547 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":"compiler/rustc_borrowck/src/diagnostics/mod.rs"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"d943ad6bbc9c95764512dccf4c7a1efb03592fece563316698872a6bb9c890c0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 551 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":"compiler/rustc_borrowck/src/diagnostics/mod.rs"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbd34b7edca736f1659b55fba9a0c2787d8f2a324d01c75357a32ffc5e8a7b21"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 558 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":"compiler/rustc_borrowck/src/diagnostics/mod.rs"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"b90499f87c091daa9774d415f61cd72d9ec149265e67ebfe70d0fc9c49496a94"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1022 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":"compiler/rustc_borrowck/src/diagnostics/mod.rs"},"region":{"startLine":1022}}}],"partialFingerprints":{"codehealthFindingId/v1":"94fcb9f78c97c3bdd057794bc790eeb3b21d2c3ffdceb87df2945ec7e7e4fb31"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1026 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":"compiler/rustc_borrowck/src/diagnostics/mod.rs"},"region":{"startLine":1026}}}],"partialFingerprints":{"codehealthFindingId/v1":"1592f59410069b41028e336f949ebbfc1d5caaaf1303303282d6c1298d7e2fe8"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1041 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":"compiler/rustc_borrowck/src/diagnostics/mod.rs"},"region":{"startLine":1041}}}],"partialFingerprints":{"codehealthFindingId/v1":"1da0b6f10cfeb79ecfaadd245e1f75c26c87a37d146afb6558f07b81fdb89187"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1083 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":"compiler/rustc_borrowck/src/diagnostics/mod.rs"},"region":{"startLine":1083}}}],"partialFingerprints":{"codehealthFindingId/v1":"07144d255a28b427d8e760faf3dbbd2163a9d9185bc3e748f31d326d4592f1e8"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1122 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":"compiler/rustc_borrowck/src/diagnostics/mod.rs"},"region":{"startLine":1122}}}],"partialFingerprints":{"codehealthFindingId/v1":"910b1afd0970a660c60b82f1f0f16ed2bef137d98c4fda1785263259026dd402"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1158 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":"compiler/rustc_borrowck/src/diagnostics/mod.rs"},"region":{"startLine":1158}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdd7f48a2bd9e3e2b2c29b1de85c27c2383f444c07dac075a2f177a42e5145ed"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1188 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":"compiler/rustc_borrowck/src/diagnostics/mod.rs"},"region":{"startLine":1188}}}],"partialFingerprints":{"codehealthFindingId/v1":"597f45a837cea1d26233afff464aa41fac240c576fd58515b9deac3eed7e04a2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1194 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":"compiler/rustc_borrowck/src/diagnostics/mod.rs"},"region":{"startLine":1194}}}],"partialFingerprints":{"codehealthFindingId/v1":"46954939c21b2cd51e9ebdd63537d2c476bd4e0e8921c036c717eec21212afd8"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1203 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":"compiler/rustc_borrowck/src/diagnostics/mod.rs"},"region":{"startLine":1203}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9635ff2c123dcd7c61af3da33fbdf2edc03dd6b67f590e41b519e6e2c06d547"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 197 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":"compiler/rustc_borrowck/src/diagnostics/move_errors.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"39eebceb81f676e4ff93ac9620ff080feab9e2f534fa3b5fbad0824bf504b5d5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 237 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":"compiler/rustc_borrowck/src/diagnostics/move_errors.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"73ea1848a740ec73ecd27b7c2d6116d8933713b960a382f8dc3c95861195be30"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 265 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":"compiler/rustc_borrowck/src/diagnostics/move_errors.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"be8f4517de8608360e6d27ea0f920809bba4f9972df599fac2d2708b3dd3ec66"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 485 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":"compiler/rustc_borrowck/src/diagnostics/move_errors.rs"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"c231d2dee099f45f59ed7a1c9e905f47b4251bd76917a58946786c8e00a0cc70"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 70 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":"compiler/rustc_borrowck/src/diagnostics/mutability_errors.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e4051e9990ba087798a2eb6812d526b2583358656ad80f26d626c74d0ebbfc2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 82 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":"compiler/rustc_borrowck/src/diagnostics/mutability_errors.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb8d53afd5974cb8c27077e8e5b25ee9c306db91aec07ee15fc6688f0ce2c742"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 208 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":"compiler/rustc_borrowck/src/diagnostics/mutability_errors.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3b87bf142948f350b5fb9d9e5942f31b2de619be4d96249039d1eba0f51edfc"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 282 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":"compiler/rustc_borrowck/src/diagnostics/mutability_errors.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"4288dd10dfc55cb7eaaf9435a3fcb7962549d0f276d356ef9cb69e85c8894f0e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 947 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":"compiler/rustc_borrowck/src/diagnostics/mutability_errors.rs"},"region":{"startLine":947}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed28399a5a2a6a2e4685a171aa1716edf5967311c76647c9b86804532ac9c5d1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1819 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":"compiler/rustc_borrowck/src/diagnostics/mutability_errors.rs"},"region":{"startLine":1819}}}],"partialFingerprints":{"codehealthFindingId/v1":"79f89ebaf4e372af6f33f53e5d37b4641040cfc04b80fc363bcca9cdba825577"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 64 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":"compiler/rustc_borrowck/src/diagnostics/outlives_suggestion.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"903012b89c6835bbefc402e06ecf7d00c2b0e9393b86659d3eeae5edfe91c1c8"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 143 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":"compiler/rustc_borrowck/src/diagnostics/outlives_suggestion.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"e63ddbbe3a2b7a4cd11016a54aa7d06bb75f653b859aac96b4664c7fad7fbc48"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 383 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":"compiler/rustc_borrowck/src/diagnostics/region_errors.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bd262f6785517442d91d9dd2117851f3229079e2226312ee8a52d16cd4cc003"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 612 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":"compiler/rustc_borrowck/src/diagnostics/region_errors.rs"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"5de5f529ec8abdfee9db380a29d350c8013657d82511eff46db1a47dd7e91d4a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 618 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":"compiler/rustc_borrowck/src/diagnostics/region_errors.rs"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"c983da037fd85f95c8f3f7c4af3b3087857ac465914966853aedc3315bb2eee8"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 637 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":"compiler/rustc_borrowck/src/diagnostics/region_errors.rs"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f499c0579148eafdd1d59d10fb9a6f27f407a4fc69dc1ab50b274817dc7f130"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 780 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":"compiler/rustc_borrowck/src/diagnostics/region_errors.rs"},"region":{"startLine":780}}}],"partialFingerprints":{"codehealthFindingId/v1":"c997f10236f18eb10b62586c75de298a7479050ac8b213611ccf458c87cbe362"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1282 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":"compiler/rustc_borrowck/src/diagnostics/region_errors.rs"},"region":{"startLine":1282}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb639e7987170b537ef263ed1fdec48f196b5436fca3559bba03b2dfcb2ad812"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1322 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":"compiler/rustc_borrowck/src/diagnostics/region_errors.rs"},"region":{"startLine":1322}}}],"partialFingerprints":{"codehealthFindingId/v1":"40447fe4b5bcc99d4dfca65da7b1751c18d874f990aedfd97e5b43a490c9bc33"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1328 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":"compiler/rustc_borrowck/src/diagnostics/region_errors.rs"},"region":{"startLine":1328}}}],"partialFingerprints":{"codehealthFindingId/v1":"4608b1948d6f588e9afc874ffb11efa657a6febcfe6d53e689be57661fa0a2a7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 261 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":"compiler/rustc_borrowck/src/diagnostics/region_name.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"9517c715e3c37997e28df6c995987e73fd3ac5fcc501c5daa513b74b17d1e7f4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 286 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":"compiler/rustc_borrowck/src/diagnostics/region_name.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"99dd21017ebd7a032057978307e57245aabffb61034c4b3909f5d6852c21b324"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 303 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":"compiler/rustc_borrowck/src/diagnostics/region_name.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2da21d4036368bad0e6f7baf3421535374e7e78ed32935538f9846815f09caf"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 446 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":"compiler/rustc_borrowck/src/diagnostics/region_name.rs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"ace2e3e6aba779a2b8c8a3c248b1580fb30de3b7c1da67cf8257e9dd5cf6912e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 463 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":"compiler/rustc_borrowck/src/diagnostics/region_name.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ca2411c7f206b4b2b0daa71d3e5f1b7d4f7e794601cc15c91cb4f34d561fa98"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 589 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":"compiler/rustc_borrowck/src/diagnostics/region_name.rs"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"fee7cb4790856cf1a0794d47af7ae8f0cae5f5e860fe12673ed88544c579dd3d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 818 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":"compiler/rustc_borrowck/src/diagnostics/region_name.rs"},"region":{"startLine":818}}}],"partialFingerprints":{"codehealthFindingId/v1":"01f2c85f686e6b4930cae40c4ebf1392bcc7086d93c335508c35229acb94f935"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1007 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":"compiler/rustc_borrowck/src/diagnostics/region_name.rs"},"region":{"startLine":1007}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca5db9fb413aa1da1ae7eec9c4bbcb914a423e4ed879c82f8128e6627b79dcc6"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1031 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":"compiler/rustc_borrowck/src/diagnostics/region_name.rs"},"region":{"startLine":1031}}}],"partialFingerprints":{"codehealthFindingId/v1":"88aa87785c42aabea0c1e07686a5e0888d596dbc7b0b24fa97c2ed422b25493a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 21 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":"compiler/rustc_borrowck/src/diagnostics/var_name.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"566ba4a807856bb905eaa755895d43e97ff64d7cde0a3362055478789e251578"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 39 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":"compiler/rustc_borrowck/src/diagnostics/var_name.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f4f2b0e76964bdbad77f07e28a8e43247ad047cd07fce199f3f4972f53b0dfd"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 54 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":"compiler/rustc_borrowck/src/diagnostics/var_name.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0c83925182d1c8671f99b65aba566b18872147c8b80c8c0f0a4951ee35d47fe"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 57 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":"compiler/rustc_borrowck/src/diagnostics/var_name.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"980c741d1ca33b82c59aa211644d2c0863eb18d55e8569cccd744fd800198738"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 64 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":"compiler/rustc_borrowck/src/diagnostics/var_name.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"48329a9e9c9aa0f96fb2c55eac5dea524a84678029330c1bd041ff64ff196b87"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 80 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":"compiler/rustc_borrowck/src/diagnostics/var_name.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e64af0b944abe7da55d409858347ecb9fb7fa7f8393de89877355d7f42b68fb"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 84 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":"compiler/rustc_borrowck/src/diagnostics/var_name.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"43e54f05897edf8d5184519c472072366681dae18b8e22fb528c99260e66cc5c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 105 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":"compiler/rustc_borrowck/src/diagnostics/var_name.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"47b319d82c077dbd0e8a3eb2187b1239b848aa8c6f29439b6ff3291c7c93dc04"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 110 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":"compiler/rustc_borrowck/src/diagnostics/var_name.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3826bcf114b7d9d22dca93888bed7a85203b8f81d16b33a3fc338fad0a09408"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 134 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":"compiler/rustc_borrowck/src/diagnostics/var_name.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebe3946ae3f7f16413ba2f8eaafc4a5d2346ef9df0088d42343a8e6e0f1335a0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 138 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":"compiler/rustc_borrowck/src/diagnostics/var_name.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ef4850b5d9facaad3dd10c95247f679202dfcaddcc9d9370e9d961d0630b546"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 25 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":"compiler/rustc_borrowck/src/constraints/mod.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a044171d7190933548a62cbfdfd03211cfcd5c077419294441c351406b1a1ee"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 58 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":"compiler/rustc_attr_ir/src/diagnostic.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdfc3f529390b18b700fd8254d50f6033f2b2dfc0a06f27cbb43c65acf4b2b50"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 67 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":"compiler/rustc_attr_ir/src/diagnostic.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"a95f14d0c7e9a78d1eb706ff1aa64aefbc01e0dbdeb8a98f7e8c33372d4fc656"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 70 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":"compiler/rustc_attr_ir/src/diagnostic.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"01350dea6b5ecba6f46ac0160510e43863f316b69e1b3733329c418aead42895"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 131 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":"compiler/rustc_ast_lowering/src/index.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"60663e1bd39409e7bca62ca3aeafb10ec10c4135ecf6f21a0220d4140c77283b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 846 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":"compiler/rustc_ast_lowering/src/lib.rs"},"region":{"startLine":846}}}],"partialFingerprints":{"codehealthFindingId/v1":"3639118359ce2c76644a41119b8b3fa11741ef20482052e52da5349b8ee8f857"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 3349 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":"compiler/rustc_ast_lowering/src/lib.rs"},"region":{"startLine":3349}}}],"partialFingerprints":{"codehealthFindingId/v1":"b39847bdffbb0362a2005b560a60330c7d70560e38fd92f98f69bc00fd6a4563"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 266 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":"compiler/rustc_ast_lowering/src/path.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"866b04ccf88854fc35916e589d1cdb2292f7efe7d474ed4e9d899e83870f08ce"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 407 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":"compiler/rustc_ast_lowering/src/path.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"02954034464d99590f53ba36b5689561b193916069a99439f5ec0fa3767b204d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 294 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":"compiler/rustc_ast/src/util/literal.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcc079ff2eea4fbf1cd33431a89607f7ae7362c88acfba71419669d039f70377"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 314 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":"compiler/rustc_ast/src/util/literal.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffbce2a5f76f11470a63e1b374f44d982d6b41fd65a86fd65d3e616c19344fc9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 319 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":"compiler/rustc_ast/src/util/literal.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"f75c1fb055d716b4a5c8b7f41b71ab0eb34bce680db6dab7dbefa2ce33f97f72"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 319 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":"compiler/rustc_abi/src/layout.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"5de77bdae531576ca73deafa7b4860db802c07e442d2e09256e95abd7327cf72"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 785 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":"compiler/rustc_abi/src/layout.rs"},"region":{"startLine":785}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea46be1734a956d859fe8df4592a63a98019e09f7b6f4ca7ac878ae0dfe60469"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 816 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":"compiler/rustc_abi/src/layout.rs"},"region":{"startLine":816}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b7dc4ee02854fe6a2def18f03365b21832cafc539c15a85fd08dc8bf17d9d81"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\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: \u0060trace!(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":"compiler/rustc_abi/src/layout/coroutine.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"685ec569345935307768ae9ab3babc685014f60da205f0250a0663ec5e8ba08a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 103 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: \u0060trace!(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":"compiler/rustc_abi/src/layout/coroutine.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c0faaf4c859a24751c0647898735801e4c41726d2427fcb0c4fcc223c867626"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 133 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":"compiler/rustc_abi/src/layout/coroutine.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"8837b4ef3c0da1f9a0d855f511a0df6a168b2209547a782558afbb3bea2ff0c4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 186 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":"compiler/rustc_abi/src/layout/coroutine.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"943f2687764fbd4325bfb8b66b67ea919e261bf96ba3f2013bf26e4febe66e64"}},{"ruleId":"X5","level":"note","message":{"text":"Null assertions (\u0060!\u0060) override strict null checking: ~1.7 \u0060!\u0060 null assertions per 1k TypeScript source lines \u2014 12 assertion(s) across the 7036 source line(s) of the 19 TypeScript file(s) read, which is the only code the operator asserts anything in (a \u0060!\u0060 in a \u0060.js\u0060 file is not this operator and was not counted, and one in a file whose null checking is off silences nothing). Densest: src/tools/rust-analyzer/editors/code/src/dependencies_provider.ts (3), src/tools/rust-analyzer/editors/code/src/client.ts (2), src/tools/rust-analyzer/editors/code/src/commands.ts (2). Each one tells the compiler to trust the author about null, suppressing the very diagnostic \u0060strictNullChecks\u0060 exists to produce. Many are correct: each is a claim the checker could not verify, and it is wrong only where the value can in fact be missing, so review the densest places first."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"1d83a7c69636a6290f63000d5c19b2073be1fa772f51977532af9ca6f745fc2a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060get_fields\u0060 returns \u0060[]\u0060 when \u0060TypeError\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/etc/debugger_tester/gdb/from_gdb.py"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"15d10163d09fe5fd710f23d6a1306d69050423ad323f5adaa1c69eb9c89f6cc6"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060to_string\u0060 swallows every exception into \u0060return \u0027\u003CSmolStr: missing __0\u003E\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/lib/smol_str/src/gdb_smolstr_printer.py"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"f973c70bf6bf44cad9b22f35da95d631634289496025994336dbc5dc5842c4ef"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060demangle_callback\u0060 (in \u0060codegen\u0060) turns every \u0060Err\u0060 into \u00600\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/back/write.rs"},"region":{"startLine":1051}}}],"partialFingerprints":{"codehealthFindingId/v1":"993efb83aa26d8576a2fd1a8a17fd44b8a9c0c9ebf0e28df8bbfd57817770d5f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060print_disambiguation_help\u0060 turns every \u0060Err\u0060 into \u0060\u0022_\u0022.to_owned()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/method/suggest.rs"},"region":{"startLine":5038}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c348c748f8d0dee43dd31e8380fb20ebd8d720b344c207998ed5edb1b236c8f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060gen_args\u0060 turns every \u0060Err\u0060 into \u0060\u0022_\u0022.into()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_lint/src/disallowed_pass_by_ref.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"86cba19467608e33ff77a0a763e1e7f72e122c693f6578716f7b0d1bcb6d95c3"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060thir_tree\u0060 turns every \u0060Err\u0060 into \u0060\u0022error\u0022.into()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_build/src/thir/print.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"cac5ff119cbbff03654aefd95b7bf0a783b5847d04170f7fe0e3fcef4e52c4c2"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060thir_flat\u0060 turns every \u0060Err\u0060 into \u0060\u0022error\u0022.into()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_build/src/thir/print.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"e41069540bb859474ca5befcb507a55f457853961d54f97c6a1feb53522064a0"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060record_elided_lifetimes\u0060 (in \u0060visit_qpath\u0060) turns every \u0060Err\u0060 into \u0060\u0022..\u0022.to_string()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/error_reporting/infer/nice_region_error/trait_impl_difference.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e2cf9c7a424213d290d3b14cc1a7b9cd03e68c7793c38015b3e2c5a3a1d7ef1"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060suggest_param_env_shadowing\u0060 turns every \u0060Err\u0060 into \u0060false\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/error_reporting/infer/mod.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"a84d6c78b4a1db24d83fb9c8ee7e3584ef89516ca719f1370707320f37c699c6"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060compute_applicable_impls_for_diagnostics\u0060 turns every \u0060Err\u0060 into \u0060false\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/error_reporting/traits/ambiguity.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"b77bbe33f7d2c7e181319d1b5ef1d1a3aed66aba678eccafb00048939710aebf"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060implied_outlives_bounds\u0060 turns every \u0060Err\u0060 into \u0060vec![]\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/traits/outlives_bounds.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"a32ca13e952831ff9aef69970af1756a3f15c2f3cd0d6f089f2ff4ebff4632ac"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060filter_array_elements\u0060 turns every \u0060Err\u0060 into \u0060true\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ty_utils/src/needs_drop.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad9d51a2314438f5d73154696d2f3627522af6147f228d1dd39d5a9f43a034c6"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060filter_array_elements_async\u0060 turns every \u0060Err\u0060 into \u0060true\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ty_utils/src/needs_drop.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"c02c5fc7bdf028d16f0f1194fea1b8fb0324b7e799ec0d0dc7da33a69101d390"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060args\u0060 turns every \u0060Err\u0060 into \u0060OsString::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/args/windows.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba8c87939a3df599ec3a481475510a77d5efa2fe273d905479bbd4bd060fb01a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060run_spawn_hooks\u0060 turns every \u0060Err\u0060 into \u0060ChildSpawnHooks::default()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/thread/spawnhook.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"10cfcd94a78a47edc8baf6d55dea15826c0293d3081649c4b787d1f17127733f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060toolstate_repo\u0060 turns every \u0060Err\u0060 into \u0060\u0022https://github.com/rust-lang-nursery/rust-toolstate.git\u0022.to_string()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/build_steps/toolstate.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"897bfa12a91daab02de5a7152d4765325fa9cc0f52700071f38bcaacb85f19aa"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060hack_get_external_crate_names\u0060 turns every \u0060Err\u0060 into \u0060Ok(Vec::default())\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/render/write_shared.rs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"97b00a0e707e535267edaab853125ec0c9714013fa356cf6e03f722915e9f297"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060parse_rustc_verbose\u0060 turns every \u0060Err\u0060 into \u00600\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shim_utils/src/shared_helpers.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"407c59685acfeedcb9d3e77288715cce61ee64ad737f6463eb9da8c37865450e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060target_dir\u0060 turns every \u0060Err\u0060 into \u0060\u0022target\u0022.to_owned()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/lintcheck/src/main.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"eab71279ef7ad563143fa38d771795fbd8f8f142a11ce2f40ca66a107a432ae0"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060params\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir/src/lib.rs"},"region":{"startLine":3050}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f04c302f38c4d21200b738831076865d28c08f3788d50098405a161e068775f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060lifetime_params\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir/src/lib.rs"},"region":{"startLine":3070}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c1f57be71a83252dd8887908ad6d254b68e21ca76971da328a9200b0a1f8740"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060type_or_const_params\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir/src/lib.rs"},"region":{"startLine":3082}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d23471ad87716a789f5505e6186e20d572666ed1264b83064dd9ea54438cade"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060get_unsafe_ops\u0060 turns every \u0060Err\u0060 into \u0060Default::default()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir/src/semantics.rs"},"region":{"startLine":1981}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dbdcce39b39a12f051187b0c918b95664b8af162a16a8639ec38d0e8be8af81"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060opaque_types_defined_by\u0060 turns every \u0060Err\u0060 into \u0060SolverDefIds::default()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/next_solver/interner.rs"},"region":{"startLine":1795}}}],"partialFingerprints":{"codehealthFindingId/v1":"31a7ec578d1d7d483b34d26795f5c758491343269299adb443f0878b100cd0a1"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060opaque_types_and_coroutines_defined_by\u0060 turns every \u0060Err\u0060 into \u0060SolverDefIds::default()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/next_solver/interner.rs"},"region":{"startLine":1806}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dbaf3731d806caa25b43608aa17f0fa9167571e681da9d0ba5562769a98bc1c"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060type_to_string\u0060 turns every \u0060Err\u0060 into \u0060\u0022_\u0022.to_owned()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/utils.rs"},"region":{"startLine":771}}}],"partialFingerprints":{"codehealthFindingId/v1":"1393cb0b7d7ab3f53577b1c29b73f8a85e4bc085ddffe7107d9fd72a0d94b09e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060spawn\u0060 turns every \u0060Err\u0060 into \u0060\u0022unknown version\u0022.to_owned()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/proc-macro-api/src/process.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"4892ddb6cb439383e9d82ed1542760ad6c3ef745d8559ae5364f658002a127d1"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060location_csv_expr\u0060 turns every \u0060Err\u0060 into \u0060\u0022synthetic,,\u0022.to_owned()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/cli/analysis_stats.rs"},"region":{"startLine":1501}}}],"partialFingerprints":{"codehealthFindingId/v1":"534a2796d941a88c36f3ebc3a67af225566c11631cdb9e7dd09e2d11ece1c891"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060location_csv_pat\u0060 turns every \u0060Err\u0060 into \u0060\u0022synthetic,,\u0022.to_owned()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/cli/analysis_stats.rs"},"region":{"startLine":1517}}}],"partialFingerprints":{"codehealthFindingId/v1":"3950df0ab14423f239fffb18d46132552d46c1a816416c0a1c889a0c60f836ba"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060read_rustfmt_ignore_list\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/check_diff/src/lib.rs"},"region":{"startLine":698}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a3185cbcd24004d11048c029b0ad18f6961476ee4b34e3cd538de18707c757a"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060filename.contains(\u0022rustc_public_bridge\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060filename.contains(\u0022rustc_public_bridge\u0022)\u0060 also satisfies \u0060filename.contains(\u0022rustc_public\u0022)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/build_steps/compile.rs"},"region":{"startLine":1162}}}],"partialFingerprints":{"codehealthFindingId/v1":"611c5fa6286e8e58c75144323c72e77690fc2a81fde48069a69b472e7ec851d7"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060name.ends_with(\u0022nq\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060name.ends_with(\u0022nq\u0022)\u0060 also satisfies \u0060name.ends_with(\u0022q\u0022)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/stdarch-gen-hexagon/src/hvx.rs"},"region":{"startLine":1384}}}],"partialFingerprints":{"codehealthFindingId/v1":"792913a2ec7200426fbcacc11ace3bb22799a430c0ea657252d9c36f5c521ef8"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1032","guid":"5f21e517-68aa-a650-9a25-5771ef024637","name":"OWASP Top Ten \u2014 Security Misconfiguration category","shortDescription":{"text":"OWASP Top Ten \u2014 Security Misconfiguration category"},"helpUri":"https://cwe.mitre.org/data/definitions/1032.html"},{"id":"CWE-1104","guid":"4c918cb5-b2a6-6c55-9963-a44ee464305e","name":"Use of Unmaintained Third Party Components","shortDescription":{"text":"Use of Unmaintained Third Party Components"},"helpUri":"https://cwe.mitre.org/data/definitions/1104.html"},{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-16","guid":"659db3ea-affc-8453-8add-c1218fbfcb92","name":"Configuration","shortDescription":{"text":"Configuration"},"helpUri":"https://cwe.mitre.org/data/definitions/16.html"},{"id":"CWE-191","guid":"31b5d115-a84b-875f-a016-48689827db3c","name":"CWE-191","shortDescription":{"text":"CWE-191"},"helpUri":"https://cwe.mitre.org/data/definitions/191.html"},{"id":"CWE-214","guid":"b10ad120-fb22-1351-9348-aa23b453e815","name":"CWE-214","shortDescription":{"text":"CWE-214"},"helpUri":"https://cwe.mitre.org/data/definitions/214.html"},{"id":"CWE-248","guid":"64b58946-d244-a556-a48a-f82fcd4f4186","name":"Uncaught Exception","shortDescription":{"text":"Uncaught Exception"},"helpUri":"https://cwe.mitre.org/data/definitions/248.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-319","guid":"7af97476-9f0d-4458-9163-3d2043918a1a","name":"Cleartext Transmission of Sensitive Information","shortDescription":{"text":"Cleartext Transmission of Sensitive Information"},"helpUri":"https://cwe.mitre.org/data/definitions/319.html"},{"id":"CWE-345","guid":"d80d4b65-bbbe-b65d-958e-7ac466af18f9","name":"Insufficient Verification of Data Authenticity","shortDescription":{"text":"Insufficient Verification of Data Authenticity"},"helpUri":"https://cwe.mitre.org/data/definitions/345.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-527","guid":"79b27cde-9d04-1a54-b64b-d5bb9b4a8ee7","name":"CWE-527","shortDescription":{"text":"CWE-527"},"helpUri":"https://cwe.mitre.org/data/definitions/527.html"},{"id":"CWE-532","guid":"1cd8877a-76e8-ce54-b40b-779af23364a0","name":"Insertion of Sensitive Information into Log File","shortDescription":{"text":"Insertion of Sensitive Information into Log File"},"helpUri":"https://cwe.mitre.org/data/definitions/532.html"},{"id":"CWE-538","guid":"3baa1f05-df1b-ae58-9ee0-1d790ff4a989","name":"Insertion of Sensitive Information into Externally-Accessible File or Directory","shortDescription":{"text":"Insertion of Sensitive Information into Externally-Accessible File or Directory"},"helpUri":"https://cwe.mitre.org/data/definitions/538.html"},{"id":"CWE-540","guid":"1a9db5db-e5bb-ae5d-935a-d1b4e9ee080b","name":"Inclusion of Sensitive Information in Source Code","shortDescription":{"text":"Inclusion of Sensitive Information in Source Code"},"helpUri":"https://cwe.mitre.org/data/definitions/540.html"},{"id":"CWE-611","guid":"1afbae66-ea29-2d59-aaa2-134e3ae2e85a","name":"Improper Restriction of XML External Entity Reference","shortDescription":{"text":"Improper Restriction of XML External Entity Reference"},"helpUri":"https://cwe.mitre.org/data/definitions/611.html"},{"id":"CWE-732","guid":"1da27e8f-b330-7650-ab63-bd61953eae5d","name":"Incorrect Permission Assignment for Critical Resource","shortDescription":{"text":"Incorrect Permission Assignment for Critical Resource"},"helpUri":"https://cwe.mitre.org/data/definitions/732.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A01:2025","guid":"df693558-c822-0452-8f7b-4d53cb6bcc59","name":"Broken Access Control","shortDescription":{"text":"Broken Access Control"},"helpUri":"https://top10.owasp.org/2025/A01_2025-Broken_Access_Control/"},{"id":"A02:2025","guid":"668dee9e-41bc-6354-97d0-fdf8f40c50c1","name":"Security Misconfiguration","shortDescription":{"text":"Security Misconfiguration"},"helpUri":"https://top10.owasp.org/2025/A02_2025-Security_Misconfiguration/"},{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A04:2025","guid":"6a9f5bfd-1a56-6453-beec-a7eff0ba3007","name":"Cryptographic Failures","shortDescription":{"text":"Cryptographic Failures"},"helpUri":"https://top10.owasp.org/2025/A04_2025-Cryptographic_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"},{"id":"A09:2025","guid":"78892bc9-3c98-495d-881c-8af1390d643c","name":"Security Logging \u0026 Alerting Failures","shortDescription":{"text":"Security Logging \u0026 Alerting Failures"},"helpUri":"https://top10.owasp.org/2025/A09_2025-Security_Logging_and_Alerting_Failures/"},{"id":"A10:2025","guid":"9ca3ab55-ca61-fd5e-b9ab-3dad2efa59d0","name":"Mishandling of Exceptional Conditions","shortDescription":{"text":"Mishandling of Exceptional Conditions"},"helpUri":"https://top10.owasp.org/2025/A10_2025-Mishandling_of_Exceptional_Conditions/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-3","guid":"458c83a6-ebf7-cf55-8cc3-b4d949bbf271","name":"Dependency Chain Abuse","shortDescription":{"text":"Dependency Chain Abuse"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-03-Dependency-Chain-Abuse"},{"id":"CICD-SEC-4","guid":"c859d8ea-8b24-a157-9406-94929c10397a","name":"Poisoned Pipeline Execution (PPE)","shortDescription":{"text":"Poisoned Pipeline Execution (PPE)"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-04-Poisoned-Pipeline-Execution"},{"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":357,"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."]}]}